842 resultados para distribution networks
Resumo:
Attempts to model any present or future power grid face a huge challenge because a power grid is a complex system, with feedback and multi-agent behaviors, integrated by generation, distribution, storage and consumption systems, using various control and automation computing systems to manage electricity flows. Our approach to modeling is to build upon an established model of the low voltage electricity network which is tested and proven, by extending it to a generalized energy model. But, in order to address the crucial issues of energy efficiency, additional processes like energy conversion and storage, and further energy carriers, such as gas, heat, etc., besides the traditional electrical one, must be considered. Therefore a more powerful model, provided with enhanced nodes or conversion points, able to deal with multidimensional flows, is being required. This article addresses the issue of modeling a local multi-carrier energy network. This problem can be considered as an extension of modeling a low voltage distribution network located at some urban or rural geographic area. But instead of using an external power flow analysis package to do the power flow calculations, as used in electric networks, in this work we integrate a multiagent algorithm to perform the task, in a concurrent way to the other simulation tasks, and not only for the electric fluid but also for a number of additional energy carriers. As the model is mainly focused in system operation, generation and load models are not developed.
Resumo:
The dissertation studies the general area of complex networked systems that consist of interconnected and active heterogeneous components and usually operate in uncertain environments and with incomplete information. Problems associated with those systems are typically large-scale and computationally intractable, yet they are also very well-structured and have features that can be exploited by appropriate modeling and computational methods. The goal of this thesis is to develop foundational theories and tools to exploit those structures that can lead to computationally-efficient and distributed solutions, and apply them to improve systems operations and architecture.
Specifically, the thesis focuses on two concrete areas. The first one is to design distributed rules to manage distributed energy resources in the power network. The power network is undergoing a fundamental transformation. The future smart grid, especially on the distribution system, will be a large-scale network of distributed energy resources (DERs), each introducing random and rapid fluctuations in power supply, demand, voltage and frequency. These DERs provide a tremendous opportunity for sustainability, efficiency, and power reliability. However, there are daunting technical challenges in managing these DERs and optimizing their operation. The focus of this dissertation is to develop scalable, distributed, and real-time control and optimization to achieve system-wide efficiency, reliability, and robustness for the future power grid. In particular, we will present how to explore the power network structure to design efficient and distributed market and algorithms for the energy management. We will also show how to connect the algorithms with physical dynamics and existing control mechanisms for real-time control in power networks.
The second focus is to develop distributed optimization rules for general multi-agent engineering systems. A central goal in multiagent systems is to design local control laws for the individual agents to ensure that the emergent global behavior is desirable with respect to the given system level objective. Ideally, a system designer seeks to satisfy this goal while conditioning each agent’s control on the least amount of information possible. Our work focused on achieving this goal using the framework of game theory. In particular, we derived a systematic methodology for designing local agent objective functions that guarantees (i) an equivalence between the resulting game-theoretic equilibria and the system level design objective and (ii) that the resulting game possesses an inherent structure that can be exploited for distributed learning, e.g., potential games. The control design can then be completed by applying any distributed learning algorithm that guarantees convergence to the game-theoretic equilibrium. One main advantage of this game theoretic approach is that it provides a hierarchical decomposition between the decomposition of the systemic objective (game design) and the specific local decision rules (distributed learning algorithms). This decomposition provides the system designer with tremendous flexibility to meet the design objectives and constraints inherent in a broad class of multiagent systems. Furthermore, in many settings the resulting controllers will be inherently robust to a host of uncertainties including asynchronous clock rates, delays in information, and component failures.
Resumo:
This paper deals with the resource allocation problem aimed at maximizing users' perception of quality in wireless channels with time-varying capacity. First of all, we model the subjective quality-aware scheduling problem in the framework of Markovian decision processes. Then, given that the obtaining of the optimal solution of this model is unachievable, we propose a simple scheduling index rule with closed-form expression by using a methodology based on Whittle approach. Finally, we analyze the performance of the achieved scheduling proposal in several relevant scenarios, concluding that it outperforms the most popular existing resource allocation strategies.
Resumo:
The use of a porous coating on prosthetic components to encourage bone ingrowth is an important way of improving uncemented implant fixation. Enhanced fixation may be achieved by the use of porous magneto-active layers on the surface of prosthetic implants, which would deform elastically on application of a magnetic field, generating internal stresses within the in-growing bone. This approach requires a ferromagnetic material able to support osteoblast attachment, proliferation, differentiation, and mineralization. In this study, the human osteoblast responses to ferromagnetic 444 stainless steel networks were considered alongside those to nonmagnetic 316L (medical grade) stainless steel networks. While both networks had similar porosities, 444 networks were made from coarser fibers, resulting in larger inter-fiber spaces. The networks were analyzed for cell morphology, distribution, proliferation, and differentiation, extracellular matrix production and the formation of mineralized nodules. Cell culture was performed in both the presence of osteogenic supplements, to encourage cell differentiation, and in their absence. It was found that fiber size affected osteoblast morphology, cytoskeleton organization and proliferation at the early stages of culture. The larger inter-fiber spaces in the 444 networks resulted in better spatial distribution of the extracellular matrix. The addition of osteogenic supplements enhanced cell differentiation and reduced cell proliferation thereby preventing the differences in proliferation observed in the absence of osteogenic supplements. The results demonstrated that 444 networks elicited favorable responses from human osteoblasts, and thus show potential for use as magnetically active porous coatings for advanced bone implant applications. © 2012 Wiley Periodicals, Inc.
Resumo:
Quantum key distribution (QKD) uniquely allows distribution of cryptographic keys with security verified by quantum mechanical limits. Both protocol execution and subsequent applications require the assistance of classical data communication channels. While using separate fibers is one option, it is economically more viable if data and quantum signals are simultaneously transmitted through a single fiber. However, noise-photon contamination arising from the intense data signal has severely restricted both the QKD distances and secure key rates. Here, we exploit a novel temporal-filtering effect for noise-photon rejection. This allows high-bit-rate QKD over fibers up to 90 km in length and populated with error-free bidirectional Gb/s data communications. With high-bit rate and range sufficient for important information infrastructures, such as smart cities and 10 Gbit Ethernet, QKD is a significant step closer towards wide-scale deployment in fiber networks.
Resumo:
Current commercial dialogue systems typically use hand-crafted grammars for Spoken Language Understanding (SLU) operating on the top one or two hypotheses output by the speech recogniser. These systems are expensive to develop and they suffer from significant degradation in performance when faced with recognition errors. This paper presents a robust method for SLU based on features extracted from the full posterior distribution of recognition hypotheses encoded in the form of word confusion networks. Following [1], the system uses SVM classifiers operating on n-gram features, trained on unaligned input/output pairs. Performance is evaluated on both an off-line corpus and on-line in a live user trial. It is shown that a statistical discriminative approach to SLU operating on the full posterior ASR output distribution can substantially improve performance both in terms of accuracy and overall dialogue reward. Furthermore, additional gains can be obtained by incorporating features from the previous system output. © 2012 IEEE.
Resumo:
This paper presents ongoing work on data collection and collation from a large number of laboratory cement-stabilization projects worldwide. The aim is to employ Artificial Neural Networks (ANN) to establish relationships between variables, which define the properties of cement-stabilized soils, and the two parameters determined by the Unconfined Compression Test, the Unconfined Compressive Strength (UCS), and stiffness, using E50 calculated from UCS results. Bayesian predictive neural network models are developed to predict the UCS values of cement-stabilized inorganic clays/silts, as well as sands as a function of selected soil mix variables, such as grain size distribution, water content, cement content and curing time. A model which can predict the stiffness values of cement-stabilized clays/silts is also developed and compared to the UCS model. The UCS model results emulate known trends better and provide more accurate estimates than the results from the E50 stiffness model. © 2013 American Society of Civil Engineers.
Resumo:
In the present paper, highly porous fibre networks made of 316L fibres, with different fibre volume fractions, are characterized in terms of network architecture, elastic constants and fracture energies. Elastic constants are measured using quasi-static mechanical and modal vibration testing, yielding local and globally averaged properties, respectively. Differences between quasi-static and dynamic elastic constants are attributed to through-thickness shear effects. Regardless of the method employed, networks show signs of material inhomogeneity at high fibre densities, in agreement with X-ray nanotomography results. Strong auxetic (or negative Poisson's ratio) behaviour is observed in the through-thickness direction, which is attributed to fibre kinking induced during processing. Measured fracture energies are compared with model predictions incorporating information about in-plane fibre orientation distribution, fibre volume fraction and single fibre work of fracture. Experimental values are broadly consistent with model predictions, based on the assumption that this energy is primarily associated with plastic deformation of individual fibres within a process zone of the same order as the inter-joint spacing. © 2013 Published by Elsevier Ltd. on behalf of Acta Materialia Inc. All rights reserved.
Resumo:
The aim of this work is to improve bone-implant bonding. This can, potentially, be achieved through the use of an implant coating composed of fibre networks. It is hypothesised that such an implant can achieve strong peri-prosthetic bone anchorage, when seeded with human mesenchymal stem cells (hMSCs). The materials employed were 444 and 316L stainless steel fibre networks of the same fibre volume fraction. The present work confirms that hMSCs are able to proliferate and differentiate towards the osteogenic lineage when seeded onto the fibre networks. Cellular viability, proliferation and metabolic activity were assessed and the results suggest higher proliferation rates when hMSC are seeded onto the 444 networks as compared to 316L. Cell distribution was found uniform across the seeded surfaces with 444 showing a somewhat higher infiltration depth. Copyright © Materials Research Society 2013.
Resumo:
On the basis of DBF nets proposed by Wang Shoujue, the model and properties of DBF neural network were discussed in this paper. When applied in pattern recognition, the algorithm and implement on hardware were presented respectively. We did experiments on recognition of omnidirectionally oriented rigid objects on the same level, using direction basis function neural networks, which acts by the method of covering the high dimensional geometrical distribution of the sample set in the feature space. Many animal and vehicle models (even with rather similar shapes) were recognized omnidirectionally thousands of times. For total 8800 tests, the correct recognition rate is 98.75%, the error rate and the rejection rate are 0.5% and 1.25% respectively. (C) 2003 Elsevier Inc. All rights reserved.
Resumo:
This paper discusses the algorithm on the distance from a point and an infinite sub-space in high dimensional space With the development of Information Geometry([1]), the analysis tools of points distribution in high dimension space, as a measure of calculability, draw more attention of experts of pattern recognition. By the assistance of these tools, Geometrical properties of sets of samples in high-dimensional structures are studied, under guidance of the established properties and theorems in high-dimensional geometry.
Resumo:
The authors developed a time dependent method to study the single molecule dynamics of a simple gene regulatory network: a repressilator with three genes mutually repressing each other. They quantitatively characterize the time evolution dynamics of the repressilator. Furthermore, they study purely dynamical issues such as statistical fluctuations and noise evolution. They illustrated some important features of the biological network such as monostability, spirals, and limit cycle oscillation. Explicit time dependent Fano factors which describe noise evolution and show statistical fluctuations out of equilibrium can be significant and far from the Poisson distribution. They explore the phase space and the interrelationships among fluctuations, order, amplitude, and period of oscillations of the repressilators. The authors found that repressilators follow ordered limit cycle orbits and are more likely to appear in the lower fluctuating regions. The amplitude of the repressilators increases as the suppressing of the genes decreases and production of proteins increases. The oscillation period of the repressilators decreases as the suppressing of the genes decreases and production of proteins increases.
Resumo:
We develop a mean field theory for sigmoid belief networks based on ideas from statistical mechanics. Our mean field theory provides a tractable approximation to the true probability distribution in these networks; it also yields a lower bound on the likelihood of evidence. We demonstrate the utility of this framework on a benchmark problem in statistical pattern recognition -- the classification of handwritten digits.
Resumo:
Q. Meng and M.H. Lee, 'Error-driven active learning in growing radial basis function networks for early robot learning', 2006 IEEE International Conference on Robotics and Automation (IEEE ICRA 2006), 2984-90, Orlando, Florida, USA.
Resumo:
High-speed networks, such as ATM networks, are expected to support diverse Quality of Service (QoS) constraints, including real-time QoS guarantees. Real-time QoS is required by many applications such as those that involve voice and video communication. To support such services, routing algorithms that allow applications to reserve the needed bandwidth over a Virtual Circuit (VC) have been proposed. Commonly, these bandwidth-reservation algorithms assign VCs to routes using the least-loaded concept, and thus result in balancing the load over the set of all candidate routes. In this paper, we show that for such reservation-based protocols|which allow for the exclusive use of a preset fraction of a resource's bandwidth for an extended period of time-load balancing is not desirable as it results in resource fragmentation, which adversely affects the likelihood of accepting new reservations. In particular, we show that load-balancing VC routing algorithms are not appropriate when the main objective of the routing protocol is to increase the probability of finding routes that satisfy incoming VC requests, as opposed to equalizing the bandwidth utilization along the various routes. We present an on-line VC routing scheme that is based on the concept of "load profiling", which allows a distribution of "available" bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. We show the effectiveness of our load-profiling approach when compared to traditional load-balancing and load-packing VC routing schemes.