Essenzen

Ohne Zusammenfassung     

Zinn und Antimon in Legierungen

Ohne Zusammenfassung     

Zur Zuckerbestimmung

Ohne Zusammenfassung     

Eine neue volumetrische Methode zur Bestimmung der salpetrigen S?ure

Ohne Zusammenfassung     

Alkohole

Ohne Zusammenfassung     

The magnetization behavior of nanocrystalline permanent magnets based on the Stoner–Wohlfarth Model

The magnetization behavior in nanocrystalline permanent magnets has been investigated using mean field Stoner–Wohlfarth model. The model is comparatively simple but allows the numerical treatment of extended nanostructures. The predominant intergrain exchange coupling is expressed by a mean field constant N_m in spite of no explicit relationship between N_m and the microstructure. By this model, the experimental phenomena, such as the remanence enhancement, the shape of demagnetization curve, the irreversible magnetization, the exchange bias field and their respective temperature dependence, can be well explained. The N_m dependence of magnetic properties has been extensively discussed in the present paper.     

Level of nodes in increasing trees revisited

Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

An analytic approach for the analysis of rotations in fringe-balanced binary search trees

This paper presents an analytic approach to the construction cost of fringe-balanced binary search trees. In [7], Mahmoud used a bottom-up approach and an urn model of Pólya. The present method is top-down and uses differential equations and Hwang's quasi-power theorem to derive the asymptotic normality of the number of rotations needed to construct such afringe balanced search tree. We also obtain the exact expectation and variance with this method. Although Pólya's urn model is no longer needed, we also present an elegant analysis of it based on an operator calculus as in [4].This research was supported by the Austrian Research Society (FWF) under the project number P12599-MAT.