Sökning: "Matrix complexity"

Visar resultat 1 - 5 av 110 uppsatser innehållade orden Matrix complexity.

  1. 1. Developing a protocol for 3D-printable bioink from decellularised porcine tissue

    Master-uppsats, Lunds universitet/Livsmedelsteknik och nutrition (master)

    Författare :Vendela Sandin; [2024]
    Nyckelord :Scaffold; Extracellular matrix; ECM; Bioink; Bioprinting; Collagen; Pharmaceutical technology; Technology and Engineering; Biology and Life Sciences;

    Sammanfattning : T-cell administration via a scaffold is a promising tool for treatment of inoperable solid tumours. Traditional scaffold materials lack the complexity of the extracellular matrix (ECM) that cells normally grow in. An alternative is to instead use decellularised ECM (dECM) from biological tissue to create the scaffold. LÄS MER

  2. 2. Complexity Analysis and Structural Optimization for Architecture Models of Mechatronic Systems

    Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)

    Författare :Yuanyang Zhang; [2023]
    Nyckelord :Mechatronic System Design; Architecture Model; DSM; Structural Complexity; Partitioning Optimization Design; Mekatronisk Systemdesign; Arkitektur Modell; DSM; Strukturell Komplexitet; Partitionering Optimering Design;

    Sammanfattning : The design and development of mechatronic system are becoming an increasingly complex task due to the numerous disciplines involved, rapidly increasing scales, and the integration issues of different domains and technologies. The structural complexity of the architecture model design decides the quality of system design in many aspects: the scalability of the system design; usage of allocated resources which influences the computational overhead, etc. LÄS MER

  3. 3. Simulation and Testing of a MU-MIMO Beamforming System

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Nazyar Mehdishishavan; Zonghan Wang; [2023]
    Nyckelord :Multi-User Multiple-Input Multiple-Output MU-MIMO ; Beamforming; Sounding Reference Signal SRS ; Reciprocity-based; Butler matrix; Advanced Antenna System AAS ; Technology and Engineering;

    Sammanfattning : Multi-User Multiple-Input Multiple-Output (MU-MIMO) technology has become increasingly important in the field of wireless communication due to its ability to highly increase the capacity and efficiency of wireless networks [1]. Beamforming, as a technique used in MU-MIMO systems, improves network performance by improving signal quality and reducing interference. LÄS MER

  4. 4. Fractal and entropy analysis of traditional and modernist building facades in street-level view : the case of Sweden’s growing cities

    Master-uppsats, SLU/Dept. of Landscape Architecture, Planning and Management (from 130101)

    Författare :Alexis Ken Cartajenas; [2023]
    Nyckelord :fractal dimension; information entropy; street-level view; building façade; preference matrix;

    Sammanfattning : This study presents a quantitative analysis of traditional and modernist building facades in urban environments, focusing on the assessment of their complexity and coherence. Fractal and entropy analysis techniques were employed to objectively evaluate the differences between the two architectural styles within the preference matrix framework. LÄS MER

  5. 5. Tensor rank and support rank in the context of algebraic complexity theory

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Pelle Andersson; [2023]
    Nyckelord :linear algebra; tensor product; tensor rank; matrix multiplication; complexity; linjär algebra; tensorprodukt; tensorrang; matrismultiplikation; komplexitet;

    Sammanfattning : Starting with the work of Volker Strassen, algorithms for matrix multiplication have been developed which are time complexity-wise more efficient than the standard algorithm from the definition of multiplication. The general method of the developments has been viewing the bilinear mapping that matrix multiplication is as a three-dimensional tensor, where there is an exact correspondence between time complexity of the multiplication algorithm and tensor rank. LÄS MER