Bildungsweise der isomeren Bibromcampher

Ohne Zusammenfassung     

Electronic transport properties of bismuth nanobridges through silicon-nitride membranes

The electronic transport through nanostructured bismuth nanobridges has been investigated at low temperatures (T<2 K) and in magnetic fields B up to 8.5 T. The samples show reproducible resistance fluctuations as a function of B, superimposed on a large magnetoresistance of up to 50%. In addition, time-dependent resistance fluctuations in zero magnetic field demonstrate the presence of bistable scatterers in the constriction region of our samples, which are described by two-level systems. Their dynamics are shown to be sensitive to subtle modifications of the static scatterer configuration in their vicinity, which cannot be detected in the sample magnetofingerprint.     

Sorption Behaviour of Molybdenum on Different Antimonates Ion Exchangers

Various antimonate compounds are well known as important inorganic ion exchangers, since they resist radiation and chemical degradation and also exhibit selectivities towards different cations. Ceric, silicon, titanium and ferric antimonates were prepared as inorganic ion exchangers. Characterization of these materials has been described using different techniques, including thermal analysis, surface area measurements, X-ray diffraction and IR-spectroscopy. In batch distribution experiments the influence of HNO₃ molarity and Mo concentration for Mo sorption on different matrices is described in terms of their retention capacities and distribution coefficients.The selectivities of these exchangers towards molybdenum are in the order: CeSb > SiSb > FeSb > TiSb.     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.