Dissertations / Theses on the topic 'Matrix'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Matrix.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Vieira, Ewerton Rocha 1987. "Transition matrix theory = Teoria da matriz de transição." [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307536.
Full textTese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica
Made available in DSpace on 2018-08-26T22:09:01Z (GMT). No. of bitstreams: 1 Vieira_EwertonRocha_D.pdf: 1632095 bytes, checksum: 5dc3208efc5649260ca62805c3e8e1b6 (MD5) Previous issue date: 2015
Resumo: Nessa tese, apresentamos uma unificação da teoria das matrizes de transição algébrica, singular, topológica e direcional ao introduzir a matriz de transição (generalizada), a qual engloba todas as quatros citadas anteriormente. Alguns resultados de existência são apresentados bem como a verificação de que cada matriz de transição supracitada são casos particulares da matriz de transição (generalizada). Além disso, nós abordamos como as aplicações das quatros matrizes de transiçao, na teoria do índice de Conley, se traduzem para a matriz de transição (generalizada). Quando a matriz de transição (generalizada) satisfizer o requerimento adicional de cobrir o isomorfismo do índice de Conley F definido pelo fluxo, pode-se provar propriedades de existência e de conexão de órbitas. Essa matriz de transição com a propriedade de cobrir o isomorfismo F é definida como matriz de transição topológica generalizada e a utilizamos para obter conexões de órbitas num fluxo Morse-Smale sem órbitas periódicas bem como para obter conexões de órbitas numa continuação associada à sequência espectral dinâmica
Abstract: In this thesis, we present a unification of the theory of algebraic, singular, topological and directional transition matrices by introducing the (generalized) transition matrix which encompasses each of the previous four. Some transition matrix existence results are presented as well as the verification that each of the previous transition matrices are cases of the (generalized) transition matrix. Furthermore, we address how applications of the previous transition matrices to the Conley Index theory carry over to the (generalized) transition matrix. When this more general transition matrix satisfies the additional requirement that it covers flow-defined Conley-index isomorphisms, one proves algebraic and connection-existence properties. These general transition matrices with this covering property are referred to as generalized topological transition matrices and are used to consider connecting orbits of Morse-Smale flows without periodic orbits, as well as those in a continuation associated to a dynamical spectral sequence
Doutorado
Matematica
Doutor em Matemática
Messent, Anthea Jane. "Novel roles for matix metalloproteinases in cell-matrix interactions." Thesis, Open University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.242514.
Full textFriberg, Adam. "Matrix Integrals : Calculating Matrix Integrals Using Feynman Diagrams." Thesis, Uppsala universitet, Teoretisk fysik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227928.
Full textI detta projekt undersöker vi hur integration över matriser genomförs. Vi undersöker och utvecklar en metod för beräkning av matrisintegraler över mängden av alla reell-värda kvadratiska matriser. Matrisintegraler används för beräkningar i ett flertal olika områden inom fysik och matematik, till exempel kvantfältteori, strängteori, kvantkromodynamik och slumpmatristeori. Vår metod består av sätt att applicera perturbativa Taylorutvecklingar på matrisintegralerna, reducera varje term i den resulterande Taylorserien till ett kombinatoriellt problem med hjälp av Wicks sats, och att representera termerna i Wicksumman grafiskt med hjälp av Feynmandiagram. Vi använder metoden i några exempel som syftar till att klart demonstrera hur beräkningen av matrisintegraler går till.
Kunchum, Rakshith. "On Improving Sparse Matrix-Matrix Multiplication on GPUs." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1492694387445938.
Full textMunro, Christopher James. "Algorithms for matrix polynomials and structured matrix problems." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/algorithms-for-matrix-polynomials-and-structured-matrix-problems(9154f9f0-8b86-46f8-8066-40c5139fcc51).html.
Full textRife, Susan A. "Matrix algebra." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA316035.
Full textMcGinn, Bonnie Gay. "Creative Matrix." VCU Scholars Compass, 2007. http://hdl.handle.net/10156/1366.
Full textDelatorre, Anthony R., and William K. Cooke. "Matrix algebra." Thesis, Monterey, California. Naval Postgraduate School, 1998. http://hdl.handle.net/10945/8658.
Full textThis thesis is designed to act as an instructor's supplement for refresher matrix algebra courses at the Naval Postgraduate School (NPS). The need for a beginning matrix algebra supplement is driven by the unique circumstances of most NPS students. Most military students attend XPS several years after receiving their undergraduate degrees. This supplement, unlike most college textbooks, bridges the gap between the student's educational lay-off and the rigors of mathematically oriented degrees such as applied math, operations research and engineering. By reviewing the fundamental concepts of vectors and matrices, and performing basic operations with them, the student quickly develops the background needed in NPS's demanding curriculums. This supplement focuses on matrix and vector operations, linear transformations, systems of linear equations, and computational techniques for solving systems of linear equations. The goal is to enhance current matrix algebra textbooks and help the beginning student build a foundation for higher level engineering and mathematics based courses.
Johansson, Isak, and Eriksson Jonas Bederoff. "Matrix similarity." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-194214.
Full textSchuler, Sabine. "Modelling consolidation of matrix-coated fibre metal matrix composites." Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.284419.
Full textStanton, Heather. "The role of matrix metalloproteinases in cell-matrix interactions." Thesis, Open University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.284376.
Full textXie, Tailiang. "Positive definite matrix-valued functions and matrix variogram modeling." Diss., The University of Arizona, 1994. http://hdl.handle.net/10150/186727.
Full textCheung, Caroline Tsui Yee. "Matrix metalloproteinases, inflammation, and matrix remodeling in coxsackievirus-induced myocarditis." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/30760.
Full textMedicine, Faculty of
Pathology and Laboratory Medicine, Department of
Graduate
Clark, Richard L. "Altering the fiber-matrix interphase in semicrystalline polymer matrix composites." Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-12042009-020216/.
Full textOdelade, Mobolaji. "P300 Control Matrix| A Novel Approach to P300 Speller Matrix." Thesis, North Carolina Agricultural and Technical State University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10976563.
Full textOver the years, researchers have been able to prove Brain Computer Interface (BCI) -P300 Speller as an effective communication tool. The first P300 speller was developed by Farwell and Donchin (1988), using the oddball paradigm to evoke a P300 response from a speller matrix. This P300 speller matrix has been a strong basis for studies that aimed at using BCI-P300 protocol for spelling, cursor movement, internet navigation or even control and manipulation of devices. However, application of P300 based BCI to controlling and manipulation of devices often involves the user relating with multiple interfaces. These multiple interfaces could be a distraction or have negative effects on the user (Fazel-Rezai et al. 2012) and as a consequence hinders the evoking of P300 potential and causing inaccurate classification. For this research, a novel P300 control matrix is developed by replacing the alphabets in the traditional P300 speller matrix with arrow images. Then the novel P300 control matrix was investigated to compare the P300 latency and amplitude to that of the traditional P300 speller matrix. The elements in the novel P300 control matrix were in form of arrows facing upward, left, right and downward directions, while elements in the P300 speller matrix were alphabets U, L, R and D for the upward, left, right and downward directions respectively. The participants were presented with a set of randomly sequenced directions, and each participant decides which of the arrows or letters to focus on based on the direction presented to them. Electroencephalography (EEG) was used to record the brainwaves using the international 10-20 system of electrode placement. This research is potentially a more efficient approach for controlling devices using P300-based BCI systems by eradicating the need for multiple interfaces associated with BCI-robotic control systems that are based on P300 speller.
Hu, Fenglin. "Web site matrix." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0021/MQ48271.pdf.
Full textTerkhova, Karina. "Capacitance matrix preconditioning." Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244593.
Full textSolhjem, Sara Louise. "Sign Matrix Polytopes." Diss., North Dakota State University, 2018. https://hdl.handle.net/10365/28767.
Full textChoglay, Ashraf Ali. "Cell-matrix interactions." Thesis, University of Edinburgh, 1993. http://hdl.handle.net/1842/19624.
Full textNoble, Hannah. "Mueller Matrix Roots." Diss., The University of Arizona, 2011. http://hdl.handle.net/10150/204893.
Full textDe, Biasi Federico. "Matrix-Assisted NMR." Doctoral thesis, Università degli studi di Padova, 2019. http://hdl.handle.net/11577/3424861.
Full textPlanello, Aline Cristiane 1980. "Analise de polimorfismos no promotor dos genes MMP1, MMP3 e MMP9 na desordem da articulação temporomandibular." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/288534.
Full textDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Odontologia de Piracicaba
Made available in DSpace on 2018-08-15T12:46:18Z (GMT). No. of bitstreams: 1 Planello_AlineCristiane_M.pdf: 940083 bytes, checksum: 36ed3b0b3b0d10c144805116e08917dd (MD5) Previous issue date: 2010
Resumo: Objetivo: As Metaloproteinases da Matriz ( MMPs) são enzimas que degradam a matriz extracelular (MEC) e tem sido associadas às desordens temporomandibulares (DTM). Nós investigamos a freqüência dos -1607 1G/2G MMP1 polimorfismo (rs1799750), -1171 6A/5A MMP3 polimorfismo (rs3025058) e -1562 C/T MMP9 polimorfismo (rs3918242) em indivíduos com sinais de degeneração da ATM, diagnosticados por exame de imagem, a fim de analisar a associação desses polimorfismos e a DTM. Métodos: A população estudada foi composta por 115 indivíduos diagnosticados por exame de imagem (grupo DTM) e 117 controles. Os polimorfismos genéticos foram determinados por PCR/RFLP. Resultados: A freqüência do genótipo 2G/2G no gene MMP1 foi significantemente mais alta no grupo DTM do que no grupo Controle (p = 0.008). O genótipo 2G/2G no grupo DTM mostrou um risco aumentado para a DTM com um OR = 2.25 ( 95% IC = 1.26 - 3.99) quando comparado com os genótipo 1G/2G e 1G/1G. A freqüência dos alelos do gene MMP1 não mostrou diferença significativa entre os grupos (p > 0.05). A distribuição dos genótipos e alelos dos genes MMP3 e MMP9 não mostrou diferença significativa (p > 0.05). Conclusão: Nossos resultados mostram a associação entre o polimorfismo -1607 MMP1 e a suscetibilidade à DTM
Abstract: Objective. Matrix metalloproteinases (MMPs) degrade extracellular matrix components and have been implicated to play an important role in temporomandibular joint disorder (TMD). We investigated the frequency of -1607 1G/2G MMP1 polymorphism (rs1799750), -1171 6A/5A MMP3 polymorphism (rs3025058) and -1562 C/T MMP9 polymorphism (rs3918242) in individuals with TMJ degeneration diagnosed by image exam in order to analyze the association of these MMPs polymorphisms and TMD. Methods. The studied population comprised 115 TMD individuals diagnosed by image exam and 117 healthy controls. Genotypes were determined using polymerase chain reaction/Restriction fragment length polymorphism PCR/RFLP. Results. The MMP1 2G/2G genotype was significantly higher in the TMD group than in the Control group (p = 0.008). The genotype 2G/2G in the TMD group showed an increased risk to TMD with an OR = 2.25 (95% CI = 1.26 - 3.99) when compared with 1G/2G and 1G/1G genotypes. Analysis of MMP1 allele frequencies showed no significant difference (p > 0.05). The MMP3 and MMP9 genotypes distribution and alleles frequency did not differ between the groups (p > 0.05). Conclusion. Our results report the association of -1607 MMP1 gene polymorphism and increased risk to TMD
Mestrado
Histologia e Embriologia
Mestre em Biologia Buco-Dental
Taylor, Matthew. "On upper triangular tropical matrix semigroups, tropical matrix identities and T-modules." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/on-upper-triangular-tropical-matrix-semigroups-tropical-matrix-identities-and-tmodules(d470a4a1-4eca-46c8-b9b8-4377affcc6fe).html.
Full textGregory, Jeremy R. (Jeremy Ryan) 1976. "The role of precipitates on fiber/matrix interfaces in metal matrix composites." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/89301.
Full textBear, Harriet Mary. "The role of tyrosine rich acidic matrix protein in the extracellular matrix." Thesis, University of Edinburgh, 1997. http://hdl.handle.net/1842/21534.
Full textRodríguez, Escribà Marta. "Role of tRNA modifications in the synthesis of the extracellular matrix." Doctoral thesis, Universitat de Barcelona, 2020. http://hdl.handle.net/10803/668499.
Full textEls ARNs de transferència (ARNt) són molècules que tenen un paper clau en el procés de traducció dels ARN missatgers (ARNm) en proteïnes mitjançant la interacció del seu anticodó amb codons d’ARNm. Els ARNt que passen per un procés d’edició d’adenosina a inosina a la base wobble, o posició 34, són capaços de llegir més d’un codó d’ARNm gràcies a la capacitat de la inosina de reconèixer els tres nucleòtids uridina, citidina i adenosina. L’enzim responsable d’aquesta modificació post-transcripcional en eucariotes s’anomena Adenosina Deaminasa específica per l’ARNt (ADAT), es tracta d’un complex heterodimèric format per les subunitats ADAT2 i ADAT3 que és essencial per a la viabilitat de l’organisme. Estudis previs han proposat que l’aparició d’ADAT va determinar el nombre de còpies gèniques de cada ARNt així com la composició de codons presents als genomes eucariòtics de tal manera que aquests dos factors estiguessin mútuament balancejats. Tot i que la contribució precisa de la inosina 34 (I34) a la traducció de proteïnes durant la fase d’elongació encara s’ha determinat experimentalment, algunes investigacions han suggerit que podria jugar un rol en l’eficiència i fidelitat de traducció de gens enriquits en codons reconeguts per ARNt modificats amb I34. Amb l’objectiu d’investigar el rol de la inosina en la traducció, hem generat línies cel·lulars on el gen codificant per ADAT2 ha estat silenciat. La depleció d’ADAT2 comporta un retard en el creixement cel·lular i té un efecte variable en l’expressió gènica de proteïnes de la matriu extracel·lular. El patró de modificacions post-traduccionals de glicosilació d’aquestes proteïnes no resulta alterat per la deficiència d’ADAT2, que tampoc activa la resposta a proteïnes desplegades. Juntament amb l’absència de defectes en la velocitat d’elongació analitzada per ribosome profiling, aquestes observacions suggereixen que la cèl·lula és capaç de dur a terme les seves funcions amb un nombre reduït d’ARNt modificats amb inosina. Hem vist, però, que en condicions que requereixen majors quantitats d’ARNt inosinats, la depleció d’ADAT2 dóna lloc a la traducció ineficient d’un gen de matriu extracel·lular altament enriquit en codons sensibles llegits per ARNt modificats. Així doncs, els nostres resultats indiquen que la inosina pot exercir un rol important en la síntesi de proteïnes de la matriu extracel·lular, particularment durant processos de desenvolupament neuronal i de remodelat de les vies respiratòries. La rellevància de la modificació I34 s’ha vist reforçada recentment per la identificació de mutacions de caire patogènic localitzades al gen que codifica ADAT3. Totes elles tenen en comú la presència de fenotips relacionats amb el desenvolupament neurològic. La mutació d’ADAT3 més comuna consisteix en la substitució d’un residu valina per un metionina (V144M) i està associada a la manifestació de discapacitat intel·lectual i estrabisme. En el present estudi hem caracteritzat l’activitat enzimàtica i l’estructura quaternària de l’ADAT humà, així com l’impacte de la mutació V144M d’ADAT3 en el complex heterdimèric. Els nostres revelen que la substitució V144M dóna lloc a una menor activitat enzimàtica d’ADAT. És possible que aquesta reducció es vegi influïda per les alteracions en l’estructura terciària i en la localització cel·lular d’ADAT3 que indueix la mutació.
Schafmeister, Frank. "Indirekte Sparse-Matrix Konverter /." Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17428.
Full textMalek, Fadi. "Polynomial zerofinding matrix algorithms." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/9980.
Full textBrenner, Barbara, Bodo B. Schlegelmilch, and Björn Ambos. "Inside the NIKE matrix." WU Vienna University of Economics and Business, 2013. http://epub.wu.ac.at/3791/1/Nike__WU%2DCaseSeries.pdf.
Full textSeries: WU Case Series
Brown, Scott. "Finite reducible matrix algebras." University of Western Australia. School of Mathematics and Statistics, 2006. http://theses.library.uwa.edu.au/adt-WU2006.0079.
Full textSurovy, Martin. "Matrix Kundt-Newman sequences." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0013/MQ35001.pdf.
Full textWiegers, Yvonne. "Matrix, aspects of identity." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0018/MQ57643.pdf.
Full textAusting, Peter. "Yang-Mills matrix theory." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365336.
Full textEdrees, Hamza J. "Sialon ceramic matrix composites." Thesis, University of Strathclyde, 1990. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=21383.
Full textSoley-Beltran, Patricia. "Transsexualism and hetrosexual matrix." Thesis, University of Edinburgh, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492685.
Full textSangsari, Rahman Bahmani. "Matrix type of rings." Thesis, University of Exeter, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272978.
Full textHeggarty, Jonathan W. "Parallel R-matrix computation." Thesis, Queen's University Belfast, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287468.
Full textEmpringham, Lee. "Matrix converter current commutation." Thesis, University of Nottingham, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342443.
Full textZhou, Hanson M. (Hanson Mi) 1977. "Clustering via matrix exponentiation." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/17671.
Full textIncludes bibliographical references (leaves 26-27).
Given a set of n points with a matrix of pairwise similarity measures, one would like to partition the points into clusters so that similar points are together and different ones apart. We present an algorithm requiring only matrix exponentiation that performs well in practice and bears an elegant interpretation in terms of random walks on a graph. Under a certain mixture model involving planting a partition via randomized rounding of tailored matrix entries, the algorithm can be proven effective for only a single squaring. It is shown that the clustering performance of the algorithm degrades with larger values of the exponent, thus revealing that a single squaring is optimal.
by Hanson M. Zhou.
S.M.
Xin, Yu Ph D. Massachusetts Institute of Technology. "Algorithms for matrix completion." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/71500.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 69-72).
We consider collaborative filtering methods for matrix completion. A typical approach is to find a low rank matrix that matches the observed ratings. However, the corresponding problem has local optima. In this thesis, we study two approaches to remedy this issue: reference vector method and trace norm regularization. The reference vector method explicitly constructs user and item features based on similarities to reference sets of users and items. Then the learning task reduces to a convex regression problem for which the global optimum can be obtained. Second, we develop and analyze a new algorithm for the trace-norm regularization approach. To facilitate smooth primal optimization, we introduce a soft variational trace-norm and analyze a class of alternating optimization algorithms. We introduce a scalable primal-dual block coordinate descent algorithm for large sparse matrix completion. The algorithm explicitly maintains a sparse dual and the corresponding low rank primal solution at the same time. Preliminary empirical results illustrate both the scalability and the accuracy of the algorithm.
by Yu Xin.
S.M.
Srebro, Nathan 1974. "Learning with matrix factorizations." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28743.
Full textIncludes bibliographical references (p. 157-164).
Matrices that can be factored into a product of two simpler matrices can serve as a useful and often natural model in the analysis of tabulated or high-dimensional data. Models based on matrix factorization (Factor Analysis, PCA) have been extensively used in statistical analysis and machine learning for over a century, with many new formulations and models suggested in recent years (Latent Semantic Indexing, Aspect Models, Probabilistic PCA, Exponential PCA, Non-Negative Matrix Factorization and others). In this thesis we address several issues related to learning with matrix factorizations: we study the asymptotic behavior and generalization ability of existing methods, suggest new optimization methods, and present a novel maximum-margin high-dimensional matrix factorization formulation.
by Nathan Srebro.
Ph.D.
Nan, Feng S. M. Massachusetts Institute of Technology. "Low rank matrix completion." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/55077.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 75-76).
We consider the problem of recovering a low rank matrix given a sampling of its entries. Such problems are of considerable interest in a diverse set of fields including control, system identification, statistics and signal processing. Although the general low rank matrix completion problem is NP-hard, there exist several heuristic methods that solve the problem approximately by solving the convex relaxation of the original problem. One particularly popular method is to use nuclear norm (sum of singular values) to approximate the rank of the matrix and formulate the problem as a semidefinite program that can be solved efficiently. In this thesis, we propose a local completion algorithm that searches for possible completion in the neighborhood of each unspecified entry given the rank of the matrix. Unlike existing methods, this algorithm requires only local information of the matrix if the rank is known. Critical in all low rank matrix completion algorithms is the sampling density. The denser the matrix is sampled, the more likely it can be recovered accurately. We then propose a condensation process that increases the sampling density in a specific part of the matrix through elementary row and column re-ordering. Hence we can solve a sub-problem of the original low rank matrix completion problem and gain information on the rank of the matrix. Then the local algorithm is readily applicable to recover the entire matrix. We also explore the effect of additional sampling structures on the completion rate of the low rank matrix completion problems. In particular, we show that imposing regularity in the sampling process leads to slightly better completion rates.
(cont.) We also provide a new semidefinite formulation for a particular block sampling structure that reduces the size of the constraint matrix sizes by a factor of 1.5.
by Feng Nan.
S.M.
Kwizera, Petero. "Matrix Singular Value Decomposition." UNF Digital Commons, 2010. http://digitalcommons.unf.edu/etd/381.
Full textChamberlain, A. "Novel silicate matrix composites." Thesis, University of Warwick, 1994. http://wrap.warwick.ac.uk/107576/.
Full textBixler, Reid Morris. "Sparse Matrix Belief Propagation." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/83228.
Full textMaster of Science
Milanovic, Zoran. "Solid matrix Christiansen filters." Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185764.
Full textSchatz, Sandra Regina. "From frankenstein to matrix." Florianópolis, SC, 2002. http://repositorio.ufsc.br/xmlui/handle/123456789/83728.
Full textMade available in DSpace on 2012-10-20T02:49:28Z (GMT). No. of bitstreams: 0Bitstream added on 2014-09-26T01:01:56Z : No. of bitstreams: 1 182188.pdf: 2777855 bytes, checksum: 7b4d6a42680bc77daf11ab9ee93f46bd (MD5)
Este trabalho lida com o gênero literário de ficção científica. Combinando os princípios da "Cultural Criticism" e "Reader-Response Criticism," ele discute e interpreta duas narrativas ocidentais: Frankenstein de Mary Shelley e Matrix dos irmãos Wachowski. O trabalho se preocupa com dois aspectos relevantes: (1) a cultura Ocidental esmagando dependência na ciência e tecnologia e (2) o papel das narrativas como um instrumento de ambos apoio e mudança em relação aos valores e verdades propostas pelo discurso dominante ou cultura paradigmática.
Jungnick, Nadine. "Influenza matrix protein M1." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät I, 2011. http://dx.doi.org/10.18452/16438.
Full textabout the assembly process of the influenza A virus particle is essential for the development of effective approaches for prevention and treatment of this virus infection. The virus particle consists of an envelope, an underlying matrix, and the encapsulated genome. The genetic material is organized as bundle of eight ribonucleoprotein complexes that encode for eleven proteins. The envelope consists of a lipid bilayer that is enriched in sphingomyelin and cholesterol. The viral spike proteins, hemagglutinin and neuraminidase, as well as the proton channel M2 are embedded into this membrane. The matrix can be found below the envelope. It is formed by one single protein, the matrix protein M1. M1 plays a crucial role during the replication of the virus in the cell. It interacts with the genetic material, with the envelope proteins and with the lipid bilayer of the envelope. The results of this study reveal in detail which lipids are targeted by M1. The set of identified lipids contains phosphatylglycerol and phosphatidic acids as new binding partners, beside the known phophatidylserine. Additionally, several phosphatidylinositols were identified. Phosphatidylinositol-4-phosphate was the strongest binding partner from this group. Mutant-based analysis revealed that M1 owns more than one membrane binding site. The positively charged area in the N-terminal and the C-terminal domain mediated membrane association of the respective mutant protein. The final constitution of M1 on the membrane was characterized by confocal fluorescence microscopy on giant unilamellar vesicles. Full length M1 and a mutant that consisted only of the N-terminal part of M1 showed lateral clustering of homooligomers on the vesicle surface. The clusters formed independently of any other viral component. A function as fundament for the incorporation of the other viral components can be assumed for these clusters.
Zarri, Luca <1972>. "Control of matrix converters." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/412/1/PhdTesisZarri.pdf.
Full textZarri, Luca <1972>. "Control of matrix converters." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/412/.
Full text