Filtyp
The onset of formulating strategies and policies regarding the bioeconomy can be, at least partly, attributed to the publication of the bioeconomy policy agenda by the OECD in 2009. The aim of this study is to analyse selected national strategies and policies regarding the development of a bioeconomy and to clarify similarities and differences between them. The article presents a comparative overv
In order to move away from fossil fuels many governments and industries are focusing their new investments in electricity and alternative fuels such as green hydrogen from electrolyzers using renewable electricity. High investment costs and electricity costs are a hindrance for the future development of a hydrogen economy which can utilize an increasing intermittent power generation. The aim of th
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
Fingerprint recognition has become a popular authentication method in modern smartphones, replacing traditional passwords and PINs. However, smartphone fingerprint sensors are small and capture only partial fingerprints with limited resolution. Combined with varying image quality and inconsistent finger placement, multiple images must be stored per user to ensure reliable authentication. During ve
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 output-sensitive 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-zer
In synthetic aperture radar one wishes to reconstruct the reflectivity function of a region on the ground from a set of radar measurements taken at several angles. The ground reflectivity is found by interpolating measured samples, which typically lie on a polar grid in frequency space, to an equally spaced rectangular grid in frequency space, then computing an inverse Fourier transform. The class
Given a set V of n points in R-d and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V. A geometric t-spanner on V is a connected graph G = ( V, E) with edge weights equal to the Euclidean distances between the endpoints, and with the property that, for all u, v is an element of V the distance between u and v in G is at most t times the Euc
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
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
