Topology Optimization of Electric Machines based on Topological Sensitivity Analysis

Topological sensitivities are a very useful tool for determining optimal designs. The topological derivative of a domain-dependent functional represents the sensitivity with respect to the insertion of an infinitesimally small hole. In the gradient-based ON/OFF method, proposed by M. Ohtake, Y. Okamoto and N. Takahashi in 2005, sensitivities of the functional with respect to a local variation of the material coefficient are considered. We show that, in the case of a linear state equation, these two kinds of sensitivities coincide. For the sensitivities computed in the ON/OFF method, the generalization to the case of a nonlinear state equation is straightforward, whereas the computation of topological derivatives in the nonlinear case is ongoing work. We will show numerical results obtained by applying the ON/OFF method in the nonlinear case to the optimization of an electric motor.Comment: 20 pages, 7 figure

The effects of debt versus equity inflows on savings and growth in developing economies.

Auslandsschuldendienst; Kapitalimport; Wirtschaftswachstum; Sparen; Entwicklungsländer;

Calculation of Hydrogenic Bethe Logarithms for Rydberg States

We describe the calculation of hydrogenic (one-loop) Bethe logarithms for all states with principal quantum numbers n <= 200. While, in principle, the calculation of the Bethe logarithm is a rather easy computational problem involving only the nonrelativistic (Schroedinger) theory of the hydrogen atom, certain calculational difficulties affect highly excited states, and in particular states for which the principal quantum number is much larger than the orbital angular momentum quantum number. Two evaluation methods are contrasted. One of these is based on the calculation of the principal value of a specific integral over a virtual photon energy. The other method relies directly on the spectral representation of the Schroedinger-Coulomb propagator. Selected numerical results are presented. The full set of values is available at quant-ph/0504002.Comment: 10 pages, RevTe

Solving k-Set Agreement with Stable Skeleton Graphs

In this paper we consider the k-set agreement problem in distributed message-passing systems using a round-based approach: Both synchrony of communication and failures are captured just by means of the messages that arrive within a round, resulting in round-by-round communication graphs that can be characterized by simple communication predicates. We introduce the weak communication predicate PSources(k) and show that it is tight for k-set agreement, in the following sense: We (i) prove that there is no algorithm for solving (k-1)-set agreement in systems characterized by PSources(k), and (ii) present a novel distributed algorithm that achieves k-set agreement in runs where PSources(k) holds. Our algorithm uses local approximations of the stable skeleton graph, which reflects the underlying perpetual synchrony of a run. We prove that this approximation is correct in all runs, regardless of the communication predicate, and show that graph-theoretic properties of the stable skeleton graph can be used to solve k-set agreement if PSources(k) holds.Comment: to appear in 16th IEEE Workshop on Dependable Parallel, Distributed and Network-Centric System