A Time-domain Harmonic Power-Flow Analysis in Electrical Energy Distribution Networks, Using Norton Models for Non-linear Loading

The purpose of this paper is to present the application of a three-phase harmonic propagation analysis time-domain tool, using the Norton model to approach the modeling of non-linear loads, making the harmonics currents flow more appropriate to the operation analysis and to the influence of mitigation elements analysis. This software makes it possible to obtain results closer to the real distribution network, considering voltages unbalances, currents imbalances and the application of mitigation elements for harmonic distortions. In this scenario, a real case study with network data and equipments connected to the network will be presented, as well as the modeling of non-linear loads based on real data obtained from some PCCs (Points of Common Coupling) of interests for a distribution company.

Optimizing urban traffic flow using genetic algorithm with petri net analysis as fitness function

This paper describes a new methodology adopted for urban traffic stream optimization. By using Petri net analysis as fitness function of a Genetic Algorithm, an entire urban road network is controlled in real time. With the advent of new technologies that have been published, particularly focusing on communications among vehicles and roads infrastructures, we consider that vehicles can provide their positions and their destinations to a central server so that it is able to calculate the best route for one of them. Our tests concentrate on comparisons between the proposed approach and other algorithms that are currently used for the same purpose, being possible to conclude that our algorithm optimizes traffic in a relevant manner.

Comparative analysis of different meat traceability systems using multiple criteria and a social network approach

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Instantaneous complex power applied to three-phase machines

The theory presented in this paper was primarily developed to give a physical interpretation for the instantaneous power flow on a three-phase induction machine, without a neutral conductor, on any operational state and may be extended to any three-phase load. It is a vectorial interpretation of the instantaneous reactive power theory presented by Akagi et al. Which, believe the authors, isn't enough developed and its physical meaning not yet completely understood. This vectorial interpretation is based on the instantaneous complex power concept defined by Torrens for single-phase, ac, steady-state circuits, and leads to a better understanding of the power phenomenon, particularly of the distortion power. This concept has been extended by the authors to three-phase systems, through the utilization of the instantaneous space vectors. The results of measurements of instantaneous complex power on a self-excited induction generator's terminals, during an over-load application transient, are presented for illustration. The compensation of reactive power proposed by Akagi is discussed and a new horizon for the theory application is opened.

Urinary flow in children: correlation with age, body height and body surface area

Peak flow rate data (Qmax) are important for diagnosis of lower urinary tract obstruction. However, the lack of uroflowmetry studies in children, makes their interpretation difficult. With this aim, we studied 167 boys classified in four groups according to their age (G1: n = 48, 6-7 years; G2: n = 43, 8-9 years; G3: n = 37, 10-11 years; G4: n = 39, 12-14 years). We studied in all children, weight, height, body surface area, peak flow rate (Qmax) and the correspondant urinary volume (Vol). Means and standard deviations of Qmax (ml/sec) were: 15 +/- 5 (G1), 15 +/- 5 (G2), 17 +/- 5 (G3) and 22 +/- 7 (G4) respectively. Corresponding urinary volumes (Vol) (mean standard deviation-in ml) were: G1 = 123 +/- 75; G2 = 122 +/- 79; G3 = 158 +/- 96 and G4 = 162 +/- 101. We found a significant correlation (p < 0,01) between Qmax and Vol in groups G2, G3 and G4; and between Qmax and height in groups G1 and G4. The authors demonstrated a positive correlation between maximum flow and voided volume, and an increase of Qmax with age.

Quantification of Short and Medium Range Order in Mixed Network Former Glasses of the System GeO2-NaPO3: A Combined NMR and X-ray Photoelectron Spectroscopy Study

Glasses in the system xGeO(2)-(1-x)NaPO3 (0 <= x <= 0.50) were prepared by conventional melting quenching and characterized by thermal analysis, Raman spectroscopy, X-ray photoelectron spectroscopy (XPS), and P-31 nuclear magnetic resonance (MAS NMR) techniques. The deconvolution of the latter spectra was aided by homonuclear J-resolved and refocused INADEQUATE techniques. The combined analyses of P-31 MAS NMR and O-1s XPS lineshapes, taking charge and mass balance considerations into account, yield the detailed quantitative speciations of the phosphorus, germanium, and oxygen atoms and their respective connectivities. An internally consistent description is possible without invoking the formation of higher-coordinated germanium species in these glasses, in agreement with experimental evidence in the literature. The structure can be regarded, to a first approximation, as a network consisting of P-(2) and P-(3) tetrahedra linked via four-coordinate germanium. As implied by the appearance of P-(3) units, there is a moderate extent of network modifier sharing between phosphate and germanate network formers, as expressed by the formal melt reaction P-(2) + Ge-(4) -> P-(3) + Ge-(3). The equilibrium constant of this reaction is estimated as K = 0.52 +/- 0.11, indicating a preferential attraction of network modifier by the phosphorus component. These conclusions are qualitatively supported by Raman spectroscopy as well as P-31{Na-23} and P-31{Na-23} rotational echo double resonance (REDOR) NMR results. The combined interpretation of O-1s XPS and P-31 MAS NMR spectra shows further that there are clear deviations from a random connectivity scenario: heteroatomic P-O-Ge linkages are favored over homoatomic P-O-P and Ge-O-Ge linkages.

The Brazilian Network for HIV-1 Genotyping External Quality Control Assurance Programme

The Brazilian network for genotyping is composed of 21 laboratories that perform and analyze genotyping tests for all HIV-infected patients within the public system, performing approximately 25,000 tests per year. We assessed the interlaboratory and intralaboratory reproducibility of genotyping systems by creating and implementing a local external quality control evaluation. Plasma samples from HIV-1-infected individuals (with low and intermediate viral loads) or RNA viral constructs with specific mutations were used. This evaluation included analyses of sensitivity and specificity of the tests based on qualitative and quantitative criteria, which scored laboratory performance on a 100-point system. Five evaluations were performed from 2003 to 2008, with 64% of laboratories scoring over 80 points in 2003, 81% doing so in 2005, 56% in 2006, 91% in 2007, and 90% in 2008 (Kruskal-Wallis, p = 0.003). Increased performance was aided by retraining laboratories that had specific deficiencies. The results emphasize the importance of investing in laboratory training and interpretation of DNA sequencing results, especially in developing countries where public (or scarce) resources are used to manage the AIDS epidemic.

A scale-space aproach to nonlocal optical flow calculations

[EN] This paper presents an interpretation of a classic optical flow method by Nagel and Enkelmann as a tensor-driven anisotropic diffusion approach in digital image analysis. We introduce an improvement into the model formulation, and we establish well-posedness results for the resulting system of parabolic partial differential equations. Our method avoids linearizations in the optical flow constraint, and it can recover displacement fields which are far beyond the typical one-pixel limits that are characteristic for many differential methods for optical flow recovery. A robust numerical scheme is presented in detail. We avoid convergence to irrelevant local minima by embedding our method into a linear scale-space framework and using a focusing strategy from coarse to fine scales. The high accuracy of the proposed method is demonstrated by means of a synthetic and a real-world image sequence.

Algorithms for network design and routing problems

In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transportation networks: the Non-Bifurcated Capacitated Network Design Problem (NBP), the Period Vehicle Routing Problem (PVRP) and the Pickup and Delivery Problem with Time Windows (PDPTW). These problems are NP-hard and contain as special cases some well known difficult problems such as the Traveling Salesman Problem and the Steiner Tree Problem. Moreover, they model the core structure of many practical problems arising in logistics and telecommunications. The NBP is the problem of designing the optimum network to satisfy a given set of traffic demands. Given a set of nodes, a set of potential links and a set of point-to-point demands called commodities, the objective is to select the links to install and dimension their capacities so that all the demands can be routed between their respective endpoints, and the sum of link fixed costs and commodity routing costs is minimized. The problem is called non- bifurcated because the solution network must allow each demand to follow a single path, i.e., the flow of each demand cannot be splitted. Although this is the case in many real applications, the NBP has received significantly less attention in the literature than other capacitated network design problems that allow bifurcation. We describe an exact algorithm for the NBP that is based on solving by an integer programming solver a formulation of the problem strengthened by simple valid inequalities and four new heuristic algorithms. One of these heuristics is an adaptive memory metaheuristic, based on partial enumeration, that could be applied to a wider class of structured combinatorial optimization problems. In the PVRP a fleet of vehicles of identical capacity must be used to service a set of customers over a planning period of several days. Each customer specifies a service frequency, a set of allowable day-combinations and a quantity of product that the customer must receive every time he is visited. For example, a customer may require to be visited twice during a 5-day period imposing that these visits take place on Monday-Thursday or Monday-Friday or Tuesday-Friday. The problem consists in simultaneously assigning a day- combination to each customer and in designing the vehicle routes for each day so that each customer is visited the required number of times, the number of routes on each day does not exceed the number of vehicles available, and the total cost of the routes over the period is minimized. We also consider a tactical variant of this problem, called Tactical Planning Vehicle Routing Problem, where customers require to be visited on a specific day of the period but a penalty cost, called service cost, can be paid to postpone the visit to a later day than that required. At our knowledge all the algorithms proposed in the literature for the PVRP are heuristics. In this thesis we present for the first time an exact algorithm for the PVRP that is based on different relaxations of a set partitioning-like formulation. The effectiveness of the proposed algorithm is tested on a set of instances from the literature and on a new set of instances. Finally, the PDPTW is to service a set of transportation requests using a fleet of identical vehicles of limited capacity located at a central depot. Each request specifies a pickup location and a delivery location and requires that a given quantity of load is transported from the pickup location to the delivery location. Moreover, each location can be visited only within an associated time window. Each vehicle can perform at most one route and the problem is to satisfy all the requests using the available vehicles so that each request is serviced by a single vehicle, the load on each vehicle does not exceed the capacity, and all locations are visited according to their time window. We formulate the PDPTW as a set partitioning-like problem with additional cuts and we propose an exact algorithm based on different relaxations of the mathematical formulation and a branch-and-cut-and-price algorithm. The new algorithm is tested on two classes of problems from the literature and compared with a recent branch-and-cut-and-price algorithm from the literature.

A novel map-matching procedure for low-sampling GPS data with applications to traffic flow analysis

An extensive sample (2%) of private vehicles in Italy are equipped with a GPS device that periodically measures their position and dynamical state for insurance purposes. Having access to this type of data allows to develop theoretical and practical applications of great interest: the real-time reconstruction of traffic state in a certain region, the development of accurate models of vehicle dynamics, the study of the cognitive dynamics of drivers. In order for these applications to be possible, we first need to develop the ability to reconstruct the paths taken by vehicles on the road network from the raw GPS data. In fact, these data are affected by positioning errors and they are often very distanced from each other (~2 Km). For these reasons, the task of path identification is not straightforward. This thesis describes the approach we followed to reliably identify vehicle paths from this kind of low-sampling data. The problem of matching data with roads is solved with a bayesian approach of maximum likelihood. While the identification of the path taken between two consecutive GPS measures is performed with a specifically developed optimal routing algorithm, based on A* algorithm. The procedure was applied on an off-line urban data sample and proved to be robust and accurate. Future developments will extend the procedure to real-time execution and nation-wide coverage.

Numerical coupling of thermal-electric network models and energy-transport equations including optoelectronic semiconductor devices

In this work the numerical coupling of thermal and electric network models with model equations for optoelectronic semiconductor devices is presented. Modified nodal analysis (MNA) is applied to model electric networks. Thermal effects are modeled by an accompanying thermal network. Semiconductor devices are modeled by the energy-transport model, that allows for thermal effects. The energy-transport model is expandend to a model for optoelectronic semiconductor devices. The temperature of the crystal lattice of the semiconductor devices is modeled by the heat flow eqaution. The corresponding heat source term is derived under thermodynamical and phenomenological considerations of energy fluxes. The energy-transport model is coupled directly into the network equations and the heat flow equation for the lattice temperature is coupled directly into the accompanying thermal network. The coupled thermal-electric network-device model results in a system of partial differential-algebraic equations (PDAE). Numerical examples are presented for the coupling of network- and one-dimensional semiconductor equations. Hybridized mixed finite elements are applied for the space discretization of the semiconductor equations. Backward difference formluas are applied for time discretization. Thus, positivity of charge carrier densities and continuity of the current density is guaranteed even for the coupled model.

Decomposition Methods and Network Design Problems

Decomposition based approaches are recalled from primal and dual point of view. The possibility of building partially disaggregated reduced master problems is investigated. This extends the idea of aggregated-versus-disaggregated formulation to a gradual choice of alternative level of aggregation. Partial aggregation is applied to the linear multicommodity minimum cost flow problem. The possibility of having only partially aggregated bundles opens a wide range of alternatives with different trade-offs between the number of iterations and the required computation for solving it. This trade-off is explored for several sets of instances and the results are compared with the ones obtained by directly solving the natural node-arc formulation. An iterative solution process to the route assignment problem is proposed, based on the well-known Frank Wolfe algorithm. In order to provide a first feasible solution to the Frank Wolfe algorithm, a linear multicommodity min-cost flow problem is solved to optimality by using the decomposition techniques mentioned above. Solutions of this problem are useful for network orientation and design, especially in relation with public transportation systems as the Personal Rapid Transit. A single-commodity robust network design problem is addressed. In this, an undirected graph with edge costs is given together with a discrete set of balance matrices, representing different supply/demand scenarios. The goal is to determine the minimum cost installation of capacities on the edges such that the flow exchange is feasible for every scenario. A set of new instances that are computationally hard for the natural flow formulation are solved by means of a new heuristic algorithm. Finally, an efficient decomposition-based heuristic approach for a large scale stochastic unit commitment problem is presented. The addressed real-world stochastic problem employs at its core a deterministic unit commitment planning model developed by the California Independent System Operator (ISO).

Association of individual resting state EEG alpha frequency and cerebral blood flow

Cognitive task performance differs considerably between individuals. Besides cognitive capacities, attention might be a source of such differences. The individual's EEG alpha frequency (IAF) is a putative marker of the subject's state of arousal and attention, and was found to be associated with task performance and cognitive capacities. However, little is known about the metabolic substrate (i.e. the network) underlying IAF. Here we aimed to identify this network. Correlation of IAF with regional Cerebral Blood Flow (rCBF) in fifteen young healthy subjects revealed a network of brain areas that are associated with the modulation of attention and preparedness for external input, which are relevant for task execution. We hypothesize that subjects with higher IAF have pre-activated task-relevant networks and thus are both more efficient in the task-execution, and show a reduced fMRI-BOLD response to the stimulus, not because the absolute amount of activation is smaller, but because the additional activation by processing of external input is limited due to the higher baseline.

Pulsatile shear and Gja5 modulate arterial identity and remodeling events during flow-driven arteriogenesis

In the developing chicken embryo yolk sac vasculature, the expression of arterial identity genes requires arterial hemodynamic conditions. We hypothesize that arterial flow must provide a unique signal that is relevant for supporting arterial identity gene expression and is absent in veins. We analyzed factors related to flow, pressure and oxygenation in the chicken embryo vitelline vasculature in vivo. The best discrimination between arteries and veins was obtained by calculating the maximal pulsatile increase in shear rate relative to the time-averaged shear rate in the same vessel: the relative pulse slope index (RPSI). RPSI was significantly higher in arteries than veins. Arterial endothelial cells exposed to pulsatile shear in vitro augmented arterial marker expression as compared with exposure to constant shear. The expression of Gja5 correlated with arterial flow patterns: the redistribution of arterial flow provoked by vitelline artery ligation resulted in flow-driven collateral arterial network formation and was associated with increased expression of Gja5. In situ hybridization in normal and ligation embryos confirmed that Gja5 expression is confined to arteries and regulated by flow. In mice, Gja5 (connexin 40) was also expressed in arteries. In the adult, increased flow drives arteriogenesis and the formation of collateral arterial networks in peripheral occlusive diseases. Genetic ablation of Gja5 function in mice resulted in reduced arteriogenesis in two occlusion models. We conclude that pulsatile shear patterns may be central for supporting arterial identity, and that arterial Gja5 expression plays a functional role in flow-driven arteriogenesis.

Intussusceptive angiogenesis: pillars against the blood flow

Adaptation of vascular networks to functional demands needs vessel growth, vessel regression and vascular remodelling. Biomechanical forces resulting from blood flow play a key role in these processes. It is well-known that metabolic stimuli, mechanical forces and flow patterns can affect gene expression and remodelling of vascular networks in different ways. For instance, in the sprouting type of angiogenesis related to hypoxia, there is no blood flow in the rising capillary sprout. In contrast, it has been shown that an increase of wall shear stress initiates the splitting type of angiogenesis in skeletal muscle. Otherwise, during development, both sprouting and intussusception act in parallel in building the vascular network, although with differences in spatiotemporal distribution. Thereby, in addition to regulatory molecules, flow dynamics support the patterning and remodelling of the rising vascular tree. Herewith, we present an overview of angiogenic processes with respect to intussusceptive angiogenesis as related to local haemodynamics.