Sökresultat

Protein dynamics play a crucial role in function, catalytic activity, and pathogenesis. Consequently, there is great interest in computational methods that probe the conformational fluctuations of a protein. However, molecular dynamics simulations are computationally costly and therefore are often limited to comparatively short timescales. TYPHON is a probabilistic method to explore the conformati

It is shown how first-order performance estimation of high-orderadaptive optics (AO) systems may be efficiently implemented in a hybridnumerical simulation by the use of 1) sparse matrix techniques forwavefront reconstruction, 2) undersampled pupil-plane turbulence-inducedaberrations, and 3) analytical models that compensate - in the limit ofinfinite exposure time - for the errors introduced by un

Multimedia has become one of the cornerstones of our 21st century society and, when combined with mobility, has enabled a tremendous evolution of our society. However, joining these two concepts introduces many technical challenges. These range from having sufficient performance for handling multimedia content to having the battery stamina for acceptable mobile usage. When taking a projection of w

This paper presents ongoing research on using non-uniform rational b-splines(NURBS) based isogeometric analysis for form finding of efficient shapes for shells. The form finding is made using dynamic relaxation together with NURBS based membrane elements. The method is employed directly to design geometry, without the need for any further discretization. The method is implemented in two plug-ins f

Popular Abstract in Swedish I takt med att vi översvämmas av kameror och bilder blir också tillämpningarna för automatiserad bildanalys allt större. Det kan handla om avancerade industrirobotar eller mobiltelefoner och syftet är allt från att rädda liv till att få en bra bild på barnbarnen. Den här avhandlingen fokuserar på två centrala problem inom fältet datorseende och bildanalys. Den första dThis thesis focuses on two problems in the field of computer vision and image analysis. The first part of the thesis deals with image localization. The goal is simply to answer the question: Where was this picture taken? To answer this two things are needed: A model of the world, or at least the relevant parts of the world, and a method for relating a new image to the model. The thesis presents ne

As the demand for eco-friendly alternatives to traditional plastics grows, Polyethylene Furanoate (PEF) emerges as a promising solution. Derived from renewable biomass sources, PEF embodies sustainability principles by reducing reliance on finite resources and minimizing environmental impact. PEF is synthesized from 2,5-furandicarboxylic acid (FDCA), a key monomer which upon polymerization has the

ZnTe colloidal semiconductor nanocrystals (NCs) have shown promise for light-emitting diodes (LEDs) and displays, because they are free from toxic heavy metals (Cd). However, so far, their low photoluminescence (PL) efficiency (∼30%) has hindered their applications. Herein, we devised a novel structure of ZnTe NCs with the configuration of ZnSe (core)/ZnTe (spherical quantum well, SQW)/ZnSe (shell

Forward-only algorithms offer a promising memory-efficient alternative to Backpropagation (BP) for on-device training. However, state-of-the-art forward-only algorithms, e.g., Forward-Forward (FF), still require a substantial amount of memory during the training process, often exceeding the limits of mobile edge and Internet of Things (IoT) devices. At the same time, existing memory-optimization t

Vertical arrays of direct band gap III-V semiconductor nanowires (NWs) hold the prospect of cheap and efficient next-generation photovoltaics, and guidelines for successful light-management are needed. Here, we use InP NWs as a model system and find, through electrodynamic modeling, general design principles for efficient absorption of sun light in nanowire arrays by systematically varying the nan

We describe a simple combinatorial approximation algorithm for finding a shortest (simple) cycle in an undirected graph. For an undirected graph G of unknown girth k, our algorithm returns with high probability a cycle of length at most 2k for even k and 2k + 2 for odd k, in time O(n(3/2) root logn). Thus, in general, it yields a 2 2/3 approximation. We study also the problem of finding a simple c

Message passing schedules that reduce the decoding complexity of terminated LDPC convolutional code ensembles are analyzed. Considering the AWGN channel, various schedules are compared by means of density evolution. The results of the analysis together with computer simulations for some (3,6)-regular codes confirm that sliding window decoding is an attractive practical solution for low-latency and

The computation of the Capon and the amplitude and phase estimation (APES) filters can be very time consuming. The burden lies not only in the inversion of the sample covariance matrix, but also in the matrix multiplications. In this paper, we propose an efficient algorithm for the computation of the above mentioned filters, using Cholesky factorization and fast Fourier transforms. Furthermore, we

In this paper, problems related to simulation model documentation and model exchange between users are discussed. Complex simulation models have gained popularity in the environmental field, but require extensive documentation to allow independent implementation. The existence of different simulation platforms puts high demands on the quality of the original documentation. Recent experiences from

In this thesis we study efficient solvers for space-time discontinuous Galerkin spectral element methods (DG-SEM). These discretizations result in fully implicit schemes of variable order in both spatial and temporal directions. The popularity of space-time DG methods has increased in recent years and entropy stable space-time DG-SEM have been constructed for conservation laws, making them interes