Improved natural balancing with modified phase shifted PWM for single-leg five-level flying-capacitor converters

Flying capacitor converters (FCCs), as most multilevel converter topologies, require a balancing mechanism of the capacitor voltages. FCCs have the valuable property of natural voltage balancing when a special modulation technique is used. The classic methods, like Phase-Shifted Pulse Width Modulation (PS-PWM), result in very slow balancing for some duty ratio ranges. Previous work showed that for a single-leg five-level FCC one time constant is infinite for a zero desired output voltage. In this paper, a modified PS-PWM scheme for a single-leg fivelevel FCC is presented which results in faster balancing over the total duty ratio range. The modified PS-PWM scheme is studied, resulting in an averaged voltage balancing model. This model is verified using simulations and experiments. The modified PS-PWM scheme solves the slow balancing problems of the normal PS-PWM method for odd-level FCCs, while maintaining the passive control property, and it provides a self-precharge capability

Quasirandom Load Balancing

We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random algorithm by keeping the accumulated rounding errors as small as possible. Our new algorithm surprisingly closely approximates the idealized process (where the tokens are divisible) on important network topologies. On d-dimensional torus graphs with n nodes it deviates from the idealized process only by an additive constant. In contrast to that, the randomized rounding approach of Friedrich and Sauerwald (2009) can deviate up to Omega(polylog(n)) and the deterministic algorithm of Rabani, Sinclair and Wanka (1998) has a deviation of Omega(n^{1/d}). This makes our quasirandom algorithm the first known algorithm for this setting which is optimal both in time and achieved smoothness. We further show that also on the hypercube our algorithm has a smaller deviation from the idealized process than the previous algorithms.Comment: 25 page

Three Remarks on “Reflective Equilibrium“

John Rawls’ “reflective equilibrium” ranges amongst the most popular conceptions in contemporary ethics when it comes to the basic methodological question of how to justify and trade off different normative positions and attitudes. Even where Rawls’ specific contractualist account is not adhered to, “reflective equilibrium” is readily adopted as the guiding idea of coherentist approaches, seeking moral justification not in a purely deductive or inductive manner, but in some balancing procedure that will eventually procure a stable adjustment of relevant doctrines and standpoints. However, it appears that the widespread use of this idea has led to some considerable deviations from its meaning within Rawls’ original framework and to a critical loss of conceptual cogency as an ethico-hermeneutical tool. This contribution identifies three kinds of “balancing” constellations that are frequently, but inadequately brought forth under the heading of Rawlsian “reflective equilibrium”: balancing theoretical accounts against intuitive convictions; balancing general principles against particular judgements; balancing opposite ethical conceptions or divergent moral statements, respectively. It is argued that each of these applications departs from Rawls’ original construction of “reflective equilibrium” and also deprives the idea of its reliability in clarifying and weighing moral stances

Toric dynamical systems

Toric dynamical systems are known as complex balancing mass action systems in the mathematical chemistry literature, where many of their remarkable properties have been established. They include as special cases all deficiency zero systems and all detailed balancing systems. One feature is that the steady state locus of a toric dynamical system is a toric variety, which has a unique point within each invariant polyhedron. We develop the basic theory of toric dynamical systems in the context of computational algebraic geometry and show that the associated moduli space is also a toric variety. It is conjectured that the complex balancing state is a global attractor. We prove this for detailed balancing systems whose invariant polyhedron is two-dimensional and bounded.Comment: We include the proof of our Conjecture 5 (now Lemma 5) and add some reference

Dynamic load balancing algorithm complexity

This paper presents a theoretical analysis of the asymptotic complexity inherent in a load balancing algorithm in a loosely-coupled network, where processor communication is achieved by message passing. The load balancing complexity depends on the network topology and the overhead of processor communication for each polling strategy. The best, worst, and average case analysis of the load balancing algorithms for the various polling topologies are presented. The polling strategies considered are local, global, and random polling. The complexity is presented as a function of the number of processors in the network