239 research outputs found
Efficient production of the Nylon 12 monomer ω-aminododecanoic acid methyl ester from renewable dodecanoic acid methyl ester with engineered Escherichia coli
The expansion of microbial substrate and product scopes will be an important brick promoting future bioeconomy. In this study, an orthogonal pathway running in parallel to native metabolism and converting renewable dodecanoic acid methyl ester (DAME) via terminal alcohol and aldehyde to 12-aminododecanoic acid methyl ester (ADAME), a building block for the high-performance polymer Nylon 12, was engineered in Escherichia coli and optimized regarding substrate uptake, substrate requirements, host strain choice, flux, and product yield. Efficient DAME uptake was achieved by means of the hydrophobic outer membrane porin AlkL increasing maximum oxygenation and transamination activities 8.3 and 7.6-fold, respectively. An optimized coupling to the pyruvate node via a heterologous alanine dehydrogenase enabled efficient intracellular L-alanine supply, a prerequisite for self-sufficient whole-cell transaminase catalysis. Finally, the introduction of a respiratory chain-linked alcohol dehydrogenase enabled an increase in pathway flux, the minimization of undesired overoxidation to the respective carboxylic acid, and thus the efficient formation of ADAME as main product. The completely synthetic orthogonal pathway presented in this study sets the stage for Nylon 12 production from renewables. Its effective operation achieved via fine tuning the connectivity to native cell functionalities emphasizes the potential of this concept to expand microbial substrate and product scopes
Efficient micro-doppler based pedestrian activity classification for ADAS systems using Krawtchouk moments
In this paper the application, performance and results of a fully discrete micro-Doppler feature classication processing chain utilising Krawtchouk moment invariants are presented. The approach demonstrates to be capable of running on low power hardware such as the Raspberry Pi 2. The effectiveness of the proposed approach is veried through the use of real K-band data in real-time
Theoretical study of peculiarities of unstable longitudinal shear crack growth in sub-Rayleigh and supershear regimes
In the paper we present the results of the theoretical study of some fundamental aspects of mode II crack propagation in conventional sub-Rayleigh regime and transition to intersonic regime. It is shown that development of a sub-Rayleigh shear crack is determined in many respects by elastic vortex traveling ahead of the crack tip at a shear wave velocity. Formation of such a vortex helps to better understand the well-known phenomenon of acceleration of a shear crack towards the longitudinal wave velocity. Simulation results have shown that due to self-similarity of shear crack propagation the conditions of sub-Rayleigh to intersonic transition depend on dimensionless material and crack parameters. Two key dimensionless parameters are proposed
Photon extrabunching in ultrabright twin beams measured by two-photon counting in a semiconductor
For many years twin beams originating from parametric down-converted light beams have aroused great interest and attention in the photonics community. One particular aspect of the twin beams is their peculiar intensity correlation functions, which are related to the coincidence rate of photon pairs. Here we take advantage of the huge bandwidth offered by two-photon absorption in a semiconductor to quantitatively determine correlation functions of twin beams generated by spontaneous parametric down-conversion. Compared with classical incoherent sources, photon extrabunching is unambiguously and precisely measured, originating from exact coincidence between down-converted pairs of photons, travelling in unison. These results strongly establish that two-photon counting in semiconductors is a powerful tool for the absolute measurement of light beam photon correlations at ultrashort timescales
Computing Technical Capacities in the European Entry-Exit Gas Market is NP-Hard
As a result of its liberalization, the European gas market is organized as an entry-exit system in order to decouple the trading and transport of natural gas. Roughly summarized, the gas market organization consists of four subsequent stages. First, the transmission system operator (TSO) is obliged to allocate so-called maximal technical capacities for the nodes of the network. Second, the TSO and the gas traders sign mid- to long-term capacity-right contracts, where the capacity is bounded above by the allocated technical capacities. These contracts are called bookings. Third, on a day-ahead basis, gas traders can nominate the amount of gas that they inject or withdraw from the network at entry and exit nodes, where the nominated amount is bounded above by the respective booking. Fourth and finally, the TSO has to operate the network such that the nominated amounts of gas can be transported. By signing the booking contract, the TSO guarantees that all possibly resulting nominations can indeed be transported. Consequently, maximal technical capacities have to satisfy that all nominations that comply with these technical capacities can be transported through the network. This leads to a highly challenging mathematical optimization problem. We consider the specific instantiations of this problem in which we assume capacitated linear as well as potential-based flow models. In this contribution, we formally introduce the problem of Computing Technical Capacities (CTC) and prove that it is NP-complete on trees and NP-hard in general. To this end, we first reduce the Subset Sum problem to CTC for the case of capacitated linear flows in trees. Afterward, we extend this result to CTC with potential-based flows and show that this problem is also NP-complete on trees by reducing it to the case of capacitated linear flow. Since the hardness results are obtained for the easiest case, i.e., on tree-shaped networks with capacitated linear as well as potential-based flows, this implies the hardness of CTC for more general graph classes
- …