Search results

The Urban Systems and Dynamics group, led by Prof. Nik, advances the boundaries of Building Physics to explore the complex interactions between buildings, urban systems, and climate. Our research focuses on designing and optimizing strategies for buildings and urban systems (with a big focus on energy systems) that drive the sustainable urban transition and enhance the built environment's resilien

An autoclavable all-glass system for studying microbial dynamics at permeable surfaces is described. Standard hydrophobic or hydrophilic membranes (46-mm diameter) of various pore sizes were supported on a glass frit through which nutrient solutions were pumped by a peristaltic pump. The pump provided a precisely controlled flow at speeds of 0.5 to 500 ml of defined or natural cell exudates per h,

Bacterial infections spanning from local wound infections, affecting patients with non-healing leg ulcers, postoperative wounds or burns, to severe infections and sepsis, are significant medical problems. Today's anti-infective treatments do not address the excessive activation of inflammatory pathways during infection and sepsis, and resistance problems are increasing. Hence, there is a huge unmBacterial infections spanning from local wound infections, affecting patients with non-healing leg ulcers, postoperative wounds or burns, to severe infections and sepsis, are significant medical problems. Today's anti-infective treatments do not address the excessive activation of inflammatory pathways during infection and sepsis, and resistance problems are increasing. Hence, there is a huge unm

We consider time-dependent thermal fluid structure interaction. The respective models are the compressible Navier–Stokes equations and the nonlinear heat equation. A partitioned coupling approach via a Dirichlet–Neumann method and a fixed point iteration is employed. As a reference solver, a previously developed efficient time-adaptive higher-order time integration scheme is used. To improve on t

In multi-view sports broadcasting, extracting high-quality highlights and selecting the optimal camera angle from concurrent video streams is traditionally a labor-intensive process with significant computational overhead. This thesis explores the feasibility of automating the production of multi-view sports highlights using Multimodal Large Language Models (MLLMs). To manage the high computatio

The Fourier slice theorem for the standard Radon transform generalizes to a Laplace counterpart when considering the exponential Radon transform. We show how to use this fact in combination with algorithms for the unequally spaced fast Laplace transform to construct fast and accurate methods for computing both the forward exponential Radon transform and the corresponding back-projection operator.

This paper presents a novel polynomial constraint for homographies compatible with the general planar motion model. In this setting, compatible homographies have five degrees of freedom-instead of the general case of eight degrees of freedom-and, as a consequence, a minimal solver requires 2.5 point correspondences. The existing minimal solver, however, is computationally expensive, and we propose

The thesis deals with circuit-level aspects of CMOS buffer SRAMs where the data throughput rate is a more important metric than access time or storage capacity. One aspect is the increased write cycle related power consumption that is the consequence of a high write ratio combined with a long word-length. That is addressed through the invention of a new bit-line operation mode which allows lower

We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed up the computation of the product. Our new fast outputsensitive algorithm for Boolean matrix product and its witnesses is randomized and provides the Boolean product and its witnesses almost certainly. Its worst-case time performance is expressed in terms of the input size and the number of non-zero

We consider the problem of computing the product of two n×n Boolean matrices A and B. For an n×n Boolean matrix C, let GC be the complete weighted graph on the rows of C where the weight of an edge between two rows is equal to its Hamming distance, i.e., the number of entries in the first row having values different from the corresponding entries in the second one. Next, letMWT(C) be the weight of a