Добірка наукової літератури з теми "Matrix partitions"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Matrix partitions".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Matrix partitions"
Li, Yu, Jianfeng Wu, Chunfu Lu, Zhichuan Tang, and Chengmin Li. "Pillow Support Model with Partitioned Matching Based on Body Pressure Distribution Matrix." Healthcare 9, no. 5 (May 12, 2021): 571. http://dx.doi.org/10.3390/healthcare9050571.
Повний текст джерелаAdm, Mohammad, Shaun Fallat, Karen Meagher, Shahla Nasserasr, Sarah Plosker, and Boting Yang. "Achievable multiplicity partitions in the inverse eigenvalue problem of a graph." Special Matrices 7, no. 1 (January 1, 2019): 276–90. http://dx.doi.org/10.1515/spma-2019-0022.
Повний текст джерелаAlexandrov, A. "Matrix models for random partitions." Nuclear Physics B 851, no. 3 (October 2011): 620–50. http://dx.doi.org/10.1016/j.nuclphysb.2011.06.007.
Повний текст джерелаFeder, Tomás, and Pavol Hell. "Matrix partitions of perfect graphs." Discrete Mathematics 306, no. 19-20 (October 2006): 2450–60. http://dx.doi.org/10.1016/j.disc.2005.12.035.
Повний текст джерелаFeder, Tomás, Pavol Hell, and Oren Shklarsky. "Matrix partitions of split graphs." Discrete Applied Mathematics 166 (March 2014): 91–96. http://dx.doi.org/10.1016/j.dam.2013.10.016.
Повний текст джерелаChen, Ji Wen, Jin Sheng Zhang, Zhi Wang, and Jing Kun Wang. "Function Module Dynamic Partition for Product Innovation Design." Applied Mechanics and Materials 58-60 (June 2011): 2095–100. http://dx.doi.org/10.4028/www.scientific.net/amm.58-60.2095.
Повний текст джерелаLi, Yimeng, Marcello Ruta, and Matthew A. Wills. "Craniodental and Postcranial Characters of Non-Avian Dinosauria Often Imply Different Trees." Systematic Biology 69, no. 4 (November 26, 2019): 638–59. http://dx.doi.org/10.1093/sysbio/syz077.
Повний текст джерелаGöbel, Andreas, Leslie Ann Goldberg, Colin McQuillan, David Richerby, and Tomoyuki Yamakami. "Counting List Matrix Partitions of Graphs." SIAM Journal on Computing 44, no. 4 (January 2015): 1089–118. http://dx.doi.org/10.1137/140963029.
Повний текст джерелаEynard, B. "A matrix model for plane partitions." Journal of Statistical Mechanics: Theory and Experiment 2009, no. 10 (October 15, 2009): P10011. http://dx.doi.org/10.1088/1742-5468/2009/10/p10011.
Повний текст джерелаStrahov, Eugene. "Matrix Kernels for Measures on Partitions." Journal of Statistical Physics 133, no. 5 (November 11, 2008): 899–919. http://dx.doi.org/10.1007/s10955-008-9641-9.
Повний текст джерелаДисертації з теми "Matrix partitions"
Bagatini, Alessandro. "Matrix representation for partitions and Mock Theta functions." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/150232.
Повний текст джерелаIn this work, based on representations by matrices of two lines for some kind of partition (some already known and other new ones), we identify properties suggested by classifying them according to the sum of its second line. This sum always provides some properties of the related partition. If we consider unsigned versions of some Mock Theta Functions, its general term can be interpreted as generating function for some kind of partition with restrictions. To come back to the original coefficients, you can set a weight for each array and so add them to evaluate the coefficients. An analogous representation for partitions allows us to observe properties, again by classificating them according to the sum of its elements on the second row. This classification is made by means of tables created by mathematical software Maple, which suggest patterns, identities related to other known types of partitions and often, finding a closed formula to count them. Having established conjectured identities, all are proved by bijections between sets or counting methods.
Quéré, Romain. "Quelques propositions pour la comparaison de partitions non strictes." Phd thesis, Université de La Rochelle, 2012. http://tel.archives-ouvertes.fr/tel-00950514.
Повний текст джерелаMatte, Marília Luiza. "Matrix representations for integer partitions : some consequences and a new approach." Universidade Federal do Rio Grande do Sul, 2018. http://hdl.handle.net/10183/178603.
Повний текст джерелаBas, Erdeniz Ozgun. "Load-Balancing Spatially Located Computations using Rectangular Partitions." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306909831.
Повний текст джерелаBellissimo, Michael Robert. "A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK." University of Akron / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649.
Повний текст джерелаBarsukov, Alexey. "On dichotomy above Feder and Vardi's logic." Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2022. https://tel.archives-ouvertes.fr/tel-04100704.
Повний текст джерелаA subset of NP is said to have a dichotomy if it contains problem that are either solvable in P-time or NP-complete. The class of finite Constraint Satisfaction Problems (CSP) is a well-known subset of NP that follows such a dichotomy. The complexity class NP does not have a dichotomy unless P = NP. For both of these classes there exist logics that are associated with them. -- NP is captured by Existential Second-Order (ESO) logic by Fagin's theorem, i.e., a problem is in NP if and only if it is expressible by an ESO sentence.-- CSP is a subset of Feder and Vardi's logic, Monotone Monadic Strict NP without inequalities (MMSNP), and for every MMSNP sentence there exists a P-time equivalent CSP problem. This implies that ESO does not have a dichotomy as well as NP, and that MMSNP has a dichotomy as well as CSP. The main objective of this thesis is to study subsets of NP that strictly contain CSP or MMSNP with respect to the dichotomy existence.Feder and Vardi proved that if we omit one of the three properties that define MMSNP, namely being monotone, monadic or omitting inequalities, then the resulting logic does not have a dichotomy. As their proofs remain sketchy at times, we revisit these results and provide detailed proofs. Guarded Monotone Strict NP (GMSNP) is a known extension of MMSNP that is obtained by relaxing the "monadic" restriction of MMSNP. We define similarly a new logic that is called MMSNP with Guarded inequalities, relaxing the restriction of being "without inequalities". We prove that it is strictly more expressive than MMSNP and that it also has a dichotomy.There is a logic MMSNP₂ that extends MMSNP in the same way as MSO₂ extends Monadic Second-Order (MSO) logic. It is known that MMSNP₂ is a fragment of GMSNP and that these two classes either both have a dichotomy or both have not. We revisit this result and strengthen it by proving that, with respect to having a dichotomy, without loss of generality, one can consider only MMSNP₂ problems over one-element signatures, instead of GMSNP problems over arbitrary finite signatures.We seek to prove the existence of a dichotomy for MMSNP₂ by finding, for every MMSNP₂ problem, a P-time equivalent MMSNP problem. We face some obstacles to build such an equivalence. However, if we allow MMSNP sentences to consist of countably many negated conjuncts, then we prove that such an equivalence exists. Moreover, the corresponding infinite MMSNP sentence has a property of being "regular". This regular property means that, in some sense, this sentence is still finite. It is known that regular MMSNP problems can be expressed by CSP on omega-categorical templates. Also, there is an algebraic dichotomy characterisation for omega-categorical CSPs that describe MMSNP problems. If one manages to extend this algebraic characterisation onto regular MMSNP, then our result would provide an algebraic dichotomy for MMSNP₂.Another potential way to prove the existence of a dichotomy for MMSNP₂ is to mimic the proof of Feder and Vardi for MMSNP. That is, by finding a P-time equivalent CSP problem. The most difficult part there is to reduce a given input structure to a structure of sufficiently large girth. For MMSNP and CSP, it is done using expanders, i.e., structures, where the distribution of tuples is close to a uniform distribution. We study this approach with respect to MMSNP₂ and point out the main obstacles. (...)
Acosta, Jaramillo Enrique. "Leading Order Asymptotics of a Multi-Matrix Partition Function for Colored Triangulations." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/293410.
Повний текст джерелаShahzad, Yasser. "Micellar chromatographic partition coefficients and their application in predicting skin permeability." Thesis, University of Huddersfield, 2013. http://eprints.hud.ac.uk/id/eprint/23480/.
Повний текст джерелаThüne, Mario. "Eigenvalues of Matrices and Graphs." Doctoral thesis, Universitätsbibliothek Leipzig, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-120713.
Повний текст джерелаYoung, Barrington R. St A. "Efficient Algorithms for Data Mining with Federated Databases." University of Cincinnati / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1179332091.
Повний текст джерелаКниги з теми "Matrix partitions"
Claudio, Procesi, ed. Topics in hyperplane arrangements, polytopes and box-splines. New York: Springer, 2011.
Знайти повний текст джерелаKeating, Jon, and Nina Snaith. Random permutations and related topics. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.25.
Повний текст джерелаConcini, Corrado De, and Claudio Procesi. Topics in Hyperplane Arrangements, Polytopes and Box-Splines. Springer London, Limited, 2010.
Знайти повний текст джерелаGuhr, Thomas. Replica approach in random matrix theory. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.8.
Повний текст джерелаMarino, Marcos. Quantum chromodynamics. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.32.
Повний текст джерелаЧастини книг з теми "Matrix partitions"
Abed, Fidaa, Ioannis Caragiannis, and Alexandros A. Voudouris. "Near-Optimal Asymmetric Binary Matrix Partitions." In Mathematical Foundations of Computer Science 2015, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48054-0_1.
Повний текст джерелаBrietzke, Eduardo H. M., José Plínio O. Santos, and Robson da Silva. "Bijective proofs using two-line matrix representations for partitions." In Combinatory Analysis, 263–93. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-7858-4_17.
Повний текст джерелаBirk, David E., and Robert L. Trelstad. "Metazoan Mesenchyme Partitions the Extracellular Space During Matrix Morphogenesis." In Biology of Invertebrate and Lower Vertebrate Collagens, 103–14. Boston, MA: Springer US, 1985. http://dx.doi.org/10.1007/978-1-4684-7636-1_9.
Повний текст джерелаHackbusch, Wolfgang. "Matrix Partition." In Hierarchical Matrices: Algorithms and Analysis, 83–116. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47324-5_5.
Повний текст джерелаHarville, David A. "Submatrices and Partitioned Matrices." In Matrix Algebra: Exercises and Solutions, 7–10. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4613-0181-3_2.
Повний текст джерелаAlon, Noga, Michal Feldman, Iftah Gamzu, and Moshe Tennenholtz. "The Asymmetric Matrix Partition Problem." In Web and Internet Economics, 1–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45046-4_1.
Повний текст джерелаHarville, David A. "Submatrices and Partitioned Matrices." In Matrix Algebra From a Statistician’s Perspective, 13–22. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/0-387-22677-x_2.
Повний текст джерелаKuang, Da, Jaegul Choo, and Haesun Park. "Nonnegative Matrix Factorization for Interactive Topic Modeling and Document Clustering." In Partitional Clustering Algorithms, 215–43. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09259-1_7.
Повний текст джерелаPuntanen, Simo, George P. H. Styan, and Jarkko Isotalo. "Nonnegative Definiteness of a Partitioned Matrix." In Matrix Tricks for Linear Statistical Models, 305–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-10473-2_15.
Повний текст джерелаPuntanen, Simo, George P. H. Styan, and Jarkko Isotalo. "Rank of the Partitioned Matrix and the Matrix Product." In Matrix Tricks for Linear Statistical Models, 121–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-10473-2_6.
Повний текст джерелаТези доповідей конференцій з теми "Matrix partitions"
Kang, Zhao, Zipeng Guo, Shudong Huang, Siying Wang, Wenyu Chen, Yuanzhang Su, and Zenglin Xu. "Multiple Partitions Aligned Clustering." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/375.
Повний текст джерелаSankhavara, C. D., and H. J. Shukla. "Influence of Partition Location on Natural Convection in a Partitioned Enclosure." In ASME 2005 Summer Heat Transfer Conference collocated with the ASME 2005 Pacific Rim Technical Conference and Exhibition on Integration and Packaging of MEMS, NEMS, and Electronic Systems. ASMEDC, 2005. http://dx.doi.org/10.1115/ht2005-72093.
Повний текст джерелаGobel, Andreas, Leslie Ann Goldberg, Colin McQuillan, David Richerby, and Tomoyuki Yamakami. "Counting List Matrix Partitions of Graphs." In 2014 IEEE Conference on Computational Complexity (CCC). IEEE, 2014. http://dx.doi.org/10.1109/ccc.2014.14.
Повний текст джерелаPatton, Stephen, Hamidreza Khaleghzadeh, Ravi Reddy Manumachu, and Alexey Lastovetsky. "SummaGen: Parallel Matrix-Matrix Multiplication Based on Non-rectangular Partitions for Heterogeneous HPC Platforms." In 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2019. http://dx.doi.org/10.1109/ipdpsw.2019.00017.
Повний текст джерелаDerrico, Joel B., and Gershon Buchsbaum. "Image compression application of a simultaneous Karhunen-Loeve transformation in space and color." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/oam.1989.fc3.
Повний текст джерелаQiu, Chen, and Jian S. Dai. "Constraint Stiffness Construction and Decomposition of a SPS Orthogonal Parallel Mechanism." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-46811.
Повний текст джерелаFabregat-Traver, Diego, Paolo Bientinesi, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "Automatic Generation of Partitioned Matrix Expressions for Matrix Operations." In ICNAAM 2010: International Conference of Numerical Analysis and Applied Mathematics 2010. AIP, 2010. http://dx.doi.org/10.1063/1.3498598.
Повний текст джерелаSugino, Fumihiko. "U-duality from matrix membrane partition function." In STRING THEORY; 10th Tohwa University International Symposium on String Theory. AIP, 2002. http://dx.doi.org/10.1063/1.1454380.
Повний текст джерелаChou, Chiu-Chih, Thong Nguyen, and Jose E. Schutt-Aine. "Impact of Partition Schemes in Loewner Matrix Macromodeling." In 2020 IEEE Electrical Design of Advanced Packaging and Systems (EDAPS). IEEE, 2020. http://dx.doi.org/10.1109/edaps50281.2020.9312918.
Повний текст джерелаAdi, Prajanto Wahyu, and Pramudi Arsiwi. "Fast and Robust Watermarking Method using Walsh Matrix Partition." In 2019 International Seminar on Research of Information Technology and Intelligent Systems (ISRITI). IEEE, 2019. http://dx.doi.org/10.1109/isriti48646.2019.9034627.
Повний текст джерелаЗвіти організацій з теми "Matrix partitions"
Brenan, J. M., K. Woods, J. E. Mungall, and R. Weston. Origin of chromitites in the Esker Intrusive Complex, Ring of Fire Intrusive Suite, as revealed by chromite trace element chemistry and simple crystallization models. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328981.
Повний текст джерела