Sökning: "simplicity and complexity"
Visar resultat 1 - 5 av 38 avhandlingar innehållade orden simplicity and complexity.
1. Simplicity within Complexity : Understanding dynamics of cellular networks by model reduction
Sammanfattning : Cellular networks composed of interactions between genes, proteins and metabolites, determines the behavioural repertoire of the cell. Recent developments in high-throughput experimental techniques and computational methods allow static descriptions of these networks on a genome scale. LÄS MER
2. Proactive Software Complexity Assessment
Sammanfattning : Large software development companies primarily deliver value to their customers by continuously enhancing the functionality of their products. Continuously developing software for customers insures the enduring success of a company. LÄS MER
3. Optimization and Learning for Large-Scale MIMO-OFDM Wireless Systems : Theory, Algorithms, and Applications
Sammanfattning : The requirements for next-generation wireless communications networks, particularly fifth-generation (5G) and beyond, are driven by at least three broad use cases. These include enhanced mobile broadband services to support extremely high data rates in terms of network or per user in both uplink and downlink, massive machine-type communications to accommodate massive internet-of-things applications, and critical machine-type communications to handle mission-critical applications that require ultra-high reliability and low latency. LÄS MER
4. Priming and activation of neutrophils from blood and tissue
Sammanfattning : Inflammation is a powerful process, involved in many disease states, as well as in physiological situations. Neutrophils, the main characters of this thesis, are potent immune cells with the capacity to regulate inflammatory responses. In health, circulating blood neutrophils are regarded as quiescent, with limited responsiveness to stimuli. LÄS MER
5. Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference
Sammanfattning : This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered. The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. LÄS MER