Comparative energies of Zn(II) cation localization as a function of the distance between two forming cation position aluminium ions in high-silica zeolites

Periodical calculations of Zn(II) metal cation stabilization in cationic positions with distantly placed aluminium ions has been performed for high-silica ferrierite. It was found that decrease of the stabilization energy at large distances between Al ions (more than 10 Å) is about of 2 eV in comparison with nearest possible position of two Al ions in the zeolite lattice and weekly depended on following increase of the Al-Al distance. Main changes in stabilization energy occured within a 3-Å interval of these distances. Only for the localizations of both Al ions in one zeolite ring zinc cationic form is more stable than hydrogen form.     

On the recognition problem of quasi-homogeneous locally nilpotent derivations in dimension three

We give a criterion to decide if a given w-homogeneous derivation on A?k[X₁,X₂,X₃] is locally nilpotent. We deduce an algorithm which decides if a k-subalgebra of A, which is finitely generated by w-homogeneous elements, is the kernel of some locally nilpotent derivation.     

Approximations for Markovian multi-class queues with preemptive priorities

We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach yields small-to-moderate approximation errors.     

Fischer--Tropsch, hydrotreating and superClaus catalysts

In modern society the application of catalysts, and hence, research in the field of catalysis, is becoming more and more important. In the strongly increasing chemical industry most reaction processes are performed with the aid of catalysts. Knowledge about the structure of the active sites present at the surface of catalysts will facilitate the design of new catalysts with better performances. Such knowledge can be obtained by Mössbauer spectroscopy, which is an excellent in-situ characterization technique due to the high penetrating power of the γ-radiation used and the sensitivity of the spectral parameters for the chemical state and local environment of the Mössbauer atoms.     

Shape transition from InAs quantum dash to quantum dot on InP(3 1 1)A

We report on the shape transition from InAs quantum dashes to quantum dots (QDs) on lattice-matched GaInAsP on InP(3 1 1)A substrates. InAs quantum dashes develop during chemical-beam epitaxy of 3.2 monolayers InAs, which transform into round InAs QDs by introducing a growth interruption without arsenic flux after InAs deposition. The shape transition is solely attributed to surface properties, i.e., increase of the surface energy and symmetry under arsenic deficient conditions. The round QD shape is maintained during subsequent GaInAsP overgrowth because the reversed shape transition from dot to dash is kinetically hindered by the decreased ad-atom diffusion under arsenic flux.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

Stark's conjecture over complex cubic number fields

Systematic computation of Stark units over nontotally real base fields is carried out for the first time. Since the information provided by Stark's conjecture is significantly less in this situation than the information provided over totally real base fields, new techniques are required. Precomputing Stark units in relative quadratic extensions (where the conjecture is already known to hold) and coupling this information with the Fincke-Pohst algorithm applied to certain quadratic forms leads to a significant reduction in search time for finding Stark units in larger extensions (where the conjecture is still unproven). Stark's conjecture is verified in each case for these Stark units in larger extensions and explicit generating polynomials for abelian extensions over complex cubic base fields, including Hilbert class fields, are obtained from the minimal polynomials of these new Stark units.