International Nuclear Information System (INIS)
Pouransari, Nasibeh; Maréchal, Francois
2015-01-01
Highlights: • Synthesizing industrial size heat recovery network with match reduction approach. • Targeting TSI with minimum exchange between process subsystems. • Generating a feasible close-to-optimum network. • Reducing tremendously the HLD computational time and complexity. • Generating realistic network with respect to the plant layout. - Abstract: This paper presents a targeting strategy to design a heat recovery network for an industrial plant by dividing the system into subsystems while considering the heat transfer opportunities between them. The methodology is based on a sequential approach. The heat recovery opportunity between process units and the optimal flow rates of utilities are first identified using a Mixed Integer Linear Programming (MILP) model. The site is then divided into a number of subsystems where the overall interaction is resumed by a pair of virtual hot and cold stream per subsystem which is reconstructed by solving the heat cascade inside each subsystem. The Heat Load Distribution (HLD) problem is then solved between those packed subsystems in a sequential procedure where each time one of the subsystems is unpacked by switching from the virtual stream pair back into the original ones. The main advantages are to minimize the number of connections between process subsystems, to alleviate the computational complexity of the HLD problem and to generate a feasible network which is compatible with the minimum energy consumption objective. The application of the proposed methodology is illustrated through a number of case studies, discussed and compared with the relevant results from the literature
Load balancing in integrated optical wireless networks
DEFF Research Database (Denmark)
Yan, Ying; Dittmann, Lars; Wong, S-W.
2010-01-01
In this paper, we tackle the load balancing problem in Integrated Optical Wireless Networks, where cell breathing technique is used to solve congestion by changing the coverage area of a fully loaded cell tower. Our objective is to design a load balancing mechanism which works closely...... with the integrated control scheme so as to maximize overall network throughput in the integrated network architecture. To the best of our knowledge no load balancing mechanisms, especially based on the Multi-Point Control Protocol (MPCP) defined in the IEEE 802.3ah, have been proposed so far. The major research...... issues are outlined and a cost function based optimization model is developed for power management. In particularly, two alternative feedback schemes are proposed to report wireless network status. Simulation results show that our proposed load balancing mechanism improves network performances....
Load management in electrical networks. Objectives, methods, prospects
International Nuclear Information System (INIS)
Gabioud, D.
2008-01-01
This illustrated article takes up the problems related to the variation of the load in electricity networks. How to handle the peak load? Different solutions in the energy demand management are discussed. Method based on the price, method based on the reduction of the load by electric utilities. Information systems are presented which gives the consumer the needed data to participate in the local load management.
GENETIC ALGORITHM BASED CONCEPT DESIGN TO OPTIMIZE NETWORK LOAD BALANCE
Directory of Open Access Journals (Sweden)
Ashish Jain
2012-07-01
Full Text Available Multiconstraints optimal network load balancing is an NP-hard problem and it is an important part of traffic engineering. In this research we balance the network load using classical method (brute force approach and dynamic programming is used but result shows the limitation of this method but at a certain level we recognized that the optimization of balanced network load with increased number of nodes and demands is intractable using the classical method because the solution set increases exponentially. In such case the optimization techniques like evolutionary techniques can employ for optimizing network load balance. In this paper we analyzed proposed classical algorithm and evolutionary based genetic approach is devise as well as proposed in this paper for optimizing the balance network load.
vhv supply networks, problems of network structure
Energy Technology Data Exchange (ETDEWEB)
Raimbault, J
1966-04-01
The present and future power requirements of the Paris area and the structure of the existing networks are discussed. The various limitations that will have to be allowed for to lay down the structure of a regional transmission network leading in the power of the large national transmission network to within the Paris built up area are described. The theoretical solution that has been adopted, and the features of its final achievement, which is planned for about the year 2000, and the intermediate stages are given. The problem of the structure of the National Power Transmission network which is to supply the regional network was studied. To solve this problem, a 730 kV voltage network will have to be introduced.
Scaling of load in communications networks.
Narayan, Onuttom; Saniee, Iraj
2010-09-01
We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k)∼k{-γ} , we show that the load is l(k)∼k{η} with η=γ-1 , implying that the probability distribution for the load is p(l)∼1/l{2} independent of γ . The results are obtained through scaling arguments supported by finite size scaling studies. They contradict earlier claims, but are in agreement with the exact solution for the special case of tree graphs. Results are also presented for real communications networks at the IP layer, using the latest available data. Our analysis of the data shows relatively poor power-law degree distributions as compared to the scaling of the load versus degree. This emphasizes the importance of the load in network analysis.
Networks in social policy problems
Scotti, marco
2012-01-01
Network science is the key to managing social communities, designing the structure of efficient organizations and planning for sustainable development. This book applies network science to contemporary social policy problems. In the first part, tools of diffusion and team design are deployed to challenges in adoption of ideas and the management of creativity. Ideas, unlike information, are generated and adopted in networks of personal ties. Chapters in the second part tackle problems of power and malfeasance in political and business organizations, where mechanisms in accessing and controlling informal networks often outweigh formal processes. The third part uses ideas from biology and physics to understand global economic and financial crises, ecological depletion and challenges to energy security. Ideal for researchers and policy makers involved in social network analysis, business strategy and economic policy, it deals with issues ranging from what makes public advisories effective to how networks influenc...
Neural Network Algorithm for Particle Loading
International Nuclear Information System (INIS)
Lewandowski, J.L.V.
2003-01-01
An artificial neural network algorithm for continuous minimization is developed and applied to the case of numerical particle loading. It is shown that higher-order moments of the probability distribution function can be efficiently renormalized using this technique. A general neural network for the renormalization of an arbitrary number of moments is given
Directory of Open Access Journals (Sweden)
Tsirakis Christos
2017-01-01
Full Text Available The expected huge increase of mobile devices and user data demand by 2020 will stress the current mobile network in an unprecedented way. The future mobile networks must meet several strong requirements regarding the data rate, latency, quality of service and experience, mobility, spectrum and energy efficiency. Therefore, efforts for more efficient mobile network solutions have been recently initiated. To this direction, load balancing has attracted much attention as a promising solution for higher resource utilization, improved system performance and decreased operational cost. It is an effective method for balancing the traffic and alleviating the congestion among heterogeneous networks in the upcoming 5G networks. In this paper, we focus on an offloading scenario for load balancing among LTE and Wi-Fi networks. Additionally, network graphs methodology and its abstracted parameters are investigated in order to better manage wireless resource allocation among multiple connections. The COHERENT architectural framework, which consists of two main control components, makes use of such abstracted network graphs for controlling or managing various tasks such as traffic steering, load balancing, spectrum sharing and RAN sharing. As a result, the COHERENT project eventually develops a unified programmable control framework used to efficiently coordinate the underlying heterogeneous mobile networks as a whole.
Quantum load balancing in ad hoc networks
Hasanpour, M.; Shariat, S.; Barnaghi, P.; Hoseinitabatabaei, S. A.; Vahid, S.; Tafazolli, R.
2017-06-01
This paper presents a novel approach in targeting load balancing in ad hoc networks utilizing the properties of quantum game theory. This approach benefits from the instantaneous and information-less capability of entangled particles to synchronize the load balancing strategies in ad hoc networks. The quantum load balancing (QLB) algorithm proposed by this work is implemented on top of OLSR as the baseline routing protocol; its performance is analyzed against the baseline OLSR, and considerable gain is reported regarding some of the main QoS metrics such as delay and jitter. Furthermore, it is shown that QLB algorithm supports a solid stability gain in terms of throughput which stands a proof of concept for the load balancing properties of the proposed theory.
Neural Network Based Load Frequency Control for Restructuring ...
African Journals Online (AJOL)
Neural Network Based Load Frequency Control for Restructuring Power Industry. ... an artificial neural network (ANN) application of load frequency control (LFC) of a Multi-Area power system by using a neural network controller is presented.
CDMA coverage under mobile heterogeneous network load
Saban, D.; van den Berg, Hans Leo; Boucherie, Richardus J.; Endrayanto, A.I.
2002-01-01
We analytically investigate coverage (determined by the uplink) under non-homogeneous and moving traffic load of third generation UMTS mobile networks. In particular, for different call assignment policies, we investigate cell breathing and the movement of the coverage gap occurring between cells
Impact of Electric Vehicle Charging Station Load on Distribution Network
Directory of Open Access Journals (Sweden)
Sanchari Deb
2018-01-01
Full Text Available Recent concerns about environmental pollution and escalating energy consumption accompanied by the advancements in battery technology have initiated the electrification of the transportation sector. With the universal resurgence of Electric Vehicles (EVs the adverse impact of the EV charging loads on the operating parameters of the power system has been noticed. The detrimental impact of EV charging station loads on the electricity distribution network cannot be neglected. The high charging loads of the fast charging stations results in increased peak load demand, reduced reserve margins, voltage instability, and reliability problems. Further, the penalty paid by the utility for the degrading performance of the power system cannot be neglected. This work aims to investigate the impact of the EV charging station loads on the voltage stability, power losses, reliability indices, as well as economic losses of the distribution network. The entire analysis is performed on the IEEE 33 bus test system representing a standard radial distribution network for six different cases of EV charging station placement. It is observed that the system can withstand placement of fast charging stations at the strong buses up to a certain level, but the placement of fast charging stations at the weak buses of the system hampers the smooth operation of the power system. Further, a strategy for the placement of the EV charging stations on the distribution network is proposed based on a novel Voltage stability, Reliability, and Power loss (VRP index. The results obtained indicate the efficacy of the VRP index.
On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks
Li, Qiao-Qin; Gong, Haigang; Liu, Ming; Yang, Mei; Zheng, Jun
2011-01-01
This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures. PMID:22163809
Directory of Open Access Journals (Sweden)
Ирина Александровна Гавриленко
2016-02-01
Full Text Available The approach to automated management of load flow in engineering networks considering functional reliability was proposed in the article. The improvement of the concept of operational and strategic management of load flow in engineering networks was considered. The verbal statement of the problem for thesis research is defined, namely, the problem of development of information technology for exact calculation of the functional reliability of the network, or the risk of short delivery of purpose-oriented product for consumers
Flexible ship loading problem with transfer vehicle assignment and scheduling
DEFF Research Database (Denmark)
Iris, Çağatay; Christensen, Jonas; Pacino, Dario
2018-01-01
This paper presents the flexible containership loading problem for seaport container terminals. The integrated management of loading operations, planning of the transport vehicles to use and their scheduling is what we define as the Flexible Ship Loading Problem (FSLP). The flexibility comes from...
Wavelet neural network load frequency controller
International Nuclear Information System (INIS)
Hemeida, Ashraf Mohamed
2005-01-01
This paper presents the feasibility of applying a wavelet neural network (WNN) approach for the load frequency controller (LFC) to damp the frequency oscillations of two area power systems due to load disturbances. The present intelligent control system trained the wavelet neural network (WNN) controller on line with adaptive learning rates, which are derived in the sense of a discrete type Lyapunov stability theorem. The present WNN controller is designed individually for each area. The proposed technique is applied successfully for a wide range of operating conditions. The time simulation results indicate its superiority and effectiveness over the conventional approach. The effects of consideration of the governor dead zone on the system performance are studied using the proposed controller and the conventional one
Failure mitigation in software defined networking employing load type prediction
Bouacida, Nader
2017-07-31
The controller is a critical piece of the SDN architecture, where it is considered as the mastermind of SDN networks. Thus, its failure will cause a significant portion of the network to fail. Overload is one of the common causes of failure since the controller is frequently invoked by new flows. Even through SDN controllers are often replicated, the significant recovery time can be an overkill for the availability of the entire network. In order to overcome the problem of the overloaded controller failure in SDN, this paper proposes a novel controller offload solution for failure mitigation based on a prediction module that anticipates the presence of a harmful long-term load. In fact, the long-standing load would eventually overwhelm the controller leading to a possible failure. To predict whether the load in the controller is short-term or long-term load, we used three different classification algorithms: Support Vector Machine, k-Nearest Neighbors, and Naive Bayes. Our evaluation results demonstrate that Support Vector Machine algorithm is applicable for detecting the type of load with an accuracy of 97.93% in a real-time scenario. Besides, our scheme succeeded to offload the controller by switching between the reactive and proactive mode in response to the prediction module output.
Daily Nigerian peak load forecasting using artificial neural network ...
African Journals Online (AJOL)
A daily peak load forecasting technique that uses artificial neural network with seasonal indices is presented in this paper. A neural network of relatively smaller size than the main prediction network is used to predict the daily peak load for a period of one year over which the actual daily load data are available using one ...
Solving Complex Problems: A Convergent Approach to Cognitive Load Measurement
Zheng, Robert; Cook, Anne
2012-01-01
The study challenged the current practices in cognitive load measurement involving complex problem solving by manipulating the presence of pictures in multiple rule-based problem-solving situations and examining the cognitive load resulting from both off-line and online measures associated with complex problem solving. Forty-eight participants…
An Initial Load-Based Green Software Defined Network
Directory of Open Access Journals (Sweden)
Ying Hu
2017-05-01
Full Text Available Software defined network (SDN is a new network architecture in which the control function is decoupled from the data forwarding plane, that is attracting wide attentions from both research and industry sectors. However, SDN still faces the energy waste problem as do traditional networks. At present, research on energy saving in SDN is mainly focused on the static optimization of the network with zero load when new traffic arrives, changing the transmission path of the uncompleted traffic which arrived before the optimization, possibly resulting in route oscillation and other deleterious effects. To avoid this, a dynamical energy saving optimization scheme in which the paths of the uncompleted flows will not be changed when new traffic arrives is designed. To find the optimal solution for energy saving, the problem is modeled as a mixed integer linear programming (MILP problem. As the high complexity of the problem prohibits the optimal solution, an improved heuristic routing algorithm called improved constant weight greedy algorithm (ICWGA is proposed to find a sub-optimal solution. Simulation results show that the energy saving capacity of ICWGA is close to that of the optimal solution, offering desirable improvement in the energy efficiency of the network.
NIF ICCS network design and loading analysis
International Nuclear Information System (INIS)
Tietbohl, G; Bryant, R
1998-01-01
The National Ignition Facility (NIF) is housed within a large facility about the size of two football fields. The Integrated Computer Control System (ICCS) is distributed throughout this facility and requires the integration of about 40,000 control points and over 500 video sources. This integration is provided by approximately 700 control computers distributed throughout the NIF facility and a network that provides the communication infrastructure. A main control room houses a set of seven computer consoles providing operator access and control of the various distributed front-end processors (FEPs). There are also remote workstations distributed within the facility that allow provide operator console functions while personnel are testing and troubleshooting throughout the facility. The operator workstations communicate with the FEPs which implement the localized control and monitoring functions. There are different types of FEPs for the various subsystems being controlled. This report describes the design of the NIF ICCS network and how it meets the traffic loads that will are expected and the requirements of the Sub-System Design Requirements (SSDR's). This document supersedes the earlier reports entitled Analysis of the National Ignition Facility Network, dated November 6, 1996 and The National Ignition Facility Digital Video and Control Network, dated July 9, 1996. For an overview of the ICCS, refer to the document NIF Integrated Computer Controls System Description (NIF-3738)
Networks in Social Policy Problems
Vedres, Balázs; Scotti, Marco
2012-08-01
1. Introduction M. Scotti and B. Vedres; Part I. Information, Collaboration, Innovation: The Creative Power of Networks: 2. Dissemination of health information within social networks C. Dhanjal, S. Blanchemanche, S. Clemençon, A. Rona-Tas and F. Rossi; 3. Scientific teams and networks change the face of knowledge creation S. Wuchty, J. Spiro, B. F. Jones and B. Uzzi; 4. Structural folds: the innovative potential of overlapping groups B. Vedres and D. Stark; 5. Team formation and performance on nanoHub: a network selection challenge in scientific communities D. Margolin, K. Ognyanova, M. Huang, Y. Huang and N. Contractor; Part II. Influence, Capture, Corruption: Networks Perspectives on Policy Institutions: 6. Modes of coordination of collective action: what actors in policy making? M. Diani; 7. Why skewed distributions of pay for executives is the cause of much grief: puzzles and few answers so far B. Kogut and J.-S. Yang; 8. Networks of institutional capture: a case of business in the State apparatus E. Lazega and L. Mounier; 9. The social and institutional structure of corruption: some typical network configurations of corruption transactions in Hungary Z. Szántó, I. J. Tóth and S. Varga; Part III. Crisis, Extinction, World System Change: Network Dynamics on a Large Scale: 10. How creative elements help the recovery of networks after crisis: lessons from biology A. Mihalik, A. S. Kaposi, I. A. Kovács, T. Nánási, R. Palotai, Á. Rák, M. S. Szalay-Beko and P. Csermely; 11. Networks and globalization policies D. R. White; 12. Network science in ecology: the structure of ecological communities and the biodiversity question A. Bodini, S. Allesina and C. Bondavalli; 13. Supply security in the European natural gas pipeline network M. Scotti and B. Vedres; 14. Conclusions and outlook A.-L. Barabási; Index.
Supply network configuration—A benchmarking problem
Brandenburg, Marcus
2018-03-01
Managing supply networks is a highly relevant task that strongly influences the competitiveness of firms from various industries. Designing supply networks is a strategic process that considerably affects the structure of the whole network. In contrast, supply networks for new products are configured without major adaptations of the existing structure, but the network has to be configured before the new product is actually launched in the marketplace. Due to dynamics and uncertainties, the resulting planning problem is highly complex. However, formal models and solution approaches that support supply network configuration decisions for new products are scant. The paper at hand aims at stimulating related model-based research. To formulate mathematical models and solution procedures, a benchmarking problem is introduced which is derived from a case study of a cosmetics manufacturer. Tasks, objectives, and constraints of the problem are described in great detail and numerical values and ranges of all problem parameters are given. In addition, several directions for future research are suggested.
Load reduction test method of similarity theory and BP neural networks of large cranes
Yang, Ruigang; Duan, Zhibin; Lu, Yi; Wang, Lei; Xu, Gening
2016-01-01
Static load tests are an important means of supervising and detecting a crane's lift capacity. Due to space restrictions, however, there are difficulties and potential danger when testing large bridge cranes. To solve the loading problems of large-tonnage cranes during testing, an equivalency test is proposed based on the similarity theory and BP neural networks. The maximum stress and displacement of a large bridge crane is tested in small loads, combined with the training neural network of a similar structure crane through stress and displacement data which is collected by a physics simulation progressively loaded to a static load test load within the material scope of work. The maximum stress and displacement of a crane under a static load test load can be predicted through the relationship of stress, displacement, and load. By measuring the stress and displacement of small tonnage weights, the stress and displacement of large loads can be predicted, such as the maximum load capacity, which is 1.25 times the rated capacity. Experimental study shows that the load reduction test method can reflect the lift capacity of large bridge cranes. The load shedding predictive analysis for Sanxia 1200 t bridge crane test data indicates that when the load is 1.25 times the rated lifting capacity, the predicted displacement and actual displacement error is zero. The method solves the problem that lifting capacities are difficult to obtain and testing accidents are easily possible when 1.25 times related weight loads are tested for large tonnage cranes.
Integrated network design and scheduling problems :
Energy Technology Data Exchange (ETDEWEB)
Nurre, Sarah G.; Carlson, Jeffrey J.
2014-01-01
We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.
Reconstructing the Hopfield network as an inverse Ising problem
International Nuclear Information System (INIS)
Huang Haiping
2010-01-01
We test four fast mean-field-type algorithms on Hopfield networks as an inverse Ising problem. The equilibrium behavior of Hopfield networks is simulated through Glauber dynamics. In the low-temperature regime, the simulated annealing technique is adopted. Although performances of these network reconstruction algorithms on the simulated network of spiking neurons are extensively studied recently, the analysis of Hopfield networks is lacking so far. For the Hopfield network, we found that, in the retrieval phase favored when the network wants to memory one of stored patterns, all the reconstruction algorithms fail to extract interactions within a desired accuracy, and the same failure occurs in the spin-glass phase where spurious minima show up, while in the paramagnetic phase, albeit unfavored during the retrieval dynamics, the algorithms work well to reconstruct the network itself. This implies that, as an inverse problem, the paramagnetic phase is conversely useful for reconstructing the network while the retrieval phase loses all the information about interactions in the network except for the case where only one pattern is stored. The performances of algorithms are studied with respect to the system size, memory load, and temperature; sample-to-sample fluctuations are also considered.
Artificial Neural Networks for SCADA Data based Load Reconstruction (poster)
Hofemann, C.; Van Bussel, G.J.W.; Veldkamp, H.
2011-01-01
If at least one reference wind turbine is available, which provides sufficient information about the wind turbine loads, the loads acting on the neighbouring wind turbines can be predicted via an artificial neural network (ANN). This research explores the possibilities to apply such a network not
Radial basis function neural network for power system load-flow
International Nuclear Information System (INIS)
Karami, A.; Mohammadi, M.S.
2008-01-01
This paper presents a method for solving the load-flow problem of the electric power systems using radial basis function (RBF) neural network with a fast hybrid training method. The main idea is that some operating conditions (values) are needed to solve the set of non-linear algebraic equations of load-flow by employing an iterative numerical technique. Therefore, we may view the outputs of a load-flow program as functions of the operating conditions. Indeed, we are faced with a function approximation problem and this can be done by an RBF neural network. The proposed approach has been successfully applied to the 10-machine and 39-bus New England test system. In addition, this method has been compared with that of a multi-layer perceptron (MLP) neural network model. The simulation results show that the RBF neural network is a simpler method to implement and requires less training time to converge than the MLP neural network. (author)
Load-redistribution strategy based on time-varying load against cascading failure of complex network
International Nuclear Information System (INIS)
Liu Jun; Shi Xin; Wang Kai; Shi Wei-Ren; Xiong Qing-Yu
2015-01-01
Cascading failure can cause great damage to complex networks, so it is of great significance to improve the network robustness against cascading failure. Many previous existing works on load-redistribution strategies require global information, which is not suitable for large scale networks, and some strategies based on local information assume that the load of a node is always its initial load before the network is attacked, and the load of the failure node is redistributed to its neighbors according to their initial load or initial residual capacity. This paper proposes a new load-redistribution strategy based on local information considering an ever-changing load. It redistributes the loads of the failure node to its nearest neighbors according to their current residual capacity, which makes full use of the residual capacity of the network. Experiments are conducted on two typical networks and two real networks, and the experimental results show that the new load-redistribution strategy can reduce the size of cascading failure efficiently. (paper)
Failure cascade in interdependent network with traffic loads
International Nuclear Information System (INIS)
Hong, Sheng; Wang, Baoqing; Wang, Jianghui; Zhao, Tingdi; Ma, Xiaomin
2015-01-01
Complex networks have been widely studied recent years, but most researches focus on the single, non-interacting networks. With the development of modern systems, many infrastructure networks are coupled together and therefore should be modeled as interdependent networks. For interdependent networks, failure of nodes in one network may lead to failure of dependent nodes in the other networks. This may happen recursively and lead to a failure cascade. In the real world, different networks carry different traffic loads. Overload and load redistribution may lead to more nodes’ failure. Considering the dependency between the interdependent networks and the traffic load, a small fraction of fault nodes may lead to complete fragmentation of a system. Based on the robust analysis of interdependent networks, we propose a costless defense strategy to suppress the failure cascade. Our findings highlight the need to consider the load and coupling preference when designing robust interdependent networks. And it is necessary to take actions in the early stage of the failure cascade to decrease the losses caused by the large-scale breakdown of infrastructure networks. (paper)
Solving inversion problems with neural networks
Kamgar-Parsi, Behzad; Gualtieri, J. A.
1990-01-01
A class of inverse problems in remote sensing can be characterized by Q = F(x), where F is a nonlinear and noninvertible (or hard to invert) operator, and the objective is to infer the unknowns, x, from the observed quantities, Q. Since the number of observations is usually greater than the number of unknowns, these problems are formulated as optimization problems, which can be solved by a variety of techniques. The feasibility of neural networks for solving such problems is presently investigated. As an example, the problem of finding the atmospheric ozone profile from measured ultraviolet radiances is studied.
Node Load Balance Multi-flow Opportunistic Routing in Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Wang Tao
2014-04-01
Full Text Available Opportunistic routing (OR has been proposed to improve the performance of wireless networks by exploiting the multi-user diversity and broadcast nature of the wireless medium. It involves multiple candidate forwarders to relay packets every hop. The existing OR doesn’t take account of the traffic load and load balance, therefore some nodes may be overloaded while the others may not, leading to network performance decline. In this paper, we focus on opportunities routing selection with node load balance which is described as a convex optimization problem. To solve the problem, by combining primal-dual and sub-gradient methods, a fully distributed Node load balance Multi-flow Opportunistic Routing algorithm (NMOR is proposed. With node load balance constraint, NMOR allocates the flow rate iteratively and the rate allocation decides the candidate forwarder selection of opportunities routing. The simulation results show that NMOR algorithm improves 100 %, 62 % of the aggregative throughput than ETX and EAX, respectively.
Directory of Open Access Journals (Sweden)
K. Mohaideen Pitchai
2017-07-01
Full Text Available Wireless Sensor Network (WSN consists of a large number of small sensors with restricted energy. Prolonged network lifespan, scalability, node mobility and load balancing are important needs for several WSN applications. Clustering the sensor nodes is an efficient technique to reach these goals. WSN have the characteristics of topology dynamics because of factors like energy conservation and node movement that leads to Dynamic Load Balanced Clustering Problem (DLBCP. In this paper, Elitism based Random Immigrant Genetic Approach (ERIGA is proposed to solve DLBCP which adapts to topology dynamics. ERIGA uses the dynamic Genetic Algorithm (GA components for solving the DLBCP. The performance of load balanced clustering process is enhanced with the help of this dynamic GA. As a result, the ERIGA achieves to elect suitable cluster heads which balances the network load and increases the lifespan of the network.
Discrete PSO algorithm based optimization of transmission lines loading in TNEP problem
International Nuclear Information System (INIS)
Shayeghi, H.; Mahdavi, M.; Bagheri, A.
2010-01-01
Transmission network expansion planning (TNEP) is a basic part of power system planning that determines where, when and how many new transmission lines should be added to the network. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of these methods, lines adequacy rate has not been considered at the end of planning horizon, i.e. expanded network misses adequacy after some times and needs to be expanded again. In this paper, expansion planning has been implemented by merging lines loading parameter in the STNEP and inserting investment cost into the fitness function constraints using discrete particle swarm optimization (DPSO) algorithm. Expanded network will possess a maximum adequacy to provide load demand and also the transmission lines overloaded later. The proposed idea has been tested on the Garvers network and an actual transmission network of the Azerbaijan regional electric company, Iran, and the results are compared with the decimal codification genetic algorithm (DCGA) technique. The results evaluation shows that the network will possess maximum efficiency economically. Also, it is shown that precision and convergence speed of the proposed DPSO based method for the solution of the STNEP problem is superior to DCGA approach.
Optimal Base Station Density of Dense Network: From the Viewpoint of Interference and Load.
Feng, Jianyuan; Feng, Zhiyong
2017-09-11
Network densification is attracting increasing attention recently due to its ability to improve network capacity by spatial reuse and relieve congestion by offloading. However, excessive densification and aggressive offloading can also cause the degradation of network performance due to problems of interference and load. In this paper, with consideration of load issues, we study the optimal base station density that maximizes the throughput of the network. The expected link rate and the utilization ratio of the contention-based channel are derived as the functions of base station density using the Poisson Point Process (PPP) and Markov Chain. They reveal the rules of deployment. Based on these results, we obtain the throughput of the network and indicate the optimal deployment density under different network conditions. Extensive simulations are conducted to validate our analysis and show the substantial performance gain obtained by the proposed deployment scheme. These results can provide guidance for the network densification.
Software defined networks reactive flow programming and load balance switching
Καλλιανιώτης, Νικόλαος; Kallianiotis, Nikolaos
2017-01-01
This project serves as a Master Thesis as the requirements of the master’s programme Master of Digital Communications and Networks. It proposes load balancing algorithms applied to Software-Defined Networks to achieve the best possible resource utilisation of each of the links present in a network. The open-sources Opendaylight project and Floodlight project are used as SDN controllers, and the network is emulated using Mininet software
Generalized network improvement and packing problems
Holzhauser, Michael
2016-01-01
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms. Contents Fractional Packing and Parametric Search Frameworks Budget-Constrained Minimum Cost Flows: The Continuous Case Budget-Constrained Minimum Cost Flows: The Discrete Case Generalized Processing Networks Convex Generalized Flows Target Groups Researchers and students in the fields of mathematics, computer science, and economics Practitioners in operations research and logistics The Author Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern.
Short-Term Load Forecasting-Based Automatic Distribution Network Reconfiguration
Energy Technology Data Exchange (ETDEWEB)
Jiang, Huaiguang [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Ding, Fei [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhang, Yingchen [National Renewable Energy Laboratory (NREL), Golden, CO (United States)
2017-08-23
In a traditional dynamic network reconfiguration study, the optimal topology is determined at every scheduled time point by using the real load data measured at that time. The development of the load forecasting technique can provide an accurate prediction of the load power that will happen in a future time and provide more information about load changes. With the inclusion of load forecasting, the optimal topology can be determined based on the predicted load conditions during a longer time period instead of using a snapshot of the load at the time when the reconfiguration happens; thus, the distribution system operator can use this information to better operate the system reconfiguration and achieve optimal solutions. This paper proposes a short-term load forecasting approach to automatically reconfigure distribution systems in a dynamic and pre-event manner. Specifically, a short-term and high-resolution distribution system load forecasting approach is proposed with a forecaster based on support vector regression and parallel parameters optimization. The network reconfiguration problem is solved by using the forecasted load continuously to determine the optimal network topology with the minimum amount of loss at the future time. The simulation results validate and evaluate the proposed approach.
Short-Term Load Forecasting Based Automatic Distribution Network Reconfiguration: Preprint
Energy Technology Data Exchange (ETDEWEB)
Jiang, Huaiguang [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Ding, Fei [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhang, Yingchen [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Jiang, Huaiguang [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Ding, Fei [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhang, Yingchen [National Renewable Energy Laboratory (NREL), Golden, CO (United States)
2017-07-26
In the traditional dynamic network reconfiguration study, the optimal topology is determined at every scheduled time point by using the real load data measured at that time. The development of load forecasting technique can provide accurate prediction of load power that will happen in future time and provide more information about load changes. With the inclusion of load forecasting, the optimal topology can be determined based on the predicted load conditions during the longer time period instead of using the snapshot of load at the time when the reconfiguration happens, and thus it can provide information to the distribution system operator (DSO) to better operate the system reconfiguration to achieve optimal solutions. Thus, this paper proposes a short-term load forecasting based approach for automatically reconfiguring distribution systems in a dynamic and pre-event manner. Specifically, a short-term and high-resolution distribution system load forecasting approach is proposed with support vector regression (SVR) based forecaster and parallel parameters optimization. And the network reconfiguration problem is solved by using the forecasted load continuously to determine the optimal network topology with the minimum loss at the future time. The simulation results validate and evaluate the proposed approach.
A Bankruptcy Problem Approach to Load-shedding in Multiagent-based Microgrid Operation
Directory of Open Access Journals (Sweden)
Yujin Lim
2010-09-01
Full Text Available A microgrid is composed of distributed power generation systems (DGs, distributed energy storage devices (DSs, and loads. To maintain a specific frequency in the islanded mode as an important requirement, the control of DGs’ output and charge action of DSs are used in supply surplus conditions and load-shedding and discharge action of DSs are used in supply shortage conditions. Recently, multiagent systems for autonomous microgrid operation have been studied. Especially, load-shedding, which is intentional reduction of electricity use, is a critical problem in islanded microgrid operation based on the multiagent system. Therefore, effective schemes for load-shedding are required. Meanwhile, the bankruptcy problem deals with dividing short resources among multiple agents. In order to solve the bankruptcy problem, division rules, such as the constrained equal awards rule (CEA, the constrained equal losses rule (CEL, and the random arrival rule (RA, have been used. In this paper, we approach load-shedding as a bankruptcy problem. We compare load-shedding results by above-mentioned rules in islanded microgrid operation based on wireless sensor network (WSN as the communication link for an agent’s interactions.
A bankruptcy problem approach to load-shedding in multiagent-based microgrid operation.
Kim, Hak-Man; Kinoshita, Tetsuo; Lim, Yujin; Kim, Tai-Hoon
2010-01-01
A microgrid is composed of distributed power generation systems (DGs), distributed energy storage devices (DSs), and loads. To maintain a specific frequency in the islanded mode as an important requirement, the control of DGs' output and charge action of DSs are used in supply surplus conditions and load-shedding and discharge action of DSs are used in supply shortage conditions. Recently, multiagent systems for autonomous microgrid operation have been studied. Especially, load-shedding, which is intentional reduction of electricity use, is a critical problem in islanded microgrid operation based on the multiagent system. Therefore, effective schemes for load-shedding are required. Meanwhile, the bankruptcy problem deals with dividing short resources among multiple agents. In order to solve the bankruptcy problem, division rules, such as the constrained equal awards rule (CEA), the constrained equal losses rule (CEL), and the random arrival rule (RA), have been used. In this paper, we approach load-shedding as a bankruptcy problem. We compare load-shedding results by above-mentioned rules in islanded microgrid operation based on wireless sensor network (WSN) as the communication link for an agent's interactions.
Some beam-loading problems in LAMPF II
International Nuclear Information System (INIS)
Wang, T.S.F.; Warren, J.L.
1985-01-01
Some beam-loading problems are investigated for the proposed LAMPF II synchrotron main ring and booster. Estimations for the feedback control requirements to reduce the power consumption, by accelerating protons beyond the Robinson stability limit, are provided. The results indicate that it is technically feasible to realize this kind of power-saving idea
Cognitive load and the acquisition of a problem solving skill
Hoe, van R.R.G.; Brouwer-Janse, M.D.; Harrington, T.L.
1994-01-01
Current theories of leaming consider the restructuring of the components of a weak problem solving sequence into a domain-specific procedure to be the fundamental leaming mechanism in complex knowledge domains. Within the context of cognitive load theory, there is growing evidence that applying weak
Hub location problems in transportation networks
DEFF Research Database (Denmark)
Gelareh, Shahin; Nickel, Stefan
2011-01-01
In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root node....... also introduce fixed cost values for Australian Post (AP) dataset....
Bin-packing problems with load balancing and stability constraints
DEFF Research Database (Denmark)
Trivella, Alessio; Pisinger, David
apper in a wide range of disciplines, including transportation and logistics, computer science, engineering, economics and manufacturing. The problem is well-known to be N P-hard and difficult to solve in practice, especially when dealing with the multi-dimensional cases. Closely connected to the BPP...... realistic constraints related to e.g. load balancing, cargo stability and weight limits, in the multi-dimensional BPP. The BPP poses additional challenges compared to the CLP due to the supplementary objective of minimizing the number of bins. In particular, in section 2 we discuss how to integrate bin......-packing and load balancing of items. The problem has only been considered in the literature in simplified versions, e.g. balancing a single bin or introducing a feasible region for the barycenter. In section 3 we generalize the problem to handle cargo stability and weight constraints....
Study on ant colony optimization for fuel loading pattern problem
International Nuclear Information System (INIS)
Kishi, Hironori; Kitada, Takanori
2013-01-01
Modified ant colony optimization (ACO) was applied to the in-core fuel loading pattern (LP) optimization problem to minimize the power peaking factor (PPF) in the modeled 1/4 symmetry PWR core. Loading order was found to be important in ACO. Three different loading orders with and without the adjacent effect between fuel assemblies (FAs) were compared, and it was found that the loading order from the central core is preferable because many selections of FAs to be inserted are available in the core center region. LPs were determined from pheromone trail and heuristic information, which is a priori knowledge based on the feature of the problem. Three types of heuristic information were compared to obtain the desirable performance of searching LPs with low PPF. Moreover, mutation operation, such as the genetic algorithm (GA), was introduced into the ACO algorithm to avoid searching similar LPs because heuristic information used in ACO tends to localize the searching space in the LP problem. The performance of ACO with some improvement was compared with those of simulated annealing and GA. In conclusion, good performance can be achieved by setting proper heuristic information and mutation operation parameter in ACO. (author)
Insensitivity of proportional fairness in critically loaded bandwidth sharing networks
Vlasiou, M.; Zhang, J.; Zwart, B.
2014-01-01
Proportional fairness is a popular service allocation mechanism to describe and analyze the performance of data networks at flow level. Recently, several authors have shown that the invariant distribution of such networks admits a product form distribution under critical loading. Assuming
Short term load forecasting using neuro-fuzzy networks
Energy Technology Data Exchange (ETDEWEB)
Hoffman, M.; Hassan, A. [South Dakota School of Mines and Technology, Rapid City, SD (United States); Martinez, D. [Black Hills Power and Light, Rapid City, SD (United States)
2005-07-01
Details of a neuro-fuzzy network-based short term load forecasting system for power utilities were presented. The fuzzy logic controller was used to fuzzify inputs representing historical temperature and load curves. The fuzzified inputs were then used to develop the fuzzy rules matrix. Output membership function values were determined by evaluating the fuzzified inputs with the fuzzy rules. Output membership function values were used as inputs for the neural network portion of the system. The training process used a back propagation gradient descent algorithm to adjust the weight values of the neural network in order to reduce the error between the neural network output and the desired output. The neural network was then used to predict future load values. Sample data were taken from a local power company's daily load curve to validate the system. A 10 per cent forecast error was introduced in the temperature values to determine the effect on load prediction. Results of the study suggest that the combined use of fuzzy logic and neural networks provide greater accuracy than studies where either approach is used alone. 6 refs., 6 figs.
Peak loads and network investments in sustainable energy transitions
Energy Technology Data Exchange (ETDEWEB)
Blokhuis, Erik, E-mail: e.g.j.blokhuis@tue.nl [Eindhoven University of Technology, Department of Architecture, Building and Planning, Vertigo 8.11, P.O. Box 513, 5600MB Eindhoven (Netherlands); Brouwers, Bart [Eindhoven University of Technology, Department of Architecture, Building and Planning, Vertigo 8.11, P.O. Box 513, 5600MB Eindhoven (Netherlands); Putten, Eric van der [Endinet, Gas and Electricity Network Operations, P.O. Box 2005, 5600CA Eindhoven (Netherlands); Schaefer, Wim [Eindhoven University of Technology, Department of Architecture, Building and Planning, Vertigo 8.11, P.O. Box 513, 5600MB Eindhoven (Netherlands)
2011-10-15
Current energy distribution networks are often not equipped for facilitating expected sustainable transitions. Major concerns for future electricity networks are the possibility of peak load increases and the expected growth of decentralized energy generation. In this article, we focus on peak load increases; the effects of possible future developments on peak loads are studied, together with the consequences for the network. The city of Eindhoven (the Netherlands) is used as reference city, for which a scenario is developed in which the assumed future developments adversely influence the maximum peak loads on the network. In this scenario, the total electricity peak load in Eindhoven is expected to increase from 198 MVA in 2009 to 591-633 MVA in 2040. The necessary investments for facilitating the expected increased peak loads are estimated at 305-375 million Euros. Based upon these projections, it is advocated that - contrary to current Dutch policy - choices regarding sustainable transitions should be made from the viewpoint of integral energy systems, evaluating economic implications of changes to generation, grid development, and consumption. Recently applied and finished policies on energy demand reduction showed to be effective; however, additional and connecting policies on energy generation and distribution should be considered on short term. - Highlights: > Sustainable energy transitions can result in major electricity peak load increases. > Introduction of heat pumps and electrical vehicles requires network expansion. > Under worst case assumptions, peak loads in Eindhoven increase with 200% until 2040. > The necessary investment for facilitating this 2040 peak demand is Euro 305-375 million. > Future policy choices should be made from the viewpoint of the integral energy system.
Peak loads and network investments in sustainable energy transitions
International Nuclear Information System (INIS)
Blokhuis, Erik; Brouwers, Bart; Putten, Eric van der; Schaefer, Wim
2011-01-01
Current energy distribution networks are often not equipped for facilitating expected sustainable transitions. Major concerns for future electricity networks are the possibility of peak load increases and the expected growth of decentralized energy generation. In this article, we focus on peak load increases; the effects of possible future developments on peak loads are studied, together with the consequences for the network. The city of Eindhoven (the Netherlands) is used as reference city, for which a scenario is developed in which the assumed future developments adversely influence the maximum peak loads on the network. In this scenario, the total electricity peak load in Eindhoven is expected to increase from 198 MVA in 2009 to 591-633 MVA in 2040. The necessary investments for facilitating the expected increased peak loads are estimated at 305-375 million Euros. Based upon these projections, it is advocated that - contrary to current Dutch policy - choices regarding sustainable transitions should be made from the viewpoint of integral energy systems, evaluating economic implications of changes to generation, grid development, and consumption. Recently applied and finished policies on energy demand reduction showed to be effective; however, additional and connecting policies on energy generation and distribution should be considered on short term. - Highlights: → Sustainable energy transitions can result in major electricity peak load increases. → Introduction of heat pumps and electrical vehicles requires network expansion. → Under worst case assumptions, peak loads in Eindhoven increase with 200% until 2040. → The necessary investment for facilitating this 2040 peak demand is Euro 305-375 million. → Future policy choices should be made from the viewpoint of the integral energy system.
Software defined network architecture based research on load balancing strategy
You, Xiaoqian; Wu, Yang
2018-05-01
As a new type network architecture, software defined network has the key idea of separating the control place of the network from the transmission plane, to manage and control the network in a concentrated way; in addition, the network interface is opened on the control layer and the data layer, so as to achieve programmable control of the network. Considering that only the single shortest route is taken into the calculation of traditional network data flow transmission, and congestion and resource consumption caused by excessive load of link circuits are ignored, a link circuit load based flow media business QoS gurantee system is proposed in this article to divide the flow in the network into ordinary data flow and QoS flow. In this way, it supervises the link circuit load with the controller so as to calculate reasonable route rapidly and issue the flow table to the exchanger, to finish rapid data transmission. In addition, it establishes a simulation platform to acquire optimized result through simulation experiment.
Overload cascading failure on complex networks with heterogeneous load redistribution
Hou, Yueyi; Xing, Xiaoyun; Li, Menghui; Zeng, An; Wang, Yougui
2017-09-01
Many real systems including the Internet, power-grid and financial networks experience rare but large overload cascading failures triggered by small initial shocks. Many models on complex networks have been developed to investigate this phenomenon. Most of these models are based on the load redistribution process and assume that the load on a failed node shifts to nearby nodes in the networks either evenly or according to the load distribution rule before the cascade. Inspired by the fact that real power-grid tends to place the excess load on the nodes with high remaining capacities, we study a heterogeneous load redistribution mechanism in a simplified sandpile model in this paper. We find that weak heterogeneity in load redistribution can effectively mitigate the cascade while strong heterogeneity in load redistribution may even enlarge the size of the final failure. With a parameter θ to control the degree of the redistribution heterogeneity, we identify a rather robust optimal θ∗ = 1. Finally, we find that θ∗ tends to shift to a larger value if the initial sand distribution is homogeneous.
Solving Dynamic Battlespace Movement Problems Using Dynamic Distributed Computer Networks
National Research Council Canada - National Science Library
Bradford, Robert
2000-01-01
.... The thesis designs a system using this architecture that invokes operations research network optimization algorithms to solve problems involving movement of people and equipment over dynamic road networks...
PLATON: Peer-to-Peer load adjusting tree overlay networks
Lymberopoulos, L.; Pittaras, C.; Grammatikou, M.; Papavassiliou, S.; Maglaris, V.
2011-01-01
Peer-to-Peer systems supporting multi attribute and range queries use a number of techniques to partition the multi dimensional data space among participating peers. Load-balancing of data accross peer partitions is necessary in order to avoid the presence of network hotspots which may cause
Three-Phase Unbalanced Load Flow Tool for Distribution Networks
DEFF Research Database (Denmark)
Demirok, Erhan; Kjær, Søren Bækhøj; Sera, Dezso
2012-01-01
This work develops a three-phase unbalanced load flow tool tailored for radial distribution networks based on Matlab®. The tool can be used to assess steady-state voltage variations, thermal limits of grid components and power losses in radial MV-LV networks with photovoltaic (PV) generators where...... most of the systems are single phase. New ancillary service such as static reactive power support by PV inverters can be also merged together with the load flow solution tool and thus, the impact of the various reactive power control strategies on the steady-state grid operation can be simply...... investigated. Performance of the load flow solution tool in the sense of resulting bus voltage magnitudes is compared and validated with IEEE 13-bus test feeder....
Analysis of recurrent neural networks for short-term energy load forecasting
Di Persio, Luca; Honchar, Oleksandr
2017-11-01
Short-term forecasts have recently gained an increasing attention because of the rise of competitive electricity markets. In fact, short-terms forecast of possible future loads turn out to be fundamental to build efficient energy management strategies as well as to avoid energy wastage. Such type of challenges are difficult to tackle both from a theoretical and applied point of view. Latter tasks require sophisticated methods to manage multidimensional time series related to stochastic phenomena which are often highly interconnected. In the present work we first review novel approaches to energy load forecasting based on recurrent neural network, focusing our attention on long/short term memory architectures (LSTMs). Such type of artificial neural networks have been widely applied to problems dealing with sequential data such it happens, e.g., in socio-economics settings, for text recognition purposes, concerning video signals, etc., always showing their effectiveness to model complex temporal data. Moreover, we consider different novel variations of basic LSTMs, such as sequence-to-sequence approach and bidirectional LSTMs, aiming at providing effective models for energy load data. Last but not least, we test all the described algorithms on real energy load data showing not only that deep recurrent networks can be successfully applied to energy load forecasting, but also that this approach can be extended to other problems based on time series prediction.
REDISTRIBUTION OF BASE STATIONS LOAD IN MOBILE COMMUNICATION NETWORKS
Directory of Open Access Journals (Sweden)
Igor Ruban
2017-09-01
Full Text Available The subject matter of the article is the processes of load distribution in mobile communication networks. The object of research is the handover. The goal is to develop a method for redistributing the load between neighboring areas for mobile nodes. The considered base stations are supposed to have the signal-to-noise ratios that are equal or close. The methods that are used: methods of system analysis, methods of digital signal processing. The following results are obtained. The method that allows mobile nodes, whose signal-to-noise ratios are equal or close, to switch to a less loaded base station. This method allows the base station to launch the handover process enabling more even distribution of the load from mobile nodes among neighboring base stations in wireless and mobile networks. In the suggested modification of the method, the function assessing the bandwidth of the uplink channel is added to the base stations, as well a threshold value for using its bandwidth. Thus, when the current value of bandwidth reaches the threshold, the base station starts sending out a message to all mobile nodes and verifies free neighboring areas for switching over mobile nodes. If there are adjacent areas with a lower load, the base station notifies all potential candidates about the necessity of their switching over. The handover process is launched when the available bandwidth of the base station decreases below a certain threshold. Therefore, it is possible to optimize the operation of the WiMAX network with respect to the criterion of the total bandwidth capacity of the base stations. Besides, the results of the comparative analysis of the handover process in networks based on the WiMAX technology that are obtained using the OpNet simulation environment are presented. Conclusions.The suggested approach can be used to improve the basic software of mobile communication networks. When moving a node from one area to another one in access servers, the
Optimal Dispatching of Active Distribution Networks Based on Load Equilibrium
Directory of Open Access Journals (Sweden)
Xiao Han
2017-12-01
Full Text Available This paper focuses on the optimal intraday scheduling of a distribution system that includes renewable energy (RE generation, energy storage systems (ESSs, and thermostatically controlled loads (TCLs. This system also provides time-of-use pricing to customers. Unlike previous studies, this study attempts to examine how to optimize the allocation of electric energy and to improve the equilibrium of the load curve. Accordingly, we propose a concept of load equilibrium entropy to quantify the overall equilibrium of the load curve and reflect the allocation optimization of electric energy. Based on this entropy, we built a novel multi-objective optimal dispatching model to minimize the operational cost and maximize the load curve equilibrium. To aggregate TCLs into the optimization objective, we introduced the concept of a virtual power plant (VPP and proposed a calculation method for VPP operating characteristics based on the equivalent thermal parameter model and the state-queue control method. The Particle Swarm Optimization algorithm was employed to solve the optimization problems. The simulation results illustrated that the proposed dispatching model can achieve cost reductions of system operations, peak load curtailment, and efficiency improvements, and also verified that the load equilibrium entropy can be used as a novel index of load characteristics.
Load-induced modulation of signal transduction networks.
Jiang, Peng; Ventura, Alejandra C; Sontag, Eduardo D; Merajver, Sofia D; Ninfa, Alexander J; Del Vecchio, Domitilla
2011-10-11
Biological signal transduction networks are commonly viewed as circuits that pass along information--in the process amplifying signals, enhancing sensitivity, or performing other signal-processing tasks--to transcriptional and other components. Here, we report on a "reverse-causality" phenomenon, which we call load-induced modulation. Through a combination of analytical and experimental tools, we discovered that signaling was modulated, in a surprising way, by downstream targets that receive the signal and, in doing so, apply what in physics is called a load. Specifically, we found that non-intuitive changes in response dynamics occurred for a covalent modification cycle when load was present. Loading altered the response time of a system, depending on whether the activity of one of the enzymes was maximal and the other was operating at its minimal rate or whether both enzymes were operating at submaximal rates. These two conditions, which we call "limit regime" and "intermediate regime," were associated with increased or decreased response times, respectively. The bandwidth, the range of frequency in which the system can process information, decreased in the presence of load, suggesting that downstream targets participate in establishing a balance between noise-filtering capabilities and a circuit's ability to process high-frequency stimulation. Nodes in a signaling network are not independent relay devices, but rather are modulated by their downstream targets.
A network flow model for load balancing in circuit-switched multicomputers
Bokhari, Shahid H.
1990-01-01
In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention - the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case, there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks that avoids contention. The problem is made complex by the hardwired routing on currently available machines: the user can control only which nodes communicate but not how the messages are routed. Network flow models of message flow in the mesh and the hypercube were developed to solve this problem. The crucial property of these models is the correspondence between minimum cost flows and correctly routed messages. To solve a given load balancing problem, a minimum cost flow algorithm is applied to the network. This permits one to determine efficiently a maximum contention free matching of sources to sinks which, in turn, tells one how much of the given imbalance can be eliminated without contention.
ETHOD OF COMPENSATING LOADS FOR SOLVING OF ANISOTROPIC MEDIUM PROBLEMS
Directory of Open Access Journals (Sweden)
Elena B. Koreneva
2018-03-01
Full Text Available The work applies the method of compensating loads (MCL for solution of statics and vibrations problems of plates with cylindrical anisotropy. For receiving of basic and compensating solutions Nielsen’s equation is used. The solution expressed in terms of Bessel functions is obtained. Such way can be used in con-sideration of symmetric, antisymmetric and unsymmetric flexure of orthotropic circular plates resting on an elastic Winkler’s subgrade. The similar method can be also utilized for examination of the symmetric vibrations of the orthotropic circular plates as well as for the cases of vibrations with one or a few nodal diameters. The solutions are obtained in closed form in terms of the cylindrical functions.
Application of the load flow and random flow models for the analysis of power transmission networks
International Nuclear Information System (INIS)
Zio, Enrico; Piccinelli, Roberta; Delfanti, Maurizio; Olivieri, Valeria; Pozzi, Mauro
2012-01-01
In this paper, the classical load flow model and the random flow model are considered for analyzing the performance of power transmission networks. The analysis concerns both the system performance and the importance of the different system elements; this latter is computed by power flow and random walk betweenness centrality measures. A network system from the literature is analyzed, representing a simple electrical power transmission network. The results obtained highlight the differences between the LF “global approach” to flow dispatch and the RF local approach of randomized node-to-node load transfer. Furthermore, computationally the LF model is less consuming than the RF model but problems of convergence may arise in the LF calculation.
Immune networks: multi-tasking capabilities at medium load
Agliari, E.; Annibale, A.; Barra, A.; Coolen, A. C. C.; Tantari, D.
2013-08-01
Associative network models featuring multi-tasking properties have been introduced recently and studied in the low-load regime, where the number P of simultaneously retrievable patterns scales with the number N of nodes as P ˜ log N. In addition to their relevance in artificial intelligence, these models are increasingly important in immunology, where stored patterns represent strategies to fight pathogens and nodes represent lymphocyte clones. They allow us to understand the crucial ability of the immune system to respond simultaneously to multiple distinct antigen invasions. Here we develop further the statistical mechanical analysis of such systems, by studying the medium-load regime, P ˜ Nδ with δ ∈ (0, 1]. We derive three main results. First, we reveal the nontrivial architecture of these networks: they exhibit a high degree of modularity and clustering, which is linked to their retrieval abilities. Second, by solving the model we demonstrate for δ frameworks are required to achieve effective retrieval.
A theory of intelligence: networked problem solving in animal societies
Shour, Robert
2009-01-01
A society's single emergent, increasing intelligence arises partly from the thermodynamic advantages of networking the innate intelligence of different individuals, and partly from the accumulation of solved problems. Economic growth is proportional to the square of the network entropy of a society's population times the network entropy of the number of the society's solved problems.
Leveraging Microgrids for Capturing Uncertain Distribution Network Net Load Ramping
Majzoobi, Alireza; Khodaei, Amin
2016-01-01
In this paper, a flexibility-oriented microgrid optimal scheduling model is proposed to mitigate distribution network net load variability caused by large penetration distributed solar generation. The distributed solar generation variability, which is caused by increasing adoption of this technology by end-use consumers, is mainly addressed by electric utilities using grid reinforcement. Microgrids, however, provide viable and local solutions to this pressing challenge. The proposed model, wh...
Intelligent harmonic load model based on neural networks
Ji, Pyeong-Shik; Lee, Dae-Jong; Lee, Jong-Pil; Park, Jae-Won; Lim, Jae-Yoon
2007-12-01
In this study, we developed a RBFNs(Radial Basis Function Networks) based load modeling method with harmonic components. The developed method implemented by using harmonic information as well as fundamental frequency and voltage which are essential input factors in conventional method. Thus, the proposed method makes it possible to effectively estimate load characteristics in power lines with harmonics. The RBFNs have certain advantage such as simple structure and rapid computation ability compared with multilayer perceptron which is extensively applied for load modeling. To show the effectiveness, the proposed method has been intensively tested with various dataset acquired under the different frequency and voltage and compared it with conventional methods such as polynominal 2nd equation method, MLP and RBF without considering harmonic components.
Immune networks: multi-tasking capabilities at medium load
International Nuclear Information System (INIS)
Agliari, E; Annibale, A; Barra, A; Coolen, A C C; Tantari, D
2013-01-01
Associative network models featuring multi-tasking properties have been introduced recently and studied in the low-load regime, where the number P of simultaneously retrievable patterns scales with the number N of nodes as P ∼ log N. In addition to their relevance in artificial intelligence, these models are increasingly important in immunology, where stored patterns represent strategies to fight pathogens and nodes represent lymphocyte clones. They allow us to understand the crucial ability of the immune system to respond simultaneously to multiple distinct antigen invasions. Here we develop further the statistical mechanical analysis of such systems, by studying the medium-load regime, P ∼ N δ with δ ∈ (0, 1]. We derive three main results. First, we reveal the nontrivial architecture of these networks: they exhibit a high degree of modularity and clustering, which is linked to their retrieval abilities. Second, by solving the model we demonstrate for δ < 1 the existence of large regions in the phase diagram where the network can retrieve all stored patterns simultaneously. Finally, in the high-load regime δ = 1 we find that the system behaves as a spin-glass, suggesting that finite-connectivity frameworks are required to achieve effective retrieval. (paper)
Deep Neural Network Based Demand Side Short Term Load Forecasting
Directory of Open Access Journals (Sweden)
Seunghyoung Ryu
2016-12-01
Full Text Available In the smart grid, one of the most important research areas is load forecasting; it spans from traditional time series analyses to recent machine learning approaches and mostly focuses on forecasting aggregated electricity consumption. However, the importance of demand side energy management, including individual load forecasting, is becoming critical. In this paper, we propose deep neural network (DNN-based load forecasting models and apply them to a demand side empirical load database. DNNs are trained in two different ways: a pre-training restricted Boltzmann machine and using the rectified linear unit without pre-training. DNN forecasting models are trained by individual customer’s electricity consumption data and regional meteorological elements. To verify the performance of DNNs, forecasting results are compared with a shallow neural network (SNN, a double seasonal Holt–Winters (DSHW model and the autoregressive integrated moving average (ARIMA. The mean absolute percentage error (MAPE and relative root mean square error (RRMSE are used for verification. Our results show that DNNs exhibit accurate and robust predictions compared to other forecasting models, e.g., MAPE and RRMSE are reduced by up to 17% and 22% compared to SNN and 9% and 29% compared to DSHW.
International Nuclear Information System (INIS)
Cai, Yuan; Wang, Jian-zhou; Tang, Yun; Yang, Yu-chen
2011-01-01
This paper presents a neural network based on adaptive resonance theory, named distributed ART (adaptive resonance theory) and HS-ARTMAP (Hyper-spherical ARTMAP network), applied to the electric load forecasting problem. The distributed ART combines the stable fast learning capabilities of winner-take-all ART systems with the noise tolerance and code compression capabilities of multi-layer perceptions. The HS-ARTMAP, a hybrid of an RBF (Radial Basis Function)-network-like module which uses hyper-sphere basis function substitute the Gaussian basis function and an ART-like module, performs incremental learning capabilities in function approximation problem. The HS-ARTMAP only receives the compressed distributed coding processed by distributed ART to deal with the proliferation problem which ARTMAP (adaptive resonance theory map) architecture often encounters and still performs well in electric load forecasting. To demonstrate the performance of the methodology, data from New South Wales and Victoria in Australia are illustrated. Results show that the developed method is much better than the traditional BP and single HS-ARTMAP neural network. -- Research highlights: → The processing of the presented network is based on compressed distributed data. It's an innovation among the adaptive resonance theory architecture. → The presented network decreases the proliferation the Fuzzy ARTMAP architectures usually encounter. → The network on-line forecasts electrical load accurately, stably. → Both one-period and multi-period load forecasting are executed using data of different cities.
LAMAN: Load Adaptable MAC for Ad Hoc Networks
Directory of Open Access Journals (Sweden)
Realp Marc
2005-01-01
Full Text Available In mobile ad hoc radio networks, mechanisms on how to access the radio channel are extremely important in order to improve network efficiency. In this paper, the load adaptable medium access control for ad hoc networks (LAMAN protocol is described. LAMAN is a novel decentralized multipacket MAC protocol designed following a cross-layer approach. Basically, this protocol is a hybrid CDMA-TDMA-based protocol that aims at throughput maximization in multipacket communication environments by efficiently combining contention and conflict-free protocol components. Such combination of components is used to adapt the nodes' access priority to changes on the traffic load while, at the same time, accounting for the multipacket reception (MPR capability of the receivers. A theoretical analysis of the system is developed presenting closed expressions of network throughput and packet delay. By simulations the validity of our analysis is shown and the performances of a LAMAN-based system and an Aloha-CDMA-based one are compared.
Game Theoretic Problems in Network Economics and Mechanism Design Solutions
Narahari, Y; Narayanam, Ramasuri; Prakash, Hastagiri
2009-01-01
Explores game theoretic modeling and mechanism design for problem solving in Internet and network economics. This monograph contains an exposition of representative game theoretic problems in three different network economics situations and a systematic exploration of mechanism design solutions to these problems.
Solving Minimum Cost Multi-Commodity Network Flow Problem ...
African Journals Online (AJOL)
ADOWIE PERE
2018-03-23
Mar 23, 2018 ... network-based modeling framework for integrated fixed and mobile ... Minimum Cost Network Flow Problem (MCNFP) and some ..... Unmanned Aerial Vehicle Routing in Traffic. Incident ... Ph.D. Thesis, Dept. of Surveying &.
Solving Hub Network Problem Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Mursyid Hasan Basri
2012-01-01
Full Text Available This paper addresses a network problem that described as follows. There are n ports that interact, and p of those will be designated as hubs. All hubs are fully interconnected. Each spoke will be allocated to only one of available hubs. Direct connection between two spokes is allowed only if they are allocated to the same hub. The latter is a distinct characteristic that differs it from pure hub-and-spoke system. In case of pure hub-and-spoke system, direct connection between two spokes is not allowed. The problem is where to locate hub ports and to which hub a spoke should be allocated so that total transportation cost is minimum. In the first model, there are some additional aspects are taken into consideration in order to achieve a better representation of the problem. The first, weekly service should be accomplished. Secondly, various vessel types should be considered. The last, a concept of inter-hub discount factor is introduced. Regarding the last aspect, it represents cost reduction factor at hub ports due to economies of scale. In practice, it is common that the cost rate for inter-hub movement is less than the cost rate for movement between hub and origin/destination. In this first model, inter-hub discount factor is assumed independent with amount of flows on inter-hub links (denoted as flow-independent discount policy. The results indicated that the patterns of enlargement of container ship size, to some degree, are similar with those in Kurokawa study. However, with regard to hub locations, the results have not represented the real practice. In the proposed model, unsatisfactory result on hub locations is addressed. One aspect that could possibly be improved to find better hub locations is inter-hub discount factor. Then inter-hub discount factor is assumed to depend on amount of inter-hub flows (denoted as flow-dependent discount policy. There are two discount functions examined in this paper. Both functions are characterized by
Generalized Load Sharing for Homogeneous Networks of Distributed Environment
Directory of Open Access Journals (Sweden)
A. Satheesh
2008-01-01
Full Text Available We propose a method for job migration policies by considering effective usage of global memory in addition to CPU load sharing in distributed systems. When a node is identified for lacking sufficient memory space to serve jobs, one or more jobs of the node will be migrated to remote nodes with low memory allocations. If the memory space is sufficiently large, the jobs will be scheduled by a CPU-based load sharing policy. Following the principle of sharing both CPU and memory resources, we present several load sharing alternatives. Our objective is to reduce the number of page faults caused by unbalanced memory allocations for jobs among distributed nodes, so that overall performance of a distributed system can be significantly improved. We have conducted trace-driven simulations to compare CPU-based load sharing policies with our policies. We show that our load sharing policies not only improve performance of memory bound jobs, but also maintain the same load sharing quality as the CPU-based policies for CPU-bound jobs. Regarding remote execution and preemptive migration strategies, our experiments indicate that a strategy selection in load sharing is dependent on the amount of memory demand of jobs, remote execution is more effective for memory-bound jobs, and preemptive migration is more effective for CPU-bound jobs. Our CPU-memory-based policy using either high performance or high throughput approach and using the remote execution strategy performs the best for both CPU-bound and memory-bound job in homogeneous networks of distributed environment.
Inverse kinematics problem in robotics using neural networks
Choi, Benjamin B.; Lawrence, Charles
1992-01-01
In this paper, Multilayer Feedforward Networks are applied to the robot inverse kinematic problem. The networks are trained with endeffector position and joint angles. After training, performance is measured by having the network generate joint angles for arbitrary endeffector trajectories. A 3-degree-of-freedom (DOF) spatial manipulator is used for the study. It is found that neural networks provide a simple and effective way to both model the manipulator inverse kinematics and circumvent the problems associated with algorithmic solution methods.
Solving unit commitment and economic load dispatch problems ...
African Journals Online (AJOL)
Economic Load Dispatch (ELD) and Unit Commitment (UC) are very important applications to predict the optimized cost of load in a power system. UC determines working states for existing generating units under some operational constraints and then optimizing the operation cost for all running units w.r.t. load demand ...
Ad-hoc Network of Smart Sensors for Mechanical Load Measurement
Directory of Open Access Journals (Sweden)
Manuel A. Vieira
2016-07-01
Full Text Available Strain gauges load cells are transducers devices capable of converting changes in applied mechanical load into an electrical analog signal. Those devices have a large spectrum of applications ranging from domestic to industrial or even medical appliances just to name a few. In this work, they are used in the electronic instrumentation of a force platform that will be used to carry out the analysis and characterization of human biomechanical walking. In this platform, four load cells are installed, each one capable of measuring forces along two different axis. A total of eight strain-gauges per load cell are employed. Hence, analog signal transmission, besides requiring a large number of connection wires, is prone to interference and noise. Moreover, with this solution, scalability requires severe changes in the connection topology. In order to circumvent those problems, an alternative in-situ signal conditioning and digital data transmission system was devised. This approach, as far as investigated, presents an innovative solution to signal conditioning and data transmission for load-cells. In particular, the presented solution allows the creation of an ad-hoc network of load cells, using the I²C protocol with a master interface that allows the users to interact and change the parameters of each load cell. This instrumentation structure has been successfully tested and the obtained results are documented in this article.
Solving network design problems via decomposition, aggregation and approximation
Bärmann, Andreas
2016-01-01
Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Contents Decomposition for Multi-Period Network Design Solving Network Design Problems via Ag...
Enhanced method of fast re-routing with load balancing in software-defined networks
Lemeshko, Oleksandr; Yeremenko, Oleksandra
2017-11-01
A two-level method of fast re-routing with load balancing in a software-defined network (SDN) is proposed. The novelty of the method consists, firstly, in the introduction of a two-level hierarchy of calculating the routing variables responsible for the formation of the primary and backup paths, and secondly, in ensuring a balanced load of the communication links of the network, which meets the requirements of the traffic engineering concept. The method provides implementation of link, node, path, and bandwidth protection schemes for fast re-routing in SDN. The separation in accordance with the interaction prediction principle along two hierarchical levels of the calculation functions of the primary (lower level) and backup (upper level) routes allowed to abandon the initial sufficiently large and nonlinear optimization problem by transiting to the iterative solution of linear optimization problems of half the dimension. The analysis of the proposed method confirmed its efficiency and effectiveness in terms of obtaining optimal solutions for ensuring balanced load of communication links and implementing the required network element protection schemes for fast re-routing in SDN.
Directory of Open Access Journals (Sweden)
HUSSEIN A. ABDULQADER
2012-08-01
Full Text Available Load forecasting is essential part for the power system planning and operation. In this paper the modeling and design of artificial neural network for load forecasting is carried out in a particular region of Oman. Neural network approach helps to reduce the problem associated with conventional method and has the advantage of learning directly from the historical data. The neural network here uses data such as past load; weather information like humidity and temperatures. Once the neural network is trained for the past set of data it can give a prediction of future load. This reduces the capital investment reducing the equipments to be installed. The actual data are taken from the Mazoon Electrical Company, Oman. The data of load for the year 2007, 2008 and 2009 are collected for a particular region called Al Batinah in Oman and trained using neural networks to forecast the future. The main objective is to forecast the amount of electricity needed for better load distribution in the areas of this region in Oman. The load forecasting is done for the year 2010 and is validated for the accuracy.
Detection of broken rotor bar faults in induction motor at low load using neural network.
Bessam, B; Menacer, A; Boumehraz, M; Cherif, H
2016-09-01
The knowledge of the broken rotor bars characteristic frequencies and amplitudes has a great importance for all related diagnostic methods. The monitoring of motor faults requires a high resolution spectrum to separate different frequency components. The Discrete Fourier Transform (DFT) has been widely used to achieve these requirements. However, at low slip this technique cannot give good results. As a solution for these problems, this paper proposes an efficient technique based on a neural network approach and Hilbert transform (HT) for broken rotor bar diagnosis in induction machines at low load. The Hilbert transform is used to extract the stator current envelope (SCE). Two features are selected from the (SCE) spectrum (the amplitude and frequency of the harmonic). These features will be used as input for neural network. The results obtained are astonishing and it is capable to detect the correct number of broken rotor bars under different load conditions. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Daniel Jorge Caetano
2017-12-01
Full Text Available The problem of airline flight network optimization can be split into subproblems such as Schedule Generation (SG and Fleet Assignment (FA, solved in consecutive steps or in an integrated way, usually based on monetary costs and revenue forecasts. A linear programming model to solve SG and FA in an integrated way is presented, but with an alternative approach based on transport momentum and aircraft load factor. This alternative approach relies on demand forecast and allows obtaining solutions considering minimum average load factors. Results of the proposed model applications to instances of a regional Brazilian airline are presented. The comparison of the schedules generated by the proposed approach against those obtained by applying a model based on monetary costs and revenue forecasts demonstrates the validity of this alternative approach for airlines network planning.
PRIVACY PROTECTION PROBLEMS IN SOCIAL NETWORKS
OKUR, M. Cudi
2011-01-01
Protecting privacy has become a major concern for most social network users because of increased difficulties of controlling the online data. This article presents an assessment of the common privacy related risks of social networking sites. Open and hidden privacy risks of active and passive online profiles are examined and increasing share of social networking in these phenomena is discussed. Inadequacy of available legal and institutional protection is demonstrated and the effectiveness of...
Short-term load and wind power forecasting using neural network-based prediction intervals.
Quan, Hao; Srinivasan, Dipti; Khosravi, Abbas
2014-02-01
Electrical power systems are evolving from today's centralized bulk systems to more decentralized systems. Penetrations of renewable energies, such as wind and solar power, significantly increase the level of uncertainty in power systems. Accurate load forecasting becomes more complex, yet more important for management of power systems. Traditional methods for generating point forecasts of load demands cannot properly handle uncertainties in system operations. To quantify potential uncertainties associated with forecasts, this paper implements a neural network (NN)-based method for the construction of prediction intervals (PIs). A newly introduced method, called lower upper bound estimation (LUBE), is applied and extended to develop PIs using NN models. A new problem formulation is proposed, which translates the primary multiobjective problem into a constrained single-objective problem. Compared with the cost function, this new formulation is closer to the primary problem and has fewer parameters. Particle swarm optimization (PSO) integrated with the mutation operator is used to solve the problem. Electrical demands from Singapore and New South Wales (Australia), as well as wind power generation from Capital Wind Farm, are used to validate the PSO-based LUBE method. Comparative results show that the proposed method can construct higher quality PIs for load and wind power generation forecasts in a short time.
On the Update Problems for Software Defined Networks
Directory of Open Access Journals (Sweden)
V. A. Zakharov
2014-01-01
Full Text Available The designing of network update algorithms is urgent for the development of SDN control software. A particular case of Network Update Problem is that of restoring seamlessly a given network configuration after some packet forwarding rules have been disabled (say, at the expiry of their time-outs. We study this problem in the framework of a formal model of SDN, develop correct and safe network recovering algorithms, and show that in general case there is no way to restore network configuration seamlessly without referring to priorities of packet forwarding rules.
Secure Wireless Sensor Networks: Problems and Solutions
Directory of Open Access Journals (Sweden)
Fei Hu
2003-08-01
Full Text Available As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. This paper analyzes security challenges in wireless sensor networks and summarizes key issues that should be solved for achieving the ad hoc security. It gives an overview of the current state of solutions on such key issues as secure routing, prevention of denial-of-service and key management service. We also present some secure methods to achieve security in wireless sensor networks. Finally we present our integrated approach to securing sensor networks.
A matheuristic for the liner shipping network design problem
DEFF Research Database (Denmark)
Brouer, Berit Dangaard; Desaulniers, Guy
2012-01-01
for revenue and transshipment of cargo along with in/decrease of vessel- and operational cost for the current solution. The evaluation functions may be used by heuristics in general to evaluate changes to a network design without solving a large scale multicommodity flow problem.......We present a matheuristic, an integer programming based heuristic, for the Liner Shipping Network Design Problem. The heuristic applies a greedy construction heuristic based on an interpretation of the liner shipping network design problem as a multiple quadratic knapsack problem. The construction...
Network Monitoring as a Streaming Analytics Problem
Gupta, Arpit
2016-11-02
Programmable switches make it easier to perform flexible network monitoring queries at line rate, and scalable stream processors make it possible to fuse data streams to answer more sophisticated queries about the network in real-time. Unfortunately, processing such network monitoring queries at high traffic rates requires both the switches and the stream processors to filter the traffic iteratively and adaptively so as to extract only that traffic that is of interest to the query at hand. Others have network monitoring in the context of streaming; yet, previous work has not closed the loop in a way that allows network operators to perform streaming analytics for network monitoring applications at scale. To achieve this objective, Sonata allows operators to express a network monitoring query by considering each packet as a tuple and efficiently partitioning each query between the switches and the stream processor through iterative refinement. Sonata extracts only the traffic that pertains to each query, ensuring that the stream processor can scale traffic rates of several terabits per second. We show with a simple example query involving DNS reflection attacks and traffic traces from one of the world\\'s largest IXPs that Sonata can capture 95% of all traffic pertaining to the query, while reducing the overall data rate by a factor of about 400 and the number of required counters by four orders of magnitude. Copyright 2016 ACM.
Directory of Open Access Journals (Sweden)
Beibei Wang
2017-01-01
Full Text Available There are many uncertain factors in the modern distribution network, including the access of renewable energy sources and the heavy load level. The existence of these factors has brought challenges to the stability of the power distribution network, as well as increasing the risk of exceeding transmission capacity of distribution lines. The appearance of flexible load control technology provides a new idea to solve the above problems. Air conditioners (ACs account for a great proportion of all loads. In this paper, the model of dispatching AC loads in the regional power grid is constructed, and the direct load control (DLC method is adopted to reduce the load of ACs. An improved tabu search technique is proposed to solve the problem of network dispatch in distribution systems in order to reduce the resistive line losses and to eliminate the transmission congestion in lines under normal operating conditions. The optimal node solution is obtained to find the best location and reduction capacity of ACs for load control. To demonstrate the validity and effectiveness of the proposed method, a test system is studied. The numerical results are also given in this article, which reveal that the proposed method is promising.
International Nuclear Information System (INIS)
Prisecaru, Ilie; Panait; Adrian; Serban, Viorel; Ciocan, George; Androne, Marian; Florea, Ioana; State, Elena
2004-01-01
Full text: To avoid some drawbacks in the classical supports employed currently in networks of pipes it was conceived, designed, built and experimentally tested a new type of constant load supports which attenuate largely the shocks and vibrations for networks of pipes subjected to large thermal dilatation. These supports are particularly needed for solving the severe problems of the vibrations in networks of pipes in thermoelectric stations, nuclear power plants, or heavy water production plants. These supports allow building networks of new types, more reliable and of lower cost. The new type of support was developed on the basis of a number of patents protected by OSIM. It has a simple structure, ensures a secure functioning without blocking or other kinds of failures and is resistant to a very large variety of stresses. The new type of support of constant load avoids the drawbacks in classical supports i.e. the stress/deformation diagram is practically independent of stress level. The characteristic of the support is geometrically non-linear and presents a plateau with a small slope over a rather large deformation range which results from a serially mounted structure of sandwiches the deformation of which is controlled by a system of deforming central and peripheral pieces. The new supports of constant load, called SERB-PIPE, present a controlled elasticity and a high degree of damping as the package of elastic blades (the sandwich structure) is made of two sub-packages with relative movements what ensure the attenuation of the shocks and vibrations produced by the fluid flow within the pipes and or by seismic motions. By contrast with classical supports, the new supports have a simple structure and a high reliability. Breakdown under stress leading to severe changes in the stress distribution in pipe networks, which could generate overloads in pipes and over-loading in other supports, cannot occur. One can also mention that these supports can be built in a
USING ARTIFICIAL NEURAL NETWORKS (ANNs FOR SEDIMENT LOAD FORECASTING OF TALKHEROOD RIVER MOUTH
Directory of Open Access Journals (Sweden)
Vahid Nourani
2009-01-01
Full Text Available Without a doubt the carried sediment load by a river is the most important factor in creating and formation of the related Delta in the river mouth. Therefore, accurate forecasting of the river sediment load can play a significant role for study on the river Delta. However considering the complexity and non-linearity of the phenomenon, the classic experimental or physical-based approaches usually could not handle the problem so well. In this paper, Artificial Neural Network (ANN as a non-linear black box interpolator tool is used for modeling suspended sediment load which discharges to the Talkherood river mouth, located in northern west Iran. For this purpose, observed time series of water discharge at current and previous time steps are used as the model input neurons and the model output neuron will be the forecasted sediment load at the current time step. In this way, various schemes of the ANN approach are examined in order to achieve the best network as well as the best architecture of the model. The obtained results are also compared with the results of two other classic methods (i.e., linear regression and rating curve methods in order to approve the efficiency and ability of the proposed method.
International Nuclear Information System (INIS)
Bradford, R.A.W.; Ure, J.; Chen, H.F.
2014-01-01
The ratchet boundaries and ratchet strains are derived for the Bree problem and an elastic-perfectly plastic material with different yield stresses on-load and off-load. The Bree problem consists of a constant uniaxial primary membrane stress and a cycling thermal bending stress. The ratchet problem with differing yield stresses is also solved for a modified loading in which both the primary membrane and thermal bending stresses cycle in-phase. The analytic solutions for the ratchet boundaries are compared with the results of deploying the linear matching method (LMM) and excellent agreement is found. Whilst these results are of potential utility for purely elastic–plastic behaviour, since yield stresses will often differ at the two ends of the cycle, the solution is also proposed as a means of assessing creep ratcheting via a creep ductility exhaustion approach. -- Highlights: • The Bree problem is solved for differing yield stresses on and off load. • The modified Bree problem with cycling primary load is also solved. • These solutions can be applied to creep ratcheting using a pseudo-yield stress
Lin, John Jr-Hung; Lin, Sunny S. J.
2014-01-01
The present study investigated (a) whether the perceived cognitive load was different when geometry problems with various levels of configuration comprehension were solved and (b) whether eye movements in comprehending geometry problems showed sources of cognitive loads. In the first investigation, three characteristics of geometry configurations…
Problem solving for wireless sensor networks
Garcia-Hernando, Ana-Belen; Lopez-Navarro, Juan-Manuel; Prayati, Aggeliki; Redondo-Lopez, Luis
2008-01-01
Wireless Sensor Networks (WSN) is an area of huge research interest, attracting substantial attention from industry and academia for its enormous potential and its inherent challenges. This reader-friendly text delivers a comprehensive review of the developments related to the important technological issues in WSN.
Network Monitoring as a Streaming Analytics Problem
Gupta, Arpit; Birkner, Rü diger; Canini, Marco; Feamster, Nick; Mac-Stoker, Chris; Willinger, Walter
2016-01-01
, processing such network monitoring queries at high traffic rates requires both the switches and the stream processors to filter the traffic iteratively and adaptively so as to extract only that traffic that is of interest to the query at hand. Others have
Bidding for surplus in network allocation problems
Slikker, M.
2007-01-01
In this paper we study non-cooperative foundations of network allocation rules. We focus on three allocation rules: the Myerson value, the position value and the component-wise egalitarian solution. For any of these three rules we provide a characterization based on component efficiency and some
Aggregated Residential Load Modeling Using Dynamic Bayesian Networks
Energy Technology Data Exchange (ETDEWEB)
Vlachopoulou, Maria; Chin, George; Fuller, Jason C.; Lu, Shuai
2014-09-28
Abstract—It is already obvious that the future power grid will have to address higher demand for power and energy, and to incorporate renewable resources of different energy generation patterns. Demand response (DR) schemes could successfully be used to manage and balance power supply and demand under operating conditions of the future power grid. To achieve that, more advanced tools for DR management of operations and planning are necessary that can estimate the available capacity from DR resources. In this research, a Dynamic Bayesian Network (DBN) is derived, trained, and tested that can model aggregated load of Heating, Ventilation, and Air Conditioning (HVAC) systems. DBNs can provide flexible and powerful tools for both operations and planing, due to their unique analytical capabilities. The DBN model accuracy and flexibility of use is demonstrated by testing the model under different operational scenarios.
Computable majorants of the limit load in Hencky's plasticity problems
Czech Academy of Sciences Publication Activity Database
Repin, S.; Sysala, Stanislav; Haslinger, Jaroslav
2018-01-01
Roč. 75, č. 1 (2018), s. 199-217 ISSN 0898-1221 R&D Projects: GA MŠk LQ1602 Institutional support: RVO:68145535 Keywords : computable bounds * divergence free fields * Hencky's plasticity * limit load * penalization Subject RIV: BA - General Mathematics Impact factor: 1.531, year: 2016 http://www.sciencedirect.com/science/article/pii/S0898122117305552
Solving Constraint Satisfaction Problems with Networks of Spiking Neurons.
Jonke, Zeno; Habenschuss, Stefan; Maass, Wolfgang
2016-01-01
Network of neurons in the brain apply-unlike processors in our current generation of computer hardware-an event-based processing strategy, where short pulses (spikes) are emitted sparsely by neurons to signal the occurrence of an event at a particular point in time. Such spike-based computations promise to be substantially more power-efficient than traditional clocked processing schemes. However, it turns out to be surprisingly difficult to design networks of spiking neurons that can solve difficult computational problems on the level of single spikes, rather than rates of spikes. We present here a new method for designing networks of spiking neurons via an energy function. Furthermore, we show how the energy function of a network of stochastically firing neurons can be shaped in a transparent manner by composing the networks of simple stereotypical network motifs. We show that this design approach enables networks of spiking neurons to produce approximate solutions to difficult (NP-hard) constraint satisfaction problems from the domains of planning/optimization and verification/logical inference. The resulting networks employ noise as a computational resource. Nevertheless, the timing of spikes plays an essential role in their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines) and Gibbs sampling.
A finite element method for flow problems in blast loading
International Nuclear Information System (INIS)
Forestier, A.; Lepareux, M.
1984-06-01
This paper presents a numerical method which describes fast dynamic problems in flow transient situations as in nuclear plants. A finite element formulation has been chosen; it is described by a preprocessor in CASTEM system: GIBI code. For these typical flow problems, an A.L.E. formulation for physical equations is used. So, some applications are presented: the well known problem of shock tube, the same one in 2D case and a last application to hydrogen detonation
Network capacity auctions: promise and problems
International Nuclear Information System (INIS)
Newbery, David M.
2003-01-01
Well-designed auctions work favorably for allocating idiosyncratic properties efficiently. Auctions are used to allocate entry capacity for United Kingdom gas and inter-connector capacity for electricity in several European Union countries and can work well for allocating existing capacity, though careful auction design is needed to mitigate potential market power. Using auction prices to guide investment decisions in networks is problematic if bidders fear that sub-optimal investment will be compensated by regulatory fiat, lowering future capacity values. (Author)
SOCIAL NETWORK OPTIMIZATION A NEW METHAHEURISTIC FOR GENERAL OPTIMIZATION PROBLEMS
Directory of Open Access Journals (Sweden)
Hassan Sherafat
2017-12-01
Full Text Available In the recent years metaheuristics were studied and developed as powerful technics for hard optimization problems. Some of well-known technics in this field are: Genetic Algorithms, Tabu Search, Simulated Annealing, Ant Colony Optimization, and Swarm Intelligence, which are applied successfully to many complex optimization problems. In this paper, we introduce a new metaheuristic for solving such problems based on social networks concept, named as Social Network Optimization – SNO. We show that a wide range of np-hard optimization problems may be solved by SNO.
Computable majorants of the limit load in Hencky's plasticity problems
Czech Academy of Sciences Publication Activity Database
Repin, S.; Sysala, Stanislav; Haslinger, Jaroslav
2018-01-01
Roč. 75, č. 1 (2018), s. 199-217 ISSN 0898-1221 R&D Projects: GA MŠk LQ1602 Institutional support: RVO:68145535 Keywords : computable bounds * divergence free fields * Hencky's plasticity * limit load * penalization Subject RIV: BA - General Mathematics Impact factor: 1.531, year: 2016 http://www. science direct.com/ science /article/pii/S0898122117305552
Controlled neural network application in track-match problem
International Nuclear Information System (INIS)
Baginyan, S.A.; Ososkov, G.A.
1993-01-01
Track-match problem of high energy physics (HEP) data handling is formulated in terms of incidence matrices. The corresponding Hopfield neural network is developed to solve this type of constraint satisfaction problems (CSP). A special concept of the controlled neural network is proposed as a basis of an algorithm for the effective CSP solution. Results of comparable calculations show the very high performance of this algorithm against conventional search procedures. 8 refs.; 1 fig.; 1 tab
Cellular neural networks for the stereo matching problem
International Nuclear Information System (INIS)
Taraglio, S.; Zanela, A.
1997-03-01
The applicability of the Cellular Neural Network (CNN) paradigm to the problem of recovering information on the tridimensional structure of the environment is investigated. The approach proposed is the stereo matching of video images. The starting point of this work is the Zhou-Chellappa neural network implementation for the same problem. The CNN based system we present here yields the same results as the previous approach, but without the many existing drawbacks
Problems in the Deployment of Learning Networks In Small Organizations
Shankle, Dean E.; Shankle, Jeremy P.
2006-01-01
Please, cite this publication as: Shankle, D.E., & Shankle, J.P. (2006). Problems in the Deployment of Learning Networks In Small Organizations. Proceedings of International Workshop in Learning Networks for Lifelong Competence Development, TENCompetence Conference. March 30th-31st, Sofia, Bulgaria:
Solving constraint satisfaction problems with networks of spiking neurons
Directory of Open Access Journals (Sweden)
Zeno eJonke
2016-03-01
Full Text Available Network of neurons in the brain apply – unlike processors in our current generation ofcomputer hardware – an event-based processing strategy, where short pulses (spikes areemitted sparsely by neurons to signal the occurrence of an event at a particular point intime. Such spike-based computations promise to be substantially more power-efficient thantraditional clocked processing schemes. However it turned out to be surprisingly difficult todesign networks of spiking neurons that can solve difficult computational problems on the levelof single spikes (rather than rates of spikes. We present here a new method for designingnetworks of spiking neurons via an energy function. Furthermore we show how the energyfunction of a network of stochastically firing neurons can be shaped in a quite transparentmanner by composing the networks of simple stereotypical network motifs. We show that thisdesign approach enables networks of spiking neurons to produce approximate solutions todifficult (NP-hard constraint satisfaction problems from the domains of planning/optimizationand verification/logical inference. The resulting networks employ noise as a computationalresource. Nevertheless the timing of spikes (rather than just spike rates plays an essential rolein their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines and Gibbs sampling.
Algorithms for Scheduling and Network Problems
1991-09-01
time. We already know, by Lemma 2.2.1, that WOPT = O(log( mpU )), so if we could solve this integer program optimally we would be done. However, the...Folydirat, 15:177-191, 1982. [6] I.S. Belov and Ya. N. Stolin. An algorithm in a single path operations scheduling problem. In Mathematical Economics and
Analysing Stagecoach Network Problem Using Dynamic ...
African Journals Online (AJOL)
In this paper we present a recursive dynamic programming algorithm for solving the stagecoach problem. The algorithm is computationally more efficient than the first method as it obtains its minimum total cost using the suboptimal policies of the different stages without computing the cost of all the routes. By the dynamic ...
A neural network approach to the orienteering problem
Energy Technology Data Exchange (ETDEWEB)
Golden, B.; Wang, Q.; Sun, X.; Jia, J.
1994-12-31
In the orienteering problem, we are given a transportation network in which a start point and an end point are specified. Other points have associated scores. Given a fixed amount of time, the goal is to determine a path from start to end through a subset of locations in order to maximize the total path score. This problem has received a considerable amount of attention in the last ten years. The TSP is a variant of the orienteering problem. This paper applies a modified, continuous Hopfield neural network to attack this NP-hard optimization problem. In it, we design an effective energy function and learning algorithm. Unlike some applications of neural networks to optimization problems, this approach is shown to perform quite well.
Load forecasting method considering temperature effect for distribution network
Directory of Open Access Journals (Sweden)
Meng Xiao Fang
2016-01-01
Full Text Available To improve the accuracy of load forecasting, the temperature factor was introduced into the load forecasting in this paper. This paper analyzed the characteristics of power load variation, and researched the rule of the load with the temperature change. Based on the linear regression analysis, the mathematical model of load forecasting was presented with considering the temperature effect, and the steps of load forecasting were given. Used MATLAB, the temperature regression coefficient was calculated. Using the load forecasting model, the full-day load forecasting and time-sharing load forecasting were carried out. By comparing and analyzing the forecast error, the results showed that the error of time-sharing load forecasting method was small in this paper. The forecasting method is an effective method to improve the accuracy of load forecasting.
International Nuclear Information System (INIS)
Hanif, A.; Choudhry, M.A.
2013-01-01
This research work presents a feed forward power flow control strategy in the secondary distribution network working in parallel with a DC type distributed energy resource (DER) unit with SPWM-IGBT Voltage Source Converter (VSC). The developed control strategy enables the VSC to be used as power flow controller at the load bus in the presence of utility supply. Due to the investigated control strategy, power flow control from distributed energy resource (DER) to common load bus is such that power flows to the load without facing any power quality problem. The technique has an added advantage of controlling power flow without having a dedicated power flow controller. The SPWM-IGBT VSC is serving the purpose of dc-ac converter as well as power flow controller. Simulations for a test system using proposed power flow control strategy are carried out using SimPower Systems toolbox of MATLAB at the rate and Simulink at the rate. The results show that a reliable, effective and efficient operation of DC type DER unit in coordination with main utility network can be achieved. (author)
Impact of the traffic load on performance of an alternative LTE railway communication network
DEFF Research Database (Denmark)
Sniady, Aleksander; Soler, José
2013-01-01
communication infrastructure supporting railway signaling. This work is based on OPNET realistic network simulations, which show the relation between the traffic load (the number of trains transmitting and receiving data in an LTE cell) and the delay performance of the European Train Control System (ETCS......Although many countries only now begin to invest in deployment of GSM-Railways (GSM-R) networks, this technology is already obsolete and reveals its significant shortcomings. The most troublesome one is the insufficient number of communication channels offered by GSM-R. This is a major problem...... obstructing railway operations at big train stations and junctions. Hence, other technologies, such as Long Term Evolution (LTE), need to be considered as an alternative to GSM-R. The goal of this paper is to demonstrate the capacity increase that railways can expect, from the introduction of LTE as internal...
Probability problems in seismic risk analysis and load combinations for nuclear power plants
International Nuclear Information System (INIS)
George, L.L.
1983-01-01
This workshop describes some probability problems in power plant reliability and maintenance analysis. The problems are seismic risk analysis, loss of load probability, load combinations, and load sharing. The seismic risk problem is to compute power plant reliability given an earthquake and the resulting risk. Component survival occurs if its peak random response to the earthquake does not exceed its strength. Power plant survival is a complicated Boolean function of component failures and survivals. The responses and strengths of components are dependent random processes, and the peak responses are maxima of random processes. The resulting risk is the expected cost of power plant failure
A New Neural Network Approach to Short Term Load Forecasting of Electrical Power Systems
Directory of Open Access Journals (Sweden)
Farshid Keynia
2011-03-01
Full Text Available Short-term load forecast (STLF is an important operational function in both regulated power systems and deregulated open electricity markets. However, STLF is not easy to handle due to the nonlinear and random-like behaviors of system loads, weather conditions, and social and economic environment variations. Despite the research work performed in the area, more accurate and robust STLF methods are still needed due to the importance and complexity of STLF. In this paper, a new neural network approach for STLF is proposed. The proposed neural network has a novel learning algorithm based on a new modified harmony search technique. This learning algorithm can widely search the solution space in various directions, and it can also avoid the overfitting problem, trapping in local minima and dead bands. Based on this learning algorithm, the suggested neural network can efficiently extract the input/output mapping function of the forecast process leading to high STLF accuracy. The proposed approach is tested on two practical power systems and the results obtained are compared with the results of several other recently published STLF methods. These comparisons confirm the validity of the developed approach.
An aggregated approach to harmonic modelling of loads in power distribution networks
Energy Technology Data Exchange (ETDEWEB)
Moellerstedt, E.
1998-06-01
The use of power electronics have given possibilities for more sophisticated control of power networks. This creates new demands on power network modelling. The models must not only allow for efficient and accurate simulation, but also be suitable for analysis and control design. The Harmonic Norton Equivalent presented in this thesis addresses two problems that are central in control theory, namely model reduction and system identification. It is essential to have simple representations of large systems, and there must be a way to obtain these simple models experimentally, as detailed modelling most often is too complicated. The Harmonic Norton Equivalent has its roots in the method of harmonic balance. It is a frequency domain description of loads in electric networks and describes a linear relation between the current spectrum and the voltage spectrum. The linearization implies that aggregation of loads for model reduction is a straightforward, non-iterative procedure. The models can be obtained through analytical calculations, measurements or time domain simulations. A procedure for experimental estimation of model parameters is presented. The procedure is used to estimate the parameters of a dimmer model from measurements on a real dimmer. The obtained model shows a very good agreement with validation data 24 refs, 24 figs
How Can One Learn Mathematical Word Problems in a Second Language? A Cognitive Load Perspective
Moussa-Inaty, Jase; Causapin, Mark; Groombridge, Timothy
2015-01-01
Language may ordinarily account for difficulties in solving word problems and this is particularly true if mathematical word problems are taught in a language other than one's native language. Research into cognitive load may offer a clear theoretical framework when investigating word problems because memory, specifically working memory, plays a…
An Advanced Tabu Search Approach to the Airlift Loading Problem
2006-12-01
Problem Statement................................................................ 37 3.1.1 SALP -TS Inputs...41 3.2.1 SALP -TS Data Structures .......................................................... 41 3.2.2 SALP -TS Solution...3.2.4 SALP Lower Bound ................................................................... 46 3.2.5 Initial Solution Generator
Energy Technology Data Exchange (ETDEWEB)
Ziver, A.K. E-mail: a.k.ziver@imperial.ac.uk; Pain, C.C; Carter, J.N.; Oliveira, C.R.E. de; Goddard, A.J.H.; Overton, R.S
2004-03-01
A non-generational genetic algorithm (GA) has been developed for fuel management optimisation of Advanced Gas-Cooled Reactors, which are operated by British Energy and produce around 20% of the UK's electricity requirements. An evolutionary search is coded using the genetic operators; namely selection by tournament, two-point crossover, mutation and random assessment of population for multi-cycle loading pattern (LP) optimisation. A detailed description of the chromosomes in the genetic algorithm coded is presented. Artificial Neural Networks (ANNs) have been constructed and trained to accelerate the GA-based search during the optimisation process. The whole package, called GAOPT, is linked to the reactor analysis code PANTHER, which performs fresh fuel loading, burn-up and power shaping calculations for each reactor cycle by imposing station-specific safety and operational constraints. GAOPT has been verified by performing a number of tests, which are applied to the Hinkley Point B and Hartlepool reactors. The test results giving loading pattern (LP) scenarios obtained from single and multi-cycle optimisation calculations applied to realistic reactor states of the Hartlepool and Hinkley Point B reactors are discussed. The results have shown that the GA/ANN algorithms developed can help the fuel engineer to optimise loading patterns in an efficient and more profitable way than currently available for multi-cycle refuelling of AGRs. Research leading to parallel GAs applied to LP optimisation are outlined, which can be adapted to present day LWR fuel management problems.
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
Energy Technology Data Exchange (ETDEWEB)
Kim, M; Leskovec, J
2011-11-14
Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.
An Algorithm for the Mixed Transportation Network Design Problem.
Liu, Xinyu; Chen, Qun
2016-01-01
This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA), for solving a mixed transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of the existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. The idea of the proposed solution algorithm (DDIA) is to reduce the dimensions of the problem. A group of variables (discrete/continuous) is fixed to optimize another group of variables (continuous/discrete) alternately; then, the problem is transformed into solving a series of CNDPs (continuous network design problems) and DNDPs (discrete network design problems) repeatedly until the problem converges to the optimal solution. The advantage of the proposed algorithm is that its solution process is very simple and easy to apply. Numerical examples show that for the MNDP without budget constraint, the optimal solution can be found within a few iterations with DDIA. For the MNDP with budget constraint, however, the result depends on the selection of initial values, which leads to different optimal solutions (i.e., different local optimal solutions). Some thoughts are given on how to derive meaningful initial values, such as by considering the budgets of new and reconstruction projects separately.
An Algorithm for the Mixed Transportation Network Design Problem.
Directory of Open Access Journals (Sweden)
Xinyu Liu
Full Text Available This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA, for solving a mixed transportation network design problem (MNDP, which is generally expressed as a mathematical programming with equilibrium constraint (MPEC. The upper level of the MNDP aims to optimize the network performance via both the expansion of the existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE problem. The idea of the proposed solution algorithm (DDIA is to reduce the dimensions of the problem. A group of variables (discrete/continuous is fixed to optimize another group of variables (continuous/discrete alternately; then, the problem is transformed into solving a series of CNDPs (continuous network design problems and DNDPs (discrete network design problems repeatedly until the problem converges to the optimal solution. The advantage of the proposed algorithm is that its solution process is very simple and easy to apply. Numerical examples show that for the MNDP without budget constraint, the optimal solution can be found within a few iterations with DDIA. For the MNDP with budget constraint, however, the result depends on the selection of initial values, which leads to different optimal solutions (i.e., different local optimal solutions. Some thoughts are given on how to derive meaningful initial values, such as by considering the budgets of new and reconstruction projects separately.
Heuristic for solving capacitor allocation problems in electric energy radial distribution networks
Directory of Open Access Journals (Sweden)
Maria A. Biagio
2012-04-01
Full Text Available The goal of the capacitor allocation problem in radial distribution networks is to minimize technical losses with consequential positive impacts on economic and environmental areas. The main objective is to define the size and location of the capacitors while considering load variations in a given horizon. The mathematical formulation for this planning problem is given by an integer nonlinear mathematical programming model that demands great computational effort to be solved. With the goal of solving this problem, this paper proposes a methodology that is composed of heuristics and Tabu Search procedures. The methodology presented explores network system characteristics of the network system reactive loads for identifying regions where procedures of local and intensive searches should be performed. A description of the proposed methodology and an analysis of computational results obtained which are based on several test systems including actual systems are presented. The solutions reached are as good as or better than those indicated by well referenced methodologies. The technique proposed is simple in its use and does not require calibrating an excessive amount of parameters, making it an attractive alternative for companies involved in the planning of radial distribution networks.
Green IGP Link Weights for Energy-efficiency and Load-balancing in IP Backbone Networks
Francois, Frederic; Wang, Ning; Moessner, Klaus; Georgoulas, Stylianos; Xu, Ke
2013-01-01
The energy consumption of backbone networks has become a primary concern for network operators and regulators due to the pervasive deployment of wired backbone networks to meet the requirements of bandwidth-hungry applications. While traditional optimization of IGP link weights has been used in IP based load-balancing operations, in this paper we introduce a novel link weight setting algorithm, the Green Load-balancing Algorithm (GLA), which is able to jointly optimize both energy efficiency ...
A matheuristic for the liner shipping network design problem
DEFF Research Database (Denmark)
Brouer, Berit Dangaard; Desaulniers, Guy; Pisinger, David
We present a matheuristic, an integer programming based heuristic, for the liner shipping network design problem. This problem consists of finding a set of container shipping routes defining a capacitated network for cargo transport. The objective is to maximize the revenue of cargo transport...... the available fleet of container vessels. The cargo transports make extensive use of transshipments between routes and the number of transshipments of the cargo flow is decisive for network profitability. Computational results are reported for the benchmark suite LINER-LIB 2012 following the industry standard...... of weekly departures on every schedule. The heuristic shows overall good performance and is able to find high quality solutions within competitive execution times. The matheuristic can also be applied as a decision support tool to improve an existing network by optimizing on a designated subset...
Neural network for solving convex quadratic bilevel programming problems.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie
2014-03-01
In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.
Social networking sites: an adjunctive treatment modality for psychological problems.
Menon, Indu S; Sharma, Manoj Kumar; Chandra, Prabha S; Thennarasu, K
2014-07-01
Social networking is seen as a way to enhance social support and feeling of well-being. The present work explores the potentials of social networking sites as an adjunctive treatment modality for initiating treatment contact as well as for managing psychological problems. Interview schedule, Facebook intensity questionnaire were administered on 28 subjects with a combination of 18 males and 10 females. They were taken from the in-patient and out-patient psychiatry setting of the hospital. Facebook was the most popular sites and used to seek emotional support on the basis of the frequent updates of emotional content that users put in their profile; reconciliations, escape from the problems or to manage the loneliness; getting information about illness and its treatment and interaction with experts and also manifested as problematic use. It has implications for developing social networking based adjunctive treatment modality for psychological problems.
Energy Technology Data Exchange (ETDEWEB)
Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhou, Xinyang [University of Colorado; Liu, Zhiyuan [University of Colorado; Chen, Lijun [University of Colorado
2017-10-03
This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together with pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.
Observation and inverse problems in coupled cell networks
International Nuclear Information System (INIS)
Joly, Romain
2012-01-01
A coupled cell network is a model for many situations such as food webs in ecosystems, cellular metabolism and economic networks. It consists in a directed graph G, each node (or cell) representing an agent of the network and each directed arrow representing which agent acts on which. It yields a system of differential equations .x(t)=f(x(t)), where the component i of f depends only on the cells x j (t) for which the arrow j → i exists in G. In this paper, we investigate the observation problems in coupled cell networks: can one deduce the behaviour of the whole network (oscillations, stabilization, etc) by observing only one of the cells? We show that the natural observation properties hold for almost all the interactions f
Relevance of plastic limit loads to reference stress approach for surface cracked cylinder problems
International Nuclear Information System (INIS)
Kim, Yun-Jae; Shim, Do-Jun
2005-01-01
To investigate the relevance of the definition of the reference stress to estimate J and C* for surface crack problems, this paper compares finite element (FE) J and C* results for surface cracked pipes with those estimated according to the reference stress approach using various definitions of the reference stress. Pipes with part circumferential inner surface cracks and finite internal axial cracks are considered, subject to internal pressure and global bending. The crack depth and aspect ratio are systematically varied. The reference stress is defined in four different ways using (i) a local limit load (ii), a global limit load, (iii) a global limit load determined from the FE limit analysis, and (iv) the optimised reference load. It is found that the reference stress based on a local limit load gives overall excessively conservative estimates of J and C*. Use of a global limit load clearly reduces the conservatism, compared to that of a local limit load, although it can sometimes provide non-conservative estimates of J and C*. The use of the FE global limit load gives overall non-conservative estimates of J and C*. The reference stress based on the optimised reference load gives overall accurate estimates of J and C*, compared to other definitions of the reference stress. Based on the present findings, general guidance on the choice of the reference stress for surface crack problems is given
A review on application of neural networks and fuzzy logic to solve hydrothermal scheduling problem
International Nuclear Information System (INIS)
Haroon, S.; Malik, T.N.; Zafar, S.
2014-01-01
Electrical power system is highly complicated having hydro and thermal mix with large number of machines. To reduce power production cost, hydro and thermal resources are mixed. Hydrothermal scheduling is the optimal coordination of hydro and thermal plants to meet the system load demand at minimum possible operational cost while satisfying the system constraints. Hydrothermal scheduling is dynamic, large scale, non-linear and non-convex optimization problem. The classical techniques have failed in solving such problem. Artificial Intelligence Tools based techniques are used now a day to solve this complex optimization problem because of their no requirements on the nature of the problem. The aim of this research paper is to provide a comprehensive survey of literature related to both Artificial Neural Network (ANN) and Fuzzy Logic (FL) as effective optimization algorithms for the hydrothermal scheduling problem. The outcomes along with the merits and demerits of individual techniques are also discussed. (author)
International Nuclear Information System (INIS)
Kul'chin, Yurii N; Kolchinskiy, V A; Kamenev, O T; Petrov, Yu S
2013-01-01
A new design of a sensitive element for a fibre optical sensor of deformation loads is proposed. A distributed fibre optical measuring network, aimed at determining both the load application point and the load mass, has been developed based on these elements. It is shown that neural network methods of data processing make it possible to combine quasi-distributed amplitude sensors of different types into a unified network. The results of the experimental study of a breadboard of a fibre optical measuring network are reported, which demonstrate successful reconstruction of the trajectory of a moving object (load) with a spatial resolution of 8 cm, as well as the load mass in the range of 1 – 10 kg with a sensitivity of 0.043 kg -1 . (laser optics 2012)
Pricing and Capacity Planning Problems in Energy Transmission Networks
DEFF Research Database (Denmark)
Villumsen, Jonas Christoffer
strategy. In the Nordic electricity system a market with zonal prices is adopted. We consider the problem of designing zones in an optimal way explicitly considering uncertainty. Finally, we formulate the integrated problem of pipeline capacity expansion planning and transmission pricing in natural gas...... necessitates a radical change in the way we plan and operate energy systems. Another paradigm change which began in the 1990’s for electricity systems is that of deregulation. This has led to a variety of different market structures implemented across the world. In this thesis we discuss capacity planning...... and transmission pricing problems in energy transmission networks. Although the modelling framework applies to energy networks in general, most of the applications discussed concern the transmission of electricity. A number of the problems presented involves transmission switching, which allows the operator...
An outer approximation method for the road network design problem.
Asadi Bagloee, Saeed; Sarvi, Majid
2018-01-01
Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.
Cascading failures with local load redistribution in interdependent Watts-Strogatz networks
Hong, Chen; Zhang, Jun; Du, Wen-Bo; Sallan, Jose Maria; Lordan, Oriol
2016-05-01
Cascading failures of loads in isolated networks have been studied extensively over the last decade. Since 2010, such research has extended to interdependent networks. In this paper, we study cascading failures with local load redistribution in interdependent Watts-Strogatz (WS) networks. The effects of rewiring probability and coupling strength on the resilience of interdependent WS networks have been extensively investigated. It has been found that, for small values of the tolerance parameter, interdependent networks are more vulnerable as rewiring probability increases. For larger values of the tolerance parameter, the robustness of interdependent networks firstly decreases and then increases as rewiring probability increases. Coupling strength has a different impact on robustness. For low values of coupling strength, the resilience of interdependent networks decreases with the increment of the coupling strength until it reaches a certain threshold value. For values of coupling strength above this threshold, the opposite effect is observed. Our results are helpful to understand and design resilient interdependent networks.
Insensitive versus efficient dynamic load balancing in networks without blocking
Jonckheere, M.
2006-01-01
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing policies such as joining the shortest queue. In the present paper, we turn the attention to networks without blocking. To
On generalizations of network design problems with degree bounds
Bansal, N.; Khandekar, R.; Könemann, J.; Nagarajan, V.; Peis, B.
2013-01-01
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in the minimum
On generalizations of network design problems with degree bounds
N. Bansal (Nikhil); R. Khandekar; J. Könemann (Jochen); V. Nagarajan; B. Peis
2013-01-01
htmlabstractIterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in
Coarse-grained simulation of a real-time process control network under peak load
International Nuclear Information System (INIS)
George, A.D.; Clapp, N.E. Jr.
1992-01-01
This paper presents a simulation study on the real-time process control network proposed for the new ANS reactor system at ORNL. A background discussion is provided on networks, modeling, and simulation, followed by an overview of the ANS process control network, its three peak-load models, and the results of a series of coarse-grained simulation studies carried out on these models using implementations of 802.3, 802.4, and 802.5 standard local area networks
Network Analysis of Students' Use of Representations in Problem Solving
McPadden, Daryl; Brewe, Eric
2016-03-01
We present the preliminary results of a study on student use of representations in problem solving within the Modeling Instruction - Electricity and Magnetism (MI-E&M) course. Representational competence is a critical skill needed for students to develop a sophisticated understanding of college science topics and to succeed in their science courses. In this study, 70 students from the MI-E&M, calculus-based course were given a survey of 25 physics problem statements both pre- and post- instruction, covering both Newtonian Mechanics and Electricity and Magnetism (E&M). For each problem statement, students were asked which representations they would use in that given situation. We analyze the survey results through network analysis, identifying which representations are linked together in which contexts. We also compare the representation networks for those students who had already taken the first-semester Modeling Instruction Mechanics course and those students who had taken a non-Modeling Mechanics course.
Evolving neural networks for strategic decision-making problems.
Kohl, Nate; Miikkulainen, Risto
2009-04-01
Evolution of neural networks, or neuroevolution, has been a successful approach to many low-level control problems such as pole balancing, vehicle control, and collision warning. However, certain types of problems-such as those involving strategic decision-making-have remained difficult for neuroevolution to solve. This paper evaluates the hypothesis that such problems are difficult because they are fractured: The correct action varies discontinuously as the agent moves from state to state. A method for measuring fracture using the concept of function variation is proposed and, based on this concept, two methods for dealing with fracture are examined: neurons with local receptive fields, and refinement based on a cascaded network architecture. Experiments in several benchmark domains are performed to evaluate how different levels of fracture affect the performance of neuroevolution methods, demonstrating that these two modifications improve performance significantly. These results form a promising starting point for expanding neuroevolution to strategic tasks.
Short term and medium term power distribution load forecasting by neural networks
International Nuclear Information System (INIS)
Yalcinoz, T.; Eminoglu, U.
2005-01-01
Load forecasting is an important subject for power distribution systems and has been studied from different points of view. In general, load forecasts should be performed over a broad spectrum of time intervals, which could be classified into short term, medium term and long term forecasts. Several research groups have proposed various techniques for either short term load forecasting or medium term load forecasting or long term load forecasting. This paper presents a neural network (NN) model for short term peak load forecasting, short term total load forecasting and medium term monthly load forecasting in power distribution systems. The NN is used to learn the relationships among past, current and future temperatures and loads. The neural network was trained to recognize the peak load of the day, total load of the day and monthly electricity consumption. The suitability of the proposed approach is illustrated through an application to real load shapes from the Turkish Electricity Distribution Corporation (TEDAS) in Nigde. The data represents the daily and monthly electricity consumption in Nigde, Turkey
Load-aware modeling for uplink cellular networks in a multi-channel environment
Alammouri, Ahmad; Elsawy, Hesham; Alouini, Mohamed-Slim
2014-01-01
We exploit tools from stochastic geometry to develop a tractable analytical approach for modeling uplink cellular networks. The developed model is load aware and accounts for per-user power control as well as the limited transmit power constraint
A PSO based Artificial Neural Network approach for short term unit commitment problem
Directory of Open Access Journals (Sweden)
AFTAB AHMAD
2010-10-01
Full Text Available Unit commitment (UC is a non-linear, large scale, complex, mixed-integer combinatorial constrained optimization problem. This paper proposes, a new hybrid approach for generating unit commitment schedules using swarm intelligence learning rule based neural network. The training data has been generated using dynamic programming for machines without valve point effects and using genetic algorithm for machines with valve point effects. A set of load patterns as inputs and the corresponding unit generation schedules as outputs are used to train the network. The neural network fine tunes the best results to the desired targets. The proposed approach has been validated for three thermal machines with valve point effects and without valve point effects. The results are compared with the approaches available in the literature. The PSO-ANN trained model gives better results which show the promise of the proposed methodology.
Augmented neural networks and problem structure-based heuristics for the bin-packing problem
Kasap, Nihat; Agarwal, Anurag
2012-08-01
In this article, we report on a research project where we applied augmented-neural-networks (AugNNs) approach for solving the classical bin-packing problem (BPP). AugNN is a metaheuristic that combines a priority rule heuristic with the iterative search approach of neural networks to generate good solutions fast. This is the first time this approach has been applied to the BPP. We also propose a decomposition approach for solving harder BPP, in which subproblems are solved using a combination of AugNN approach and heuristics that exploit the problem structure. We discuss the characteristics of problems on which such problem structure-based heuristics could be applied. We empirically show the effectiveness of the AugNN and the decomposition approach on many benchmark problems in the literature. For the 1210 benchmark problems tested, 917 problems were solved to optimality and the average gap between the obtained solution and the upper bound for all the problems was reduced to under 0.66% and computation time averaged below 33 s per problem. We also discuss the computational complexity of our approach.
Islam, Mujahidul
A sustainable energy delivery infrastructure implies the safe and reliable accommodation of large scale penetration of renewable sources in the power grid. In this dissertation it is assumed there will be no significant change in the power transmission and distribution structure currently in place; except in the operating strategy and regulatory policy. That is to say, with the same old structure, the path towards unveiling a high penetration of switching power converters in the power system will be challenging. Some of the dimensions of this challenge are power quality degradation, frequent false trips due to power system imbalance, and losses due to a large neutral current. The ultimate result is the reduced life of many power distribution components - transformers, switches and sophisticated loads. Numerous ancillary services are being developed and offered by the utility operators to mitigate these problems. These services will likely raise the system's operational cost, not only from the utility operators' end, but also reflected on the Independent System Operators and by the Regional Transmission Operators (RTO) due to an unforeseen backlash of frequent variation in the load-side generation or distributed generation. The North American transmission grid is an interconnected system similar to a large electrical circuit. This circuit was not planned but designed over 100 years. The natural laws of physics govern the power flow among loads and generators except where control mechanisms are installed. The control mechanism has not matured enough to withstand the high penetration of variable generators at uncontrolled distribution ends. Unlike a radial distribution system, mesh or loop networks can alleviate complex channels for real and reactive power flow. Significant variation in real power injection and absorption on the distribution side can emerge as a bias signal on the routing reactive power in some physical links or channels that are not distinguishable
Applied Knowledge Management to Mitigate Cognitive Load in Network-Enabled Mission Command
2017-11-22
ARL-TN-0859 ● NOV 2017 US Army Research Laboratory Applied Knowledge Management to Mitigate Cognitive Load in Network-Enabled...Applied Knowledge Management to Mitigate Cognitive Load in Network-Enabled Mission Command by John K Hawley Human Research and Engineering...REPORT TYPE Technical Note 3. DATES COVERED (From - To) 1 May 2016–20 April 2017 4. TITLE AND SUBTITLE Applied Knowledge Management to Mitigate
Impact evaluation of conducted UWB transients on loads in power-line networks
Li, Bing; Månsson, Daniel
2017-09-01
Nowadays, faced with the ever-increasing dependence on diverse electronic devices and systems, the proliferation of potential electromagnetic interference (EMI) becomes a critical threat for reliable operation. A typical issue is the electronics working reliably in power-line networks when exposed to electromagnetic environment. In this paper, we consider a conducted ultra-wideband (UWB) disturbance, as an example of intentional electromagnetic interference (IEMI) source, and perform the impact evaluation at the loads in a network. With the aid of fast Fourier transform (FFT), the UWB transient is characterized in the frequency domain. Based on a modified Baum-Liu-Tesche (BLT) method, the EMI received at the loads, with complex impedance, is computed. Through inverse FFT (IFFT), we obtain time-domain responses of the loads. To evaluate the impact on loads, we employ five common, but important quantifiers, i.e., time-domain peak, total signal energy, peak signal power, peak time rate of change and peak time integral of the pulse. Moreover, to perform a comprehensive analysis, we also investigate the effects of the attributes (capacitive, resistive, or inductive) of other loads connected to the network, the rise time and pulse width of the UWB transient, and the lengths of power lines. It is seen that, for the loads distributed in a network, the impact evaluation of IEMI should be based on the characteristics of the IEMI source, and the network features, such as load impedances, layout, and characteristics of cables.
A Formal Model and Verification Problems for Software Defined Networks
Directory of Open Access Journals (Sweden)
V. A. Zakharov
2013-01-01
Full Text Available Software-defined networking (SDN is an approach to building computer networks that separate and abstract data planes and control planes of these systems. In a SDN a centralized controller manages a distributed set of switches. A set of open commands for packet forwarding and flow-table updating was defined in the form of a protocol known as OpenFlow. In this paper we describe an abstract formal model of SDN, introduce a tentative language for specification of SDN forwarding policies, and set up formally model-checking problems for SDN.
Failure mitigation in software defined networking employing load type prediction
Bouacida, Nader; Alghadhban, Amer Mohammad JarAlla; Alalmaei, Shiyam Mohammed Abdullah; Mohammed, Haneen; Shihada, Basem
2017-01-01
The controller is a critical piece of the SDN architecture, where it is considered as the mastermind of SDN networks. Thus, its failure will cause a significant portion of the network to fail. Overload is one of the common causes of failure since
Energy savings in mobile broadband network based on load predictions
DEFF Research Database (Denmark)
Samulevicius, Saulius; Pedersen, Torben Bach; Sørensen, Troels Bundgaard
2012-01-01
Abstract—The deployment of new network equipment is resulting in increasing energy consumption in mobile broadband networks (MBNs). This contributes to higher CO2 emissions. Over the last 10 years MBNs have grown considerably, and are still growing to meet the evolution in traffic volume carried...
Application of the distributed genetic algorithm for loading pattern optimization problems
International Nuclear Information System (INIS)
Hashimoto, Hiroshi; Yamamoto, Akio
2000-01-01
The distributed genetic algorithm (DGA) is applied for loading pattern optimization problems of the pressurized water reactors (PWR). Due to stiff nature of the loading pattern optimizations (e.g. multi-modality and non-linearity), stochastic methods like the simulated annealing or the genetic algorithm (GA) are widely applied for these problems. A basic concept of DGA is based on that of GA. However, DGA equally distributes candidates of solutions (i.e. loading patterns) to several independent 'islands' and evolves them in each island. Migrations of some candidates are performed among islands with a certain period. Since candidates of solutions independently evolve in each island with accepting different genes of migrants from other islands, premature convergence in the traditional GA can be prevented. Because many candidate loading patterns should be evaluated in one generation of GA or DGA, the parallelization in these calculations works efficiently. Parallel efficiency was measured using our optimization code and good load balance was attained even in a heterogeneous cluster environment due to dynamic distribution of the calculation load. The optimization code is based on the client/server architecture with the TCP/IP native socket and a client (optimization module) and calculation server modules communicate the objects of loading patterns each other. Throughout the sensitivity study on optimization parameters of DGA, a suitable set of the parameters for a test problem was identified. Finally, optimization capability of DGA and the traditional GA was compared in the test problem and DGA provided better optimization results than the traditional GA. (author)
Directory of Open Access Journals (Sweden)
MANAR Y. KASHMOLA
2012-06-01
Full Text Available The development of hybrid algorithms for solving complex optimization problems focuses on enhancing the strengths and compensating for the weakness of two or more complementary approaches. The goal is to intelligently combine the key elements of these approaches to find superior solutions to solve optimization problems. Optimal routing in communication network is considering a complex optimization problem. In this paper we propose a hybrid Hopfield Neural Network (HNN and Tabu Search (TS algorithm, this algorithm called hybrid HNN-TS algorithm. The paradigm of this hybridization is embedded. We embed the short-term memory and tabu restriction features from TS algorithm in the HNN model. The short-term memory and tabu restriction control the neuron selection process in the HNN model in order to get around the local minima problem and find an optimal solution using the HNN model to solve complex optimization problem. The proposed algorithm is intended to find the optimal path for packet transmission in the network which is fills in the field of routing problem. The optimal path that will be selected is depending on 4-tuples (delay, cost, reliability and capacity. Test results show that the propose algorithm can find path with optimal cost and a reasonable number of iterations. It also shows that the complexity of the network model won’t be a problem since the neuron selection is done heuristically.
A simulated annealing approach for redesigning a warehouse network problem
Khairuddin, Rozieana; Marlizawati Zainuddin, Zaitul; Jiun, Gan Jia
2017-09-01
Now a day, several companies consider downsizing their distribution networks in ways that involve consolidation or phase-out of some of their current warehousing facilities due to the increasing competition, mounting cost pressure and taking advantage on the economies of scale. Consequently, the changes on economic situation after a certain period of time require an adjustment on the network model in order to get the optimal cost under the current economic conditions. This paper aimed to develop a mixed-integer linear programming model for a two-echelon warehouse network redesign problem with capacitated plant and uncapacitated warehouses. The main contribution of this study is considering capacity constraint for existing warehouses. A Simulated Annealing algorithm is proposed to tackle with the proposed model. The numerical solution showed the model and method of solution proposed was practical.
A study on the evolution of crack networks under thermal fatigue loading
International Nuclear Information System (INIS)
Kamaya, Masayuki; Taheri, Said
2008-01-01
The crack network is a typical cracking morphology caused by thermal fatigue loading. It was pointed out that the crack network appeared under relatively small temperature fluctuations and did not grow deeply. In this study, the mechanism of evolution of crack network and its influence on crack growth was examined by numerical calculation. First, the stress field near two interacting cracks was investigated. It was shown that there are stress-concentration and stress-shielding zones around interacting cracks, and that cracks can form a network under the bi-axial stress condition. Secondly, a Monte Carlo simulation was developed in order to simulate the initiation and growth of cracks under thermal fatigue loading and the evolution of the crack network. The local stress field formed by pre-existing cracks was evaluated by the body force method and its role in the initiation and growth of cracks was considered. The simulation could simulate the evolution of the crack network and change in number of cracks observed in the experiments. It was revealed that reduction in the stress intensity factor due to stress feature in the depth direction under high cycle thermal fatigue loading plays an important role in the evolution of the crack network and that mechanical interaction between cracks in the network affects initiation rather than growth of cracks. The crack network appears only when the crack growth in the depth direction is interrupted. It was concluded that the emergence of the crack network is preferable for the structural integrity of cracked components
Some dynamic resource allocation problems in wireless networks
Berry, Randall
2001-07-01
We consider dynamic resource allocation problems that arise in wireless networking. Specifically transmission scheduling problems are studied in cases where a user can dynamically allocate communication resources such as transmission rate and power based on current channel knowledge as well as traffic variations. We assume that arriving data is stored in a transmission buffer, and investigate the trade-off between average transmission power and average buffer delay. A general characterization of this trade-off is given and the behavior of this trade-off in the regime of asymptotically large buffer delays is explored. An extension to a more general utility based quality of service definition is also discussed.
Load control strategies in 2G mobile network for W-CDMA radio ...
African Journals Online (AJOL)
Network planning requires a faithful analysis of each individual cell's capacity. In this paper, we examine load control equations as a resource allocation tool to analyse cell capacity for the uplink and downlink of Wideband Code Division Multiple Access (W-CDMA) networks. In the uplink, the noise rise is a parameter of ...
International Nuclear Information System (INIS)
Mahmoud, Thair S.; Habibi, Daryoush; Hassan, Mohammed Y.; Bass, Octavian
2015-01-01
Highlights: • A novel Short Term Medium Voltage (MV) Load Forecasting (STLF) model is presented. • A knowledge-based STLF error control mechanism is implemented. • An Artificial Neural Network (ANN)-based optimum tuning is applied on STLF. • The relationship between load profiles and operational conditions is analysed. - Abstract: This paper presents an intelligent mechanism for Short Term Load Forecasting (STLF) models, which allows self-adaptation with respect to the load operational conditions. Specifically, a knowledge-based FeedBack Tunning Fuzzy System (FBTFS) is proposed to instantaneously correlate the information about the demand profile and its operational conditions to make decisions for controlling the model’s forecasting error rate. To maintain minimum forecasting error under various operational scenarios, the FBTFS adaptation was optimised using a Multi-Layer Perceptron Artificial Neural Network (MLPANN), which was trained using Backpropagation algorithm, based on the information about the amount of error and the operational conditions at time of forecasting. For the sake of comparison and performance testing, this mechanism was added to the conventional forecasting methods, i.e. Nonlinear AutoRegressive eXogenous-Artificial Neural Network (NARXANN), Fuzzy Subtractive Clustering Method-based Adaptive Neuro Fuzzy Inference System (FSCMANFIS) and Gaussian-kernel Support Vector Machine (GSVM), and the measured forecasting error reduction average in a 12 month simulation period was 7.83%, 8.5% and 8.32% respectively. The 3.5 MW variable load profile of Edith Cowan University (ECU) in Joondalup, Australia, was used in the modelling and simulations of this model, and the data was provided by Western Power, the transmission and distribution company of the state of Western Australia.
Dynamic supplier selection problem considering full truck load in probabilistic environment
Sutrisno, Wicaksono, Purnawan Adi
2017-11-01
In this paper, we propose a mathematical model in a probabilistic dynamic optimization to solve a dynamic supplier selection problem considering full truck load in probabilistic environment where some parameters are uncertain. We determine the optimal strategy for this problem by using stochastic dynamic programming. We give some numerical experiments to evaluate and analyze the model. From the results, the optimal supplier and the optimal product volume from the optimal supplier were determined for each time period.
Under-Frequency Load Shedding Technique Considering Event-Based for an Islanded Distribution Network
Directory of Open Access Journals (Sweden)
Hasmaini Mohamad
2016-06-01
Full Text Available One of the biggest challenge for an islanding operation is to sustain the frequency stability. A large power imbalance following islanding would cause under-frequency, hence an appropriate control is required to shed certain amount of load. The main objective of this research is to develop an adaptive under-frequency load shedding (UFLS technique for an islanding system. The technique is designed considering an event-based which includes the moment system is islanded and a tripping of any DG unit during islanding operation. A disturbance magnitude is calculated to determine the amount of load to be shed. The technique is modeled by using PSCAD simulation tool. A simulation studies on a distribution network with mini hydro generation is carried out to evaluate the UFLS model. It is performed under different load condition: peak and base load. Results show that the load shedding technique have successfully shed certain amount of load and stabilized the system frequency.
International Nuclear Information System (INIS)
Plauk, G.; Herter, J.
1984-01-01
Nuclear plant facilities and other reinforced concrete structures have to be regarded as to their safety in design and construction with respect to impact and impulsive loading in order to avoid serious damage to mankind and environment. The paper gives a survey on theoretical and experimental developments currently in progress, in particular regarding airplane crash. Some new results arising out of several research programs relevant to particular problems of impact loading have been reviewed and are presented. Experimental investigation for determination of material properties of plain concrete, reinforcing steel as well as steel-concrete bond under high strain-rates are treated in this paper including theoretical approaches for the respective material laws. An outline of soft missile impact tests performed on structural members, e.g. beams and plates, to determine the load deformation or fracture behaviour is given. Furthermore, numerical models and calculations to analyse structural components and structures under impact loading were discussed. (Author) [pt
Investigation of Load Sharing in Hybrid (2G/3G Mobile Networks
Directory of Open Access Journals (Sweden)
Martynas Stirbys
2015-07-01
Full Text Available The main purpose of this work is to investigate load sharing methods for 2G/3G cellular networks in order to determine their impact on the network and users. One of the study aims is to analyze the performance of the methods. Moreover the paper provides an overview of the methods circumstances, limitations. Directed Retry and Load Based Handover methods were chosen. Data was obtained from real Lithuanian mobile operator’s network. The paper also discusses the changes in Key Performance Indicators.
Investigation of Load Sharing in Hybrid (2G/3G) Mobile Networks
Martynas Stirbys; Karolis Žvinys
2015-01-01
The main purpose of this work is to investigate load sharing methods for 2G/3G cellular networks in order to determine their impact on the network and users. One of the study aims is to analyze the performance of the methods. Moreover the paper provides an overview of the methods circumstances, limitations. Directed Retry and Load Based Handover methods were chosen. Data was obtained from real Lithuanian mobile operator’s network. The paper also discusses the changes in Key Performance Indica...
Two efficient heuristics to solve the integrated load distribution and production planning problem
International Nuclear Information System (INIS)
Gajpal, Yuvraj; Nourelfath, Mustapha
2015-01-01
This paper considers a multi-period production system where a set of machines are arranged in parallel. The machines are unreliable and the failure rate of machine depends on the load assigned to the machine. The expected production rate of the system is considered to be a non-monotonic function of its load. Because of the machine failure rate, the total production output depends on the combination of loads assigned to different machines. We consider the integration of load distribution decisions with production planning decision. The product demands are considered to be known in advance. The objective is to minimize the sum of holding costs, backorder costs, production costs, setup costs, capacity change costs and unused capacity costs while satisfying the demand over specified time horizon. The constraint is not to exceed available repair resources required to repair the machine breakdown. The paper develops two heuristics to solve the integrated load distribution and production planning problem. The first heuristic consists of a three-phase approach, while the second one is based on tabu search metaheuristic. The efficiency of the proposed heuristics is tested through the randomly generated problem instances. - Highlights: • The expected performance of the system is a non-monotonic function of its load. • We consider the integration of load distribution and production planning decisions. • The paper proposes three phase and tabu search based heuristics to solve the problem. • Lower bound has been developed for checking the effectiveness of the heuristics. • The efficiency of the heuristic is tested through randomly generated instances.
Address Translation Problems in IMS Based Next Generation Networks
Directory of Open Access Journals (Sweden)
Balazs Godor
2006-01-01
Full Text Available The development of packed based multimedia networks reached a turning point when the ITU-T and the ETSIhave incorporated the IMS to the NGN. With the fast development of mobile communication more and more services andcontent are available. In contrast with fix network telephony both the services and the devices are personalized in the “mobileworld”. Services, known from the Internet - like e-mail, chat, browsing, presence, etc. – are already available via mobiledevices as well. The IMS originally wanted to exploit both the benefits of mobile networks and the fancy services of theInternet. But today it is already more than that. IMS is the core of the next generation telecommunication networks and abasis for fix-mobile convergent services. The fact however that IMS was originally a “mobile” standard, where IPv6 was notoddity generated some problems for the fix networks, where IPv4 is used. In this article I give an overview of these problemsand mention some solutions as well.
Development of Fast-Running Simulation Methodology Using Neural Networks for Load Follow Operation
International Nuclear Information System (INIS)
Seong, Seung-Hwan; Park, Heui-Youn; Kim, Dong-Hoon; Suh, Yong-Suk; Hur, Seop; Koo, In-Soo; Lee, Un-Chul; Jang, Jin-Wook; Shin, Yong-Chul
2002-01-01
A new fast-running analytic model has been developed for analyzing the load follow operation. The new model was based on the neural network theory, which has the capability of modeling the input/output relationships of a nonlinear system. The new model is made up of two error back-propagation neural networks and procedures to calculate core parameters, such as the distributions and density of xenon in a quasi-steady-state core like load follow operation. One neural network is designed to retrieve the axial offset of power distribution, and the other is for reactivity corresponding to a given core condition. The training data sets for learning the neural networks in the new model are generated with a three-dimensional nodal code and, also, the measured data of the first-day test of load follow operation. Using the new model, the simulation results of the 5-day load follow test in a pressurized water reactor show a good agreement between the simulation data and the actual measured data. Required computing time for simulating a load follow operation is comparable to that of a fast-running lumped model. Moreover, the new model does not require additional engineering factors to compensate for the difference between the actual measurements and analysis results because the neural network has the inherent learning capability of neural networks to new situations
BOUNDARY VALUE PROBLEM FOR A LOADED EQUATION ELLIPTIC-HYPERBOLIC TYPE IN A DOUBLY CONNECTED DOMAIN
Directory of Open Access Journals (Sweden)
O.Kh. Abdullaev
2014-06-01
Full Text Available We study the existence and uniqueness of the solution of one boundary value problem for the loaded elliptic-hyperbolic equation of the second order with two lines of change of type in double-connected domain. Similar results have been received by D.M.Kuryhazov, when investigated domain is one-connected.
Load Balanced Mapping of Distributed Objects to Minimize Network Communication
Stoyenko, Alexander D.; Bosch, J.; Bosch, Jan; Aksit, Mehmet; Marlowe, Thomas J.
1996-01-01
This paper introduces a new load balancing and communica- tion minimizing heuristic used in the Inverse Remote Procedure Call (IRPC) system. While the paper briefly describes the IRPC system, the focus is on the new IRPC assignment heuristic. The IRPC compiler maps a distributed program to a graph
Complex network problems in physics, computer science and biology
Cojocaru, Radu Ionut
There is a close relation between physics and mathematics and the exchange of ideas between these two sciences are well established. However until few years ago there was no such a close relation between physics and computer science. Even more, only recently biologists started to use methods and tools from statistical physics in order to study the behavior of complex system. In this thesis we concentrate on applying and analyzing several methods borrowed from computer science to biology and also we use methods from statistical physics in solving hard problems from computer science. In recent years physicists have been interested in studying the behavior of complex networks. Physics is an experimental science in which theoretical predictions are compared to experiments. In this definition, the term prediction plays a very important role: although the system is complex, it is still possible to get predictions for its behavior, but these predictions are of a probabilistic nature. Spin glasses, lattice gases or the Potts model are a few examples of complex systems in physics. Spin glasses and many frustrated antiferromagnets map exactly to computer science problems in the NP-hard class defined in Chapter 1. In Chapter 1 we discuss a common result from artificial intelligence (AI) which shows that there are some problems which are NP-complete, with the implication that these problems are difficult to solve. We introduce a few well known hard problems from computer science (Satisfiability, Coloring, Vertex Cover together with Maximum Independent Set and Number Partitioning) and then discuss their mapping to problems from physics. In Chapter 2 we provide a short review of combinatorial optimization algorithms and their applications to ground state problems in disordered systems. We discuss the cavity method initially developed for studying the Sherrington-Kirkpatrick model of spin glasses. We extend this model to the study of a specific case of spin glass on the Bethe
Towards overcoming the Monte Carlo sign problem with tensor networks
Directory of Open Access Journals (Sweden)
Bañuls Mari Carmen
2017-01-01
Full Text Available The study of lattice gauge theories with Monte Carlo simulations is hindered by the infamous sign problem that appears under certain circumstances, in particular at non-zero chemical potential. So far, there is no universal method to overcome this problem. However, recent years brought a new class of non-perturbative Hamiltonian techniques named tensor networks, where the sign problem is absent. In previous work, we have demonstrated that this approach, in particular matrix product states in 1+1 dimensions, can be used to perform precise calculations in a lattice gauge theory, the massless and massive Schwinger model. We have computed the mass spectrum of this theory, its thermal properties and real-time dynamics. In this work, we review these results and we extend our calculations to the case of two flavours and non-zero chemical potential. We are able to reliably reproduce known analytical results for this model, thus demonstrating that tensor networks can tackle the sign problem of a lattice gauge theory at finite density.
Bulk Electric Load Cost Calculation Methods: Iraqi Network Comparative Study
Directory of Open Access Journals (Sweden)
Qais M. Alias
2016-09-01
Full Text Available It is vital in any industry to regain the spent capitals plus running costs and a margin of profits for the industry to flourish. The electricity industry is an everyday life touching industry which follows the same finance-economic strategy. Cost allocation is a major issue in all sectors of the electric industry, viz, generation, transmission and distribution. Generation and distribution service costing’s well documented in the literature, while the transmission share is still of need for research. In this work, the cost of supplying a bulk electric load connected to the EHV system is calculated. A sample basic lump-average method is used to provide a rough costing guide. Also, two transmission pricing methods are employed, namely, the postage-stamp and the load-flow based MW-distance methods to calculate transmission share in the total cost of each individual bulk load. The three costing methods results are then analyzed and compared for the 400kV Iraqi power grid considered for a case study.
neural network based load frequency control for restructuring power
African Journals Online (AJOL)
2012-03-01
Mar 1, 2012 ... the system in the back propagation chain used in controller training. For this application, .... The partial derivative of E with respect to ele- ments of Γ, for example W, ... Ki = any non-negative value. Figure 7: Neural Network ...
Solution of the ratchet-shakedown Bree problem with an extra orthogonal primary load
International Nuclear Information System (INIS)
Bradford, R.A.W.
2015-01-01
The complete shakedown and ratcheting solution is derived analytically for a flat plate subject to unequal biaxial primary membrane stresses and a cyclic secondary bending stress in one in-plane direction (x). The Tresca yield condition and elastic-perfectly plastic behaviour are assumed. It is shown that the results can be expressed in the form of a “universal” ratchet diagram applicable for all magnitudes of orthogonal load. For sufficiently large cyclic bending stresses, tensile ratcheting can occur in the x direction if the x direction primary membrane stress exceeds half that in the orthogonal direction. Conversely, for sufficiently large cyclic bending stresses ratcheting in the x direction will be compressive if the x direction primary membrane stress is less than half that in the orthogonal direction. When the x direction primary membrane stress is exactly half that in the orthogonal direction ratcheting cannot occur however large the cyclic secondary bending stress. - Highlights: • A complete shakedown and ratcheting solution is derived analytically. • The problem is Bree-like but with an extra orthogonal primary load. • The ratchet diagram can be expressed in a form applicable to any orthogonal load. • Tensile ratcheting can occur if the primary load exceeds half the orthogonal load. • Compressive ratcheting can occur for smaller primary loads
A High Precision Artificial Neural Networks Model for Short-Term Energy Load Forecasting
Directory of Open Access Journals (Sweden)
Ping-Huan Kuo
2018-01-01
Full Text Available One of the most important research topics in smart grid technology is load forecasting, because accuracy of load forecasting highly influences reliability of the smart grid systems. In the past, load forecasting was obtained by traditional analysis techniques such as time series analysis and linear regression. Since the load forecast focuses on aggregated electricity consumption patterns, researchers have recently integrated deep learning approaches with machine learning techniques. In this study, an accurate deep neural network algorithm for short-term load forecasting (STLF is introduced. The forecasting performance of proposed algorithm is compared with performances of five artificial intelligence algorithms that are commonly used in load forecasting. The Mean Absolute Percentage Error (MAPE and Cumulative Variation of Root Mean Square Error (CV-RMSE are used as accuracy evaluation indexes. The experiment results show that MAPE and CV-RMSE of proposed algorithm are 9.77% and 11.66%, respectively, displaying very high forecasting accuracy.
Distance learning, problem based learning and dynamic knowledge networks.
Giani, U; Martone, P
1998-06-01
This paper is an attempt to develop a distance learning model grounded upon a strict integration of problem based learning (PBL), dynamic knowledge networks (DKN) and web tools, such as hypermedia documents, synchronous and asynchronous communication facilities, etc. The main objective is to develop a theory of distance learning based upon the idea that learning is a highly dynamic cognitive process aimed at connecting different concepts in a network of mutually supporting concepts. Moreover, this process is supposed to be the result of a social interaction that has to be facilitated by the web. The model was tested by creating a virtual classroom of medical and nursing students and activating a learning session on the concept of knowledge representation in health sciences.
Neural Networks in Modelling Maintenance Unit Load Status
Directory of Open Access Journals (Sweden)
Anđelko Vojvoda
2002-03-01
Full Text Available This paper deals with a way of applying a neural networkfor describing se1vice station load in a maintenance unit. Dataacquired by measuring the workload of single stations in amaintenance unit were used in the process of training the neuralnetwork in order to create a model of the obse1ved system.The model developed in this way enables us to make more accuratepredictions over critical overload. Modelling was realisedby developing and using m-functions of the Matlab software.
Wang, Yaping; Lin, Shunjiang; Yang, Zhibin
2017-05-01
In the traditional three-phase power flow calculation of the low voltage distribution network, the load model is described as constant power. Since this model cannot reflect the characteristics of actual loads, the result of the traditional calculation is always different from the actual situation. In this paper, the load model in which dynamic load represented by air conditioners parallel with static load represented by lighting loads is used to describe characteristics of residents load, and the three-phase power flow calculation model is proposed. The power flow calculation model includes the power balance equations of three-phase (A,B,C), the current balance equations of phase 0, and the torque balancing equations of induction motors in air conditioners. And then an alternating iterative algorithm of induction motor torque balance equations with each node balance equations is proposed to solve the three-phase power flow model. This method is applied to an actual low voltage distribution network of residents load, and by the calculation of three different operating states of air conditioners, the result demonstrates the effectiveness of the proposed model and the algorithm.
A recurrent neural network for solving bilevel linear programming problem.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian
2014-04-01
In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.
Bunnoon, Pituk; Chalermyanont, Kusumal; Limsakul, Chusak
2010-02-01
This paper proposed the discrete transform and neural network algorithms to obtain the monthly peak load demand in mid term load forecasting. The mother wavelet daubechies2 (db2) is employed to decomposed, high pass filter and low pass filter signals from the original signal before using feed forward back propagation neural network to determine the forecasting results. The historical data records in 1997-2007 of Electricity Generating Authority of Thailand (EGAT) is used as reference. In this study, historical information of peak load demand(MW), mean temperature(Tmean), consumer price index (CPI), and industrial index (economic:IDI) are used as feature inputs of the network. The experimental results show that the Mean Absolute Percentage Error (MAPE) is approximately 4.32%. This forecasting results can be used for fuel planning and unit commitment of the power system in the future.
The Fabrication Problem Of U3Si2-Al Fuel With Uranium High Loading
International Nuclear Information System (INIS)
Supardjo
1996-01-01
The quality of U 3 Si 2 -Al dispersion fuel product is the main aim for each fabricator. Low loading of uranium fuel element is easily fabricated, but with the increased, uranium loading, homogeneity of uranium distribution is difficult to achieve and it always formed white spots, blister, and dogboning in the fuel plates. The problem can be eliminated by the increasing treatment of the fuel/Al powder. The precise selection of fuel/Al particles diameter is needed indeed to make easier in the homogeneous process of powder and the porosities arrangement in the fuel plates. The increasing of uranium loading at constant meat thickness will increase the meat hardness, therefore to withdraw the dogboning forming, the use of harder cladding materials is necessity
Using adaptive network based fuzzy inference system to forecast regional electricity loads
International Nuclear Information System (INIS)
Ying, L.-C.; Pan, M.-C.
2008-01-01
Since accurate regional load forecasting is very important for improvement of the management performance of the electric industry, various regional load forecasting methods have been developed. The purpose of this study is to apply the adaptive network based fuzzy inference system (ANFIS) model to forecast the regional electricity loads in Taiwan and demonstrate the forecasting performance of this model. Based on the mean absolute percentage errors and statistical results, we can see that the ANFIS model has better forecasting performance than the regression model, artificial neural network (ANN) model, support vector machines with genetic algorithms (SVMG) model, recurrent support vector machines with genetic algorithms (RSVMG) model and hybrid ellipsoidal fuzzy systems for time series forecasting (HEFST) model. Thus, the ANFIS model is a promising alternative for forecasting regional electricity loads
Using adaptive network based fuzzy inference system to forecast regional electricity loads
Energy Technology Data Exchange (ETDEWEB)
Ying, Li-Chih [Department of Marketing Management, Central Taiwan University of Science and Technology, 11, Pu-tzu Lane, Peitun, Taichung City 406 (China); Pan, Mei-Chiu [Graduate Institute of Management Sciences, Nanhua University, 32, Chung Keng Li, Dalin, Chiayi 622 (China)
2008-02-15
Since accurate regional load forecasting is very important for improvement of the management performance of the electric industry, various regional load forecasting methods have been developed. The purpose of this study is to apply the adaptive network based fuzzy inference system (ANFIS) model to forecast the regional electricity loads in Taiwan and demonstrate the forecasting performance of this model. Based on the mean absolute percentage errors and statistical results, we can see that the ANFIS model has better forecasting performance than the regression model, artificial neural network (ANN) model, support vector machines with genetic algorithms (SVMG) model, recurrent support vector machines with genetic algorithms (RSVMG) model and hybrid ellipsoidal fuzzy systems for time series forecasting (HEFST) model. Thus, the ANFIS model is a promising alternative for forecasting regional electricity loads. (author)
Impact evaluation of conducted UWB transients on loads in power-line networks
Directory of Open Access Journals (Sweden)
B. Li
2017-09-01
Full Text Available Nowadays, faced with the ever-increasing dependence on diverse electronic devices and systems, the proliferation of potential electromagnetic interference (EMI becomes a critical threat for reliable operation. A typical issue is the electronics working reliably in power-line networks when exposed to electromagnetic environment. In this paper, we consider a conducted ultra-wideband (UWB disturbance, as an example of intentional electromagnetic interference (IEMI source, and perform the impact evaluation at the loads in a network. With the aid of fast Fourier transform (FFT, the UWB transient is characterized in the frequency domain. Based on a modified Baum–Liu–Tesche (BLT method, the EMI received at the loads, with complex impedance, is computed. Through inverse FFT (IFFT, we obtain time-domain responses of the loads. To evaluate the impact on loads, we employ five common, but important quantifiers, i.e., time-domain peak, total signal energy, peak signal power, peak time rate of change and peak time integral of the pulse. Moreover, to perform a comprehensive analysis, we also investigate the effects of the attributes (capacitive, resistive, or inductive of other loads connected to the network, the rise time and pulse width of the UWB transient, and the lengths of power lines. It is seen that, for the loads distributed in a network, the impact evaluation of IEMI should be based on the characteristics of the IEMI source, and the network features, such as load impedances, layout, and characteristics of cables.
Short-Term Load Forecasting Model Based on Quantum Elman Neural Networks
Directory of Open Access Journals (Sweden)
Zhisheng Zhang
2016-01-01
Full Text Available Short-term load forecasting model based on quantum Elman neural networks was constructed in this paper. The quantum computation and Elman feedback mechanism were integrated into quantum Elman neural networks. Quantum computation can effectively improve the approximation capability and the information processing ability of the neural networks. Quantum Elman neural networks have not only the feedforward connection but also the feedback connection. The feedback connection between the hidden nodes and the context nodes belongs to the state feedback in the internal system, which has formed specific dynamic memory performance. Phase space reconstruction theory is the theoretical basis of constructing the forecasting model. The training samples are formed by means of K-nearest neighbor approach. Through the example simulation, the testing results show that the model based on quantum Elman neural networks is better than the model based on the quantum feedforward neural network, the model based on the conventional Elman neural network, and the model based on the conventional feedforward neural network. So the proposed model can effectively improve the prediction accuracy. The research in the paper makes a theoretical foundation for the practical engineering application of the short-term load forecasting model based on quantum Elman neural networks.
Mental Health, School Problems, and Social Networks: Modeling Urban Adolescent Substance Use
Mason, Michael J.
2010-01-01
This study tested a mediation model of the relationship with school problems, social network quality, and substance use with a primary care sample of 301 urban adolescents. It was theorized that social network quality (level of risk or protection in network) would mediate the effects of school problems, accounting for internalizing problems and…
High-precision solution to the moving load problem using an improved spectral element method
Wen, Shu-Rui; Wu, Zhi-Jing; Lu, Nian-Li
2018-02-01
In this paper, the spectral element method (SEM) is improved to solve the moving load problem. In this method, a structure with uniform geometry and material properties is considered as a spectral element, which means that the element number and the degree of freedom can be reduced significantly. Based on the variational method and the Laplace transform theory, the spectral stiffness matrix and the equivalent nodal force of the beam-column element are established. The static Green function is employed to deduce the improved function. The proposed method is applied to two typical engineering practices—the one-span bridge and the horizontal jib of the tower crane. The results have revealed the following. First, the new method can yield extremely high-precision results of the dynamic deflection, the bending moment and the shear force in the moving load problem. In most cases, the relative errors are smaller than 1%. Second, by comparing with the finite element method, one can obtain the highly accurate results using the improved SEM with smaller element numbers. Moreover, the method can be widely used for statically determinate as well as statically indeterminate structures. Third, the dynamic deflection of the twin-lift jib decreases with the increase in the moving load speed, whereas the curvature of the deflection increases. Finally, the dynamic deflection, the bending moment and the shear force of the jib will all increase as the magnitude of the moving load increases.
Directory of Open Access Journals (Sweden)
Wei Gao
2016-01-01
Full Text Available According to the regularization method in the inverse problem of load identification, a new method for determining the optimal regularization parameter is proposed. Firstly, quotient function (QF is defined by utilizing the regularization parameter as a variable based on the least squares solution of the minimization problem. Secondly, the quotient function method (QFM is proposed to select the optimal regularization parameter based on the quadratic programming theory. For employing the QFM, the characteristics of the values of QF with respect to the different regularization parameters are taken into consideration. Finally, numerical and experimental examples are utilized to validate the performance of the QFM. Furthermore, the Generalized Cross-Validation (GCV method and the L-curve method are taken as the comparison methods. The results indicate that the proposed QFM is adaptive to different measuring points, noise levels, and types of dynamic load.
A Heuristic Procedure for the Outbound Container Relocation Problem during Export Loading Operations
Directory of Open Access Journals (Sweden)
Roberto Guerra-Olivares
2015-01-01
Full Text Available During export ship loading operations, it is often necessary to perform relocation movements with containers that interfere with access to the desired container in the ship loading sequence. This paper presents a real-time heuristic procedure for the container relocation problem employing reachstacker vehicles as container handling equipment. The proposed heuristic searches for good relocation coordinates within a set of nearby bays. The heuristic has a parameter that determines how far from the original bay a container may be relocated. The tradeoff between reducing relocation movements and limiting vehicle travel distances is examined and the performance of the heuristic is compared with a common practice in the smaller container terminals in Chile and Mexico. Finally, a mathematical model for the container relocation problem is presented.
Route Selection Problem Based on Hopfield Neural Network
Directory of Open Access Journals (Sweden)
N. Kojic
2013-12-01
Full Text Available Transport network is a key factor of economic, social and every other form of development in the region and the state itself. One of the main conditions for transport network development is the construction of new routes. Often, the construction of regional roads is dominant, since the design and construction in urban areas is quite limited. The process of analysis and planning the new roads is a complex process that depends on many factors (the physical characteristics of the terrain, the economic situation, political decisions, environmental impact, etc. and can take several months. These factors directly or indirectly affect the final solution, and in combination with project limitations and requirements, sometimes can be mutually opposed. In this paper, we present one software solution that aims to find Pareto optimal path for preliminary design of the new roadway. The proposed algorithm is based on many different factors (physical and social with the ability of their increase. This solution is implemented using Hopfield's neural network, as a kind of artificial intelligence, which has shown very good results for solving complex optimization problems.
Application of Artificial Neural Networks to Complex Groundwater Management Problems
International Nuclear Information System (INIS)
Coppola, Emery; Poulton, Mary; Charles, Emmanuel; Dustman, John; Szidarovszky, Ferenc
2003-01-01
As water quantity and quality problems become increasingly severe, accurate prediction and effective management of scarcer water resources will become critical. In this paper, the successful application of artificial neural network (ANN) technology is described for three types of groundwater prediction and management problems. In the first example, an ANN was trained with simulation data from a physically based numerical model to predict head (groundwater elevation) at locations of interest under variable pumping and climate conditions. The ANN achieved a high degree of predictive accuracy, and its derived state-transition equations were embedded into a multiobjective optimization formulation and solved to generate a trade-off curve depicting water supply in relation to contamination risk. In the second and third examples, ANNs were developed with real-world hydrologic and climate data for different hydrogeologic environments. For the second problem, an ANN was developed using data collected for a 5-year, 8-month period to predict heads in a multilayered surficial and limestone aquifer system under variable pumping, state, and climate conditions. Using weekly stress periods, the ANN substantially outperformed a well-calibrated numerical flow model for the 71-day validation period, and provided insights into the effects of climate and pumping on water levels. For the third problem, an ANN was developed with data collected automatically over a 6-week period to predict hourly heads in 11 high-capacity public supply wells tapping a semiconfined bedrock aquifer and subject to large well-interference effects. Using hourly stress periods, the ANN accurately predicted heads for 24-hour periods in all public supply wells. These test cases demonstrate that the ANN technology can solve a variety of complex groundwater management problems and overcome many of the problems and limitations associated with traditional physically based flow models
International Nuclear Information System (INIS)
Alexeyeva, L.A.
2001-01-01
Investigation of diffraction processes of seismic waves on underground tunnels and pipelines with use of mathematical methods is related to solving boundary value problems (BVP) for hyperbolic system of differential equations in domains with cylindrical cavities when seismic disturbances propagate along boundaries with subsonic or transonic speeds. Also such classes of problems appear when it's necessary to study the behavior of underground constructions and Stress-strain State of environment. But in this case the velocities of running loads are less than velocities of wave propagation in surrounding medium. At present similar problems were solved only for constructions of circular cylindrical form with use of methods of full and not full dividing of variables. For cylindrical constructions of complex cross section strong mathematical theories for solving these problems were absent.(author)
Algorithm for solving multicriteria problem of appointments on the networks
Directory of Open Access Journals (Sweden)
Yu. V. Bugaeev
2017-01-01
Full Text Available To describe complex projects or various jobs that make up a set of interrelated activities, use the network schedule. Several variants of network models are used. 1. For practical use, the Gantt chart is the most widely used - it is a graphical representation of consecutive intervals of time and the use of resources. 2. The network graph is represented as a graph, where the vertices are an event (or its state at a certain point in time, and the connecting arcs (or edges are works. The graph model is used in the work. In this case, the events (the fact of the completion or the beginning of the work correspond to the vertices of the graph, and the work to the arcs, the orientation of which corresponds to the technology of this process. An important role in the project management model is played by the optimal assignment of performers to the existing list of works. With this formulation of the problem, the total implementation time or the length of the critical path on the graph can be used as a criterion. In this case, the criterion is imposed a restriction on the deadline for the execution of work (or the project as a whole. Thus, the total time spent on the project and the length of the critical path are represented by equally important characteristics of the project implementation, and they should be considered as two equivalent criteria for the multicriteria project management task. We have proposed an algorithm, in general, an approximate determination of the set of Pareto-optimal solutions of a given problem.
CAC DPLB MCN: A Distributed Load Balancing Scheme in Multimedia Mobile Cellular Networks
Directory of Open Access Journals (Sweden)
Sharma Abhijit
2016-11-01
Full Text Available The problem of non-uniform traffic demand in different cells of a cellular network may lead to a gross imbalance in the system performance. Thus, the users in hot cells may suffer from low throughput. In this paper, an effective and simple load balancing scheme CAC_DPLB_MCN is proposed that can effectively reduce the overall call blocking. This model considers dealing with multi-media traffic as well as time-varying geographical traffic distribution. The proposed scheme uses the concept of cell-tiering thereby creating fractional frequency reuse environment. A message exchange based distributed scheme instead of centralized one is used which help the proposed scheme be implemented in a multiple hot cell environment also. Furthermore, concept of dynamic pricing is used to serve the best interest of the users as well as for the service providers. The performance of the proposed scheme is compared with two other existing schemes in terms of call blocking probability and bandwidth utilization. Simulation results show that the proposed scheme can reduce the call blocking significantly in highly congested cell with highest bandwidth utilization. Use of dynamic pricing also makes the scheme useful to increase revenue of the service providers in contrast with compared schemes.
Multi-Layer Mobility Load Balancing in a Heterogeneous LTE Network
DEFF Research Database (Denmark)
Fotiadis, Panagiotis; Polignano, Michele; Laselva, Daniela
2012-01-01
This paper analyzes the behavior of a distributed Mobility Load Balancing (MLB) scheme in a multi-layer 3GPP (3rd Generation Partnership Project) Long Term Evolution (LTE) deployment with different User Equipment (UE) densities in certain network areas covered with pico cells. Target of the study...
Suryanarayana, Gowri; Lago Garcia, J.; Geysen, Davy; Aleksiejuk, Piotr; Johansson, Christian
2018-01-01
Recent research has seen several forecasting methods being applied for heat load forecasting of district heating networks. This paper presents two methods that gain significant improvements compared to the previous works. First, an automated way of handling non-linear dependencies in linear
Finding Multiple Optimal Solutions to Optimal Load Distribution Problem in Hydropower Plant
Directory of Open Access Journals (Sweden)
Xinhao Jiang
2012-05-01
Full Text Available Optimal load distribution (OLD among generator units of a hydropower plant is a vital task for hydropower generation scheduling and management. Traditional optimization methods for solving this problem focus on finding a single optimal solution. However, many practical constraints on hydropower plant operation are very difficult, if not impossible, to be modeled, and the optimal solution found by those models might be of limited practical uses. This motivates us to find multiple optimal solutions to the OLD problem, which can provide more flexible choices for decision-making. Based on a special dynamic programming model, we use a modified shortest path algorithm to produce multiple solutions to the problem. It is shown that multiple optimal solutions exist for the case study of China’s Geheyan hydropower plant, and they are valuable for assessing the stability of generator units, showing the potential of reducing occurrence times of units across vibration areas.
Directory of Open Access Journals (Sweden)
Houda Jouini
2010-01-01
Full Text Available As a perspective to ensure the power system stability and to avoid the vulnerability leading to the blackouts, several preventive and curative means are adopted. In order to avoid the voltage collapse, load shedding schemes represent a suitable action to maintain the power system service quality and to control its vulnerability. In this paper, we try to propose an intelligent load shedding strategy as a new approach based on fuzzy controllers. This strategy was founded on the calculation of generated power sensitivity degree related to those injected at different network buses. During the fault phase, fuzzy controller algorithms generate monitor vectors ensuring a precalculated load shedding ratio in the purpose to reestablish the power balance and conduct the network to a new steady state.
Towards building a neural network model for predicting pile static load test curves
Directory of Open Access Journals (Sweden)
Alzo’ubi A. K.
2018-01-01
Full Text Available In the United Arab Emirates, Continuous Flight Auger piles are the most widely used type of deep foundation. To test the pile behaviour, the Static Load Test is routinely conducted in the field by increasing the dead load while monitoring the displacement. Although the test is reliable, it is expensive to conduct. This test is usually conducted in the UAE to verify the pile capacity and displacement as the load increase and decreases in two cycles. In this paper we will utilize the Artificial Neural Network approach to build a model that can predict a complete Static Load Pile test. We will show that by integrating the pile configuration, soil properties, and ground water table in one artificial neural network model, the Static Load Test can be predicted with confidence. We believe that based on this approach, the model is able to predict the entire pile load test from start to end. The suggested approach is an excellent tool to reduce the cost associated with such expensive tests or to predict pile’s performance ahead of the actual test.
Library Automation and Networking in India: Problems and Prospects.
Vyas, S. D.
1997-01-01
Examines the information infrastructure and the impact of information technology in India. Highlights include attempts toward automation; library networking at the national and local level; descriptions of four major networks; library software; and constraints of networking in academic libraries. (LRW)
Directory of Open Access Journals (Sweden)
Mohammad Dreidy
2017-01-01
Full Text Available Recently, several environmental problems are beginning to affect all aspects of life. For this reason, many governments and international agencies have expressed great interest in using more renewable energy sources (RESs. However, integrating more RESs with distribution networks resulted in several critical problems vis-à-vis the frequency stability, which might lead to a complete blackout if not properly treated. Therefore, this paper proposed a new Under Frequency Load Shedding (UFLS scheme for islanding distribution network. This scheme uses three meta-heuristics techniques, binary evolutionary programming (BEP, Binary genetic algorithm (BGA, and Binary particle swarm optimization (BPSO, to determine the optimal combination of loads that needs to be shed from the islanded distribution network. Compared with existing UFLS schemes using fixed priority loads, the proposed scheme has the ability to restore the network frequency without any overshooting. Furthermore, in terms of execution time, the simulation results show that the BEP technique is fast enough to shed the optimal combination of loads compared with BGA and BPSO techniques.
Sensitivity analysis of linear programming problem through a recurrent neural network
Das, Raja
2017-11-01
In this paper we study the recurrent neural network for solving linear programming problems. To achieve optimality in accuracy and also in computational effort, an algorithm is presented. We investigate the sensitivity analysis of linear programming problem through the neural network. A detailed example is also presented to demonstrate the performance of the recurrent neural network.
Enhancement of a model for Large-scale Airline Network Planning Problems
Kölker, K.; Lopes dos Santos, Bruno F.; Lütjens, K.
2016-01-01
The main focus of this study is to solve the network planning problem based on passenger decision criteria including the preferred departure time and travel time for a real-sized airline network. For this purpose, a model of the integrated network planning problem is formulated including scheduling
Hu, Weiming; Fan, Yabo; Xing, Junliang; Sun, Liang; Cai, Zhaoquan; Maybank, Stephen
2018-09-01
We construct a new efficient near duplicate image detection method using a hierarchical hash code learning neural network and load-balanced locality-sensitive hashing (LSH) indexing. We propose a deep constrained siamese hash coding neural network combined with deep feature learning. Our neural network is able to extract effective features for near duplicate image detection. The extracted features are used to construct a LSH-based index. We propose a load-balanced LSH method to produce load-balanced buckets in the hashing process. The load-balanced LSH significantly reduces the query time. Based on the proposed load-balanced LSH, we design an effective and feasible algorithm for near duplicate image detection. Extensive experiments on three benchmark data sets demonstrate the effectiveness of our deep siamese hash encoding network and load-balanced LSH.
Unsupervised neural networks for solving Troesch's problem
International Nuclear Information System (INIS)
Raja Muhammad Asif Zahoor
2014-01-01
In this study, stochastic computational intelligence techniques are presented for the solution of Troesch's boundary value problem. The proposed stochastic solvers use the competency of a feed-forward artificial neural network for mathematical modeling of the problem in an unsupervised manner, whereas the learning of unknown parameters is made with local and global optimization methods as well as their combinations. Genetic algorithm (GA) and pattern search (PS) techniques are used as the global search methods and the interior point method (IPM) is used for an efficient local search. The combination of techniques like GA hybridized with IPM (GA-IPM) and PS hybridized with IPM (PS-IPM) are also applied to solve different forms of the equation. A comparison of the proposed results obtained from GA, PS, IPM, PS-IPM and GA-IPM has been made with the standard solutions including well known analytic techniques of the Adomian decomposition method, the variational iterational method and the homotopy perturbation method. The reliability and effectiveness of the proposed schemes, in term of accuracy and convergence, are evaluated from the results of statistical analysis based on sufficiently large independent runs. (interdisciplinary physics and related areas of science and technology)
Energy Technology Data Exchange (ETDEWEB)
Mandal, Paras; Senjyu, Tomonobu [Department of Electrical and Electronics, University of the Ryukyus, 1 Senbaru, Nagakami Nishihara, Okinawa 903-0213 (Japan); Funabashi, Toshihisa [Meidensha Corporation, Tokyo 103-8515 (Japan)
2006-09-15
In daily power markets, forecasting electricity prices and loads are the most essential task and the basis for any decision making. An approach to predict the market behaviors is to use the historical prices, loads and other required information to forecast the future prices and loads. This paper introduces an approach for several hour ahead (1-6h) electricity price and load forecasting using an artificial intelligence method, such as a neural network model, which uses publicly available data from the NEMMCO web site to forecast electricity prices and loads for the Victorian electricity market. An approach of selection of similar days is proposed according to which the load and price curves are forecasted by using the information of the days being similar to that of the forecast day. A Euclidean norm with weighted factors is used for the selection of the similar days. Two different ANN models, one for one to six hour ahead load forecasting and another for one to six hour ahead price forecasting have been proposed. The MAPE (mean absolute percentage error) results show a clear increasing trend with the increase in hour ahead load and price forecasting. The sample average of MAPEs for one hour ahead price forecasts is 9.75%. This figure increases to only 20.03% for six hour ahead predictions. Similarly, the one to six hour ahead load forecast errors (MAPE) range from 0.56% to 1.30% only. MAPE results show that several hour ahead electricity prices and loads in the deregulated Victorian market can be forecasted with reasonable accuracy. (author)
International Nuclear Information System (INIS)
Mandal, Paras; Senjyu, Tomonobu; Funabashi, Toshihisa
2006-01-01
In daily power markets, forecasting electricity prices and loads are the most essential task and the basis for any decision making. An approach to predict the market behaviors is to use the historical prices, loads and other required information to forecast the future prices and loads. This paper introduces an approach for several hour ahead (1-6 h) electricity price and load forecasting using an artificial intelligence method, such as a neural network model, which uses publicly available data from the NEMMCO web site to forecast electricity prices and loads for the Victorian electricity market. An approach of selection of similar days is proposed according to which the load and price curves are forecasted by using the information of the days being similar to that of the forecast day. A Euclidean norm with weighted factors is used for the selection of the similar days. Two different ANN models, one for one to six hour ahead load forecasting and another for one to six hour ahead price forecasting have been proposed. The MAPE (mean absolute percentage error) results show a clear increasing trend with the increase in hour ahead load and price forecasting. The sample average of MAPEs for one hour ahead price forecasts is 9.75%. This figure increases to only 20.03% for six hour ahead predictions. Similarly, the one to six hour ahead load forecast errors (MAPE) range from 0.56% to 1.30% only. MAPE results show that several hour ahead electricity prices and loads in the deregulated Victorian market can be forecasted with reasonable accuracy
Lee, Nathaniel; Welch, Bryan W.
2018-01-01
NASA's SCENIC project aims to simplify and reduce the cost of space mission planning by replicating the analysis capabilities of commercially licensed software which are integrated with relevant analysis parameters specific to SCaN assets and SCaN supported user missions. SCENIC differs from current tools that perform similar analyses in that it 1) does not require any licensing fees, 2) will provide an all-in-one package for various analysis capabilities that normally requires add-ons or multiple tools to complete. As part of SCENIC's capabilities, the ITACA network loading analysis tool will be responsible for assessing the loading on a given network architecture and generating a network service schedule. ITACA will allow users to evaluate the quality of service of a given network architecture and determine whether or not the architecture will satisfy the mission's requirements. ITACA is currently under development, and the following improvements were made during the fall of 2017: optimization of runtime, augmentation of network asset pre-service configuration time, augmentation of Brent's method of root finding, augmentation of network asset FOV restrictions, augmentation of mission lifetimes, and the integration of a SCaN link budget calculation tool. The improvements resulted in (a) 25% reduction in runtime, (b) more accurate contact window predictions when compared to STK(Registered Trademark) contact window predictions, and (c) increased fidelity through the use of specific SCaN asset parameters.
Tactical Network Load Balancing in Multi-Gateway Wireless Sensor Networks
2013-12-01
communication technology ARPANET Advanced Research Projects Agency Network ASN autonomous sensor network CBR constant bit rate CDMA code...transmission energy NFC near field communication OV1 operational view xxii PA power amplifier RFC request for comment RFID radio frequency identification...fact that the integrated chip (IC) technology boom during the past 20+ years has miniaturized IC hardware while increasing computational capability
The application of backpropagation neural network method to estimate the sediment loads
Directory of Open Access Journals (Sweden)
Ari Gunawan Taufik
2017-01-01
Full Text Available Nearly all formulations of conventional sediment load estimation method were developed based on a review of laboratory data or data field. This approach is generally limited by local so it is only suitable for a particular river typology. From previous studies, the amount of sediment load tends to be non-linear with respect to the hydraulic parameters and parameter that accompanies sediment. The dominant parameter is turbulence, whereas turbulence flow velocity vector direction of x, y and z. They were affected by water bodies in 3D morphology of the cross section of the vertical and horizontal. This study is conducted to address the non-linear nature of the hydraulic parameter data and sediment parameter against sediment load data by applying the artificial neural network (ANN method. The method used is the backpropagation neural network (BPNN schema. This scheme used for projecting the sediment load from the hydraulic parameter data and sediment parameters that used in the conventional estimation of sediment load. The results showed that the BPNN model performs reasonably well on the conventional calculation, indicated by the stability of correlation coefficient (R and the mean square error (MSE.
A note on the consensus finding problem in communication networks with switching topologies
Haskovec, Jan
2014-01-01
In this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates. We
Forecasting short-term data center network traffic load with convolutional neural networks
Ordozgoiti, Bruno; Gómez-Canaval, Sandra
2018-01-01
Efficient resource management in data centers is of central importance to content service providers as 90 percent of the network traffic is expected to go through them in the coming years. In this context we propose the use of convolutional neural networks (CNNs) to forecast short-term changes in the amount of traffic crossing a data center network. This value is an indicator of virtual machine activity and can be utilized to shape the data center infrastructure accordingly. The behaviour of network traffic at the seconds scale is highly chaotic and therefore traditional time-series-analysis approaches such as ARIMA fail to obtain accurate forecasts. We show that our convolutional neural network approach can exploit the non-linear regularities of network traffic, providing significant improvements with respect to the mean absolute and standard deviation of the data, and outperforming ARIMA by an increasingly significant margin as the forecasting granularity is above the 16-second resolution. In order to increase the accuracy of the forecasting model, we exploit the architecture of the CNNs using multiresolution input distributed among separate channels of the first convolutional layer. We validate our approach with an extensive set of experiments using a data set collected at the core network of an Internet Service Provider over a period of 5 months, totalling 70 days of traffic at the one-second resolution. PMID:29408936
Forecasting short-term data center network traffic load with convolutional neural networks.
Mozo, Alberto; Ordozgoiti, Bruno; Gómez-Canaval, Sandra
2018-01-01
Efficient resource management in data centers is of central importance to content service providers as 90 percent of the network traffic is expected to go through them in the coming years. In this context we propose the use of convolutional neural networks (CNNs) to forecast short-term changes in the amount of traffic crossing a data center network. This value is an indicator of virtual machine activity and can be utilized to shape the data center infrastructure accordingly. The behaviour of network traffic at the seconds scale is highly chaotic and therefore traditional time-series-analysis approaches such as ARIMA fail to obtain accurate forecasts. We show that our convolutional neural network approach can exploit the non-linear regularities of network traffic, providing significant improvements with respect to the mean absolute and standard deviation of the data, and outperforming ARIMA by an increasingly significant margin as the forecasting granularity is above the 16-second resolution. In order to increase the accuracy of the forecasting model, we exploit the architecture of the CNNs using multiresolution input distributed among separate channels of the first convolutional layer. We validate our approach with an extensive set of experiments using a data set collected at the core network of an Internet Service Provider over a period of 5 months, totalling 70 days of traffic at the one-second resolution.
Open Problems in Network-aware Data Management in Exa-scale Computing and Terabit Networking Era
Energy Technology Data Exchange (ETDEWEB)
Balman, Mehmet; Byna, Surendra
2011-12-06
Accessing and managing large amounts of data is a great challenge in collaborative computing environments where resources and users are geographically distributed. Recent advances in network technology led to next-generation high-performance networks, allowing high-bandwidth connectivity. Efficient use of the network infrastructure is necessary in order to address the increasing data and compute requirements of large-scale applications. We discuss several open problems, evaluate emerging trends, and articulate our perspectives in network-aware data management.
An Asymptotic Approach for the Elastodynamic Problem of a Plate under Impact Loading
Directory of Open Access Journals (Sweden)
Penelope Michalopoulou
2010-01-01
Full Text Available An approach is presented for analyzing the transient elastodynamic problem of a plate under an impact loading. The plate is considered to be in the form of a long strip under plane strain conditions. The loading is taken as a concentrated line force applied normal to the plate surface. It is assumed that this line force is suddenly applied and maintained thereafter (i.e., it is a Heaviside step function of time. Inertia effects are taken into consideration and the problem is treated exactly within the framework of elastodynamic theory. The approach is based on multiple Laplace transforms and on certain asymptotic arguments. In particular, the one-sided Laplace transform is applied to suppress time dependence and the two-sided Laplace transform to suppress the dependence upon a spatial variable (along the extent of the infinite strip. Exact inversions are then followed by invoking the asymptotic Tauber theorem and the Cagniard-deHoop technique. Various extensions of this basic analysis are also discussed.
An Efficient Meta Heuristic Algorithm to Solve Economic Load Dispatch Problems
Directory of Open Access Journals (Sweden)
R Subramanian
2013-12-01
Full Text Available The Economic Load Dispatch (ELD problems in power generation systems are to reduce the fuel cost by reducing the total cost for the generation of electric power. This paper presents an efficient Modified Firefly Algorithm (MFA, for solving ELD Problem. The main objective of the problems is to minimize the total fuel cost of the generating units having quadratic cost functions subjected to limits on generator true power output and transmission losses. The MFA is a stochastic, Meta heuristic approach based on the idealized behaviour of the flashing characteristics of fireflies. This paper presents an application of MFA to ELD for six generator test case system. MFA is applied to ELD problem and compared its solution quality and computation efficiency to Genetic algorithm (GA, Differential Evolution (DE, Particle swarm optimization (PSO, Artificial Bee Colony optimization (ABC, Biogeography-Based Optimization (BBO, Bacterial Foraging optimization (BFO, Firefly Algorithm (FA techniques. The simulation result shows that the proposed algorithm outperforms previous optimization methods.
Design and Optimisation Problems in Wireless Sensor Networks
Indian Academy of Sciences (India)
Premkumar Karumbu,1.05 ECE,,+91-9448227167
2010-11-14
Nov 14, 2010 ... Wireless Networks of Multifunction Smart Sensors (WSNs). A smart sensor ... Energy and environment management networks in large buildings. Emerging ISA ... Monitoring mobile patients in hospitals and homes. Locating ...
Game Theoretic Solutions to Cyber Attack and Network Defense Problems
National Research Council Canada - National Science Library
Shen, Dan; Chen, Genshe; Cruz, Jr., , Jose B; Blasch, Erik; Kruger, Martin
2007-01-01
.... The protection and defense against cyber attacks to computer network is becoming inadequate as the hacker knowledge sophisticates and as the network and each computer system become more complex...
The transportation management division institutional program: Networking and problem solving
International Nuclear Information System (INIS)
McGinnis, K.A.; Peterson, J.M.
1989-06-01
The US Department of Energy (DOE) has several programs related to transportation. While these programs may have differing missions and legislative authority, the required activities are frequently similar. To ensure a DOE-wide perspective in developing transportation policies and procedures, a DOE Transportation Institutional Task Force (Task Force) has been formed, which is the primary focus of this paper. The Task Force, composed of representatives from each of the major DOE transportation programs, meets periodically to exchange experiences and insights on institutional issues related to Departmental shipping. The primary purpose of the group is to identify opportunities for productive interactions with the transportation community, including interested and affected members of the public. This paper will also focus sharply on the networking of DOE with the State, Tribal, and local officials in fostering better understanding and in solving problems. An example of such activity is the DOE's cooperative agreement with the Energy Task Force of the Urban Consortium. A major effort is to encourage cooperative action in identifying, addressing, and resolving issues that could impede the transportation of radioactive materials
Directory of Open Access Journals (Sweden)
Wang Chao
2016-03-01
Full Text Available Due to the complexities existing in the electric load simulator, this article develops a high-performance nonlinear adaptive controller to improve the torque tracking performance of the electric load simulator, which mainly consists of an adaptive fuzzy self-recurrent wavelet neural network controller with variable structure (VSFSWC and a complementary controller. The VSFSWC is clearly and easily used for real-time systems and greatly improves the convergence rate and control precision. The complementary controller is designed to eliminate the effect of the approximation error between the proposed neural network controller and the ideal feedback controller without chattering phenomena. Moreover, adaptive learning laws are derived to guarantee the system stability in the sense of the Lyapunov theory. Finally, the hardware-in-the-loop simulations are carried out to verify the feasibility and effectiveness of the proposed algorithms in different working styles.
Traffic Load on Interconnection Lines of Generalized Double Ring Network Structures
DEFF Research Database (Denmark)
Pedersen, Jens Myrup; Riaz, Muhammad Tahir; Madsen, Ole Brun
2004-01-01
Generalized Double Ring (N2R) network structures possess a number of good properties, but being not planar they are hard to physically embed in communication networks. However, if some of the lines, the interconnection lines, are implemented by wireless technologies, the remaining structure...... consists of two planar rings, which are easily embedded by fiber or other wired solutions. It is shown that for large N2R structures, the interconnection lines carry notably lower loads than the other lines if shortest-path routing is used, and the effects of two other routing schemes are explored, leading...... to lower load on interconnection lines at the price of larger efficient average distance and diameter....
Cheng, Long; Hou, Zeng-Guang; Lin, Yingzi; Tan, Min; Zhang, Wenjun Chris; Wu, Fang-Xiang
2011-05-01
A recurrent neural network is proposed for solving the non-smooth convex optimization problem with the convex inequality and linear equality constraints. Since the objective function and inequality constraints may not be smooth, the Clarke's generalized gradients of the objective function and inequality constraints are employed to describe the dynamics of the proposed neural network. It is proved that the equilibrium point set of the proposed neural network is equivalent to the optimal solution of the original optimization problem by using the Lagrangian saddle-point theorem. Under weak conditions, the proposed neural network is proved to be stable, and the state of the neural network is convergent to one of its equilibrium points. Compared with the existing neural network models for non-smooth optimization problems, the proposed neural network can deal with a larger class of constraints and is not based on the penalty method. Finally, the proposed neural network is used to solve the identification problem of genetic regulatory networks, which can be transformed into a non-smooth convex optimization problem. The simulation results show the satisfactory identification accuracy, which demonstrates the effectiveness and efficiency of the proposed approach.
Visualization of protein interaction networks: problems and solutions
Directory of Open Access Journals (Sweden)
Agapito Giuseppe
2013-01-01
Full Text Available Abstract Background Visualization concerns the representation of data visually and is an important task in scientific research. Protein-protein interactions (PPI are discovered using either wet lab techniques, such mass spectrometry, or in silico predictions tools, resulting in large collections of interactions stored in specialized databases. The set of all interactions of an organism forms a protein-protein interaction network (PIN and is an important tool for studying the behaviour of the cell machinery. Since graphic representation of PINs may highlight important substructures, e.g. protein complexes, visualization is more and more used to study the underlying graph structure of PINs. Although graphs are well known data structures, there are different open problems regarding PINs visualization: the high number of nodes and connections, the heterogeneity of nodes (proteins and edges (interactions, the possibility to annotate proteins and interactions with biological information extracted by ontologies (e.g. Gene Ontology that enriches the PINs with semantic information, but complicates their visualization. Methods In these last years many software tools for the visualization of PINs have been developed. Initially thought for visualization only, some of them have been successively enriched with new functions for PPI data management and PIN analysis. The paper analyzes the main software tools for PINs visualization considering four main criteria: (i technology, i.e. availability/license of the software and supported OS (Operating System platforms; (ii interoperability, i.e. ability to import/export networks in various formats, ability to export data in a graphic format, extensibility of the system, e.g. through plug-ins; (iii visualization, i.e. supported layout and rendering algorithms and availability of parallel implementation; (iv analysis, i.e. availability of network analysis functions, such as clustering or mining of the graph, and the
Weinstock, Jeremiah; Burton, Steve; Rash, Carla J; Moran, Sheila; Biller, Warren; Krudelbach, Norman; Phoenix, Natalie; Morasco, Benjamin J
2011-06-01
Gambling help-lines are an essential access point, or frontline resource, for treatment seeking. This study investigated treatment engagement after calling a gambling help-line. From 2000-2007 over 2,900 unique callers were offered an in-person assessment appointment. Logistic regression analyses assessed predictors of (a) accepting the referral to the in-person assessment appointment and (b) attending the in-person assessment appointment. Over 76% of callers accepted the referral and 55% of all callers attended the in-person assessment appointment. This treatment engagement rate is higher than typically found for other help-lines. Demographic factors and clinical factors such as gender, severity of gambling problems, amount of gambling debt, and coercion by legal and social networks predicted engagement in treatment. Programmatic factors such as offering an appointment within 72 hr also aided treatment engagement. Results suggest gambling help-lines can be a convenient and confidential way for many individuals with gambling problems to access gambling-specific treatment. Alternative services such as telephone counseling may be beneficial for those who do not engage in treatment. (PsycINFO Database Record (c) 2011 APA, all rights reserved).
Directory of Open Access Journals (Sweden)
Ridho Bayuaji
2018-04-01
Full Text Available No-fines lightweight concrete wall with horizontal reinforcement refers to an alternative material for wall construction with an aim of improving the wall quality towards horizontal loads. This study is focused on artificial neural network (ANN application to predicting the deflection deformation caused by dynamic loads. The ANN method is able to capture the complex interactions among input/output variables in a system without any knowledge of interaction nature and without any explicit assumption to model form. This paper explains the existing data research, data selection and process of ANN modelling training process and validation. The results of this research show that the deformation can be predicted more accurately, simply and quickly due to the alternating horizontal loads.
An effortless hybrid method to solve economic load dispatch problem in power systems
International Nuclear Information System (INIS)
Pourakbari-Kasmaei, M.; Rashidi-Nejad, M.
2011-01-01
Highlights: → We proposed a fast method to get feasible solution and avoid futile search. → The method dramatically improves search efficiency and solution quality. → Applied to solve constrained ED problems of power systems with 6 and 15 unit. → Superiority of this method in both aspects of financial and CPU time is remarkable. - Abstract: This paper proposes a new approach and coding scheme for solving economic dispatch problems (ED) in power systems through an effortless hybrid method (EHM). This novel coding scheme can effectively prevent futile searching and also prevents obtaining infeasible solutions through the application of stochastic search methods, consequently dramatically improves search efficiency and solution quality. The dominant constraint of an economic dispatch problem is power balance. The operational constraints, such as generation limitations, ramp rate limits, prohibited operating zones (POZ), network loss are considered for practical operation. Firstly, in the EHM procedure, the output of generator is obtained with a lambda iteration method and without considering POZ and later in a genetic based algorithm this constraint is satisfied. To demonstrate its efficiency, feasibility and fastness, the EHM algorithm was applied to solve constrained ED problems of power systems with 6 and 15 units. The simulation results obtained from the EHM were compared to those achieved from previous literature in terms of solution quality and computational efficiency. Results reveal that the superiority of this method in both aspects of financial and CPU time.
A new neural network model for solving random interval linear programming problems.
Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza
2017-05-01
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.
Feed Forward Neural Network and Optimal Control Problem with Control and State Constraints
Kmet', Tibor; Kmet'ová, Mária
2009-09-01
A feed forward neural network based optimal control synthesis is presented for solving optimal control problems with control and state constraints. The paper extends adaptive critic neural network architecture proposed by [5] to the optimal control problems with control and state constraints. The optimal control problem is transcribed into a nonlinear programming problem which is implemented with adaptive critic neural network. The proposed simulation method is illustrated by the optimal control problem of nitrogen transformation cycle model. Results show that adaptive critic based systematic approach holds promise for obtaining the optimal control with control and state constraints.
A Secure and Stable Multicast Overlay Network with Load Balancing for Scalable IPTV Services
Directory of Open Access Journals (Sweden)
Tsao-Ta Wei
2012-01-01
Full Text Available The emerging multimedia Internet application IPTV over P2P network preserves significant advantages in scalability. IPTV media content delivered in P2P networks over public Internet still preserves the issues of privacy and intellectual property rights. In this paper, we use SIP protocol to construct a secure application-layer multicast overlay network for IPTV, called SIPTVMON. SIPTVMON can secure all the IPTV media delivery paths against eavesdroppers via elliptic-curve Diffie-Hellman (ECDH key exchange on SIP signaling and AES encryption. Its load-balancing overlay tree is also optimized from peer heterogeneity and churn of peer joining and leaving to minimize both service degradation and latency. The performance results from large-scale simulations and experiments on different optimization criteria demonstrate SIPTVMON's cost effectiveness in quality of privacy protection, stability from user churn, and good perceptual quality of objective PSNR values for scalable IPTV services over Internet.
Modeling for the management of peak loads on a radiology image management network
International Nuclear Information System (INIS)
Dwyer, S.J.; Cox, G.G.; Templeton, A.W.; Cook, L.T.; Anderson, W.H.; Hensley, K.S.
1987-01-01
The design of a radiology image management network for a radiology department can now be assisted by a queueing model. The queueing model requires that the designers specify the following parameters: the number of tasks to be accomplished (acquisition of image data, transmission of data, archiving of data, displaying and manipulation of data, and generation of hard copies); the average times to complete each task; the patient scheduled arrival times; and the number/type of computer nodes interfaced to the network (acquisition nodes, interactive diagnostic display stations, archiving nodes, hard copy nodes, and gateways to hospital systems). The outcomes from the queuering model include mean throughput data rates and identified bottlenecks, and peak throughput data rates and identified bottlenecks. This exhibit presents the queueing model and illustrates its use in managing peak loads on an image management network
Using a multi-state recurrent neural network to optimize loading patterns in BWRs
International Nuclear Information System (INIS)
Ortiz, Juan Jose; Requena, Ignacio
2004-01-01
A Multi-State Recurrent Neural Network is used to optimize Loading Patterns (LP) in BWRs. We have proposed an energy function that depends on fuel assembly positions and their nuclear cross sections to carry out optimisation. Multi-State Recurrent Neural Networks creates LPs that satisfy the Radial Power Peaking Factor and maximize the effective multiplication factor at the Beginning of the Cycle, and also satisfy the Minimum Critical Power Ratio and Maximum Linear Heat Generation Rate at the End of the Cycle, thereby maximizing the effective multiplication factor. In order to evaluate the LPs, we have used a trained back-propagation neural network to predict the parameter values, instead of using a reactor core simulator, which saved considerable computation time in the search process. We applied this method to find optimal LPs for five cycles of Laguna Verde Nuclear Power Plant (LVNPP) in Mexico
Modified Cuckoo Search Algorithm for Solving Nonconvex Economic Load Dispatch Problems
Directory of Open Access Journals (Sweden)
Thang Trung Nguyen
2016-01-01
Full Text Available This paper presents the application of modified cuckoo search algorithm (MCSA for solving economic load dispatch (ELD problems. The MCSA method is developed to improve the search ability and solution quality of the conventional CSA method. In the MCSA, the evaluation of eggs has divided the initial eggs into two groups, the top egg group with good quality and the abandoned group with worse quality. Moreover, the value of the updated step size in MCSA is adapted as generating a new solution for the abandoned group and the top group via the Levy flights so that a large zone is searched at the beginning and a local zone is foraged as the maximum number of iterations is nearly reached. The MCSA method has been tested on different systems with different characteristics of thermal units and constraints. The result comparison with other methods in the literature has indicated that the MCSA method can be a powerful method for solving the ELD.
Prediction of the Tensile Load of Drilled CFRP by Artificial Neural Network
Directory of Open Access Journals (Sweden)
Burak Yenigun
2018-04-01
Full Text Available The application areas of carbon fiber reinforced plastics (CFRP have been increasing day by day. The machining of CFRP with incorrect machining parameters leads in huge loss cost and time. Therefore, it is very important that the composite materials are machined with correct machining parameters. The aim of this paper is to examine the influence of drilling parameters on tensile load after drilling of CFRP. The drilling operations were carried out on Computer Numerical Control (CNC by Tungsten Carbide (WC, High Speed Steel (HSS and Brad Spur type drill bits with spindle speeds of 1000, 3000 and 5000 rpm and feed rates of 0.05, 0.10 and 0.15 mm/rev. The results indicate that the surface roughness, delamination and thrust force, were affected by drilling parameters therefore tensile load was also affected by the same parameters. It was observed that increase in surface roughness, delamination and thrust force all lead to the decrease of tensile load of CFRP. If the correct drilling parameters are selected; the decrease in tensile load of CFRP can be saved up to 25%. Furthermore, an artificial neural network (ANN model has been used to predict of tensile load. The results of the ANN model are in close agreement with the experimental results.
Parametric analysis of parameters for electrical-load forecasting using artificial neural networks
Gerber, William J.; Gonzalez, Avelino J.; Georgiopoulos, Michael
1997-04-01
Accurate total system electrical load forecasting is a necessary part of resource management for power generation companies. The better the hourly load forecast, the more closely the power generation assets of the company can be configured to minimize the cost. Automating this process is a profitable goal and neural networks should provide an excellent means of doing the automation. However, prior to developing such a system, the optimal set of input parameters must be determined. The approach of this research was to determine what those inputs should be through a parametric study of potentially good inputs. Input parameters tested were ambient temperature, total electrical load, the day of the week, humidity, dew point temperature, daylight savings time, length of daylight, season, forecast light index and forecast wind velocity. For testing, a limited number of temperatures and total electrical loads were used as a basic reference input parameter set. Most parameters showed some forecasting improvement when added individually to the basic parameter set. Significantly, major improvements were exhibited with the day of the week, dew point temperatures, additional temperatures and loads, forecast light index and forecast wind velocity.
Influence of Load Modes on Voltage Stability of Receiving Network at DC/AC System
Directory of Open Access Journals (Sweden)
Mao Chizu
2016-01-01
Full Text Available This paper analyses influence of load modes on DC/AC system. Because of widespread use of HVDC, DC/AC system become more complex than before and the present modes used in dispatch and planning departments are not fit in simulation anymore. So it is necessary to find load modes accurately reflecting characteristics of the system. For the sake of the voltage stability, commutation failure, etc. the practical example of the receiving network in a large DC/AC system in China is simulated with BPA, and the influence of Classical Load Mode (CLM and Synthesis load model (SLM on simulation results is studies. Furthermore, some important parameters of SLM are varied respectively among an interval to analyse how they affect the system. According to this practical examples, the result is closely related to load modes and their parameters, and SLM is more conservative but more reasonable than the present modes. The consequences indicate that at critical states, micro variation in parameters may give rise to change in simulation results radically. Thus, correct mode and parameters are important to enhance simulation accuracy of DC/AC system and researches on how they affect the system make senses.
FCL: A solution to fault current problems in DC networks
International Nuclear Information System (INIS)
Cointe, Y; Tixador, P; Villard, C
2008-01-01
Within the context of the electric power market liberalization, DC networks have many interests compared to AC ones. New energy landscapes open the way of a diversified production. Innovative interconnection diagrams, in particular using DC buses, are under development. In this case it is not possible to defer the fault current interruption in the AC side. DC fault current cutting remains a difficult problem. FCLs (Fault Current Limiters) enable to limit the current to a preset value, lower than the theoretical short-circuit current. For this application Coated Conductors (CC) offer an excellent opportunity. Due to these promising characteristics we build a test bench and work on the implementation of these materials. The test bench is composed by 10 power amplifiers, to reach 4 kVA in many configurations of current and voltage. We carried out limiting experiments on DyBaCuO CC from EHTS, samples are about five centimeters long and many potential measuring points are pasted on the shunt to estimate the quench homogeneity. Thermal phenomena in FCLs are essential, numerical models are important to calculate the maximum temperatures. To validate these models we measure the CC temperature by depositing thermal sensors (Cu resistance) above the shunt layer and the substrate. An electrical insulation with a low thermal resistivity between the CC and the sensors is necessary. We use a thin layer of Parylene because of its good mechanical and electrical insulation properties at low temperature. The better quench behaviour of CC for temperatures close to the critical temperature has been confirmed. The measurements are in good agreement with simulations, this validates the thermal models
Problems in the design of multifunction meteor-radar networks
Nechitailenko, V. A.; Voloshchuk, Iu. I.
The design of meteor-radar networks is examined in connection with the need to conduct experiments on a mass scale in meteor geophysics and astronomy. Attention is given to network architecture features and procedures of communication-path selection in the organization of information transfer, with allowance for the features of the meteor communication link. The meteor link is considered as the main means to ensure traffic in the meteor-radar network.
Self-teaching neural network learns difficult reactor control problem
International Nuclear Information System (INIS)
Jouse, W.C.
1989-01-01
A self-teaching neural network used as an adaptive controller quickly learns to control an unstable reactor configuration. The network models the behavior of a human operator. It is trained by allowing it to operate the reactivity control impulsively. It is punished whenever either the power or fuel temperature stray outside technical limits. Using a simple paradigm, the network constructs an internal representation of the punishment and of the reactor system. The reactor is constrained to small power orbits
Kazuya Odagiri; Shogo Shimizu; Naohiro Ishii
2016-01-01
In the current Internet-based systems, there are many problems using anonymity of the network communication such as personal information leak and crimes using the Internet systems. This is because the TCP/IP protocol used in Internet systems does not have the user identification information on the communication data, and it is difficult to supervise the user performing the above acts immediately. As a solution for solving the above problem, there is the approach of Policy-based Ne...
Directory of Open Access Journals (Sweden)
José Raúl Castro
2016-02-01
Full Text Available This paper presents an efficient algorithm to solve the multi-objective (MO voltage control problem in distribution networks. The proposed algorithm minimizes the following three objectives: voltage variation on pilot buses, reactive power production ratio deviation, and generator voltage deviation. This work leverages two optimization techniques: fuzzy logic to find the optimum value of the reactive power of the distributed generation (DG and Pareto optimization to find the optimal value of the pilot bus voltage so that this produces lower losses under the constraints that the voltage remains within established limits. Variable loads and DGs are taken into account in this paper. The algorithm is tested on an IEEE 13-node test feeder and the results show the effectiveness of the proposed model.
Insights and issues with simulating terrestrial DOC loading of Arctic river networks.
Kicklighter, David W; Hayes, Daniel J; McClelland, James W; Peterson, Bruce J; McGuire, A David; Melillo, Jerry M
2013-12-01
Terrestrial carbon dynamics influence the contribution of dissolved organic carbon (DOC) to river networks in addition to hydrology. In this study, we use a biogeochemical process model to simulate the lateral transfer of DOC from land to the Arctic Ocean via riverine transport. We estimate that, over the 20th century, the pan-Arctic watershed has contributed, on average, 32 Tg C/yr of DOC to river networks emptying into the Arctic Ocean with most of the DOC coming from the extensive area of boreal deciduous needle-leaved forests and forested wetlands in Eurasian watersheds. We also estimate that the rate of terrestrial DOC loading has been increasing by 0.037 Tg C/yr2 over the 20th century primarily as a result of climate-induced increases in water yield. These increases have been offset by decreases in terrestrial DOC loading caused by wildfires. Other environmental factors (CO2 fertilization, ozone pollution, atmospheric nitrogen deposition, timber harvest, agriculture) are estimated to have relatively small effects on terrestrial DOC loading to Arctic rivers. The effects of the various environmental factors on terrestrial carbon dynamics have both offset and enhanced concurrent effects on hydrology to influence terrestrial DOC loading and may be changing the relative importance of terrestrial carbon dynamics on this carbon flux. Improvements in simulating terrestrial DOC loading to pan-Arctic rivers in the future will require better information on the production and consumption of DOC within the soil profile, the transfer of DOC from land to headwater streams, the spatial distribution of precipitation and its temporal trends, carbon dynamics of larch-dominated ecosystems in eastern Siberia, and the role of industrial organic effluents on carbon budgets of rivers in western Russia.
Insights and issues with simulating terrestrial DOC loading of Arctic river networks
Kicklighter, David W.; Hayes, Daniel J.; McClelland, James W.; Peterson, Bruce J.; McGuire, A. David; Melillo, Jerry M.
2013-01-01
Terrestrial carbon dynamics inﬂuence the contribution of dissolved organic carbon (DOC) to river networks in addition to hydrology. In this study, we use a biogeochemical process model to simulate the lateral transfer of DOC from land to the Arctic Ocean via riverine transport. We estimate that, over the 20th century, the pan-Arctic watershed has contributed, on average, 32 Tg C/yr of DOC to river networks emptying into the Arctic Ocean with most of the DOC coming from the extensive area of boreal deciduous needle-leaved forests and forested wetlands in Eurasian watersheds. We also estimate that the rate of terrestrial DOC loading has been increasing by 0.037 Tg C/yr2 over the 20th century primarily as a result of climate-induced increases in water yield. These increases have been offset by decreases in terrestrial DOC loading caused by wildﬁres. Other environmental factors (CO2 fertilization, ozone pollution, atmospheric nitrogen deposition, timber harvest, agriculture) are estimated to have relatively small effects on terrestrial DOC loading to Arctic rivers. The effects of the various environmental factors on terrestrial carbon dynamics have both offset and enhanced concurrent effects on hydrology to inﬂuence terrestrial DOC loading and may be changing the relative importance of terrestrial carbon dynamics on this carbon ﬂux. Improvements in simulating terrestrial DOC loading to pan-Arctic rivers in the future will require better information on the production and consumption of DOC within the soil proﬁle, the transfer of DOC from land to headwater streams, the spatial distribution of precipitation and its temporal trends, carbon dynamics of larch-dominated ecosystems in eastern Siberia, and the role of industrial organic efﬂuents on carbon budgets of rivers in western Russia.
Dynamic shortest path problems : hybrid routing policies considering network disruptions
Sever, D.; Dellaert, N.P.; Woensel, van T.; Kok, de A.G.
2013-01-01
Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known link disruption
International Nuclear Information System (INIS)
Gherbi, Chirihane; Aliouat, Zibouda; Benmohammed, Mohamed
2016-01-01
Clustering is a well known approach to cope with large nodes density and efficiently conserving energy in Wireless Sensor Networks (WSN). Load balancing is an effective approach for optimizing resources like channel bandwidth, the main objective of this paper is to combine these two valuable approaches in order to significantly improve the main WSN service such as information routing. So, our proposal is a routing protocol in which load traffic is shared among cluster members in order to reduce the dropping probability due to queue overflow at some nodes. To this end, a novel hierarchical approach, called Hierarchical Energy-Balancing Multipath routing protocol for Wireless Sensor Networks (HEBM) is proposed. The HEBM approach aims to fulfill the following purposes: decreasing the overall network energy consumption, balancing the energy dissipation among the sensor nodes and as direct consequence: extending the lifetime of the network. In fact, the cluster-heads are optimally determined and suitably distributed over the area of interest allowing the member nodes reaching them with adequate energy dissipation and appropriate load balancing utilization. In addition, nodes radio are turned off for fixed time duration according to sleeping control rules optimizing so their energy consumption. The performance evaluation of the proposed protocol is carried out through the well-known NS2 simulator and the exhibited results are convincing. Like this, the residual energy of sensor nodes was measured every 20 s throughout the duration of simulation, in order to calculate the total number of alive nodes. Based on the simulation results, we concluded that our proposed HEBM protocol increases the profit of energy, and prolongs the network lifetime duration from 32% to 40% compared to DEEAC reference protocol and from 25% to 28% compared to FEMCHRP protocol. The authors also note that the proposed protocol is 41.7% better than DEEAC with respect to FND (Fist node die), and 25
Short-Term Power Load Point Prediction Based on the Sharp Degree and Chaotic RBF Neural Network
Directory of Open Access Journals (Sweden)
Dongxiao Niu
2015-01-01
Full Text Available In order to realize the predicting and positioning of short-term load inflection point, this paper made reference to related research in the field of computer image recognition. It got a load sharp degree sequence by the transformation of the original load sequence based on the algorithm of sharp degree. Then this paper designed a forecasting model based on the chaos theory and RBF neural network. It predicted the load sharp degree sequence based on the forecasting model to realize the positioning of short-term load inflection point. Finally, in the empirical example analysis, this paper predicted the daily load point of a region using the actual load data of the certain region to verify the effectiveness and applicability of this method. Prediction results showed that most of the test sample load points could be accurately predicted.
Lee, Casey J.; Murphy, Jennifer C.; Crawford, Charles G.; Deacon, Jeffrey R.
2017-10-24
The U.S. Geological Survey publishes information on concentrations and loads of water-quality constituents at 111 sites across the United States as part of the U.S. Geological Survey National Water Quality Network (NWQN). This report details historical and updated methods for computing water-quality loads at NWQN sites. The primary updates to historical load estimation methods include (1) an adaptation to methods for computing loads to the Gulf of Mexico; (2) the inclusion of loads computed using the Weighted Regressions on Time, Discharge, and Season (WRTDS) method; and (3) the inclusion of loads computed using continuous water-quality data. Loads computed using WRTDS and continuous water-quality data are provided along with those computed using historical methods. Various aspects of method updates are evaluated in this report to help users of water-quality loading data determine which estimation methods best suit their particular application.
Directory of Open Access Journals (Sweden)
Ranbir Singh
2016-04-01
Full Text Available Flexible manufacturing system (FMS promises a wide range of manufacturing benefits in terms of flexibility and productivity. These benefits are targeted by efficient production planning. Part type selection, machine grouping, deciding production ratio, resource allocation and machine loading are five identified production planning problems. Machine loading is the most identified complex problem solved with aid of computers. System up gradation and newer technology adoption are the primary needs of efficient FMS generating new scopes of research in the field. The literature review is carried and the critical analysis is being executed in the present work. This paper presents the outcomes of the mathematical modelling techniques for loading of machines in FMS’s. It was also analysed that the mathematical modelling is necessary for accurate and reliable analysis for practical applications. However, excessive computations need to be avoided and heuristics have to be used for real-world problems. This paper presents the heuristics-mathematical modelling of loading problem with machine processing time as primary input. The aim of the present work is to solve a real-world machine loading problem with an objective of balancing the workload of the FMS with decreased computational time. A Matlab code is developed for the solution and the results are found most accurate and reliable as presented in the paper.
Least loaded and route fragmentation aware RSA strategies for elastic optical networks
Batham, Deepak; Yadav, Dharmendra Singh; Prakash, Shashi
2017-12-01
Elastic optical networks (EONs) provide flexibility to assign wide range of spectral resources to the connection requests. In this manuscript, we address two issues related to spectrum assignment in EONs: the non uniform spectrum assignment along different links of the route and the spectrum fragmentation in the network. To address these issues, two routing and spectrum assignment (RSA) strategies have been proposed: Least Loaded RSA (LLRSA) and Route Fragmentation Aware RSA (RFARSA). The LLRSA allocates spectrum homogeneously along different links in the network, where as RFARSA accords priority to the routes which are less fragmented. To highlight the salient features of the two strategies, two new metrics, route fragmentation index (RFI) and standard deviation (SD) are introduced. RFI is defined as the ratio of non-contiguous FSs to the total available free FSs on the route, and SD relates to the measure of non-uniformity in the allocation of resources on the links in the network. A simulation program has been developed to evaluate the performance of the proposed (LLRSA and RFARSA) strategies, and the existing strategies of shortest path RSA (SPRSA) and spectrum compactness based defragmentation (SCD) strategies, on the metric of RFI, bandwidth blocking probability (BBP), network capacity utilized, and SD. The variation in the metrics on the basis of number of requests and the bandwidth (number of FSs) requested has been studied. It has been conclusively established that the proposed strategies (LLRSA and RFARSA) outperform the existing strategies in terms of all the metrics.
Directory of Open Access Journals (Sweden)
Jaime Buitrago
2017-01-01
Full Text Available Short-term load forecasting is crucial for the operations planning of an electrical grid. Forecasting the next 24 h of electrical load in a grid allows operators to plan and optimize their resources. The purpose of this study is to develop a more accurate short-term load forecasting method utilizing non-linear autoregressive artificial neural networks (ANN with exogenous multi-variable input (NARX. The proposed implementation of the network is new: the neural network is trained in open-loop using actual load and weather data, and then, the network is placed in closed-loop to generate a forecast using the predicted load as the feedback input. Unlike the existing short-term load forecasting methods using ANNs, the proposed method uses its own output as the input in order to improve the accuracy, thus effectively implementing a feedback loop for the load, making it less dependent on external data. Using the proposed framework, mean absolute percent errors in the forecast in the order of 1% have been achieved, which is a 30% improvement on the average error using feedforward ANNs, ARMAX and state space methods, which can result in large savings by avoiding commissioning of unnecessary power plants. The New England electrical load data are used to train and validate the forecast prediction.
A neutral network based technique for short-term forecasting of anomalous load periods
Energy Technology Data Exchange (ETDEWEB)
Sforna, M [ENEL, s.p.a, Italian Power Company (Italy); Lamedica, R; Prudenzi, A [Rome Univ. ` La Sapienza` , Rome (Italy); Caciotta, M; Orsolini Cencelli, V [Rome Univ. III, Rome (Italy)
1995-01-01
The paper illustrates a part of the research activity conducted by authors in the field of electric Short Term Load Forecasting (STLF) based on Artificial Neural Network (ANN) architectures. Previous experiences with basic ANN architectures have shown that, even though these architecture provide results comparable with those obtained by human operators for most normal days, they evidence some accuracy deficiencies when applied to `anomalous` load conditions occurring during holidays and long weekends. For these periods a specific procedure based upon a combined (unsupervised/supervised) approach has been proposed. The unsupervised stage provides a preventive classification of the historical load data by means of a Kohonen`s Self Organizing Map (SOM). The supervised stage, performing the proper forecasting activity, is obtained by using a multi-layer percept ron with a back propagation learning algorithm similar to the ones above mentioned. The unconventional use of information deriving from the classification stage permits the proposed procedure to obtain a relevant enhancement of the forecast accuracy for anomalous load situations.
Omega-Harmonic Functions and Inverse Conductivity Problems on Networks
National Research Council Canada - National Science Library
Berenstein, Carlos A; Chung, Soon-Yeong
2003-01-01
.... To do this, they introduce an elliptic operator DELTA omega and an omega-harmonic function on the graph, with its physical interpretation being the diffusion equation on the graph, which models an electric network...
Kim, Jeong-Nam
2018-01-01
This special issue of Health Communication compiles 10 articles to laud the promise and yet confront the problems in the digital networked information society related to public health. We present this anthology of symphony and cacophony of lay individuals' communicative actions in a digital networked information society. The collection of problems and promise of the new digital world may be a cornerstone joining two worlds-pre- and postdigital network society-and we hope this special issue will help better shape our future states of public health.
Second-order design problem in the Ancona geodetic network
International Nuclear Information System (INIS)
Baldi, P.; Ferrari, G.; Postpischl, D.; Unguendoli, M.
1980-01-01
In this note an examination is made of the control network installed in the Ancona area in 1975 for seismotectonic studies. From an analysis of the network there arises the possibility of achieving a considerable improvement in the results by considering a plan of work derived from the a priori analysis of the covariance matrix and improving the atmospheric data fo the correction of electronic distance measurements, by the use of meteorological balloons. (author)
An analogue of Morse theory for planar linear networks and the generalized Steiner problem
International Nuclear Information System (INIS)
Karpunin, G A
2000-01-01
A study is made of the generalized Steiner problem: the problem of finding all the locally minimal networks spanning a given boundary set (terminal set). It is proposed to solve this problem by using an analogue of Morse theory developed here for planar linear networks. The space K of all planar linear networks spanning a given boundary set is constructed. The concept of a critical point and its index is defined for the length function l of a planar linear network. It is shown that locally minimal networks are local minima of l on K and are critical points of index 1. The theorem is proved that the sum of the indices of all the critical points is equal to χ(K)=1. This theorem is used to find estimates for the number of locally minimal networks spanning a given boundary set
Automated system for load flow prediction in power substations using artificial neural networks
Directory of Open Access Journals (Sweden)
Arlys Michel Lastre Aleaga
2015-09-01
Full Text Available The load flow is of great importance in assisting the process of decision making and planning of generation, distribution and transmission of electricity. Ignorance of the values in this indicator, as well as their inappropriate prediction, difficult decision making and efficiency of the electricity service, and can cause undesirable situations such as; the on demand, overheating of the components that make up a substation, and incorrect planning processes electricity generation and distribution. Given the need for prediction of flow of electric charge of the substations in Ecuador this research proposes the concept for the development of an automated prediction system employing the use of Artificial Neural Networks.
Application of high-resolution domestic electricity load profiles in network modelling
DEFF Research Database (Denmark)
Marszal, Anna Joanna; Mendaza, Iker Diaz de Cerio; Heiselberg, Per Kvols
2016-01-01
the generated profiles are inputted in a low-voltage network model created in DIgSILENT PowerFactory. By means of employing 1 hour based demand and generation profiles in during dynamic studies, the representation of the local power system performance might sometimes not be as accurate as needed. In the test...... with modeling when 1-minute domestic electricity demand and generation profiles are used as inputs. The analysis is done with a case study of low-voltage network located in Northern Denmark. The analysis includes two parts. The first part focuses on modeling the domestic demands and on-site generation in 1......-minute resolution. The load profiles of the household appliances are created using a bottom-up model, which uses the 1-minute cycle power use characteristics of a single appliance as the main building block. The profiles of heavy electric appliances, such as heat pump, are not included in the above...
Directory of Open Access Journals (Sweden)
Muthukkumar R.
2017-04-01
Full Text Available Cognitive Radio (CR is a promising and potential technique to enable secondary users (SUs or unlicenced users to exploit the unused spectrum resources effectively possessed by primary users (PUs or licenced users. The proven clustering approach is used to organize nodes in the network into the logical groups to attain energy efficiency, network scalability, and stability for improving the sensing accuracy in CR through cooperative spectrum sensing (CSS. In this paper, a distributed dynamic load balanced clustering (DDLBC algorithm is proposed. In this algorithm, each member in the cluster is to calculate the cooperative gain, residual energy, distance, and sensing cost from the neighboring clusters to perform the optimal decision. Each member in a cluster participates in selecting a cluster head (CH through cooperative gain, and residual energy that minimises network energy consumption and enhances the channel sensing. First, we form the number of clusters using the Markov decision process (MDP model to reduce the energy consumption in a network. In this algorithm, CR users effectively utilize the PUs reporting time slots of unavailability. The simulation results reveal that the clusters convergence, energy efficiency, and accuracy of channel sensing increased considerably by using the proposed algorithm.
Directory of Open Access Journals (Sweden)
Muthukkumar R.
2016-07-01
Full Text Available Cognitive Radio (CR is a promising and potential technique to enable secondary users (SUs or unlicenced users to exploit the unused spectrum resources effectively possessed by primary users (PUs or licenced users. The proven clustering approach is used to organize nodes in the network into the logical groups to attain energy efficiency, network scalability, and stability for improving the sensing accuracy in CR through cooperative spectrum sensing (CSS. In this paper, a distributed dynamic load balanced clustering (DDLBC algorithm is proposed. In this algorithm, each member in the cluster is to calculate the cooperative gain, residual energy, distance, and sensing cost from the neighboring clusters to perform the optimal decision. Each member in a cluster participates in selecting a cluster head (CH through cooperative gain, and residual energy that minimises network energy consumption and enhances the channel sensing. First, we form the number of clusters using the Markov decision process (MDP model to reduce the energy consumption in a network. In this algorithm, CR users effectively utilize the PUs reporting time slots of unavailability. The simulation results reveal that the clusters convergence, energy efficiency, and accuracy of channel sensing increased considerably by using the proposed algorithm.
Bilevel programming problems theory, algorithms and applications to energy networks
Dempe, Stephan; Pérez-Valdés, Gerardo A; Kalashnykova, Nataliya; Kalashnikova, Nataliya
2015-01-01
This book describes recent theoretical findings relevant to bilevel programming in general, and in mixed-integer bilevel programming in particular. It describes recent applications in energy problems, such as the stochastic bilevel optimization approaches used in the natural gas industry. New algorithms for solving linear and mixed-integer bilevel programming problems are presented and explained.
Efficient Load Scheduling Method For Power Management
Directory of Open Access Journals (Sweden)
Vijo M Joy
2015-08-01
Full Text Available An efficient load scheduling method to meet varying power supply needs is presented in this paper. At peak load times the power generation system fails due to its instability. Traditionally we use load shedding process. In load shedding process disconnect the unnecessary and extra loads. The proposed method overcomes this problem by scheduling the load based on the requirement. Artificial neural networks are used for this optimal load scheduling process. For generate economic scheduling artificial neural network has been used because generation of power from each source is economically different. In this the total load required is the inputs of this network and the power generation from each source and power losses at the time of transmission are the output of the neural network. Training and programming of the artificial neural networks are done using MATLAB.
Vilmin, Lauriane; Mogollón, José M.; Beusen, Arthur H. W.; Bouwman, Alexander F.
2018-04-01
Nitrogen (N) and phosphorus (P) play a major role in the biogeochemical functioning of aquatic systems. N and P transfer to surface freshwaters has amplified during the 20th century, which has led to widespread eutrophication problems. The contribution of different sources, natural and anthropogenic, to total N and P loading to river networks has recently been estimated yearly using the Integrated Model to Assess the Global Environment - Global Nutrient Model (IMAGE-GNM). However, eutrophic events generally result from a combination of physicochemical conditions governed by hydrological dynamics and the availability of specific nutrient forms that vary at subyearly timescales. In the present study, we define for each simulated nutrient source: i) its speciation, and ii) its subannual temporal pattern. Thereby, we simulate the monthly loads of different N (ammonium, nitrate + nitrite, and organic N) and P forms (dissolved and particulate inorganic P, and organic P) to global river networks over the whole 20th century at a half-degree spatial resolution. Results indicate that, together with an increase in the delivery of all nutrient forms to global rivers, the proportion of inorganic forms in total N and P inputs has risen from 30 to 43% and from 56 to 65%, respectively. The high loads originating from fertilized agricultural lands and the increasing proportion of sewage inputs have led to a greater proportion of DIN forms (ammonium and nitrate), that are usually more bioavailable. Soil loss from agricultural lands, which delivers large amounts of particle-bound inorganic P to surface freshwaters, has become the dominant P source, which is likely to lead to an increased accumulation of legacy P in slow flowing areas (e.g., lakes and reservoirs). While the TN:TP ratio of the loads has remained quite stable, the DIN:DIP molar ratio, which is likely to affect algal development the most, has increased from 18 to 27 globally. Human activities have also affected the
A matheuristic for the liner shipping network design problem
DEFF Research Database (Denmark)
Brouer, Berit Dangaard; Desaulniers, Guy; Pisinger, David
2014-01-01
, while minimizing the cost of operating the network. Liner shipping companies publish a set of routes with a time schedule, and it is an industry standard to have a weekly departure at each port call on a route. A weekly frequency is achieved by deploying several vessels to a single route, respecting...
Analyzing Human Communication Networks in Organizations: Applications to Management Problems.
Farace, Richard V.; Danowski, James A.
Investigating the networks of communication in organizations leads to an understanding of efficient and inefficient information dissemination as practiced in large systems. Most important in organizational communication is the role of the "liaison person"--the coordinator of intercommunication. When functioning efficiently, coordinators maintain…
Inverse problems in eddy current testing using neural network
Yusa, N.; Cheng, W.; Miya, K.
2000-05-01
Reconstruction of crack in conductive material is one of the most important issues in the field of eddy current testing. Although many attempts to reconstruct cracks have been made, most of them deal with only artificial cracks machined with electro-discharge. However, in the case of natural cracks like stress corrosion cracking or inter-granular attack, there must be contact region and therefore their conductivity is not necessarily zero. In this study, an attempt to reconstruct natural cracks using neural network is presented. The neural network was trained through numerical simulated data obtained by the fast forward solver that calculated unflawed potential data a priori to save computational time. The solver is based on A-φ method discretized by using FEM-BEM A natural crack was modeled as an area whose conductivity was less than that of a specimen. The distribution of conductivity in that area was reconstructed as well. It took much time to train the network, but the speed of reconstruction was extremely fast after once it was trained. Well-trained network gave good reconstruction result.
Energy Technology Data Exchange (ETDEWEB)
Cottrell, R.Les; Logg, Connie; Chhaparia, Mahesh; /SLAC; Grigoriev, Maxim; /Fermilab; Haro, Felipe; /Chile U., Catolica; Nazir, Fawad; /NUST, Rawalpindi; Sandford, Mark
2006-01-25
End-to-End fault and performance problems detection in wide area production networks is becoming increasingly hard as the complexity of the paths, the diversity of the performance, and dependency on the network increase. Several monitoring infrastructures are built to monitor different network metrics and collect monitoring information from thousands of hosts around the globe. Typically there are hundreds to thousands of time-series plots of network metrics which need to be looked at to identify network performance problems or anomalous variations in the traffic. Furthermore, most commercial products rely on a comparison with user configured static thresholds and often require access to SNMP-MIB information, to which a typical end-user does not usually have access. In our paper we propose new techniques to detect network performance problems proactively in close to realtime and we do not rely on static thresholds and SNMP-MIB information. We describe and compare the use of several different algorithms that we have implemented to detect persistent network problems using anomalous variations analysis in real end-to-end Internet performance measurements. We also provide methods and/or guidance for how to set the user settable parameters. The measurements are based on active probes running on 40 production network paths with bottlenecks varying from 0.5Mbits/s to 1000Mbit/s. For well behaved data (no missed measurements and no very large outliers) with small seasonal changes most algorithms identify similar events. We compare the algorithms' robustness with respect to false positives and missed events especially when there are large seasonal effects in the data. Our proposed techniques cover a wide variety of network paths and traffic patterns. We also discuss the applicability of the algorithms in terms of their intuitiveness, their speed of execution as implemented, and areas of applicability. Our encouraging results compare and evaluate the accuracy of our
Artificial neural network (ANN)-based prediction of depth filter loading capacity for filter sizing.
Agarwal, Harshit; Rathore, Anurag S; Hadpe, Sandeep Ramesh; Alva, Solomon J
2016-11-01
This article presents an application of artificial neural network (ANN) modelling towards prediction of depth filter loading capacity for clarification of a monoclonal antibody (mAb) product during commercial manufacturing. The effect of operating parameters on filter loading capacity was evaluated based on the analysis of change in the differential pressure (DP) as a function of time. The proposed ANN model uses inlet stream properties (feed turbidity, feed cell count, feed cell viability), flux, and time to predict the corresponding DP. The ANN contained a single output layer with ten neurons in hidden layer and employed a sigmoidal activation function. This network was trained with 174 training points, 37 validation points, and 37 test points. Further, a pressure cut-off of 1.1 bar was used for sizing the filter area required under each operating condition. The modelling results showed that there was excellent agreement between the predicted and experimental data with a regression coefficient (R 2 ) of 0.98. The developed ANN model was used for performing variable depth filter sizing for different clarification lots. Monte-Carlo simulation was performed to estimate the cost savings by using different filter areas for different clarification lots rather than using the same filter area. A 10% saving in cost of goods was obtained for this operation. © 2016 American Institute of Chemical Engineers Biotechnol. Prog., 32:1436-1443, 2016. © 2016 American Institute of Chemical Engineers.
Parallel algorithms for network routing problems and recurrences
International Nuclear Information System (INIS)
Wisniewski, J.A.; Sameh, A.H.
1982-01-01
In this paper, we consider the parallel solution of recurrences, and linear systems in the regular algebra of Carre. These problems are equivalent to solving the shortest path problem in graph theory, and they also arise in the analysis of Fortran programs. Our methods for solving linear systems in the regular algebra are analogues of well-known methods for solving systems of linear algebraic equations. A parallel version of Dijkstra's method, which has no linear algebraic analogue, is presented. Considerations for choosing an algorithm when the problem is large and sparse are also discussed
Qin, Sitian; Yang, Xiudong; Xue, Xiaoping; Song, Jiahui
2017-10-01
Pseudoconvex optimization problem, as an important nonconvex optimization problem, plays an important role in scientific and engineering applications. In this paper, a recurrent one-layer neural network is proposed for solving the pseudoconvex optimization problem with equality and inequality constraints. It is proved that from any initial state, the state of the proposed neural network reaches the feasible region in finite time and stays there thereafter. It is also proved that the state of the proposed neural network is convergent to an optimal solution of the related problem. Compared with the related existing recurrent neural networks for the pseudoconvex optimization problems, the proposed neural network in this paper does not need the penalty parameters and has a better convergence. Meanwhile, the proposed neural network is used to solve three nonsmooth optimization problems, and we make some detailed comparisons with the known related conclusions. In the end, some numerical examples are provided to illustrate the effectiveness of the performance of the proposed neural network.
DEFF Research Database (Denmark)
Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee
2011-01-01
In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing...... protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming...
Multivariate exploration of non-intrusive load monitoring via spatiotemporal pattern network
Energy Technology Data Exchange (ETDEWEB)
Liu, Chao; Akintayo, Adedotun; Jiang, Zhanhong; Henze, Gregor P.; Sarkar, Soumik
2018-02-01
Non-intrusive load monitoring (NILM) of electrical demand for the purpose of identifying load components has thus far mostly been studied using univariate data, e.g., using only whole building electricity consumption time series to identify a certain type of end-use such as lighting load. However, using additional variables in the form of multivariate time series data may provide more information in terms of extracting distinguishable features in the context of energy disaggregation. In this work, a novel probabilistic graphical modeling approach, namely the spatiotemporal pattern network (STPN) is proposed for energy disaggregation using multivariate time-series data. The STPN framework is shown to be capable of handling diverse types of multivariate time-series to improve the energy disaggregation performance. The technique outperforms the state of the art factorial hidden Markov models (FHMM) and combinatorial optimization (CO) techniques in multiple real-life test cases. Furthermore, based on two homes' aggregate electric consumption data, a similarity metric is defined for the energy disaggregation of one home using a trained model based on the other home (i.e., out-of-sample case). The proposed similarity metric allows us to enhance scalability via learning supervised models for a few homes and deploying such models to many other similar but unmodeled homes with significantly high disaggregation accuracy.
A Bankruptcy Problem Approach to Load-shedding in Multiagent-based Microgrid Operation
Kim, Hak-Man; Kinoshita, Tetsuo; Lim, Yujin; Kim, Tai-Hoon
2010-01-01
A microgrid is composed of distributed power generation systems (DGs), distributed energy storage devices (DSs), and loads. To maintain a specific frequency in the islanded mode as an important requirement, the control of DGs’ output and charge action of DSs are used in supply surplus conditions and load-shedding and discharge action of DSs are used in supply shortage conditions. Recently, multiagent systems for autonomous microgrid operation have been studied. Especially, load-shedding, whi...
Paas, Fred G.W.C.; van Merrienboer, Jeroen J.G.; van Merrienboer, J.J.G.
1994-01-01
Four computer-based training strategies for geometrical problem solving in the domain of computer numerically controlled machinery programming were studied with regard to their effects on training performance, transfer performance, and cognitive load. A low- and a high-variability conventional
Battley, PF; Rogers, DI; Piersma, T; Koolhaas, A; Battley, Phil F.; Rogers, Danny I.
2003-01-01
Migratory shorebirds that live in the tropics prior to embarking on long (> 5000 km) flights may face heat-load problems. The behaviour of a large sandpiper, the Great Knot (Calidris tenuirostris), was studied in Roebuck Bay, north-west Australia, from February to April 2000. We determined the
Application of neural networks and cellular automata to calorimetric problems
Energy Technology Data Exchange (ETDEWEB)
Brenton, V; Fonvieille, H; Guicheney, C; Jousset, J; Roblin, Y; Tamin, F; Grenier, P
1994-09-01
Computing techniques based on parallel processing have been used to treat the information from the electromagnetic calorimeters in SLAC experiments E142/E143. Cluster finding and separation of overlapping showers are performed by a cellular automaton, pion and electron identification is done by using a multilayered neural network. Both applications are presented and their resulting performances are shown to be improved compared to more standard approaches. (author). 9 refs.; Submitted to Nuclear Instruments and Methods (NL).
Application of neural networks and cellular automata to calorimetric problems
International Nuclear Information System (INIS)
Brenton, V.; Fonvieille, H.; Guicheney, C.; Jousset, J.; Roblin, Y.; Tamin, F.; Grenier, P.
1994-09-01
Computing techniques based on parallel processing have been used to treat the information from the electromagnetic calorimeters in SLAC experiments E142/E143. Cluster finding and separation of overlapping showers are performed by a cellular automaton, pion and electron identification is done by using a multilayered neural network. Both applications are presented and their resulting performances are shown to be improved compared to more standard approaches. (author)
Analysis of multimedian problems on time dependent networks
Salman, F Sibel
1994-01-01
Ankara : The Department of Industrial Engineering and the Institute of Enginering and Science of Bilkent Univ., 1994. Thesis (Master's) -- Bilkent University, 1994. Includes bibliographical references leaves 81-85. Time dependency arises in transportation and computer-communication networks due to factors such as time varying demand, traffic intensity, and road conditions. This necessitates a locational decision to be based on an analysis involving a time horizon. In this st...
Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks
Din, Der-Rong; Huang, Jen-Shen
2014-03-01
As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100% protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.
Directory of Open Access Journals (Sweden)
M. A. Karakuts
2015-01-01
Full Text Available The basic problems of route network and aircraft fleet optimization and its role in airline strategic planning are considered. Measures to improve the methods of its implementation are proposed.
DEFF Research Database (Denmark)
Karsten, Christian Vad; Pisinger, David; Røpke, Stefan
2015-01-01
-commodity network flow problem with transit time constraints which puts limits on the duration of the transit of the commodities through the network. It is shown that for the particular application it does not increase the solution time to include the transit time constraints and that including the transit time...... is essential to offer customers a competitive product. © 2015 Elsevier Ltd. All rights reserved....
Interacting with Users in Social Networks: The Follow-back Problem
2016-05-02
These functions are known as network centrali- ties. They quantify how central a vertex is to the problem at hand, with the definition of centrality ...56 4.2.2 Twitter networks . . . . . . . . . . . . . . . . . . . . . . . . . 57 4.2.3 Network centrality policies...tool can hinder the free movement of alternative ideas and information and thus can be analyzed through the A2/AD paradigm. Non-state adversaries have
Symposium Connects Government Problems with State of the Art Network Science Research
2015-10-16
Symposium Connects Government Problems with State-of-the- Art Network Science Research By Rajmonda S. Caceres and Benjamin A. Miller Network...the US Gov- ernment, and match these with the state-of-the- art models and techniques developed in the network science research community. Since its... science has grown significantly in the last several years as a field at the intersec- tion of mathematics, computer science , social science , and engineering
Computation of optimal transport and related hedging problems via penalization and neural networks
Eckstein, Stephan; Kupper, Michael
2018-01-01
This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks. The core idea is to penalize the optimization problem in its dual formulation and reduce it to a finite dimensional one which corresponds to optimizing a neural network with smooth objective function. We present numerical examples from optimal transport, martingale optimal transport, portfolio optimization under uncertainty and generative adversa...
Brands, Ties; van Berkum, Eric C.
2014-01-01
The optimization of infrastructure planning in a multimodal network is defined as a multi-objective network design problem, with accessibility, use of urban space by parking, operating deficit and climate impact as objectives. Decision variables are the location of park and ride facilities, train
Load-aware modeling for uplink cellular networks in a multi-channel environment
AlAmmouri, Ahmad
2014-09-01
We exploit tools from stochastic geometry to develop a tractable analytical approach for modeling uplink cellular networks. The developed model is load aware and accounts for per-user power control as well as the limited transmit power constraint for the users\\' equipment (UEs). The proposed analytical paradigm is based on a simple per-user power control scheme in which each user inverts his path-loss such that the signal is received at his serving base station (BS) with a certain power threshold ρ Due to the limited transmit power of the UEs, users that cannot invert their path-loss to their serving BSs are allowed to transmit with their maximum transmit power. We show that the proposed power control scheme not only provides a balanced cell center and cell edge user performance, it also facilitates the analysis when compared to the state-of-the-art approaches in the literature. To this end, we discuss how to manipulate the design variable ρ in response to the network parameters to optimize one or more of the performance metrics such as the outage probability, the network capacity, and the energy efficiency.
Enabling Cognitive Load-Aware AR with Rateless Coding on a Wearable Network
Directory of Open Access Journals (Sweden)
R. Razavi
2008-01-01
Full Text Available Augmented reality (AR on a head-mounted display is conveniently supported by a wearable wireless network. If, in addition, the AR display is moderated to take account of the cognitive load of the wearer, then additional biosensors form part of the network. In this paper, the impact of these additional traffic sources is assessed. Rateless coding is proposed to not only protect the fragile encoded video stream from wireless noise and interference but also to reduce coding overhead. The paper proposes a block-based form of rateless channel coding in which the unit of coding is a block within a packet. The contribution of this paper is that it minimizes energy consumption by reducing the overhead from forward error correction (FEC, while error correction properties are conserved. Compared to simple packet-based rateless coding, with this form of block-based coding, data loss is reduced and energy efficiency is improved. Cross-layer organization of piggy-backed response blocks must take place in response to feedback, as detailed in the paper. Compared also to variants of its default FEC scheme, results from a Bluetooth (IEEE 802.15.1 wireless network show a consistent improvement in energy consumption, packet arrival latency, and video quality at the AR display.
Comparison of neural networks for solving the travelling salesman problem
Maire, La B.F.J.; Mladenov, V.M.
2012-01-01
The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were
Adolescent problem behavior in school : the role of peer networks
Geven, S.A.J.
2016-01-01
Adolescence is a notable period during which a considerable share of students tends to engage in problem behavior in school. Students for example skip class, fail to do their best in school, or have serious arguments with their teachers. A student’s decision to engage in such behavior is not usually
On the Integrated Job Scheduling and Constrained Network Routing Problem
DEFF Research Database (Denmark)
Gamst, Mette
This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two resource demand...
DEFF Research Database (Denmark)
Fetene, Gebeyehu Manie
The problem of peak load arises when demand fluctuates over time while the pro- duction technology is not flexible (or making it flexible is economically inefficient) and/or when a product is non-storable (or storage cost is huge). Peak load is a com- mon problem in consumption of public utilities......, on the one hand, observed cost saving benefit of postponing the time of charging to off-peak lower fee of charging and, on the other hand, the cost of delay in departure time for planned trips and uncertain cost of late charging associated with likelihood occur- rence of unanticipated trip before the car...... of electricity. The electric vehicle (EV) users choice of time of charging problem under PLP is different from that of general households using energy for house appliances since there is uncertain cost to the former as- sociated with likelihood occurrence of unanticipated trips such as visiting hospital...
Managing BTSs to Solve Handover Problem in Mobile Network
Directory of Open Access Journals (Sweden)
Wael Etaiwi
2011-01-01
Full Text Available Handover is a key solution that improves the telecommunication services using GSM by assure the continual service delivery between two mobiles regardless of location's changes of the sender or receiver, and now GSM technology becomes applicable all over the world and the customers become more satisfied to the dealer's services delivery, But Handover suffers from a major problem refers to the limitation of hardware capacity of the BTS (Base Transfer Station. This approach consists of three schemes, the first one based on reserve an extra ports for handover purposes by implementing a software solution that control BTS ports. The second alternative scheme based on channel exchange between adjacent BTSs by shifting a chosen allocated signal to another adjacent free BTS and then allocating the new signal to the new free port. The third schema depends on carrying the Handover problem to another BTS to solve it if it didn't solved in the second schema.
Jordan, Katy; Weller, Martin
2018-01-01
The web has had a profound effect on the ways people interact, with online social networks arguably playing an important role in changing or augmenting how we connect with others. However, uptake of online social networking by the academic community varies, and needs to be understood. This paper presents an independent, novel analysis of a large-scale dataset published by Nature Publishing Group detailing the results of a survey about academics use of online social networking services. An ope...
Agribusiness networks in Bulgaria: Design and creative problem-solving
Directory of Open Access Journals (Sweden)
Doitchinova Julia
2017-01-01
Full Text Available With the increasing integration of the global economy and the complex challenges of the business environment it is becoming crucial to focus and gain a full understanding on the role of the value chains' structure and functioning. This particularly refers to the countries from the post-communist Europe and their transformation and progress achieved in marketization and democratization. The present paper is purposeful towards providing an overall framework for assessment of the different forms of network structures in the agricultural sector and to identify as well their capacity to counteract market restrictions, and to benefit form the opportunities of the agribusiness development. The methodological framework bases on the transaction costs economics and the 4C concept. The paper presents methodology at two stages, where results of expert assessment and evaluation at national and regional level led to selection of three case studies to be presented in certain sectors of agribusiness.
Joint Load Balancing and Power Allocation for Hybrid VLC/RF Networks
Obeed, Mohanad; Salhab, Anas M.; Zummo, Salam A.; Alouini, Mohamed-Slim
2018-01-01
In this paper, we propose and study a new joint load balancing (LB) and power allocation (PA) scheme for a hybrid visible light communication (VLC) and radio frequency (RF) system consisting of one RF\\access point (AP) and multiple VLC\\APs. An iterative algorithm is proposed to distribute the users on the APs and distribute the powers of these APs on their users. In PA subproblem, an optimization problem is formulated to allocate the power of each AP to the connected users for the total achievable data rates maximization. It is proved that the PA optimization problem is concave but not easy to tackle. Therefore, we provide a new algorithm to obtain the optimal dual variables after formulating them in terms of each other. Then, the users that are connected to the overloaded APs and receive less data rates start seeking for other APs that offer higher data rates. Users with lower data rates continue re-connecting from AP to other to balance the load only if this travel increases the summation of the achievable data rates and enhances the system fairness. The numerical results demonstrate that the proposed algorithms improve the system capacity and system fairness with fast convergence.
Joint Load Balancing and Power Allocation for Hybrid VLC/RF Networks
Obeed, Mohanad
2018-01-15
In this paper, we propose and study a new joint load balancing (LB) and power allocation (PA) scheme for a hybrid visible light communication (VLC) and radio frequency (RF) system consisting of one RF\\\\access point (AP) and multiple VLC\\\\APs. An iterative algorithm is proposed to distribute the users on the APs and distribute the powers of these APs on their users. In PA subproblem, an optimization problem is formulated to allocate the power of each AP to the connected users for the total achievable data rates maximization. It is proved that the PA optimization problem is concave but not easy to tackle. Therefore, we provide a new algorithm to obtain the optimal dual variables after formulating them in terms of each other. Then, the users that are connected to the overloaded APs and receive less data rates start seeking for other APs that offer higher data rates. Users with lower data rates continue re-connecting from AP to other to balance the load only if this travel increases the summation of the achievable data rates and enhances the system fairness. The numerical results demonstrate that the proposed algorithms improve the system capacity and system fairness with fast convergence.
Zhang, An-yang; Fan, Tian-yuan
2010-04-18
To investigate the preparation and optimization of calcium alginate floating microspheres loading aspirin. A model was used to predict the in vitro release of aspirin and optimize the formulation by artificial neural networks (ANNs) and response surface methodology (RSM). The amounts of the material in the formulation were used as inputs, while the release and floating rate of the microspheres were used as outputs. The performances of ANNs and RSM were compared. ANNs were more accurate in prediction. There was no significant difference between ANNs and RSM in optimization. Approximately 90% of the optimized microspheres could float on the artificial gastric juice over 4 hours. 42.12% of aspirin was released in 60 min, 60.97% in 120 min and 78.56% in 240 min. The release of the drug from the microspheres complied with Higuchi equation. The aspirin floating microspheres with satisfying in vitro release were prepared successfully by the methods of ANNs and RSM.
Assessment of network inference methods: how to cope with an underdetermined problem.
Directory of Open Access Journals (Sweden)
Caroline Siegenthaler
Full Text Available The inference of biological networks is an active research area in the field of systems biology. The number of network inference algorithms has grown tremendously in the last decade, underlining the importance of a fair assessment and comparison among these methods. Current assessments of the performance of an inference method typically involve the application of the algorithm to benchmark datasets and the comparison of the network predictions against the gold standard or reference networks. While the network inference problem is often deemed underdetermined, implying that the inference problem does not have a (unique solution, the consequences of such an attribute have not been rigorously taken into consideration. Here, we propose a new procedure for assessing the performance of gene regulatory network (GRN inference methods. The procedure takes into account the underdetermined nature of the inference problem, in which gene regulatory interactions that are inferable or non-inferable are determined based on causal inference. The assessment relies on a new definition of the confusion matrix, which excludes errors associated with non-inferable gene regulations. For demonstration purposes, the proposed assessment procedure is applied to the DREAM 4 In Silico Network Challenge. The results show a marked change in the ranking of participating methods when taking network inferability into account.
A two-layer recurrent neural network for nonsmooth convex optimization problems.
Qin, Sitian; Xue, Xiaoping
2015-06-01
In this paper, a two-layer recurrent neural network is proposed to solve the nonsmooth convex optimization problem subject to convex inequality and linear equality constraints. Compared with existing neural network models, the proposed neural network has a low model complexity and avoids penalty parameters. It is proved that from any initial point, the state of the proposed neural network reaches the equality feasible region in finite time and stays there thereafter. Moreover, the state is unique if the initial point lies in the equality feasible region. The equilibrium point set of the proposed neural network is proved to be equivalent to the Karush-Kuhn-Tucker optimality set of the original optimization problem. It is further proved that the equilibrium point of the proposed neural network is stable in the sense of Lyapunov. Moreover, from any initial point, the state is proved to be convergent to an equilibrium point of the proposed neural network. Finally, as applications, the proposed neural network is used to solve nonlinear convex programming with linear constraints and L1 -norm minimization problems.
Consensus problem in directed networks of multi-agents via nonlinear protocols
International Nuclear Information System (INIS)
Liu Xiwei; Chen Tianping; Lu Wenlian
2009-01-01
In this Letter, the consensus problem via distributed nonlinear protocols for directed networks is investigated. Its dynamical behaviors are described by ordinary differential equations (ODEs). Based on graph theory, matrix theory and the Lyapunov direct method, some sufficient conditions of nonlinear protocols guaranteeing asymptotical or exponential consensus are presented and rigorously proved. The main contribution of this work is that for nonlinearly coupled networks, we generalize the results for undirected networks to directed networks. Consensus under pinning control technique is also developed here. Simulations are also given to show the validity of the theories.
A non-penalty recurrent neural network for solving a class of constrained optimization problems.
Hosseini, Alireza
2016-01-01
In this paper, we explain a methodology to analyze convergence of some differential inclusion-based neural networks for solving nonsmooth optimization problems. For a general differential inclusion, we show that if its right hand-side set valued map satisfies some conditions, then solution trajectory of the differential inclusion converges to optimal solution set of its corresponding in optimization problem. Based on the obtained methodology, we introduce a new recurrent neural network for solving nonsmooth optimization problems. Objective function does not need to be convex on R(n) nor does the new neural network model require any penalty parameter. We compare our new method with some penalty-based and non-penalty based models. Moreover for differentiable cases, we implement circuit diagram of the new neural network. Copyright © 2015 Elsevier Ltd. All rights reserved.
Provotorov, Ivan; Gasilov, Valentin; Anisimova, Nadezhda
2018-03-01
The structure of problems of high-rise construction us suggested, which includes the impact on environment, design solutions, transportation problems, financial costs for construction and operation, and others. Positive and negative aspects of high-rise construction are considered. One of the basic problems of high-rise construction is the problem of increased transport load. Construction of the subway on the basis of the concession mechanism, with the use of unmanned control of rolling stock is proposed as the most expedient solution. An evaluation of the effectiveness of this project is presented, it shows quite high performance indicators for a private investor. Main problems that the project implementation may face in conditions of lack of scientific and methodological support are outlined.
Przednowek, Krzysztof; Iskra, Janusz; Wiktorowicz, Krzysztof; Krzeszowski, Tomasz; Maszczyk, Adam
2017-12-01
This paper presents a novel approach to planning training loads in hurdling using artificial neural networks. The neural models performed the task of generating loads for athletes' training for the 400 meters hurdles. All the models were calculated based on the training data of 21 Polish National Team hurdlers, aged 22.25 ± 1.96, competing between 1989 and 2012. The analysis included 144 training plans that represented different stages in the annual training cycle. The main contribution of this paper is to develop neural models for planning training loads for the entire career of a typical hurdler. In the models, 29 variables were used, where four characterized the runner and 25 described the training process. Two artificial neural networks were used: a multi-layer perceptron and a network with radial basis functions. To assess the quality of the models, the leave-one-out cross-validation method was used in which the Normalized Root Mean Squared Error was calculated. The analysis shows that the method generating the smallest error was the radial basis function network with nine neurons in the hidden layer. Most of the calculated training loads demonstrated a non-linear relationship across the entire competitive period. The resulting model can be used as a tool to assist a coach in planning training loads during a selected training period.
Directory of Open Access Journals (Sweden)
Przednowek Krzysztof
2017-12-01
Full Text Available This paper presents a novel approach to planning training loads in hurdling using artificial neural networks. The neural models performed the task of generating loads for athletes’ training for the 400 meters hurdles. All the models were calculated based on the training data of 21 Polish National Team hurdlers, aged 22.25 ± 1.96, competing between 1989 and 2012. The analysis included 144 training plans that represented different stages in the annual training cycle. The main contribution of this paper is to develop neural models for planning training loads for the entire career of a typical hurdler. In the models, 29 variables were used, where four characterized the runner and 25 described the training process. Two artificial neural networks were used: a multi-layer perceptron and a network with radial basis functions. To assess the quality of the models, the leave-one-out cross-validation method was used in which the Normalized Root Mean Squared Error was calculated. The analysis shows that the method generating the smallest error was the radial basis function network with nine neurons in the hidden layer. Most of the calculated training loads demonstrated a non-linear relationship across the entire competitive period. The resulting model can be used as a tool to assist a coach in planning training loads during a selected training period.
International Nuclear Information System (INIS)
Shumilov, V.F.
2003-01-01
New methods for the investigation of automatic systems based on the inverse tasks of dynamics with the use of rational, trigonometric and polynomial spline functions are discussed. By means of SH function the technological regimes: start-up, steadiness, racing, braking, reverse, stop were determined. Procedure for the provision of dynamic load smoothness is suggested, and example of control over the transport systems for fuel load is considered [ru
Energy Dependent Divisible Load Theory for Wireless Sensor Network Workload Allocation
Directory of Open Access Journals (Sweden)
Haiyan Shi
2012-01-01
Full Text Available The wireless sensor network (WSN, consisting of a large number of microsensors with wireless communication abilities, has become an indispensable tool for use in monitoring and surveillance applications. Despite its advantages in deployment flexibility and fault tolerance, the WSN is vulnerable to failures due to the depletion of limited onboard battery energy. A major portion of energy consumption is caused by the transmission of sensed results to the master processor. The amount of energy used, in fact, is related to both the duration of sensing and data transmission. Hence, in order to extend the operation lifespan of the WSN, a proper allocation of sensing workload among the sensors is necessary. An assignment scheme is here formulated on the basis of the divisible load theory, namely, the energy dependent divisible load theory (EDDLT for sensing workload allocations. In particular, the amount of residual energies onboard sensors are considered while deciding the workload assigned to each sensor. Sensors with smaller amount of residual energy are assigned lighter workloads, thus, allowing for a reduced energy consumption and the sensor lifespan is extended. Simulation studies are conducted and results have illustrated the effectiveness of the proposed workload allocation method.
International Nuclear Information System (INIS)
Meneses, Anderson Alvarenga de Moura; Araujo, Lenilson Moreira; Nast, Fernando Nogueira; Da Silva, Patrick Vasconcelos; Schirru, Roberto
2018-01-01
Highlights: •Metaheuristics were applied to Loading Pattern Optimization problems and compared. •The problems are based on data of the benchmarks IAEA and BIBLIS. •The metaheuristics compared were PSO, Cross-Entropy, PBIL and Artificial Bee Colony. •Angra 1 NPP data were also used for further comparison of the algorithms. -- Abstract: The Loading Pattern Optimization (LPO) of a Nuclear Power Plant (NPP), or in-core fuel management optimization, is a real-world and prominent problem in Nuclear Engineering with the goal of finding an optimal (or near-optimal) Loading Pattern (LP), in terms of energy production, within adequate safety margins. Most of the reactor models used in the LPO problem are particular cases, such as research or power reactors with technical data that cannot be made available for several reasons, which makes the reproducibility of tests unattainable. In the present article we report the results of LPO of problems based upon reactor physics benchmarks. Since such data are well-known and widely available in the literature, it is possible to reproduce tests for comparison of techniques. We performed the LPO with the data of the benchmarks IAEA-3D and BIBLIS-2D. The Reactor Physics code RECNOD, which was used in previous works for the optimization of Angra 1 NPP in Brazil, was also used for further comparison. Four Optimization Metaheuristics (OMHs) were applied to those problems: Particle Swarm Optimization (PSO), Cross-Entropy algorithm (CE), Artificial Bee Colony (ABC) and Population-Based Incremental Learning (PBIL). For IAEA-3D, the best algorithm was the ABC. For BIBLIS-2D, PBIL was the best OMH. For Angra 1 / RECNOD optimization problem, PBIL, ABC and CE were the best OMHs.
Jordan, Katy; Weller, Martin
2018-01-01
The web has had a profound effect on the ways people interact, with online social networks arguably playing an important role in changing or augmenting how we connect with others. However, uptake of online social networking by the academic community varies, and needs to be understood. This paper presents an independent, novel analysis of a…
A polynomial time algorithm for solving the maximum flow problem in directed networks
International Nuclear Information System (INIS)
Tlas, M.
2015-01-01
An efficient polynomial time algorithm for solving maximum flow problems has been proposed in this paper. The algorithm is basically based on the binary representation of capacities; it solves the maximum flow problem as a sequence of O(m) shortest path problems on residual networks with nodes and m arcs. It runs in O(m"2r) time, where is the smallest integer greater than or equal to log B , and B is the largest arc capacity of the network. A numerical example has been illustrated using this proposed algorithm.(author)
A Branch and Cut algorithm for the container shipping network design problem
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Pisinger, David
2012-01-01
The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear...... programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers...
Azarova, Valeriya; Engel, Dominik; Ferner, Cornelia; Kollmann, Andrea; Reichl, Johannes
2018-04-01
Growing self-generation and storage are expected to cause significant changes in residential electricity utilization patterns. Commonly applied volumetric network tariffs may induce imbalance between different groups of households and their respective contribution to recovering the operating costs of the grid. Understanding consumer behaviour and appliance usage together with socio-economic factors can help regulatory authorities to adapt network tariffs to new circumstances in a fair way. Here, we assess the effects of 11 network tariff scenarios on household budgets using real load profiles from 765 households. Thus we explore the possibly disruptive impact of applying peak-load-based tariffs on the budgets of households when they have been mainly charged for consumed volumes before. Our analysis estimates the change in household network expenditure for different combinations of energy, peak and fixed charges, and can help to design tariffs that recover the costs needed for the sustainable operation of the grid.
Wireless Sensor Networks - Node Localization for Various Industry Problems
International Nuclear Information System (INIS)
Derr, Kurt; Manic, Milos
2015-01-01
Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothing (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications
A morphological investigation of conductive networks in polymers loaded with carbon nanotubes
Lubineau, Gilles
2017-01-13
Loading polymers with conductive nanoparticles, such as carbon nanotubes, is a popular approach toward improving their electrical properties. Resultant materials are typically described by the weight or volume fractions of their nanoparticles. Because these conductive particles are only capable of charge transfer over a very short range, most do not interact with the percolated paths nor do they participate to the electrical transfer. Understanding how these particles are arranged is necessary to increase their efficiency. It is of special interest to understand how these particles participate in creating percolated clusters, either in a specific or in all directions, and non-percolated clusters. For this, we present a computational modeling strategy based on a full morphological analysis of a network to systematically analyse conductive networks and show how particles are arranged. This study provides useful information for designing these types of materials and examples suitable for characterizing important features, such as representative volume element, the role of nanotube tortuosity and the role of tunneling cutoff distance.
A morphological investigation of conductive networks in polymers loaded with carbon nanotubes
Lubineau, Gilles; Mora Cordova, Angel; Han, Fei; Odeh, I.N.; Yaldiz, R.
2017-01-01
Loading polymers with conductive nanoparticles, such as carbon nanotubes, is a popular approach toward improving their electrical properties. Resultant materials are typically described by the weight or volume fractions of their nanoparticles. Because these conductive particles are only capable of charge transfer over a very short range, most do not interact with the percolated paths nor do they participate to the electrical transfer. Understanding how these particles are arranged is necessary to increase their efficiency. It is of special interest to understand how these particles participate in creating percolated clusters, either in a specific or in all directions, and non-percolated clusters. For this, we present a computational modeling strategy based on a full morphological analysis of a network to systematically analyse conductive networks and show how particles are arranged. This study provides useful information for designing these types of materials and examples suitable for characterizing important features, such as representative volume element, the role of nanotube tortuosity and the role of tunneling cutoff distance.
Network Model for The Problem of Integer Balancing of a Fourdimensional Matrix
Directory of Open Access Journals (Sweden)
A. V. Smirnov
2016-01-01
Full Text Available The problem of integer balancing of a four-dimensional matrix is studied. The elements of the inner part (all four indices are greater than zero of the given real matrix are summed in each direction and each two- and three-dimensional section of the matrix; the total sum is also found. These sums are placed into the elements where one or more indices are equal to zero (according to the summing directions. The problem is to find an integer matrix of the same structure, which can be produced from the initial one by replacing the elements with the largest previous or the smallest following integer. At the same time, the element with four zero indices should be produced with standard rules of rounding - off. In the article the problem of finding the maximum multiple flow in the network of any natural multiplicity is also studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs. Each multiple and multi-arc is a union of linked arcs, which are adjusted with each other. The network constructing rules are described. The definitions of a divisible network and some associated subjects are stated. There are defined the basic principles for reducing the integer balancing problem of an -dimensional matrix ( to the problem of finding the maximum flow in a divisible multiple network of multiplicity . There are stated the rules for reducing the four-dimensional balancing problem to the maximum flow problem in the network of multiplicity 5. The algorithm of finding the maximum flow, which meets the solvability conditions for the integer balancing problem, is formulated for such a network.
Two Dimensional Array Based Overlay Network for Balancing Load of Peer-to-Peer Live Video Streaming
Faruq Ibn Ibrahimy, Abdullah; Rafiqul, Islam Md; Anwar, Farhat; Ibn Ibrahimy, Muhammad
2013-12-01
The live video data is streaming usually in a tree-based overlay network or in a mesh-based overlay network. In case of departure of a peer with additional upload bandwidth, the overlay network becomes very vulnerable to churn. In this paper, a two dimensional array-based overlay network is proposed for streaming the live video stream data. As there is always a peer or a live video streaming server to upload the live video stream data, so the overlay network is very stable and very robust to churn. Peers are placed according to their upload and download bandwidth, which enhances the balance of load and performance. The overlay network utilizes the additional upload bandwidth of peers to minimize chunk delivery delay and to maximize balance of load. The procedure, which is used for distributing the additional upload bandwidth of the peers, distributes the additional upload bandwidth to the heterogeneous strength peers in a fair treat distribution approach and to the homogeneous strength peers in a uniform distribution approach. The proposed overlay network has been simulated by Qualnet from Scalable Network Technologies and results are presented in this paper.
Two Dimensional Array Based Overlay Network for Balancing Load of Peer-to-Peer Live Video Streaming
International Nuclear Information System (INIS)
Ibrahimy, Abdullah Faruq Ibn; Rafiqul, Islam Md; Anwar, Farhat; Ibrahimy, Muhammad Ibn
2013-01-01
The live video data is streaming usually in a tree-based overlay network or in a mesh-based overlay network. In case of departure of a peer with additional upload bandwidth, the overlay network becomes very vulnerable to churn. In this paper, a two dimensional array-based overlay network is proposed for streaming the live video stream data. As there is always a peer or a live video streaming server to upload the live video stream data, so the overlay network is very stable and very robust to churn. Peers are placed according to their upload and download bandwidth, which enhances the balance of load and performance. The overlay network utilizes the additional upload bandwidth of peers to minimize chunk delivery delay and to maximize balance of load. The procedure, which is used for distributing the additional upload bandwidth of the peers, distributes the additional upload bandwidth to the heterogeneous strength peers in a fair treat distribution approach and to the homogeneous strength peers in a uniform distribution approach. The proposed overlay network has been simulated by Qualnet from Scalable Network Technologies and results are presented in this paper
Day-ahead residential load forecasting with artificial neural network using smart meter data
Asare-Bediako, B.; Kling, W.L.; Ribeiro, P.F.
2013-01-01
Load forecasting is an important operational procedure for the electric industry particularly in a liberalized, deregulated environment. It enables the prediction of utilization of assets, provides input for load/supply balancing and supports optimal energy utilization. Current residential load
The simplest problem in the collective dynamics of neural networks: is synchrony stable?
International Nuclear Information System (INIS)
Timme, Marc; Wolf, Fred
2008-01-01
For spiking neural networks we consider the stability problem of global synchrony, arguably the simplest non-trivial collective dynamics in such networks. We find that even this simplest dynamical problem—local stability of synchrony—is non-trivial to solve and requires novel methods for its solution. In particular, the discrete mode of pulsed communication together with the complicated connectivity of neural interaction networks requires a non-standard approach. The dynamics in the vicinity of the synchronous state is determined by a multitude of linear operators, in contrast to a single stability matrix in conventional linear stability theory. This unusual property qualitatively depends on network topology and may be neglected for globally coupled homogeneous networks. For generic networks, however, the number of operators increases exponentially with the size of the network. We present methods to treat this multi-operator problem exactly. First, based on the Gershgorin and Perron–Frobenius theorems, we derive bounds on the eigenvalues that provide important information about the synchronization process but are not sufficient to establish the asymptotic stability or instability of the synchronous state. We then present a complete analysis of asymptotic stability for topologically strongly connected networks using simple graph-theoretical considerations. For inhibitory interactions between dissipative (leaky) oscillatory neurons the synchronous state is stable, independent of the parameters and the network connectivity. These results indicate that pulse-like interactions play a profound role in network dynamical systems, and in particular in the dynamics of biological synchronization, unless the coupling is homogeneous and all-to-all. The concepts introduced here are expected to also facilitate the exact analysis of more complicated dynamical network states, for instance the irregular balanced activity in cortical neural networks
van Lieshout, Ernest C.D.M.; Xenidou-Dervou, Iro
At the start of mathematics education children are often presented with addition and subtraction problems in the form of pictures. They are asked to solve the problems by filling in corresponding number sentences. One type of problem concerns the representation of an increase or a decrease in a
van Lieshout, Ernest C. D. M.; Xenidou-Dervou, Iro
2018-01-01
At the start of mathematics education children are often presented with addition and subtraction problems in the form of pictures. They are asked to solve the problems by filling in corresponding number sentences. One type of problem concerns the representation of an increase or a decrease in a depicted amount. A decrease is, however, more…
Li, Zhi; Xin, Keyun; Li, Wei; Li, Yanzhe
2018-04-30
In the literature about allocation of selective attention, a widely studied question is when will attention be allocated to information that is clearly irrelevant to the task at hand. The present study, by using convergent evidence, demonstrated that there is a trade-off between quantity of information present in a display and the time allowed to process it. Specifically, whether or not there is interference from irrelevant distractors depends not only on the amount of information present, but also on the amount of time allowed to process that information. When processing time is calibrated to the amount of information present, irrelevant distractors can be selectively ignored successfully. These results suggest that the perceptual load in the load theory of selective attention (i.e., Lavie, 2005) should be thought about as a dynamic rate problem rather than a static capacity limitation. The authors thus propose that rather than conceiving of perceptual load as a quantity of information, they should consider it as a quantity of information per unit of time. In other words, it is the relationship between the quantity of information in the task and the time for processing the information that determines the allocation of selective attention. Thus, the present findings extended load theory, allowing it to explain findings that were previously considered as counter evidence of load theory. (PsycINFO Database Record (c) 2018 APA, all rights reserved).
Energy Technology Data Exchange (ETDEWEB)
Duran, Ana Cecilia
1990-03-01
This thesis aims to find a better way to solve large scale nonlinear sparse system problems giving special emphasis to load flow in electric power networks. The suggested algorithms are presented 63 refs., 28 figs., 16 tabs.
International Nuclear Information System (INIS)
Yu, Feng; Xu, Xiaozhong
2014-01-01
Highlights: • A detailed data processing will make more accurate results prediction. • Taking a full account of more load factors to improve the prediction precision. • Improved BP network obtains higher learning convergence. • Genetic algorithm optimized by chaotic cat map enhances the global search ability. • The combined GA–BP model improved by modified additional momentum factor is superior to others. - Abstract: This paper proposes an appropriate combinational approach which is based on improved BP neural network for short-term gas load forecasting, and the network is optimized by the real-coded genetic algorithm. Firstly, several kinds of modifications are carried out on the standard neural network to accelerate the convergence speed of network, including improved additional momentum factor, improved self-adaptive learning rate and improved momentum and self-adaptive learning rate. Then, it is available to use the global search capability of optimized genetic algorithm to determine the initial weights and thresholds of BP neural network to avoid being trapped in local minima. The ability of GA is enhanced by cat chaotic mapping. In light of the characteristic of natural gas load for Shanghai, a series of data preprocessing methods are adopted and more comprehensive load factors are taken into account to improve the prediction accuracy. Such improvements facilitate forecasting efficiency and exert maximum performance of the model. As a result, the integration model improved by modified additional momentum factor gets more ideal solutions for short-term gas load forecasting, through analyses and comparisons of the above several different combinational algorithms
Zafar, Junaid
2012-01-01
The geometrical relationship between the cut-off and propagating planes of any waveguide system is a prerequisite for any design process. The characterization of cut-off planes and optimisation are challenging for numerical methods, closed-form solutions are always preferred. In this paper Maxwells coupled field equations are used to characterise twin E-plane and H-plane slab loaded boundary value problems. The single mode bandwidths and dispersion characteristics of these structures are pres...
SORM correction of FORM results for the FBC load combination problem
DEFF Research Database (Denmark)
Ditlevsen, Ove
2005-01-01
The old stochastic load combination model of Ferry Borges and Castanheta and the corresponding extreme random load effect value is considered. The evaluation of the distribution function of the extreme value by use of a particular first order reliability method was first described in a celebrated...... calculations. The calculation gives a limit state curvature correction factor on the probability approximation obtained by the RF algorithm. This correction factor is based on Breitung’s celebrated asymptotic formula. Example calculations with comparisons with exact results show an impressing accuracy...
Relevant problems in collaborative processes of non-hierarchical manufacturing networks
Directory of Open Access Journals (Sweden)
Beatriz Andrés
2013-07-01
Full Text Available Purpose: The purpose of this paper is to identify some of existing problems associated with collaboration among SMEs of the same network. Concretely, the problems are focused. The research objective is to identify the most relevant problems existing when SMEs have to deal with decentralized decisions (DDM. Design/methodology/approach: Through the literature review there have been collected collaborative problems caused by inter-organizational barriers. The approach taken is a qualitative study and analysis that classifies collaborative problems from less important to very important. In light of this, we are able to identify what are the most relevant problems to study in the NHN collaborative context. Findings and Originality/value: The developed methodology allows researchers to indentify amongst the collaborative problems those that are most relevant to solve in the NHN context, with the main aim of providing solutions in the future. The research aim is to provide the expert in the collaborative field a starting point to address the collaborative problems SMEs can find when belonging to collaborative networks. Research limitations/implications: Not all the problems that appear when an SME establish collaborative relationships, in a NHN, are considered. The identified problems have been arisen because there are discussed in the literature for addressing collaborative problems among networked partners. Identified problems are also considered because there are relevant to achieve collaboration among SMEs. Originality/value: The degree of coverage and the degree of significance is the taxonomy criteria used to identify the importance of solution degree of the encountered collaborative problems, in NHN context, in order to provide a future research of solutions to overcome them.
Energy Technology Data Exchange (ETDEWEB)
Wang, Hai-Chao; Jiao, Wen-Ling; Zou, Ping-Hua; Liu, Jing-Cheng [School of Municipal and Environmental Engineering, Harbin Institute of Technology, mail box 2645, 202 Haihe Road, Nangang District, Harbin 150090 (China)
2010-11-15
Through investigation of the Dengfeng heating network in the city of Daqing, China, for the 2007-2008 heating season, we found serious problems of excessive heat supply in the primary heating network. Therefore, we propose the application of gas-fired boilers in underperforming heating substations as peak-load heat sources to effectively adapt to the regulation demands of seasonal heat-load fluctuations and reduce the excessive heat supply. First, we calculated the excessive heat supply rates (EHSRs) of five substations using detailed investigative data. We then discussed the feasibility of the proposed scheme providing energy savings from both energetic and exergetic points of view. The results showed that the average EHSR of the five substations between January and March was 20.57% of the gross heat production but consequently reduced to 6.24% with the installation of the gas-fired boilers. Therefore, the combined heating scheme with coal as the basic heat-source and gas-fired boilers as peak-load heat sources is energy-efficient to some extent, although requires the use of natural gas. Meanwhile, the exergy decreased by 10.97%, which indicates that the combined heating scheme effectively reduces the primary energy consumption and pollutant emission of the heating systems. (author)
Energy Technology Data Exchange (ETDEWEB)
Jonsson, Mats; Larsson, Mikael
1993-02-01
Remote control and load management increase the electricity distributors possibilities to even out the consumption of electricity for optimal usage of electricity subscription and supply system. Controlling can be done either through technology or through encouragement of off-peak consumption. There are a number of similar systems for controlling consumption, where the manufacturers have chosen different ways to solve the main problem, namely the communication. We have concentrated in examining systems which communicate through the supply system, different types of telephone connections and wireless communication links. In the future demands for better electricity consumption control will be put forward. This will bring along a greater need at distribution level for continuous monitoring of purchased and used electricity flow. The distributors will also need better possibilities to directly affect power consumption. Those manufacturers who do not use load management today should acquire experience through provincial installations in suitable areas with equipment ready for tomorrows needs and requirements. Today there are some different systems on the market that offer flexibility and ready-to-use possibilities. (3 refs., 17 figs.)
Decentralized coverage control problems for mobile robotic sensor and actuator networks
Savkin, A; Xi, Z; Javed, F; Matveev, A; Nguyen, H
2015-01-01
This book introduces various coverage control problems for mobile sensor networks including barrier, sweep and blanket. Unlike many existing algorithms, all of the robotic sensor and actuator motion algorithms developed in the book are fully decentralized or distributed, computationally efficient, easily implementable in engineering practice and based only on information on the closest neighbours of each mobile sensor and actuator and local information about the environment. Moreover, the mobile robotic sensors have no prior information about the environment in which they operation. These various types of coverage problems have never been covered before by a single book in a systematic way. Another topic of this book is the study of mobile robotic sensor and actuator networks. Many modern engineering applications include the use of sensor and actuator networks to provide efficient and effective monitoring and control of industrial and environmental processes. Such mobile sensor and actuator networks are abl...
Energy Technology Data Exchange (ETDEWEB)
He, Fulin; Cao, Yang; Zhang, Jun Jason; Wei, Jiaolong; Zhang, Yingchen; Muljadi, Eduard; Gao, Wenzhong
2016-11-21
Ensuring flexible and reliable data routing is indispensable for the integration of Advanced Metering Infrastructure (AMI) networks, we propose a secure-oriented and load-balancing wireless data routing scheme. A novel utility function is designed based on security routing scheme. Then, we model the interactive security-oriented routing strategy among meter data concentrators or smart grid meters as a mixed-strategy network formation game. Finally, such problem results in a stable probabilistic routing scheme with proposed distributed learning algorithm. One contributions is that we studied that different types of applications affect the routing selection strategy and the strategy tendency. Another contributions is that the chosen strategy of our mixed routing can adaptively to converge to a new mixed strategy Nash equilibrium (MSNE) during the learning process in the smart grid.
A Bio-Inspired Approach to Traffic Network Equilibrium Assignment Problem.
Zhang, Xiaoge; Mahadevan, Sankaran
2018-04-01
Finding an equilibrium state of the traffic assignment plays a significant role in the design of transportation networks. We adapt the path finding mathematical model of slime mold Physarum polycephalum to solve the traffic equilibrium assignment problem. We make three contributions in this paper. First, we propose a generalized Physarum model to solve the shortest path problem in directed and asymmetric graphs. Second, we extend it further to resolve the network design problem with multiple source nodes and sink nodes. At last, we demonstrate that the Physarum solver converges to the user-optimized (Wardrop) equilibrium by dynamically updating the costs of links in the network. In addition, convergence of the developed algorithm is proved. Numerical examples are used to demonstrate the efficiency of the proposed algorithm. The superiority of the proposed algorithm is demonstrated in comparison with several other algorithms, including the Frank-Wolfe algorithm, conjugate Frank-Wolfe algorithm, biconjugate Frank-Wolfe algorithm, and gradient projection algorithm.
International Nuclear Information System (INIS)
Mohammadi, A.; Varahram, M.H.
2007-01-01
In this study, two methods for solving economic dispatch problems, namely Hopfield neural network and lambda iteration method are compared. Three sample of power system with 3, 6 and 20 units have been considered. The time required for CPU, for solving economic dispatch of these two systems has been calculated. It has been Shown that for on-line economic dispatch, Hopfield neural network is more efficient and the time required for Convergence is considerably smaller compared to classical methods. (author)
2012-09-13
46, 1989. [75] S. Melkote and M.S. Daskin . An integrated model of facility location and transportation network design. Transportation Research Part A ... a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT/DS/ENS/12-09 THE AVERAGE NETWORK FLOW PROBLEM...focused thinking (VFT) are used sparingly, as is the case across the entirety of the supply chain literature. We provide a VFT tutorial for supply chain
Gregoire, Alexandre David
2011-07-01
The goal of this research was to accurately predict the ultimate compressive load of impact damaged graphite/epoxy coupons using a Kohonen self-organizing map (SOM) neural network and multivariate statistical regression analysis (MSRA). An optimized use of these data treatment tools allowed the generation of a simple, physically understandable equation that predicts the ultimate failure load of an impacted damaged coupon based uniquely on the acoustic emissions it emits at low proof loads. Acoustic emission (AE) data were collected using two 150 kHz resonant transducers which detected and recorded the AE activity given off during compression to failure of thirty-four impacted 24-ply bidirectional woven cloth laminate graphite/epoxy coupons. The AE quantification parameters duration, energy and amplitude for each AE hit were input to the Kohonen self-organizing map (SOM) neural network to accurately classify the material failure mechanisms present in the low proof load data. The number of failure mechanisms from the first 30% of the loading for twenty-four coupons were used to generate a linear prediction equation which yielded a worst case ultimate load prediction error of 16.17%, just outside of the +/-15% B-basis allowables, which was the goal for this research. Particular emphasis was placed upon the noise removal process which was largely responsible for the accuracy of the results.
DOE Network 2025: Network Research Problems and Challenges for DOE Scientists. Workshop Report
Energy Technology Data Exchange (ETDEWEB)
None, None
2016-02-01
The growing investments in large science instruments and supercomputers by the US Department of Energy (DOE) hold enormous promise for accelerating the scientific discovery process. They facilitate unprecedented collaborations of geographically dispersed teams of scientists that use these resources. These collaborations critically depend on the production, sharing, moving, and management of, as well as interactive access to, large, complex data sets at sites dispersed across the country and around the globe. In particular, they call for significant enhancements in network capacities to sustain large data volumes and, equally important, the capabilities to collaboratively access the data across computing, storage, and instrument facilities by science users and automated scripts and systems. Improvements in network backbone capacities of several orders of magnitude are essential to meet these challenges, in particular, to support exascale initiatives. Yet, raw network speed represents only a part of the solution. Indeed, the speed must be matched by network and transport layer protocols and higher layer tools that scale in ways that aggregate, compose, and integrate the disparate subsystems into a complete science ecosystem. Just as important, agile monitoring and management services need to be developed to operate the network at peak performance levels. Finally, these solutions must be made an integral part of the production facilities by using sound approaches to develop, deploy, diagnose, operate, and maintain them over the science infrastructure.
A problem of finding an acceptable variant in generalized project networks
Directory of Open Access Journals (Sweden)
David Blokh
2005-01-01
Full Text Available A project network often has some activities or groups of activities which can be performed at different stages of the project. Then, the problem of finding an optimal/acceptable time or/and optimal/acceptable order of such an activity or a group of activities arises. Such a problem emerges, in particular, in house-building management when the beginnings of some activities may vary in time or/and order. We consider a mathematical formulation of the problem, show its computational complexity, and describe an algorithm for solving the problem.
Directory of Open Access Journals (Sweden)
Nadia Adnan Shiltagh
2015-11-01
Full Text Available Wireless Multimedia Sensor Networks (WMSNs are a type of sensor network that contains sensor nodes equipped with cameras, microphones; therefore the WMSNS are able to produce multimedia data such as video and audio streams, still images, and scalar data from the surrounding environment. Most multimedia applications typically produce huge volumes of data, this leads to congestion. To address this challenge, This paper proposes Modify Spike Neural Network control for Traffic Load Parameter with Exponential Weight of Priority Based Rate Control algorithm (MSNTLP with EWBPRC. The Modify Spike Neural Network controller (MSNC can calculate the appropriate traffic load parameter μ for each parent node and then use in the EWPBRC algorithm to estimate the transmission rate of parent nodes and then assign a suitable transmission rate for each child node. A comparative study between (MSNTLP with EWBPRC and fuzzy logic controller for traffic load parameter with Exponential Weight of Priority Based Rate Control algorithm (FTLP with EWBPRC algorithm shows that the (MSNTLP with EWBPRC is more efficient than (FTLP with EWBPRC algorithm in terms of packet loss, queue delay and throughput. Another comparative study between (MSNTLP with EWBPRC and EWBPRC with fixed traffic load parameter (µ shows that the MSNTLP with EWBPRC is more efficient than EWBPRC with fixed traffic load parameter (µ in terms of packet loss ratio and queue delay. A simulation process is developed and tested using the network simulator _2 (NS2 in a computer having the following properties: windows 7 (64-bit, core i7, RAM 8GB, hard 1TB.
Problem-Solving Methods for the Prospective Development of Urban Power Distribution Network
Directory of Open Access Journals (Sweden)
A. P. Karpenko
2014-01-01
Full Text Available This article succeeds the former A. P. K nko’ and A. I. Kuzmina’ ubl t on titled "A mathematical model of urban distribution electro-network considering its future development" (electronic scientific and technical magazine "Science and education" No. 5, 2014.The article offers a model of urban power distribution network as a set of transformer and distribution substations and cable lines. All elements of the network and new consumers are determined owing to vectors of parameters consistent with them.A problem of the urban power distribution network design, taking into account a prospective development of the city, is presented as a problem of discrete programming. It is in deciding on the optimal option to connect new consumers to the power supply network, on the number and sites to build new substations, and on the option to include them in the power supply network.Two methods, namely a reduction method for a set the nested tasks of global minimization and a decomposition method are offered to solve the problem.In reduction method the problem of prospective development of power supply network breaks into three subtasks of smaller dimension: a subtask to define the number and sites of new transformer and distribution substations, a subtask to define the option to connect new consumers to the power supply network, and a subtask to include new substations in the power supply network. The vector of the varied parameters is broken into three subvectors consistent with the subtasks. Each subtask is solved using an area of admissible vector values of the varied parameters at the fixed components of the subvectors obtained when solving the higher subtasks.In decomposition method the task is presented as a set of three, similar to reduction method, reductions of subtasks and a problem of coordination. The problem of coordination specifies a sequence of the subtasks solution, defines the moment of calculation termination. Coordination is realized by
Nasertdinova, A. D.; Bochkarev, V. V.
2017-11-01
Deep neural networks with a large number of parameters are a powerful tool for solving problems of pattern recognition, prediction and classification. Nevertheless, overfitting remains a serious problem in the use of such networks. A method of solving the problem of overfitting is proposed in this article. This method is based on reducing the number of independent parameters of a neural network model using the principal component analysis, and can be implemented using existing libraries of neural computing. The algorithm was tested on the problem of recognition of handwritten symbols from the MNIST database, as well as on the task of predicting time series (rows of the average monthly number of sunspots and series of the Lorentz system were used). It is shown that the application of the principal component analysis enables reducing the number of parameters of the neural network model when the results are good. The average error rate for the recognition of handwritten figures from the MNIST database was 1.12% (which is comparable to the results obtained using the "Deep training" methods), while the number of parameters of the neural network can be reduced to 130 times.
International Nuclear Information System (INIS)
Li Qiong; Meng Qinglin; Cai Jiejin; Yoshino, Hiroshi; Mochida, Akashi
2009-01-01
This study presents four modeling techniques for the prediction of hourly cooling load in the building. In addition to the traditional back propagation neural network (BPNN), the radial basis function neural network (RBFNN), general regression neural network (GRNN) and support vector machine (SVM) are considered. All the prediction models have been applied to an office building in Guangzhou, China. Evaluation of the prediction accuracy of the four models is based on the root mean square error (RMSE) and mean relative error (MRE). The simulation results demonstrate that the four discussed models can be effective for building cooling load prediction. The SVM and GRNN methods can achieve better accuracy and generalization than the BPNN and RBFNN methods
Enhancing Learners' Problem Solving Performance in Mathematics: A Cognitive Load Perspective
Dhlamini, Joseph J.
2016-01-01
This paper reports on a pilot study that investigated the effect of implementing a context-based problem solving instruction (CBPSI) to enhance the problem solving performance of high school mathematics learners. Primarily, the pilot study aimed: (1) to evaluate the efficiency of data collection instruments; and, (2) to test the efficacy of CBPSI…
The effect of illustrations in arithmetic problem-solving: Effects of increased cognitive load
Berends, I.E.; van Lieshout, E.C.D.M.
2009-01-01
Arithmetic word problems are often presented accompanied by illustrations. The present study examined how different types of illustrations influence the speed and accuracy of performance of both good (n = 67) and poor arithmeticians (n = 63). Twenty-four arithmetic word problems were presented with
Identifying and localizing network problems using the PuNDIT project
International Nuclear Information System (INIS)
Batista, Jorge; McKee, Shawn; Dovrolis, Constantine; Lee, Danny
2015-01-01
In today's world of distributed collaborations of scientists, there are many challenges to providing effective infrastructures to couple these groups of scientists with their shared computing and storage resources. The Pythia Network Diagnostic InfrasTructure (PuNDIT[1]) project is integrating and scaling research tools and creating robust code suitable for operational needs addressing the difficult challenge of automating the detection and location of network problems.PuNDIT is building upon the de-facto standard perfSONAR[2] network measurement infrastructure deployed in Open Science Grid(OSG)[3] and the Worldwide LHC Computing Grid(WLCG)[4]to gather and analyze complex real-world network topologies coupled with their corresponding network metrics to identify possible signatures of network problems from a set of symptoms. The PuNDIT Team is working closely with the perfSONAR developers from ESnet and Internet2 to integrate PuNDIT components as part of the perfSONAR Toolkit. A primary goal for PuNDIT is to convert complex network metrics into easily understood diagnoses in an automated way. We will report on the project progress to-date in working with the OSG and WLCG communities, describe the current implementation including some initial results and discuss future plans and the project timeline. (paper)
Czech Academy of Sciences Publication Activity Database
Haslinger, Jaroslav; Repin, S.; Sysala, Stanislav
2016-01-01
Roč. 61, č. 5 (2016), s. 527-564 ISSN 0862-7940 R&D Projects: GA MŠk LQ1602 Institutional support: RVO:68145535 Keywords : functionals with linear growth * limit load * truncation method * perfect plasticity Subject RIV: BA - General Mathematics Impact factor: 0.618, year: 2016 http://link.springer.com/article/10.1007/s10492-016-0146-6
Directory of Open Access Journals (Sweden)
T. S. Ozsahin
2013-01-01
Full Text Available The frictionless contact problem for an elastic layer resting on an elastic half plane is considered. The problem is solved by using the theory of elasticity and integral transformation technique. The compressive loads P and Q (per unit thickness in direction are applied to the layer through three rigid flat punches. The elastic layer is also subjected to uniform vertical body force due to effect of gravity. The contact along the interface between elastic layer and half plane is continuous, if the value of the load factor, λ, is less than a critical value, . In this case, initial separation loads, and initial separation points, are determined. Also the required distance between the punches to avoid any separation between the punches and the elastic layer is studied and the limit distance between punches that ends interaction of punches is investigated for various dimensionless quantities. However, if tensile tractions are not allowed on the interface, for the layer separates from the interface along a certain finite region. Numerical results for distance determining the separation area, vertical displacement in the separation zone, contact stress distribution along the interface between elastic layer and half plane are given for this discontinuous contact case.
A Branch and Cut algorithm for the container shipping network design problem
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Kallehauge, Brian; Pisinger, David
The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear...... programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers...... transhipment cost. The problem is solved with branch-and-cut using clover and transhipment inequalities. Computational results are reported for instances with up to 15 ports....
Sánchez-Pérez, J F; Marín, F; Morales, J L; Cánovas, M; Alhama, F
2018-01-01
Mathematical models simulating different and representative engineering problem, atomic dry friction, the moving front problems and elastic and solid mechanics are presented in the form of a set of non-linear, coupled or not coupled differential equations. For different parameters values that influence the solution, the problem is numerically solved by the network method, which provides all the variables of the problems. Although the model is extremely sensitive to the above parameters, no assumptions are considered as regards the linearization of the variables. The design of the models, which are run on standard electrical circuit simulation software, is explained in detail. The network model results are compared with common numerical methods or experimental data, published in the scientific literature, to show the reliability of the model.
2018-01-01
Mathematical models simulating different and representative engineering problem, atomic dry friction, the moving front problems and elastic and solid mechanics are presented in the form of a set of non-linear, coupled or not coupled differential equations. For different parameters values that influence the solution, the problem is numerically solved by the network method, which provides all the variables of the problems. Although the model is extremely sensitive to the above parameters, no assumptions are considered as regards the linearization of the variables. The design of the models, which are run on standard electrical circuit simulation software, is explained in detail. The network model results are compared with common numerical methods or experimental data, published in the scientific literature, to show the reliability of the model. PMID:29518121
Definition of new 3D invariants. Applications to pattern recognition problems with neural networks
International Nuclear Information System (INIS)
Proriol, J.
1996-01-01
We propose a definition of new 3D invariants. Usual pattern recognition methods use 2D descriptions of 3D objects, we propose a 2D approximation of the defined 3D invariants which can be used with neural networks to solve pattern recognition problems. We describe some methods to use the 2 D approximants. This work is an extension of previous 3D invariants used to solve some high energy physics problems. (author)
Latorre, Vittorio
2014-01-01
We propose to solve large instances of the non-convex optimization problems reformulated with canonical duality theory. To this aim we propose an interior point potential reduction algorithm based on the solution of the primal-dual total complementarity (Lagrange) function. We establish the global convergence result for the algorithm under mild assumptions and demonstrate the method on instances of the Sensor Network Localization problem. Our numerical results are promising and show the possi...
Newton, Allen T; Morgan, Victoria L; Rogers, Baxter P; Gore, John C
2011-10-01
Interregional correlations between blood oxygen level dependent (BOLD) magnetic resonance imaging (fMRI) signals in the resting state have been interpreted as measures of connectivity across the brain. Here we investigate whether such connectivity in the working memory and default mode networks is modulated by changes in cognitive load. Functional connectivity was measured in a steady-state verbal identity N-back task for three different conditions (N = 1, 2, and 3) as well as in the resting state. We found that as cognitive load increases, the functional connectivity within both the working memory the default mode network increases. To test whether functional connectivity between the working memory and the default mode networks changed, we constructed maps of functional connectivity to the working memory network as a whole and found that increasingly negative correlations emerged in a dorsal region of the posterior cingulate cortex. These results provide further evidence that low frequency fluctuations in BOLD signals reflect variations in neural activity and suggests interaction between the default mode network and other cognitive networks. Copyright © 2010 Wiley-Liss, Inc.
Transient Analysis of Lumped Circuit Networks Loaded Thin Wires By DGTD Method
Li, Ping
2016-03-31
With the purpose of avoiding very fine mesh cells in the proximity of a thin wire, the modified telegrapher’s equations (MTEs) are employed to describe the thin wire voltage and current distributions, which consequently results in reduced number of unknowns and augmented Courant-Friedrichs-Lewy (CFL) number. As hyperbolic systems, both the MTEs and the Maxwell’s equations are solved by the discontinuous Galerkin time-domain (DGTD) method. In realistic situations, the thin wires could be either driven or loaded by circuit networks. The thin wire-circuit interface performs as a boundary condition for the thin wire solver, where the thin wire voltage and current used for the incoming flux evaluation involved in the DGTD analyzed MTEs are not available. To obtain this voltage and current, an auxiliary current flowing through the thin wire-circuit interface is introduced at each interface. Corresponding auxiliary equations derived from the invariable property of characteristic variable for hyperbolic systems are developed and solved together with the circuit equations established by the modified nodal analysis (MNA) modality. Furthermore, in order to characterize the field and thin wire interactions, a weighted electric field and a volume current density are added into the MTEs and Maxwell-Ampere’s law equation, respectively. To validate the proposed algorithm, three representative examples are presented.
Transient Analysis of Lumped Circuit Networks Loaded Thin Wires By DGTD Method
Li, Ping; Shi, Yifei; Jiang, Li Jun; Bagci, Hakan
2016-01-01
With the purpose of avoiding very fine mesh cells in the proximity of a thin wire, the modified telegrapher’s equations (MTEs) are employed to describe the thin wire voltage and current distributions, which consequently results in reduced number of unknowns and augmented Courant-Friedrichs-Lewy (CFL) number. As hyperbolic systems, both the MTEs and the Maxwell’s equations are solved by the discontinuous Galerkin time-domain (DGTD) method. In realistic situations, the thin wires could be either driven or loaded by circuit networks. The thin wire-circuit interface performs as a boundary condition for the thin wire solver, where the thin wire voltage and current used for the incoming flux evaluation involved in the DGTD analyzed MTEs are not available. To obtain this voltage and current, an auxiliary current flowing through the thin wire-circuit interface is introduced at each interface. Corresponding auxiliary equations derived from the invariable property of characteristic variable for hyperbolic systems are developed and solved together with the circuit equations established by the modified nodal analysis (MNA) modality. Furthermore, in order to characterize the field and thin wire interactions, a weighted electric field and a volume current density are added into the MTEs and Maxwell-Ampere’s law equation, respectively. To validate the proposed algorithm, three representative examples are presented.
Bi and tri-objective optimization in the deterministic network interdiction problem
International Nuclear Information System (INIS)
Rocco S, Claudio M.; Emmanuel Ramirez-Marquez, Jose; Salazar A, Daniel E.
2010-01-01
Solution approaches to the deterministic network interdiction problem have previously been developed for optimizing a single figure-of-merit of the network configuration (i.e. flow that can be transmitted between a source node and a sink node for a fixed network design) under constraints related to limited amount of resources available to interdict network links. These approaches work under the assumption that: (1) nominal capacity of each link is completely reduced when interdicted and (2) there is a single criterion to optimize. This paper presents a newly developed evolutionary algorithm that for the first time allows solving multi-objective optimization models for the design of network interdiction strategies that take into account a variety of figures-of-merit. The algorithm provides an approximation to the optimal Pareto frontier using: (a) techniques in Monte Carlo simulation to generate potential network interdiction strategies, (b) graph theory to analyze strategies' maximum source-sink flow and (c) an evolutionary search that is driven by the probability that a link will belong to the optimal Pareto set. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate and validate the approach.
METHOD OF COMPENSATING LOADS FOR SHALLOW SHELLS. VIBRATION AND STABILITY PROBLEMS
Tran Duc Chinh
2015-01-01
Based on the integral representation of the displacements functions through Green's functions, the author proposed a method to solve the system of differential equations of the given problem. The equations were solved approximately by reducing to algebraic equations by finite difference techniques in Samarsky scheme. Some examples are given for calculation of eigenvalues of shallow shell vibration problem, which are compared with results received by Onyashvili using Galerkin method.
METHOD OF COMPENSATING LOADS FOR SHALLOW SHELLS. VIBRATION AND STABILITY PROBLEMS
Directory of Open Access Journals (Sweden)
Tran Duc Chinh
2015-12-01
Full Text Available Based on the integral representation of the displacements functions through Green's functions, the author proposed a method to solve the system of differential equations of the given problem. The equations were solved approximately by reducing to algebraic equations by finite difference techniques in Samarsky scheme. Some examples are given for calculation of eigenvalues of shallow shell vibration problem, which are compared with results received by Onyashvili using Galerkin method.
Joint Optimization of Power Allocation and Load Balancing for Hybrid VLC/RF Networks
Obeed, Mohanad
2018-04-18
In this paper, we propose and study a new joint load balancing (LB) and power allocation (PA) scheme for a hybrid visible light communication (VLC) and radio frequency (RF) system consisting of one RF access point (AP) and multiple VLC APs. An iterative algorithm is proposed to distribute users on APs and distribute the powers of the APs on their users. In the PA subproblem, an optimization problem is formulated to allocate the power of each AP to the connected users for total achievable data rate maximization. In this subproblem, we propose a new efficient algorithm that finds optimal dual variables after formulating them in terms of each other. This new algorithm provides faster convergence and better performance than the traditional subgradient method. In addition, it does not depend on the step size or the initial values of the variables, which we look for, as the subgradient does. Then, we start with the user of the minimum data rate seeking another AP that offers a higher data rate for that user. Users with lower data rates continue reconnecting from one AP to another to balance the load only if this travel increases the summation of the achievable data rates and enhances the system fairness. Two approaches are proposed to have the joint PA and LB performed: a main approach that considers the exact interference information for all users, and a suboptimal approach that aims to decrease the complexity of the first approach by considering only the approximate interference information of users. The numerical results demonstrate that the proposed algorithms improve the system capacity and system fairness with fast convergence.
Joint Optimization of Power Allocation and Load Balancing for Hybrid VLC/RF Networks
Obeed, Mohanad; Salhab, Anas; Zummo, Salam A.; Alouini, Mohamed-Slim
2018-01-01
In this paper, we propose and study a new joint load balancing (LB) and power allocation (PA) scheme for a hybrid visible light communication (VLC) and radio frequency (RF) system consisting of one RF access point (AP) and multiple VLC APs. An iterative algorithm is proposed to distribute users on APs and distribute the powers of the APs on their users. In the PA subproblem, an optimization problem is formulated to allocate the power of each AP to the connected users for total achievable data rate maximization. In this subproblem, we propose a new efficient algorithm that finds optimal dual variables after formulating them in terms of each other. This new algorithm provides faster convergence and better performance than the traditional subgradient method. In addition, it does not depend on the step size or the initial values of the variables, which we look for, as the subgradient does. Then, we start with the user of the minimum data rate seeking another AP that offers a higher data rate for that user. Users with lower data rates continue reconnecting from one AP to another to balance the load only if this travel increases the summation of the achievable data rates and enhances the system fairness. Two approaches are proposed to have the joint PA and LB performed: a main approach that considers the exact interference information for all users, and a suboptimal approach that aims to decrease the complexity of the first approach by considering only the approximate interference information of users. The numerical results demonstrate that the proposed algorithms improve the system capacity and system fairness with fast convergence.
Paramestha, D. L.; Santosa, B.
2018-04-01
Two-dimensional Loading Heterogeneous Fleet Vehicle Routing Problem (2L-HFVRP) is a combination of Heterogeneous Fleet VRP and a packing problem well-known as Two-Dimensional Bin Packing Problem (BPP). 2L-HFVRP is a Heterogeneous Fleet VRP in which these costumer demands are formed by a set of two-dimensional rectangular weighted item. These demands must be served by a heterogeneous fleet of vehicles with a fix and variable cost from the depot. The objective function 2L-HFVRP is to minimize the total transportation cost. All formed routes must be consistent with the capacity and loading process of the vehicle. Sequential and unrestricted scenarios are considered in this paper. We propose a metaheuristic which is a combination of the Genetic Algorithm (GA) and the Cross Entropy (CE) named Cross Entropy Genetic Algorithm (CEGA) to solve the 2L-HFVRP. The mutation concept on GA is used to speed up the algorithm CE to find the optimal solution. The mutation mechanism was based on local improvement (2-opt, 1-1 Exchange, and 1-0 Exchange). The probability transition matrix mechanism on CE is used to avoid getting stuck in the local optimum. The effectiveness of CEGA was tested on benchmark instance based 2L-HFVRP. The result of experiments shows a competitive result compared with the other algorithm.
International Nuclear Information System (INIS)
Kim, Han Gon
1993-02-01
In pressurized water reactors, the fuel reloading problem has significant meaning in terms of both safety and economic aspects. Therefore the general problem of incore fuel management for a PWR consists of determining the fuel reloading policy for each cycle that minimize unit energy cost under the constraints imposed on various core parameters, e.g., a local power peaking factor and an assembly burnup. This is equivalent that a cycle length is maximized for a given energy cost under the various constraints. Existing optimization methods do not ensure the global optimum solution because of the essential limitation of their searching algorithms. They only find near optimal solutions. To solve this limitation, a hybrid artificial neural network system is developed for the optimal fuel loading pattern design using a fuzzy rule based system and an artificial neural networks. This system finds the patterns that P max is lower than the predetermined value and K eff is larger than the reference value. The back-propagation networks are developed to predict PWR core parameters. Reference PWR is an 121-assembly typical PWR. The local power peaking factor and the effective multiplication factor at BOC condition are predicted. To obtain target values of these two parameters, the QCC code are used. Using this code, 1000 training patterns are obtained, randomly. Two networks are constructed, one for P max and another for K eff Both of two networks have 21 input layer neurons, 18 output layer neurons, and 120 and 393 hidden layer neurons, respectively. A new learning algorithm is proposed. This is called the advanced adaptive learning algorithm. The weight change step size of this algorithm is optimally varied inversely proportional to the average difference between an actual output value and an ideal target value. This algorithm greatly enhances the convergence speed of a BPN. In case of P max prediction, 98% of the untrained patterns are predicted within 6% error, and in case
Directory of Open Access Journals (Sweden)
Masoud Rabbani
2017-02-01
Full Text Available Nowadays, fiber-optic due to having greater bandwidth and being more efficient compared with other similar technologies, are counted as one the most important tools for data transfer. In this article, an integrated mathematical model for a three-level fiber-optic distribution network with consideration of simultaneous backbone and local access networks is presented in which the backbone network is a ring and the access networks has a star-star topology. The aim of the model is to determine the location of the central offices and splitters, how connections are made between central offices, and allocation of each demand node to a splitter or central office in a way that the wiring cost of fiber optical and concentrator installation are minimized. Moreover, each user’s desired bandwidth should be provided efficiently. Then, the proposed model is validated by GAMS software in small-sized problems, afterwards the model is solved by two meta-heuristic methods including differential evolution (DE and genetic algorithm (GA in large-scaled problems and the results of two algorithms are compared with respect to computational time and objective function obtained value. Finally, a sensitivity analysis is provided. Keyword: Fiber-optic, telecommunication network, hub-location, passive splitter, three-level network.
Mericle, Amy A; Kaskutas, Lee A; Polcin, Doug L; Karriker-Jaffe, Katherine J
2018-01-01
Socioecological approaches to public health problems like addiction emphasize the importance of person-environment interactions. Neighborhood and social network characteristics may influence the likelihood of relapse among individuals in recovery, but these factors have been understudied, particularly with respect to conceptualizing social network characteristics as moderators of neighborhood disadvantage. Drawing from a larger prospective study of individuals recruited from outpatient treatment (N=451) and interviewed 1, 3, 5, and 7 years later, the aim of this study was to examine the independent and interactive effects of neighborhood and social network characteristics on continued problem drinking after treatment. Models using generalized estimating equations controlling for demographic and other risk factors found the number of heavy drinkers in one's network increases risk of relapse, with the effects being significantly stronger among those living in disadvantaged neighborhoods than among those in non-disadvantaged neighborhoods. No independent effects were found for neighborhood disadvantage or for the number of network members supporting reduced drinking. Future research is needed to examine potential protective factors in neighborhoods which may offset socioeconomic disadvantage as well as to investigate the functions that network members serve in helping to improve long-term treatment outcomes.
Towards a Versatile Problem Diagnosis Infrastructure for LargeWireless Sensor Networks
Iwanicki, Konrad; Steen, van Maarten
2007-01-01
In this position paper, we address the issue of durable maintenance of a wireless sensor network, which will be crucial if the vision of large, long-lived sensornets is to become reality. Durable maintenance requires tools for diagnosing and fixing occurring problems, which can range from
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems
van Iersel, L.J.J.; Kelk, Steven; Stougie, Leen; Boes, Olivier
2017-01-01
The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegree two is minimized. However, from a biological point of view accurately inferring the root location in a phylogenetic
1991-06-01
Proceedings of The National Conference on Artificial Intelligence , pages 181-184, The American Association for Aritificial Intelligence , Pittsburgh...Intermediary Resource: Intelligent Executive Computer Communication John Lyman and Carla J. Conaway University of California at Los Angeles for Contracting...Include Security Classification) Interim Report: Distributed Problem Solving: Adaptive Networks With a Computer Intermediary Resource: Intelligent
A Branch-and-Price Approach to the Feeder Network Design Problem
DEFF Research Database (Denmark)
Santini, Alberto; Plum, Christian Edinger Munk; Røpke, Stefan
2017-01-01
In this paper we consider the problem of designing a container liner shipping feeder network. The designer has to choose which port to serve during many rotations that start and end at a central hub. Many operational characteristics are considered, such as variable leg-by-leg speeds and cargo...
Quadratic head loss approximations for optimisation problems in water supply networks
Pecci, Filippo; Abraham, E.; I, Stoianov
2017-01-01
This paper presents a novel analysis of the accuracy of quadratic approximations for the Hazen–Williams (HW) head loss formula, which enables the control of constraint violations in optimisation problems for water supply networks. The two smooth polynomial approximations considered here minimise the
Energy Technology Data Exchange (ETDEWEB)
Bernstein, Andrey [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhao, Changhong [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Wang, Cong [Ecole Polytechnique Federale de Lausanne (EPFL); Le Boudec, Jean-Yves [Ecole Polytechnique Federale de Lausanne (EPFL)
2018-04-06
This paper considers unbalanced multiphase distribution systems with generic topology and different load models, and extends the Z-bus iterative load-flow algorithm based on a fixed-point interpretation of the AC load-flow equations. Explicit conditions for existence and uniqueness of load-flow solutions are presented. These conditions also guarantee convergence of the load-flow algorithm to the unique solution. The proposed methodology is applicable to generic systems featuring (i) wye connections; (ii) ungrounded delta connections; (iii) a combination of wye-connected and delta-connected sources/loads; and, (iv) a combination of line-to-line and line-to-grounded-neutral devices at the secondary of distribution transformers. Further, a sufficient condition for the non-singularity of the load-flow Jacobian is proposed. Finally, linear load-flow models are derived, and their approximation accuracy is analyzed. Theoretical results are corroborated through experiments on IEEE test feeders.
Energy Technology Data Exchange (ETDEWEB)
Cogo, Joao Roberto [Escola Federal de Engenharia de Itajuba, MG (Brazil)
1994-12-31
The non linear electrical loads can give rise to a number of disturbances in electrical power networks. Among them, the high consumption of relative power is to be noted and so is the several harmonic components which may be injected in the industry system and very often in the utility system. So, by using appropriate technical considerations, as well as measurements in typical special electrical loads, such negative effects are analyzed and ways of minimizing them are suggested. (author) 3 refs., 11 figs., 6 tabs.
Chen, Zhong; Liu, June; Li, Xiong
2017-01-01
A two-stage artificial neural network (ANN) based on scalarization method is proposed for bilevel biobjective programming problem (BLBOP). The induced set of the BLBOP is firstly expressed as the set of minimal solutions of a biobjective optimization problem by using scalar approach, and then the whole efficient set of the BLBOP is derived by the proposed two-stage ANN for exploring the induced set. In order to illustrate the proposed method, seven numerical examples are tested and compared with results in the classical literature. Finally, a practical problem is solved by the proposed algorithm. PMID:29312446
Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach
Directory of Open Access Journals (Sweden)
Khalid Haddouch
2016-09-01
Full Text Available A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs. In this paper, we model this problem in terms of in original 0-1 quadratic programming subject to leaner constraints. View it performance, we use the continuous Hopfield network to solve the obtained model basing on original energy function. To validate our model, we solve several instance of benchmarking WCSP. In this regard, our approach recognizes the optimal solution of the said instances.
An L∞/L1-Constrained Quadratic Optimization Problem with Applications to Neural Networks
International Nuclear Information System (INIS)
Leizarowitz, Arie; Rubinstein, Jacob
2003-01-01
Pattern formation in associative neural networks is related to a quadratic optimization problem. Biological considerations imply that the functional is constrained in the L ∞ norm and in the L 1 norm. We consider such optimization problems. We derive the Euler-Lagrange equations, and construct basic properties of the maximizers. We study in some detail the case where the kernel of the quadratic functional is finite-dimensional. In this case the optimization problem can be fully characterized by the geometry of a certain convex and compact finite-dimensional set
Can a large neutron excess help solve the baryon loading problem in gamma-Ray burst fireballs?
Fuller; Pruet; Abazajian
2000-09-25
We point out that the baryon loading problem in gamma-ray burst (GRB) models can be ameliorated if a significant fraction of the baryons which inertially confine the fireball is converted to neutrons. A high neutron fraction can result in a reduced transfer of energy from relativistic light particles in the fireball to baryons. The energy needed to produce the required relativistic flow in the GRB is consequently reduced, in some cases by orders of magnitude. A high neutron-to-proton ratio has been calculated in neutron star-merger fireball environments. Significant neutron excess also could occur near compact objects with high neutrino fluxes.
A minimum resource neural network framework for solving multiconstraint shortest path problems.
Zhang, Junying; Zhao, Xiaoxue; He, Xiaotao
2014-08-01
Characterized by using minimum hard (structural) and soft (computational) resources, a novel parameter-free minimal resource neural network (MRNN) framework is proposed for solving a wide range of single-source shortest path (SP) problems for various graph types. The problems are the k-shortest time path problems with any combination of three constraints: time, hop, and label constraints, and the graphs can be directed, undirected, or bidirected with symmetric and/or asymmetric traversal time, which can be real and time dependent. Isomorphic to the graph where the SP is to be sought, the network is activated by generating autowave at source neuron and the autowave travels automatically along the paths with the speed of a hop in an iteration. Properties of the network are studied, algorithms are presented, and computation complexity is analyzed. The framework guarantees globally optimal solutions of a series of problems during the iteration process of the network, which provides insight into why even the SP is still too long to be satisfied. The network facilitates very large scale integrated circuit implementation and adapt to very large scale problems due to its massively parallel processing and minimum resource utilization. When implemented in a sequentially processing computer, experiments on synthetic graphs, road maps of cities of the USA, and vehicle routing with time windows indicate that the MRNN is especially efficient for large scale sparse graphs and even dense graphs with some constraints, e.g., the CPU time taken and the iteration number used for the road maps of cities of the USA is even less than ∼ 2% and 0.5% that of the Dijkstra's algorithm.
Directory of Open Access Journals (Sweden)
Botond Molnár
Full Text Available There has been a long history of using neural networks for combinatorial optimization and constraint satisfaction problems. Symmetric Hopfield networks and similar approaches use steepest descent dynamics, and they always converge to the closest local minimum of the energy landscape. For finding global minima additional parameter-sensitive techniques are used, such as classical simulated annealing or the so-called chaotic simulated annealing, which induces chaotic dynamics by addition of extra terms to the energy landscape. Here we show that asymmetric continuous-time neural networks can solve constraint satisfaction problems without getting trapped in non-solution attractors. We concentrate on a model solving Boolean satisfiability (k-SAT, which is a quintessential NP-complete problem. There is a one-to-one correspondence between the stable fixed points of the neural network and the k-SAT solutions and we present numerical evidence that limit cycles may also be avoided by appropriately choosing the parameters of the model. This optimal parameter region is fairly independent of the size and hardness of instances, this way parameters can be chosen independently of the properties of problems and no tuning is required during the dynamical process. The model is similar to cellular neural networks already used in CNN computers. On an analog device solving a SAT problem would take a single operation: the connection weights are determined by the k-SAT instance and starting from any initial condition the system searches until finding a solution. In this new approach transient chaotic behavior appears as a natural consequence of optimization hardness and not as an externally induced effect.
Learner Perspectives of Online Problem-Based Learning and Applications from Cognitive Load Theory
Chen, Ruth
2016-01-01
Problem-based learning (PBL) courses have historically been situated in physical classrooms involving in-person interactions. As online learning is embraced in higher education, programs that use PBL can integrate online platforms to support curriculum delivery and facilitate student engagement. This report describes student perspectives of the…
Method of Geometric Connected Disk Cover Problem for UAV realy network deployment
Directory of Open Access Journals (Sweden)
Chuang Liu
2017-01-01
Full Text Available Aiming at the problem of the effective connectivity of a large number of mobile combat units in the future aeronautic swarm operation, this paper proposes an idea of using UAV(Unmanned Aerial Vehicle to build, and studies the deployment of the network. User coverage and network connectivity are important for a relay network planning which are studied separately in traditional ways. In order to effectively combine these two factors while the network’s survivability is taken into account. Firstly, the concept of node aggregation degree is proposed. Secondly, a performance evaluation parameter for UAV relay network is proposed based on node aggregation degree, then analyzes the lack of deterministic deployment and presents one a PSO (VFA-PSO deployment algorithm based on virtual force. Finally, compared with the existing algorithms, the validity and stability of the algorithm are verified. The experimental results show that the VFA-PSO algorithm can effectively improve the network coverage and the survivability of the network under the premise of ensuring the network connectivity, and has better deployment effect.
PROACTIVE APPROACH TO THE INCIDENT AND PROBLEM MANAGEMENT IN COMMUNICATION NETWORKS
Directory of Open Access Journals (Sweden)
Vjeran Strahonja
2007-06-01
Full Text Available Proactive approach to communication network maintenance has the capability of enhancing the integrity and reliability of communication networks, as well as of reducing maintenance costs and overall number of incidents. This paper presents approaches to problem and incident prevention with the help of root-cause analysis, aligning that with the goal to foresee software performance. Implementation of proactive approach requires recognition of enterprise's current level of maintenance better insights into available approaches and tools, as well as their comparison, interoperability, integration and further development. The approach we are proposing and elaborating in this paper lies on the construction of a metamodel of the problem management of information technology, particularly the proactive problem management. The metamodel is derived from the original ITIL specification and presented in an object-oriented fashion by using structure (class diagrams conform to UML notation. Based on current research, appropriate metrics based on the concept of Key Performance Indicators is suggested.
Cichocki, A; Unbehauen, R
1994-01-01
In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known algorithms: the row-action projection-Kaczmarz algorithm and/or the LMS (Adaline) Widrow-Hoff algorithms. The algorithms can be applied to any problem which can be formulated as a linear regression problem. The correctness and high performance of the proposed neural networks are illustrated by extensive computer simulation results.
In Risky Environments, Emotional Children Have More Behavioral Problems but Lower Allostatic Load
DEFF Research Database (Denmark)
Dich, Nadya; Doan, Stacey N.; Evans, Gary W.
2017-01-01
Objective: Developmental models of temperament by environment interactions predict that children’s negative emotionality exacerbates the detrimental effects of risky environments, increasing the risk for pathology. However, negative emotions may have an adaptive function. Accordingly, the present...... study explores an alternative hypothesis that in the context of high adversity, negative emotionality may be a manifestation of an adaptive coping style and thus be protective against the harmful effects of a stressful environment. Method: Prospective combined effects of negative emotionality...... assessed at baseline. Internalizing and externalizing behaviors were measured at 4- and 8-year follow-ups. Allostatic load was measured at baseline and both follow-ups using neuroendocrine, cardiovascular, and metabolic parameters. Linear mixed-effect models were used to analyze the prospective...
International Nuclear Information System (INIS)
Loula, A.F.D.; Toledo, E.M.; Franca, L.P.; Garcia, E.L.M.
1989-08-01
A variationaly consistent finite element formulation for constrained problems free from shear or membrane locking is applied to axisymetric shells subjected to arbitrary loading. The governing equations are writen according to Love's classical theory for a problem of bending of axisymetric thin and moderately thick shells accounting for shear deformation. The mixed variational formulation, in terms of stresses and displacements here presented consists of classical Galerkin method plus mesh-dependent least-square type terms employed with equal-order finite element polynomials. The additional terms enhance stability and accuracy of the original Galerkin method, as already proven theoretically and confirmed trough numerical experiments. Numerical results of some examples are presented to demonstrate the good stability and accuracy of the formulation. (author) [pt
Directory of Open Access Journals (Sweden)
S. A. Eftekhari
Full Text Available AbstractThe differential quadrature method (DQM is one of the most elegant and efficient methods for the numerical solution of partial differential equations arising in engineering and applied sciences. It is simple to use and also straightforward to implement. However, the DQM is well-known to have some difficulty when applied to partial differential equations involving singular functions like the Dirac-delta function. This is caused by the fact that the Dirac-delta function cannot be directly discretized by the DQM. To overcome this difficulty, this paper presents a simple differential quadrature procedure in which the Dirac-delta function is replaced by regularized smooth functions. By regularizing the Dirac-delta function, such singular function is treated as non-singular functions and can be easily and directly discretized using the DQM. To demonstrate the applicability and reliability of the proposed method, it is applied here to solve some moving load problems of beams and rectangular plates, where the location of the moving load is described by a time-dependent Dirac-delta function. The results generated by the proposed method are compared with analytical and numerical results available in the literature. Numerical results reveal that the proposed method can be used as an efficient tool for dynamic analysis of beam- and plate-type structures traversed by moving dynamic loads.
DEFF Research Database (Denmark)
Gamst, M.
2014-01-01
problem. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results show that solving the integrated job scheduling and constrained network routing problem to optimality is very difficult. The exact solution approach performs......This paper examines the problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job has a certain demand, which must be sent to the executing machine via constrained paths. A job cannot start before all its demands have...... arrived at the machine. Furthermore, two resource demand transmissions cannot use the same edge in the same time period. The problem has application in grid computing, where a number of geographically distributed machines work together for solving large problems. The machines are connected through...
Energy Technology Data Exchange (ETDEWEB)
Sriyanyong, P. [King Mongkut' s Univ. of Technology, Bangkok (Thailand). Dept. of Teacher Training in Electrical Engineering
2008-07-01
This paper described the use of an enhanced particle swarm optimization (PSO) model to address the problem of dynamic economic dispatch (DED). A modified heuristic search method was incorporated into the PSO model. Both smooth and non-smooth cost functions were considered. The enhanced PSO model not only utilized the basic PSO algorithm in order to seek the optimal solution for the DED problem, but it also used a modified heuristic method to deal with constraints and increase the possibility of finding a feasible solution. In order to validate the enhanced PSO model, it was used and tested on 10-unit systems considering both smooth and non-smooth cost functions characteristics. The experimental results were also compared to other methods. The proposed technique was found to be better than other approaches. The enhanced PSO model outperformed others with respect to quality, stability and reliability. 23 refs., 1 tab., 8 figs.
An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem
2009-03-01
cargo, and the problem therefore becomes trivial. 3. Shoring: Some cargo requires shoring which is small planks of plywood stacked on top of each...Integer Programming Method In 1989, Kevin Ng examined the bin-packing MPALP for Canada’s C-130 aircraft (Ng 1992). His goal was to move a set of... leadership & ethics [ ] warfighting [ ] international security [ ] doctrine [X] other (specify): Military Airlift
A Very Large Area Network (VLAN) knowledge-base applied to space communication problems
Zander, Carol S.
1988-01-01
This paper first describes a hierarchical model for very large area networks (VLAN). Space communication problems whose solution could profit by the model are discussed and then an enhanced version of this model incorporating the knowledge needed for the missile detection-destruction problem is presented. A satellite network or VLAN is a network which includes at least one satellite. Due to the complexity, a compromise between fully centralized and fully distributed network management has been adopted. Network nodes are assigned to a physically localized group, called a partition. Partitions consist of groups of cell nodes with one cell node acting as the organizer or master, called the Group Master (GM). Coordinating the group masters is a Partition Master (PM). Knowledge is also distributed hierarchically existing in at least two nodes. Each satellite node has a back-up earth node. Knowledge must be distributed in such a way so as to minimize information loss when a node fails. Thus the model is hierarchical both physically and informationally.
Storage Solutions for Power Quality Problems in Cyprus Electricity Distribution Network
Directory of Open Access Journals (Sweden)
Andreas Poullikkas
2014-01-01
Full Text Available In this work, a prediction of the effects of introducing energy storage systems on the network stability of the distribution network of Cyprus and a comparison in terms of cost with a traditional solution is carried out. In particular, for solving possible overvoltage problems, several scenarios of storage units' installation are used and compared with the alternative solution of extra cable connection between the node with the lowest voltage and the node with the highest voltage of the distribution network. For the comparison, a case study of a typical LV distribution feeder in the power system of Cyprus is used. The results indicated that the performance indicator of each solution depends on the type, the size and the position of installation of the storage unit. Also, as more storage units are installed the better the performance indicator and the more attractive is the investment in storage units to solve power quality problems in the distribution network. In the case where the technical requirements in voltage limitations according to distribution regulations are satisfied with one storage unit, the installation of an additional storage unit will only increase the final cost. The best solution, however, still remains the alternative solution of extra cable connection between the node with the lowest voltage and the node with the highest voltage of the distribution network, due to the lower investment costs compared to that of the storage units.
International Nuclear Information System (INIS)
Lefik, M.; Schrefler, B.A.
2002-01-01
An artificial neural network with two hidden layers is trained to define a mechanical constitutive relation for superconducting cable under transverse cyclic loading. The training is performed using a set of experimental data. The behaviour of the cable is strongly non-linear. Irreversible phenomena result with complicated loops of hysteresis. The performance of the ANN, which is applied as a tool for storage, interpolation and interpretation of experimental data is investigated, both from numerical, as well as from physical viewpoints
Directory of Open Access Journals (Sweden)
Foday Conteh
2017-09-01
Full Text Available In recent years, the use of renewable energy sources in micro-grids has become an effectivemeans of power decentralization especially in remote areas where the extension of the main power gridis an impediment. Despite the huge deposit of natural resources in Africa, the continent still remains inenergy poverty. Majority of the African countries could not meet the electricity demand of their people.Therefore, the power system is prone to frequent black out as a result of either excess load to the systemor generation failure. The imbalance of power generation and load demand has been a major factor inmaintaining the stability of the power systems and is usually responsible for the under frequency andunder voltage in power systems. Currently, load shedding is the most widely used method to balancebetween load and demand in order to prevent the system from collapsing. But the conventional methodof under frequency or under voltage load shedding faces many challenges and may not perform asexpected. This may lead to over shedding or under shedding, causing system blackout or equipmentdamage. To prevent system cascade or equipment damage, appropriate amount of load must beintentionally and automatically curtailed during instability. In this paper, an effective load sheddingtechnique for micro-grids using artificial neural network and adaptive neuro-fuzzy inference system isproposed. The combined techniques take into account the actual system state and the exact amount ofload needs to be curtailed at a faster rate as compared to the conventional method. Also, this methodis able to carry out optimal load shedding for any input range other than the trained data. Simulationresults obtained from this work, corroborate the merit of this algorithm.
A service flow model for the liner shipping network design problem
DEFF Research Database (Denmark)
Plum, Christian Edinger Munk; Pisinger, David; Sigurd, Mikkel M.
2014-01-01
. The formulation alleviates issues faced by arc flow formulations with regards to handling multiple calls to the same port. A problem which has not been fully dealt with earlier by LSNDP formulations. Multiple calls are handled by introducing service nodes, together with port nodes in a graph representation...... of the network and a penalty for not flowed cargo. The model can be used to design liner shipping networks to utilize a container carrier’s assets efficiently and to investigate possible scenarios of changed market conditions. The model is solved as a Mixed Integer Program. Results are presented for the two...
A note on the consensus finding problem in communication networks with switching topologies
Haskovec, Jan
2014-05-07
In this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates. We formulate sufficient conditions for consensus finding in terms of strong connectivity of the underlying directed graphs and prove that, given these conditions, consensus is found asymptotically. Moreover, we show that this consensus is an emergent property of the system, being encoded in its dynamics and not just an invariant of its initial configuration. © 2014 © 2014 Taylor & Francis.
Tight bounds on the size of neural networks for classification problems
Energy Technology Data Exchange (ETDEWEB)
Beiu, V. [Los Alamos National Lab., NM (United States); Pauw, T. de [Universite Catholique de Louvain, Louvain-la-Neuve (Belgium). Dept. de Mathematique
1997-06-01
This paper relies on the entropy of a data-set (i.e., number-of-bits) to prove tight bounds on the size of neural networks solving a classification problem. First, based on a sequence of geometrical steps, the authors constructively compute an upper bound of O(mn) on the number-of-bits for a given data-set - here m is the number of examples and n is the number of dimensions (i.e., R{sup n}). This result is used further in a nonconstructive way to bound the size of neural networks which correctly classify that data-set.
A dual exterior point simplex type algorithm for the minimum cost network flow problem
Directory of Open Access Journals (Sweden)
Geranis George
2009-01-01
Full Text Available A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category. Similarly to the classical network dual simplex algorithm (NDSA, this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution outside the dual feasible area (exterior point - dual infeasible tree.
Modeling Multilevel Supplier Selection Problem Based on Weighted-Directed Network and Its Solution
Directory of Open Access Journals (Sweden)
Chia-Te Wei
2017-01-01
Full Text Available With the rapid development of economy, the supplier network is becoming more and more complicated. It is important to choose the right suppliers for improving the efficiency of the supply chain, so how to choose the right ones is one of the important research directions of supply chain management. This paper studies the partner selection problem from the perspective of supplier network global optimization. Firstly, this paper discusses and forms the evaluation system to estimate the supplier from the two indicators of risk and greenness and then applies the value as the weight of the network between two nodes to build a weighted-directed supplier network; secondly, the study establishes the optimal combination model of supplier selection based on the global network perspective and solves the model by the dynamic programming-tabu search algorithm and the improved ant colony algorithm, respectively; finally, different scale simulation examples are given to testify the efficiency of the two algorithms. The results show that the ant colony algorithm is superior to the tabu search one as a whole, but the latter is slightly better than the former when network scale is small.
Beshtokov, M. Kh.
2017-12-01
Boundary value problems for loaded third-order pseudo-parabolic equations with variable coefficients are considered. A priori estimates for the solutions of the problems in the differential and difference formulations are obtained. These a priori estimates imply the uniqueness and stability of the solution with respect to the initial data and the right-hand side on a layer, as well as the convergence of the solution of each difference problem to the solution of the corresponding differential problem.
Directory of Open Access Journals (Sweden)
Khalid Qaraqe
2008-10-01
Full Text Available This paper proposes a novel vertical handoff algorithm between WLAN and CDMA networks to enable the integration of these networks. The proposed vertical handoff algorithm assumes a handoff decision process (handoff triggering and network selection. The handoff trigger is decided based on the received signal strength (RSS. To reduce the likelihood of unnecessary false handoffs, the distance criterion is also considered. As a network selection mechanism, based on the wireless channel assignment algorithm, this paper proposes a context-based network selection algorithm and the corresponding communication algorithms between WLAN and CDMA networks. This paper focuses on a handoff triggering criterion which uses both the RSS and distance information, and a network selection method which uses context information such as the dropping probability, blocking probability, GoS (grade of service, and number of handoff attempts. As a decision making criterion, the velocity threshold is determined to optimize the system performance. The optimal velocity threshold is adjusted to assign the available channels to the mobile stations. The optimal velocity threshold is adjusted to assign the available channels to the mobile stations using four handoff strategies. The four handoff strategies are evaluated and compared with each other in terms of GOS. Finally, the proposed scheme is validated by computer simulations.
Directory of Open Access Journals (Sweden)
Kim Jang-Sub
2008-01-01
Full Text Available This paper proposes a novel vertical handoff algorithm between WLAN and CDMA networks to enable the integration of these networks. The proposed vertical handoff algorithm assumes a handoff decision process (handoff triggering and network selection. The handoff trigger is decided based on the received signal strength (RSS. To reduce the likelihood of unnecessary false handoffs, the distance criterion is also considered. As a network selection mechanism, based on the wireless channel assignment algorithm, this paper proposes a context-based network selection algorithm and the corresponding communication algorithms between WLAN and CDMA networks. This paper focuses on a handoff triggering criterion which uses both the RSS and distance information, and a network selection method which uses context information such as the dropping probability, blocking probability, GoS (grade of service, and number of handoff attempts. As a decision making criterion, the velocity threshold is determined to optimize the system performance. The optimal velocity threshold is adjusted to assign the available channels to the mobile stations. The optimal velocity threshold is adjusted to assign the available channels to the mobile stations using four handoff strategies. The four handoff strategies are evaluated and compared with each other in terms of GOS. Finally, the proposed scheme is validated by computer simulations.
Energy Technology Data Exchange (ETDEWEB)
Glaser, Daniel; Adelhardt, Stefan [Erlangen-Nuernberg Univ., Erlangen (Germany). Lehrstuhl fuer Sensorik; beECO GmbH, Erlangen (Germany)
2012-07-01
Heat-guided combined heat and power (CHP) plants often cause large compensation energy amounts, additional costs to the operator respectively and another burden on the parent network. The balance energy is caused by errors in the production forecast whose quality heavily depends on the heat load performance. This paper identifies the forecasting problems with heat-guided CHP and reveals how the accompanying cost and the network burden can be reduced. This is achieved by an improvement of the forecast in conjunction with a forecast-guided control without affecting the heat supply. In addition, an outlook on further measures to the earnings with the system is presented. (orig.)
Fortuin, Janna; van Geel, Mitch; Vedder, Paul
2015-04-01
Adolescents who like each other may become more similar to each other with regard to internalizing and externalizing problems, though it is not yet clear which social mechanisms explain these similarities. In this longitudinal study, we analyzed four mechanisms that may explain similarity in adolescent peer networks with regard to externalizing and internalizing problems: selection, socialization, avoidance and withdrawal. At three moments during one school-year, we asked 542 adolescents (8th grade, M-age = 13.3 years, 51 % female) to report who they liked in their classroom, and their own internalizing and externalizing problems. Adolescents tend to prefer peers who have similar externalizing problem scores, but no significant selection effect was found for internalizing problems. Adolescents who share the same group of friends socialize each other and then become more similar with respect to externalizing problems, but not with respect to internalizing problems. We found no significant effects for avoidance or withdrawal. Adolescents may choose to belong to a peer group that is similar to them in terms of externalizing problem behaviors, and through peer group socialization (e.g., enticing, modelling, mimicking, and peer pressure) become more similar to that group over time.
Energy Technology Data Exchange (ETDEWEB)
Jarjis, J; Galiana, F D
1980-03-01
A set theoretic analysis of loadflow feasibility of a general power network with arbitrary PQ, PV and slack buses is presented. Load-flow feasibility is that property of a power network defining the theoretical limitations on the bus injections under which a steady state equilibrium exists. The set theoretic analysis is based on the study of the conical loadflow feasibility region. This region is characterised by a set of supporting hyperplanes each of which defines an explicit necessary condition for loadflow feasibility on the bus injections. A quantitative measure of loadflow feasibility for an arbitrary given operating injection vector is defined through a computable scalar stability margin. This stability margin permits the loadflow feasibility of different injections and network structures to be quantitatively compared and analysed.
International Nuclear Information System (INIS)
Shafie-khah, M.; Moghaddam, M.P.; Sheikh-El-Eslami, M.K.; Catalão, J.P.S.
2014-01-01
Highlights: • A novel hybrid method based on decomposition of SCUC into QP and BP problems is proposed. • An adapted binary programming and an enhanced dual neural network model are applied. • The proposed EDNN is exactly convergent to the global optimal solution of QP. • An AC power flow procedure is developed for including contingency/security issues. • It is suited for large-scale systems, providing both accurate and fast solutions. - Abstract: This paper presents a novel hybrid method for solving the security constrained unit commitment (SCUC) problem. The proposed formulation requires much less computation time in comparison with other methods while assuring the accuracy of the results. Furthermore, the framework provided here allows including an accurate description of warmth-dependent startup costs, valve point effects, multiple fuel costs, forbidden zones of operation, and AC load flow bounds. To solve the nonconvex problem, an adapted binary programming method and enhanced dual neural network model are utilized as optimization tools, and a procedure for AC power flow modeling is developed for including contingency/security issues, as new contributions to earlier studies. Unlike classical SCUC methods, the proposed method allows to simultaneously solve the unit commitment problem and comply with the network limits. In addition to conventional test systems, a real-world large-scale power system with 493 units has been used to fully validate the effectiveness of the novel hybrid method proposed
A Bayesian network approach to the database search problem in criminal proceedings
2012-01-01
Background The ‘database search problem’, that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions
The Bilevel Design Problem for Communication Networks on Trains: Model, Algorithm, and Verification
Directory of Open Access Journals (Sweden)
Yin Tian
2014-01-01
Full Text Available This paper proposes a novel method to solve the problem of train communication network design. Firstly, we put forward a general description of such problem. Then, taking advantage of the bilevel programming theory, we created the cost-reliability-delay model (CRD model that consisted of two parts: the physical topology part aimed at obtaining the networks with the maximum reliability under constrained cost, while the logical topology part focused on the communication paths yielding minimum delay based on the physical topology delivered from upper level. We also suggested a method to solve the CRD model, which combined the genetic algorithm and the Floyd-Warshall algorithm. Finally, we used a practical example to verify the accuracy and the effectiveness of the CRD model and further applied the novel method on a train with six carriages.
Shortest path problem on a grid network with unordered intermediate points
Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen
2017-10-01
We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.
Heuristic rules embedded genetic algorithm to solve VVER loading pattern optimization problem
International Nuclear Information System (INIS)
Fatih, Alim; Kostandi, Ivanov
2006-01-01
Full text: Loading Pattern (LP) optimization is one of the most important aspects of the operation of nuclear reactors. A genetic algorithm (GA) code GARCO (Genetic Algorithm Reactor Optimization Code) has been developed with embedded heuristic techniques to perform optimization calculations for in-core fuel management tasks. GARCO is a practical tool that includes a unique methodology applicable for all types of Pressurized Water Reactor (PWR) cores having different geometries with an unlimited number of FA types in the inventory. GARCO was developed by modifying the classical representation of the genotype. Both the genotype representation and the basic algorithm have been modified to incorporate the in-core fuel management heuristics rules so as to obtain the best results in a shorter time. GARCO has three modes. Mode 1 optimizes the locations of the fuel assemblies (FAs) in the nuclear reactor core, Mode 2 optimizes the placement of the burnable poisons (BPs) in a selected LP, and Mode 3 optimizes simultaneously both the LP and the BP placement in the core. This study describes the basic algorithm for Mode 1. The GARCO code is applied to the VVER-1000 reactor hexagonal geometry core in this study. The M oby-Dick i s used as reactor physics code to deplete FAs in the core. It was developed to analyze the VVER reactors by SKODA Inc. To use these rules for creating the initial population with GA operators, the worth definition application is developed. Each FA has a worth value for each location. This worth is between 0 and 1. If worth of any FA for a location is larger than 0.5, this FA in this location is a good choice. When creating the initial population of LPs, a subroutine provides a percent of individuals, which have genes with higher than the 0.5 worth. The percentage of the population to be created without using worth definition is defined in the GARCO input. And also age concept has been developed to accelerate the GA calculation process in reaching the
Palchak, David
Electrical load forecasting is a tool that has been utilized by distribution designers and operators as a means for resource planning and generation dispatch. The techniques employed in these predictions are proving useful in the growing market of consumer, or end-user, participation in electrical energy consumption. These predictions are based on exogenous variables, such as weather, and time variables, such as day of week and time of day as well as prior energy consumption patterns. The participation of the end-user is a cornerstone of the Smart Grid initiative presented in the Energy Independence and Security Act of 2007, and is being made possible by the emergence of enabling technologies such as advanced metering infrastructure. The optimal application of the data provided by an advanced metering infrastructure is the primary motivation for the work done in this thesis. The methodology for using this data in an energy management scheme that utilizes a short-term load forecast is presented. The objective of this research is to quantify opportunities for a range of energy management and operation cost savings of a university campus through the use of a forecasted daily electrical load profile. The proposed algorithm for short-term load forecasting is optimized for Colorado State University's main campus, and utilizes an artificial neural network that accepts weather and time variables as inputs. The performance of the predicted daily electrical load is evaluated using a number of error measurements that seek to quantify the best application of the forecast. The energy management presented utilizes historical electrical load data from the local service provider to optimize the time of day that electrical loads are being managed. Finally, the utilization of forecasts in the presented energy management scenario is evaluated based on cost and energy savings.
A neural-network approach to the problem of photon-pair combinatorics
International Nuclear Information System (INIS)
Awes, T.C.
1990-06-01
A recursive neural-network algorithm is applied to the problem of correctly pairing photons from π 0 , η, and higher resonance decays in the presence of a large background of photons resulting from many simultaneous decays. The method uses the full information of the multi-photon final state to suppress the selection of false photon pairs which arise from the many combinatorial possibilities. The method is demonstrated for simulated photon events under semirealistic experimental conditions. 3 refs., 3 figs
Problems With Deployment of Multi-Domained, Multi-Homed Mobile Networks
Ivancic, William D.
2008-01-01
This document describes numerous problems associated with deployment of multi-homed mobile platforms consisting of multiple networks and traversing large geographical areas. The purpose of this document is to provide insight to real-world deployment issues and provide information to groups that are addressing many issues related to multi-homing, policy-base routing, route optimization and mobile security - particularly those groups within the Internet Engineering Task Force.
A neural network approach to breast cancer diagnosis as a constraint satisfaction problem
International Nuclear Information System (INIS)
Tourassi, Georgia D.; Markey, Mia K.; Lo, Joseph Y.; Floyd, Carey E. Jr.
2001-01-01
A constraint satisfaction neural network (CSNN) approach is proposed for breast cancer diagnosis using mammographic and patient history findings. Initially, the diagnostic decision to biopsy was formulated as a constraint satisfaction problem. Then, an associative memory type neural network was applied to solve the problem. The proposed network has a flexible, nonhierarchical architecture that allows it to operate not only as a predictive tool but also as an analysis tool for knowledge discovery of association rules. The CSNN was developed and evaluated using a database of 500 nonpalpable breast lesions with definitive histopathological diagnosis. The CSNN diagnostic performance was evaluated using receiver operating characteristic analysis (ROC). The results of the study showed that the CSNN ROC area index was 0.84±0.02. The CSNN predictive performance is competitive with that achieved by experienced radiologists and backpropagation artificial neural networks (BP-ANNs) presented before. Furthermore, the study illustrates how CSNN can be used as a knowledge discovery tool overcoming some of the well-known limitations of BP-ANNs
An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks
Directory of Open Access Journals (Sweden)
Naixue Xiong
2017-06-01
Full Text Available A social network is a social structure, which is organized by the relationships or interactions between individuals or groups. Humans link the physical network with social network, and the services in the social world are based on data and analysis, which directly influence decision making in the physical network. In this paper, we focus on a routing optimization algorithm, which solves a well-known and popular problem. Ant colony algorithm is proposed to solve this problem effectively, but random selection strategy of the traditional algorithm causes evolution speed to be slow. Meanwhile, positive feedback and distributed computing model make the algorithm quickly converge. Therefore, how to improve convergence speed and search ability of algorithm is the focus of the current research. The paper proposes the improved scheme. Considering the difficulty about searching for next better city, new parameters are introduced to improve probability of selection, and delay convergence speed of algorithm. To avoid the shortest path being submerged, and improve sensitive speed of finding the shortest path, it updates pheromone regulation formula. The results show that the improved algorithm can effectively improve convergence speed and search ability for achieving higher accuracy and optimal results.
The application of neural network techniques to magnetic and optical inverse problems
International Nuclear Information System (INIS)
Jones, H.V.
2000-12-01
The processing power of the computer has increased at unimaginable rates over the last few decades. However, even today's fastest computer can take several hours to find solutions to some mathematical problems; and there are instances where a high powered supercomputer may be impractical, with the need for near instant solutions just as important (such as in an on-line testing system). This led us to believe that such complex problems could be solved using a novel approach, whereby the system would have prior knowledge about the expected solutions through a process of learning. One method of approaching this kind of problem is through the use of machine learning. Just as a human can be trained and is able to learn from past experiences, a machine is can do just the same. This is the concept of neural networks. The research which was conducted involves the investigation of various neural network techniques, and their applicability to solve some known complex inverse problems in the field of magnetic and optical recording. In some cases a comparison is also made to more conventional methods of solving the problems, from which it was possible to outline some key advantages of using a neural network approach. We initially investigated the application of neural networks to transverse susceptibility data in order to determine anisotropy distributions. This area of research is proving to be very important, as it gives us information about the switching field distribution, which then determines the minimum transition width achievable in a medium, and affects the overwrite characteristics of the media. Secondly, we investigated a similar situation, but applied to an optical problem. This involved the determination of important compact disc parameters from the diffraction pattern of a laser from a disc. This technique was then intended for use in an on-line testing system. Finally we investigated another area of neural networks with the analysis of magnetisation maps and
Li, Ming; Miao, Chunyan; Leung, Cyril
2015-12-04
Coverage control is one of the most fundamental issues in directional sensor networks. In this paper, the coverage optimization problem in a directional sensor network is formulated as a multi-objective optimization problem. It takes into account the coverage rate of the network, the number of working sensor nodes and the connectivity of the network. The coverage problem considered in this paper is characterized by the geographical irregularity of the sensed events and heterogeneity of the sensor nodes in terms of sensing radius, field of angle and communication radius. To solve this multi-objective problem, we introduce a learning automata-based coral reef algorithm for adaptive parameter selection and use a novel Tchebycheff decomposition method to decompose the multi-objective problem into a single-objective problem. Simulation results show the consistent superiority of the proposed algorithm over alternative approaches.
An Effective Recommender Algorithm for Cold-Start Problem in Academic Social Networks
Directory of Open Access Journals (Sweden)
Vala Ali Rohani
2014-01-01
Full Text Available Abundance of information in recent years has become a serious challenge for web users. Recommender systems (RSs have been often utilized to alleviate this issue. RSs prune large information spaces to recommend the most relevant items to users by considering their preferences. Nonetheless, in situations where users or items have few opinions, the recommendations cannot be made properly. This notable shortcoming in practical RSs is called cold-start problem. In the present study, we propose a novel approach to address this problem by incorporating social networking features. Coined as enhanced content-based algorithm using social networking (ECSN, the proposed algorithm considers the submitted ratings of faculty mates and friends besides user’s own preferences. The effectiveness of ECSN algorithm was evaluated by implementing it in MyExpert, a newly designed academic social network (ASN for academics in Malaysia. Real feedbacks from live interactions of MyExpert users with the recommended items are recorded for 12 consecutive weeks in which four different algorithms, namely, random, collaborative, content-based, and ECSN were applied every three weeks. The empirical results show significant performance of ECSN in mitigating the cold-start problem besides improving the prediction accuracy of recommendations when compared with other studied recommender algorithms.
Energy Technology Data Exchange (ETDEWEB)
Cristin V, Miguel A; Ortega S, Cesar A [Instituto de Investigaciones Electricas, Cuernavaca, Morelos (Mexico)
2005-07-01
The charge of lead-acid batteries (LAB), as in any other type of batteries, consists of replacing the energy consumed during the discharge. Nevertheless, as no physical or chemical process is good enough to totality recharge a battery, it is necessary to supply to it more than the 100% of the energy demanded during its discharge. A critical factor to make a suitable load control of the batteries is to determine its own state of load. That is to say, to have an efficient load control, it is necessary to count on means that allow to accurately determining the residual capacity of the battery to deliver load. This one is the one of the aspects of greater interest in the research centers around world. For this reason, in this work it was pretended to develop a calculation algorithm of the state of load of batteries based on a fuzzy-neural network that could calculate the state of load without using the battery current as an input. This is because one of the main problems for the designers of battery load controllers is the correct supervision of the current that circulates around the system in all the rank of operation of the same one because the sensors do not have a linear behavior. [Spanish] La recarga de baterias plomo-acido (BPA), como cualquier otro tipo de baterias, consiste en reponer la energia consumida durante la descarga. Sin embargo, como ningun proceso fisico o quimico es lo bastante eficiente para recargar a totalidad una bateria, es necesario suministrarle mas del 100% de la energia demandada durante su descarga. Un factor critico para realizar un adecuado control de carga de las baterias, es determinar su propio estado de carga. Es decir, para tener un control de carga eficiente, es necesario contar con un medio que permita determinar con precision la capacidad remanente de la bateria para entregar carga. Este es uno de los aspectos de mayor interes en los centros de investigacion alrededor el mundo. Por tal razon, en este trabajo se propuso
International Nuclear Information System (INIS)
Ekel, P.Y.; Galperin, E.A.
2003-01-01
Models for multicriteria resource allocation are constructed with the specific box-triangular structure of a feasible region. The method of balance set equations is extended for the satisfaction level representation of the cost function space including the case of linearly dependent cost functions. On this basis, different goal criteria on the balance set are investigated for linear cases. Procedures for determining the balance set and finding goal-optimal Pareto solutions are illustrated on examples. The results of the paper are of universal character and can find wide applications in allocating diverse types of resources on the multiobjective basis in planning and control of complex systems including load management and energy market problems. (Author)
A hopfield-like artificial neural network for solving inverse radiation transport problems
International Nuclear Information System (INIS)
Lee, Sang Hoon
1997-02-01
In this thesis, we solve inverse radiation transport problems by an Artificial Neural Network(ANN) approach. ANNs have many interesting properties such as nonlinear, parallel, and distributed processing. Some of the promising applications of ANNs are optimization, image and signal processing, system control, etc. In some optimization problems, Hopfield Neural Network(HNN) which has one-layered and fully interconnected neurons with feed-back topology showed that it worked well with acceptable fault tolerance and efficiency. The identification of radioactive source in a medium with a limited number of external detectors is treated as an inverse radiation transport problem in this work. This kind of inverse problem is usually ill-posed and severely under-determined; however, its applications are very useful in many fields including medical diagnosis and nondestructive assay of nuclear materials. Therefore, it is desired to develop efficient and robust solution algorithms. Firstly, we study a representative ANN model which has learning ability and fault tolerance, i.e., feed-forward neural network. It has an error backpropagation learning algorithm processed by reducing error in learning patterns that are usually results of test or calculation. Although it has enough fault tolerance and efficiency, a major obstacle is 'curse of dimensionality'--required number of learning patterns and learning time increase exponentially proportional to the problem size. Therefore, in this thesis, this type of ANN is used as benchmarking the reliability of the solution. Secondly, another approach for solving inverse problems, a modified version of HNN is proposed. When diagonal elements of the interconnection matrix are not zero, HNN may become unstable. However, most problems including this identification problem contain non-zero diagonal elements when programmed on neural networks. According to Soulie et al., discrete random iterations could produce the stable minimum state
Energy Technology Data Exchange (ETDEWEB)
Singh, Bhim; Kasal, Gaurav Kumar [Department of Electrical Engineering, Indian Institute of Technology, Delhi, Hauz-Khas, New Delhi 110016 (India)
2008-06-15
This paper deals with a neural network-based solid state voltage controller for an isolated asynchronous generator (IAG) driven by constant speed prime mover like diesel engine, bio-gas or gasoline engine and supplying three-phase four-wire loads. The proposed control scheme uses an indirect current control and a fast adaptive linear element (adaline) based neural network reference current extractor, which extracts the real positive sequence current component without any phase shift. The neutral current of the source is also compensated by using three single-phase bridge configuration of IGBT (insulated gate bipolar junction transistor) based voltage source converter (VSC) along-with single-phase transformer having self-supported dc bus. The proposed controller provides the functions as a voltage regulator, a harmonic eliminator, a neutral current compensator, and a load balancer. The proposed isolated electrical system with its controller is modeled and simulated in MATLAB along with Simulink and PSB (Power System Block set) toolboxes. The simulated results are presented to demonstrate the capability of an isolated asynchronous generating system driven by a constant speed prime mover for feeding three-phase four-wire loads. (author)
A Multi-Stage Reverse Logistics Network Problem by Using Hybrid Priority-Based Genetic Algorithm
Lee, Jeong-Eun; Gen, Mitsuo; Rhee, Kyong-Gu
Today remanufacturing problem is one of the most important problems regarding to the environmental aspects of the recovery of used products and materials. Therefore, the reverse logistics is gaining become power and great potential for winning consumers in a more competitive context in the future. This paper considers the multi-stage reverse Logistics Network Problem (m-rLNP) while minimizing the total cost, which involves reverse logistics shipping cost and fixed cost of opening the disassembly centers and processing centers. In this study, we first formulate the m-rLNP model as a three-stage logistics network model. Following for solving this problem, we propose a Genetic Algorithm pri (GA) with priority-based encoding method consisting of two stages, and introduce a new crossover operator called Weight Mapping Crossover (WMX). Additionally also a heuristic approach is applied in the 3rd stage to ship of materials from processing center to manufacturer. Finally numerical experiments with various scales of the m-rLNP models demonstrate the effectiveness and efficiency of our approach by comparing with the recent researches.
Angry Apps: The Impact of Network Timer Selection on Power Consumption, Signalling Load, and Web QoE
Directory of Open Access Journals (Sweden)
Christian Schwartz
2013-01-01
Full Text Available The popularity of smartphones and mobile applications has experienced a considerable growth during the recent years, and this growth is expected to continue in the future. Since smartphones have only very limited energy resources, battery efficiency is one of the determining factors for a good user experience. Therefore, some smartphones tear down connectionsto the mobile network soon after a completed data transmission to reduce the power consumption of their transmission unit. However, frequent connection reestablishments caused by apps which send or receive small amounts of data often lead to a heavy signalling load within the mobile network. One of the major contributions of this paper is the investigation of the resulting tradeoff between energy consumption at the smartphone and the generated signalling traffic in the mobile network. We explain that this tradeoff can be controlled by the connection release timeout and study the impact of this parameter for a number of popular apps that cover a wide range of traffic characteristics in terms of bandwidth requirements and resulting signalling traffic. Finally, we study the impact of the timer settings on Quality of Experience (QoE for web traffic. This is an important aspect since connection establishments not only lead to signalling traffic but also increase the load time of web pages.
International Nuclear Information System (INIS)
Pleune, T.T.
1996-11-01
The ASME Boiler and Pressure Vessel Code contains rules for the construction of nuclear power plant components. Figure 1-90 of Appendix I to Section III of the Code specifies fatigue design curves for structural materials. However, the effects of light water reactor (LWR) coolant environments are not explicitly addressed by the Code design curves. Recent test data indicate significant decreases in the fatigue lives of carbon and low-alloy steels in LWR environments when five conditions are satisfied simultaneously. When applied strain range, temperature, dissolved oxygen in the water, and sulfur content of the steel are above a minimum threshold level, and the loading strain rate is below a threshold value, environmentally assisted fatigue occurs. For this study, a data base of 1036 fatigue tests was used to train an artificial neural network (ANN). Once the optimal ANN was designed, ANN were trained and used to predict fatigue life for specified sets of loading and environmental conditions. By finding patterns and trends in the data, the ANN can find the fatigue lifetime for any set of conditions. Artificial neural networks show great potential for predicting environmentally assisted corrosion. Their main benefits are that the fit of the data is based purely on data and not on preconceptions and that the network can interpolate effects by learning trends and patterns when data are not available
Directory of Open Access Journals (Sweden)
Ashfaq Ahmad
2015-12-01
Full Text Available In the operation of a smart grid (SG, day-ahead load forecasting (DLF is an important task. The SG can enhance the management of its conventional and renewable resources with a more accurate DLF model. However, DLF model development is highly challenging due to the non-linear characteristics of load time series in SGs. In the literature, DLF models do exist; however, these models trade off between execution time and forecast accuracy. The newly-proposed DLF model will be able to accurately predict the load of the next day with a fair enough execution time. Our proposed model consists of three modules; the data preparation module, feature selection and the forecast module. The first module makes the historical load curve compatible with the feature selection module. The second module removes redundant and irrelevant features from the input data. The third module, which consists of an artificial neural network (ANN, predicts future load on the basis of selected features. Moreover, the forecast module uses a sigmoid function for activation and a multi-variate auto-regressive model for weight updating during the training process. Simulations are conducted in MATLAB to validate the performance of our newly-proposed DLF model in terms of accuracy and execution time. Results show that our proposed modified feature selection and modified ANN (m(FS + ANN-based model for SGs is able to capture the non-linearity(ies in the history load curve with 97 . 11 % accuracy. Moreover, this accuracy is achieved at the cost of a fair enough execution time, i.e., we have decreased the average execution time of the existing FS + ANN-based model by 38 . 50 % .
International Nuclear Information System (INIS)
Solmaz, Ozgur; Ozgoren, Muammer; Aksoy, Muharrem Hilmi
2014-01-01
Highlights: • An ANN model was developed to predict hourly cooling load of a vehicle. • Hourly meteorological data of 5 different provinces was used. • The agreement of the cooling load values between the calculations and predictions was fairly promising. • The ANN model could be successfully used to design automotive air conditioning systems. - Abstract: In this study, Artificial Neural Networks (ANNs) method for prediction hourly cooling load of a vehicle was implemented. The cooling load of the vehicle was calculated along the cooling season (1 May–30 September) for Antalya, Konya, Mersin, Mugla and Sanliurfa provinces in Turkey. For ANN model, seven neurons determinated as input signals of latitude, longitude, altitude, day of the year, hour of the day, hourly mean ambient air temperature and hourly solar radiation were used for the input layer of the network. One neuron producing an output signal of the hourly cooling load was utilized in the output layer. All data were divided into two categories for training and testing of the ANN. The 80% of the data was reserved to training and the remaining was used for testing of the model. Neuron numbers in the hidden layer from 7 to 40 were tested step by step to find the best matching ANN structure. The obtained results for different numbers of neurons were compared in terms of root mean squared error (RMSE), coefficient of determination (R 2 ) and mean absolute error (MAE). The best matching results for the training and testing were obtained as 8 neurons for the minimum testing RMSE value for the prediction of cooling load by the ANN model on the 23rd day of each month along the cooling season. For the model with 8 neurons RMSE, R 2 and MAE (Training/Testing) were found to be 0.0128/0.0259, 0.9959/0.9818 and 78.81/174.71 W/m 2 , respectively. It is shown that the cooling load of a vehicle can be successfully predicted by means of the ANNs from geographical characteristics and meteorological data
DEFF Research Database (Denmark)
Quaglia, Alberto; Gargalo, Carina L.; Chairakwongsa, Siwanat
2015-01-01
when large problems are considered. In an earlier work, we proposed a computer-aided framework for synthesis and design of process networks. In this contribution, we expand the framework by including methods and tools developed to structure, automate and simplify the mathematical formulation......The developments obtained in recent years in the field of mathematical programming considerably reduced the computational time and resources needed to solve large and complex Mixed Integer Non Linear Programming (MINLP) problems. Nevertheless, the application of these methods in industrial practice...... is still limited by the complexity associated with the mathematical formulation of some problems. In particular, the tasks of design space definition and representation as superstructure, as well as the data collection, validation and handling may become too complex and cumbersome to execute, especially...
A 3D Lumped Thermal Network Model for Long-term Load Profiles Analysis in High Power IGBT Modules
DEFF Research Database (Denmark)
Bahman, Amir Sajjad; Ma, Ke; Ghimire, Pramod
2016-01-01
)-based simulation is another method which is often used to analyze the steady-state thermal distribution of IGBT modules, but it is not possible to be used for long-term analysis of load profiles of power converter, which is needed for reliability assessments and better thermal design. This paper proposes a novel...... enables both accurate and fast temperature estimation of high power IGBT modules in the real loading conditions of the converter; meanwhile the critical details of the thermal dynamics and thermal distribution are also maintained. The proposed thermal model is verified by both FEM simulation......The conventional RC lumped thermal networks are widely used to estimate the temperature of power devices, but they are lack of accuracy in addressing detailed thermal behaviors/couplings in different locations and layers of the high power IGBT modules. On the other hand, Finite Element (FE...
Diniş, C. M.; Cunţan, C. D.; Rob, R. O. S.; Popa, G. N.
2018-01-01
The paper presents the analysis of a power factor with capacitors banks, without series coils, used for improving power factor for a three-phase and single-phase inductive loads. In the experimental measurements, to improve the power factor, the Roederstein ESTAmat RPR power factor controller can command up to twelve capacitors banks, while experimenting using only six capacitors banks. Six delta capacitors banks with approximately equal reactive powers were used for experimentation. The experimental measurements were carried out with a three-phase power quality analyser which worked in three cases: a case without a controller with all capacitors banks permanently parallel connected with network, and two other cases with power factor controller (one with setting power factor at 0.92 and the other one at 1). When performing experiments with the power factor controller, a current transformer was used to measure the current on one phase (at a more charged or less loaded phase).
Statistical learning problem of artificial neural network to control roofing process
Directory of Open Access Journals (Sweden)
Lapidus Azariy
2017-01-01
Full Text Available Now software developed on the basis of artificial neural networks (ANN has been actively implemented in construction companies to support decision-making in organization and management of construction processes. ANN learning is the main stage of its development. A key question for supervised learning is how many number of training examples we need to approximate the true relationship between network inputs and output with the desired accuracy. Also designing of ANN architecture is related to learning problem known as “curse of dimensionality”. This problem is important for the study of construction process management because of the difficulty to get training data from construction sites. In previous studies the authors have designed a 4-layer feedforward ANN with a unit model of 12-5-4-1 to approximate estimation and prediction of roofing process. This paper presented the statistical learning side of created ANN with simple-error-minimization algorithm. The sample size to efficient training and the confidence interval of network outputs defined. In conclusion the authors predicted successful ANN learning in a large construction business company within a short space of time.
A new cut-based algorithm for the multi-state flow network reliability problem
International Nuclear Information System (INIS)
Yeh, Wei-Chang; Bae, Changseok; Huang, Chia-Ling
2015-01-01
Many real-world systems can be modeled as multi-state network systems in which reliability can be derived in terms of the lower bound points of level d, called d-minimal cuts (d-MCs). This study proposes a new method to find and verify obtained d-MCs with simple and useful found properties for the multi-state flow network reliability problem. The proposed algorithm runs in O(mσp) time, which represents a significant improvement over the previous O(mp 2 σ) time bound based on max-flow/min-cut, where p, σ and m denote the number of MCs, d-MC candidates and edges, respectively. The proposed algorithm also conquers the weakness of some existing methods, which failed to remove duplicate d-MCs in special cases. A step-by-step example is given to demonstrate how the proposed algorithm locates and verifies all d-MC candidates. As evidence of the utility of the proposed approach, we present extensive computational results on 20 benchmark networks in another example. The computational results compare favorably with a previously developed algorithm in the literature. - Highlights: • A new method is proposed to find all d-MCs for the multi-state flow networks. • The proposed method can prevent the generation of d-MC duplicates. • The proposed method is simpler and more efficient than the best-known algorithms
Mikami, Amori Yee; Szwedo, David E; Allen, Joseph P; Evans, Meredyth A; Hare, Amanda L
2010-01-01
This study examined online communication on social networking web pages in a longitudinal sample of 92 youths (39 male, 53 female). Participants' social and behavioral adjustment was assessed when they were ages 13-14 years and again at ages 20-22 years. At ages 20-22 years, participants' social networking website use and indicators of friendship quality on their web pages were coded by observers. Results suggested that youths who had been better adjusted at ages 13-14 years were more likely to be using social networking web pages at ages 20-22 years, after statistically controlling for age, gender, ethnicity, and parental income. Overall, youths' patterns of peer relationships, friendship quality, and behavioral adjustment at ages 13-14 years and at ages 20-22 years predicted similar qualities of interaction and problem behavior on their social networking websites at ages 20-22 years. Findings are consistent with developmental theory asserting that youths display cross-situational continuity in their social behaviors and suggest that the conceptualization of continuity may be extended into the online domain. Copyright 2009 APA, all rights reserved.
Directory of Open Access Journals (Sweden)
Wahyudi Sutopo
2016-12-01
Full Text Available In recent years, the rising competitive environment with shorter product life cycles and high customization forces industries to increase their flexibility, speed up their response, and enhance concurrent engineering designs. To integrate these prospects, supply chain collaboration becomes a pertinent strategy for industries to strengthen their competitiveness. The network design problem is used to implement supply chain collaboration. In the buying and selling process, sharing information between buyer and supplier are important to obtain a transaction decision. The optimimum supply chain profit can be identified by mathematical model of network design problem. The Mathematical Model takes into consideration the uncertainity in negotiation of supply chain, transportation problems, and locationallocation of products from supplier to buyer in the planning based on the time value of money. The results show that the model can be used to optimize the supply chain profit. The supplier gets a profit because income were received in the initial contract, while the buyer profit comes from lower pay.
A parallel algorithm for solving linear equations arising from one-dimensional network problems
International Nuclear Information System (INIS)
Mesina, G.L.
1991-01-01
One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs
Directory of Open Access Journals (Sweden)
R. Rajakumar
2017-01-01
Full Text Available Seyedali Mirjalili et al. (2014 introduced a completely unique metaheuristic technique particularly grey wolf optimization (GWO. This algorithm mimics the social behavior of grey wolves whereas it follows the leadership hierarchy and attacking strategy. The rising issue in wireless sensor network (WSN is localization problem. The objective of this problem is to search out the geographical position of unknown nodes with the help of anchor nodes in WSN. In this work, GWO algorithm is incorporated to spot the correct position of unknown nodes, so as to handle the node localization problem. The proposed work is implemented using MATLAB 8.2 whereas nodes are deployed in a random location within the desired network area. The parameters like computation time, percentage of localized node, and minimum localization error measures are utilized to analyse the potency of GWO rule with other variants of metaheuristics algorithms such as particle swarm optimization (PSO and modified bat algorithm (MBA. The observed results convey that the GWO provides promising results compared to the PSO and MBA in terms of the quick convergence rate and success rate.
INTERCONNECTING NETWORKS WITH DIFFERENT LEVELS OF SECURITY – A PRESENT NATO PROBLEM
Directory of Open Access Journals (Sweden)
LIVIU TATOMIR
2016-07-01
Full Text Available A situation often met in the Romanian Armed Forces in recent years is the need for interconnecting two networks (domains with different levels of classification. Considering that the Romanian armed troops are involved in numerous missions with NATO partners, solutions, already implemented across the organization, are considered to be applied in domestic systems, also. This paper presents the solutions adopted by NATO in order to solve the problem of cross -domains interconnections. We present the maturity level reached by these solutions and the possibility of implementing these solutions in the Romanian Armed Forces, with or without specific adaptation to our own rules and regulations. The goal is to use a NATO already proved solution to our national classified networks.
An Integrated Approach for Reliable Facility Location/Network Design Problem with Link Disruption
Directory of Open Access Journals (Sweden)
Davood Shishebori
2015-05-01
Full Text Available Proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. This paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. With respect to the probability of link disruptions, the objective function of the model minimizes the total costs, including location costs, link construction costs and also the expected transportation costs. An efficient hybrid algorithm based on LP relaxation and variable neighbourhood search metaheuristic is developed in order to solve the mathematical model. Numerical results demonstrate that the proposed hybrid algorithm has suitable efficiency in terms of duration of solution time and determining excellent solution quality.
Energy Savings in Cellular Networks Based on Space-Time Structure of Traffic Loads
Sun, Jingbo; Wang, Yue; Yuan, Jian; Shan, Xiuming
Since most of energy consumed by the telecommunication infrastructure is due to the Base Transceiver Station (BTS), switching off BTSs when traffic load is low has been recognized as an effective way of saving energy. In this letter, an energy saving scheme is proposed to minimize the number of active BTSs based on the space-time structure of traffic loads as determined by principal component analysis. Compared to existing methods, our approach models traffic loads more accurately, and has a much smaller input size. As it is implemented in an off-line manner, our scheme also avoids excessive communications and computing overheads. Simulation results show that the proposed method has a comparable performance in energy savings.
Trust, Privacy, and Frame Problems in Social and Business E-Networks, Part 1
Directory of Open Access Journals (Sweden)
Jeff Buechner
2011-03-01
Full Text Available Privacy issues in social and business e-networks are daunting in complexity—private information about oneself might be routed through countless artificial agents. For each such agent, in that context, two questions about trust are raised: Where an agent must access (or store personal information, can one trust that artificial agent with that information and, where an agent does not need to either access or store personal information, can one trust that agent not to either access or store that information? It would be an infeasible task for any human being to explicitly determine, for each artificial agent, whether it can be trusted. That is, no human being has the computational resources to make such an explicit determination. There is a well-known class of problems in the artificial intelligence literature, known as frame problems, where explicit solutions to them are computationally infeasible. Human common sense reasoning solves frame problems, though the mechanisms employed are largely unknown. I will argue that the trust relation between two agents (human or artificial functions, in some respects, is a frame problem solution. That is, a problem is solved without the need for a computationally infeasible explicit solution. This is an aspect of the trust relation that has remained unexplored in the literature. Moreover, there is a formal, iterative structure to agent-agent trust interactions that serves to establish the trust relation non-circularly, to reinforce it, and to “bootstrap” its strength.
Load Balancing Metric with Diversity for Energy Efficient Routing in Wireless Sensor Networks
DEFF Research Database (Denmark)
Moad, Sofiane; Hansen, Morten Tranberg; Jurdak, Raja
2011-01-01
The expected number of transmission (ETX) represents a routing metric that considers the highly variable link qualities for a specific radio in Wireless Sensor Networks (WSNs). To adapt to these differences, radio diversity is a recently explored solution for WSNs. In this paper, we propose...... an energy balancing metric which explores the diversity in link qualities present at different radios. The goal is to effectively use the energy of the network and therefore extend the network lifetime. The proposed metric takes into account the transmission and reception costs for a specific radio in order...... to choose an energy efficient radio. In addition, the metric uses the remaining energy of nodes in order to regulate the traffic so that critical nodes are avoided. We show by simulations that our metric can improve the network lifetime up to 20%....
Directory of Open Access Journals (Sweden)
V. I. Nazarov
2010-01-01
Full Text Available The paper shows that while distributing loads among boilers an account of the power consumed by draught machinery with various regulation systems shifts an optimum point of load distribution by 2–5%.
Inverse problems in 1D hemodynamics on systemic networks: a sequential approach.
Lombardi, D
2014-02-01
In this work, a sequential approach based on the unscented Kalman filter is applied to solve inverse problems in 1D hemodynamics, on a systemic network. For instance, the arterial stiffness is estimated by exploiting cross-sectional area and mean speed observations in several locations of the arteries. The results are compared with those ones obtained by estimating the pulse wave velocity and the Moens-Korteweg formula. In the last section, a perspective concerning the identification of the terminal models parameters and peripheral circulation (modeled by a Windkessel circuit) is presented. Copyright © 2013 John Wiley & Sons, Ltd.
Traffic Load on Interconnection Lines of Generalized Double Ring Network Structures
DEFF Research Database (Denmark)
Pedersen, Jens Myrup; Riaz, Muhammad Tahir; Madsen, Ole Brun
2005-01-01
consists of two planar rings, which are easily embedded by fiber or other wired solutions. It is shown that for large N2R structures, the interconnection lines carry notably lower loads than the other lines if shortest-path routing is used, and the effects of two other routing schemes are explored, leading...
The Problem of Privacy in Capitalism and the Alternative Social Networking Site Diaspora*
Directory of Open Access Journals (Sweden)
Sebastian Sevignani
2012-05-01
Full Text Available In this paper, l examine the alternative social networking site Diaspora* from a Marxist standpoint. The investigation focuses on privacy, and contributes to a better understanding of this issue within the context of capitalism in general. First, I describe Diaspora*’s way of production by pointing out its alternative character as part of the free software and copyleft movement. Second, dominant theories of privacy related to individual control, exclusion, and property are introduced. Third, the problem of privacy in capitalism is described wherein dominant concepts of privacy will be contextualised on behalf of a critical political economy analysis that refers to the Marxian concept of ideology critique, Marx’s differentiation between a societal sphere of production and a societal sphere of circulation, and his analysis of capitalist fetishisms. Fourth, taking into account the problem of privacy in capitalism, the alternative potential of Diaspora* is evaluated. Finally, a brief outline of a Marxist theory of privacy is proposed.
Gaaloul, Fakhreddine
2013-05-01
This paper proposes adequate methods to improve the interference mitigation capability of a recently investigated switched-based interference reduction scheme for single downlink channel assignment in over-loaded small-cell networks. The model assumes that the available orthogonal channels for small cells are distributed among access points in close vicinity, where each access point knows its allocated channels a priori. Each cell has a single antenna, employs the open access strategy, and can reuse its allocated channels simultaneously, while scheduling concurrent service requests. Moreover, the access points can not coordinate their transmissions, and can receive limited feedback from active users. The paper presents low-complexity schemes to identify a suitable channel to serve the scheduled user by maintaining the interference power level within a tolerable range. They attempt to either complement the switched-based scheme by minimum interference channel selection or adopt different interference thresholds on available channels, while reducing the channel examination load. The optimal thresholds for interference mitigation at the desired receive station are quantified for various performance criteria. The performance and processing load of the proposed schemes are obtained analytically, and then compared to those of the single-threshold scheme via numerical and simulation results. © 2002-2012 IEEE.
Directory of Open Access Journals (Sweden)
Руслан Володимирович Власенко
2016-07-01
Full Text Available Electricity quality improving is extremely relevant nowadays. With such industrial loads as induction motors, induction furnaces, welding machines, controlled or uncontrolled rectifiers, frequency converters and others reactive power, harmonics and unbalance are generated in power grid. Reactive power, higher harmonic currents and asymmetry loads influence the functioning of electric devices and electrical mains. An effective technical solution is the use of new compensating devices, that is active power filters. The emergence of consumers with a unit capacity of four wire networks requires a new approach to building system control active power filter. When designing the active power filter control system the current flowing in the neutral wire must be taken into account. To assess the power balance in the four wire active power filter, scientists have proposed to apply pqr theory of power based on the Clarke transformation. There are different topologies of three-phase four wire active power filters. A visual simulation of Matlab / Simulink model with an active power filter based on pqr theory of power has been created. A method of pulse width modulation with four control channels was used as pulses forming systems with transistor keys. Operating conditions of three-phase four wire active power filter with asymmetry, non-sinosoidal voltage source and asymmetric load have been studied. The correction taking into account the means improving the active power filter has been offered as pqr theory of power does not take into account non-sinosoidal voltage
Directory of Open Access Journals (Sweden)
Yun Wang
2017-02-01
Full Text Available To strengthen the integration of the primary and secondary systems, a concept of Cyber Physical Systems (CPS is introduced to construct a CPS in Power Systems (Power CPS. The most basic work of the Power CPS is to build an integration model which combines both a continuous process and a discrete process. The advanced form of smart grid, the Active Distribution Network (ADN is a typical example of Power CPS. After designing the Power CPS model architecture and its application in ADN, a Hybrid System based model and control method of Power CPS is proposed in this paper. As an application example, ADN flexible load is modeled and controlled with ADN feeder power control by a control strategy which includes the normal condition and the underpowered condition. In this model and strategy, some factors like load power consumption and load functional demand are considered and optimized. In order to make up some of the deficiencies of centralized control, a distributed control method is presented to reduce model complexity and improve calculation speed. The effectiveness of all the models and methods are demonstrated in the case study.
Liang, Zhen; Li, Bin; Huang, Mo; Zheng, Yanqi; Ye, Hui; Xu, Ken; Deng, Fangming
2017-04-19
In this work, a low cost Bluetooth Low Energy (BLE) transceiver for wireless sensor network (WSN) applications, with a receiver (RX)-matching network-reusing power amplifier (PA) load inductor, is presented. In order to decrease the die area, only two inductors were used in this work. Besides the one used in the voltage control oscillator (VCO), the PA load inductor was reused as the RX impedance matching component in the front-end. Proper controls have been applied to achieve high transmitter (TX) input impedance when the transceiver is in the receiving mode, and vice versa. This allows the TRX-switch/matching network integration without significant performance degradation. The RX adopted a low-IF structure and integrated a single-ended low noise amplifier (LNA), a current bleeding mixer, a 4th complex filter and a delta-sigma continuous time (CT) analog-to-digital converter (ADC). The TX employed a two-point PLL-based architecture with a non-linear PA. The RX achieved a sensitivity of -93 dBm and consumes 9.7 mW, while the TX achieved a 2.97% error vector magnitude (EVM) with 9.4 mW at 0 dBm output power. This design was fabricated in a 0.11 μm complementary metal oxide semiconductor (CMOS) technology and the front-end circuit only occupies 0.24 mm². The measurement results verify the effectiveness and applicability of the proposed BLE transceiver for WSN applications.
Charpiat, B; Mille, F; Fombeur, P; Machon, J; Zawadzki, E; Bobay-Madic, A
2018-05-21
The development of information systems in French hospitals is mandatory. The aim of this work was to analyze the content of exchanges carried out within social networks, dealing with problems encountered with hospital pharmacies information systems. Messages exchanged via the mailing list of the Association pour le Digital et l'Information en Pharmacie and abstracts of communications presented at hospital pharmacists trade union congresses were analyzed. Those referring to information systems used in hospital pharmacies were selected. From March 2015 to June 2016, 122 e-mails sent by 80 pharmacists concerned information systems. From 2002 to 2016, 45 abstracts dealt with this topic. Problems most often addressed in these 167 documents were "parameterization and/or functionalities" (n=116), interfaces and complexity of the hospital information systems (n=52), relationship with health information technologies vendors and poor reactivity (n=32), additional workload (n=32), ergonomics (n=30), insufficient user training (n=22). These problems are interdependent, lead to errors and in order to mitigate their consequences, they compel pharmacy professionals to divert a significant amount of working hours to the detriment of pharmaceutical care and dispensing and preparing drugs. Hospital pharmacists are faced with many problems of insecurity and inefficiency generated by information systems. Researches are warranted to determine their cost, specify their deleterious effects on care and identify the safest information systems. Copyright © 2018 Académie Nationale de Pharmacie. Published by Elsevier Masson SAS. All rights reserved.
Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems
Directory of Open Access Journals (Sweden)
Gabriel A. Fonseca Guerra
2017-12-01
Full Text Available Constraint satisfaction problems (CSP are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach instances of NP (e.g., decision and hard optimization problems. The human brain efficiently handles CSPs both in perception and behavior using spiking neural networks (SNNs, and recent studies have demonstrated that the noise embedded within an SNN can be used as a computational resource to solve CSPs. Here, we provide a software framework for the implementation of such noisy neural solvers on the SpiNNaker massively parallel neuromorphic hardware, further demonstrating their potential to implement a stochastic search that solves instances of P and NP problems expressed as CSPs. This facilitates the exploration of new optimization strategies and the understanding of the computational abilities of SNNs. We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses. The solver works as a stochastic dynamical system, which is attracted by the configuration that solves the CSP. The noise allows an optimal exploration of the space of configurations, looking for the satisfiability of all the constraints; if applied discontinuously, it can also force the system to leap to a new random configuration effectively causing a restart.
Fernández Caballero, Juan Carlos; Martínez, Francisco José; Hervás, César; Gutiérrez, Pedro Antonio
2010-05-01
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high correct classification rate level and a high classification rate for each class. This last objective is not usually optimized in classification, but is considered here given the need to obtain high precision in each class in real problems. To solve this machine learning problem, we use a Pareto-based multiobjective optimization methodology based on a memetic evolutionary algorithm. We consider a memetic Pareto evolutionary approach based on the NSGA2 evolutionary algorithm (MPENSGA2). Once the Pareto front is built, two strategies or automatic individual selection are used: the best model in accuracy and the best model in sensitivity (extremes in the Pareto front). These methodologies are applied to solve 17 classification benchmark problems obtained from the University of California at Irvine (UCI) repository and one complex real classification problem. The models obtained show high accuracy and a high classification rate for each class.
Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems.
Fonseca Guerra, Gabriel A; Furber, Steve B
2017-01-01
Constraint satisfaction problems (CSP) are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach instances of NP (e.g., decision and hard optimization problems). The human brain efficiently handles CSPs both in perception and behavior using spiking neural networks (SNNs), and recent studies have demonstrated that the noise embedded within an SNN can be used as a computational resource to solve CSPs. Here, we provide a software framework for the implementation of such noisy neural solvers on the SpiNNaker massively parallel neuromorphic hardware, further demonstrating their potential to implement a stochastic search that solves instances of P and NP problems expressed as CSPs. This facilitates the exploration of new optimization strategies and the understanding of the computational abilities of SNNs. We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses. The solver works as a stochastic dynamical system, which is attracted by the configuration that solves the CSP. The noise allows an optimal exploration of the space of configurations, looking for the satisfiability of all the constraints; if applied discontinuously, it can also force the system to leap to a new random configuration effectively causing a restart.
A Location-Inventory-Routing Problem in Forward and Reverse Logistics Network Design
Directory of Open Access Journals (Sweden)
Qunli Yuchi
2016-01-01
Full Text Available We study a new problem of location-inventory-routing in forward and reverse logistic (LIRP-FRL network design, which simultaneously integrates the location decisions of distribution centers (DCs, the inventory policies of opened DCs, and the vehicle routing decision in serving customers, in which new goods are produced and damaged goods are repaired by a manufacturer and then returned to the market to satisfy customers’ demands as new ones. Our objective is to minimize the total costs of manufacturing and remanufacturing goods, building DCs, shipping goods (new or recovered between the manufacturer and opened DCs, and distributing new or recovered goods to customers and ordering and storage costs of goods. A nonlinear integer programming model is proposed to formulate the LIRP-FRL. A new tabu search (NTS algorithm is developed to achieve near optimal solution of the problem. Numerical experiments on the benchmark instances of a simplified version of the LIRP-FRL, the capacitated location routing problem, and the randomly generated LIRP-FRL instances demonstrate the effectiveness and efficiency of the proposed NTS algorithm in problem resolution.
Zhang, Wei; Li, Chuanhao; Peng, Gaoliang; Chen, Yuanhang; Zhang, Zhujun
2018-02-01
In recent years, intelligent fault diagnosis algorithms using machine learning technique have achieved much success. However, due to the fact that in real world industrial applications, the working load is changing all the time and noise from the working environment is inevitable, degradation of the performance of intelligent fault diagnosis methods is very serious. In this paper, a new model based on deep learning is proposed to address the problem. Our contributions of include: First, we proposed an end-to-end method that takes raw temporal signals as inputs and thus doesn't need any time consuming denoising preprocessing. The model can achieve pretty high accuracy under noisy environment. Second, the model does not rely on any domain adaptation algorithm or require information of the target domain. It can achieve high accuracy when working load is changed. To understand the proposed model, we will visualize the learned features, and try to analyze the reasons behind the high performance of the model.
DEFF Research Database (Denmark)
Zecchino, Antonio; Hu, Junjie; Coppo, Massimiliano
2016-01-01
Due to the increasing penetration of single-phase small generation units and electric vehicles connected to distribution grids, system operators are facing challenges related to local unbalanced voltage rise or drop issues, which may lead to a violation of the allowed voltage band. To address...... this problem, distribution transformers with on-load tapping capability are under development. This paper presents model and experimental validation of a 35 kVA three-phase power distribution transformer with independent on-load tap changer control capability on each phase. With the purpose of investigating...... to reproduce the main feature of an unbalanced grid. The experimental activities are recreated in by carrying out dynamics simulation studies, aiming at validating the implemented models of both the transformer as well as the other grid components. Phase-neutral voltages’ deviations are limited, proving...
A Bi-Level Programming Model for the Railway Express Cargo Service Network Design Problem
Directory of Open Access Journals (Sweden)
Boliang Lin
2018-06-01
Full Text Available Service network design is fundamentally crucial for railway express cargo transportation. The main challenge is to strike a balance between two conflicting objectives: low network setup costs and high expected operational incomes. Different configurations of these objectives will have different impacts on the quality of freight transportation services. In this paper, a bi-level programming model for the railway express cargo service network design problem is proposed. The upper-level model forms the optimal decisions in terms of the service characteristics, and the low-level model selects the service arcs for each commodity. The rail express cargo is strictly subject to the service commitment, the capacity restriction, flow balance constraints, and logical relationship constraints among the decisions variables. Moreover, linearization techniques are used to convert the lower-level model to a linear one so that it can be directly solved by a standard optimization solver. Finally, a real-world case study based on the Beijing–Guangzhou Railway Line is carried out to demonstrate the effectiveness and efficiency of the proposed solution approach.
Institute of Scientific and Technical Information of China (English)
ZHANG Yin; WEI Zhiyuan; ZHANG Yinping; WANG Xin
2017-01-01
Urban heating in northern China accounts for 40％ of total building energy usage.In central heating systems,heat is often transfened from heat source to users by the heat network where several heat exchangers arc installed at heat source,substations and terminals respectively.For given overall heating capacity and heat source temperarure,increasing the terminal fluid temperature is an effective way to improve the thermal performance of such cascade heat exchange network for energy saving.In this paper,the mathematical optimization model of the cascade heat exchange network with three-stage heat exchangers in series is established.Aim at maximizing the cold fluid temperature for given hot fluid temperature and overall heating capacity,the optimal heat exchange area distribution and the medium fluids' flow rates are determined through inverse problem and variation method.The preliminary results show that the heat exchange areas should be distributed equally for each heat exchanger.It also indicates that in order to improve the thernmal performance of the whole system,more heat exchange areas should be allocated to the heat exchanger where flow rate difference between two fluids is relatively small.This work is important for guiding the optimization design of practical cascade heating systems.
AN EVOLUTIONARY ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEM IN WIRELESS MOBILE NETWORKS
Directory of Open Access Journals (Sweden)
Yee Shin Chia
2012-12-01
Full Text Available The channel assignment problem in wireless mobile network is the assignment of appropriate frequency spectrum to incoming calls while maintaining a satisfactory level of electromagnetic compatibility (EMC constraints. An effective channel assignment strategy is important due to the limited capacity of frequency spectrum in wireless mobile network. Most of the existing channel assignment strategies are based on deterministic methods. In this paper, an adaptive genetic algorithm (GA based channel assignment strategy is introduced for resource management and to reduce the effect of EMC interferences. The most significant advantage of the proposed optimization method is its capability to handle both the reassignment of channels for existing calls as well as the allocation of channel to a new incoming call in an adaptive process to maximize the utility of the limited resources. It is capable to adapt the population size to the number of eligible channels for a particular cell upon new call arrivals to achieve reasonable convergence speed. The MATLAB simulation on a 49-cells network model for both uniform and nonuniform call traffic distributions showed that the proposed channel optimization method can always achieve a lower average new incoming call blocking probability compared to the deterministic based channel assignment strategy.
Dynamic Load Balancing with Handover in Hybrid Li-Fi and Wi-Fi Networks
Haas, Harald; Wang, Yunlu
2015-01-01
In this paper, a hybrid network combining lightfidelity (Li-Fi) with a radio frequency (RF) wireless fidelity(Wi-Fi) network is considered. An additional tier of very smallLi-Fi attocells which utilise the visible light spectrum offers asignificant increase in wireless data throughput in an indoorenvironment while at the same time providing room illumination.Importantly, there is no interference between Li-Fi and Wi-Fi.A Li-Fi attocell covers a significantly smaller area than a Wi-Fi access p...
Sampasa-Kanyinga, H; Hamilton, H A
2015-11-01
Previous research has suggested an association between the use of social networking sites (SNSs) and mental health problems such as psychological distress, suicidal ideation and attempts in adolescents. However, little is known about the factors that might mediate these relationships. The present study examined the link between the use of social networking sites and psychological distress, suicidal ideation and suicide attempts, and tested the mediating role of cyberbullying victimization on these associations in adolescents. The sample consisted of a group of 11-to-20-year-old individuals (n=5126, 48% females; mean±SD age: 15.2±1.9 years) who completed the mental health portion of the Ontario Student Drug Use and Health Survey (OSDUHS) in 2013. Multiple logistic regression analyses were used to test the mediation models. After adjustment for age, sex, ethnicity, subjective socioeconomic status (SES), and parental education, use of SNSs was associated with psychological distress (adjusted odds ratio, 95% confidence interval=2.03, 1.22-3.37), suicidal ideation (3.44, 1.54-7.66) and attempts (5.10, 1.45-17.88). Cyberbullying victimization was found to fully mediate the relationships between the use of SNSs with psychological distress and attempts; whereas, it partially mediated the link between the use of SNSs and suicidal ideation. Findings provide supporting evidence that addressing cyberbullying victimization and the use of SNSs among adolescents may help reduce the risk of mental health problems. Copyright © 2015 Elsevier Masson SAS. All rights reserved.
An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem
Directory of Open Access Journals (Sweden)
Guangmin Wang
2017-12-01
Full Text Available Continuous network design problem (CNDP is searching for a transportation network configuration to minimize the sum of the total system travel time and the investment cost of link capacity expansions by considering that the travellers follow a traditional Wardrop user equilibrium (UE to choose their routes. In this paper, the CNDP model can be formulated as mathematical programs with complementarity constraints (MPCC by describing UE as a non-linear complementarity problem (NCP. To address the difficulty resulting from complementarity constraints in MPCC, they are substituted by the Fischer-Burmeister (FB function, which can be smoothed by the introduction of the smoothing parameter. Therefore, the MPCC can be transformed into a well-behaved non-linear program (NLP by replacing the complementarity constraints with a smooth equation. Consequently, the solver such as LINDOGLOBAL in GAMS can be used to solve the smooth approximate NLP to obtain the solution to MPCC for modelling CNDP. The numerical experiments on the example from the literature demonstrate that the proposed algorithm is feasible.
The Location-Routing Problem with Full Truckloads in Low-Carbon Supply Chain Network Designing
Directory of Open Access Journals (Sweden)
Cheng Chen
2018-01-01
Full Text Available In recent years, low-carbon supply chain network design has been the focus of studies as the development of low-carbon economy. The location-routing problem with full truckloads (LRPFT is investigated in this paper, which extends the existing studies on the LRP to full truckloads problem within the regional many-to-many raw material supply network. A mathematical model with dual objectives of minimizing total cost and environmental effects simultaneously is developed to determine the number and locations of facilities and optimize the flows among different kinds of nodes and routes of trucks as well. A novel multiobjective hybrid approach named NSGA-II-TS is proposed by combining a known multiobjective algorithm, NSGA-II, and a known heuristics, Tabu Search (TS. A chromosome presentation based on natural number and modified partially mapping crossover operator for the LRPFT are designed. Finally, the computational effectiveness of the hybrid approach is validated by the numerical results and a practical case study is applied to demonstrate the tradeoff between total cost and CO2 emission in the LRPFT.
Directory of Open Access Journals (Sweden)
Jafar Jallad
2018-05-01
Full Text Available In a radial distribution network integrated with distributed generation (DG, frequency and voltage instability could occur due to grid disconnection, which would result in an islanded network. This paper proposes an optimal load shedding scheme to balance the electricity demand and the generated power of DGs. The integration of the Firefly Algorithm and Particle Swarm Optimization (FAPSO is proposed for the application of the planned load shedding and under frequency load shedding (UFLS scheme. In planning mode, the hybrid optimization maximizes the amount of load remaining and improves the voltage profile of load buses within allowable limits. Moreover, the hybrid optimization can be used in UFLS scheme to identify the optimal combination of loads that need to be shed from a network in operation mode. In order to assess the capabilities of the hybrid optimization, the IEEE 33-bus radial distribution system and part of the Malaysian distribution network with different types of DGs were used. The response of the proposed optimization method in planning and operation were compared with other optimization techniques. The simulation results confirmed the effectiveness of the proposed hybrid optimization in planning mode and demonstrated that the proposed UFLS scheme is quick enough to restore the system frequency without overshooting in less execution time.
Integrating lv network models and load-flow calculations into smart grid planning
Hoogsteen, Gerwin; Molderink, Albert; Bakker, Vincent; Smit, Gerardus Johannes Maria
2013-01-01
Increasing energy prices and the greenhouse effect demand a more efficient supply of energy. More residents start to install their own energy generation sources such as photovoltaic cells. The introduction of distributed generation in the low-voltage network can have effects that were unexpected
International Nuclear Information System (INIS)
Sauget, M.
2007-12-01
This research is about the application of neural networks used in the external radiotherapy domain. The goal is to elaborate a new evaluating system for the radiation dose distributions in heterogeneous environments. The al objective of this work is to build a complete tool kit to evaluate the optimal treatment planning. My st research point is about the conception of an incremental learning algorithm. The interest of my work is to combine different optimizations specialized in the function interpolation and to propose a new algorithm allowing to change the neural network architecture during the learning phase. This algorithm allows to minimise the al size of the neural network while keeping a good accuracy. The second part of my research is to parallelize the previous incremental learning algorithm. The goal of that work is to increase the speed of the learning step as well as the size of the learned dataset needed in a clinical case. For that, our incremental learning algorithm presents an original data decomposition with overlapping, together with a fault tolerance mechanism. My last research point is about a fast and accurate algorithm computing the radiation dose deposit in any heterogeneous environment. At the present time, the existing solutions used are not optimal. The fast solution are not accurate and do not give an optimal treatment planning. On the other hand, the accurate solutions are far too slow to be used in a clinical context. Our algorithm answers to this problem by bringing rapidity and accuracy. The concept is to use a neural network adequately learned together with a mechanism taking into account the environment changes. The advantages of this algorithm is to avoid the use of a complex physical code while keeping a good accuracy and reasonable computation times. (author)
Directory of Open Access Journals (Sweden)
Mi Gan
2018-01-01
Full Text Available The rapid growth of logistics distribution highlights the problems including the imperfect infrastructure of logistics distribution network, the serious shortage of distribution capacity of each individual enterprise, and the high cost of distribution in China. While the development of sharing economy makes it possible to achieve the integration of whole social logistic resources, big data technology can grasp customer’s logistics demand accurately on the basis of analyzing the customer’s logistics distribution preference, which contributes to the integration and optimization of the whole logistics resources. This paper proposes a kind of intensive distribution logistics network considering sharing economy, which assumes that all the social logistics suppliers build a strategic alliance, and individual idle logistics resources are also used to deal with distribution needs. Analyzing customer shopping behavior by the big data technology to determine customer’s logistics preference on the basis of dividing the customer’s logistics preference into high speed, low cost, and low pollution and then constructing the corresponding objective function model according to different logistics preferences, we obtain the intensive distribution logistics network model and solve it with heuristic algorithm. Furthermore, this paper analyzes the mechanism of interest distribution of the participants in the distribution network and puts forward an improved interval Shapley value method considering both satisfaction and contribution, with case verifying the feasibility and effectiveness of the model. The results showed that, compared with the traditional Shapley method, distribution coefficient calculated by the improved model could be fairer, improve stakeholder satisfaction, and promote the sustainable development of the alliance as well.
Cerebellum-inspired neural network solution of the inverse kinematics problem.
Asadi-Eydivand, Mitra; Ebadzadeh, Mohammad Mehdi; Solati-Hashjin, Mehran; Darlot, Christian; Abu Osman, Noor Azuan
2015-12-01
The demand today for more complex robots that have manipulators with higher degrees of freedom is increasing because of technological advances. Obtaining the precise movement for a desired trajectory or a sequence of arm and positions requires the computation of the inverse kinematic (IK) function, which is a major problem in robotics. The solution of the IK problem leads robots to the precise position and orientation of their end-effector. We developed a bioinspired solution comparable with the cerebellar anatomy and function to solve the said problem. The proposed model is stable under all conditions merely by parameter determination, in contrast to recursive model-based solutions, which remain stable only under certain conditions. We modified the proposed model for the simple two-segmented arm to prove the feasibility of the model under a basic condition. A fuzzy neural network through its learning method was used to compute the parameters of the system. Simulation results show the practical feasibility and efficiency of the proposed model in robotics. The main advantage of the proposed model is its generalizability and potential use in any robot.
Directory of Open Access Journals (Sweden)
G. M. Behery
2009-01-01
Full Text Available This paper presents an automatic system of neural networks (NNs that has the ability to simulate and predict many of applied problems. The system architectures are automatically reorganized and the experimental process starts again, if the required performance is not reached. This processing is continued until the performance obtained. This system is first applied and tested on the two spiral problem; it shows that excellent generalization performance obtained by classifying all points of the two-spirals correctly. After that, it is applied and tested on the shear stress and the pressure drop problem across the short orifice die as a function of shear rate at different mean pressures for linear low-density polyethylene copolymer (LLDPE at 190∘C. The system shows a better agreement with an experimental data of the two cases: shear stress and pressure drop. The proposed system has been also designed to simulate other distributions not presented in the training set (predicted and matched them effectively.
A framework to approach problems of forensic anthropology using complex networks
Caridi, Inés; Dorso, Claudio O.; Gallo, Pablo; Somigliana, Carlos
2011-05-01
We have developed a method to analyze and interpret emerging structures in a set of data which lacks some information. It has been conceived to be applied to the problem of getting information about people who disappeared in the Argentine state of Tucumán from 1974 to 1981. Even if the military dictatorship formally started in Argentina had begun in 1976 and lasted until 1983, the disappearance and assassination of people began some months earlier. During this period several circuits of Illegal Detention Centres (IDC) were set up in different locations all over the country. In these secret centres, disappeared people were illegally kept without any sort of constitutional guarantees, and later assassinated. Even today, the final destination of most of the disappeared people’s remains is still unknown. The fundamental hypothesis in this work is that a group of people with the same political affiliation whose disappearances were closely related in time and space shared the same place of captivity (the same IDC or circuit of IDCs). This hypothesis makes sense when applied to the systematic method of repression and disappearances which was actually launched in Tucumán, Argentina (2007) [11]. In this work, the missing individuals are identified as nodes on a network and connections are established among them based on the individuals’ attributes while they were alive, by using rules to link them. In order to determine which rules are the most effective in defining the network, we use other kind of knowledge available in this problem: previous results from the anthropological point of view (based on other sources of information, both oral and written, historical and anthropological data, etc.); and information about the place (one or more IDCs) where some people were kept during their captivity. For these best rules, a prediction about these people’s possible destination is assigned (one or more IDCs where they could have been kept), and the success of the
Distribution load estimation (DLE)
Energy Technology Data Exchange (ETDEWEB)
Seppaelae, A; Lehtonen, M [VTT Energy, Espoo (Finland)
1998-08-01
The load research has produced customer class load models to convert the customers` annual energy consumption to hourly load values. The reliability of load models applied from a nation-wide sample is limited in any specific network because many local circumstances are different from utility to utility and time to time. Therefore there is a need to find improvements to the load models or, in general, improvements to the load estimates. In Distribution Load Estimation (DLE) the measurements from the network are utilized to improve the customer class load models. The results of DLE will be new load models that better correspond to the loading of the distribution network but are still close to the original load models obtained by load research. The principal data flow of DLE is presented
International Nuclear Information System (INIS)
Angrisani, Giovanni; Canelli, Michele; Rosato, Antonio; Roselli, Carlo; Sasso, Maurizio; Sibilio, Sergio
2014-01-01
, even in Mediterranean areas, where the climatic conditions are not always suitable for cogeneration. - Highlights: • Load sharing approach between house and office is proposed. • A system consisting of MCHP, heat storage, boiler and thermal network is simulated. • Two different geographical locations in Italy are considered. • An optimal thermo-economic control of MCHP system is implemented. • The energy, environmental and economic implication of the system are investigated
International Nuclear Information System (INIS)
Carlson, K.E.; Ransom, V.H.; Roth, P.A.
1987-03-01
The ATHENA (Advanced Thermal Hydraulic Energy Network Analyzer) code has been developed to perform transient simulation of the thermal hydraulic systems that may be found in fusion reactors, space reactors, and other advanced systems. As an assessment of current capability the code was applied to a number of physical problems, both conceptual and actual experiments. Results indicate that the numerical solution to the basic conservation equations is technically sound, and that generally good agreement can be obtained when modeling relevant hydrodynamic experiments. The assessment also demonstrates basic fusion system modeling capability and verifies compatibility of the code with both CDC and CRAY mainframes. Areas where improvements could be made include constitutive modeling, which describes the interfacial exchange term. 13 refs., 84 figs
Selected Problems of Determining the Course of Railway Routes by Use of GPS Network Solution
Koc, Władysław; Specht, Cezary
2011-09-01
The main problem related to railroad surveying design and its maintenance is the necessity to operate in local geodetic reference systems caused by the long rail sections with straight lines and curvatures of the running edge. Due to that reason the geodetic railroad classical surveying methods requires to divide all track for a short measurement section and that caused additional errors. Development of the Global Navigational Satellite Systems (GNSS) positioning methods operating in the standardized World Geodetic System (WGS-84) allowed verification of capability of utilization GPS measurements for railroad surveying. It can be stated that implemented satellite measurement techniques opens a whole new perspective on applied research and enables very precise determination of data for railway line determining, modernization and design. The research works focused on implementation GNSS multi-receivers measurement positioning platform for projecting and stock-taking working based on polish active geodesic network ASG-EUPOS, as a reference frame. In order to eliminate the influence of random measurement errors and to obtain the coordinates representing the actual shape of the track few campaigns were realized in 2009 and 2010. Leica GPS Total station system 1200 SmartRover (with ATX1230 GG antennas) receivers were located in the diameter of the measurement platform. Polish Active Geodetic Network ASG-EUPOS was used as a reference network transmitted Real Time Kinematic Positioning Service according to RTCM 3.1 standard. Optimum time period were selected for GNSS campaign and testing area was chosen without large obstructions. The article presents some surveying results of the measurement campaigns and also discusses the accuracy of the course determination. Analyzes and implementation of results in railroad design process are also discussed.
Jayawickreme, Nuwan; Mootoo, Candace; Fountain, Christine; Rasmussen, Andrew; Jayawickreme, Eranda; Bertuccio, Rebecca F
2017-10-01
A growing body of literature indicates that the mental distress experienced by survivors of war is a function of both experienced trauma and stressful life events. However, the majority of these studies are limited in that they 1) employ models of psychological distress that emphasize underlying latent constructs and do not allow researchers to examine the unique associations between particular symptoms and various stressors; and 2) use one or more measures that were not developed for that particular context and thus may exclude key traumas, stressful life events and symptoms of psychopathology. The current study addresses both these limitations by 1) using a novel conceptual model, network analysis, which assumes that symptoms covary with each other not because they stem from a latent construct, but rather because they represent meaningful relationships between the symptoms; and 2) employing a locally developed measure of experienced trauma, stressful life problems and symptoms of psychopathology. Over the course of 2009-2011, 337 survivors of the Sri Lankan civil war were administered the Penn-RESIST-Peradeniya War Problems Questionnaire (PRPWPQ). Network analysis revealed that symptoms of psychopathology, problems pertaining to lack of basic needs, and social problems were central to the network relative to experienced trauma and other types of problems. After controlling for shared associations, social problems in particular were the most central, significantly more so than traumatic events and family problems. Several particular traumatic events, stressful life events and symptoms of psychopathology that were central to the network were also identified. Discussion emphasizes the utility of such network models to researchers and practitioners determining how to spend limited resources in the most impactful way possible. Copyright © 2017 Elsevier Ltd. All rights reserved.
Robust transient stabilisation problem for a synchronous generator in a power network
Verrelli, C. M.; Damm, G.
2010-04-01
The robust transient stabilisation problem (with stability proof) of a synchronous generator in an uncertain power network with transfer conductances is rigorously formulated and solved. The generator angular speed and electrical power are required to be kept close, when mechanical and electrical perturbations occur, to the synchronous speed and mechanical input power, respectively, while the generator terminal voltage is to be regulated, when perturbations are removed, to its pre-fault reference constant value. A robust adaptive nonlinear feedback control algorithm is designed on the basis of a third-order model of the synchronous machine: only two system parameters (synchronous machine damping and inertia constants) along with upper and lower bounds on the remaining uncertain ones are supposed to be known. The conditions to be satisfied by the remote network dynamics for guaranteeing ℒ2 and ℒ∞ robustness and asymptotic relative speed and voltage regulation to zero are weaker than those required by the single machine-infinite bus approximation: dynamic interactions between the local deviations of the generator states from the corresponding equilibrium values and the remote generators states are allowed.
Radaydeh, Redha Mahmoud
2013-06-01
This paper proposes a reduced-complexity downlink multi-channel assignment scheme when feedback links are capacity-limited. The system model treats the case when multiple access points are allocated to serve scheduled users in over-loaded (i.e. dense) pico/femtocell networks. It assumes that the deployed access points can be shared simultaneously and employ isotropic antenna arrays of arbitrary sizes. Moreover, they transmit their data on a common physical channel and can not coordinate their transmissions. On the other hand, each scheduled user can be served by single transmit channel from each active access point at a time, and it lacks coordination with concurrent active users. The scheme operates according to the occupancy of available transmit channels, wherein extensively occupied access points are avoided adaptively, while reducing the load of processing. The operation is linked to a target performance via controlling the observed aggregate interference from the projected set of serving points. Through the analysis, results for the scheduled user outage performance, and the average number of active access points are presented. Numerical and simulations studies clarify the gains of the proposed scheme for different operating conditions. © 2013 IEEE.
Radaydeh, Redha Mahmoud; Qaraqe, Khalid A.; Alouini, Mohamed-Slim
2013-01-01
This paper proposes a reduced-complexity downlink multi-channel assignment scheme when feedback links are capacity-limited. The system model treats the case when multiple access points are allocated to serve scheduled users in over-loaded (i.e. dense) pico/femtocell networks. It assumes that the deployed access points can be shared simultaneously and employ isotropic antenna arrays of arbitrary sizes. Moreover, they transmit their data on a common physical channel and can not coordinate their transmissions. On the other hand, each scheduled user can be served by single transmit channel from each active access point at a time, and it lacks coordination with concurrent active users. The scheme operates according to the occupancy of available transmit channels, wherein extensively occupied access points are avoided adaptively, while reducing the load of processing. The operation is linked to a target performance via controlling the observed aggregate interference from the projected set of serving points. Through the analysis, results for the scheduled user outage performance, and the average number of active access points are presented. Numerical and simulations studies clarify the gains of the proposed scheme for different operating conditions. © 2013 IEEE.
Yuan, Fanshu; Huang, Yang; Fan, Mengmeng; Chen, Chuntao; Qian, Jieshu; Hao, Qingli; Yang, Jiazhi; Sun, Dongping
2018-02-06
The large-scale, low-cost preparation of Pt-based catalysts with high activity and durability for the methanol oxidation reaction is still challenging. The key to achieving this aim is finding suitable supporting materials. In this paper, N-doped carbon nanofibrous networks are prepared by annealing a gel containing two inexpensive and ecofriendly precursors, that is, bacterial cellulose and urea, for the loading of Pt nanoparticles. An undoped analogue is also prepared for comparison. Meanwhile, the effect of the annealing temperature on the performance of the catalysts is evaluated. The results show that the N doping and higher annealing temperature can improve the electron conductivity of the catalyst and provide more active sites for the loading of ultrafine Pt nanoparticles with a narrow size distribution. The best catalyst exhibits a remarkably high electrocatalytic activity (627 mA mg -1 ), excellent poison tolerance, and high durability. This work demonstrates an ideal Pt supporting material for the methanol oxidation reaction. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
International Nuclear Information System (INIS)
Boroushaki, M.; Ghofrani, M.B.; Lucas, C.; Yazdanpanah, M.J.
2003-01-01
In the last decade, the intelligent control community has paid great attention to the topic of intelligent control systems for nuclear plants (core, steam generator...). Papers mostly used approximate and simple mathematical SISO (single-input-single-output) model of nuclear plants for testing and/or tuning of the control systems. They also tried to generalize theses models to a real MIMO (multi-input-multi-output) plant, while nuclear plants are typically of complex nonlinear and multivariable nature with high interactions between their state variables and therefore, many of these proposed intelligent control systems are not appropriate for real cases. In this paper, we designed an on-line intelligent core controller for load following operations, based on a heuristic control algorithm, using a valid and updatable recurrent neural network (RNN). We have used an accurate 3-dimensional core calculation code to represent the real plant and to train the RNN. The results of simulation show that this intelligent controller can control the reactor core during load following operations, using optimum control rod groups manoeuvre and variable overlapping strategy. This methodology represents a simple and reliable procedure for controlling other complex nonlinear MIMO plants, and may improve the responses, comparing to other control systems
Directory of Open Access Journals (Sweden)
Yun-Hao Li
2015-12-01
Full Text Available This paper presents a flexible transmission network expansion planning (TNEP approach considering uncertainty. A novel hybrid clustering technique, which integrates the graph partitioning method and rough fuzzy clustering, is proposed to cope with uncertain renewable generation and load demand. The proposed clustering method is capable of recognizing the actual cluster distribution of complex datasets and providing high-quality clustering results. By clustering the hourly data for renewable generation and load demand, a multi-scenario model is proposed to consider the corresponding uncertainties in TNEP. Furthermore, due to the peak distribution characteristics of renewable generation and heavy investment in transmission, the traditional TNEP, which caters to rated renewable power output, is usually uneconomic. To improve the economic efficiency, the multi-objective optimization is incorporated into the multi-scenario TNEP model, while the curtailment of renewable generation is considered as one of the optimization objectives. The solution framework applies a modified NSGA-II algorithm to obtain a set of Pareto optimal planning schemes with different levels of investment costs and renewable generation curtailments. Numerical results on the IEEE RTS-24 system demonstrated the robustness and effectiveness of the proposed approach.
Directory of Open Access Journals (Sweden)
Jaime Lloret
2013-08-01
Full Text Available Short-Term Load Forecasting plays a significant role in energy generation planning, and is specially gaining momentum in the emerging Smart Grids environment, which usually presents highly disaggregated scenarios where detailed real-time information is available thanks to Communications and Information Technologies, as it happens for example in the case of microgrids. This paper presents a two stage prediction model based on an Artificial Neural Network in order to allow Short-Term Load Forecasting of the following day in microgrid environment, which first estimates peak and valley values of the demand curve of the day to be forecasted. Those, together with other variables, will make the second stage, forecast of the entire demand curve, more precise than a direct, single-stage forecast. The whole architecture of the model will be presented and the results compared with recent work on the same set of data, and on the same location, obtaining a Mean Absolute Percentage Error of 1.62% against the original 2.47% of the single stage model.
Directory of Open Access Journals (Sweden)
Yoga Bayu Aji Pranawa
2017-03-01
Full Text Available Wireless Quality of Service (QOS adalah salah satu dimensi mobilitas, yaitu sebuah metode yang digunakan untuk menjaga kualitas suatu jaringan nirkabel. QOS diperlukan sebagai sebuah metode untuk memenuhi kriteria pelayanan sistem bagi pengguna, yaitu confidentiality, integrity, dan availability. Beberapa aspek yang menjadi topik utama dalam QOS adalah failure and recovery mechanism, variable bandwidth, computing distribution, discovery mechanism, variable lantency, dan performance feedback. Wireless yang dibahas pada penelitian ini dititik beratkan pada jaringan seluler yang cenderung tidak reliable pada daerah tertentu. Oleh karena itu dibutuhkan sebuah mekanisme yang dapat mengatasi tidak stabilnya jaringan seluler tersebut. mplementasi mekanisme yang diterapkan pada penelitian ini adalah dengan menerapkan load switching pada jaringan seluler dengan menggunakan beberapa provider dan menerapkan teknologi Software Defined Network (SDN. Berdasarkan hasi uji coba dapat disimpulkan bahwa sistem yang dibuat pada penelitian ini dapat menerapkan wireless quality of service dan meningkatkan network reliability sebesar 65,29% dan 83,87% lebih baik untuk penggunaan tanpa waktu tunggu dan dengan waktu tunggu pada suatu jaringan dinamis.
Energy Technology Data Exchange (ETDEWEB)
Rozov, Vladimir, E-mail: vladimir.rozov@iter.org [ITER Organization, Route de Vinon sur Verdon, 13115 Saint Paul-lez-Durance (France); Belyakov, V.; Kukhtin, V.; Lamzin, E.; Mazul, I.; Sytchevsky, S. [D.V. Efremov Scientific Research Institute, 196641 St. Petersburg (Russian Federation)
2014-11-15
Highlights: • We present the way of modeling transient electro-magnetic loads on local conductive domains in the large magnetic system. • Simplification is achieved by decomposing of the problem, multi-scale integral-differential modeling and use of integral parameters. • The intrinsic scale of loads on a localized conductor with eddy is quantified through the load susceptibility tensor. • Solution is searched as response of a simple equivalent dynamic simulator, using control theory methods. • The concept is exemplified with multi-scenario assessment of EM eddy loads on ITER blanket modules. - Abstract: The complexity of the electromagnetic (EM) response of the tokamak structures is one of the key and design-driving issues for the ITER. We consider the specifics of the assessment of ponderomotive forces, acting on local components of a large electro-physical device during electromagnetic transients. A strategy and approach is proposed for the operative EM loads modeling and analysis that enables design optimization at early phases of development. The paper describes a method of principal simplification of the mathematical model, based on the analysis and exploiting specific features and peculiarities of the relevant technical problem, determined by the design and operation of the device and system under consideration. The application of the method for predictive EM loads analysis and corresponding numerical calculations are exemplified for the localized ITER blanket components — shield modules. The example demonstrates the efficiency of EM load analysis in complex electromagnetic systems via a set of simplified models with different scope, contents and level of detail.
International Nuclear Information System (INIS)
Rozov, Vladimir; Belyakov, V.; Kukhtin, V.; Lamzin, E.; Mazul, I.; Sytchevsky, S.
2014-01-01
Highlights: • We present the way of modeling transient electro-magnetic loads on local conductive domains in the large magnetic system. • Simplification is achieved by decomposing of the problem, multi-scale integral-differential modeling and use of integral parameters. • The intrinsic scale of loads on a localized conductor with eddy is quantified through the load susceptibility tensor. • Solution is searched as response of a simple equivalent dynamic simulator, using control theory methods. • The concept is exemplified with multi-scenario assessment of EM eddy loads on ITER blanket modules. - Abstract: The complexity of the electromagnetic (EM) response of the tokamak structures is one of the key and design-driving issues for the ITER. We consider the specifics of the assessment of ponderomotive forces, acting on local components of a large electro-physical device during electromagnetic transients. A strategy and approach is proposed for the operative EM loads modeling and analysis that enables design optimization at early phases of development. The paper describes a method of principal simplification of the mathematical model, based on the analysis and exploiting specific features and peculiarities of the relevant technical problem, determined by the design and operation of the device and system under consideration. The application of the method for predictive EM loads analysis and corresponding numerical calculations are exemplified for the localized ITER blanket components — shield modules. The example demonstrates the efficiency of EM load analysis in complex electromagnetic systems via a set of simplified models with different scope, contents and level of detail
Rohman, Muhamad Nur; Hidayat, Mas Irfan P.; Purniawan, Agung
2018-04-01
Neural networks (NN) have been widely used in application of fatigue life prediction. In the use of fatigue life prediction for polymeric-base composite, development of NN model is necessary with respect to the limited fatigue data and applicable to be used to predict the fatigue life under varying stress amplitudes in the different stress ratios. In the present paper, Multilayer-Perceptrons (MLP) model of neural network is developed, and Genetic Algorithm was employed to optimize the respective weights of NN for prediction of polymeric-base composite materials under variable amplitude loading. From the simulation result obtained with two different composite systems, named E-glass fabrics/epoxy (layups [(±45)/(0)2]S), and E-glass/polyester (layups [90/0/±45/0]S), NN model were trained with fatigue data from two different stress ratios, which represent limited fatigue data, can be used to predict another four and seven stress ratios respectively, with high accuracy of fatigue life prediction. The accuracy of NN prediction were quantified with the small value of mean square error (MSE). When using 33% from the total fatigue data for training, the NN model able to produce high accuracy for all stress ratios. When using less fatigue data during training (22% from the total fatigue data), the NN model still able to produce high coefficient of determination between the prediction result compared with obtained by experiment.
Walker, Sandra; Kennedy, Anne; Vassilev, Ivaylo; Rogers, Anne
2018-02-01
Social network processes impact on the genesis and management of mental health problems. There is currently less understanding of the way people negotiate networked relationships in times of crisis compared to how they manage at other times. This paper explores the patterns and nature of personal network involvement at times of crises and how these may differ from day-to-day networks of recovery and maintenance. Semi-structured interviews with 25 participants with a diagnosis of long-term mental health (MH) problems drawn from recovery settings in the south of England. Interviews centred on personal network mapping of members and resources providing support. The mapping interviews explored the work of network members and changes in times of crisis. Interviews were recorded, transcribed and analysed using a framework analysis. Three key themes were identified: the fluidity of network relationality between crisis and recovery; isolation as a means of crises management; leaning towards peer support. Personal network input retreated at times of crisis often as result of "ejection" from the network by participants who used self-isolation as a personal management strategy in an attempt to deal with crises. Peer support is considered useful during a crisis, whilst the role of services was viewed with some ambiguity. Social networks membership, and type and depth of involvement, is subject to change between times of crisis and everyday support. This has implications for managing mental health in terms of engaging with network support differently in times of crises versus recovery and everyday living. © 2017 The Authors Health Expectations Published by John Wiley & Sons Ltd.
Traveling salesman problems with PageRank Distance on complex networks reveal community structure
Jiang, Zhongzhou; Liu, Jing; Wang, Shuai
2016-12-01
In this paper, we propose a new algorithm for community detection problems (CDPs) based on traveling salesman problems (TSPs), labeled as TSP-CDA. Since TSPs need to find a tour with minimum cost, cities close to each other are usually clustered in the tour. This inspired us to model CDPs as TSPs by taking each vertex as a city. Then, in the final tour, the vertices in the same community tend to cluster together, and the community structure can be obtained by cutting the tour into a couple of paths. There are two challenges. The first is to define a suitable distance between each pair of vertices which can reflect the probability that they belong to the same community. The second is to design a suitable strategy to cut the final tour into paths which can form communities. In TSP-CDA, we deal with these two challenges by defining a PageRank Distance and an automatic threshold-based cutting strategy. The PageRank Distance is designed with the intrinsic properties of CDPs in mind, and can be calculated efficiently. In the experiments, benchmark networks with 1000-10,000 nodes and varying structures are used to test the performance of TSP-CDA. A comparison is also made between TSP-CDA and two well-established community detection algorithms. The results show that TSP-CDA can find accurate community structure efficiently and outperforms the two existing algorithms.
Solution Algorithm for a New Bi-Level Discrete Network Design Problem
Directory of Open Access Journals (Sweden)
Qun Chen
2013-12-01
Full Text Available A new discrete network design problem (DNDP was pro-posed in this paper, where the variables can be a series of integers rather than just 0-1. The new DNDP can determine both capacity improvement grades of reconstruction roads and locations and capacity grades of newly added roads, and thus complies with the practical projects where road capacity can only be some discrete levels corresponding to the number of lanes of roads. This paper designed a solution algorithm combining branch-and-bound with Hooke-Jeeves algorithm, where feasible integer solutions are recorded in searching the process of Hooke-Jeeves algorithm, lend -ing itself to determine the upper bound of the upper-level problem. The thresholds for branch cutting and ending were set for earlier convergence. Numerical examples are given to demonstrate the efficiency of the proposed algorithm.
Context dependent off loading for cloudlet in mobile ad-hoc network
Bhatt, N.; Nadesh, R. K.; ArivuSelvan, K.
2017-11-01
Cloud Computing in Mobile Ad-hoc network is emerging part of research consideration as the demand and competency of mobile devices increased in last few years. To follow out operation within the remote cloud builds the postponement and influences the administration standard. To keep away from this trouble cloudlet is presented. Cloudlet gives identical support of the devices as cloud at low inactivity however at high transfer speed. Be that as it may, choice of a cloudlet for offloading calculation with flat energy is a noteworthy test if multiple cloud let is accessible adjacent. Here I proposed energy and bandwidth (Traffic overload for communication with cloud) aware cloudlet selection strategy based on the context dependency of the device location. It works on the basis of mobile device location and bandwidth availability of cloudlet. The cloudlet offloading and selection process using given solution is simulated in Cloud ~ Simulator.
Killeen, Tim; Easthope, Christopher S; Filli, Linard; Linnebank, Michael; Curt, Armin; Bolliger, Marc; Zörner, Björn
2017-05-15
In healthy subjects, changes in arm swing symmetry while walking are observed when a cognitive dual task is added, with a tendency toward left-dominant arm swing as cognitive load increases. We applied a modified Stroop word/color naming paradigm to investigate this effect in spinal cord injured (SCI) patients. Six patients with cervical SCI (cSCI), 6 with thoracic injuries (tSCI; all 12 patients American Spinal Injury Association [ASIA] Injury Score [AIS]D), and 12 healthy, matched controls underwent three-dimensional 3D gait analysis while walking normally at a comfortable speed (NW) and when performing an additional congruent (CS) and incongruent (IS) Stroop task. An arm swing symmetry index (ASI)-in which positive values indicate proportionally more movement on the left and vice versa-was calculated. Even in the baseline NW condition, all three subject groups showed larger arm movements on the left. In controls, ASI increased (NW, 13.7 ± 6.3; CS, 16.6 ± 6.4; IS, 19.6 ± 7.8) as the task became more demanding. A larger shift in tSCI patients (NW, 15.8 ± 6.0; CS, 23.4 ± 3.8; IS, 30.7 ± 4.4) was driven by a significant reduction in right wrist trajectory (p = 0.014), whereas cSCI patients showed a small reduction in mean ASI with high variability (NW, 14.2 ± 10.7; CS, 9.3 ± 13.5; IS, 6.0 ± 12.9). The effect of the IS task on ASI compared to baseline (NW) was significantly different between tSCI (+12.5 ± 6.3) and cSCI (-8.2 ± 6.0) patients (p = 0.011). Disruption of the long propriospinal connections coordinating arm and leg movements during walking may explain the heightened sensitivity to manipulation of cognitive load in tSCI, whereas the more robust automaticity in cSCI may be attributed to impaired supraspinal inputs in the context of preserved intraspinal pathways.
Dynamically Partitionable Autoassociative Networks as a Solution to the Neural Binding Problem
Directory of Open Access Journals (Sweden)
Kenneth Jeffrey Hayworth
2012-09-01
Full Text Available An outstanding question in theoretical neuroscience is how the brain solves the neural binding problem. In vision, binding can be summarized as the ability to represent that certain properties belong to one object while other properties belong to a different object. I review the binding problem in visual and other domains, and review its simplest proposed solution – the anatomical binding hypothesis. This hypothesis has traditionally been rejected as a true solution because it seems to require a type of one-to-one wiring of neurons that would be impossible in a biological system (as opposed to an engineered system like a computer. I show that this requirement for one-to-one wiring can be loosened by carefully considering how the neural representation is actually put to use by the rest of the brain. This leads to a solution where a symbol is represented not as a particular pattern of neural activation but instead as a piece of a global stable attractor state. I introduce the Dynamically Partitionable AutoAssociative Network (DPAAN as an implementation of this solution and show how DPANNs can be used in systems which perform perceptual binding and in systems that implement syntax-sensitive rules. Finally I show how the core parts of the cognitive architecture ACT-R can be neurally implemented using a DPAAN as ACT-R’s global workspace. Because the DPAAN solution to the binding problem requires only ‘flat’ neural representations (as opposed to the phase encoded representation hypothesized in neural synchrony solutions it is directly compatible with the most well developed neural models of learning, memory, and pattern recognition.
UE-Initiated Cell Reselection Game for Cell Load Balancing in a Wireless Network
Directory of Open Access Journals (Sweden)
Jaesung Park
2018-01-01
Full Text Available A user changes its serving cell if the quality of experience (QoE provided by the current serving cell is not satisfactory. Since users reselect cells to increase their QoEs selfishly, the system resource efficiency can be deteriorated and a system can be unstable if users are not driven to cooperate appropriately. In this paper, inspired by the minority game (MG model, we design a UE-initiated cell reselection policy. The MG has a salient characteristic that the number of players who win the game converges to a prespecified value even though players act selfishly without knowing the actions taken by the other players. Using the MG model, we devise a rule by which each UE plays a cell reselection game. We also design a criterion that a system controller uses to determine the result of a game and public information sent by a system controller to induce implicit cooperation among UEs. The simulation results show that compared with noncooperative method the proposed method increases not only the system performance, such as cell load balance index and system utility, but also the performance of UEs in terms of a downlink data rate and an outage probability received from a system.
Directory of Open Access Journals (Sweden)
Ahmet Kuzu
2014-01-01
Full Text Available This paper proposes two novel master-slave configurations that provide improvements in both control and communication aspects of teleoperation systems to achieve an overall improved performance in position control. The proposed novel master-slave configurations integrate modular control and communication approaches, consisting of a delay regulator to address problems related to variable network delay common to such systems, and a model tracking control that runs on the slave side for the compensation of uncertainties and model mismatch on the slave side. One of the configurations uses a sliding mode observer and the other one uses a modified Smith predictor scheme on the master side to ensure position transparency between the master and slave, while reference tracking of the slave is ensured by a proportional-differentiator type controller in both configurations. Experiments conducted for the networked position control of a single-link arm under system uncertainties and randomly varying network delays demonstrate significant performance improvements with both configurations over the past literature.
Directory of Open Access Journals (Sweden)
Yu Su
2018-06-01
Full Text Available Electric energy replacement is the umbrella term for the use of electric energy to replace oil (e.g., electric automobiles, coal (e.g., electric heating, and gas (e.g., electric cooking appliances, which increases the electrical load peak, causing greater valley/peak differences. On-load capacity regulating distribution transformers have been used to deal with loads with great valley/peak differences, so reasonably replacing conventional distribution transformers with on-load capacity regulating distribution transformers can effectively cope with load changes after electric energy replacement and reduce the no-load losses of distribution transformers. Before planning for on-load capacity regulating distribution transformers, the nodal effective load considering uncertainties within the life cycle after electric energy replacement was obtained by a Monte Carlo method. Then, according to the loss relation between on-load capacity regulating distribution transformers and conventional distribution transformers, three characteristic indexes of annual continuous apparent power curve and replacement criteria for on-load capacity regulating distribution transformers were put forward in this paper, and a set of distribution transformer replaceable points was obtained. Next, based on cost benefit analysis, a planning model of on-load capacity regulating distribution transformers which consists of investment profitability index within the life cycle, investment cost recouping index and capacity regulating cost index was put forward. The branch and bound method was used to solve the planning model within replaceable point set to obtain upgrading and reconstruction scheme of distribution transformers under a certain investment. Finally, planning analysis of on-load capacity regulating distribution transformers was carried out for electric energy replacement points in one urban distribution network under three scenes: certain load, uncertain load and nodal
Artificial Neural Network for Short-Term Load Forecasting in Distribution Systems
Directory of Open Access Journals (Sweden)
Luis Hernández
2014-03-01
Full Text Available The new paradigms and latest developments in the Electrical Grid are based on the introduction of distributed intelligence at several stages of its physical layer, giving birth to concepts such as Smart Grids, Virtual Power Plants, microgrids, Smart Buildings and Smart Environments. Distributed Generation (DG is a philosophy in which energy is no longer produced exclusively in huge centralized plants, but also in smaller premises which take advantage of local conditions in order to minimize transmission losses and optimize production and consumption. This represents a new opportunity for renewable energy, because small elements such as solar panels and wind turbines are expected to be scattered along the grid, feeding local installations or selling energy to the grid depending on their local generation/consumption conditions. The introduction of these highly dynamic elements will lead to a substantial change in the curves of demanded energy. The aim of this paper is to apply Short-Term Load Forecasting (STLF in microgrid environments with curves and similar behaviours, using two different data sets: the first one packing electricity consumption information during four years and six months in a microgrid along with calendar data, while the second one will be just four months of the previous parameters along with the solar radiation from the site. For the first set of data different STLF models will be discussed, studying the effect of each variable, in order to identify the best one. That model will be employed with the second set of data, in order to make a comparison with a new model that takes into account the solar radiation, since the photovoltaic installations of the microgrid will cause the power demand to fluctuate depending on the solar radiation.
Liu, Mengting; Amey, Rachel C; Forbes, Chad E
2017-12-01
When individuals are placed in stressful situations, they are likely to exhibit deficits in cognitive capacity over and above situational demands. Despite this, individuals may still persevere and ultimately succeed in these situations. Little is known, however, about neural network properties that instantiate success or failure in both neutral and stressful situations, particularly with respect to regions integral for problem-solving processes that are necessary for optimal performance on more complex tasks. In this study, we outline how hidden Markov modeling based on multivoxel pattern analysis can be used to quantify unique brain states underlying complex network interactions that yield either successful or unsuccessful problem solving in more neutral or stressful situations. We provide evidence that brain network stability and states underlying synchronous interactions in regions integral for problem-solving processes are key predictors of whether individuals succeed or fail in stressful situations. Findings also suggested that individuals utilize discriminate neural patterns in successfully solving problems in stressful or neutral situations. Findings overall highlight how hidden Markov modeling can provide myriad possibilities for quantifying and better understanding the role of global network interactions in the problem-solving process and how the said interactions predict success or failure in different contexts.
Directory of Open Access Journals (Sweden)
Faridah Hani Mohamed Salleh
2017-01-01
Full Text Available Gene regulatory network (GRN reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C as a direct interaction (A → C. Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.
Salleh, Faridah Hani Mohamed; Zainudin, Suhaila; Arif, Shereena M
2017-01-01
Gene regulatory network (GRN) reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR) to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C) as a direct interaction (A → C). Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.
Shorikov, A. F.; Butsenko, E. V.
2017-10-01
This paper discusses the problem of multicriterial adaptive optimization the control of investment projects in the presence of several technologies. On the basis of network modeling proposed a new economic and mathematical model and a method for solving the problem of multicriterial adaptive optimization the control of investment projects in the presence of several technologies. Network economic and mathematical modeling allows you to determine the optimal time and calendar schedule for the implementation of the investment project and serves as an instrument to increase the economic potential and competitiveness of the enterprise. On a meaningful practical example, the processes of forming network models are shown, including the definition of the sequence of actions of a particular investment projecting process, the network-based work schedules are constructed. The calculation of the parameters of network models is carried out. Optimal (critical) paths have been formed and the optimal time for implementing the chosen technologies of the investment project has been calculated. It also shows the selection of the optimal technology from a set of possible technologies for project implementation, taking into account the time and cost of the work. The proposed model and method for solving the problem of managing investment projects can serve as a basis for the development, creation and application of appropriate computer information systems to support the adoption of managerial decisions by business people.
Mental disorders as networks of problems : A review of recent insights
Fried, Eiko I.; van Borkulo, Claudia D.; Cramer, Angelique O. J.; Boschloo, Lynn; Schoevers, Robert A.; Borsboom, Denny
The network perspective on psychopathology understands mental disorders as complex networks of interacting symptoms. Despite its recent debut, with conceptual foundations in 2008 and empirical foundations in 2010, the framework has received considerable attention and recognition in the last years.
A path based model for a green liner shipping network design problem
DEFF Research Database (Denmark)
Jepsen, Mads Kehlet; Brouer, Berit Dangaard; Plum, Christian Edinger Munk
2011-01-01
Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost effectiveness and environmentally conscious transport solutions. This article proposes...
Abramov, Dimitri M; Pontes, Monique; Pontes, Adailton T; Mourao-Junior, Carlos A; Vieira, Juliana; Quero Cunha, Carla; Tamborino, Tiago; Galhanone, Paulo R; deAzevedo, Leonardo C; Lazarev, Vladimir V
2017-04-24
In ERP studies of cognitive processes during attentional tasks, the cue signals containing information about the target can increase the amplitude of the parietal cue P3 in relation to the 'neutral' temporal cue, and reduce the subsequent target P3 when this information is valid, i.e. corresponds to the target's attributes. The present study compared the cue-to-target P3 ratios in neutral and visuospatial cueing, in order to estimate the contribution of valid visuospatial information from the cue to target stages of the task performance, in terms of cognitive load. The P3 characteristics were also correlated with the results of individuals' performance of the visuospatial tasks, in order to estimate the relationship of the observed ERP with spatial reasoning. In 20 typically developing boys, aged 10-13 years (11.3±0.86), the intelligence quotient (I.Q.) was estimated by the Block Design and Vocabulary subtests from the WISC-III. The subjects performed the Attentional Network Test (ANT) accompanied by EEG recording. The cued two-choice task had three equiprobable cue conditions: No cue, with no information about the target; Neutral (temporal) cue, with an asterisk in the center of the visual field, predicting the target onset; and Spatial cues, with an asterisk in the upper or lower hemifield, predicting the onset and corresponding location of the target. The ERPs were estimated for the mid-frontal (Fz) and mid-parietal (Pz) scalp derivations. In the Pz, the Neutral cue P3 had a lower amplitude than the Spatial cue P3; whereas for the target ERPs, the P3 of the Neutral cue condition was larger than that of the Spatial cue condition. However, the sums of the magnitudes of the cue and target P3 were equal in the spatial and neutral cueing, probably indicating that in both cases the equivalent information processing load is included in either the cue or the target reaction, respectively. Meantime, in the Fz, the analog ERP components for both the cue and target
Problems and Prospects in Automation and Networking in Libraries in India
Pradip, Joshi; Nikose, S.M.
2010-01-01
This article presents Scenario of Automation and the networking of academic libraries are still in their formative stages. The reasons for, prerequisites of, and benefits of networking are given. Networking systems at the national and local levels are described, as are the salient features of INFLIBNET, which has been functioning since 1988. There are also three metropolitan networks, viz., DELNET, CALIBNET, and BONET. The libraries of the three metropolitan cities are already reaping the ben...
Data Mining and Privacy of Social Network Sites' Users: Implications of the Data Mining Problem.
Al-Saggaf, Yeslam; Islam, Md Zahidul
2015-08-01
This paper explores the potential of data mining as a technique that could be used by malicious data miners to threaten the privacy of social network sites (SNS) users. It applies a data mining algorithm to a real dataset to provide empirically-based evidence of the ease with which characteristics about the SNS users can be discovered and used in a way that could invade their privacy. One major contribution of this article is the use of the decision forest data mining algorithm (SysFor) to the context of SNS, which does not only build a decision tree but rather a forest allowing the exploration of more logic rules from a dataset. One logic rule that SysFor built in this study, for example, revealed that anyone having a profile picture showing just the face or a picture showing a family is less likely to be lonely. Another contribution of this article is the discussion of the implications of the data mining problem for governments, businesses, developers and the SNS users themselves.
Non-intrusive reduced order modeling of nonlinear problems using neural networks
Hesthaven, J. S.; Ubbiali, S.
2018-06-01
We develop a non-intrusive reduced basis (RB) method for parametrized steady-state partial differential equations (PDEs). The method extracts a reduced basis from a collection of high-fidelity solutions via a proper orthogonal decomposition (POD) and employs artificial neural networks (ANNs), particularly multi-layer perceptrons (MLPs), to accurately approximate the coefficients of the reduced model. The search for the optimal number of neurons and the minimum amount of training samples to avoid overfitting is carried out in the offline phase through an automatic routine, relying upon a joint use of the Latin hypercube sampling (LHS) and the Levenberg-Marquardt (LM) training algorithm. This guarantees a complete offline-online decoupling, leading to an efficient RB method - referred to as POD-NN - suitable also for general nonlinear problems with a non-affine parametric dependence. Numerical studies are presented for the nonlinear Poisson equation and for driven cavity viscous flows, modeled through the steady incompressible Navier-Stokes equations. Both physical and geometrical parametrizations are considered. Several results confirm the accuracy of the POD-NN method and show the substantial speed-up enabled at the online stage as compared to a traditional RB strategy.