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     

Ultrasonic evaluation of anisotropic damage in multiaxially textile-reinforced thermoplastic composites made from hybrid yarns

The basic damage and failure models of multiaxially reinforced composites with a thermoplastic matrix are presented and verified. Within the framework of continuum damage mechanics, a phenomenological model is introduced, where the damage is defined as a change in the elasticity tensor. For damage identification, a specific ultrasonic device was developed. A combination of an immersion set-up and a contact coupling device formed a system for an efficient determination of stiffness-tensor components from convenient sets of velocity measurements. Linked to a tensile machine, it allowed us to measure the anisotropic damage of the new materials group caused by tensile loading. Russian translation published in Mekhanika Kompozitnykh Materialov, Vol. 42, No. 2, pp. 221–234, March–April, 2006.     

A note on the Σ1 spectrum of a theory

Let T be a suitable system of classical set theory. We will show, that the Σ₁ spectrum of T, i.e. the set of ordinals having good Σ₁ definition in T is an initial segment of the ordinals. Received: 11 October 1999 / Published online: 12 December 2001     

Optimization of the synthesis of non-symmetrical alkyl dimethyl sulfonium halides

This work is aimed at the optimization of the yield and purity of non-symmetrical trialkyl sulfonium halide salts. The effects of parameters such as solvent, temperature and concentration were studied. The products were carefully analyzed and the crystal structure of [{n-CH₃(CH₂)₁₅}(CH₃)₂S]Br determined. The overall aim of the present study is future syntheses of low-dimensional magnetic materials.     

Diffusive motion of iron microcrystals studied by Mössbauer spectroscopy

A new model is presented which explains well the dramatic decrease of the Mössbauer line intensities with raising temperatures for freely dispersed iron microscrystals. In contrast to other theories which consider mainly vibration to be responsible we discuss here the decrease in terms of large amplitude diffusive rotational or translational jumps of the particles. Such diffusive jumps lead — in agreement with the observation — to a strong reduction of the Mössbauer-intensity without broadening the line width in a noticeable way. The typical potential well for a diffusing particle in an equilibrium position is derived quantitatively to be 13 meV. The model might be important also for a new understanding of the dynamics of catalytic clusters either in contact with each other or with larger solid surfaces.Part of this work was supported by the DFG Sonderforschungsbereich 306, Konstanz     

Stability of Crystalline Ion Beams

Hyperfine Interactions - In this paper, the conditions for which three-dimensional crystalline ion beams were attained in the rf quadrupole storage ring PALLAS at a velocity of around 2800 m/s are...     

Stratifiable Families of Extremals and Sufficient Conditions for Optimality in Optimal Control Problems

It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity.     

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.