Relational Control Structures

In this paper, we outline the use of relational control structures (Regel-Relative) to describe continuous-time linear systems and show how well known time-invariance from control theory can be defined by these algebraic structures. Furthermore, such important system properties as controllability and reachability are introduced to arbitrary (nonlinear, non-smooth, discontinuous) dynamical systems.     

Microbial Baeyer-Villiger Oxidation of Ketones by Cyclohexanone and Cyclopentanone Monooxygenase – A Computational Rational for Biocatalyst Performance

Summary. Recombinant Escherichia coli overexpressing Pseudomonas sp. NCIMB 9872 cyclopentanone monooxygenase (CPMO, EC 1.14.13.16) and Acinetobacter sp. NCIMB 9871 cyclohexanone monooxygenase (CHMO, EC 1.14.13.22) have been utilized in whole-cell Baeyer-Villiger biotransformations of prochiral bicycloketones. A significant difference in substrate acceptance and stereoselectivity was observed for bicyclo[3.3.0] and bicyclo[4.3.0] substrates. A plausible mechanism of these transformations was established by means of high level DFT/B3LYP calculations suggesting an essential difference in electronic requirements for a successful enzymatic conversion, which was similarly encountered in recombinant whole-cell mediated biooxidations. Some of the lactones produced in the biocatalytic Baeyer-Villiger oxidation represent key intermediates for the synthesis of indole alkaloids.     

Kazhdan constants for conjugacy classes of compact groups

Kazhdan constants relative to conjugacy classes of compact groups are computed. They depend on the nontrivial irreducible characters of the respective group. The result is applied, in particular, to finite groups of Lie type, symmetric groups, and the group SU(n).     

Producing and transferring low-spatial-frequency grids for measuring displacement fields with moiré and grid methods

Experimental Techniques -     

On comparison systems for ordinary differential equations

We state and prove general comparison principles for ordinary differential equations, discuss the scope of these principles, and present examples.     

Bending loss measurement using a fiber cavity ringdown scheme

A novel sensitive technique for the determination of losses in fiber cavities is presented. The method is based on the cavity ringdown scheme implemented in silica-based single-mode fibers. Bending losses of fiber cavities of different lengths have been measured showing all an oscillating behavior with respect to the curvature radius of the fiber as predicted by a theoretical model. The best minimum detectable absorbance per cavity pass achieved by this new method is 1.72×10⁻³ dB within a 10 m-long cavity. This limit suffices well for an accurate determination of optical bending losses even in bend-insensitive fibers. Furthermore, the comparison of the measured bending losses with a theoretical model allows the extraction of different fiber parameters. Good agreement has been found between the experimentally derived parameters and literature data.     

Unsupervised constrained radar imaging of low resolution targets

A linear spectral estimation technique, the PDFT algorithm, is used as part of a nonlinear iterative reconstruction scheme to obtain improved radar images. The iterative PDFT algorithm is used to address the limited resolution problem inherent to imaging objects buried in soil and hidden under foliage. This is achieved by subsequent application of two properties of the PDFT algorithm: the energy parameter of the PDFT algorithm is used to determine the target shape, while the shape information in turn is used to obtain super-resolved images. We describe algorithms able to exploit both properties automatically and without manual intervention. Two methods are investigated in particular, one iteratively optimizing the constraints by monitoring the energy parameter, the other method computing energy values for all points, from which a weighted prior function is determined. In addition, we discuss variants of both algorithm which provide an optimized trade-off between computation time and performance. Additional attention is given to situations, where a known target is embedded in an unknown background. Imaging results are presented for both synthetic and measured data.