Search results

Information Studies encompasses the study of the production, organization, storage, dissemination, and utilization of information, as well as the institutions, such as libraries, where this takes place. The subject also includes cultural, societal, political, and technical conditions and perspectives for these processes, and institutions. Therefore, Information Studies has connections to other dis

NanoLund är Lunds universitets centrum för forskning, utbildning och innovation inom nanovetenskap. Över 400 personer inom fakulteterna för teknik, naturvetenskap och medicin är verksamma i detta strategiska forskningsområde. Det finansieras av den svenska regeringen och är Sveriges största forskningsmiljö för nanovetenskap och nanoteknologi.

Under devisen ”A Great Place to do Nanoscience” vilNanoLund, the centre for research, education and innovation in nanoscience at Lund University, engages over 400 researchers, students and staff at the faculties of engineering, science and medicine. It is a strategic research area funded by the Swedish Government and Sweden’s largest research environment for nanoscience and nanotechnology.

Our ambition is to be a Great Place to do Nanoscience:

The problem of reducing the number of multiplications in infinite response filtering is considered. We show how this operation may be decomposed on finite response filtrations and so-named halfconvolutions. Examples of the efficient procedures for filters of low order are presented.

We present new polynomial-time approximation schemes (PTAS) for several basic minimum-cost multi-connectivity problems in geometrical graphs. We focus on low connectivity requirements. Each of our schemes either signifi- cantly improves the previously known upper time-bound or is the first PTAS for the considered problem. We provide a randomized approximation scheme for finding a biconnected graph

The parallel structure of dataflow programs and their support for processing streams of data make dataflow programming an interesting tool for doing stream processing on parallel processing architectures. The computational kernels, the actors, of a dataflow program communicate with other actors via FIFO channels. The actors in the dataflow model used in this paper may perform different actions dep

Spontaneous activation of rhodopsin without light absorption occurs at a much lower rate in rod photoreceptors and insect rhabdoms than in cones. The difference lies in the pigment molecules themselves, and has implications for the design of visual photoreceptors.

We use Cholesky decomposition of the density matrix in atomic orbital basis to define a new set of occupied molecular orbital coefficients. Analysis of the resulting orbitals ("Cholesky molecular orbitals") demonstrates their localized character inherited from the sparsity of the density matrix. Comparison with the results of traditional iterative localization schemes shows minor differences with

We consider thermal fluid structure interaction to model industrial gas quenching in steel forging, where hot steel Is cooled using cold high pressured gas. This allows to define properties of the finished steel part, as for example yield strength, locally at low cost and without environmental problems. For the numerical simulation, a partitioned approach via a Dirichlet-Neumann coupling and a fix

In this paper we present a novel 3D sensing approach for industrial bin-picking applications that is low-cost, fast and precise. The system uses a simple laser-line emitter. While a robot arm moves the object through the laser light, a synchronized camera captures the laser line image on the object. A full point cloud as well as an edge point cloud suitable for subsequent pose estimation is genera

We consider the capacity of multiple-input-multiple-output (MIMO) systems with reduced complexity. One link end uses all available antennas, while the other chooses the "best" L out of N antennas. The selection of the optimum antenna subset requires an exhaustive search of all possible combinations, involving (/sub L//sup N/) computations of determinants of size L /spl times/ L, which can become p

Fast algorithms for unequally spaced discrete Laplace transforms are presented. The algorithms are approximate up to a prescribed choice of computational precision, and they employ modified versions of algorithms for unequally spaced fast Fourier transforms using Gaussians. Various configurations of sums with equally and unequally spaced points can be dealt with. In contrast to previously presente

Recently, optimal linearly constrained minimum variance (LCMV) filtering methods have been applied to fundamental frequency estimation. Such estimators often yield preferable performance but suffer from being computationally cumbersome as the resulting cost functions are multimodal with narrow peaks and require matrix inversions for each point in the search grid. In this paper, we therefore consid

In multiowner wireless networks, access points (APs) are owned and operated by different administrations, leading to significant authentication delays during handoff between APs. We propose to exploit the trust between the owners of neighboring APs for reducing the authentication delay. In the proposed authentication scheme, neighboring APs that trust each other share the security key for the visi

With a growing trend of electrification of vehicles there is a need for more flexible and advantageous charging options that reduce EV limitations. To overcome these limitations, dynamic charge through Electric Road Systems (ERS) is in development, and fast charging stations are being deployed all over the world. This thesis focuses on combining the use of both technologies, attempting to use an E

With a growing trend of electrification of vehicles there is a need for more flexible and advantageous charging options that reduce EV limitations. To overcome these limitations,dynamic charge through Electric Road Systems (ERS) is in development, and fast charging stations are being deployed all over the world. This thesis focuses on combining the use of both technologies, attempting to use an EL