Alocação ótima de chaves de interconexão nas redes de distribuição de energia elétrica

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

Modelo matemático para o controle ótimo de Volt/VAr em sistemas de distribuição de energia elétrica trifásicos

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

Modelação de redes de distribuição de energia elétrica com carregamento não linear, incluindo elementos de regulação e compensação

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

Melhoria nas forças restaurativas do equilíbrio do gerador de indução duplamente alimentado por meio de controle da tensão interna

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

Reconfiguração de sistemas de distribuição operando em vários níveis de demanda através de uma meta-heurística de busca em vizinhança variável

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

Switch allocation problems in power distribution systems

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Shared Escovopsis parasites between leaf-cutting and non-leaf-cutting ants in the higher attine fungus-growing ant symbiosis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Modelling and determination of metabolic pools by stable carbon isotopes in the avian duodenal mucosa and albumen

Stable isotope analyses have helped in assessing dietary switches if the diet undergoes metabolic alteration (isotopic exchange). However, when considering the effects over time of switching from one diet to another, one can assess how quickly the new diet is incorporated into tissues via the isotopic renewal or incorporation rate, or turnover. Turnover is obtained using exponential curves that fit the original data, allowing the determination of practical order parameters such as the half-life (T) and the turnover constant (k). Researchers have found that metabolic incorporation can be fractionated. The resulting fractions, called metabolic pools, are identified using the linearization of the isotopic exchange model and its linear fit. This fractionation methodology is still not well defined. The objective of this study was to assess the behaviour of the metabolic renewal rate (turnover) in fractionated form, explain the theory, and apply it to data from the avian duodenal mucosa and albumen. We concluded that the duodenal mucosa has one metabolic pool, with a half-life of 1.23 days, and that the albumen has two metabolic pools, with half-lives of 1.89 and 6.32 days.

A novel single-phase ZCS-PWM high power factor boost rectifier

This paper presents a novel single-phase high power factor PWM boost rectifier, featuring soft commutation of the active switches at zero-current (ZCS). It incorporates the most desirable properties of the conventional PWM and the soft-switching resonant techniques. The input current shaping is achieved with average current mode control, and continuous inductor current mode. This new PWM converter provides ZCS turn-on and turn-off of the active switches, and it is suitable for high power applications employing IGBTs. Principle of operation, theoretical analysis, a design example, and experimental results from a laboratory prototype rated at 1600 W with 400 Vdc output voltage are presented. The measured efficiency and power factor were 96.2% and 0.99 respectively, with an input current THD equal to 3.94%, for an input voltage THD equal to 3.8%, at rated load.

Microinversor integrado ao módulo fotovoltaico para sistemas conectados à rede elétrica utilizando controlador ressonante

This paper shows the modeling and control of a single-phase full-bridge inverter with high-frequency transformer that may be used as part of a two-stage converter with transformerless DC-DC side or as a single-stage converter (simple DC-AC converter) for grid-connected PV applications. The inverter is modeled in order to obtain a small-signal transfer function used to design the P+Resonant current controller. A highfrequency step-up transformer results in reduced voltage switches and better efficiency compared with converters in which the transformer is used on the DC-DC side. Simulations and experimental results with a 200 W prototype are shown. 1

Elimination of All-Optical Cycles in Wavelength-Routed Optical Networks

A transparent (wide-area) wavelength-routed optical network may be constructed by using wavelength cross-connect switches connected together by fiber to form an arbitrary mesh structure. The network is accessed through electronic stations that are attached to some of these cross-connects. These wavelength cross-connect switches have the property that they may configure themselves into unspecified states. Each input port of a switch is always connected to some output port of the switch whether or not such a connection is required for the purpose of information transfer. Due to the presence of these unspecified states, there exists the possibility of setting up unintended alloptical cycles in the network (viz., a loop with no terminating electronics in it). If such a cycle contains amplifiers [e.g., Erbium- Doped Fiber Amplifiers (EDFA’s)], there exists the possibility that the net loop gain is greater than the net loop loss. The amplified spontaneous emission (ASE) noise from amplifiers can build up in such a feedback loop to saturate the amplifiers and result in oscillations of the ASE noise in the loop. Such all-optical cycles as defined above (and hereafter referred to as “white” cycles) must be eliminated from an optical network in order for the network to perform any useful operation. Furthermore, for the realistic case in which the wavelength cross-connects result in signal crosstalk, there is a possibility of having closed cycles with oscillating crosstalk signals. We examine algorithms that set up new transparent optical connections upon request while avoiding the creation of such cycles in the network. These algorithms attempt to find a route for a connection and then (in a post-processing fashion) configure switches such that white cycles that might get created would automatically get eliminated. In addition, our call-set-up algorithms can avoid the possibility of crosstalk cycles.

Optical Communication Networks for the Next-Generation Internet

Computer and telecommunication networks are changing the world dramatically and will continue to do so in the foreseeable future. The Internet, primarily based on packet switches, provides very flexible data services such as e-mail and access to the World Wide Web. The Internet is a variable-delay, variable- bandwidth network that provides no guarantee on quality of service (QoS) in its initial phase. New services are being added to the pure data delivery framework of yesterday. Such high demands on capacity could lead to a “bandwidth crunch” at the core wide-area network, resulting in degradation of service quality. Fortunately, technological innovations have emerged which can provide relief to the end user to overcome the Internet’s well-known delay and bandwidth limitations. At the physical layer, a major overhaul of existing networks has been envisaged from electronic media (e.g., twisted pair and cable) to optical fibers - in wide-area, metropolitan-area, and even local-area settings. In order to exploit the immense bandwidth potential of optical fiber, interesting multiplexing techniques have been developed over the years.

BER-Based Call Admission In Wavelength-Routed Optical Networks

Consider a wavelength-routed optical network in which nodes, i.e., multiwave length cross-connect switches (XCSs), are connected by fiber to form an arbitrary physical topology. A new call is admitted into the network if an all-optical lightpath can be established between the call’s source and destination nodes. Wavelength converters are assumed absent in this work.

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

A load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks

The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by Generic Framing Procedure (GFP) and Virtual Concatenation (VC). The core of the network tends to be a meshed architecture equipped with Multi-Service Switches (MSSs). In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider the spare capacity reallocation problem from a capacity upgrade and network planning perspective. Our approach can operate in the context of shared-path protection (with backup multiplexing) because it reallocates spare capacity without disrupting working services. Unlike previous spare capacity reallocation approaches which aim at minimizing total spare capacity, our load-balancing approach minimizes the network load vector (NLV), which is a novel metric that reflects the network load distribution. Because NLV takes into consideration both uniform and non-uniform link capacity distribution, our approach can benefit both uniform and non-uniform networks. We develop a greedy loadbalancing spare capacity reallocation (GLB-SCR) heuristic algorithm to implement this approach. Our experimental results show that GLB-SCR outperforms a previously proposed algorithm (SSR) in terms of established connection capacity and total network capacity in both uniform and non-uniform networks.