950 resultados para Network load
Resumo:
Brazil is the world's largest producer of sugar cane and which in the state of São Paulo concentrate the greatest amount of sugar cane field of the country. The sugar-alcohol sector has the capacity to produce sufficient thermal and electrical energy to be used in their process of production and commercialize of surplus in electricity distribution network. Therefore it is necessary to evaluate the energy efficiency and rationality within the mill. Accordingly this research proposed analyze the sugar-alcohol mill's sectors globally and individually, located in the west center of the São Paulo state, using the valuation methodology employed by the Agência Nacional de Energia Elétrica (ANEEL) in the industries that do not have systems of cogeneration. In this analysis, the hyperboloids of load and potency were applied based on the indexes of potency factor and load factor that allow estimate the efficiency and rationality. © 2013 IEEE.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
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.
Resumo:
Bone is continually being removed and replaced through the actions of basic multicellular units (BMU). This constant upkeep is necessary to remove microdamage formed naturally due to fatigue and thus maintain the integrity of the bone. The repair process in bone is targeted, meaning that a BMU travels directly to the site of damage and repairs it. It is still unclear how targeted remodelling is stimulated and directed but it is highly likely that osteocytes play a role. A number of theories have been advanced to explain the microcrack osteocyte interaction but no complete mechanism has been demonstrated. Osteocytes are connected to each other by dendritic processes. The “scissors model" proposed that the rupture of these processes where they cross microcracks signals the degree of damage and the urgency of the necessary repair. In its original form it was proposed that under applied compressive loading, microcrack faces will be pressed together and undergo relative shear movement. If this movement is greater than the width of an osteocyte process, then the process will be cut in a “scissors like" motion, releasing RANKL, a cytokine known to be essential in the formation of osteoclasts from pre-osteoclasts. The main aim of this thesis was to investigate this theoretical model with a specific focus on microscopy and finite element modelling. Previous studies had proved that cyclic stress was necessary for osteocyte process rupture to occur. This was a divergence from the original “scissors model" which had proposed that the cutting of cell material occurred in one single action. The present thesis is the first study to show fatigue failure in cellular processes spanning naturally occurring cracks and it's the first study to estimate the cyclic strain range and relate it to the number of cycles to failure, for any type of cell. Rupture due to shear movement was ruled out as microcrack closing never occurred, as a result of plastic deformation of the bone. Fatigue failure was found to occur due to cyclic tensile stress in the locality of the damage. The strain range necessary for osteocyte process rupture was quantified. It was found that the lower the process strain range the greater the number of cycles to cell process failure. FEM modelling allowed to predict stress in the vicinity of an osteocyte process and to analyse its interaction with the bone surrounding it: simulations revealed evident creep effects in bone during cyclic loading. This thesis confirms and dismisses aspects of the “scissors model". The observations support the model as a viable mechanism of microcrack detection by the osteocyte network, albeit in a slightly modified form where cyclic loading is necessary and the method of rupture is fatigue failure due to cyclic tensile motion. An in depth study was performed focusing on microscopy analysis of naturally occurring cracks in bone and FEM simulation analysis of an osteocyte process spanning a microcrack in bone under cyclic load.
Resumo:
The objective of this report is to study distributed (decentralized) three phase optimal power flow (OPF) problem in unbalanced power distribution networks. A full three phase representation of the distribution networks is considered to account for the highly unbalance state of the distribution networks. All distribution network’s series/shunt components, and load types/combinations had been modeled on commercial version of General Algebraic Modeling System (GAMS), the high-level modeling system for mathematical programming and optimization. The OPF problem has been successfully implemented and solved in a centralized approach and distributed approach, where the objective is to minimize the active power losses in the entire system. The study was implemented on the IEEE-37 Node Test Feeder. A detailed discussion of all problem sides and aspects starting from the basics has been provided in this study. Full simulation results have been provided at the end of the report.
Resumo:
Over the past several years the topics of energy consumption and energy harvesting have gained significant importance as a means for improved operation of wireless sensor and mesh networks. Energy-awareness of operation is especially relevant for application scenarios from the domain of environmental monitoring in hard to access areas. In this work we reflect upon our experiences with a real-world deployment of a wireless mesh network. In particular, a comprehensive study on energy measurements collected over several weeks during the summer and the winter period in a network deployment in the Swiss Alps is presented. Energy performance is monitored and analysed for three system components, namely, mesh node, battery and solar panel module. Our findings cover a number of aspects of energy consumption, including the amount of load consumed by a mesh node, the amount of load harvested by a solar panel module, and the dependencies between these two. With our work we aim to shed some light on energy-aware network operation and to help both users and developers in the planning and deployment of a new wireless (mesh) network for environmental research.
Resumo:
Recently, many studies about a network active during rest and deactivated during tasks emerged in the literature: the default mode network (DMN). Spatial and temporal DMN features are important markers for psychiatric diseases. Another prominent indicator of cognitive functioning, yielding information about the mental condition in health and disease, is working memory (WM) processing. In EEG studies, frontal-midline theta power has been shown to increase with load during WM retention in healthy subjects. From these findings, the conclusion can be drawn that an increase in resting state DMN activity may go along with an increase in theta power in high-load WM conditions. We followed this hypothesis in a study on 17 healthy subjects performing a visual Sternberg WM task. The DMN was obtained by a BOLD-ICA approach and its dynamics represented by the percent-strength during pre-stimulus periods. DMN dynamics were temporally correlated with EEG theta spectral power from retention intervals. This so-called covariance mapping yielded the spatial distribution of the theta EEG fluctuations associated with the dynamics of the DMN. In line with previous findings, theta power was increased at frontal-midline electrodes in high- versus low-load conditions during early WM retention. However, load-dependent correlations of DMN with theta power resulted in primarily positive correlations in low-load conditions, while during high-load conditions negative correlations of DMN activity and theta power were observed at frontal-midline electrodes. This DMN-dependent load effect reached significance during later retention. Our results show a complex and load-dependent interaction of pre-stimulus DMN activity and theta power during retention, varying over the course of the retention period. Since both, WM performance and DMN activity, are markers of mental health, our results could be important for further investigations of psychiatric populations.
Resumo:
Recently, multiple studies showed that spatial and temporal features of a task-negative default mode network (DMN) (Greicius et al., 2003) are important markers for psychiatric diseases (Balsters et al., 2013). Another prominent indicator of cognitive functioning, yielding information about the mental condition in health and disease, is working memory (WM) processing. In EEG and MEG studies, frontal-midline theta power has been shown to increase with load during WM retention in healthy subjects (Brookes et al., 2011). Negative correlations between DMN activity and theta amplitude have been found during resting state (Jann et al., 2010) as well as during WM (Michels et al., 2010). Likewise, WM training resulted in higher resting state theta power as well as increased small-worldness of the resting brain (Langer et al., 2013). Further, increased fMRI connectivity between nodes of the DMN correlated with better WM performance (Hampson et al., 2006). Hence, the brain’s default state might influence it’s functioning during task. We therefore hypothesized correlations between pre-stimulus DMN activity and EEG-theta power during WM maintenance, depending on the WM load. 17 healthy subjects performed a Sternberg WM task while being measured simultaneously with EEG and fMRI. Data was recorded within a multicenter-study: 12 subjects were measured in Zurich with a 64-channels MR-compatible system (Brain Products) in a 3T Philips scanner, 5 subjects with a 96-channel MR-compatible system (Brain Products) in a 3T Siemens Scanner in Bern. The DMN components was obtained by a group BOLD-ICA approach over the full task duration (figure 1). The subject-wise dynamics were obtained by back-reconstructed onto each subject’s fMRI data and normalized to percent signal change values. The single trial pre-stimulus-DMN activation was then temporally correlated with the single trial EEG-theta (3-8 Hz) spectral power during retention intervals. This so-called covariance mapping (Jann et al., 2010) yielded the spatial distribution of the theta EEG fluctuations during retention associated with the dynamics of the pre-stimulus DMN. In line with previous findings, theta power was increased at frontal-midline electrodes in high- versus low-load conditions during early WM retention (figure 2). However, correlations of DMN with theta power resulted in primarily positive correlations in low-load conditions, while during high-load conditions negative correlations of DMN activity and theta power were observed at frontal-midline electrodes. This DMN-dependent load effect reached significance in the middle of the retention period (TANOVA, p<0.05) (figure 3). Our results show a complex and load-dependent interaction of pre-stimulus DMN activity and theta power during retention, varying over time. While at a more global, load-independent view pre-stimulus DMN activity correlated positively with theta power during retention, the correlation was inversed during certain time windows in high-load trials, meaning that in trials with enhanced pre-stimulus DMN activity theta power decreases during retention. Since both WM performance and DMN activity are markers of mental health our results could be important for further investigations of psychiatric populations.
Resumo:
Mobile networks usage rapidly increased over the years, with great consequences in terms of performance requirements. In this paper, we propose mechanisms to use Information-Centric Networking to perform load balancing in mobile networks, providing content delivery over multiple radio technologies at the same time and thus efficiently using resources and improving the overall performance of content transfer. Meaningful results were obtained by comparing content transfer over single radio links with typical strategies to content transfer over multiple radio links with Information-Centric Networking load balancing. Results demonstrate that Information-Centric Networking load balancing increases the performance and efficiency of 3GPP Long Term Evolution mobile networks while greatly improving the network perceived quality for end users.
Resumo:
Patients with schizophrenia show abnormal dynamics and structure of temporally coherent networks (TCNs) assessed using fMRI, which undergo adaptive shifts in preparation for a cognitively demanding task. During working memory (WM) tasks, patients with schizophrenia show persistent deficits in TCNs as well as EEG indices of WM. Studying their temporal relationship during WM tasks might provide novel insights into WM performance deficits seen in schizophrenia. Simultaneous EEG-fMRI data were acquired during the performance of a verbal Sternberg WM task with two load levels (load 2 and load 5) in 17 patients with schizophrenia and 17 matched healthy controls. Using covariance mapping, we investigated the relationship of the activity in the TCNs before the memoranda were encoded and EEG spectral power during the retention interval. We assessed four TCNs – default mode network (DMN), dorsal attention network (dAN), left and right working memory networks (WMNs) – and three EEG bands – theta, alpha, and beta. In healthy controls, there was a load-dependent inverse relation between DMN and frontal midline theta power and an anti-correlation between DMN and dAN. Both effects were not significantly detectable in patients. In addition, healthy controls showed a left-lateralized load-dependent recruitment of the WMNs. Activation of the WMNs was bilateral in patients, suggesting more resources were recruited for successful performance on the WM task. Our findings support the notion of schizophrenia patients showing deviations in their neurophysiological responses before the retention of relevant information in a verbal WM task. Thus, treatment strategies as neurofeedback targeting prestates could be beneficial as task performance relies on the preparatory state of the brain.
Resumo:
This paper describes an experiment in designing, implementing and testing a Transport layer cluster scheduling and dispatching architecture. The motivation for the experiment was the hypothesis that a Transport layer clustering solution may offer advantantages over the existing industry-standard Network layer and Data Link Layer approaches. The critical success factors initially established to guide and evaluate the experiment were reduced dispatcher work load, reduced dispatcher internal state memory requirements, distributed denial of service resilience, and cluster software design simplicity. The functional design stage of the experiment produced a Transport layer strategy for scheduling and load balancing based on the specification of two new TCP options. Implementation required the introduction of the newly specified TCP options into the Linux (2.4) kernel. The implementation produced an extended Linux Socket API to facilitate user-process access to the additional TCP capability. The testing stage of the experiment confirmed the operational efficiency of the solution.
Resumo:
The computer systems of today are characterised by data and program control that are distributed functionally and geographically across a network. A major issue of concern in this environment is the operating system activity of resource management for different processors in the network. To ensure equity in load distribution and improved system performance, load balancing is often undertaken. The research conducted in this field so far, has been primarily concerned with a small set of algorithms operating on tightly-coupled distributed systems. More recent studies have investigated the performance of such algorithms in loosely-coupled architectures but using a small set of processors. This thesis describes a simulation model developed to study the behaviour and general performance characteristics of a range of dynamic load balancing algorithms. Further, the scalability of these algorithms are discussed and a range of regionalised load balancing algorithms developed. In particular, we examine the impact of network diameter and delay on the performance of such algorithms across a range of system workloads. The results produced seem to suggest that the performance of simple dynamic policies are scalable but lack the load stability of more complex global average algorithms.
Resumo:
In this paper, the implementation aspects and constraints of the simplest network coding (NC) schemes for a two-way relay channel (TWRC) composed of a user equipment (mobile terminal), an LTE relay station (RS) and an LTE base station (eNB) are considered in order to assess the usefulness of the NC in more realistic scenarios. The information exchange rate gain (IERG), the energy reduction gain (ERG) and the resource utilization gain (RUG) of the NC schemes with and without subcarrier division duplexing (SDD) are obtained by computer simulations. The usefulness of the NC schemes are evaluated for varying traffic load levels, the geographical distances between the nodes, the RS transmit powers, and the maximum numbers of retransmissions. Simulation results show that the NC schemes with and without SDD, have the throughput gains 0.5% and 25%, the ERGs 7 - 12% and 16 - 25%, and the RUGs 0.5 - 3.2%, respectively. It is found that the NC can provide performance gains also for the users at the cell edge. Furthermore, the ERGs of the NC increase with the transmit power of the relay while the ERGs of the NC remain the same even when the maximum number of retransmissions is reduced.
Resumo:
The environment of a mobile ad hoc network may vary greatly depending on nodes' mobility, traffic load and resource conditions. In this paper we categorize the environment of an ad hoc network into three main states: an ideal state, wherein the network is relatively stable with sufficient resources; a congested state, wherein some nodes, regions or the network is experiencing congestion; and an energy critical state, wherein the energy capacity of nodes in the network is critically low. Each of these states requires unique routing schemes, but existing ad hoc routing protocols are only effective in one of these states. This implies that when the network enters into any other states, these protocols run into a sub optimal mode, degrading the performance of the network. We propose an Ad hoc Network State Aware Routing Protocol (ANSAR) which conditionally switches between earliest arrival scheme and a joint Load-Energy aware scheme depending on the current state of the network. Comparing to existing schemes, it yields higher efficiency and reliability as shown in our simulation results. © 2007 IEEE.
Resumo:
Dynamic asset rating (DAR) is one of the number of techniques that could be used to facilitate low carbon electricity network operation. Previous work has looked at this technique from an asset perspective. This paper focuses, instead, from a network perspective by proposing a dynamic network rating (DNR) approach. The models available for use with DAR are discussed and compared using measured load and weather data from a trial network area within Milton Keynes in the central area of the U.K. This paper then uses the most appropriate model to investigate, through a network case study, the potential gains in dynamic rating compared to static rating for the different network assets - transformers, overhead lines, and cables. This will inform the network operator of the potential DNR gains on an 11-kV network with all assets present and highlight the limiting assets within each season.