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.

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.

Sistema fotovoltaico monocristalino para bombeamento de água

Since ancient times, it has been a huge challenge to all people around the world to manage to get their fresh water, keeping it clean and providing it to every human being, so that it can be used for their daily needs. This is especially true for small properties in the countryside and in isolated areas with low demographic density. Pumping the water in those regions is a solution that rationalizes its use in domestic chores, in animal rearing and in the irrigation systems of cultivated areas. Making feasible local, renewable and non-polluted energetic alternatives is the aim for those areas that are usually far away from the public electric network. Using photovoltaic solar energy is the alternative now proposed. For this objective was built a system with two monocrystalline panels, one pump, two water tanks, two level sensors and a solenoid valve to pump water, using a pump powered an array of monocrystalline solar panels. The main goal was to compare their rate of water flow and their energy consumption. The use of one data acquisition equipment allowed collecting meteorological, electrical and hydraulic values, and also serving for the control and activation of the pumping system. During four months in a row as from April 2009, arrangements with one or two panels were tested. Mathematics correlations and adjustment lines were used to interpret the behavior of obtained dataset. During the analyzed period the system followed the linear equations with great accuracy. The daily average amount of water pumped by the several tested arrays stayed between 1,100 and 2,500 liters, and that is enough to supply a small rural property. The pumping system with two panels effectively showed the major amount of water, but a system with one panel can be an economical solution until 1,500 liters on day. It did not characterize a direct relationship between power or quantity of photovoltaic panels and daily outflow of water pumping.

Cross-Layer Packet Size Optimization for Wireless Terrestrial, Underwater, and Underground Sensor Networks

In this paper, a cross-layer solution for packet size optimization in wireless sensor networks (WSN) is introduced such that the effects of multi-hop routing, the broadcast nature of the physical wireless channel, and the effects of error control techniques are captured. A key result of this paper is that contrary to the conventional wireless networks, in wireless sensor networks, longer packets reduce the collision probability. Consequently, an optimization solution is formalized by using three different objective functions, i.e., packet throughput, energy consumption, and resource utilization. Furthermore, the effects of end-to-end latency and reliability constraints are investigated that may be required by a particular application. As a result, a generic, cross-layer optimization framework is developed to determine the optimal packet size in WSN. This framework is further extended to determine the optimal packet size in underwater and underground sensor networks. From this framework, the optimal packet sizes under various network parameters are determined.

Mapping virtual networks onto substrate networks

Network virtualization is a promising technique for building the Internet of the future since it enables the low cost introduction of new features into network elements. An open issue in such virtualization is how to effect an efficient mapping of virtual network elements onto those of the existing physical network, also called the substrate network. Mapping is an NP-hard problem and existing solutions ignore various real network characteristics in order to solve the problem in a reasonable time frame. This paper introduces new algorithms to solve this problem based on 0–1 integer linear programming, algorithms based on a whole new set of network parameters not taken into account by previous proposals. Approximative algorithms proposed here allow the mapping of virtual networks on large network substrates. Simulation experiments give evidence of the efficiency of the proposed algorithms.

A simple genetic algorithm for calibration of stochastic rock discontinuity networks

Este artículo propone un método para llevar a cabo la calibración de las familias de discontinuidades en macizos rocosos. We present a novel approach for calibration of stochastic discontinuity network parameters based on genetic algorithms (GAs). To validate the approach, examples of application of the method to cases with known parameters of the original Poisson discontinuity network are presented. Parameters of the model are encoded as chromosomes using a binary representation, and such chromosomes evolve as successive generations of a randomly generated initial population, subjected to GA operations of selection, crossover and mutation. Such back-calculated parameters are employed to make assessments about the inference capabilities of the model using different objective functions with different probabilities of crossover and mutation. Results show that the predictive capabilities of GAs significantly depend on the type of objective function considered; and they also show that the calibration capabilities of the genetic algorithm can be acceptable for practical engineering applications, since in most cases they can be expected to provide parameter estimates with relatively small errors for those parameters of the network (such as intensity and mean size of discontinuities) that have the strongest influence on many engineering applications.

Horizontal visibility graphs generated by type-I intermittency

The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associatedHVgraphs.We showhowthe alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values for several network parameters. In particular, we predict that the characteristic power-law scaling of the mean length of laminar trend sizes is fully inherited by the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of block entropy functionals defined on the graph. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization-group framework, where the fixed points of its graph-theoretical renormalization-group flow account for the different types of dynamics.We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibits extremal entropic properties.

A study of certain factors affecting computation times in designing optimal NOR networks by the implicit enumeration method using the feed-forward formulation /

Bibliography: p. 27-29.

Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program /

Bibliography: p. 39 (2d group)

The DRAGON users' manual by Peter Watterberg, Virginia Lo.

Bibliography: p. 35.

Developing multidimensional metrics for evaluating paediatric neurodevelopmental disorders

Healthy brain functioning depends on efficient communication of information between brain regions, forming complex networks. By quantifying synchronisation between brain regions, a functionally connected brain network can be articulated. In neurodevelopmental disorders, where diagnosis is based on measures of behaviour and tasks, a measure of the underlying biological mechanisms holds promise as a potential clinical tool. Graph theory provides a tool for investigating the neural correlates of neuropsychiatric disorders, where there is disruption of efficient communication within and between brain networks. This research aimed to use recent conceptualisation of graph theory, along with measures of behaviour and cognitive functioning, to increase understanding of the neurobiological risk factors of atypical development. Using magnetoencephalography to investigate frequency-specific temporal dynamics at rest, the research aimed to identify potential biological markers derived from sensor-level whole-brain functional connectivity. Whilst graph theory has proved valuable for insight into network efficiency, its application is hampered by two limitations. First, its measures have hardly been validated in MEG studies, and second, graph measures have been shown to depend on methodological assumptions that restrict direct network comparisons. The first experimental study (Chapter 3) addressed the first limitation by examining the reproducibility of graph-based functional connectivity and network parameters in healthy adult volunteers. Subsequent chapters addressed the second limitation through adapted minimum spanning tree (a network analysis approach that allows for unbiased group comparisons) along with graph network tools that had been shown in Chapter 3 to be highly reproducible. Network topologies were modelled in healthy development (Chapter 4), and atypical neurodevelopment (Chapters 5 and 6). The results provided support to the proposition that measures of network organisation, derived from sensor-space MEG data, offer insights helping to unravel the biological basis of typical brain maturation and neurodevelopmental conditions, with the possibility of future clinical utility.

Predição de séries temporais de parâmetros de redes HSPA - WCDMA

With the growing demand of data traffic in the networks of third generation (3G), the mobile operators have attempted to focus resources on infrastructure in places where it identifies a greater need. The channeling investments aim to maintain the quality of service especially in dense urban areas. WCDMA - HSPA parameters Rx Power, RSCP (Received Signal Code Power), Ec/Io (Energy per chip/Interference) and transmission rate (throughput) at the physical layer are analyzed. In this work the prediction of time series on HSPA network is performed. The collection of values of the parameters was performed on a fully operational network through a drive test in Natal - RN, a capital city of Brazil northeastern. The models used for prediction of time series were the Simple Exponential Smoothing, Holt, Holt Winters Additive and Holt Winters Multiplicative. The objective of the predictions of the series is to check which model will generate the best predictions of network parameters WCDMA - HSPA.

Ferramenta para avaliação e inferência de parâmetros de redes industriais sem fio

Wireless sensor networks (WSN) have gained ground in the industrial environment, due to the possibility of connecting points of information that were inaccessible to wired networks. However, there are several challenges in the implementation and acceptance of this technology in the industrial environment, one of them the guaranteed availability of information, which can be influenced by various parameters, such as path stability and power consumption of the field device. As such, in this work was developed a tool to evaluate and infer parameters of wireless industrial networks based on the WirelessHART and ISA 100.11a protocols. The tool allows quantitative evaluation, qualitative evaluation and evaluation by inference during a given time of the operating network. The quantitative and qualitative evaluation are based on own definitions of parameters, such as the parameter of stability, or based on descriptive statistics, such as mean, standard deviation and box plots. In the evaluation by inference uses the intelligent technique artificial neural networks to infer some network parameters such as battery life. Finally, it displays the results of use the tool in different scenarios networks, as topologies star and mesh, in order to attest to the importance of tool in evaluation of the behavior of these networks, but also support possible changes or maintenance of the system.

Assessment of the EEE-4 oral test: a discourse analysis based on complex networks.

With the development of information technology, the theory and methodology of complex network has been introduced to the language research, which transforms the system of language in a complex networks composed of nodes and edges for the quantitative analysis about the language structure. The development of dependency grammar provides theoretical support for the construction of a treebank corpus, making possible a statistic analysis of complex networks. This paper introduces the theory and methodology of the complex network and builds dependency syntactic networks based on the treebank of speeches from the EEE-4 oral test. According to the analysis of the overall characteristics of the networks, including the number of edges, the number of the nodes, the average degree, the average path length, the network centrality and the degree distribution, it aims to find in the networks potential difference and similarity between various grades of speaking performance. Through clustering analysis, this research intends to prove the network parameters’ discriminating feature and provide potential reference for scoring speaking performance.

Person Re-Identification using Deep Convnets with Multi-task Learning

Person re-identification involves recognizing a person across non-overlapping camera views, with different pose, illumination, and camera characteristics. We propose to tackle this problem by training a deep convolutional network to represent a person’s appearance as a low-dimensional feature vector that is invariant to common appearance variations encountered in the re-identification problem. Specifically, a Siamese-network architecture is used to train a feature extraction network using pairs of similar and dissimilar images. We show that use of a novel multi-task learning objective is crucial for regularizing the network parameters in order to prevent over-fitting due to the small size the training dataset. We complement the verification task, which is at the heart of re-identification, by training the network to jointly perform verification, identification, and to recognise attributes related to the clothing and pose of the person in each image. Additionally, we show that our proposed approach performs well even in the challenging cross-dataset scenario, which may better reflect real-world expected performance.