An Improved Design Procedure for LCC Resonant Filter of Dimmable Electronic Ballasts for Fluorescent Lamps, Based on Lamp Model

This paper presents an improved design methodology for determining the parameters used in the classical Series-Parallel Loaded Resonant (SPLR) filter employed in the switching frequency controlled dimmable electronic ballasts. According to the analysis developed in this paper, it is possible to evaluate some characteristics of the resonant filter during the dimming process, such as: range of switching frequency, phase shift and rms value of the current drained by the resonant filter + fluorescent lamp set.

Dimmable electronic ballast with high power-factor SEPIC preregulator, for multiple tubular fluorescent lamps

An electronic ballast for multiple tubular fluorescent lamps is presented in this paper. The proposed structure features high power-factor, dimming capability, and soft-switching to the semiconductor devices operated in high frequencies. A Zero-Current-Switching - Pulse-Width-Modulated (ZCS-PWM) SEPIC converter composes the rectifying stage, controlled by the instantaneous average input current technique, performing soft-commutations and high input power factor. Regarding the inverting stage, it is composed by a classical resonant Half-Bridge converter, associated to Series Parallel-Loaded Resonant (SPLR) filters. The dimming control technique employed in this Half-Bridge inverter is based on the phase-shift in the current processed through the sets of filter + lamp. In addition, experimental results are shown in order to validate the developed analysis.

Reatores eletrônicos para sistemas de iluminação com múltiplas lâmpadas tubulares fluorescentes com controle de luminosidade, elevada eficiência e elevado fator de potência

Pós-graduação em Engenharia Elétrica - FEIS

Maintenance optimisation of a multi-state series-parallel system considering economic dependence and state-dependent inspection intervals

This paper presents a maintenance optimisation method for a multi-state series-parallel system considering economic dependence and state-dependent inspection intervals. The objective function considered in the paper is the average revenue per unit time calculated based on the semi-regenerative theory and the universal generating function (UGF). A new algorithm using the stochastic ordering is also developed in this paper to reduce the search space of maintenance strategies and to enhance the efficiency of optimisation algorithms. A numerical simulation is presented in the study to evaluate the efficiency of the proposed maintenance strategy and optimisation algorithms. The simulation result reveals that maintenance strategies with opportunistic maintenance and state-dependent inspection intervals are more cost-effective when the influence of economic dependence and inspection cost is significant. The study further demonstrates that the optimisation algorithm proposed in this paper has higher computational efficiency than the commonly employed heuristic algorithms.

Electric field distribution in resonant reflection filters under normal incidence

Electric field distributions inside resonant reflection filters constructed using planar periodic waveguides are investigated in this paper. The electric fields may be intensified by resonance effects. Although the resonant reflection peaks can be quite narrow using weakly modulated planar periodic waveguides, the strong electric field enhancement limits their use in high-power laser systems. Strongly modulated waveguides may be used to reduce the electric field enhancement and a cover layer may be used to narrow the bandwidth at the same time. Desired results (i.e. almost no electric field enhancement together with narrow bandwidth) can be realized using this simple structure.

Synthesis of positive-real functions with low-complexity series-parallel networks

The purpose of this paper is to continue to develop the recently introduced concept of a regular positive-real function and its application to the classification of low-complexity two-terminal networks. This paper studies five- and six-element series-parallel networks with three reactive elements and presents a complete characterisation and graphical representation of the realisability conditions for these networks. The results are motivated by an approach to passive mechanical control which makes use of the inerter device. ©2009 IEEE.

Series-parallel six-element synthesis of biquadratic impedances

The object of this paper is to give a complete treatment of the realizability of positive-real biquadratic impedance functions by six-element series-parallel networks comprising resistors, capacitors, and inductors. This question was studied but not fully resolved in the classical electrical circuit literature. Renewed interest in this question arises in the synthesis of passive mechanical impedances. Recent work by the authors has introduced the concept of a regular positive-real functions. It was shown that five-element networks are capable of realizing all regular and some (but not all) nonregular biquadratic positive-real functions. Accordingly, the focus of this paper is on the realizability of nonregular biquadratics. It will be shown that the only six-element series-parallel networks which are capable of realizing nonregular biquadratic impedances are those with three reactive elements or four reactive elements. We identify a set of networks that can realize all the nonregular biquadratic functions for each of the two cases. The realizability conditions for the networks are expressed in terms of a canonical form for biquadratics. The nonregular realizable region for each of the networks is explicitly characterized. © 2004-2012 IEEE.

Single machine scheduling and due date assignment under series-parallel precedence constraints

We consider a single machine due date assignment and scheduling problem of minimizing holding costs with no tardy jobs tinder series parallel and somewhat wider class of precedence constraints as well as the properties of series-parallel graphs.

Novel periodically loaded E-plane filters

Novel E-plane waveguide filters with periodically loaded resonators are proposed. The proposed filters make use of the slow wave effect in order to achieve improved stopband performance and size reduction of roughly 50% without introducing any complexity in the fabrication process. Numerical and experimental results are presented to validate the argument.

On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs

A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two algorithms, one serial and one parallel, to maintain series-parallel (SP) relationships "on the fly" for fork-join multithreaded programs. The serial SP-order algorithm runs in O(1) amortized time per operation. In contrast, the previously best algorithm requires a time per operation that is proportional to Tarjan’s functional inverse of Ackermann’s function. SP-order employs an order-maintenance data structure that allows us to implement a more efficient "English-Hebrew" labeling scheme than was used in earlier race detectors, which immediately yields an improved determinacy-race detector. In particular, any fork-join program running in T₁ time on a single processor can be checked on the fly for determinacy races in O(T₁) time. Corresponding improved bounds can also be obtained for more sophisticated data-race detectors, for example, those that use locks. By combining SP-order with Feng and Leiserson’s serial SP-bags algorithm, we obtain a parallel SP-maintenance algorithm, called SP-hybrid. Suppose that a fork-join program has n threads, T₁ work, and a critical-path length of T[subscript ∞]. When executed on P processors, we prove that SP-hybrid runs in O((T₁/P + PT[subscript ∞]) lg n) expected time. To understand this bound, consider that the original program obtains linear speed-up over a 1-processor execution when P = O(T₁/T[subscript ∞]). In contrast, SP-hybrid obtains linear speed-up when P = O(√T₁/T[subscript ∞]), but the work is increased by a factor of O(lg n).

Maximum Series-Parallel Subgraph

Consider the NP-hard problem of, given a simple graph G, to find a series-parallel subgraph of G with the maximum number of edges. The algorithm that, given a connected graph G, outputs a spanning tree of G, is a 1/2-approximation. Indeed, if n is the number of vertices in G, any spanning tree in G has n-1 edges and any series-parallel graph on n vertices has at most 2n-3 edges. We present a 7/12 -approximation for this problem and results showing the limits of our approach.