Field-based models for low speed switched reluctance machine designs

Trabalho apresentado na Conferência CPE-POWERENG 2016, 29 junho a 01 de julho 2016, Bydgoszcz, Polónia

Molecular phylogeny and biogeography of the dung beetle genus Temnoplectron Westwood (Scarabaeidae: Scarabaeinae) from Australia’s wet tropics

The landscape of the Australian Wet Tropics can be described as islands of montane rainforest Surrounded by warmer or more xeric habitats. Historical glaciation cycles have caused expansion and contraction of these rainforest islands leading to consistent patterns of genetic divergence within species of vertebrates. To explore whether this dynamic history has promoted speciation in endemic and diverse groups Of insects, we used a combination of mtDNA sequencing and morphological characters to estimate relationships and the tempo of divergence among Australian representatives of the dung beetle genus Temnoplectron. This phylogenetic hypothesis shares a number of well-supported clades with a previously published phylogenetic hypothesis based on morphological data. though statistical support for several nodes is weak. Sister species relationships well-supported in both tree topologies. and a tree obtained by combining the two data sets. suggest that speciation has mostly been allopatric. We identify a number of speciation barriers, which coincide with phylogeographic breaks found in vertebrate species. Large sequence divergences between species emphasize that speciation events are ancient (pre-Pleistocene). The flightless, rainforest species appear to have speciated rapidly. but also in the distant past. (C) 2003 Elsevier Inc. All rights reserved.

Cascaded DC-DC converter connection of photovoltaic modules

New residential scale photovoltaic (PV) arrays are commonly connected to the grid by a single dc-ac inverter connected to a series string of pv panels, or many small dc-ac inverters which connect one or two panels directly to the ac grid. This paper proposes an alternative topology of nonisolated per-panel dc-dc converters connected in series to create a high voltage string connected to a simplified dc-ac inverter. This offers the advantages of a converter-per-panel approach without the cost or efficiency penalties of individual dc-ac grid connected inverters. Buck, boost, buck-boost, and Cuk converters are considered as possible dc-dc converters that can be cascaded. Matlab simulations are used to compare the efficiency of each topology as well as evaluating the benefits of increasing cost and complexity. The buck and then boost converters are shown to be the most efficient topologies for a given cost, with the buck best suited for long strings and the boost for short strings. While flexible in voltage ranges, buck-boost, and Cuk converters are always at an efficiency or alternatively cost disadvantage.

The effects of energy sites on adsorption of Lennard–Jones fluids and phase transition in carbon slit pore of finite length a computer simulation study

A Monte Carlo simulation method is Used 10 study the effects of adsorption strength and topology of sites on adsorption of simple Lennard-Jones fluids in a carbon slit pore of finite length. Argon is used as a model adsorbate, while the adsorbent is modeled as a finite carbon slit pore whose two walls composed of three graphene layers with carbon atoms arranged in a hexagonal pattern. Impurities having well depth of interaction greater than that of carbon atom are assumed to be grafted onto the surface. Different topologies of the impurities; corner, centre, shelf and random topologies are studied. Adsorption isotherms of argon at 87.3 K are obtained for pore having widths of 1, 1.5 and 3 11111 using a Grand Canonical Monte Carlo simulation (GCMC). These results are compared with isotherms obtained for infinite pores. It is shown that the Surface heterogeneity affects significantly the overall adsorption isotherm, particularly the phase transition. Basically it shifts the onset of adsorption to lower pressure and the adsorption isotherms for these four impurity models are generally greater than that for finite pore. The positions of impurities on solid Surface also affect the shape of the adsorption isotherm and the phase transition. We have found that the impurities allocated at the centre of pore walls provide the greatest isotherm at low pressures. However when the pressure increases the impurities allocated along the edges of the graphene layers show the most significant effect on the adsorption isotherm. We have investigated the effect of surface heterogeneity on adsorption hysteresis loops of three models of impurity topology, it shows that the adsorption branches of these isotherms are different, while the desorption branches are quite close to each other. This suggests that the desorption branch is either the thermodynamic equilibrium branch or closer to it than the adsorption branch. (c) 2005 Elsevier Inc. All rights reserved.

Network topology and the evolution of dynamics in an artificial genetic regulatory network model created by whole genome duplication and divergence

Topological measures of large-scale complex networks are applied to a specific artificial regulatory network model created through a whole genome duplication and divergence mechanism. This class of networks share topological features with natural transcriptional regulatory networks. Specifically, these networks display scale-free and small-world topology and possess subgraph distributions similar to those of natural networks. Thus, the topologies inherent in natural networks may be in part due to their method of creation rather than being exclusively shaped by subsequent evolution under selection. The evolvability of the dynamics of these networks is also examined by evolving networks in simulation to obtain three simple types of output dynamics. The networks obtained from this process show a wide variety of topologies and numbers of genes indicating that it is relatively easy to evolve these classes of dynamics in this model. (c) 2006 Elsevier Ireland Ltd. All rights reserved.

Searching for convergence in phylogenetic Markov chain Monte Carlo

Markov chain Monte Carlo (MCMC) is a methodology that is gaining widespread use in the phylogenetics community and is central to phylogenetic software packages such as MrBayes. An important issue for users of MCMC methods is how to select appropriate values for adjustable parameters such as the length of the Markov chain or chains, the sampling density, the proposal mechanism, and, if Metropolis-coupled MCMC is being used, the number of heated chains and their temperatures. Although some parameter settings have been examined in detail in the literature, others are frequently chosen with more regard to computational time or personal experience with other data sets. Such choices may lead to inadequate sampling of tree space or an inefficient use of computational resources. We performed a detailed study of convergence and mixing for 70 randomly selected, putatively orthologous protein sets with different sizes and taxonomic compositions. Replicated runs from multiple random starting points permit a more rigorous assessment of convergence, and we developed two novel statistics, delta and epsilon, for this purpose. Although likelihood values invariably stabilized quickly, adequate sampling of the posterior distribution of tree topologies took considerably longer. Our results suggest that multimodality is common for data sets with 30 or more taxa and that this results in slow convergence and mixing. However, we also found that the pragmatic approach of combining data from several short, replicated runs into a metachain to estimate bipartition posterior probabilities provided good approximations, and that such estimates were no worse in approximating a reference posterior distribution than those obtained using a single long run of the same length as the metachain. Precision appears to be best when heated Markov chains have low temperatures, whereas chains with high temperatures appear to sample trees with high posterior probabilities only rarely. [Bayesian phylogenetic inference; heating parameter; Markov chain Monte Carlo; replicated chains.]

Pattern-based phylogenetic distance estimation and tree reconstruction

We have developed an alignment-free method that calculates phylogenetic distances using a maximum-likelihood approach for a model of sequence change on patterns that are discovered in unaligned sequences. To evaluate the phylogenetic accuracy of our method, and to conduct a comprehensive comparison of existing alignment-free methods (freely available as Python package decaf+py at http://www.bioinformatics.org.au), we have created a data set of reference trees covering a wide range of phylogenetic distances. Amino acid sequences were evolved along the trees and input to the tested methods; from their calculated distances we infered trees whose topologies we compared to the reference trees. We find our pattern-based method statistically superior to all other tested alignment-free methods. We also demonstrate the general advantage of alignment-free methods over an approach based on automated alignments when sequences violate the assumption of collinearity. Similarly, we compare methods on empirical data from an existing alignment benchmark set that we used to derive reference distances and trees. Our pattern-based approach yields distances that show a linear relationship to reference distances over a substantially longer range than other alignment-free methods. The pattern-based approach outperforms alignment-free methods and its phylogenetic accuracy is statistically indistinguishable from alignment-based distances.

Distributed routing algorithms for interconnected FDDI LANS

The Fibre Distributed Data Interface (FDDI) represents the new generation of local area networks (LANs). These high speed LANs are capable of supporting up to 500 users over a 100 km distance. User traffic is expected to be as diverse as file transfers, packet voice and video. As the proliferation of FDDI LANs continues, the need to interconnect these LANs arises. FDDI LAN interconnection can be achieved in a variety of different ways. Some of the most commonly used today are public data networks, dial up lines and private circuits. For applications that can potentially generate large quantities of traffic, such as an FDDI LAN, it is cost effective to use a private circuit leased from the public carrier. In order to send traffic from one LAN to another across the leased line, a routing algorithm is required. Much research has been done on the Bellman-Ford algorithm and many implementations of it exist in computer networks. However, due to its instability and problems with routing table loops it is an unsatisfactory algorithm for interconnected FDDI LANs. A new algorithm, termed ISIS which is being standardized by the ISO provides a far better solution. ISIS will be implemented in many manufacturers routing devices. In order to make the work as practical as possible, this algorithm will be used as the basis for all the new algorithms presented. The ISIS algorithm can be improved by exploiting information that is dropped by that algorithm during the calculation process. A new algorithm, called Down Stream Path Splits (DSPS), uses this information and requires only minor modification to some of the ISIS routing procedures. DSPS provides a higher network performance, with very little additional processing and storage requirements. A second algorithm, also based on the ISIS algorithm, generates a massive increase in network performance. This is achieved by selecting alternative paths through the network in times of heavy congestion. This algorithm may select the alternative path at either the originating node, or any node along the path. It requires more processing and memory storage than DSPS, but generates a higher network power. The final algorithm combines the DSPS algorithm with the alternative path algorithm. This is the most flexible and powerful of the algorithms developed. However, it is somewhat complex and requires a fairly large storage area at each node. The performance of the new routing algorithms is tested in a comprehensive model of interconnected LANs. This model incorporates the transport through physical layers and generates random topologies for routing algorithm performance comparisons. Using this model it is possible to determine which algorithm provides the best performance without introducing significant complexity and storage requirements.

Phase transitions and memory effects in the dynamics of Boolean networks

The generating functional method is employed to investigate the synchronous dynamics of Boolean networks, providing an exact result for the system dynamics via a set of macroscopic order parameters. The topology of the networks studied and its constituent Boolean functions represent the system's quenched disorder and are sampled from a given distribution. The framework accommodates a variety of topologies and Boolean function distributions and can be used to study both the noisy and noiseless regimes; it enables one to calculate correlation functions at different times that are inaccessible via commonly used approximations. It is also used to determine conditions for the annealed approximation to be valid, explore phases of the system under different levels of noise and obtain results for models with strong memory effects, where existing approximations break down. Links between Boolean networks and general Boolean formulas are identified and results common to both system types are highlighted. © 2012 Copyright Taylor and Francis Group, LLC.

Further studies on flow distribution on distillation sieve trays

The thesis describes experimental work on the possibility of using deflection baffles in conventional distillation trays as flow straightening devices, with the view of enhancing tray efficiency. The mode of operation is based on deflecting part of the liquid momentum from the centre of the tray to the segment regions in order to drive stagnating liquid at the edges forward. The first part of the work was a detailed investigation into the two-phase flow patterns produced on a conventional sieve tray having 1 mm hole size perforations. The data provide a check on some earlier work and extend the range of the existing databank, particularly to conditions more typical of industrial operation. A critical survey of data collected on trays with different hole sizes (Hine, 1990; Chambers, 1993; Fenwick, 1996; this work) showed that the hole diameter has a significant influence on the flow regime, the size of the stagnant regions and the hydraulic and mass transfer performance. Five modified tray topologies were created with different configurations of baffles and tested extensively in the 2.44 m diameter air-water pilot distillation simulator for their efficacy in achieving uniform flow across the tray and for their impact on tray loading capacity and mass transfer efficiency. Special attention was given to the calibration of the over 100 temperature probes used in measuring the water temperature across the tray on which the heat and mass transfer analogy is based. In addition to normal tray capacity experiments, higher weir load experiments were conducted using a 'half-tray' mode in order to extend the range of data to conditions more typical of industrial operation. The modified trays show superior flow characteristics compared to the conventional tray in terms of the ability to replenish the zones of exceptionally low temperatures and high residence times at the edges of the tray, to lower the bulk liquid gradient and to achieve a more uniform flow across the tray. These superior flow abilities, however, tend to diminish with increasing weir load because of the increasing tendency for the liquid to jump over the barriers instead of flowing over them. The modified tray topologies showed no tendency to cause undue limitation to tray loading capacity. Although the improvement in the efficiency of a single tray over that of the conventional tray was moderate and in some cases marginal, the multiplier effect in a multiple tray column situation would be significant (Porter et al., 1972). These results are in good agreement with an associated CFD studies (Fischer, 1999) carried out by partners in the Advanced Studies in Distillation consortium. It is concluded that deflection baffles can be used in a conventional distillation sieve tray to achieve better liquid flow distribution and obtain enhanced mass transfer efficiency, without undermining the tray loading capacity. Unlike any other controlled-flow tray whose mechanical complexity impose stringent manufacturing and installation tolerances, the baffled-tray models are simple to design, manufacture and install and thus provide an economic method of retrofitting badly performing sieve trays both in terms of downtime and fabrication. NOTE APPENDICES 2-5 ARE ON A SEPARATE FLOPPY DISK ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY WITH PRIOR ARRANGEMENT

Typical case behaviour of spin systems in random graph and composite ensembles

This thesis includes analysis of disordered spin ensembles corresponding to Exact Cover, a multi-access channel problem, and composite models combining sparse and dense interactions. The satisfiability problem in Exact Cover is addressed using a statistical analysis of a simple branch and bound algorithm. The algorithm can be formulated in the large system limit as a branching process, for which critical properties can be analysed. Far from the critical point a set of differential equations may be used to model the process, and these are solved by numerical integration and exact bounding methods. The multi-access channel problem is formulated as an equilibrium statistical physics problem for the case of bit transmission on a channel with power control and synchronisation. A sparse code division multiple access method is considered and the optimal detection properties are examined in typical case by use of the replica method, and compared to detection performance achieved by interactive decoding methods. These codes are found to have phenomena closely resembling the well-understood dense codes. The composite model is introduced as an abstraction of canonical sparse and dense disordered spin models. The model includes couplings due to both dense and sparse topologies simultaneously. The new type of codes are shown to outperform sparse and dense codes in some regimes both in optimal performance, and in performance achieved by iterative detection methods in finite systems.

Network lifetime maximization with cross-layer design in wireless sensor networks

This paper investigates a cross-layer design approach for minimizing energy consumption and maximizing network lifetime (NL) of a multiple-source and single-sink (MSSS) WSN with energy constraints. The optimization problem for MSSS WSN can be formulated as a mixed integer convex optimization problem with the adoption of time division multiple access (TDMA) in medium access control (MAC) layer, and it becomes a convex problem by relaxing the integer constraint on time slots. Impacts of data rate, link access and routing are jointly taken into account in the optimization problem formulation. Both linear and planar network topologies are considered for NL maximization (NLM). With linear MSSS and planar single-source and single-sink (SSSS) topologies, we successfully use Karush-Kuhn-Tucker (KKT) optimality conditions to derive analytical expressions of the optimal NL when all nodes are exhausted simultaneously. The problem for planar MSSS topology is more complicated, and a decomposition and combination (D&C) approach is proposed to compute suboptimal solutions. An analytical expression of the suboptimal NL is derived for a small scale planar network. To deal with larger scale planar network, an iterative algorithm is proposed for the D&C approach. Numerical results show that the upper-bounds of the network lifetime obtained by our proposed optimization models are tight. Important insights into the NL and benefits of cross-layer design for WSN NLM are obtained.

Power electronic interfaces for low voltage residential networks

A proposal to increase the existing residential LV grid voltage from 230 V to 300 V has been made in order to increase existing network capacity. A power-electronic AC-AC converter is then used to provide 230 V at each property. The equipment can also provide power-quality improvements to the network and load. Several constraints such as temperature rise at the converter location lead to a converter design requiring very high efficiency. In this paper different AC/AC converter topologies are presented which compares the power quality benefits, size and efficiency of each converter. The design and the control technique of the most suitable topology are verified using simulation and preliminary experimentally results of prototype hardware are also included. © 2013 IEEE.

VSC topology comparison for STATCOM application under unbalanced conditions

This paper compares the performance of four different power electronic converter topologies, which have been proposed for STATCOM applications. Two of the topologies are Modular Multilevel Cascaded Converters (MMCC), whilst the remaining circuits utilize magnetic elements and an open-winding transformer configuration to combine individual power modules. It is assumed that the STATCOM has to work under unbalanced conditions, so that it delivers both positive and negative sequence currents. Simulation studies for the four topologies have been carried out using the simulation tool Saber. © 2013 IEEE.

Socio-economic vision graph generation and handover in distributed smart camera networks

In this article we present an approach to object tracking handover in a network of smart cameras, based on self-interested autonomous agents, which exchange responsibility for tracking objects in a market mechanism, in order to maximise their own utility. A novel ant-colony inspired mechanism is used to learn the vision graph, that is, the camera neighbourhood relations, during runtime, which may then be used to optimise communication between cameras. The key benefits of our completely decentralised approach are on the one hand generating the vision graph online, enabling efficient deployment in unknown scenarios and camera network topologies, and on the other hand relying only on local information, increasing the robustness of the system. Since our market-based approach does not rely on a priori topology information, the need for any multicamera calibration can be avoided. We have evaluated our approach both in a simulation study and in network of real distributed smart cameras.