Nachweis und Bestimmung des Mangans sowie seine Trennung von anderen Elementen

Ohne Zusammenfassung     

Cer

Ohne Zusammenfassung     

The elastic fields of misfit cylindrical particles: a dislocation-based numerical approach

Analytical solutions for the displacement and stress fields due to a misfit particle in a host matrix can be difficult to obtain, especially for complex particle geometries. In this work, we present a numerical method for finding such fields in the case of infinitely-long particles. The method is based on discretizing the continuous misfit region between the particle and matrix into local misfit regions consisting of interstitial dislocation loops. The results presented here indicate very good agreement with analytical solutions and better convergence with increasing loop density.     

Hörmander Class of Pseudo-Differential Operators on Compact Lie Groups and Global Hypoellipticity

In this paper we give several global characterisations of the Hörmander class \(\Psi ^m(G)\) of pseudo-differential operators on compact Lie groups in terms of the representation theory of the group. The result is applied to give criteria for the ellipticity and the global hypoellipticity of pseudo-differential operators in terms of their matrix-valued full symbols. Several examples of the first and second order globally hypoelliptic differential operators are given, in particular of operators that are locally not invertible nor hypoelliptic but globally are. Where the global hypoelliptiticy fails, one can construct explicit examples based on the analysis of the global symbols.     

Optimizing cost flows by edge cost and capacity upgrade

We examine a network upgrade problem for cost flows. A budget can be distributed among the arcs of the network. An investment on each single arc can be used either to decrease the arc flow cost, or to increase the arc capacity, or both. The goal is to maximize the flow through the network while not exceeding bounds on the budget and on the total flow cost.

The problems are NP-hard even on series-parallel graphs. We provide an approximation algorithm on series-parallel graphs which, for arbitrary δ,>0, produces a solution which exceeds the bounds on the budget and the flow cost by factors of at most 1+δ and 1+, respectively, while the amount of flow is at least that of an optimum solution. The running time of the algorithm is polynomial in the input size and 1/(δ). In addition we give an approximation algorithm on general graphs applicable to problem instances with small arc capacities.     

Novel cyclization cascades to functionalized indanes and tetrahydronaphthalenes

Cyclization cascades involving C-C bond formations followed by lactonization reactions provide fast access to structurally complex tricyclic indane and tetrahydronaphthalene derivatives.