Diffusive clustering in an infinite system of hierarchically interacting diffusions

Summary We study a countable system of interacting diffusions on the interval [0,1], indexed by a hierarchical group. A particular choice of the interaction guaranties, we are in the diffusive clustering regime. This means clusters of components with values either close to 0 or close to 1 grow on various different scales. However, single components oscillate infinitely often between values close to 0 and close to 1 in such a way that they spend fraction one of their time together and close to the boundary. The processes in the whole class considered and starting with a shift-ergodic initial law have the same qualitative properties (universality).     

Trovacenchemie. 13 [1] Weg und Irrweg zu Di([5]trovacenyl)keton

Trovacene Chemistry. 13 [1] On Being Lead and Mislead in the Synthesis of Di([5]trovacenyl)ketone Di([5]trovacenyl)ketone ( 3¨ ) has been prepared from lithio‐[5]trovacene and dimethylcarbamoyl chloride and studied by X‐ray diffraction, cyclic voltammetry, magnetic susceptometry and EPR spectroscopy. Slight variation of the synthetic protocol affords an unusual trinuclear complex 5 ? that is also fully characterized. Spin‐spin exchange interaction is smaller in 3¨ than in 1,1‐di([5]trovacenylethene ( 2¨ ), which differs from 3¨ by a replacement of O for CH₂. The novel trinuclear complex 5 ? , however, displays exchange coupling very similar to that observed in 1‐methoxy‐2,5,6‐tri([5]trovacenyl)benzene ( 7 ? ). In both cases, an unsymmetrical triangular arrangement of S = 1/2 centers is encountered. These findings are discussed in terms of the nature of the respective spacers.     

Standardization of Methods for Characterizing the Surface Geometry of Solids

Since a comprehensive survey published in 1999 [1] much work was done in standardizing measuring methods to characterize the surface geometry of dispersed and/or porous solids and to certify reference materials. The present paper is an extension of a short communication [2]. It gives a survey on existing standards and reports on new drafts and proposals.     

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.