Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Thomas Hofmeister"'
Autor:
Jennifer Gerke, Holm Frauendorf, Dominik Schneider, Maxim Wintergoller, Thomas Hofmeister, Anja Poehlein, Ziga Zebec, Eriko Takano, Nigel S. Scrutton, Gerhard H. Braus
Publikováno v:
Frontiers in Bioengineering and Biotechnology, Vol 8 (2020)
Monoterpenoids, such as the plant metabolite geraniol, are of high industrial relevance since they are important fragrance materials for perfumes, cosmetics, and household products. Chemical synthesis or extraction from plant material for industry pu
Externí odkaz:
https://doaj.org/article/a95db9788b2345aca5510f1f7e0846af
Autor:
Thomas Hofmeister, Thomas Sattelmayer
Publikováno v:
Volume 3A: Combustion, Fuels, and Emissions.
This paper presents the numerical investigations of amplitude-dependent stability behavior of thermoacoustic oscillations at screech level frequencies in a lean-premixed, atmospheric, swirl-stabilized, lab-scale gas turbine combustor. A hybrid Comput
Publikováno v:
Volume 3B: Combustion, Fuels, and Emissions.
The linearized Euler equations (LEE) provide an accurate — yet computationally efficient — description of propagation and damping of acoustic waves in geometrically complex, non-uniform reactive mean flows like those found in gas turbine combusti
Publikováno v:
Journal of Engineering for Gas Turbines and Power. 143
This paper seeks to advance linear stability analyses of thermoacoustic systems conducted with the stabilized Finite Element Method (sFEM). Specifically, this work analyzes and quantifies the impact of the Streamline-Upwind-Petrov-Galerkin (SUPG) art
Publikováno v:
Volume 4A: Combustion, Fuels, and Emissions.
This paper presents a methodology to compute acoustic damping rates of transversal, high-frequency modes induced by vortex-shedding. The acoustic damping rate presents one key quantity for the assessment of the linear thermoacoustic stability of gas
Publikováno v:
Theory of Computing Systems. 40:249-262
Schoning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n)·(4/3)n = O(1.334n). In this paper we present randomized algorithms and show that
Publikováno v:
Informatik-Spektrum. 25:488-502
Publikováno v:
SIAM Journal on Computing. 30:383-390
Heilbronn conjectured that given arbitrary n points from the 2-dimensional unit square, there must be three points which form a triangle of area at most O(1/n2). This conjecture was disproved by a nonconstructive argument of Komlos, Pintz, and Szemer
Publikováno v:
Combinatorics, Probability and Computing. 8:417-427
We consider the problem of determining the maximum number N(m, k, r) of columns of a 0−1 matrix with m rows and exactly r ones in each column such that every k columns are linearly independent over ℤ2. For fixed integers k[ges ]4 and r[ges ]2, wh
Publikováno v:
Information and Computation. 131(1):81-93
Letnbinary numbers of lengthnbe given. The Boolean function “Multiple Product”MPnasks for (some binary representation of ) the value of their product. It has been shown (K.-Y. Siu and V. Roychowdhury, On optimal depth threshold circuits for multi