Charge transport in a polypeptide chain

Charge transport is one important example of signal transduction in a protein which is responsible for action at a distance, and is a fundamental process in biochemical action. A model is presented in which electronic effects interact with motional processes to combine into a bifunctional model. This model is investigated with new detailed molecular dynamics calculations and successfully explains such action at a distance. Received 1st February 2002 / Received in final form 26 May 2002 Published online 13 September 2002     

Magnetic anisotropy of textured CrO2 thin films investigated by X-ray magnetic circular dichroism

Highly a-axis-textured CrO₂ films have been deposited on Al₂O₃ (0001) substrates by chemical vapor deposition. CrO₂ has been found to have highly a-axis (010)-oriented columnar growth on a Cr₂O₃ (0001) initial layer. The six-fold surface symmetry of the Cr₂O₃ initial layer leads to three equivalent in-plane orientations of the a-axis-oriented CrO₂ unit cell. We report Cr L_2,3 X-ray magnetic circular dichroism data along the surface normal and at 60° off-normal sample orientation. For a 60° sample alignment, a strong increase of the projected orbital moment could be observed for unoccupied majority t_2g states using moment analysis. Therefore, the c axis is identified as the intrinsic magnetic easy axis of CrO₂. In addition, a small spin moment and a very strong magnetic dipole term T_z have been found. Received: 8 January 2002 / Accepted: 8 January 2002     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

Volume Chemistry of Nitrogen in Binary Metal Nitrides and Subnitrides

A comparison of the concept of volume increments created by W. Biltz with that based on quantum mechanical calculations by R.F.W. Bader was performed for crystal structures of binary metal nitrides and ‐subnitrides. The mutual comparison of both concepts permits insights into the bonding relationships of these compounds and reveals the considerable range of volume demand of a strongly polarisable bonding partner, such as the nitride ion. Finally it becomes clear that the Biltz volume increments show a quantum‐chemical relevance in the chemistry of solids.     

Local radial Phragmén-Lindelöf estimates for plurisubharmonic functions on analytic varieties

We give a sufficient condition for a local radial Phragmén-Lindelöf principle on analytic varieties. This condition is expressed in terms of existence of hyperbolic directions.

     

The opacity coefficient method—nongray determination of inhomogeneous atmospheric extinction

The computation of radiation transmittance in nongray, inhomogeneous atmospheric models is frequently complicated by complex bands of line spectra which range in value over many orders of magnitudes and depend strongly on either or both of pressure and temperature. We present here a new opacity sampling technique which is shown to determine correctly the wavelength-averaged extinction due to path-dependent realizations of banded line spectra. The technique is easy to implement computationally and is applicable to a wide variety of atmospheric problems in which frequent iteration of the radiative transfer model is required. We consider two such instances: modeling of solar flux attenuation for use in a time-dependent planetary ionosphere model and retrieval from nadir measurements of backscattered solar irradiance. The power of the new method lies in its straightforward analytical treatment of both atmospheric inhomogeneity and spectral complexity. It is thus relevant for both retrieval and radiative transfer modeling purposes.