WorldWideScience

Sample records for network synchronisation optimal

  1. Synchronisation and stability in river metapopulation networks.

    Science.gov (United States)

    Yeakel, J D; Moore, J W; Guimarães, P R; de Aguiar, M A M

    2014-03-01

    Spatial structure in landscapes impacts population stability. Two linked components of stability have large consequences for persistence: first, statistical stability as the lack of temporal fluctuations; second, synchronisation as an aspect of dynamic stability, which erodes metapopulation rescue effects. Here, we determine the influence of river network structure on the stability of riverine metapopulations. We introduce an approach that converts river networks to metapopulation networks, and analytically show how fluctuation magnitude is influenced by interaction structure. We show that river metapopulation complexity (in terms of branching prevalence) has nonlinear dampening effects on population fluctuations, and can also buffer against synchronisation. We conclude by showing that river transects generally increase synchronisation, while the spatial scale of interaction has nonlinear effects on synchronised dynamics. Our results indicate that this dual stability - conferred by fluctuation and synchronisation dampening - emerges from interaction structure in rivers, and this may strongly influence the persistence of river metapopulations. © 2013 John Wiley & Sons Ltd/CNRS.

  2. Introducing Synchronisation in Deterministic Network Models

    DEFF Research Database (Denmark)

    Schiøler, Henrik; Jessen, Jan Jakob; Nielsen, Jens Frederik D.

    2006-01-01

    The paper addresses performance analysis for distributed real time systems through deterministic network modelling. Its main contribution is the introduction and analysis of models for synchronisation between tasks and/or network elements. Typical patterns of synchronisation are presented leading...... to the suggestion of suitable network models. An existing model for flow control is presented and an inherent weakness is revealed and remedied. Examples are given and numerically analysed through deterministic network modelling. Results are presented to highlight the properties of the suggested models...

  3. Collective almost synchronisation in complex networks.

    Science.gov (United States)

    Baptista, Murilo S; Ren, Hai-Peng; Swarts, Johen C M; Carareto, Rodrigo; Nijmeijer, Henk; Grebogi, Celso

    2012-01-01

    This work introduces the phenomenon of Collective Almost Synchronisation (CAS), which describes a universal way of how patterns can appear in complex networks for small coupling strengths. The CAS phenomenon appears due to the existence of an approximately constant local mean field and is characterised by having nodes with trajectories evolving around periodic stable orbits. Common notion based on statistical knowledge would lead one to interpret the appearance of a local constant mean field as a consequence of the fact that the behaviour of each node is not correlated to the behaviours of the others. Contrary to this common notion, we show that various well known weaker forms of synchronisation (almost, time-lag, phase synchronisation, and generalised synchronisation) appear as a result of the onset of an almost constant local mean field. If the memory is formed in a brain by minimising the coupling strength among neurons and maximising the number of possible patterns, then the CAS phenomenon is a plausible explanation for it.

  4. The J-Staff System, Network Synchronisation and Noise

    Science.gov (United States)

    2014-06-01

    0 19th ICCRTS “C2 Agility: Lessons Learned from Research and Operations” The J-Staff System, Network Synchronisation and Noise Topics: 2, 5...DATES COVERED 00-00-2014 to 00-00-2014 4. TITLE AND SUBTITLE The J-Staff System, Network Synchronisation and Noise 5a. CONTRACT NUMBER 5b...Prescribed by ANSI Std Z39-18 1 The J-staff system, Network Synchronisation and Noise Alexander Kalloniatis, Mathew Zuparic Joint & Operations Analysis

  5. Optimised cross-layer synchronisation schemes for wireless sensor networks

    Science.gov (United States)

    Nasri, Nejah; Ben Fradj, Awatef; Kachouri, Abdennaceur

    2017-07-01

    This paper aims at synchronisation between the sensor nodes. Indeed, in the context of wireless sensor networks, it is necessary to take into consideration the energy cost induced by the synchronisation, which can represent the majority of the energy consumed. On communication, an already identified hard point consists in imagining a fine synchronisation protocol which must be sufficiently robust to the intermittent energy in the sensors. Hence, this paper worked on aspects of performance and energy saving, in particular on the optimisation of the synchronisation protocol using cross-layer design method such as synchronisation between layers. Our approach consists in balancing the energy consumption between the sensors and choosing the cluster head with the highest residual energy in order to guarantee the reliability, integrity and continuity of communication (i.e. maximising the network lifetime).

  6. Suppression of phase synchronisation in network based on cat's brain.

    Science.gov (United States)

    Lameu, Ewandson L; Borges, Fernando S; Borges, Rafael R; Iarosz, Kelly C; Caldas, Iberê L; Batista, Antonio M; Viana, Ricardo L; Kurths, Jürgen

    2016-04-01

    We have studied the effects of perturbations on the cat's cerebral cortex. According to the literature, this cortex structure can be described by a clustered network. This way, we construct a clustered network with the same number of areas as in the cat matrix, where each area is described as a sub-network with a small-world property. We focus on the suppression of neuronal phase synchronisation considering different kinds of perturbations. Among the various controlling interventions, we choose three methods: delayed feedback control, external time-periodic driving, and activation of selected neurons. We simulate these interventions to provide a procedure to suppress undesired and pathological abnormal rhythms that can be associated with many forms of synchronisation. In our simulations, we have verified that the efficiency of synchronisation suppression by delayed feedback control is higher than external time-periodic driving and activation of selected neurons of the cat's cerebral cortex with the same coupling strengths.

  7. Phase-synchronisation in continuous flow models of production networks

    Science.gov (United States)

    Scholz-Reiter, Bernd; Tervo, Jan Topi; Freitag, Michael

    2006-04-01

    To improve their position at the market, many companies concentrate on their core competences and hence cooperate with suppliers and distributors. Thus, between many independent companies strong linkages develop and production and logistics networks emerge. These networks are characterised by permanently increasing complexity, and are nowadays forced to adapt to dynamically changing markets. This factor complicates an enterprise-spreading production planning and control enormously. Therefore, a continuous flow model for production networks will be derived regarding these special logistic problems. Furthermore, phase-synchronisation effects will be presented and their dependencies to the set of network parameters will be investigated.

  8. Novel pinning control strategies for synchronisation of complex networks with nonlinear coupling dynamics

    International Nuclear Information System (INIS)

    Zhao-Bing, Liu; Hua-Guang, Zhang; Qiu-Ye, Sun

    2010-01-01

    This paper considers the global stability of controlling an uncertain complex network to a homogeneous trajectory of the uncoupled system by a local pinning control strategy. Several sufficient conditions are derived to guarantee the network synchronisation by investigating the relationship among pinning synchronisation, network topology, and coupling strength. Also, some fundamental and yet challenging problems in the pinning control of complex networks are discussed: (1) what nodes should be selected as pinned candidates? (2) How many nodes are needed to be pinned for a fixed coupling strength? Furthermore, an adaptive pinning control scheme is developed. In order to achieve synchronisation of an uncertain complex network, the adaptive tuning strategy of either the coupling strength or the control gain is utilised. As an illustrative example, a network with the Lorenz system as node self-dynamics is simulated to verify the efficacy of theoretical results. (general)

  9. Network and external perturbation induce burst synchronisation in cat cerebral cortex

    Science.gov (United States)

    Lameu, Ewandson L.; Borges, Fernando S.; Borges, Rafael R.; Batista, Antonio M.; Baptista, Murilo S.; Viana, Ricardo L.

    2016-05-01

    The brain of mammals are divided into different cortical areas that are anatomically connected forming larger networks which perform cognitive tasks. The cat cerebral cortex is composed of 65 areas organised into the visual, auditory, somatosensory-motor and frontolimbic cognitive regions. We have built a network of networks, in which networks are connected among themselves according to the connections observed in the cat cortical areas aiming to study how inputs drive the synchronous behaviour in this cat brain-like network. We show that without external perturbations it is possible to observe high level of bursting synchronisation between neurons within almost all areas, except for the auditory area. Bursting synchronisation appears between neurons in the auditory region when an external perturbation is applied in another cognitive area. This is a clear evidence that burst synchronisation and collective behaviour in the brain might be a process mediated by other brain areas under stimulation.

  10. Feasibility of Optical Packet Switched WDM Networks without Packet Synchronisation Under Bursty Traffic Conditions

    DEFF Research Database (Denmark)

    Fjelde, Tina; Hansen, Peter Bukhave; Kloch, Allan

    1999-01-01

    We show that complex packet synchronisation may be avoided in optical packetswitched networks. Detailed traffic analysis demonstrates that packet lossratios of 1e-10 are feasible under bursty traffic conditions for a highcapacity network consisting of asynchronously operated add-drop switch...

  11. Synaptic Plasticity and Spike Synchronisation in Neuronal Networks

    Science.gov (United States)

    Borges, Rafael R.; Borges, Fernando S.; Lameu, Ewandson L.; Protachevicz, Paulo R.; Iarosz, Kelly C.; Caldas, Iberê L.; Viana, Ricardo L.; Macau, Elbert E. N.; Baptista, Murilo S.; Grebogi, Celso; Batista, Antonio M.

    2017-12-01

    Brain plasticity, also known as neuroplasticity, is a fundamental mechanism of neuronal adaptation in response to changes in the environment or due to brain injury. In this review, we show our results about the effects of synaptic plasticity on neuronal networks composed by Hodgkin-Huxley neurons. We show that the final topology of the evolved network depends crucially on the ratio between the strengths of the inhibitory and excitatory synapses. Excitation of the same order of inhibition revels an evolved network that presents the rich-club phenomenon, well known to exist in the brain. For initial networks with considerably larger inhibitory strengths, we observe the emergence of a complex evolved topology, where neurons sparsely connected to other neurons, also a typical topology of the brain. The presence of noise enhances the strength of both types of synapses, but if the initial network has synapses of both natures with similar strengths. Finally, we show how the synchronous behaviour of the evolved network will reflect its evolved topology.

  12. Synchronisation of networked Kuramoto oscillators under stable Lévy noise

    Science.gov (United States)

    Kalloniatis, Alexander C.; Roberts, Dale O.

    2017-01-01

    We study the Kuramoto model on several classes of network topologies examining the dynamics under the influence of Lévy noise. Such noise exhibits heavier tails than Gaussian and allows us to understand how 'shocks' influence the individual oscillator and collective system behaviour. Skewed α-stable Lévy noise, equivalent to fractional diffusion perturbations, are considered. We perform numerical simulations for Erdős-Rényi (ER) and Barabási-Albert (BA) scale free networks of size N = 1000 while varying the Lévy index α for the noise. We find that synchrony now assumes a surprising variety of forms, not seen for Gaussian-type noise, and changing with α: a noise-generated drift, a smooth α dependence of the point of cross-over of ER and BA networks in the degree of synchronisation, and a severe loss of synchronisation at low values of α. We also show that this robustness of the BA network across most values of α can also be understood as a consequence of the Laplacian of the graph working within the fractional Fokker-Planck equation of the linearised system, close to synchrony, with both eigenvalues and eigenvectors alternately contributing in different regimes of α.

  13. Modelling of synchronisation and energy performance of FBE- and LBE-based standalone LTE-U networks

    Directory of Open Access Journals (Sweden)

    Jiamin Li

    2017-06-01

    Full Text Available Without the aid of licensed channel, deploying long-term evolution (LTE networks over unlicensed spectrum (named standalone LTE-U networks faces the difficulty of establishing and maintaining synchronisation between user equipments and base stations. In this work, considering the two modes of listen-before-talk-based channel access scheme, frame-based equipment (FBE and load-based equipment (LBE, the authors propose analytical frameworks to study the successful probability of synchronisation and the energy consumption of synchronisation in a standalone LTE-U network. Specifically, for the LBE mode, the authors also propose a Lattice-Poisson algorithm-based approach to derive the distribution of the channel non-occupancy period of a standalone LTE-U network. Furthermore, the authors explore the impact of diverse protocol parameters of both FBE and LBE modes on the two studied performance metrics. Simulation results demonstrate the accuracy of the analysis, and shed some light on the selection of FBE and LBE for standalone LTE-U networks, in terms of synchronisation, energy consumption, and throughput of standalone LTE-U and Wi-Fi networks.

  14. Modelling cell cycle synchronisation in networks of coupled radial glial cells.

    Science.gov (United States)

    Barrack, Duncan S; Thul, Rüdiger; Owen, Markus R

    2015-07-21

    Radial glial cells play a crucial role in the embryonic mammalian brain. Their proliferation is thought to be controlled, in part, by ATP mediated calcium signals. It has been hypothesised that these signals act to locally synchronise cell cycles, so that clusters of cells proliferate together, shedding daughter cells in uniform sheets. In this paper we investigate this cell cycle synchronisation by taking an ordinary differential equation model that couples the dynamics of intracellular calcium and the cell cycle and extend it to populations of cells coupled via extracellular ATP signals. Through bifurcation analysis we show that although ATP mediated calcium release can lead to cell cycle synchronisation, a number of other asynchronous oscillatory solutions including torus solutions dominate the parameter space and cell cycle synchronisation is far from guaranteed. Despite this, numerical results indicate that the transient and not the asymptotic behaviour of the system is important in accounting for cell cycle synchronisation. In particular, quiescent cells can be entrained on to the cell cycle via ATP mediated calcium signals initiated by a driving cell and crucially will cycle in near synchrony with the driving cell for the duration of neurogenesis. This behaviour is highly sensitive to the timing of ATP release, with release at the G1/S phase transition of the cell cycle far more likely to lead to near synchrony than release during mid G1 phase. This result, which suggests that ATP release timing is critical to radial glia cell cycle synchronisation, may help us to understand normal and pathological brain development. Copyright © 2015 Elsevier Ltd. All rights reserved.

  15. One node driving synchronisation

    Science.gov (United States)

    Wang, Chengwei; Grebogi, Celso; Baptista, Murilo S.

    2015-12-01

    Abrupt changes of behaviour in complex networks can be triggered by a single node. This work describes the dynamical fundamentals of how the behaviour of one node affects the whole network formed by coupled phase-oscillators with heterogeneous coupling strengths. The synchronisation of phase-oscillators is independent of the distribution of the natural frequencies, weakly depends on the network size, but highly depends on only one key oscillator whose ratio between its natural frequency in a rotating frame and its coupling strength is maximum. This result is based on a novel method to calculate the critical coupling strength with which the phase-oscillators emerge into frequency synchronisation. In addition, we put forward an analytical method to approximately calculate the phase-angles for the synchronous oscillators.

  16. A Collaborative Webbased Framework with Optimized Mobile Synchronisation: Upgrading to Medicine 2.0

    Directory of Open Access Journals (Sweden)

    P.L. Kubben

    2008-07-01

    Full Text Available Magazines like BusinessWeek and Time haveconfirmed “The Power of Us” as we collaborate in the Web2.0. However, current medical practice still relies onMedicine 1.0. The use of webbased collaborativeframeworks (“wiki’s” combined with optimized output andsynchronisation for mobile devices can help us upgrading toMedicine 2.0. This serves as an aid for community-drivenclinical decision support systems increasing medical safety.NeuroWiki.com will be demonstrated as a useful concept inthis philosophy, and its technical background will bedescribed.

  17. Toward Optimal Transport Networks

    Science.gov (United States)

    Alexandrov, Natalia; Kincaid, Rex K.; Vargo, Erik P.

    2008-01-01

    Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

  18. Towards Optimal Transport Networks

    Directory of Open Access Journals (Sweden)

    Erik P. Vargo

    2010-08-01

    Full Text Available Our ultimate goal is to design transportation net- works whose dynamic performance metrics (e.g. pas- senger throughput, passenger delay, and insensitivity to weather disturbances are optimized. Here the fo- cus is on optimizing static features of the network that are known to directly affect the network dynamics. First, we present simulation results which support a connection between maximizing the first non-trivial eigenvalue of a network's Laplacian and superior air- port network performance. Then, we explore the ef- fectiveness of a tabu search heuristic for optimizing this metric by comparing experimental results to the- oretical upper bounds. We also consider generating upper bounds on a network's algebraic connectivity via the solution of semidefinite programming (SDP relaxations. A modification of an existing subgraph extraction algorithm is implemented to explore the underlying regional structures in the U.S. airport net- work, with the hope that the resulting localized struc- tures can be optimized independently and reconnected via a "backbone" network to achieve superior network performance.

  19. Optimization of Pipe Networks

    DEFF Research Database (Denmark)

    Hansen, C. T.; Madsen, Kaj; Nielsen, Hans Bruun

    1991-01-01

    algorithm using successive linear programming is presented. The performance of the algorithm is illustrated by optimizing a network with 201 pipes and 172 nodes. It is concluded that the new algorithm seems to be very efficient and stable, and that it always finds a solution with a cost near the best...

  20. OPTIMAL NETWORK TOPOLOGY DESIGN

    Science.gov (United States)

    Yuen, J. H.

    1994-01-01

    This program was developed as part of a research study on the topology design and performance analysis for the Space Station Information System (SSIS) network. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. It is intended that this new design technique consider all important performance measures explicitly and take into account the constraints due to various technical feasibilities. In the current program, technical constraints are taken care of by the user properly forming the starting set of candidate components (e.g. nonfeasible links are not included). As subsets are generated, they are tested to see if they form an acceptable network by checking that all requirements are satisfied. Thus the first acceptable subset encountered gives the cost-optimal topology satisfying all given constraints. The user must sort the set of "feasible" link elements in increasing order of their costs. The program prompts the user for the following information for each link: 1) cost, 2) connectivity (number of stations connected by the link), and 3) the stations connected by that link. Unless instructed to stop, the program generates all possible acceptable networks in increasing order of their total costs. The program is written only to generate topologies that are simply connected. Tests on reliability, delay, and other performance measures are discussed in the documentation, but have not been incorporated into the program. This program is written in PASCAL for interactive execution and has been implemented on an IBM PC series computer operating under PC DOS. The disk contains source code only. This program was developed in 1985.

  1. Robust OFDM Timing Synchronisation in Multipath Channels

    Directory of Open Access Journals (Sweden)

    McLaughlin S

    2008-01-01

    Full Text Available Abstract This paper addresses pre-FFT synchronisation for orthogonal frequency division multiplex (OFDM under varying multipath conditions. To ensure the most efficient data transmission possible, there should be no constraints on how much of the cyclic prefix (CP is occupied by intersymbol interference (ISI. Here a solution for timing synchronisation is proposed, that is, robust even when the strongest multipath components are delayed relative to the first arriving paths. In this situation, existing methods perform poorly, whereas the solution proposed uses the derivative of the correlation function and is less sensitive to the channel impulse response. In this paper, synchronisation of a DVB single-frequency network is investigated. A refinement is proposed that uses heuristic rules based on the maxima of the correlation and derivative functions to further reduce the estimate variance. The technique has relevance to broadcast, OFDMA, and WLAN applications, and simulations are presented which compare the method with existing approaches.

  2. Optimal Network-Topology Design

    Science.gov (United States)

    Li, Victor O. K.; Yuen, Joseph H.; Hou, Ting-Chao; Lam, Yuen Fung

    1987-01-01

    Candidate network designs tested for acceptability and cost. Optimal Network Topology Design computer program developed as part of study on topology design and analysis of performance of Space Station Information System (SSIS) network. Uses efficient algorithm to generate candidate network designs consisting of subsets of set of all network components, in increasing order of total costs and checks each design to see whether it forms acceptable network. Technique gives true cost-optimal network and particularly useful when network has many constraints and not too many components. Program written in PASCAL.

  3. Airborne Network Optimization with Dynamic Network Update

    Science.gov (United States)

    2015-03-26

    source si and a target ti . For each commodity (si, ki) the commodity specifies a non- negative demand di [5]. The objective of the multi-commodity...queue predictions, and network con- gestion [15]. The implementation of the DRQC uses the Kalman filter to predict the state of the network and optimize

  4. Strategic production line synchronisation

    Directory of Open Access Journals (Sweden)

    Hattingh, Teresa

    2016-08-01

    Full Text Available A study was conducted at the sole global producer of suspension struts for a particular vehicle manufacturer. This supplier is currently able to meet customer demand. However, it does so because of a large finished goods and work-in-progress (WIP inventory. The plant operates two production processes that are separated by a large buffer of WIP, which essentially decouples the production processes. This study aimed to reduce this WIP buffer; this would require the processes to become synchronised, bearing in mind that the reliability of delivery should not decrease. A tool that considers time, quality, and machine capacity was developed to assess the impact of line synchronisation on company performance figures. It was found that line synchronisation produced several benefits for the supplier, including batch size reduction, lower inventory levels, and associated shorter lead times. This further allowed the supplier to improve flow in the plant by introducing a pull system. Improved visual oversight could lead to further improved problem-solving and innovation.

  5. Optimal Fragile Financial Networks

    NARCIS (Netherlands)

    Castiglionesi, F.; Navarro, N.

    2007-01-01

    We study a financial network characterized by the presence of depositors, banks and their shareholders. Belonging to a financial network is beneficial for both the depositors and banks' shareholders since the return to investment increases with the number of banks connected. However, the network is

  6. Combinatorial optimization networks and matroids

    CERN Document Server

    Lawler, Eugene

    2011-01-01

    Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

  7. An linear matrix inequality approach to global synchronisation of non-parameter perturbations of multi-delay Hopfield neural network

    International Nuclear Information System (INIS)

    Shao Hai-Jian; Cai Guo-Liang; Wang Hao-Xiang

    2010-01-01

    In this study, a successful linear matrix inequality approach is used to analyse a non-parameter perturbation of multi-delay Hopfield neural network by constructing an appropriate Lyapunov-Krasovskii functional. This paper presents the comprehensive discussion of the approach and also extensive applications

  8. Cluster-modified function projective synchronisation of complex ...

    Indian Academy of Sciences (India)

    SHUGUO WANG

    2018-01-18

    Jan 18, 2018 ... ogy, mathematics, sociology, and so on. So far, they have proposed many types of synchronisations [1–6], such as complete synchronisation, phase synchronisation, anticipated synchronisation, projective synchronisation, generalised synchronisation, lag synchronisation, etc. Recently, many researchers ...

  9. Location based Network Optimizations for Mobile Wireless Networks

    DEFF Research Database (Denmark)

    Nielsen, Jimmy Jessen

    selection in Wi-Fi networks and predictive handover optimization in heterogeneous wireless networks. The investigations in this work have indicated that location based network optimizations are beneficial compared to typical link measurement based approaches. Especially the knowledge of geographical...

  10. Optimization in a Networked Economy

    Directory of Open Access Journals (Sweden)

    Ahmet Sekreter

    2017-10-01

    Full Text Available An age of network has been living for the last decades. The information technologies have been used by hundreds of millions of users. These technologies are enabling to connect businesses and economic activities. One of the characteristics of the networked economy is the amount of data that produced due to the interlinking of firms, individuals, processes by businesses, and economic activities. Another issue with the networked economy is the complexity of the data. Extraction of the knowledge from the networked economy has challenges by the traditional approach since data is large scale, second decentralized, and third they connect many heterogeneous agents. The challenges can be overcome by the new optimization methods including human element or the social interactions with technological infrastructure.

  11. Optimization of Actuating Origami Networks

    Science.gov (United States)

    Buskohl, Philip; Fuchi, Kazuko; Bazzan, Giorgio; Joo, James; Gregory, Reich; Vaia, Richard

    2015-03-01

    Origami structures morph between 2D and 3D conformations along predetermined fold lines that efficiently program the form, function and mobility of the structure. By leveraging design concepts from action origami, a subset of origami art focused on kinematic mechanisms, reversible folding patterns for applications such as solar array packaging, tunable antennae, and deployable sensing platforms may be designed. However, the enormity of the design space and the need to identify the requisite actuation forces within the structure places a severe limitation on design strategies based on intuition and geometry alone. The present work proposes a topology optimization method, using truss and frame element analysis, to distribute foldline mechanical properties within a reference crease pattern. Known actuating patterns are placed within a reference grid and the optimizer adjusts the fold stiffness of the network to optimally connect them. Design objectives may include a target motion, stress level, or mechanical energy distribution. Results include the validation of known action origami structures and their optimal connectivity within a larger network. This design suite offers an important step toward systematic incorporation of origami design concepts into new, novel and reconfigurable engineering devices. This research is supported under the Air Force Office of Scientific Research (AFOSR) funding, LRIR 13RQ02COR.

  12. Optimizations in Heterogeneous Mobile Networks

    DEFF Research Database (Denmark)

    Popovska Avramova, Andrijana

    nodes. The independent control of the user’s transmit power at each node may cause degradation of the overall performance. In this line, a dedicated study of power distribution among the carriers is performed. An optimization of the power allocation is proposed and evaluated. The results show...... significant performance improvement to the achieved user throughput in low as well as in high loads in the cell. The flow control of the data between the nodes is another challenge for effective aggregation of the resources in case of dual connectivity. As such, this thesis discusses the challenges...... with the densification of the base stations, bring into a very complex network management and operation control for the mobile operators. Furthermore, the need to provide always best connection and service with high quality demands for a joint overall network resource management. This thesis addresses this challenge...

  13. Quantized hopfield networks for reliability optimization

    International Nuclear Information System (INIS)

    Nourelfath, Mustapha; Nahas, Nabil

    2003-01-01

    The use of neural networks in the reliability optimization field is rare. This paper presents an application of a recent kind of neural networks in a reliability optimization problem for a series system with multiple-choice constraints incorporated at each subsystem, to maximize the system reliability subject to the system budget. The problem is formulated as a nonlinear binary integer programming problem and characterized as an NP-hard problem. Our design of neural network to solve efficiently this problem is based on a quantized Hopfield network. This network allows us to obtain optimal design solutions very frequently and much more quickly than others Hopfield networks

  14. 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.

  15. 2016 Network Games, Control, and Optimization Conference

    CERN Document Server

    Jimenez, Tania; Solan, Eilon

    2017-01-01

    This contributed volume offers a collection of papers presented at the 2016 Network Games, Control, and Optimization conference (NETGCOOP), held at the University of Avignon in France, November 23-25, 2016. These papers highlight the increasing importance of network control and optimization in many networking application domains, such as mobile and fixed access networks, computer networks, social networks, transportation networks, and, more recently, electricity grids and biological networks. Covering a wide variety of both theoretical and applied topics in the areas listed above, the authors explore several conceptual and algorithmic tools that are needed for efficient and robust control operation, performance optimization, and better understanding the relationships between entities that may be acting cooperatively or selfishly in uncertain and possibly adversarial environments. As such, this volume will be of interest to applied mathematicians, computer scientists, engineers, and researchers in other relate...

  16. Optimal topologies for maximizing network transmission capacity

    Science.gov (United States)

    Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

    2018-04-01

    It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

  17. Optimizing the next generation optical access networks

    DEFF Research Database (Denmark)

    Amaya Fernández, Ferney Orlando; Soto, Ana Cardenas; Tafur Monroy, Idelfonso

    2009-01-01

    Several issues in the design and optimization of the next generation optical access network (NG-OAN) are presented. The noise, the distortion and the fiber optic nonlinearities are considered to optimize the video distribution link in a passive optical network (PON). A discussion of the effect...

  18. Mathematical model of highways network optimization

    Science.gov (United States)

    Sakhapov, R. L.; Nikolaeva, R. V.; Gatiyatullin, M. H.; Makhmutov, M. M.

    2017-12-01

    The article deals with the issue of highways network design. Studies show that the main requirement from road transport for the road network is to ensure the realization of all the transport links served by it, with the least possible cost. The goal of optimizing the network of highways is to increase the efficiency of transport. It is necessary to take into account a large number of factors that make it difficult to quantify and qualify their impact on the road network. In this paper, we propose building an optimal variant for locating the road network on the basis of a mathematical model. The article defines the criteria for optimality and objective functions that reflect the requirements for the road network. The most fully satisfying condition for optimality is the minimization of road and transport costs. We adopted this indicator as a criterion of optimality in the economic-mathematical model of a network of highways. Studies have shown that each offset point in the optimal binding road network is associated with all other corresponding points in the directions providing the least financial costs necessary to move passengers and cargo from this point to the other corresponding points. The article presents general principles for constructing an optimal network of roads.

  19. Optimization of temporal networks under uncertainty

    CERN Document Server

    Wiesemann, Wolfram

    2012-01-01

    Many decision problems in Operations Research are defined on temporal networks, that is, workflows of time-consuming tasks whose processing order is constrained by precedence relations. For example, temporal networks are used to model projects, computer applications, digital circuits and production processes. Optimization problems arise in temporal networks when a decision maker wishes to determine a temporal arrangement of the tasks and/or a resource assignment that optimizes some network characteristic (e.g. the time required to complete all tasks). The parameters of these optimization probl

  20. Optimal urban networks via mass transportation

    CERN Document Server

    Buttazzo, Giuseppe; Stepanov, Eugene; Solimini, Sergio

    2009-01-01

    Recently much attention has been devoted to the optimization of transportation networks in a given geographic area. One assumes the distributions of population and of services/workplaces (i.e. the network's sources and sinks) are known, as well as the costs of movement with/without the network, and the cost of constructing/maintaining it. Both the long-term optimization and the short-term, "who goes where" optimization are considered. These models can also be adapted for the optimization of other types of networks, such as telecommunications, pipeline or drainage networks. In the monograph we study the most general problem settings, namely, when neither the shape nor even the topology of the network to be constructed is known a priori.

  1. Adaptive optimization and control using neural networks

    Energy Technology Data Exchange (ETDEWEB)

    Mead, W.C.; Brown, S.K.; Jones, R.D.; Bowling, P.S.; Barnes, C.W.

    1993-10-22

    Recent work has demonstrated the ability of neural-network-based controllers to optimize and control machines with complex, non-linear, relatively unknown control spaces. We present a brief overview of neural networks via a taxonomy illustrating some capabilities of different kinds of neural networks. We present some successful control examples, particularly the optimization and control of a small-angle negative ion source.

  2. Energy optimization in mobile sensor networks

    Science.gov (United States)

    Yu, Shengwei

    Mobile sensor networks are considered to consist of a network of mobile robots, each of which has computation, communication and sensing capabilities. Energy efficiency is a critical issue in mobile sensor networks, especially when mobility (i.e., locomotion control), routing (i.e., communications) and sensing are unique characteristics of mobile robots for energy optimization. This thesis focuses on the problem of energy optimization of mobile robotic sensor networks, and the research results can be extended to energy optimization of a network of mobile robots that monitors the environment, or a team of mobile robots that transports materials from stations to stations in a manufacturing environment. On the energy optimization of mobile robotic sensor networks, our research focuses on the investigation and development of distributed optimization algorithms to exploit the mobility of robotic sensor nodes for network lifetime maximization. In particular, the thesis studies these five problems: 1. Network-lifetime maximization by controlling positions of networked mobile sensor robots based on local information with distributed optimization algorithms; 2. Lifetime maximization of mobile sensor networks with energy harvesting modules; 3. Lifetime maximization using joint design of mobility and routing; 4. Optimal control for network energy minimization; 5. Network lifetime maximization in mobile visual sensor networks. In addressing the first problem, we consider only the mobility strategies of the robotic relay nodes in a mobile sensor network in order to maximize its network lifetime. By using variable substitutions, the original problem is converted into a convex problem, and a variant of the sub-gradient method for saddle-point computation is developed for solving this problem. An optimal solution is obtained by the method. Computer simulations show that mobility of robotic sensors can significantly prolong the lifetime of the whole robotic sensor network while

  3. WiMAX network performance monitoring & optimization

    DEFF Research Database (Denmark)

    Zhang, Qi; Dam, H

    2008-01-01

    frequency reuse, capacity planning, proper network dimensioning, multi-class data services and so on. Furthermore, as a small operator we also want to reduce the demand for sophisticated technicians and man labour hours. To meet these critical demands, we design a generic integrated network performance......In this paper we present our WiMAX (worldwide interoperability for microwave access) network performance monitoring and optimization solution. As a new and small WiMAX network operator, there are many demanding issues that we have to deal with, such as limited available frequency resource, tight...... this integrated network performance monitoring and optimization system in our WiMAX networks. This integrated monitoring and optimization system has such good flexibility and scalability that individual function component can be used by other operators with special needs and more advanced function components can...

  4. The synchronisation of fractional-order hyperchaos compound system

    Indian Academy of Sciences (India)

    Naeimadeen Noghredani

    2018-01-24

    Jan 24, 2018 ... ... Engineering, Faculty of Engineering, Ferdowsi University of Mashhad (FUM) Campus, ... effectiveness of the proposed synchronisation scheme using MATLAB. .... component synchronisation in secure communication.

  5. Neural Networks for Optimal Control

    DEFF Research Database (Denmark)

    Sørensen, O.

    1995-01-01

    Two neural networks are trained to act as an observer and a controller, respectively, to control a non-linear, multi-variable process.......Two neural networks are trained to act as an observer and a controller, respectively, to control a non-linear, multi-variable process....

  6. Regulatory Holidays and Optimal Network Expansion

    NARCIS (Netherlands)

    Willems, Bert; Zwart, Gijsbert

    2016-01-01

    We model the optimal regulation of continuous, irreversible, capacity expansion, in a model in which the regulated network firm has private information about its capacity costs, investments need to be financed out of the firm’s cash flows from selling network access and demand is stochastic. If

  7. Power consumption optimization strategy for wireless networks

    DEFF Research Database (Denmark)

    Cornean, Horia; Kumar, Sanjay; Marchetti, Nicola

    2011-01-01

    in order to reduce the total power consumption in a multi cellular network. We present an algorithm for power optimization under no interference and in presence of interference conditions, targeting to maximize the network capacity. The convergence of the algorithm is guaranteed if the interference...

  8. Brocade: Optimal flow placement in SDN networks

    CERN Multimedia

    CERN. Geneva

    2015-01-01

    Today' network poses several challanges to network providers. These challanges fall in to a variety of areas ranging from determining efficient utilization of network bandwidth to finding out which user applications consume majority of network resources. Also, how to protect a given network from volumetric and botnet attacks. Optimal placement of flows deal with identifying network issues and addressing them in a real-time. The overall solution helps in building new services where a network is more secure and more efficient. Benefits derived as a result are increased network efficiency due to better capacity and resource planning, better security with real-time threat mitigation, and improved user experience as a result of increased service velocity.

  9. Psychogenic seizures and frontal disconnection: EEG synchronisation study.

    Science.gov (United States)

    Knyazeva, Maria G; Jalili, Mahdi; Frackowiak, Richard S; Rossetti, Andrea O

    2011-05-01

    Psychogenic non-epileptic seizures (PNES) are paroxysmal events that, in contrast to epileptic seizures, are related to psychological causes without the presence of epileptiform EEG changes. Recent models suggest a multifactorial basis for PNES. A potentially paramount, but currently poorly understood factor is the interplay between psychiatric features and a specific vulnerability of the brain leading to a clinical picture that resembles epilepsy. Hypothesising that functional cerebral network abnormalities may predispose to the clinical phenotype, the authors undertook a characterisation of the functional connectivity in PNES patients. The authors analysed the whole-head surface topography of multivariate phase synchronisation (MPS) in interictal high-density EEG of 13 PNES patients as compared with 13 age- and sex-matched controls. MPS mapping reduces the wealth of dynamic data obtained from high-density EEG to easily readable synchronisation maps, which provide an unbiased overview of any changes in functional connectivity associated with distributed cortical abnormalities. The authors computed MPS maps for both Laplacian and common-average-reference EEGs. In a between-group comparison, only patchy, non-uniform changes in MPS survived conservative statistical testing. However, against the background of these unimpressive group results, the authors found widespread inverse correlations between individual PNES frequency and MPS within the prefrontal and parietal cortices. PNES appears to be associated with decreased prefrontal and parietal synchronisation, possibly reflecting dysfunction of networks within these regions.

  10. Optimal hub location in pipeline networks

    Energy Technology Data Exchange (ETDEWEB)

    Dott, D.R.; Wirasinghe, S.C.; Chakma, A. [Univ. of Calgary, Alberta (Canada)

    1996-12-31

    This paper discusses optimization strategies and techniques for the location of natural gas marketing hubs in the North American gas pipeline network. A hub is a facility at which inbound and outbound network links meet and freight is redirected towards their destinations. Common examples of hubs used in the gas pipeline industry include gas plants, interconnects and market centers. Characteristics of the gas pipeline industry which are relevant to the optimization of transportation costs using hubs are presented. Allocation techniques for solving location-allocation problems are discussed. An outline of the research in process by the authors in the field of optimal gas hub location concludes the paper.

  11. Small cell networks deployment, management, and optimization

    CERN Document Server

    Claussen, Holger; Ho, Lester; Razavi, Rouzbeh; Kucera, Stepan

    2018-01-01

    Small Cell Networks: Deployment, Management, and Optimization addresses key problems of the cellular network evolution towards HetNets. It focuses on the latest developments in heterogeneous and small cell networks, as well as their deployment, operation, and maintenance. It also covers the full spectrum of the topic, from academic, research, and business to the practice of HetNets in a coherent manner. Additionally, it provides complete and practical guidelines to vendors and operators interested in deploying small cells. The first comprehensive book written by well-known researchers and engineers from Nokia Bell Labs, Small Cell Networks begins with an introduction to the subject--offering chapters on capacity scaling and key requirements of future networks. It then moves on to sections on coverage and capacity optimization, and interference management. From there, the book covers mobility management, energy efficiency, and small cell deployment, ending with a section devoted to future trends and applicat...

  12. Experimental pulse synchronisation of two chaotic circuits

    CERN Document Server

    Fortuna, L; Rizzo, A

    2003-01-01

    In this work a novel synchronisation scheme for chaotic systems is presented. Taking inspiration from the system decomposition approach, the master and slave are connected via a switch which allows to alternate the signal fed into the slave between the master signal and the slave signal itself. The switching frequency has been taken into account as a control parameter to characterise the synchronisation properties of the system. Experimental results, performed on real Chua's circuits, confirm the validity of the approach, emphasising the fact that synchronisation is achieved for switching frequencies greater than a certain threshold.

  13. Experimental pulse synchronisation of two chaotic circuits

    International Nuclear Information System (INIS)

    Fortuna, L.; Frasca, M.; Rizzo, A.

    2003-01-01

    In this work a novel synchronisation scheme for chaotic systems is presented. Taking inspiration from the system decomposition approach, the master and slave are connected via a switch which allows to alternate the signal fed into the slave between the master signal and the slave signal itself. The switching frequency has been taken into account as a control parameter to characterise the synchronisation properties of the system. Experimental results, performed on real Chua's circuits, confirm the validity of the approach, emphasising the fact that synchronisation is achieved for switching frequencies greater than a certain threshold

  14. Modeling and optimization of potable water network

    Energy Technology Data Exchange (ETDEWEB)

    Djebedjian, B.; Rayan, M.A. [Mansoura Univ., El-Mansoura (Egypt); Herrick, A. [Suez Canal Authority, Ismailia (Egypt)

    2000-07-01

    Software was developed in order to optimize the design of water distribution systems and pipe networks. While satisfying all the constraints imposed such as pipe diameter and nodal pressure, it was based on a mathematical model treating looped networks. The optimum network configuration and cost are determined considering parameters like pipe diameter, flow rate, corresponding pressure and hydraulic losses. It must be understood that minimum cost is relative to the different objective functions selected. The determination of the proper objective function often depends on the operating policies of a particular company. The solution for the optimization technique was obtained by using a non-linear technique. To solve the optimal design of network, the model was derived using the sequential unconstrained minimization technique (SUMT) of Fiacco and McCormick, which decreased the number of iterations required. The pipe diameters initially assumed were successively adjusted to correspond to the existing commercial pipe diameters. The technique was then applied to a two-loop network without pumps or valves. Fed by gravity, it comprised eight pipes, 1000 m long each. The first evaluation of the method proved satisfactory. As with other methods, it failed to find the global optimum. In the future, research efforts will be directed to the optimization of networks with pumps and reservoirs. 24 refs., 3 tabs., 1 fig.

  15. Synchronisation under shocks: The Lévy Kuramoto model

    Science.gov (United States)

    Roberts, Dale; Kalloniatis, Alexander C.

    2018-04-01

    We study the Kuramoto model of identical oscillators on Erdős-Rényi (ER) and Barabasi-Alberts (BA) scale free networks examining the dynamics when perturbed by a Lévy noise. Lévy noise exhibits heavier tails than Gaussian while allowing for their tempering in a controlled manner. This allows us to understand how 'shocks' influence individual oscillator and collective system behaviour of a paradigmatic complex system. Skewed α-stable Lévy noise, equivalent to fractional diffusion perturbations, are considered, but overlaid by exponential tempering of rate λ. In an earlier paper we found that synchrony takes a variety of forms for identical Kuramoto oscillators subject to stable Lévy noise, not seen for the Gaussian case, and changing with α: a noise-induced drift, a smooth α dependence of the point of cross-over of synchronisation point of ER and BA networks, and a severe loss of synchronisation at low values of α. In the presence of tempering we observe both analytically and numerically a dramatic change to the α synchronisation is sustained over a larger range of values of the 'noise strength' σ, improved compared to the α > 1 tempered cases. Analytically we study the system close to the phase synchronised fixed point and solve the tempered fractional Fokker-Planck equation. There we observe that densities show stronger support in the basin of attraction at low α for fixed coupling, σ and tempering λ. We then perform numerical simulations for networks of size N = 1000 and average degree d ¯ = 10. There, we compute the order parameter r as a function of σ for fixed α and λ and observe values of r ≈ 1 over larger ranges of σ for α synchronisation down to low values of α. We propose a mechanism for this in terms of the basic shape of the tempered stable Lévy densities for various α and how it feeds into Kuramoto oscillator dynamics and illustrate this with examples of specific paths.

  16. Synchronisation of ovulation for management of reproduction in dairy cows.

    Science.gov (United States)

    Bisinotto, R S; Ribeiro, E S; Santos, J E P

    2014-05-01

    Important developments have occurred in the last two decades, since the advent of the Ovsynch protocol, on the understanding and use of synchronisation programmes for management of reproduction in dairy herds. This better understanding of oestrus cycle control associated with suboptimal reproductive performance in dairy herds has led dairy producers to quickly adopt timed artificial insemination (AI) protocols. Recent surveys have documented that fixed-time AI has become an important component of management of reproduction in high-producing herds. Furthermore, timed AI protocols have also demonstrated benefits in pasture-based milk production systems because of the ability to increase insemination rate. In general, successful use of the Ovsynch protocol requires some fundamental physiological principles to be respected, including: induction of ovulation to synchronise follicle growth in the first 2 days of the programme such that a young antral follicle is recruited; maintenance of high concentrations of progesterone during the development of the ovulatory follicle, but also effectively lyse the corpus luteum to result in very low concentration of progesterone at AI; and having a healthy pre-ovulatory follicle of moderate diameter that is highly oestrogenic and responsive to gonadotropins to synchronously ovulate 12 to 18 h after insemination. Current methods oestrous and ovulation synchronisation are still not optimal and future improvements will likely require new technologies for hormone formulation and delivery such that additional interventions are minimised to maintain acceptance by producers.

  17. Optimal Information Processing in Biochemical Networks

    Science.gov (United States)

    Wiggins, Chris

    2012-02-01

    A variety of experimental results over the past decades provide examples of near-optimal information processing in biological networks, including in biochemical and transcriptional regulatory networks. Computing information-theoretic quantities requires first choosing or computing the joint probability distribution describing multiple nodes in such a network --- for example, representing the probability distribution of finding an integer copy number of each of two interacting reactants or gene products while respecting the `intrinsic' small copy number noise constraining information transmission at the scale of the cell. I'll given an overview of some recent analytic and numerical work facilitating calculation of such joint distributions and the associated information, which in turn makes possible numerical optimization of information flow in models of noisy regulatory and biochemical networks. Illustrating cases include quantification of form-function relations, ideal design of regulatory cascades, and response to oscillatory driving.

  18. Optimization and Control of Communication Networks

    OpenAIRE

    Chiang, Mung; Low, Steven

    2005-01-01

    Recently, there has been a surge in research activities that utilize the power of recent developments in nonlinear optimization to tackle a wide scope of work in the analysis and design of communication systems, touching every layer of the layered network architecture, and resulting in both intellectual and practical impacts significantly beyond the earlier frameworks. These research activities are driven by both new demands in the areas of communications and networking, and n...

  19. Improvement on generalised synchronisation of chaotic systems

    International Nuclear Information System (INIS)

    Hui-Bin, Zhu; Fang, Qiu; Bao-Tong, Cui

    2010-01-01

    In this paper, the problem of generalised synchronisation of two different chaotic systems is investigated. Some less conservative conditions are derived using linear matrix inequality other than existing results. Furthermore, a simple adaptive control scheme is proposed to achieve the generalised synchronisation of chaotic systems. The proposed method is simple and easy to implement in practice and can be applied to secure communications. Numerical simulations are also given to demonstrate the effectiveness and feasibility of the theoretical analysis

  20. WiMax network planning and optimization

    CERN Document Server

    Zhang, Yan

    2009-01-01

    This book offers a comprehensive explanation on how to dimension, plan, and optimize WiMAX networks. The first part of the text introduces WiMAX networks architecture, physical layer, standard, protocols, security mechanisms, and highly related radio access technologies. It covers system framework, topology, capacity, mobility management, handoff management, congestion control, medium access control (MAC), scheduling, Quality of Service (QoS), and WiMAX mesh networks and security. Enabling easy understanding of key concepts and technologies, the second part presents practical examples and illu

  1. Optimal transport on supply-demand networks.

    Science.gov (United States)

    Chen, Yu-Han; Wang, Bing-Hong; Zhao, Li-Chao; Zhou, Changsong; Zhou, Tao

    2010-06-01

    In the literature, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grids and supply chain networks, show a far different scenario in which nodes are classified into two categories: supply nodes provide some kinds of services, while demand nodes require them. In this paper, we propose a general transport model for these supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogeneous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the near optimal configuration of supply nodes, which remarkably enhances the transport capacity compared with a random configuration and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.

  2. Method of optimization onboard communication network

    Science.gov (United States)

    Platoshin, G. A.; Selvesuk, N. I.; Semenov, M. E.; Novikov, V. M.

    2018-02-01

    In this article the optimization levels of onboard communication network (OCN) are proposed. We defined the basic parameters, which are necessary for the evaluation and comparison of modern OCN, we identified also a set of initial data for possible modeling of the OCN. We also proposed a mathematical technique for implementing the OCN optimization procedure. This technique is based on the principles and ideas of binary programming. It is shown that the binary programming technique allows to obtain an inherently optimal solution for the avionics tasks. An example of the proposed approach implementation to the problem of devices assignment in OCN is considered.

  3. Network inference via adaptive optimal design

    Directory of Open Access Journals (Sweden)

    Stigter Johannes D

    2012-09-01

    Full Text Available Abstract Background Current research in network reverse engineering for genetic or metabolic networks very often does not include a proper experimental and/or input design. In this paper we address this issue in more detail and suggest a method that includes an iterative design of experiments based, on the most recent data that become available. The presented approach allows a reliable reconstruction of the network and addresses an important issue, i.e., the analysis and the propagation of uncertainties as they exist in both the data and in our own knowledge. These two types of uncertainties have their immediate ramifications for the uncertainties in the parameter estimates and, hence, are taken into account from the very beginning of our experimental design. Findings The method is demonstrated for two small networks that include a genetic network for mRNA synthesis and degradation and an oscillatory network describing a molecular network underlying adenosine 3’-5’ cyclic monophosphate (cAMP as observed in populations of Dyctyostelium cells. In both cases a substantial reduction in parameter uncertainty was observed. Extension to larger scale networks is possible but needs a more rigorous parameter estimation algorithm that includes sparsity as a constraint in the optimization procedure. Conclusion We conclude that a careful experiment design very often (but not always pays off in terms of reliability in the inferred network topology. For large scale networks a better parameter estimation algorithm is required that includes sparsity as an additional constraint. These algorithms are available in the literature and can also be used in an adaptive optimal design setting as demonstrated in this paper.

  4. Fair Optimization and Networks: A Survey

    Directory of Open Access Journals (Sweden)

    Wlodzimierz Ogryczak

    2014-01-01

    Full Text Available Optimization models related to designing and operating complex systems are mainly focused on some efficiency metrics such as response time, queue length, throughput, and cost. However, in systems which serve many entities there is also a need for respecting fairness: each system entity ought to be provided with an adequate share of the system’s services. Still, due to system operations-dependant constraints, fair treatment of the entities does not directly imply that each of them is assigned equal amount of the services. That leads to concepts of fair optimization expressed by the equitable models that represent inequality averse optimization rather than strict inequality minimization; a particular widely applied example of that concept is the so-called lexicographic maximin optimization (max-min fairness. The fair optimization methodology delivers a variety of techniques to generate fair and efficient solutions. This paper reviews fair optimization models and methods applied to systems that are based on some kind of network of connections and dependencies, especially, fair optimization methods for the location problems and for the resource allocation problems in communication networks.

  5. Synchronisation effects on the behavioural performance and information dynamics of a simulated minimally cognitive robotic agent.

    Science.gov (United States)

    Moioli, Renan C; Vargas, Patricia A; Husbands, Phil

    2012-09-01

    Oscillatory activity is ubiquitous in nervous systems, with solid evidence that synchronisation mechanisms underpin cognitive processes. Nevertheless, its informational content and relationship with behaviour are still to be fully understood. In addition, cognitive systems cannot be properly appreciated without taking into account brain-body- environment interactions. In this paper, we developed a model based on the Kuramoto Model of coupled phase oscillators to explore the role of neural synchronisation in the performance of a simulated robotic agent in two different minimally cognitive tasks. We show that there is a statistically significant difference in performance and evolvability depending on the synchronisation regime of the network. In both tasks, a combination of information flow and dynamical analyses show that networks with a definite, but not too strong, propensity for synchronisation are more able to reconfigure, to organise themselves functionally and to adapt to different behavioural conditions. The results highlight the asymmetry of information flow and its behavioural correspondence. Importantly, it also shows that neural synchronisation dynamics, when suitably flexible and reconfigurable, can generate minimally cognitive embodied behaviour.

  6. Phase transitions in Pareto optimal complex networks.

    Science.gov (United States)

    Seoane, Luís F; Solé, Ricard

    2015-09-01

    The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their topological structure can be diverse, resulting from different mechanisms including multiplicative processes and optimization. In spatial networks or in graphs where cost constraints are at work, as it occurs in a plethora of situations from power grids to the wiring of neurons in the brain, optimization plays an important part in shaping their organization. In this paper we study network designs resulting from a Pareto optimization process, where different simultaneous constraints are the targets of selection. We analyze three variations on a problem, finding phase transitions of different kinds. Distinct phases are associated with different arrangements of the connections, but the need of drastic topological changes does not determine the presence or the nature of the phase transitions encountered. Instead, the functions under optimization do play a determinant role. This reinforces the view that phase transitions do not arise from intrinsic properties of a system alone, but from the interplay of that system with its external constraints.

  7. Optimal transportation networks models and theory

    CERN Document Server

    Bernot, Marc; Morel, Jean-Michel

    2009-01-01

    The transportation problem can be formalized as the problem of finding the optimal way to transport a given measure into another with the same mass. In contrast to the Monge-Kantorovitch problem, recent approaches model the branched structure of such supply networks as minima of an energy functional whose essential feature is to favour wide roads. Such a branched structure is observable in ground transportation networks, in draining and irrigation systems, in electrical power supply systems and in natural counterparts such as blood vessels or the branches of trees. These lectures provide mathematical proof of several existence, structure and regularity properties empirically observed in transportation networks. The link with previous discrete physical models of irrigation and erosion models in geomorphology and with discrete telecommunication and transportation models is discussed. It will be mathematically proven that the majority fit in the simple model sketched in this volume.

  8. Formal specifications for Java’s synchronisation classes

    NARCIS (Netherlands)

    Amighi, A.; Blom, Stefan; Huisman, Marieke; Mostowski, Wojciech; Zaharieva, M.

    2013-01-01

    This paper discusses formal specification and verification of the synchronisation classes of the Java API. In many verification systems for concurrent programs, synchronisation is treated as a primitive operation. As a result, verification rules for synchronisation are hard-coded in the logic, and

  9. Modeling and optimization of an electric power distribution network ...

    African Journals Online (AJOL)

    Modeling and optimization of an electric power distribution network planning system using ... of the network was modelled with non-linear mathematical expressions. ... given feasible locations, re-conductoring of existing feeders in the network, ...

  10. Optimization of investments in gas networks

    International Nuclear Information System (INIS)

    Andre, J.

    2010-09-01

    The natural gas networks require very important investments to cope with a still growing demand and to satisfy the new regulatory constraints. The gas market deregulation imposed to the gas network operators, first, transparency rules of a natural monopoly to justify their costs and ultimately their tariffs, and, second, market fluidity objectives in order to facilitate access for competition to the end-users. These major investments are the main reasons for the use of optimization techniques aiming at reducing the costs. Due to the discrete choices (investment location, limited choice of additional capacities, timing) crossed with physical non linear constraints (flow/pressures relations in the pipe or operating ranges of compressors), the programs to solve are Large Mixed Non Linear Programs (MINLP). As these types of programs are known to be hard to solve exactly in polynomial times (NP-hard), advanced optimization methods have to be implemented to obtain realistic results. The objectives of this thesis are threefold. First, one states several investment problems modeling of natural gas networks from industrial world motivations. Second, one identifies the most suitable methods and algorithms to the formulated problems. Third, one exposes the main advantages and drawbacks of these methods with the help of numerical applications on real cases. (author)

  11. Optimization-Based Approaches to Control of Probabilistic Boolean Networks

    Directory of Open Access Journals (Sweden)

    Koichi Kobayashi

    2017-02-01

    Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.

  12. Loop optimization for tensor network renormalization

    Science.gov (United States)

    Yang, Shuo; Gu, Zheng-Cheng; Wen, Xiao-Gang

    We introduce a tensor renormalization group scheme for coarse-graining a two-dimensional tensor network, which can be successfully applied to both classical and quantum systems on and off criticality. The key idea of our scheme is to deform a 2D tensor network into small loops and then optimize tensors on each loop. In this way we remove short-range entanglement at each iteration step, and significantly improve the accuracy and stability of the renormalization flow. We demonstrate our algorithm in the classical Ising model and a frustrated 2D quantum model. NSF Grant No. DMR-1005541 and NSFC 11274192, BMO Financial Group, John Templeton Foundation, Government of Canada through Industry Canada, Province of Ontario through the Ministry of Economic Development & Innovation.

  13. Distributed Robust Optimization in Networked System.

    Science.gov (United States)

    Wang, Shengnan; Li, Chunguang

    2016-10-11

    In this paper, we consider a distributed robust optimization (DRO) problem, where multiple agents in a networked system cooperatively minimize a global convex objective function with respect to a global variable under the global constraints. The objective function can be represented by a sum of local objective functions. The global constraints contain some uncertain parameters which are partially known, and can be characterized by some inequality constraints. After problem transformation, we adopt the Lagrangian primal-dual method to solve this problem. We prove that the primal and dual optimal solutions of the problem are restricted in some specific sets, and we give a method to construct these sets. Then, we propose a DRO algorithm to find the primal-dual optimal solutions of the Lagrangian function, which consists of a subgradient step, a projection step, and a diffusion step, and in the projection step of the algorithm, the optimized variables are projected onto the specific sets to guarantee the boundedness of the subgradients. Convergence analysis and numerical simulations verifying the performance of the proposed algorithm are then provided. Further, for nonconvex DRO problem, the corresponding approach and algorithm framework are also provided.

  14. Synchronisation signatures in the listening brain: a perspective from non-invasive neuroelectrophysiology.

    Science.gov (United States)

    Weisz, Nathan; Obleser, Jonas

    2014-01-01

    Human magneto- and electroencephalography (M/EEG) are capable of tracking brain activity at millisecond temporal resolution in an entirely non-invasive manner, a feature that offers unique opportunities to uncover the spatiotemporal dynamics of the hearing brain. In general, precise synchronisation of neural activity within as well as across distributed regions is likely to subserve any cognitive process, with auditory cognition being no exception. Brain oscillations, in a range of frequencies, are a putative hallmark of this synchronisation process. Embedded in a larger effort to relate human cognition to brain oscillations, a field of research is emerging on how synchronisation within, as well as between, brain regions may shape auditory cognition. Combined with much improved source localisation and connectivity techniques, it has become possible to study directly the neural activity of auditory cortex with unprecedented spatio-temporal fidelity and to uncover frequency-specific long-range connectivities across the human cerebral cortex. In the present review, we will summarise recent contributions mainly of our laboratories to this emerging domain. We present (1) a more general introduction on how to study local as well as interareal synchronisation in human M/EEG; (2) how these networks may subserve and influence illusory auditory perception (clinical and non-clinical) and (3) auditory selective attention; and (4) how oscillatory networks further reflect and impact on speech comprehension. This article is part of a Special Issue entitled Human Auditory Neuroimaging. Copyright © 2013 Elsevier B.V. All rights reserved.

  15. Optimal Brain Surgeon on Artificial Neural Networks in

    DEFF Research Database (Denmark)

    Christiansen, Niels Hørbye; Job, Jonas Hultmann; Klyver, Katrine

    2012-01-01

    It is shown how the procedure know as optimal brain surgeon can be used to trim and optimize artificial neural networks in nonlinear structural dynamics. Beside optimizing the neural network, and thereby minimizing computational cost in simulation, the surgery procedure can also serve as a quick...

  16. Optimizing the spatial pattern of networks for monitoring radioactive releases

    NARCIS (Netherlands)

    Melles, S.J.; Heuvelink, G.B.M.; Twenhofel, C.J.W.; Dijk, van A.; Hiemstra, P.H.; Baume, O.P.; Stohlker, U.

    2011-01-01

    This study presents a method to optimize the sampling design of environmental monitoring networks in a multi-objective setting. We optimize the permanent network of radiation monitoring stations in the Netherlands and parts of Germany as an example. The optimization method proposed combines

  17. Global Optimization for Transport Network Expansion and Signal Setting

    OpenAIRE

    Liu, Haoxiang; Wang, David Z. W.; Yue, Hao

    2015-01-01

    This paper proposes a model to address an urban transport planning problem involving combined network design and signal setting in a saturated network. Conventional transport planning models usually deal with the network design problem and signal setting problem separately. However, the fact that network capacity design and capacity allocation determined by network signal setting combine to govern the transport network performance requires the optimal transport planning to consider the two pr...

  18. Synchronization-optimized networks for coupled nearly identical ...

    Indian Academy of Sciences (India)

    From the stability criteria of the MSF, we construct optimal networks ... of intense research in physical, biological, chemical, technological and social sci- ..... In figure 3a, a sample of initial network of 32 coupled nearly identical Rössler oscilla-.

  19. Parallel Evolutionary Optimization for Neuromorphic Network Training

    Energy Technology Data Exchange (ETDEWEB)

    Schuman, Catherine D [ORNL; Disney, Adam [University of Tennessee (UT); Singh, Susheela [North Carolina State University (NCSU), Raleigh; Bruer, Grant [University of Tennessee (UT); Mitchell, John Parker [University of Tennessee (UT); Klibisz, Aleksander [University of Tennessee (UT); Plank, James [University of Tennessee (UT)

    2016-01-01

    One of the key impediments to the success of current neuromorphic computing architectures is the issue of how best to program them. Evolutionary optimization (EO) is one promising programming technique; in particular, its wide applicability makes it especially attractive for neuromorphic architectures, which can have many different characteristics. In this paper, we explore different facets of EO on a spiking neuromorphic computing model called DANNA. We focus on the performance of EO in the design of our DANNA simulator, and on how to structure EO on both multicore and massively parallel computing systems. We evaluate how our parallel methods impact the performance of EO on Titan, the U.S.'s largest open science supercomputer, and BOB, a Beowulf-style cluster of Raspberry Pi's. We also focus on how to improve the EO by evaluating commonality in higher performing neural networks, and present the result of a study that evaluates the EO performed by Titan.

  20. BWR fuel cycle optimization using neural networks

    International Nuclear Information System (INIS)

    Ortiz-Servin, Juan Jose; Castillo, Jose Alejandro; Pelta, David Alejandro

    2011-01-01

    Highlights: → OCONN a new system to optimize all nuclear fuel management steps in a coupled way. → OCON is based on an artificial recurrent neural network to find the best combination of partial solutions to each fuel management step. → OCONN works with a fuel lattices' stock, a fuel reloads' stock and a control rod patterns' stock, previously obtained with different heuristic techniques. → Results show OCONN is able to find good combinations according the global objective function. - Abstract: In nuclear fuel management activities for BWRs, four combinatorial optimization problems are solved: fuel lattice design, axial fuel bundle design, fuel reload design and control rod patterns design. Traditionally, these problems have been solved in separated ways due to their complexity and the required computational resources. In the specialized literature there are some attempts to solve fuel reloads and control rod patterns design or fuel lattice and axial fuel bundle design in a coupled way. In this paper, the system OCONN to solve all of these problems in a coupled way is shown. This system is based on an artificial recurrent neural network to find the best combination of partial solutions to each problem, in order to maximize a global objective function. The new system works with a fuel lattices' stock, a fuel reloads' stock and a control rod patterns' stock, previously obtained with different heuristic techniques. The system was tested to design an equilibrium cycle with a cycle length of 18 months. Results show that the new system is able to find good combinations. Cycle length is reached and safety parameters are fulfilled.

  1. LinkMind: Link Optimization in Swarming Mobile Sensor Networks

    DEFF Research Database (Denmark)

    Ngo, Trung Dung

    2012-01-01

    of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link...... optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm...

  2. Testing for significance of phase synchronisation dynamics in the EEG.

    Science.gov (United States)

    Daly, Ian; Sweeney-Reed, Catherine M; Nasuto, Slawomir J

    2013-06-01

    A number of tests exist to check for statistical significance of phase synchronisation within the Electroencephalogram (EEG); however, the majority suffer from a lack of generality and applicability. They may also fail to account for temporal dynamics in the phase synchronisation, regarding synchronisation as a constant state instead of a dynamical process. Therefore, a novel test is developed for identifying the statistical significance of phase synchronisation based upon a combination of work characterising temporal dynamics of multivariate time-series and Markov modelling. We show how this method is better able to assess the significance of phase synchronisation than a range of commonly used significance tests. We also show how the method may be applied to identify and classify significantly different phase synchronisation dynamics in both univariate and multivariate datasets.

  3. Practical synchronization on complex dynamical networks via optimal pinning control

    Science.gov (United States)

    Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

    2015-07-01

    We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

  4. Synchronisation in the phase model of three coupled lasers

    International Nuclear Information System (INIS)

    Kuznetsov, A P; Sataev, I R; Tyuryukina, L V; Chernyshov, N Yu

    2014-01-01

    The problem of synchronisation of three lasers is considered within the phase approximation. The domains of complete synchronisation, partial synchronisation, two-frequency resonant regimes, and three-frequency quasi-periodicity have been found using bifurcation analysis, the method of Lyapunov exponent maps, and construction of phase portraits. The differences in the properties of a three-element chain and ring, as well as the influence of the coupling type, are discussed. (control of laser radiation parameters)

  5. Optimization-based topology identification of complex networks

    International Nuclear Information System (INIS)

    Tang Sheng-Xue; Chen Li; He Yi-Gang

    2011-01-01

    In many cases, the topological structures of a complex network are unknown or uncertain, and it is of significance to identify the exact topological structure. An optimization-based method of identifying the topological structure of a complex network is proposed in this paper. Identification of the exact network topological structure is converted into a minimal optimization problem by using the estimated network. Then, an improved quantum-behaved particle swarm optimization algorithm is used to solve the optimization problem. Compared with the previous adaptive synchronization-based method, the proposed method is simple and effective and is particularly valid to identify the topological structure of synchronization complex networks. In some cases where the states of a complex network are only partially observable, the exact topological structure of a network can also be identified by using the proposed method. Finally, numerical simulations are provided to show the effectiveness of the proposed method. (general)

  6. Software defined network inference with evolutionary optimal observation matrices

    OpenAIRE

    Malboubi, M; Gong, Y; Yang, Z; Wang, X; Chuah, CN; Sharma, P

    2017-01-01

    © 2017 Elsevier B.V. A key requirement for network management is the accurate and reliable monitoring of relevant network characteristics. In today's large-scale networks, this is a challenging task due to the scarcity of network measurement resources and the hard constraints that this imposes. This paper proposes a new framework, called SNIPER, which leverages the flexibility provided by Software-Defined Networking (SDN) to design the optimal observation or measurement matrix that can lead t...

  7. Neural Network for Optimization of Existing Control Systems

    DEFF Research Database (Denmark)

    Madsen, Per Printz

    1995-01-01

    The purpose of this paper is to develop methods to use Neural Network based Controllers (NNC) as an optimization tool for existing control systems.......The purpose of this paper is to develop methods to use Neural Network based Controllers (NNC) as an optimization tool for existing control systems....

  8. Optimizing Groundwater Monitoring Networks Using Integrated Statistical and Geostatistical Approaches

    Directory of Open Access Journals (Sweden)

    Jay Krishna Thakur

    2015-08-01

    Full Text Available The aim of this work is to investigate new approaches using methods based on statistics and geo-statistics for spatio-temporal optimization of groundwater monitoring networks. The formulated and integrated methods were tested with the groundwater quality data set of Bitterfeld/Wolfen, Germany. Spatially, the monitoring network was optimized using geo-statistical methods. Temporal optimization of the monitoring network was carried out using Sen’s method (1968. For geostatistical network optimization, a geostatistical spatio-temporal algorithm was used to identify redundant wells in 2- and 2.5-D Quaternary and Tertiary aquifers. Influences of interpolation block width, dimension, contaminant association, groundwater flow direction and aquifer homogeneity on statistical and geostatistical methods for monitoring network optimization were analysed. The integrated approach shows 37% and 28% redundancies in the monitoring network in Quaternary aquifer and Tertiary aquifer respectively. The geostatistical method also recommends 41 and 22 new monitoring wells in the Quaternary and Tertiary aquifers respectively. In temporal optimization, an overall optimized sampling interval was recommended in terms of lower quartile (238 days, median quartile (317 days and upper quartile (401 days in the research area of Bitterfeld/Wolfen. Demonstrated methods for improving groundwater monitoring network can be used in real monitoring network optimization with due consideration given to influencing factors.

  9. District Heating Network Design and Configuration Optimization with Genetic Algorithm

    DEFF Research Database (Denmark)

    Li, Hongwei; Svendsen, Svend

    2013-01-01

    In this paper, the configuration of a district heating network which connects from the heating plant to the end users is optimized. Each end user in the network represents a building block. The connections between the heat generation plant and the end users are represented with mixed integer...... and the pipe friction and heat loss formulations are non-linear. In order to find the optimal district heating network configuration, genetic algorithm which handles the mixed integer nonlinear programming problem is chosen. The network configuration is represented with binary and integer encoding...... and it is optimized in terms of the net present cost. The optimization results indicates that the optimal DH network configuration is determined by multiple factors such as the consumer heating load, the distance between the heating plant to the consumer, the design criteria regarding the pressure and temperature...

  10. 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.

  11. Self-Optimization of LTE Networks Utilizing Celnet Xplorer

    CERN Document Server

    Buvaneswari, A; Polakos, Paul; Buvaneswari, Arumugam

    2010-01-01

    In order to meet demanding performance objectives in Long Term Evolution (LTE) networks, it is mandatory to implement highly efficient, autonomic self-optimization and configuration processes. Self-optimization processes have already been studied in second generation (2G) and third generation (3G) networks, typically with the objective of improving radio coverage and channel capacity. The 3rd Generation Partnership Project (3GPP) standard for LTE self-organization of networks (SON) provides guidelines on self-configuration of physical cell ID and neighbor relation function and self-optimization for mobility robustness, load balancing, and inter-cell interference reduction. While these are very important from an optimization perspective of local phenomenon (i.e., the eNodeB's interaction with its neighbors), it is also essential to architect control algorithms to optimize the network as a whole. In this paper, we propose a Celnet Xplorer-based SON architecture that allows detailed analysis of network performan...

  12. UMTS network planning, optimization, and inter-operation with GSM

    CERN Document Server

    Rahnema, Moe

    2008-01-01

    UMTS Network Planning, Optimization, and Inter-Operation with GSM is an accessible, one-stop reference to help engineers effectively reduce the time and costs involved in UMTS deployment and optimization. Rahnema includes detailed coverage from both a theoretical and practical perspective on the planning and optimization aspects of UMTS, and a number of other new techniques to help operators get the most out of their networks. Provides an end-to-end perspective, from network design to optimizationIncorporates the hands-on experiences of numerous researchersSingle

  13. Context-Aware Local Optimization of Sensor Network Deployment

    Directory of Open Access Journals (Sweden)

    Meysam Argany

    2015-07-01

    Full Text Available Wireless sensor networks are increasingly used for tracking and monitoring dynamic phenomena in urban and natural areas. Spatial coverage is an important issue in sensor networks in order to fulfill the needs of sensing applications. Optimization methods are widely used to efficiently distribute sensor nodes in the network to achieve a desired level of coverage. Most of the existing algorithms do not consider the characteristics of the real environment in the optimization process. In this paper, we propose the integration of contextual information in optimization algorithms to improve sensor network coverage. First, we investigate the implication of contextual information in sensor networks. Then, a conceptual framework for local context-aware sensor network deployment optimization method is introduced and related algorithms are presented in detail. Finally, several experiments are carried out to evaluate the validity of the proposed method. The results obtained from these experiments show the effectiveness of our approach in different contextual situations.

  14. Optimizing online social networks for information propagation.

    Directory of Open Access Journals (Sweden)

    Duan-Bing Chen

    Full Text Available Online users nowadays are facing serious information overload problem. In recent years, recommender systems have been widely studied to help people find relevant information. Adaptive social recommendation is one of these systems in which the connections in the online social networks are optimized for the information propagation so that users can receive interesting news or stories from their leaders. Validation of such adaptive social recommendation methods in the literature assumes uniform distribution of users' activity frequency. In this paper, our empirical analysis shows that the distribution of online users' activity is actually heterogenous. Accordingly, we propose a more realistic multi-agent model in which users' activity frequency are drawn from a power-law distribution. We find that previous social recommendation methods lead to serious delay of information propagation since many users are connected to inactive leaders. To solve this problem, we design a new similarity measure which takes into account users' activity frequencies. With this similarity measure, the average delay is significantly shortened and the recommendation accuracy is largely improved.

  15. Optimizing online social networks for information propagation.

    Science.gov (United States)

    Chen, Duan-Bing; Wang, Guan-Nan; Zeng, An; Fu, Yan; Zhang, Yi-Cheng

    2014-01-01

    Online users nowadays are facing serious information overload problem. In recent years, recommender systems have been widely studied to help people find relevant information. Adaptive social recommendation is one of these systems in which the connections in the online social networks are optimized for the information propagation so that users can receive interesting news or stories from their leaders. Validation of such adaptive social recommendation methods in the literature assumes uniform distribution of users' activity frequency. In this paper, our empirical analysis shows that the distribution of online users' activity is actually heterogenous. Accordingly, we propose a more realistic multi-agent model in which users' activity frequency are drawn from a power-law distribution. We find that previous social recommendation methods lead to serious delay of information propagation since many users are connected to inactive leaders. To solve this problem, we design a new similarity measure which takes into account users' activity frequencies. With this similarity measure, the average delay is significantly shortened and the recommendation accuracy is largely improved.

  16. LinkMind: link optimization in swarming mobile sensor networks.

    Science.gov (United States)

    Ngo, Trung Dung

    2011-01-01

    A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

  17. LinkMind: Link Optimization in Swarming Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Trung Dung Ngo

    2011-08-01

    Full Text Available A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

  18. Optimal placement of distributed generation in distribution networks ...

    African Journals Online (AJOL)

    This paper proposes the application of Particle Swarm Optimization (PSO) technique to find the optimal size and optimum location for the placement of DG in the radial distribution networks for active power compensation by reduction in real power losses and enhancement in voltage profile. In the first segment, the optimal ...

  19. Clock transport synchronisation and the dragging of inertial frames

    International Nuclear Information System (INIS)

    Rosenblum, Arnold

    1987-01-01

    It is shown that it is possible, by using the lack of synchronisation of clocks by clock transport synchronisation in circular orbits, to test for the dragging of inertial frames in Einstein's theory of general relativity. Possible experiments are discussed. (author)

  20. Simultaneous total cavopulmonary connection and cardiac re-synchronisation therapy.

    Science.gov (United States)

    Nakanishi, Keisuke; Kawasaki, Shiori; Amano, Atsushi

    2017-08-01

    We report the simultaneous use of cardiac re-synchronisation therapy and total cavopulmonary connection in a patient with dyssynchrony, wide QRS, and cardiac failure. To our knowledge, this simultaneous approach has not been reported previously. On follow-up, we noted that QRS width and brain natriuretic peptide levels improved. In addition, speckle tracking revealed improved synchronisation of ventricular wall motion.

  1. Genetic Algorithm Optimized Neural Networks Ensemble as ...

    African Journals Online (AJOL)

    NJD

    Improvements in neural network calibration models by a novel approach using neural network ensemble (NNE) for the simultaneous ... process by training a number of neural networks. .... Matlab® version 6.1 was employed for building principal component ... provide a fair simulation of calibration data set with some degree.

  2. Network synchronization: optimal and pessimal scale-free topologies

    Energy Technology Data Exchange (ETDEWEB)

    Donetti, Luca [Departamento de Electronica y Tecnologia de Computadores and Instituto de Fisica Teorica y Computacional Carlos I, Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain); Hurtado, Pablo I; Munoz, Miguel A [Departamento de Electromagnetismo y Fisica de la Materia and Instituto Carlos I de Fisica Teorica y Computacional Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain)], E-mail: mamunoz@onsager.ugr.es

    2008-06-06

    By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability.

  3. Network synchronization: optimal and pessimal scale-free topologies

    International Nuclear Information System (INIS)

    Donetti, Luca; Hurtado, Pablo I; Munoz, Miguel A

    2008-01-01

    By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability

  4. Optimal defense resource allocation in scale-free networks

    Science.gov (United States)

    Zhang, Xuejun; Xu, Guoqiang; Xia, Yongxiang

    2018-02-01

    The robustness research of networked systems has drawn widespread attention in the past decade, and one of the central topics is to protect the network from external attacks through allocating appropriate defense resource to different nodes. In this paper, we apply a specific particle swarm optimization (PSO) algorithm to optimize the defense resource allocation in scale-free networks. Results reveal that PSO based resource allocation shows a higher robustness than other resource allocation strategies such as uniform, degree-proportional, and betweenness-proportional allocation strategies. Furthermore, we find that assigning less resource to middle-degree nodes under small-scale attack while more resource to low-degree nodes under large-scale attack is conductive to improving the network robustness. Our work provides an insight into the optimal defense resource allocation pattern in scale-free networks and is helpful for designing a more robust network.

  5. Modeling, Optimization & Control of Hydraulic Networks

    DEFF Research Database (Denmark)

    Tahavori, Maryamsadat

    2014-01-01

    . The nonlinear network model is derived based on the circuit theory. A suitable projection is used to reduce the state vector and to express the model in standard state-space form. Then, the controllability of nonlinear nonaffine hydraulic networks is studied. The Lie algebra-based controllability matrix is used......Water supply systems consist of a number of pumping stations, which deliver water to the customers via pipeline networks and elevated reservoirs. A huge amount of drinking water is lost before it reaches to end-users due to the leakage in pipe networks. A cost effective solution to reduce leakage...... in water network is pressure management. By reducing the pressure in the water network, the leakage can be reduced significantly. Also it reduces the amount of energy consumption in water networks. The primary purpose of this work is to develop control algorithms for pressure control in water supply...

  6. Wireless Sensor Network Optimization: Multi-Objective Paradigm.

    Science.gov (United States)

    Iqbal, Muhammad; Naeem, Muhammad; Anpalagan, Alagan; Ahmed, Ashfaq; Azam, Muhammad

    2015-07-20

    Optimization problems relating to wireless sensor network planning, design, deployment and operation often give rise to multi-objective optimization formulations where multiple desirable objectives compete with each other and the decision maker has to select one of the tradeoff solutions. These multiple objectives may or may not conflict with each other. Keeping in view the nature of the application, the sensing scenario and input/output of the problem, the type of optimization problem changes. To address different nature of optimization problems relating to wireless sensor network design, deployment, operation, planing and placement, there exist a plethora of optimization solution types. We review and analyze different desirable objectives to show whether they conflict with each other, support each other or they are design dependent. We also present a generic multi-objective optimization problem relating to wireless sensor network which consists of input variables, required output, objectives and constraints. A list of constraints is also presented to give an overview of different constraints which are considered while formulating the optimization problems in wireless sensor networks. Keeping in view the multi facet coverage of this article relating to multi-objective optimization, this will open up new avenues of research in the area of multi-objective optimization relating to wireless sensor networks.

  7. Wireless Sensor Network Optimization: Multi-Objective Paradigm

    Science.gov (United States)

    Iqbal, Muhammad; Naeem, Muhammad; Anpalagan, Alagan; Ahmed, Ashfaq; Azam, Muhammad

    2015-01-01

    Optimization problems relating to wireless sensor network planning, design, deployment and operation often give rise to multi-objective optimization formulations where multiple desirable objectives compete with each other and the decision maker has to select one of the tradeoff solutions. These multiple objectives may or may not conflict with each other. Keeping in view the nature of the application, the sensing scenario and input/output of the problem, the type of optimization problem changes. To address different nature of optimization problems relating to wireless sensor network design, deployment, operation, planing and placement, there exist a plethora of optimization solution types. We review and analyze different desirable objectives to show whether they conflict with each other, support each other or they are design dependent. We also present a generic multi-objective optimization problem relating to wireless sensor network which consists of input variables, required output, objectives and constraints. A list of constraints is also presented to give an overview of different constraints which are considered while formulating the optimization problems in wireless sensor networks. Keeping in view the multi facet coverage of this article relating to multi-objective optimization, this will open up new avenues of research in the area of multi-objective optimization relating to wireless sensor networks. PMID:26205271

  8. Simultaneous optimization of water and heat exchange networks

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Zhiyou; Hou, Yanlong; Li, Xiaoduan; Wang, Jingtao [Tianjin University, Tianjin (China)

    2014-04-15

    This paper focuses on the simultaneous optimization of the heat-integrated water allocation networks. A mathematic model is established to illustrate the modified state-space representation of this problem. An easy logical method is employed to help identify the streams of hot or cold ones. In this model, the water exchange networks (WEN), heat exchange networks (HEN), and the interactions between the WEN and HEN combine together as one unity. Thus, the whole network can be solved at one time, which enhances the possibility to get a global optimal result. Examples from the literature and a PVC plant are analyzed to illustrate the accuracy and applicability of this method.

  9. AS Migration and Optimization of the Power Integrated Data Network

    Science.gov (United States)

    Zhou, Junjie; Ke, Yue

    2018-03-01

    In the transformation process of data integration network, the impact on the business has always been the most important reference factor to measure the quality of network transformation. With the importance of the data network carrying business, we must put forward specific design proposals during the transformation, and conduct a large number of demonstration and practice to ensure that the transformation program meets the requirements of the enterprise data network. This paper mainly demonstrates the scheme of over-migrating point-to-point access equipment in the reconstruction project of power data comprehensive network to migrate the BGP autonomous domain to the specified domain defined in the industrial standard, and to smooth the intranet OSPF protocol Migration into ISIS agreement. Through the optimization design, eventually making electric power data network performance was improved on traffic forwarding, traffic forwarding path optimized, extensibility, get larger, lower risk of potential loop, the network stability was improved, and operational cost savings, etc.

  10. ENERGY OPTIMIZATION IN CLUSTER BASED WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    T. SHANKAR

    2014-04-01

    Full Text Available Wireless sensor networks (WSN are made up of sensor nodes which are usually battery-operated devices, and hence energy saving of sensor nodes is a major design issue. To prolong the networks lifetime, minimization of energy consumption should be implemented at all layers of the network protocol stack starting from the physical to the application layer including cross-layer optimization. Optimizing energy consumption is the main concern for designing and planning the operation of the WSN. Clustering technique is one of the methods utilized to extend lifetime of the network by applying data aggregation and balancing energy consumption among sensor nodes of the network. This paper proposed new version of Low Energy Adaptive Clustering Hierarchy (LEACH, protocols called Advanced Optimized Low Energy Adaptive Clustering Hierarchy (AOLEACH, Optimal Deterministic Low Energy Adaptive Clustering Hierarchy (ODLEACH, and Varying Probability Distance Low Energy Adaptive Clustering Hierarchy (VPDL combination with Shuffled Frog Leap Algorithm (SFLA that enables selecting best optimal adaptive cluster heads using improved threshold energy distribution compared to LEACH protocol and rotating cluster head position for uniform energy dissipation based on energy levels. The proposed algorithm optimizing the life time of the network by increasing the first node death (FND time and number of alive nodes, thereby increasing the life time of the network.

  11. Optimal Design of Gravitational Sewer Networks with General Cellular Automata

    Directory of Open Access Journals (Sweden)

    Mohammad Hadi Afshar

    2014-05-01

    Full Text Available In this paper, a Cellular Automata method is applied for the optimal design of sewer networks. The solution of sewer network optimization problems requires the determination of pipe diameters and average pipe cover depths, minimizing the total cost of the sewer network subject to operational constraints. In this paper, the network nodes and upstream and downstream pipe cover depths are considered as CA cells and cell states, respectively, and the links around each cell are taken into account as neighborhood. The proposed method is a general and flexible method for the optimization of sewer networks as it can be used to optimally design both gravity and pumped network due to the use of pipe nodal cover depths as the decision variables. The proposed method is tested against two  gravitational sewer networks and the  comparison of results with other methods such as  Genetic algorithm, Cellular Automata, Ant Colony Optimization Algorithm and Particle Swarm Optimization show the efficiency and effectiveness of the proposed method.

  12. Stochastic network optimization with application to communication and queueing systems

    CERN Document Server

    Neely, Michael

    2010-01-01

    This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are prov

  13. Designing optimal greenhouse gas monitoring networks for Australia

    Science.gov (United States)

    Ziehn, T.; Law, R. M.; Rayner, P. J.; Roff, G.

    2016-01-01

    Atmospheric transport inversion is commonly used to infer greenhouse gas (GHG) flux estimates from concentration measurements. The optimal location of ground-based observing stations that supply these measurements can be determined by network design. Here, we use a Lagrangian particle dispersion model (LPDM) in reverse mode together with a Bayesian inverse modelling framework to derive optimal GHG observing networks for Australia. This extends the network design for carbon dioxide (CO2) performed by Ziehn et al. (2014) to also minimise the uncertainty on the flux estimates for methane (CH4) and nitrous oxide (N2O), both individually and in a combined network using multiple objectives. Optimal networks are generated by adding up to five new stations to the base network, which is defined as two existing stations, Cape Grim and Gunn Point, in southern and northern Australia respectively. The individual networks for CO2, CH4 and N2O and the combined observing network show large similarities because the flux uncertainties for each GHG are dominated by regions of biologically productive land. There is little penalty, in terms of flux uncertainty reduction, for the combined network compared to individually designed networks. The location of the stations in the combined network is sensitive to variations in the assumed data uncertainty across locations. A simple assessment of economic costs has been included in our network design approach, considering both establishment and maintenance costs. Our results suggest that, while site logistics change the optimal network, there is only a small impact on the flux uncertainty reductions achieved with increasing network size.

  14. Optimal river monitoring network using optimal partition analysis: a case study of Hun River, Northeast China.

    Science.gov (United States)

    Wang, Hui; Liu, Chunyue; Rong, Luge; Wang, Xiaoxu; Sun, Lina; Luo, Qing; Wu, Hao

    2018-01-09

    River monitoring networks play an important role in water environmental management and assessment, and it is critical to develop an appropriate method to optimize the monitoring network. In this study, an effective method was proposed based on the attainment rate of National Grade III water quality, optimal partition analysis and Euclidean distance, and Hun River was taken as a method validation case. There were 7 sampling sites in the monitoring network of the Hun River, and 17 monitoring items were analyzed once a month during January 2009 to December 2010. The results showed that the main monitoring items in the surface water of Hun River were ammonia nitrogen (NH 4 + -N), chemical oxygen demand, and biochemical oxygen demand. After optimization, the required number of monitoring sites was reduced from seven to three, and 57% of the cost was saved. In addition, there were no significant differences between non-optimized and optimized monitoring networks, and the optimized monitoring networks could correctly represent the original monitoring network. The duplicate setting degree of monitoring sites decreased after optimization, and the rationality of the monitoring network was improved. Therefore, the optimal method was identified as feasible, efficient, and economic.

  15. Medical Optimization Network for Space Telemedicine Resources

    Science.gov (United States)

    Shah, R. V.; Mulcahy, R.; Rubin, D.; Antonsen, E. L.; Kerstman, E. L.; Reyes, D.

    2017-01-01

    INTRODUCTION: Long-duration missions beyond low Earth orbit introduce new constraints to the space medical system such as the inability to evacuate to Earth, communication delays, and limitations in clinical skillsets. NASA recognizes the need to improve capabilities for autonomous care on such missions. As the medical system is developed, it is important to have an ability to evaluate the trade space of what resources will be most important. The Medical Optimization Network for Space Telemedicine Resources was developed for this reason, and is now a system to gauge the relative importance of medical resources in addressing medical conditions. METHODS: A list of medical conditions of potential concern for an exploration mission was referenced from the Integrated Medical Model, a probabilistic model designed to quantify in-flight medical risk. The diagnostic and treatment modalities required to address best and worst-case scenarios of each medical condition, at the terrestrial standard of care, were entered into a database. This list included tangible assets (e.g. medications) and intangible assets (e.g. clinical skills to perform a procedure). A team of physicians working within the Exploration Medical Capability Element of NASA's Human Research Program ranked each of the items listed according to its criticality. Data was then obtained from the IMM for the probability of occurrence of the medical conditions, including a breakdown of best case and worst case, during a Mars reference mission. The probability of occurrence information and criticality for each resource were taken into account during analytics performed using Tableau software. RESULTS: A database and weighting system to evaluate all the diagnostic and treatment modalities was created by combining the probability of condition occurrence data with the criticalities assigned by the physician team. DISCUSSION: Exploration Medical Capabilities research at NASA is focused on providing a medical system to

  16. Topologically determined optimal stochastic resonance responses of spatially embedded networks

    International Nuclear Information System (INIS)

    Gosak, Marko; Marhl, Marko; Korosak, Dean

    2011-01-01

    We have analyzed the stochastic resonance phenomenon on spatial networks of bistable and excitable oscillators, which are connected according to their location and the amplitude of external forcing. By smoothly altering the network topology from a scale-free (SF) network with dominating long-range connections to a network where principally only adjacent oscillators are connected, we reveal that besides an optimal noise intensity, there is also a most favorable interaction topology at which the best correlation between the response of the network and the imposed weak external forcing is achieved. For various distributions of the amplitudes of external forcing, the optimal topology is always found in the intermediate regime between the highly heterogeneous SF network and the strong geometric regime. Our findings thus indicate that a suitable number of hubs and with that an optimal ratio between short- and long-range connections is necessary in order to obtain the best global response of a spatial network. Furthermore, we link the existence of the optimal interaction topology to a critical point indicating the transition from a long-range interactions-dominated network to a more lattice-like network structure.

  17. Intelligent Network Flow Optimization (INFLO) prototype acceptance test summary.

    Science.gov (United States)

    2015-05-01

    This report summarizes the results of System Acceptance Testing for the implementation of the Intelligent Network : Flow Optimization (INFLO) Prototype bundle within the Dynamic Mobility Applications (DMA) portion of the Connected : Vehicle Program. ...

  18. Particle swarm optimization of a neural network model in a ...

    Indian Academy of Sciences (India)

    . Since tool life is critically affected by the tool wear, accurate prediction of this wear ... In their work, they established an improvement in the quality ... objective optimization of hard turning using neural network modelling and swarm intelligence ...

  19. Optimization of recurrent neural networks for time series modeling

    DEFF Research Database (Denmark)

    Pedersen, Morten With

    1997-01-01

    The present thesis is about optimization of recurrent neural networks applied to time series modeling. In particular is considered fully recurrent networks working from only a single external input, one layer of nonlinear hidden units and a li near output unit applied to prediction of discrete time...... series. The overall objective s are to improve training by application of second-order methods and to improve generalization ability by architecture optimization accomplished by pruning. The major topics covered in the thesis are: 1. The problem of training recurrent networks is analyzed from a numerical...... of solution obtained as well as computation time required. 3. A theoretical definition of the generalization error for recurrent networks is provided. This definition justifies a commonly adopted approach for estimating generalization ability. 4. The viability of pruning recurrent networks by the Optimal...

  20. Optimal traffic control in highway transportation networks using linear programming

    KAUST Repository

    Li, Yanning

    2014-06-01

    This article presents a framework for the optimal control of boundary flows on transportation networks. The state of the system is modeled by a first order scalar conservation law (Lighthill-Whitham-Richards PDE). Based on an equivalent formulation of the Hamilton-Jacobi PDE, the problem of controlling the state of the system on a network link in a finite horizon can be posed as a Linear Program. Assuming all intersections in the network are controllable, we show that the optimization approach can be extended to an arbitrary transportation network, preserving linear constraints. Unlike previously investigated transportation network control schemes, this framework leverages the intrinsic properties of the Halmilton-Jacobi equation, and does not require any discretization or boolean variables on the link. Hence this framework is very computational efficient and provides the globally optimal solution. The feasibility of this framework is illustrated by an on-ramp metering control example.

  1. Optimization model for the design of distributed wastewater treatment networks

    Directory of Open Access Journals (Sweden)

    Ibrić Nidret

    2012-01-01

    Full Text Available In this paper we address the synthesis problem of distributed wastewater networks using mathematical programming approach based on the superstructure optimization. We present a generalized superstructure and optimization model for the design of the distributed wastewater treatment networks. The superstructure includes splitters, treatment units, mixers, with all feasible interconnections including water recirculation. Based on the superstructure the optimization model is presented. The optimization model is given as a nonlinear programming (NLP problem where the objective function can be defined to minimize the total amount of wastewater treated in treatment operations or to minimize the total treatment costs. The NLP model is extended to a mixed integer nonlinear programming (MINLP problem where binary variables are used for the selection of the wastewater treatment technologies. The bounds for all flowrates and concentrations in the wastewater network are specified as general equations. The proposed models are solved using the global optimization solvers (BARON and LINDOGlobal. The application of the proposed models is illustrated on the two wastewater network problems of different complexity. First one is formulated as the NLP and the second one as the MINLP. For the second one the parametric and structural optimization is performed at the same time where optimal flowrates, concentrations as well as optimal technologies for the wastewater treatment are selected. Using the proposed model both problems are solved to global optimality.

  2. Optimized Neural Network for Fault Diagnosis and Classification

    International Nuclear Information System (INIS)

    Elaraby, S.M.

    2005-01-01

    This paper presents a developed and implemented toolbox for optimizing neural network structure of fault diagnosis and classification. Evolutionary algorithm based on hierarchical genetic algorithm structure is used for optimization. The simplest feed-forward neural network architecture is selected. Developed toolbox has friendly user interface. Multiple solutions are generated. The performance and applicability of the proposed toolbox is verified with benchmark data patterns and accident diagnosis of Egyptian Second research reactor (ETRR-2)

  3. Optimal Control of Interdependent Epidemics in Complex Networks

    OpenAIRE

    Chen, Juntao; Zhang, Rui; Zhu, Quanyan

    2017-01-01

    Optimal control of interdependent epidemics spreading over complex networks is a critical issue. We first establish a framework to capture the coupling between two epidemics, and then analyze the system's equilibrium states by categorizing them into three classes, and deriving their stability conditions. The designed control strategy globally optimizes the trade-off between the control cost and the severity of epidemics in the network. A gradient descent algorithm based on a fixed point itera...

  4. Influence maximization in complex networks through optimal percolation

    Science.gov (United States)

    Morone, Flaviano; Makse, Hernán A.

    2015-08-01

    The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

  5. Genetic algorithm for neural networks optimization

    Science.gov (United States)

    Setyawati, Bina R.; Creese, Robert C.; Sahirman, Sidharta

    2004-11-01

    This paper examines the forecasting performance of multi-layer feed forward neural networks in modeling a particular foreign exchange rates, i.e. Japanese Yen/US Dollar. The effects of two learning methods, Back Propagation and Genetic Algorithm, in which the neural network topology and other parameters fixed, were investigated. The early results indicate that the application of this hybrid system seems to be well suited for the forecasting of foreign exchange rates. The Neural Networks and Genetic Algorithm were programmed using MATLAB«.

  6. Optimal traffic control in highway transportation networks using linear programming

    KAUST Repository

    Li, Yanning; Canepa, Edward S.; Claudel, Christian G.

    2014-01-01

    of the Hamilton-Jacobi PDE, the problem of controlling the state of the system on a network link in a finite horizon can be posed as a Linear Program. Assuming all intersections in the network are controllable, we show that the optimization approach can

  7. Optimization-based Method for Automated Road Network Extraction

    International Nuclear Information System (INIS)

    Xiong, D

    2001-01-01

    Automated road information extraction has significant applicability in transportation. It provides a means for creating, maintaining, and updating transportation network databases that are needed for purposes ranging from traffic management to automated vehicle navigation and guidance. This paper is to review literature on the subject of road extraction and to describe a study of an optimization-based method for automated road network extraction

  8. Optimal search strategies on complex networks

    OpenAIRE

    Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

    2014-01-01

    Complex networks are ubiquitous in nature and play a role of paramount importance in many contexts. Internet and the cyberworld, which permeate our everyday life, are self-organized hierarchical graphs. Urban traffic flows on intricate road networks, which impact both transportation design and epidemic control. In the brain, neurons are cabled through heterogeneous connections, which support the propagation of electric signals. In all these cases, the true challenge is to unveil the mechanism...

  9. Optimizing transport in a homogeneous network

    OpenAIRE

    WEAIRE, DENIS LAWRENCE

    2004-01-01

    PUBLISHED Many situations in physics, biology, and engineering consist of the transport of some physical quantity through a network of narrow channels. The ability of a network to transport such a quantity in every direction can be described by the average conductivity associated with it. When the flow through each channel is conserved and derives from a potential function, we show that there exists an upper bound of the average conductivity and explicitly give the expression f...

  10. Optimal scope of supply chain network & operations design

    NARCIS (Netherlands)

    Ma, N.

    2014-01-01

    The increasingly complex supply chain networks and operations call for the development of decision support systems and optimization techniques that take a holistic view of supply chain issues and provide support for integrated decision-making. The economic impacts of optimized supply chain are

  11. Optimization with PDE constraints ESF networking program 'OPTPDE'

    CERN Document Server

    2014-01-01

    This book on PDE Constrained Optimization contains contributions on the mathematical analysis and numerical solution of constrained optimal control and optimization problems where a partial differential equation (PDE) or a system of PDEs appears as an essential part of the constraints. The appropriate treatment of such problems requires a fundamental understanding of the subtle interplay between optimization in function spaces and numerical discretization techniques and relies on advanced methodologies from the theory of PDEs and numerical analysis as well as scientific computing. The contributions reflect the work of the European Science Foundation Networking Programme ’Optimization with PDEs’ (OPTPDE).

  12. Enhanced Multi-Objective Optimization of Groundwater Monitoring Networks

    DEFF Research Database (Denmark)

    Bode, Felix; Binning, Philip John; Nowak, Wolfgang

    Drinking-water well catchments include many sources for potential contaminations like gas stations or agriculture. Finding optimal positions of monitoring wells for such purposes is challenging because there are various parameters (and their uncertainties) that influence the reliability...... and optimality of any suggested monitoring location or monitoring network. The goal of this project is to develop and establish a concept to assess, design, and optimize early-warning systems within well catchments. Such optimal monitoring networks need to optimize three competing objectives: (1) a high...... be reduced to a minimum. The method is based on numerical simulation of flow and transport in heterogeneous porous media coupled with geostatistics and Monte-Carlo, wrapped up within the framework of formal multi-objective optimization. In order to gain insight into the flow and transport physics...

  13. Control and Optimization of Network in Networked Control System

    Directory of Open Access Journals (Sweden)

    Wang Zhiwen

    2014-01-01

    Full Text Available In order to avoid quality of performance (QoP degradation resulting from quality of service (QoS, the solution to network congestion from the point of control theory, which marks departure of our results from the existing methods, is proposed in this paper. The congestion and bandwidth are regarded as state and control variables, respectively; then, the linear time-invariant (LTI model between congestion state and bandwidth of network is established. Consequently, linear quadratic method is used to eliminate the network congestion by allocating bandwidth dynamically. At last, numerical simulation results are given to illustrate the effectiveness of this modeling approach.

  14. Exploring synchronisation in nonlinear data assimilation

    Science.gov (United States)

    Rodrigues-Pinheiro, Flavia; van Leeuwen, Peter Jan

    2016-04-01

    Present-day data assimilation methods are based on linearizations and face serious problems in strongly nonlinear cases such as convection. A promising solution to this problem is a particle filter, which provides a representation of the model probability density function (pdf) by a discrete set of model states, or particles. The basic particle filter uses Bayes's theorem directly, but does not work in high-dimensional cases. The performance can be improved by considering the proposal density freedom. This allows one to change the model equations to bring the particles closer to the observations, resulting in very efficient update schemes at observation times, but extending these schemes between observation times is computationally expensive. Simple solutions like nudging have been shown to be not powerful enough. A potential solution might be synchronization, in which one tries to synchronise the model of a system with the true evolution of the system via the observations. In practice this means that an extra term is added to the model equations that hampers growth of instabilities on the synchronization manifold. Especially the delayed versions, where observations are allowed to influence the state in the past have shown some remarkable successes. Unfortunately, all efforts ignore errors in the observations, and as soon as these are introduced the performance degrades considerably. There is a close connection between time-delayed synchronization and a Kalman Smoother, which does allow for observational (and other) errors. In this presentation we will explore this connection to the full, with a view to extend synchronization to more realistic settings. Specifically performance of the spread of information from observed to unobserved variables is studied in detail. The results indicate that this extended synchronisation is a promising tool to steer the model states towards the observations efficiently. If time permits, we will show initial results of embedding the

  15. Chaotic Hopfield Neural Network Swarm Optimization and Its Application

    Directory of Open Access Journals (Sweden)

    Yanxia Sun

    2013-01-01

    Full Text Available A new neural network based optimization algorithm is proposed. The presented model is a discrete-time, continuous-state Hopfield neural network and the states of the model are updated synchronously. The proposed algorithm combines the advantages of traditional PSO, chaos and Hopfield neural networks: particles learn from their own experience and the experiences of surrounding particles, their search behavior is ergodic, and convergence of the swarm is guaranteed. The effectiveness of the proposed approach is demonstrated using simulations and typical optimization problems.

  16. A Generic Methodology for Superstructure Optimization of Different Processing Networks

    DEFF Research Database (Denmark)

    Bertran, Maria-Ona; Frauzem, Rebecca; Zhang, Lei

    2016-01-01

    In this paper, we propose a generic computer-aided methodology for synthesis of different processing networks using superstructure optimization. The methodology can handle different network optimization problems of various application fields. It integrates databases with a common data architecture......, a generic model to represent the processing steps, and appropriate optimization tools. A special software interface has been created to automate the steps in the methodology workflow, allow the transfer of data between tools and obtain the mathematical representation of the problem as required...

  17. PlayNCool: Opportunistic Network Coding for Local Optimization of Routing in Wireless Mesh Networks

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

    2013-01-01

    This paper introduces PlayNCool, an opportunistic protocol with local optimization based on network coding to increase the throughput of a wireless mesh network (WMN). PlayNCool aims to enhance current routing protocols by (i) allowing random linear network coding transmissions end-to-end, (ii) r...

  18. Genetic optimization of neural network architecture

    International Nuclear Information System (INIS)

    Harp, S.A.; Samad, T.

    1994-03-01

    Neural networks are now a popular technology for a broad variety of application domains, including the electric utility industry. Yet, as the technology continues to gain increasing acceptance, it is also increasingly apparent that the power that neural networks provide is not an unconditional blessing. Considerable care must be exercised during application development if the full benefit of the technology is to be realized. At present, no fully general theory or methodology for neural network design is available, and application development is a trial-and-error process that is time-consuming and expertise-intensive. Each application demands appropriate selections of the network input space, the network structure, and values of learning algorithm parameters-design choices that are closely coupled in ways that largely remain a mystery. This EPRI-funded exploratory research project was initiated to take the key next step in this research program: the validation of the approach on a realistic problem. We focused on the problem of modeling the thermal performance of the TVA Sequoyah nuclear power plant (units 1 and 2)

  19. Resilience-based optimal design of water distribution network

    Science.gov (United States)

    Suribabu, C. R.

    2017-11-01

    Optimal design of water distribution network is generally aimed to minimize the capital cost of the investments on tanks, pipes, pumps, and other appurtenances. Minimizing the cost of pipes is usually considered as a prime objective as its proportion in capital cost of the water distribution system project is very high. However, minimizing the capital cost of the pipeline alone may result in economical network configuration, but it may not be a promising solution in terms of resilience point of view. Resilience of the water distribution network has been considered as one of the popular surrogate measures to address ability of network to withstand failure scenarios. To improve the resiliency of the network, the pipe network optimization can be performed with two objectives, namely minimizing the capital cost as first objective and maximizing resilience measure of the configuration as secondary objective. In the present work, these two objectives are combined as single objective and optimization problem is solved by differential evolution technique. The paper illustrates the procedure for normalizing the objective functions having distinct metrics. Two of the existing resilience indices and power efficiency are considered for optimal design of water distribution network. The proposed normalized objective function is found to be efficient under weighted method of handling multi-objective water distribution design problem. The numerical results of the design indicate the importance of sizing pipe telescopically along shortest path of flow to have enhanced resiliency indices.

  20. A probabilistic computational framework for bridge network optimal maintenance scheduling

    International Nuclear Information System (INIS)

    Bocchini, Paolo; Frangopol, Dan M.

    2011-01-01

    This paper presents a probabilistic computational framework for the Pareto optimization of the preventive maintenance applications to bridges of a highway transportation network. The bridge characteristics are represented by their uncertain reliability index profiles. The in/out of service states of the bridges are simulated taking into account their correlation structure. Multi-objective Genetic Algorithms have been chosen as numerical tool for the solution of the optimization problem. The design variables of the optimization are the preventive maintenance schedules of all the bridges of the network. The two conflicting objectives are the minimization of the total present maintenance cost and the maximization of the network performance indicator. The final result is the Pareto front of optimal solutions among which the managers should chose, depending on engineering and economical factors. A numerical example illustrates the application of the proposed approach.

  1. Optimal satisfaction degree in energy harvesting cognitive radio networks

    International Nuclear Information System (INIS)

    Li Zan; Liu Bo-Yang; Si Jiang-Bo; Zhou Fu-Hui

    2015-01-01

    A cognitive radio (CR) network with energy harvesting (EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model (HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree (WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user (SU) and the interference to the primary user (PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming (MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution (DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service (Qos). Numerical results are given to verify our analysis. (paper)

  2. Optimal satisfaction degree in energy harvesting cognitive radio networks

    Science.gov (United States)

    Li, Zan; Liu, Bo-Yang; Si, Jiang-Bo; Zhou, Fu-Hui

    2015-12-01

    A cognitive radio (CR) network with energy harvesting (EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model (HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree (WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user (SU) and the interference to the primary user (PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming (MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution (DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service (Qos). Numerical results are given to verify our analysis. Project supported by the National Natural Science Foundation of China (Grant No. 61301179), the Doctorial Programs Foundation of the Ministry of Education of China (Grant No. 20110203110011), and the 111 Project (Grant No. B08038).

  3. Optimal neural networks for protein-structure prediction

    International Nuclear Information System (INIS)

    Head-Gordon, T.; Stillinger, F.H.

    1993-01-01

    The successful application of neural-network algorithms for prediction of protein structure is stymied by three problem areas: the sparsity of the database of known protein structures, poorly devised network architectures which make the input-output mapping opaque, and a global optimization problem in the multiple-minima space of the network variables. We present a simplified polypeptide model residing in two dimensions with only two amino-acid types, A and B, which allows the determination of the global energy structure for all possible sequences of pentamer, hexamer, and heptamer lengths. This model simplicity allows us to compile a complete structural database and to devise neural networks that reproduce the tertiary structure of all sequences with absolute accuracy and with the smallest number of network variables. These optimal networks reveal that the three problem areas are convoluted, but that thoughtful network designs can actually deconvolute these detrimental traits to provide network algorithms that genuinely impact on the ability of the network to generalize or learn the desired mappings. Furthermore, the two-dimensional polypeptide model shows sufficient chemical complexity so that transfer of neural-network technology to more realistic three-dimensional proteins is evident

  4. Localization of multilayer networks by optimized single-layer rewiring.

    Science.gov (United States)

    Jalan, Sarika; Pradhan, Priodyuti

    2018-04-01

    We study localization properties of principal eigenvectors (PEVs) of multilayer networks (MNs). Starting with a multilayer network corresponding to a delocalized PEV, we rewire the network edges using an optimization technique such that the PEV of the rewired multilayer network becomes more localized. The framework allows us to scrutinize structural and spectral properties of the networks at various localization points during the rewiring process. We show that rewiring only one layer is enough to attain a MN having a highly localized PEV. Our investigation reveals that a single edge rewiring of the optimized MN can lead to the complete delocalization of a highly localized PEV. This sensitivity in the localization behavior of PEVs is accompanied with the second largest eigenvalue lying very close to the largest one. This observation opens an avenue to gain a deeper insight into the origin of PEV localization of networks. Furthermore, analysis of multilayer networks constructed using real-world social and biological data shows that the localization properties of these real-world multilayer networks are in good agreement with the simulation results for the model multilayer network. This paper is relevant to applications that require understanding propagation of perturbation in multilayer networks.

  5. Topological Effects and Performance Optimization in Transportation Continuous Network Design

    Directory of Open Access Journals (Sweden)

    Jianjun Wu

    2014-01-01

    Full Text Available Because of the limitation of budget, in the planning of road works, increased efforts should be made on links that are more critical to the whole traffic system. Therefore, it would be helpful to model and evaluate the vulnerability and reliability of the transportation network when the network design is processing. This paper proposes a bilevel transportation network design model, in which the upper level is to minimize the performance of the network under the given budgets, while the lower level is a typical user equilibrium assignment problem. A new solution approach based on particle swarm optimization (PSO method is presented. The topological effects on the performance of transportation networks are studied with the consideration of three typical networks, regular lattice, random graph, and small-world network. Numerical examples and simulations are presented to demonstrate the proposed model.

  6. Optimal control of epidemic information dissemination over networks.

    Science.gov (United States)

    Chen, Pin-Yu; Cheng, Shin-Ming; Chen, Kwang-Cheng

    2014-12-01

    Information dissemination control is of crucial importance to facilitate reliable and efficient data delivery, especially in networks consisting of time-varying links or heterogeneous links. Since the abstraction of information dissemination much resembles the spread of epidemics, epidemic models are utilized to characterize the collective dynamics of information dissemination over networks. From a systematic point of view, we aim to explore the optimal control policy for information dissemination given that the control capability is a function of its distribution time, which is a more realistic model in many applications. The main contributions of this paper are to provide an analytically tractable model for information dissemination over networks, to solve the optimal control signal distribution time for minimizing the accumulated network cost via dynamic programming, and to establish a parametric plug-in model for information dissemination control. In particular, we evaluate its performance in mobile and generalized social networks as typical examples.

  7. Optimization of deformation monitoring networks using finite element strain analysis

    Science.gov (United States)

    Alizadeh-Khameneh, M. Amin; Eshagh, Mehdi; Jensen, Anna B. O.

    2018-04-01

    An optimal design of a geodetic network can fulfill the requested precision and reliability of the network, and decrease the expenses of its execution by removing unnecessary observations. The role of an optimal design is highlighted in deformation monitoring network due to the repeatability of these networks. The core design problem is how to define precision and reliability criteria. This paper proposes a solution, where the precision criterion is defined based on the precision of deformation parameters, i. e. precision of strain and differential rotations. A strain analysis can be performed to obtain some information about the possible deformation of a deformable object. In this study, we split an area into a number of three-dimensional finite elements with the help of the Delaunay triangulation and performed the strain analysis on each element. According to the obtained precision of deformation parameters in each element, the precision criterion of displacement detection at each network point is then determined. The developed criterion is implemented to optimize the observations from the Global Positioning System (GPS) in Skåne monitoring network in Sweden. The network was established in 1989 and straddled the Tornquist zone, which is one of the most active faults in southern Sweden. The numerical results show that 17 out of all 21 possible GPS baseline observations are sufficient to detect minimum 3 mm displacement at each network point.

  8. Singularities in minimax optimization of networks

    DEFF Research Database (Denmark)

    Madsen, Kaj; Schjær-Jacobsen, Hans

    1976-01-01

    A theoretical treatment of singularities in nonlinear minimax optimization problems, which allows for a classification in regular and singular problems, is presented. A theorem for determining a singularity that is present in a given problem is formulated. A group of problems often used in the li......A theoretical treatment of singularities in nonlinear minimax optimization problems, which allows for a classification in regular and singular problems, is presented. A theorem for determining a singularity that is present in a given problem is formulated. A group of problems often used...

  9. Optimization of robustness of interdependent network controllability by redundant design.

    Directory of Open Access Journals (Sweden)

    Zenghu Zhang

    Full Text Available Controllability of complex networks has been a hot topic in recent years. Real networks regarded as interdependent networks are always coupled together by multiple networks. The cascading process of interdependent networks including interdependent failure and overload failure will destroy the robustness of controllability for the whole network. Therefore, the optimization of the robustness of interdependent network controllability is of great importance in the research area of complex networks. In this paper, based on the model of interdependent networks constructed first, we determine the cascading process under different proportions of node attacks. Then, the structural controllability of interdependent networks is measured by the minimum driver nodes. Furthermore, we propose a parameter which can be obtained by the structure and minimum driver set of interdependent networks under different proportions of node attacks and analyze the robustness for interdependent network controllability. Finally, we optimize the robustness of interdependent network controllability by redundant design including node backup and redundancy edge backup and improve the redundant design by proposing different strategies according to their cost. Comparative strategies of redundant design are conducted to find the best strategy. Results shows that node backup and redundancy edge backup can indeed decrease those nodes suffering from failure and improve the robustness of controllability. Considering the cost of redundant design, we should choose BBS (betweenness-based strategy or DBS (degree based strategy for node backup and HDF(high degree first for redundancy edge backup. Above all, our proposed strategies are feasible and effective at improving the robustness of interdependent network controllability.

  10. Speed Optimization in Liner Shipping Network Design

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Karsten, Christian Vad; Pisinger, David

    In the Liner Shipping Network Design Problem (LSNDP) services sail at a given speed throughout a round trip. In reality most services operate with a speed differentiated head- and back-haul, or even individual speeds on every sailing between two ports. The speed of a service is decisive...

  11. Optimizing Key Updates in Sensor Networks

    DEFF Research Database (Denmark)

    Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming

    2011-01-01

    Sensor networks offer the advantages of simple and low–resource communication. Nevertheless, security is of particular importance in many cases such as when sensitive data is communicated or tamper-resistance is required. Updating the security keys is one of the key points in security, which...

  12. Development of Phase Lock Loop System for Synchronisation of a ...

    African Journals Online (AJOL)

    Akorede

    KEYWORDS: Phase locked loop (PLL), grid synchronisation, simulations, PI regulator, hybrid system. .... system. AC. - D. C co nv erter. DC-DC converter. DC. - AC co nverter. Load ... The box named Discrete Transfer Fcn is the PI-regulator.

  13. Spatial prisoner's dilemma optimally played in small-world networks

    International Nuclear Information System (INIS)

    Masuda, Naoki; Aihara, Kazuyuki

    2003-01-01

    Cooperation is commonly found in ecological and social systems even when it apparently seems that individuals can benefit from selfish behavior. We investigate how cooperation emerges with the spatial prisoner's dilemma played in a class of networks ranging from regular lattices to random networks. We find that, among these networks, small-world topology is the optimal structure when we take into account the speed at which cooperative behavior propagates. Our results may explain why the small-world properties are self-organized in real networks

  14. Optimization of multicast optical networks with genetic algorithm

    Science.gov (United States)

    Lv, Bo; Mao, Xiangqiao; Zhang, Feng; Qin, Xi; Lu, Dan; Chen, Ming; Chen, Yong; Cao, Jihong; Jian, Shuisheng

    2007-11-01

    In this letter, aiming to obtain the best multicast performance of optical network in which the video conference information is carried by specified wavelength, we extend the solutions of matrix games with the network coding theory and devise a new method to solve the complex problems of multicast network switching. In addition, an experimental optical network has been testified with best switching strategies by employing the novel numerical solution designed with an effective way of genetic algorithm. The result shows that optimal solutions with genetic algorithm are accordance with the ones with the traditional fictitious play method.

  15. An Optimal Routing Algorithm in Service Customized 5G Networks

    Directory of Open Access Journals (Sweden)

    Haipeng Yao

    2016-01-01

    Full Text Available With the widespread use of Internet, the scale of mobile data traffic grows explosively, which makes 5G networks in cellular networks become a growing concern. Recently, the ideas related to future network, for example, Software Defined Networking (SDN, Content-Centric Networking (CCN, and Big Data, have drawn more and more attention. In this paper, we propose a service-customized 5G network architecture by introducing the ideas of separation between control plane and data plane, in-network caching, and Big Data processing and analysis to resolve the problems traditional cellular radio networks face. Moreover, we design an optimal routing algorithm for this architecture, which can minimize average response hops in the network. Simulation results reveal that, by introducing the cache, the network performance can be obviously improved in different network conditions compared to the scenario without a cache. In addition, we explore the change of cache hit rate and average response hops under different cache replacement policies, cache sizes, content popularity, and network topologies, respectively.

  16. LTE-Advanced Radio and Network Optimization

    DEFF Research Database (Denmark)

    Velez, Fernando J.; Sousa, Sofia; Flores, Jessica Acevedo

    2015-01-01

    In cellular optimization, the UL and DL the values from carrier-to-noise-plus-interference ratio (CNIR) from/at the mobile station are very important parameters. From a detailed analysis of its variation with the coverage and reuse distances for different values of the Channel Quality Indicator (...

  17. Optimal Sales Schemes for Network Goods

    DEFF Research Database (Denmark)

    Parakhonyak, Alexei; Vikander, Nick

    consumers simultaneously, serve them all sequentially, or employ any intermediate scheme. We show that the optimal sales scheme is purely sequential, where each consumer observes all previous sales before choosing whether to buy himself. A sequential scheme maximizes the amount of information available...

  18. Optimal Simulations by Butterfly Networks: Extended Abstract,

    Science.gov (United States)

    1987-11-01

    Typescript , Univ. of Massachusetts; submitted for nublication. 1_2.2 Ll, - W 12. ifliU 1.8 UI1.25 . l i I 61 MICROCOPY RESOLUTION TEST CHART NATIONAL...1987): An optimal mapping of the FFT algorithm onto the tlypercube architecture. Typescript , Univ. of Massachusetts; submitted for publication. (HR I

  19. A Stochastic Multiobjective Optimization Framework for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Shibo He

    2010-01-01

    Full Text Available In wireless sensor networks (WSNs, there generally exist many different objective functions to be optimized. In this paper, we propose a stochastic multiobjective optimization approach to solve such kind of problem. We first formulate a general multiobjective optimization problem. We then decompose the optimization formulation through Lagrange dual decomposition and adopt the stochastic quasigradient algorithm to solve the primal-dual problem in a distributed way. We show theoretically that our algorithm converges to the optimal solution of the primal problem by using the knowledge of stochastic programming. Furthermore, the formulation provides a general stochastic multiobjective optimization framework for WSNs. We illustrate how the general framework works by considering an example of the optimal rate allocation problem in multipath WSNs with time-varying channel. Extensive simulation results are given to demonstrate the effectiveness of our algorithm.

  20. Neural network for nonsmooth pseudoconvex optimization with general convex constraints.

    Science.gov (United States)

    Bian, Wei; Ma, Litao; Qin, Sitian; Xue, Xiaoping

    2018-05-01

    In this paper, a one-layer recurrent neural network is proposed for solving a class of nonsmooth, pseudoconvex optimization problems with general convex constraints. Based on the smoothing method, we construct a new regularization function, which does not depend on any information of the feasible region. Thanks to the special structure of the regularization function, we prove the global existence, uniqueness and "slow solution" character of the state of the proposed neural network. Moreover, the state solution of the proposed network is proved to be convergent to the feasible region in finite time and to the optimal solution set of the related optimization problem subsequently. In particular, the convergence of the state to an exact optimal solution is also considered in this paper. Numerical examples with simulation results are given to show the efficiency and good characteristics of the proposed network. In addition, some preliminary theoretical analysis and application of the proposed network for a wider class of dynamic portfolio optimization are included. Copyright © 2018 Elsevier Ltd. All rights reserved.

  1. Cascade-robustness optimization of coupling preference in interconnected networks

    International Nuclear Information System (INIS)

    Zhang, Xue-Jun; Xu, Guo-Qiang; Zhu, Yan-Bo; Xia, Yong-Xiang

    2016-01-01

    Highlights: • A specific memetic algorithm was proposed to optimize coupling links. • A small toy model was investigated to examine the underlying mechanism. • The MA optimized strategy exhibits a moderate assortative pattern. • A novel coupling coefficient index was proposed to quantify coupling preference. - Abstract: Recently, the robustness of interconnected networks has attracted extensive attentions, one of which is to investigate the influence of coupling preference. In this paper, the memetic algorithm (MA) is employed to optimize the coupling links of interconnected networks. Afterwards, a comparison is made between MA optimized coupling strategy and traditional assortative, disassortative and random coupling preferences. It is found that the MA optimized coupling strategy with a moderate assortative value shows an outstanding performance against cascading failures on both synthetic scale-free interconnected networks and real-world networks. We then provide an explanation for this phenomenon from a micro-scope point of view and propose a coupling coefficient index to quantify the coupling preference. Our work is helpful for the design of robust interconnected networks.

  2. Deterministic network interdiction optimization via an evolutionary approach

    International Nuclear Information System (INIS)

    Rocco S, Claudio M.; Ramirez-Marquez, Jose Emmanuel

    2009-01-01

    This paper introduces an evolutionary optimization approach that can be readily applied to solve deterministic network interdiction problems. The network interdiction problem solved considers the minimization of the maximum flow that can be transmitted between a source node and a sink node for a fixed network design when there is a limited amount of resources available to interdict network links. Furthermore, the model assumes that the nominal capacity of each network link and the cost associated with their interdiction can change from link to link. For this problem, the solution approach developed is based on three steps that use: (1) Monte Carlo simulation, to generate potential network interdiction strategies, (2) Ford-Fulkerson algorithm for maximum s-t flow, to analyze strategies' maximum source-sink flow and, (3) an evolutionary optimization technique to define, in probabilistic terms, how likely a link is to appear in the final interdiction strategy. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate the approach. In terms of computational effort, the results illustrate that solutions are obtained from a significantly restricted solution search space. Finally, the authors discuss the need for a reliability perspective to network interdiction, so that solutions developed address more realistic scenarios of such problem

  3. Applying neural networks to optimize instrumentation performance

    Energy Technology Data Exchange (ETDEWEB)

    Start, S.E.; Peters, G.G.

    1995-06-01

    Well calibrated instrumentation is essential in providing meaningful information about the status of a plant. Signals from plant instrumentation frequently have inherent non-linearities, may be affected by environmental conditions and can therefore cause calibration difficulties for the people who maintain them. Two neural network approaches are described in this paper for improving the accuracy of a non-linear, temperature sensitive level probe ised in Expermental Breeder Reactor II (EBR-II) that was difficult to calibrate.

  4. Applying neural networks to optimize instrumentation performance

    International Nuclear Information System (INIS)

    Start, S.E.; Peters, G.G.

    1995-01-01

    Well calibrated instrumentation is essential in providing meaningful information about the status of a plant. Signals from plant instrumentation frequently have inherent non-linearities, may be affected by environmental conditions and can therefore cause calibration difficulties for the people who maintain them. Two neural network approaches are described in this paper for improving the accuracy of a non-linear, temperature sensitive level probe ised in Expermental Breeder Reactor II (EBR-II) that was difficult to calibrate

  5. Robust Optimization of Fourth Party Logistics Network Design under Disruptions

    Directory of Open Access Journals (Sweden)

    Jia Li

    2015-01-01

    Full Text Available The Fourth Party Logistics (4PL network faces disruptions of various sorts under the dynamic and complex environment. In order to explore the robustness of the network, the 4PL network design with consideration of random disruptions is studied. The purpose of the research is to construct a 4PL network that can provide satisfactory service to customers at a lower cost when disruptions strike. Based on the definition of β-robustness, a robust optimization model of 4PL network design under disruptions is established. Based on the NP-hard characteristic of the problem, the artificial fish swarm algorithm (AFSA and the genetic algorithm (GA are developed. The effectiveness of the algorithms is tested and compared by simulation examples. By comparing the optimal solutions of the 4PL network for different robustness level, it is indicated that the robust optimization model can evade the market risks effectively and save the cost in the maximum limit when it is applied to 4PL network design.

  6. Optimal Quantum Spatial Search on Random Temporal Networks.

    Science.gov (United States)

    Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

    2017-12-01

    To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G(n,p), where p is the probability that any two given nodes are connected: After every time interval τ, a new graph G(n,p) replaces the previous one. We prove analytically that, for any given p, there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O(sqrt[n]), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

  7. Optimal Quantum Spatial Search on Random Temporal Networks

    Science.gov (United States)

    Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

    2017-12-01

    To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

  8. Optimization of stochastic discrete systems and control on complex networks computational networks

    CERN Document Server

    Lozovanu, Dmitrii

    2014-01-01

    This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic con...

  9. Optimizing Human Input in Social Network Analysis

    Science.gov (United States)

    2018-01-23

    7] T. L. Lai and H. Robbins, “Asymptotically efficient adaptive allocation rules,” Advances in applied mathematics , vol. 6, no. 1, pp. 4–22, 1985. [8...W. Whitt, “Heavy traffic limit theorems for queues: a survey,” in Mathematical Methods in Queueing Theory. Springer, 1974, pp. 307–350. [9] H...Regret lower bounds and optimal algorithms,” in Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer

  10. Optimal interdependence between networks for the evolution of cooperation.

    Science.gov (United States)

    Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

    2013-01-01

    Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality.

  11. District Heating Network Design and Configuration Optimization with Genetic Algorithm

    DEFF Research Database (Denmark)

    Li, Hongwei; Svendsen, Svend

    2011-01-01

    In this paper, the configuration of a district heating (DH) network which connects from the heating plant to the end users was optimized with emphasizing the network thermal performance. Each end user in the network represents a building block. The locations of the building blocks are fixed while...... the heating plant location is allowed to vary. The connection between the heat generation plant and the end users can be represented with mixed integer and the pipe friction and heat loss formulations are non-linear. In order to find the optimal DH distribution pipeline configuration, the genetic algorithm...... by multi factors as the consumer heating load, the distance between the heating plant to the consumer, the design criteria regarding pressure and temperature limitation, as well as the corresponding network heat loss....

  12. Optimal networks of future gravitational-wave telescopes

    Science.gov (United States)

    Raffai, Péter; Gondán, László; Heng, Ik Siong; Kelecsényi, Nándor; Logue, Josh; Márka, Zsuzsa; Márka, Szabolcs

    2013-08-01

    We aim to find the optimal site locations for a hypothetical network of 1-3 triangular gravitational-wave telescopes. We define the following N-telescope figures of merit (FoMs) and construct three corresponding metrics: (a) capability of reconstructing the signal polarization; (b) accuracy in source localization; and (c) accuracy in reconstructing the parameters of a standard binary source. We also define a combined metric that takes into account the three FoMs with practically equal weight. After constructing a geomap of possible telescope sites, we give the optimal 2-telescope networks for the four FoMs separately in example cases where the location of the first telescope has been predetermined. We found that based on the combined metric, placing the first telescope to Australia provides the most options for optimal site selection when extending the network with a second instrument. We suggest geographical regions where a potential second and third telescope could be placed to get optimal network performance in terms of our FoMs. Additionally, we use a similar approach to find the optimal location and orientation for the proposed LIGO-India detector within a five-detector network with Advanced LIGO (Hanford), Advanced LIGO (Livingston), Advanced Virgo, and KAGRA. We found that the FoMs do not change greatly in sites within India, though the network can suffer a significant loss in reconstructing signal polarizations if the orientation angle of an L-shaped LIGO-India is not set to the optimal value of ˜58.2°( + k × 90°) (measured counterclockwise from East to the bisector of the arms).

  13. Optimal networks of future gravitational-wave telescopes

    International Nuclear Information System (INIS)

    Raffai, Péter; Márka, Zsuzsa; Márka, Szabolcs; Gondán, László; Kelecsényi, Nándor; Heng, Ik Siong; Logue, Josh

    2013-01-01

    We aim to find the optimal site locations for a hypothetical network of 1–3 triangular gravitational-wave telescopes. We define the following N-telescope figures of merit (FoMs) and construct three corresponding metrics: (a) capability of reconstructing the signal polarization; (b) accuracy in source localization; and (c) accuracy in reconstructing the parameters of a standard binary source. We also define a combined metric that takes into account the three FoMs with practically equal weight. After constructing a geomap of possible telescope sites, we give the optimal 2-telescope networks for the four FoMs separately in example cases where the location of the first telescope has been predetermined. We found that based on the combined metric, placing the first telescope to Australia provides the most options for optimal site selection when extending the network with a second instrument. We suggest geographical regions where a potential second and third telescope could be placed to get optimal network performance in terms of our FoMs. Additionally, we use a similar approach to find the optimal location and orientation for the proposed LIGO-India detector within a five-detector network with Advanced LIGO (Hanford), Advanced LIGO (Livingston), Advanced Virgo, and KAGRA. We found that the FoMs do not change greatly in sites within India, though the network can suffer a significant loss in reconstructing signal polarizations if the orientation angle of an L-shaped LIGO-India is not set to the optimal value of ∼58.2°( + k × 90°) (measured counterclockwise from East to the bisector of the arms). (paper)

  14. Design and optimizing factors of PACS network architecture

    International Nuclear Information System (INIS)

    Tao Yonghao; Miao Jingtao

    2001-01-01

    Objective: Exploring the design and optimizing factors of picture archiving and communication system (PACS) network architecture. Methods: Based on the PACS of shanghai first hospital to performed the measurements and tests on the requirements of network bandwidth and transmitting rate for different PACS functions and procedures respectively in static and dynamic network traffic situation, utilizing the network monitoring tools which built-in workstations and provided by Windows NT. Results: No obvious difference between switch equipment and HUB when measurements and tests implemented in static situation except route which slow down the rate markedly. In dynamic environment Switch is able to provide higher bandwidth utilizing than HUB and local system scope communication achieved faster transmitting rate than global system. Conclusion: The primary optimizing factors of PACS network architecture design include concise network topology and disassemble tremendous global traffic to multiple distributed local scope network communication to reduce the traffic of network backbone. The most important issue is guarantee essential bandwidth for diagnosis procedure of medical imaging

  15. Multi-objective optimization in computer networks using metaheuristics

    CERN Document Server

    Donoso, Yezid

    2007-01-01

    Metaheuristics are widely used to solve important practical combinatorial optimization problems. Many new multicast applications emerging from the Internet-such as TV over the Internet, radio over the Internet, and multipoint video streaming-require reduced bandwidth consumption, end-to-end delay, and packet loss ratio. It is necessary to design and to provide for these kinds of applications as well as for those resources necessary for functionality. Multi-Objective Optimization in Computer Networks Using Metaheuristics provides a solution to the multi-objective problem in routing computer networks. It analyzes layer 3 (IP), layer 2 (MPLS), and layer 1 (GMPLS and wireless functions). In particular, it assesses basic optimization concepts, as well as several techniques and algorithms for the search of minimals; examines the basic multi-objective optimization concepts and the way to solve them through traditional techniques and through several metaheuristics; and demonstrates how to analytically model the compu...

  16. Cross-layer optimization of wireless multi-hop networks

    OpenAIRE

    Soldati, Pablo

    2007-01-01

    The interest in wireless communications has grown constantly for the past decades, leading to an enormous number of applications and services embraced by billions of users. In order to meet the increasing demand for mobile Internet access, several high data-rate radio networking technologies have been proposed to offer wide area high-speed wireless communications, eventually replacing fixed (wired) networks for many applications. This thesis considers cross-layer optimization of multi-hop rad...

  17. SEWER NETWORK DISCHARGE OPTIMIZATION USING THE DYNAMIC PROGRAMMING

    Directory of Open Access Journals (Sweden)

    Viorel MINZU

    2015-12-01

    Full Text Available It is necessary to adopt an optimal control that allows an efficient usage of the existing sewer networks, in order to avoid the building of new retention facilities. The main objective of the control action is to minimize the overflow volume of a sewer network. This paper proposes a method to apply a solution obtained by discrete dynamic programming through a realistic closed loop system.

  18. Influence maximization in complex networks through optimal percolation

    Science.gov (United States)

    Morone, Flaviano; Makse, Hernan; CUNY Collaboration; CUNY Collaboration

    The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. Reference: F. Morone, H. A. Makse, Nature 524,65-68 (2015)

  19. A framework for reactive optimization in mobile ad hoc networks

    DEFF Research Database (Denmark)

    McClary, Dan; Syrotiuk, Violet; Kulahci, Murat

    2008-01-01

    We present a framework to optimize the performance of a mobile ad hoc network over a wide range of operating conditions. It includes screening experiments to quantify the parameters and interactions among parameters influential to throughput. Profile-driven regression is applied to obtain a model....... The predictive accuracy of the model is monitored and used to update the model dynamically. The results indicate the framework may be useful for the optimization of dynamic systems of high dimension....

  20. Improved Differential Evolution Algorithm for Wireless Sensor Network Coverage Optimization

    Directory of Open Access Journals (Sweden)

    Xing Xu

    2014-04-01

    Full Text Available In order to serve for the ecological monitoring efficiency of Poyang Lake, an improved hybrid algorithm, mixed with differential evolution and particle swarm optimization, is proposed and applied to optimize the coverage problem of wireless sensor network. And then, the affect of the population size and the number of iterations on the coverage performance are both discussed and analyzed. The four kinds of statistical results about the coverage rate are obtained through lots of simulation experiments.

  1. A Global Network Alignment Method Using Discrete Particle Swarm Optimization.

    Science.gov (United States)

    Huang, Jiaxiang; Gong, Maoguo; Ma, Lijia

    2016-10-19

    Molecular interactions data increase exponentially with the advance of biotechnology. This makes it possible and necessary to comparatively analyse the different data at a network level. Global network alignment is an important network comparison approach to identify conserved subnetworks and get insight into evolutionary relationship across species. Network alignment which is analogous to subgraph isomorphism is known to be an NP-hard problem. In this paper, we introduce a novel heuristic Particle-Swarm-Optimization based Network Aligner (PSONA), which optimizes a weighted global alignment model considering both protein sequence similarity and interaction conservations. The particle statuses and status updating rules are redefined in a discrete form by using permutation. A seed-and-extend strategy is employed to guide the searching for the superior alignment. The proposed initialization method "seeds" matches with high sequence similarity into the alignment, which guarantees the functional coherence of the mapping nodes. A greedy local search method is designed as the "extension" procedure to iteratively optimize the edge conservations. PSONA is compared with several state-of-art methods on ten network pairs combined by five species. The experimental results demonstrate that the proposed aligner can map the proteins with high functional coherence and can be used as a booster to effectively refine the well-studied aligners.

  2. Distributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks.

    Directory of Open Access Journals (Sweden)

    J. Trdlicka

    2010-12-01

    Full Text Available This work proposes a distributed algorithm for energy optimal routing in a wireless sensor network. The routing problem is described as a mathematical problem by the minimum-cost multi-commodity network flow problem. Due to the separability of the problem, we use the duality theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or knowledge of the whole network structure. Each node only needs to know the flow which is supposed to send or receive and the costs and capacities of the neighboring links. An evaluation of the presented algorithm on benchmarks for the energy optimal data flow routing in sensor networks with up to 100 nodes is presented.

  3. International Synchronisation of the Pork Cycle

    Directory of Open Access Journals (Sweden)

    HOLST

    2012-02-01

    Full Text Available The development of pork prices has been analysed since the 1920s. Well known economic concepts such as Hanaus pork cycle or Ezekiels cobweb theorem are based on the empirical analysis of pork markets. We analyze whether pork price developments in different countries have become more synchronised over time. In a first stage of our analysis, annual pork price data collected by the FAO reveals much heterogeneity of pork price developments across countries. However, for some groups of countries the observed price patterns are very similar or even identical. This is especially the case for neighbouring countries with integrated pork markets, such as the members of the European Union (EU. We then compare pork price developments in Germany and the USA based on 36 years of monthly producer prices for slaughter pigs. Since the middle of the 1990s cyclical pork price movements in the USA and Germany have become increasingly synchronous. We attribute this to two developments: the fact that the USA has become a large net exporter of pork over this period, and policy reform in the EU that has strengthened the link between international and EU feed prices.

  4. Service network design of bike sharing systems analysis and optimization

    CERN Document Server

    Vogel, Patrick

    2016-01-01

    This monograph presents a tactical planning approach for service network design in metropolitan areas. Designing the service network requires the suitable aggregation of demand data as well as the anticipation of operational relocation decisions. To this end, an integrated approach of data analysis and mathematical optimization is introduced. The book also includes a case study based on real-world data to demonstrate the benefit of the proposed service network design approach. The target audience comprises primarily research experts in the field of traffic engineering, but the book may also be beneficial for graduate students.

  5. An Evolutionary Optimization Framework for Neural Networks and Neuromorphic Architectures

    Energy Technology Data Exchange (ETDEWEB)

    Schuman, Catherine D [ORNL; Plank, James [University of Tennessee (UT); Disney, Adam [University of Tennessee (UT); Reynolds, John [University of Tennessee (UT)

    2016-01-01

    As new neural network and neuromorphic architectures are being developed, new training methods that operate within the constraints of the new architectures are required. Evolutionary optimization (EO) is a convenient training method for new architectures. In this work, we review a spiking neural network architecture and a neuromorphic architecture, and we describe an EO training framework for these architectures. We present the results of this training framework on four classification data sets and compare those results to other neural network and neuromorphic implementations. We also discuss how this EO framework may be extended to other architectures.

  6. 5G heterogeneous networks self-organizing and optimization

    CERN Document Server

    Rong, Bo; Kadoch, Michel; Sun, Songlin; Li, Wenjing

    2016-01-01

    This SpringerBrief provides state-of-the-art technical reviews on self-organizing and optimization in 5G systems. It covers the latest research results from physical-layer channel modeling to software defined network (SDN) architecture. This book focuses on the cutting-edge wireless technologies such as heterogeneous networks (HetNets), self-organizing network (SON), smart low power node (LPN), 3D-MIMO, and more. It will help researchers from both the academic and industrial worlds to better understand the technical momentum of 5G key technologies.

  7. An Improved Method for Reconfiguring and Optimizing Electrical Active Distribution Network Using Evolutionary Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Nur Faziera Napis

    2018-05-01

    Full Text Available The presence of optimized distributed generation (DG with suitable distribution network reconfiguration (DNR in the electrical distribution network has an advantage for voltage support, power losses reduction, deferment of new transmission line and distribution structure and system stability improvement. However, installation of a DG unit at non-optimal size with non-optimal DNR may lead to higher power losses, power quality problem, voltage instability and incremental of operational cost. Thus, an appropriate DG and DNR planning are essential and are considered as an objective of this research. An effective heuristic optimization technique named as improved evolutionary particle swarm optimization (IEPSO is proposed in this research. The objective function is formulated to minimize the total power losses (TPL and to improve the voltage stability index (VSI. The voltage stability index is determined for three load demand levels namely light load, nominal load, and heavy load with proper optimal DNR and DG sizing. The performance of the proposed technique is compared with other optimization techniques, namely particle swarm optimization (PSO and iteration particle swarm optimization (IPSO. Four case studies on IEEE 33-bus and IEEE 69-bus distribution systems have been conducted to validate the effectiveness of the proposed IEPSO. The optimization results show that, the best achievement is done by IEPSO technique with power losses reduction up to 79.26%, and 58.41% improvement in the voltage stability index. Moreover, IEPSO has the fastest computational time for all load conditions as compared to other algorithms.

  8. A multiobjective optimization framework for multicontaminant industrial water network design.

    Science.gov (United States)

    Boix, Marianne; Montastruc, Ludovic; Pibouleau, Luc; Azzaro-Pantel, Catherine; Domenech, Serge

    2011-07-01

    The optimal design of multicontaminant industrial water networks according to several objectives is carried out in this paper. The general formulation of the water allocation problem (WAP) is given as a set of nonlinear equations with binary variables representing the presence of interconnections in the network. For optimization purposes, three antagonist objectives are considered: F(1), the freshwater flow-rate at the network entrance, F(2), the water flow-rate at inlet of regeneration units, and F(3), the number of interconnections in the network. The multiobjective problem is solved via a lexicographic strategy, where a mixed-integer nonlinear programming (MINLP) procedure is used at each step. The approach is illustrated by a numerical example taken from the literature involving five processes, one regeneration unit and three contaminants. The set of potential network solutions is provided in the form of a Pareto front. Finally, the strategy for choosing the best network solution among those given by Pareto fronts is presented. This Multiple Criteria Decision Making (MCDM) problem is tackled by means of two approaches: a classical TOPSIS analysis is first implemented and then an innovative strategy based on the global equivalent cost (GEC) in freshwater that turns out to be more efficient for choosing a good network according to a practical point of view. Copyright © 2011 Elsevier Ltd. All rights reserved.

  9. Distributed Optimization of Multi Beam Directional Communication Networks

    Science.gov (United States)

    2017-06-30

    Distributed Optimization of Multi-Beam Directional Communication Networks Theodoros Tsiligkaridis MIT Lincoln Laboratory Lexington, MA 02141, USA...based routing. I. INTRODUCTION Missions where multiple communication goals are of in- terest are becoming more prevalent in military applications...Multilayer communications may occur within a coalition; for example, a team consisting of ground vehicles and an airborne set of assets may desire to

  10. Optimization of composite panels using neural networks and genetic algorithms

    NARCIS (Netherlands)

    Ruijter, W.; Spallino, R.; Warnet, Laurent; de Boer, Andries

    2003-01-01

    The objective of this paper is to present first results of a running study on optimization of aircraft components (composite panels of a typical vertical tail plane) by using Genetic Algorithms (GA) and Neural Networks (NN). The panels considered are standardized to some extent but still there is a

  11. Optimizing Knowledge Sharing in Learning Networks through Peer Tutoring

    NARCIS (Netherlands)

    Hsiao, Amy; Brouns, Francis; Kester, Liesbeth; Sloep, Peter

    2009-01-01

    Hsiao, Y. P., Brouns, F., Kester, L., & Sloep, P. (2009). Optimizing Knowledge Sharing in Learning Networks through Peer Tutoring. Presentation at the IADIS international conference on Cognition and Exploratory in Digital Age (CELDA 2009). November, 20-22, 2009, Rome, Italy.

  12. Optimizing Knowledge Sharing In Learning Networks Through Peer Tutoring

    NARCIS (Netherlands)

    Hsiao, Amy; Brouns, Francis; Kester, Liesbeth; Sloep, Peter

    2009-01-01

    Hsiao, Y. P., Brouns, F., Kester, L., & Sloep, P. B. (2009). Optimizing Knowledge Sharing In Learning Networks Through Peer Tutoring. In D. Kinshuk, J. Sampson, J. Spector, P. Isaías, P. Barbosa & D. Ifenthaler (Eds.). Proceedings of IADIS International Conference Cognition and Exploratory Learning

  13. Optimal resource allocation in downlink CDMA wireless networks

    NARCIS (Netherlands)

    Endrayanto, A.I.

    2013-01-01

    This thesis presents a full analytical characterization of the optimal joint downlink rate and power assignment for maximal total system throughput in a multi cell CDMA network. In Chapter 2, we analyze the feasibility of downlink power assignment in a linear model of two CDMA cell, under the

  14. Optimization of Gas Flow Network using the Traveling Salesman ...

    African Journals Online (AJOL)

    The overall goal of this paper is to develop a general formulation for an optimal infrastructure layout design of gas pipeline distribution networks using algorithm developed from the application of two industrial engineering concepts: the traveling salesman problem (TSP) and the nearest neighbor (NN). The focus is on the ...

  15. On Optimal Geographical Caching in Heterogeneous Cellular Networks

    NARCIS (Netherlands)

    Serbetci, Berksan; Goseling, Jasper

    2017-01-01

    In this work we investigate optimal geographical caching in heterogeneous cellular networks where different types of base stations (BSs) have different cache capacities. Users request files from a content library according to a known probability distribution. The performance metric is the total hit

  16. Multi-Objective Design Of Optimal Greenhouse Gas Observation Networks

    Science.gov (United States)

    Lucas, D. D.; Bergmann, D. J.; Cameron-Smith, P. J.; Gard, E.; Guilderson, T. P.; Rotman, D.; Stolaroff, J. K.

    2010-12-01

    One of the primary scientific functions of a Greenhouse Gas Information System (GHGIS) is to infer GHG source emission rates and their uncertainties by combining measurements from an observational network with atmospheric transport modeling. Certain features of the observational networks that serve as inputs to a GHGIS --for example, sampling location and frequency-- can greatly impact the accuracy of the retrieved GHG emissions. Observation System Simulation Experiments (OSSEs) provide a framework to characterize emission uncertainties associated with a given network configuration. By minimizing these uncertainties, OSSEs can be used to determine optimal sampling strategies. Designing a real-world GHGIS observing network, however, will involve multiple, conflicting objectives; there will be trade-offs between sampling density, coverage and measurement costs. To address these issues, we have added multi-objective optimization capabilities to OSSEs. We demonstrate these capabilities by quantifying the trade-offs between retrieval error and measurement costs for a prototype GHGIS, and deriving GHG observing networks that are Pareto optimal. [LLNL-ABS-452333: This work performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.

  17. Optimal scheduling for distribution network with redox flow battery storage

    International Nuclear Information System (INIS)

    Hosseina, Majid; Bathaee, Seyed Mohammad Taghi

    2016-01-01

    Highlights: • A novel method for optimal scheduling of storages in radial network is presented. • Peak shaving and load leveling are the main objectives. • Vanadium redox flow battery is considered as the energy storage unit. • Real data is used for simulation. - Abstract: There are many advantages to utilize storages in electric power system. Peak shaving, load leveling, load frequency control, integration of renewable, energy trading and spinning reserve are the most important of them. Batteries, especially redox flow batteries, are one of the appropriate storages for utilization in distribution network. This paper presents a novel, heuristic and practical method for optimal scheduling in distribution network with flow battery storage. This heuristic method is more suitable for scheduling and operation of distribution networks which require installation of storages. Peak shaving and load leveling is considered as the main objective in this paper. Several indices are presented in this paper for determine the place of storages and also scheduling for optimal use of energy in them. Simulations of this paper are based on real information of distribution network substation that located in Semnan, Iran.

  18. Optimal Intermittent Operation of Water Distribution Networks under Water Shortage

    Directory of Open Access Journals (Sweden)

    mohamad Solgi

    2017-07-01

    Full Text Available Under water shortage conditions, it is necessary to exercise water consumption management practices in water distribution networks (WDN. Intermittent supply of water is one such practice that makes it possible to supply consumption nodal demands with the required pressure via water cutoff to some consumers during certain hours of the day. One of the most important issues that must be observed in this management practice is the equitable and uniform water distribution among the consumers. In the present study, uniformity in water distribution and minimum supply of water to all consumers are defined as justice and equity, respectively. Also, an optimization model has been developed to find an optimal intermittent supply schedule that ensures maximum number of demand nodes are supplied with water while the constraints on the operation of water distribution networks are also observed. To show the efficiency of the proposed model, it has been used in the Two-Loop distribution network under several different scenarios of water shortage. The optimization model has been solved using the honey bee mating optimization algorithm (HBMO linked to the hydraulic simulator EPANET. The results obtained confirm the efficiency of the proposed model in achieving an optimal intermittent supply schedule. Moreover, the model is found capable of distributing the available water in an equitable and just manner among all the consumers even under severe water shoratges.

  19. Synchrony-optimized networks of non-identical Kuramoto oscillators

    International Nuclear Information System (INIS)

    Brede, Markus

    2008-01-01

    In this Letter we discuss a method for generating synchrony-optimized coupling architectures of Kuramoto oscillators with a heterogeneous distribution of native frequencies. The method allows us to relate the properties of the coupling network to its synchronizability. These relations were previously only established from a linear stability analysis of the identical oscillator case. We further demonstrate that the heterogeneity in the oscillator population produces heterogeneity in the optimal coupling network as well. Two rules for enhancing the synchronizability of a given network by a suitable placement of oscillators are given: (i) native frequencies of adjacent oscillators must be anti-correlated and (ii) frequency magnitudes should positively correlate with the degree of the node they are placed at

  20. On Optimal Policies for Network-Coded Cooperation

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman

    2015-01-01

    Network-coded cooperative communication (NC-CC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next-generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NC-CC scenarios...... rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers, and half-duplex erasure channels. The problem is modeled...... as a special case of Markov decision process (MDP), which is called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot, and we use...

  1. Optimizing Cellular Networks Enabled with Renewal Energy via Strategic Learning.

    Science.gov (United States)

    Sohn, Insoo; Liu, Huaping; Ansari, Nirwan

    2015-01-01

    An important issue in the cellular industry is the rising energy cost and carbon footprint due to the rapid expansion of the cellular infrastructure. Greening cellular networks has thus attracted attention. Among the promising green cellular network techniques, the renewable energy-powered cellular network has drawn increasing attention as a critical element towards reducing carbon emissions due to massive energy consumption in the base stations deployed in cellular networks. Game theory is a branch of mathematics that is used to evaluate and optimize systems with multiple players with conflicting objectives and has been successfully used to solve various problems in cellular networks. In this paper, we model the green energy utilization and power consumption optimization problem of a green cellular network as a pilot power selection strategic game and propose a novel distributed algorithm based on a strategic learning method. The simulation results indicate that the proposed algorithm achieves correlated equilibrium of the pilot power selection game, resulting in optimum green energy utilization and power consumption reduction.

  2. Management and optimization of the CPCU network working

    Energy Technology Data Exchange (ETDEWEB)

    Silvain, D. (Compagnie Parisienne de Chauffage Urbain, 75 - Paris (FR))

    1991-10-01

    The CPCU steam distribution network is supplemented by a return network for the condensation water. The data system installed in 1988 provides, for the real time, management of the function of the two networks and a reduction in production costs. For the steam, data required in the network, the boiler houses and from external sources are processed by local network of five microprocessors and permit: - with time delay: technical and economic production optimizing calculations, or forecasts, for the following day, of the total required output and the procedure necessary for supplying this at the lowest cost; - in real time: on the basis of the forecasts for the previous day, creating the production instructions for the boiler houses and the instructions for the network remote control elements; - in case of an unexpected occurrence: immediate creation of new operating forecasts for the boiler houses for the establishing management data in real time. For the water, the system forecasts the volume to be returned to the boiler depending on the quantity of steam to be produced. Subsequently, an analysis is carried out in real time of pressures and outputs measured in the network for deriving valve movements and the pump stop/start procedure for guaranteeing the return of the water. The architecture, basic principles and software developed for this application can be used in other steam or water networks and, in a general manner, are adaptable for the management of any complex multi-supplier or multicustomer systems.

  3. An Optimal Path Computation Architecture for the Cloud-Network on Software-Defined Networking

    Directory of Open Access Journals (Sweden)

    Hyunhun Cho

    2015-05-01

    Full Text Available Legacy networks do not open the precise information of the network domain because of scalability, management and commercial reasons, and it is very hard to compute an optimal path to the destination. According to today’s ICT environment change, in order to meet the new network requirements, the concept of software-defined networking (SDN has been developed as a technological alternative to overcome the limitations of the legacy network structure and to introduce innovative concepts. The purpose of this paper is to propose the application that calculates the optimal paths for general data transmission and real-time audio/video transmission, which consist of the major services of the National Research & Education Network (NREN in the SDN environment. The proposed SDN routing computation (SRC application is designed and applied in a multi-domain network for the efficient use of resources, selection of the optimal path between the multi-domains and optimal establishment of end-to-end connections.

  4. A combined geostatistical-optimization model for the optimal design of a groundwater quality monitoring network

    Science.gov (United States)

    Kolosionis, Konstantinos; Papadopoulou, Maria P.

    2017-04-01

    Monitoring networks provide essential information for water resources management especially in areas with significant groundwater exploitation due to extensive agricultural activities. In this work, a simulation-optimization framework is developed based on heuristic optimization methodologies and geostatistical modeling approaches to obtain an optimal design for a groundwater quality monitoring network. Groundwater quantity and quality data obtained from 43 existing observation locations at 3 different hydrological periods in Mires basin in Crete, Greece will be used in the proposed framework in terms of Regression Kriging to develop the spatial distribution of nitrates concentration in the aquifer of interest. Based on the existing groundwater quality mapping, the proposed optimization tool will determine a cost-effective observation wells network that contributes significant information to water managers and authorities. The elimination of observation wells that add little or no beneficial information to groundwater level and quality mapping of the area can be obtain using estimations uncertainty and statistical error metrics without effecting the assessment of the groundwater quality. Given the high maintenance cost of groundwater monitoring networks, the proposed tool could used by water regulators in the decision-making process to obtain a efficient network design that is essential.

  5. Optimal knockout strategies in genome-scale metabolic networks using particle swarm optimization.

    Science.gov (United States)

    Nair, Govind; Jungreuthmayer, Christian; Zanghellini, Jürgen

    2017-02-01

    Knockout strategies, particularly the concept of constrained minimal cut sets (cMCSs), are an important part of the arsenal of tools used in manipulating metabolic networks. Given a specific design, cMCSs can be calculated even in genome-scale networks. We would however like to find not only the optimal intervention strategy for a given design but the best possible design too. Our solution (PSOMCS) is to use particle swarm optimization (PSO) along with the direct calculation of cMCSs from the stoichiometric matrix to obtain optimal designs satisfying multiple objectives. To illustrate the working of PSOMCS, we apply it to a toy network. Next we show its superiority by comparing its performance against other comparable methods on a medium sized E. coli core metabolic network. PSOMCS not only finds solutions comparable to previously published results but also it is orders of magnitude faster. Finally, we use PSOMCS to predict knockouts satisfying multiple objectives in a genome-scale metabolic model of E. coli and compare it with OptKnock and RobustKnock. PSOMCS finds competitive knockout strategies and designs compared to other current methods and is in some cases significantly faster. It can be used in identifying knockouts which will force optimal desired behaviors in large and genome scale metabolic networks. It will be even more useful as larger metabolic models of industrially relevant organisms become available.

  6. A Spectrum Handoff Scheme for Optimal Network Selection in NEMO Based Cognitive Radio Vehicular Networks

    Directory of Open Access Journals (Sweden)

    Krishan Kumar

    2017-01-01

    Full Text Available When a mobile network changes its point of attachments in Cognitive Radio (CR vehicular networks, the Mobile Router (MR requires spectrum handoff. Network Mobility (NEMO in CR vehicular networks is concerned with the management of this movement. In future NEMO based CR vehicular networks deployment, multiple radio access networks may coexist in the overlapping areas having different characteristics in terms of multiple attributes. The CR vehicular node may have the capability to make call for two or more types of nonsafety services such as voice, video, and best effort simultaneously. Hence, it becomes difficult for MR to select optimal network for the spectrum handoff. This can be done by performing spectrum handoff using Multiple Attributes Decision Making (MADM methods which is the objective of the paper. The MADM methods such as grey relational analysis and cost based methods are used. The application of MADM methods provides wider and optimum choice among the available networks with quality of service. Numerical results reveal that the proposed scheme is effective for spectrum handoff decision for optimal network selection with reduced complexity in NEMO based CR vehicular networks.

  7. OPTIMAL CONFIGURATION OF A COMMAND AND CONTROL NETWORK: BALANCING PERFORMANCE AND RECONFIGURATION CONSTRAINTS

    Energy Technology Data Exchange (ETDEWEB)

    L. DOWELL

    1999-08-01

    The optimization of the configuration of communications and control networks is important for assuring the reliability and performance of the networks. This paper presents techniques for determining the optimal configuration for such a network in the presence of communication and connectivity constraints. reconfiguration to restore connectivity to a data-fusion network following the failure of a network component.

  8. Competitive game theoretic optimal routing in optical networks

    Science.gov (United States)

    Yassine, Abdulsalam; Kabranov, Ognian; Makrakis, Dimitrios

    2002-09-01

    Optical transport service providers need control and optimization strategies for wavelength management, network provisioning, restoration and protection, allowing them to define and deploy new services and maintain competitiveness. In this paper, we investigate a game theory based model for wavelength and flow assignment in multi wavelength optical networks, consisting of several backbone long-haul optical network transport service providers (TSPs) who are offering their services -in terms of bandwidth- to Internet service providers (ISPs). The ISPs act as brokers or agents between the TSP and end user. The agent (ISP) buys services (bandwidth) from the TSP. The TSPs compete among themselves to sell their services and maintain profitability. We present a case study, demonstrating the impact of different bandwidth broker demands on the supplier's profit and the price paid by the network broker.

  9. Optimizing bulk data transfers using network measurements: A practical case

    International Nuclear Information System (INIS)

    Ciuffoletti, A; Merola, L; Palmieri, F; Russo, G; Pardi, S

    2010-01-01

    In modern Data Grid infrastructures, we increasingly face the problem of providing the running applications with fast and reliable access to large data volumes, often geographically distributed across the network. As a direct consequence, the concept of replication has been adopted by the grid community to increase data availability and maximize job throughput. To be really effective, such process has to be driven by specific optimization strategies that define when and where replicas should be created or deleted on a per-site basis, and which replicas a job should use. These strategies have to take into account the available network bandwidth as a primary resource, prior to any consideration about storage or processing power. We present a novel replica management service, integrated within the Gluedomains active network monitoring architecture, designed and implemented within the centralized collective middleware framework of the SCoPE project to provide network-aware transfer services for data intensive Grid applications.

  10. Optimal Sensor Networks Scheduling in Identification of Distributed Parameter Systems

    CERN Document Server

    Patan, Maciej

    2012-01-01

    Sensor networks have recently come into prominence because they hold the potential to revolutionize a wide spectrum of both civilian and military applications. An ingenious characteristic of sensor networks is the distributed nature of data acquisition. Therefore they seem to be ideally prepared for the task of monitoring processes with spatio-temporal dynamics which constitute one of most general and important classes of systems in modelling of the real-world phenomena. It is clear that careful deployment and activation of sensor nodes are critical for collecting the most valuable information from the observed environment. Optimal Sensor Network Scheduling in Identification of Distributed Parameter Systems discusses the characteristic features of the sensor scheduling problem, analyzes classical and recent approaches, and proposes a wide range of original solutions, especially dedicated for networks with mobile and scanning nodes. Both researchers and practitioners will find the case studies, the proposed al...

  11. Synchronisation of two separate zones in a standalone microgrid

    Directory of Open Access Journals (Sweden)

    Ying-Yi Hong

    2017-06-01

    Full Text Available Standalone microgrids that comprise distributed generation sources (DGSs or energy storage systems (ESSs exist on off-shore islands or remote areas. When a fault occurs in a standalone microgrid, the microgrid is separated into several zones with pre-specified DGS or ESS supplying power to local loads. After the fault is cleared, the three-phase voltages and frequencies may differ among these zones. To restore the original microgrid topology, these zones must be reconnected to each other by synchronisation. A synchronisation controller of the DGS/ESS that accounts for slightly different three-phase voltages and frequencies in two separate zones is presented. The Clark transform and Mamdani fuzzy rules are used to implement the controller, providing fast and seamless synchronisation. Simulation results using a standalone microgrid show the practical applicability of the proposed method.

  12. Impulsive synchronisation of a class of fractional-order hyperchaotic systems

    International Nuclear Information System (INIS)

    Wang Xing-Yuan; Zhang Yong-Lei; Lin Da; Zhang Na

    2011-01-01

    In this paper, an impulsive synchronisation scheme for a class of fractional-order hyperchaotic systems is proposed. The sufficient conditions of a class of integral-order hyperchaotic systems' impulsive synchronisation are illustrated. Furthermore, we apply the sufficient conditions to a class of fractional-order hyperchaotic systems and well achieve impulsive synchronisation of these fractional-order hyperchaotic systems, thereby extending the applicable scope of impulsive synchronisation. Numerical simulations further demonstrate the feasibility and effectiveness of the proposed scheme. (general)

  13. Optimal Operation of Interdependent Power Systems and Electrified Transportation Networks

    Directory of Open Access Journals (Sweden)

    M. Hadi Amini

    2018-01-01

    Full Text Available Electrified transportation and power systems are mutually coupled networks. In this paper, a novel framework is developed for interdependent power and transportation networks. Our approach constitutes solving an iterative least cost vehicle routing process, which utilizes the communication of electrified vehicles (EVs with competing charging stations, to exchange data such as electricity price, energy demand, and time of arrival. The EV routing problem is solved to minimize the total cost of travel using the Dijkstra algorithm with the input from EVs battery management system, electricity price from charging stations, powertrain component efficiencies and transportation network traffic conditions. Through the bidirectional communication of EVs with competing charging stations, EVs’ charging demand estimation is done much more accurately. Then the optimal power flow problem is solved for the power system, to find the locational marginal price at load buses where charging stations are connected. Finally, the electricity prices were communicated from the charging stations to the EVs, and the loop is closed. Locational electricity price acts as the shared parameter between the two optimization problems, i.e., optimal power flow and optimal routing problem. Electricity price depends on the power demand, which is affected by the charging of EVs. On the other hand, location of EV charging stations and their different pricing strategies might affect the routing decisions of the EVs. Our novel approach that combines the electrified transportation with power system operation, holds tremendous potential for solving electrified transportation issues and reducing energy costs. The effectiveness of the proposed approach is demonstrated using Shanghai transportation network and IEEE 9-bus test system. The results verify the cost-savings for both power system and transportation networks.

  14. Energy network dispatch optimization under emergency of local energy shortage

    International Nuclear Information System (INIS)

    Cai, Tianxing; Zhao, Chuanyu; Xu, Qiang

    2012-01-01

    The consequence of short-time energy shortage under extreme conditions, such as earthquake, tsunami, and hurricane, may cause local areas to suffer from delayed rescues, widespread power outages, tremendous economic losses, and even public safety threats. In such urgent events of local energy shortage, agile energy dispatching through an effective energy transportation network, targeting the minimum energy recovery time, should be a top priority. In this paper, a novel methodology is developed for energy network dispatch optimization under emergency of local energy shortage, which includes four stages of work. First, emergency-area-centered energy network needs to be characterized, where the capacity, quantity, and availability of various energy sources are determined. Second, the energy initial situation under emergency conditions needs to be identified. Then, the energy dispatch optimization is conducted based on a developed MILP (mixed-integer linear programming) model in the third stage. Finally, the sensitivity of the minimum dispatch time with respect to uncertainty parameters is characterized by partitioning the entire space of uncertainty parameters into multiple subspaces. The efficacy of the developed methodology is demonstrated via a case study with in-depth discussions. -- Highlights: ► Address the energy network dispatch problem under emergency of local energy shortage. ► Minimize the energy restoration time for the entire energy network under emergency events. ► Develop a new MILP model and a sensitivity analysis method with respect to uncertainties.

  15. A model of guarded recursion with clock synchronisation

    DEFF Research Database (Denmark)

    Bizjak, Aleš; Møgelberg, Rasmus Ejlers

    2015-01-01

    productivity to be captured in types. The calculus uses clocks representing time streams and clock quantifiers which allow limited and controlled elimination of modalities. The calculus has since been extended to dependent types by Møgelberg. Both works give denotational semantics but no rewrite semantics....... In previous versions of this calculus, different clocks represented separate time streams and clock synchronisation was prohibited. In this paper we show that allowing clock synchronisation is safe by constructing a new model of guarded recursion and clocks. This result will greatly simplify the type theory...... by removing freshness restrictions from typing rules, and is a necessary step towards defining rewrite semantics, and ultimately implementing the calculus....

  16. CERNBox: Petabyte-Scale Cloud Synchronisation and Sharing Platform

    OpenAIRE

    Hugo González Labrador

    2016-01-01

    CERNBox is a cloud synchronisation service for end-users: it allows syncing and sharing files on all major mobile and desktop platforms (Linux, Windows, MacOSX, Android, iOS) aiming to provide offline availability to any data stored in the CERN EOS infrastructure. There is a high demand in the community for an easily accessible cloud storage solution such as CERNBox. Integration of the CERNBox service with the EOS storage back-end is the next step towards providing ’synchronisation and sharin...

  17. Secure digital communication using controlled projective synchronisation of chaos

    International Nuclear Information System (INIS)

    Chee, C.Y.; Xu Daolin

    2005-01-01

    A new approach to chaos communication is proposed to encrypt digital information using controlled projective synchronisation. The scheme encrypts a binary sequence by manipulating the scaling feature of synchronisation from the coupled system. The transmitted signal therefore embeds only a single set of statistical properties. This prevents cryptanalysts from breaking the chaotic encryption scheme by using characteristic cryptanalysis that aims to detect switching of statistical properties in the intercepted information carrier signal. Pseudo-random switching key is incorporated into the scheme to masked out the deterministic nature of the underlying coupled system

  18. Optimizing Markovian modeling of chaotic systems with recurrent neural networks

    International Nuclear Information System (INIS)

    Cechin, Adelmo L.; Pechmann, Denise R.; Oliveira, Luiz P.L. de

    2008-01-01

    In this paper, we propose a methodology for optimizing the modeling of an one-dimensional chaotic time series with a Markov Chain. The model is extracted from a recurrent neural network trained for the attractor reconstructed from the data set. Each state of the obtained Markov Chain is a region of the reconstructed state space where the dynamics is approximated by a specific piecewise linear map, obtained from the network. The Markov Chain represents the dynamics of the time series in its statistical essence. An application to a time series resulted from Lorenz system is included

  19. Implementing size-optimal discrete neural networks require analog circuitry

    Energy Technology Data Exchange (ETDEWEB)

    Beiu, V.

    1998-12-01

    This paper starts by overviewing results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on a constructive solution for Kolmogorov`s superpositions the authors show that implementing Boolean functions can be done using neurons having an identity transfer function. Because in this case the size of the network is minimized, it follows that size-optimal solutions for implementing Boolean functions can be obtained using analog circuitry. Conclusions and several comments on the required precision are ending the paper.

  20. Optimization of TTEthernet Networks to Support Best-Effort Traffic

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Pop, Paul

    2014-01-01

    This paper focuses on the optimization of the TTEthernet communication protocol, which offers three traffic classes: time-triggered (TT), sent according to static schedules, rate-constrained (RC) that has bounded end-to-end latency, and best-effort (BE), the classic Ethernet traffic, with no timing...... guarantees. In our earlier work we have proposed an optimization approach named DOTTS that performs the routing, scheduling and packing / fragmenting of TT and RC messages, such that the TT and RC traffic is schedulable. Although backwards compatibility with classic Ethernet networks is one of TTEthernet...

  1. Optimal synthesis of a heat-exchanger network

    Energy Technology Data Exchange (ETDEWEB)

    Hamed, O A; Aly, S [University of United Arab Emirates, Al-Ain (United Arab Emirates). Faculty of Engineering

    1991-01-01

    Thermodynamic, heat transfer and economic concepts influencing the synthesis of a heat-exchanger network (HEN) coupled to a crude fractionation unit are examined. The impact of the variation of the minimum temperature approach on energy and capital targets is studied using recent developments in pinch technology. The optimal pinch approach temperature has been determined using the 'supertargeting' concept where proper trade-off between energy and capital targets is observed prior to design. A heuristic evolutionary approach has then been used for the generation of the optimal HEN. (author).

  2. Designing optimal bioethanol networks with purification for integrated biorefineries

    International Nuclear Information System (INIS)

    Shenoy, Akshay U.; Shenoy, Uday V.

    2014-01-01

    Highlights: • An analytical method is devised for bioethanol network integration with purification. • Minimum fresh bioethanol flow and pinch are found by the Unified Targeting Algorithm. • Optimal bioethanol networks are then synthesized by the Nearest Neighbors Algorithm. • Continuous targets and networks are developed over the purifier inlet flowrate range. • Case study of a biorefinery producing bioethanol from wheat shows large savings. - Abstract: Bioethanol networks with purification for processing pathways in integrated biorefineries are targeted and designed in this work by an analytical approach not requiring graphical constructions. The approach is based on six fundamental equations involving eight variables: two balance equations for the stream flowrate and the bioethanol load over the total network system; one equation for the above-pinch bioethanol load being picked up by the minimum fresh resource and the purified stream; and three equations for the purification unit. A solution strategy is devised by specifying the two variables associated with the purifier inlet stream. Importantly, continuous targeting is then possible over the entire purifier inlet flowrate range on deriving elegant formulae for the remaining six variables. The Unified Targeting Algorithm (UTA) is utilized to establish the minimum fresh bioethanol resource flowrate and identify the pinch purity. The fresh bioethanol resource flowrate target is shown to decrease linearly with purifier inlet flowrate provided the pinch is held by the same point. The Nearest Neighbors Algorithm (NNA) is used to methodically synthesize optimal networks matching bioethanol demands and sources. A case study of a biorefinery producing bioethanol from wheat with arabinoxylan (AX) coproduction is presented. It illustrates the versatility of the approach in generating superior practical designs with up to nearly 94% savings for integrated bioethanol networks, both with and without process

  3. Hybrid Swarm Intelligence Optimization Approach for Optimal Data Storage Position Identification in Wireless Sensor Networks

    Science.gov (United States)

    Mohanasundaram, Ranganathan; Periasamy, Pappampalayam Sanmugam

    2015-01-01

    The current high profile debate with regard to data storage and its growth have become strategic task in the world of networking. It mainly depends on the sensor nodes called producers, base stations, and also the consumers (users and sensor nodes) to retrieve and use the data. The main concern dealt here is to find an optimal data storage position in wireless sensor networks. The works that have been carried out earlier did not utilize swarm intelligence based optimization approaches to find the optimal data storage positions. To achieve this goal, an efficient swam intelligence approach is used to choose suitable positions for a storage node. Thus, hybrid particle swarm optimization algorithm has been used to find the suitable positions for storage nodes while the total energy cost of data transmission is minimized. Clustering-based distributed data storage is utilized to solve clustering problem using fuzzy-C-means algorithm. This research work also considers the data rates and locations of multiple producers and consumers to find optimal data storage positions. The algorithm is implemented in a network simulator and the experimental results show that the proposed clustering and swarm intelligence based ODS strategy is more effective than the earlier approaches. PMID:25734182

  4. Network optimization including gas lift and network parameters under subsurface uncertainty

    Energy Technology Data Exchange (ETDEWEB)

    Schulze-Riegert, R.; Baffoe, J.; Pajonk, O. [SPT Group GmbH, Hamburg (Germany); Badalov, H.; Huseynov, S. [Technische Univ. Clausthal, Clausthal-Zellerfeld (Germany). ITE; Trick, M. [SPT Group, Calgary, AB (Canada)

    2013-08-01

    Optimization of oil and gas field production systems poses a great challenge to field development due to complex and multiple interactions between various operational design parameters and subsurface uncertainties. Conventional analytical methods are capable of finding local optima based on single deterministic models. They are less applicable for efficiently generating alternative design scenarios in a multi-objective context. Practical implementations of robust optimization workflows integrate the evaluation of alternative design scenarios and multiple realizations of subsurface uncertainty descriptions. Production or economic performance indicators such as NPV (Net Present Value) are linked to a risk-weighted objective function definition to guide the optimization processes. This work focuses on an integrated workflow using a reservoir-network simulator coupled to an optimization framework. The work will investigate the impact of design parameters while considering the physics of the reservoir, wells, and surface facilities. Subsurface uncertainties are described by well parameters such as inflow performance. Experimental design methods are used to investigate parameter sensitivities and interactions. Optimization methods are used to find optimal design parameter combinations which improve key performance indicators of the production network system. The proposed workflow will be applied to a representative oil reservoir coupled to a network which is modelled by an integrated reservoir-network simulator. Gas-lift will be included as an explicit measure to improve production. An objective function will be formulated for the net present value of the integrated system including production revenue and facility costs. Facility and gas lift design parameters are tuned to maximize NPV. Well inflow performance uncertainties are introduced with an impact on gas lift performance. Resulting variances on NPV are identified as a risk measure for the optimized system design. A

  5. A Multiobjective Optimization Model in Automotive Supply Chain Networks

    Directory of Open Access Journals (Sweden)

    Abdolhossein Sadrnia

    2013-01-01

    Full Text Available In the new decade, green investment decisions are attracting more interest in design supply chains due to the hidden economic benefits and environmental legislative barriers. In this paper, a supply chain network design problem with both economic and environmental concerns is presented. Therefore, a multiobjective optimization model that captures the trade-off between the total logistics cost and CO2 emissions is proposed. With regard to the complexity of logistic networks, a new multiobjective swarm intelligence algorithm known as a multiobjective Gravitational search algorithm (MOGSA has been implemented for solving the proposed mathematical model. To evaluate the effectiveness of the model, a comprehensive set of numerical experiments is explained. The results obtained show that the proposed model can be applied as an effective tool in strategic planning for optimizing cost and CO2 emissions in an environmentally friendly automotive supply chain.

  6. Trajectory Based Optimal Segment Computation in Road Network Databases

    DEFF Research Database (Denmark)

    Li, Xiaohui; Ceikute, Vaida; Jensen, Christian S.

    2013-01-01

    Finding a location for a new facility such that the facility attracts the maximal number of customers is a challenging problem. Existing studies either model customers as static sites and thus do not consider customer movement, or they focus on theoretical aspects and do not provide solutions...... that are shown empirically to be scalable. Given a road network, a set of existing facilities, and a collection of customer route traversals, an optimal segment query returns the optimal road network segment(s) for a new facility. We propose a practical framework for computing this query, where each route...... traversal is assigned a score that is distributed among the road segments covered by the route according to a score distribution model. The query returns the road segment(s) with the highest score. To achieve low latency, it is essential to prune the very large search space. We propose two algorithms...

  7. Trajectory Based Optimal Segment Computation in Road Network Databases

    DEFF Research Database (Denmark)

    Li, Xiaohui; Ceikute, Vaida; Jensen, Christian S.

    Finding a location for a new facility such that the facility attracts the maximal number of customers is a challenging problem. Existing studies either model customers as static sites and thus do not consider customer movement, or they focus on theoretical aspects and do not provide solutions...... that are shown empirically to be scalable. Given a road network, a set of existing facilities, and a collection of customer route traversals, an optimal segment query returns the optimal road network segment(s) for a new facility. We propose a practical framework for computing this query, where each route...... traversal is assigned a score that is distributed among the road segments covered by the route according to a score distribution model. The query returns the road segment(s) with the highest score. To achieve low latency, it is essential to prune the very large search space. We propose two algorithms...

  8. 78 FR 65975 - Notice of Availability (NOA) for Strategic Network Optimization (SNO) Environmental Assessment...

    Science.gov (United States)

    2013-11-04

    ... (NOA) for Strategic Network Optimization (SNO) Environmental Assessment Finding of No Significant... Network Optimization (SNO) Environmental Assessment (EA) Finding of No Significant Impact (FONSI). SUMMARY... interpreted comprehensively to include the natural and physical environment and the relationship of people...

  9. Dynamic mobility applications policy analysis : policy and institutional issues for intelligent network flow optimization (INFLO).

    Science.gov (United States)

    2014-12-01

    The report documents policy considerations for the Intelligent Network Flow Optimization (INFLO) connected vehicle applications : bundle. INFLO aims to optimize network flow on freeways and arterials by informing motorists of existing and impen...

  10. PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile Ad-hoc Networks

    Directory of Open Access Journals (Sweden)

    Mansour Sheikhan

    2012-06-01

    Full Text Available Mobile ad-hoc network (MANET is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multipath is an NP-complete problem. In this paper, Hopfield neural network (HNN which its parameters are optimized by particle swarm optimization (PSO algorithm is proposed as multipath routing algorithm. Link expiration time (LET between each two nodes is used as the link reliability estimation metric. This approach can find either node-disjoint or link-disjoint paths in singlephase route discovery. Simulation results confirm that PSO-HNN routing algorithm has better performance as compared to backup path set selection algorithm (BPSA in terms of the path set reliability and number of paths in the set.

  11. Accelerator optimization using a network control and acquisition system

    International Nuclear Information System (INIS)

    Geddes, Cameron G.R.; Catravas, P.E.; Faure, Jerome; Toth, Csaba; Tilborg, J. van; Leemans, Wim P.

    2002-01-01

    Accelerator optimization requires detailed study of many parameters, indicating the need for remote control and automated data acquisition systems. A control and data acquisition system based on a network of commodity PCs and applications with standards based inter-application communication is being built for the l'OASIS accelerator facility. This system allows synchronous acquisition of data at high (> 1 Hz) rates and remote control of the accelerator at low cost, allowing detailed study of the acceleration process

  12. A measure theoretic approach to traffic flow optimization on networks

    OpenAIRE

    Cacace, Simone; Camilli, Fabio; De Maio, Raul; Tosin, Andrea

    2018-01-01

    We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective isto minimise/maximise macroscopic quantities, such as traffic volume or average speed,controlling few agents, for example smart traffic lights and automated cars. The measuretheoretic approach allows to study in a same setting local and nonlocal drivers interactionsand to consider the control variables as additional measures interacting ...

  13. Optimal Joint Expected Delay Forwarding in Delay Tolerant Networks

    OpenAIRE

    Jia Xu; Xin Feng; Wen Jun Yang; Ru Chuan Wang; Bing Qing Han

    2013-01-01

    Multicopy forwarding schemes have been employed in delay tolerant network (DTN) to improve the delivery delay and delivery rate. Much effort has been focused on reducing the routing cost while retaining high performance. This paper aims to provide an optimal joint expected delay forwarding (OJEDF) protocol which minimizes the expected delay while satisfying a certain constant on the number of forwardings per message. We propose a comprehensive forwarding metric called joint expected delay (JE...

  14. An optimization planning technique for Suez Canal Network in Egypt

    Energy Technology Data Exchange (ETDEWEB)

    Abou El-Ela, A.A.; El-Zeftawy, A.A.; Allam, S.M.; Atta, Gasir M. [Electrical Engineering Dept., Faculty of Eng., Shebin El-Kom (Egypt)

    2010-02-15

    This paper introduces a proposed optimization technique POT for predicting the peak load demand and planning of transmission line systems. Many of traditional methods have been presented for long-term load forecasting of electrical power systems. But, the results of these methods are approximated. Therefore, the artificial neural network (ANN) technique for long-term peak load forecasting is modified and discussed as a modern technique in long-term load forecasting. The modified technique is applied on the Egyptian electrical network dependent on its historical data to predict the electrical peak load demand forecasting up to year 2017. This technique is compared with extrapolation of trend curves as a traditional method. The POT is applied also to obtain the optimal planning of transmission lines for the 220 kV of Suez Canal Network (SCN) using the ANN technique. The minimization of the transmission network costs are considered as an objective function, while the transmission lines (TL) planning constraints are satisfied. Zafarana site on the Red Sea coast is considered as an optimal site for installing big wind farm (WF) units in Egypt. So, the POT is applied to plan both the peak load and the electrical transmission of SCN with and without considering WF to develop the impact of WF units on the electrical transmission system of Egypt, considering the reliability constraints which were taken as a separate model in the previous techniques. The application on SCN shows the capability and the efficiently of the proposed techniques to obtain the predicting peak load demand and the optimal planning of transmission lines of SCN up to year 2017. (author)

  15. PARTICLE SWARM OPTIMIZATION (PSO FOR TRAINING OPTIMIZATION ON CONVOLUTIONAL NEURAL NETWORK (CNN

    Directory of Open Access Journals (Sweden)

    Arie Rachmad Syulistyo

    2016-02-01

    Full Text Available Neural network attracts plenty of researchers lately. Substantial number of renowned universities have developed neural network for various both academically and industrially applications. Neural network shows considerable performance on various purposes. Nevertheless, for complex applications, neural network’s accuracy significantly deteriorates. To tackle the aforementioned drawback, lot of researches had been undertaken on the improvement of the standard neural network. One of the most promising modifications on standard neural network for complex applications is deep learning method. In this paper, we proposed the utilization of Particle Swarm Optimization (PSO in Convolutional Neural Networks (CNNs, which is one of the basic methods in deep learning. The use of PSO on the training process aims to optimize the results of the solution vectors on CNN in order to improve the recognition accuracy. The data used in this research is handwritten digit from MNIST. The experiments exhibited that the accuracy can be attained in 4 epoch is 95.08%. This result was better than the conventional CNN and DBN.  The execution time was also almost similar to the conventional CNN. Therefore, the proposed method was a promising method.

  16. Extending Resolution of Fault Slip With Geodetic Networks Through Optimal Network Design

    Science.gov (United States)

    Sathiakumar, Sharadha; Barbot, Sylvain Denis; Agram, Piyush

    2017-12-01

    Geodetic networks consisting of high precision and high rate Global Navigation Satellite Systems (GNSS) stations continuously monitor seismically active regions of the world. These networks measure surface displacements and the amount of geodetic strain accumulated in the region and give insight into the seismic potential. SuGar (Sumatra GPS Array) in Sumatra, GEONET (GNSS Earth Observation Network System) in Japan, and PBO (Plate Boundary Observatory) in California are some examples of established networks around the world that are constantly expanding with the addition of new stations to improve the quality of measurements. However, installing new stations to existing networks is tedious and expensive. Therefore, it is important to choose suitable locations for new stations to increase the precision obtained in measuring the geophysical parameters of interest. Here we describe a methodology to design optimal geodetic networks that augment the existing system and use it to investigate seismo-tectonics at convergent and transform boundaries considering land-based and seafloor geodesy. The proposed network design optimization would be pivotal to better understand seismic and tsunami hazards around the world. Land-based and seafloor networks can monitor fault slip around subduction zones with significant resolution, but transform faults are more challenging to monitor due to their near-vertical geometry.

  17. Stochastic network interdiction optimization via capacitated network reliability modeling and probabilistic solution discovery

    International Nuclear Information System (INIS)

    Ramirez-Marquez, Jose Emmanuel; Rocco S, Claudio M.

    2009-01-01

    This paper introduces an evolutionary optimization approach that can be readily applied to solve stochastic network interdiction problems (SNIP). The network interdiction problem solved considers the minimization of the cost associated with an interdiction strategy such that the maximum flow that can be transmitted between a source node and a sink node for a fixed network design is greater than or equal to a given reliability requirement. Furthermore, the model assumes that the nominal capacity of each network link and the cost associated with their interdiction can change from link to link and that such interdiction has a probability of being successful. This version of the SNIP is for the first time modeled as a capacitated network reliability problem allowing for the implementation of computation and solution techniques previously unavailable. The solution process is based on an evolutionary algorithm that implements: (1) Monte-Carlo simulation, to generate potential network interdiction strategies, (2) capacitated network reliability techniques to analyze strategies' source-sink flow reliability and, (3) an evolutionary optimization technique to define, in probabilistic terms, how likely a link is to appear in the final interdiction strategy. Examples for different sizes of networks are used throughout the paper to illustrate the approach

  18. Optimization of neural network algorithm of the land market description

    Directory of Open Access Journals (Sweden)

    M. A. Karpovich

    2016-01-01

    Full Text Available The advantages of neural network technology is shown in comparison of traditional descriptions of dynamically changing systems, which include a modern land market. The basic difficulty arising in the practical implementation of neural network models of the land market and construction products is revealed It is the formation of a representative set of training and test examples. The requirements which are necessary for the correct description of the current economic situation has been determined, it consists in the fact that Train-paid-set in the feature space should not has the ranges with a low density of observations. The methods of optimization of empirical array, which allow to avoid the long-range extrapolation of data from range of concentration of the set of examples are formulated. It is shown that a radical method of optimization a set of training and test examples enclosing to collect supplemantary information, is associated with significant costs time and resources for the economic problems and the ratio of cost / efficiency is less efficient than an algorithm optimization neural network models the earth market fixed set of empirical data. Algorithm of optimization based on the transformation of arrays of information which represents the expansion of the ranges of concentration of the set of examples and compression the ranges of low density of observations is analyzed in details. The significant reduction in the relative error of land price description is demonstrated on the specific example of Voronezh region market of lands which intend for road construction, it makes the using of radical method of empirical optimization of the array costeffective with accounting the significant absolute value of the land. The high economic efficiency of the proposed algorithms is demonstrated.

  19. Optimal residential smart appliances scheduling considering distribution network constraints

    Directory of Open Access Journals (Sweden)

    Yu-Ree Kim

    2016-01-01

    Full Text Available As smart appliances (SAs are more widely adopted within distribution networks, residential consumers can contribute to electricity market operations with demand response resources and reduce their electricity bill. However, if the schedules of demand response resources are determined only by the economic electricity rate signal, the schedule can be unfeasible due to the distribution network constraints. Furthermore, it is impossible for consumers to understand the complex physical characteristics and reflect them in their everyday behaviors. This paper introduces the concept of load coordinating retailer (LCR that deals with demand responsive appliances to reduce electrical consumption for the given distribution network constraints. The LCR can play the role of both conventional retailer and aggregated demand response provider for residential customers. It determines the optimal schedules for the aggregated neighboring SAs according to their types within each distribution feeder. The optimization algorithms are developed using Mixed Integer Linear Programming, and the distribution network is solved by the Newton–Raphson AC power flow.

  20. Optimal Operations and Resilient Investments in Steam Networks

    Energy Technology Data Exchange (ETDEWEB)

    Bungener, Stéphane L., E-mail: stephane.bungener@a3.epfl.ch [Industrial Process and Energy Systems Engineering, École Polytechnique Fédérale de Lausanne, Lausanne (Switzerland); Van Eetvelde, Greet [Environmental and Spatial Management, Faculty of Engineering and Architecture, Ghent University, Ghent (Belgium); Maréchal, François [Industrial Process and Energy Systems Engineering, École Polytechnique Fédérale de Lausanne, Lausanne (Switzerland)

    2016-01-20

    Steam is a key energy vector for industrial sites, most commonly used for process heating and cooling, cogeneration of heat and mechanical power as a motive fluid or for stripping. Steam networks are used to carry steam from producers to consumers and between pressure levels through letdowns and steam turbines. The steam producers (boilers, heat and power cogeneration units, heat exchangers, chemical reactors) should be sized to supply the consumers at nominal operating conditions as well as peak demand. First, this paper proposes an Mixed Integer Linear Programing formulation to optimize the operations of steam networks in normal operating conditions and exceptional demand (when operating reserves fall to zero), through the introduction of load shedding. Optimization of investments based on operational and investment costs are included in the formulation. Though rare, boiler failures can have a heavy impact on steam network operations and costs, leading to undercapacity and unit shutdowns. A method is therefore proposed to simulate steam network operations when facing boiler failures. Key performance indicators are introduced to quantify the network’s resilience. The proposed methods are applied and demonstrated in an industrial case study using industrial data. The results indicate the importance of oversizing key steam producing equipments and the value of industrial symbiosis to increase industrial site resilience.

  1. Optimal Operations and Resilient Investments in Steam Networks

    International Nuclear Information System (INIS)

    Bungener, Stéphane L.; Van Eetvelde, Greet; Maréchal, François

    2016-01-01

    Steam is a key energy vector for industrial sites, most commonly used for process heating and cooling, cogeneration of heat and mechanical power as a motive fluid or for stripping. Steam networks are used to carry steam from producers to consumers and between pressure levels through letdowns and steam turbines. The steam producers (boilers, heat and power cogeneration units, heat exchangers, chemical reactors) should be sized to supply the consumers at nominal operating conditions as well as peak demand. First, this paper proposes an Mixed Integer Linear Programing formulation to optimize the operations of steam networks in normal operating conditions and exceptional demand (when operating reserves fall to zero), through the introduction of load shedding. Optimization of investments based on operational and investment costs are included in the formulation. Though rare, boiler failures can have a heavy impact on steam network operations and costs, leading to undercapacity and unit shutdowns. A method is therefore proposed to simulate steam network operations when facing boiler failures. Key performance indicators are introduced to quantify the network’s resilience. The proposed methods are applied and demonstrated in an industrial case study using industrial data. The results indicate the importance of oversizing key steam producing equipments and the value of industrial symbiosis to increase industrial site resilience.

  2. Optimization of operation cycles in BWRs using neural networks

    International Nuclear Information System (INIS)

    Ortiz S, J. J.; Castillo, A.; Alejandro P, D.

    2011-11-01

    The first results of a system for the optimization of operation cycles in boiling water reactors by means of a multi state recurrent neural network are present in this work. The neural network finds the best combination of fuel cells; fuel reloads and control bars patterns previously designed, according to an energy function that qualifies the performance of the three partial solutions for the solution of the whole problem. The partial solutions are designed by means of optimization systems non couple among them and that can use any optimization technique. The phase of the fuel axial design is not made and the size of the axial areas is fixed during the optimization process. The methodology was applied to design a balance cycle of 18 months for the reactors of the nuclear power station of Laguna Verde. The results show that is possible to find combinations of partial solutions that in set represent good solutions to the complete design problem of an operation cycle of a nuclear reactor. The results are compared with others obtained previously by other techniques. This system was developed in platform Li nux and programmed in Fortran 95 taking advantage of the 8 nuclei of a work station Dell Precision T7400. (Author)

  3. Network ownership and optimal tariffs for natural gas transport

    International Nuclear Information System (INIS)

    Hagen, Kaare P.; Kind, Hans Jarle; Sannarnes, Jan Gaute

    2004-11-01

    This paper addresses the issue of national optimal tariffs for transportation of natural gas in a setting where national gas production in its entirety is exported to end-user markets abroad. In a situation where the transportation network is owned altogether by a vertically integrated national gas producer, it is shown that the optimal tariff depends on the ownership structure in the integrated transportation company as well as in the non-facility based gas company. There are two reasons why it is possibly optimal with a mark-up on marginal transportation costs. First, there is a premium on public revenue if domestic taxation is distorting. Second, with incomplete national taxation of rents from the gas sector, the transportation tariffs can serve as a second best way of appropriating rents accruing to foreigners. In a situation where the network is run as a separate entity subject to a rate of return regulation, it will be optimal to discriminate the tariffs between shippers for the usual Ramseyean reasons. (Author)

  4. Robustness and Optimization of Complex Networks : Reconstructability, Algorithms and Modeling

    NARCIS (Netherlands)

    Liu, D.

    2013-01-01

    The infrastructure networks, including the Internet, telecommunication networks, electrical power grids, transportation networks (road, railway, waterway, and airway networks), gas networks and water networks, are becoming more and more complex. The complex infrastructure networks are crucial to our

  5. Using neural networks to speed up optimization algorithms

    CERN Document Server

    Bazan, M

    2000-01-01

    The paper presents the application of radial-basis-function (RBF) neural networks to speed up deterministic search algorithms used for the design and optimization of superconducting LHC magnets. The optimization of the iron yoke of the main dipoles requires a number of numerical field computations per trial solution as the field quality depends on the excitation of the magnets. This results in computation times of about 30 minutes for each objective function evaluation (on a DEC-Alpha 600/333) and only the most robust (deterministic) optimization algorithms can be applied. Using a RBF function approximator, the achieved speed-up of the search algorithm is in the order of 25% for problems with two parameters and about 18% for problems with three and five design variables. (13 refs).

  6. Nonlinear Non-convex Optimization of Hydraulic Networks

    DEFF Research Database (Denmark)

    Tahavori, Maryamsadat; Kallesøe, Carsten; Leth, John-Josef

    2013-01-01

    Pressure management in water supply systems is an effective way to reduce the leakage in a system. In this paper, the pressure management and the reduction of power consumption of a water supply system is formulated as an optimization problem. The problem is to minimize the power consumption in p....... They can be used for a general hydraulic networks to optimize the leakage and energy consumption and to satisfy the demands at the end-users. The results in this paper show that the power consumption of the pumps is reduced.......Pressure management in water supply systems is an effective way to reduce the leakage in a system. In this paper, the pressure management and the reduction of power consumption of a water supply system is formulated as an optimization problem. The problem is to minimize the power consumption...

  7. Optimizing Cooperative Cognitive Radio Networks with Opportunistic Access

    KAUST Repository

    Zafar, Ammar; Alouini, Mohamed-Slim; Chen, Yunfei; Radaydeh, Redha M.

    2012-01-01

    Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources. © 2012 Ammar Zafar et al.

  8. Pricing Resources in LTE Networks through Multiobjective Optimization

    Science.gov (United States)

    Lai, Yung-Liang; Jiang, Jehn-Ruey

    2014-01-01

    The LTE technology offers versatile mobile services that use different numbers of resources. This enables operators to provide subscribers or users with differential quality of service (QoS) to boost their satisfaction. On one hand, LTE operators need to price the resources high for maximizing their profits. On the other hand, pricing also needs to consider user satisfaction with allocated resources and prices to avoid “user churn,” which means subscribers will unsubscribe services due to dissatisfaction with allocated resources or prices. In this paper, we study the pricing resources with profits and satisfaction optimization (PRPSO) problem in the LTE networks, considering the operator profit and subscribers' satisfaction at the same time. The problem is modelled as nonlinear multiobjective optimization with two optimal objectives: (1) maximizing operator profit and (2) maximizing user satisfaction. We propose to solve the problem based on the framework of the NSGA-II. Simulations are conducted for evaluating the proposed solution. PMID:24526889

  9. Optimizing Cooperative Cognitive Radio Networks with Opportunistic Access

    KAUST Repository

    Zafar, Ammar

    2012-09-16

    Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources. © 2012 Ammar Zafar et al.

  10. Pricing resources in LTE networks through multiobjective optimization.

    Science.gov (United States)

    Lai, Yung-Liang; Jiang, Jehn-Ruey

    2014-01-01

    The LTE technology offers versatile mobile services that use different numbers of resources. This enables operators to provide subscribers or users with differential quality of service (QoS) to boost their satisfaction. On one hand, LTE operators need to price the resources high for maximizing their profits. On the other hand, pricing also needs to consider user satisfaction with allocated resources and prices to avoid "user churn," which means subscribers will unsubscribe services due to dissatisfaction with allocated resources or prices. In this paper, we study the pricing resources with profits and satisfaction optimization (PRPSO) problem in the LTE networks, considering the operator profit and subscribers' satisfaction at the same time. The problem is modelled as nonlinear multiobjective optimization with two optimal objectives: (1) maximizing operator profit and (2) maximizing user satisfaction. We propose to solve the problem based on the framework of the NSGA-II. Simulations are conducted for evaluating the proposed solution.

  11. Pricing Resources in LTE Networks through Multiobjective Optimization

    Directory of Open Access Journals (Sweden)

    Yung-Liang Lai

    2014-01-01

    Full Text Available The LTE technology offers versatile mobile services that use different numbers of resources. This enables operators to provide subscribers or users with differential quality of service (QoS to boost their satisfaction. On one hand, LTE operators need to price the resources high for maximizing their profits. On the other hand, pricing also needs to consider user satisfaction with allocated resources and prices to avoid “user churn,” which means subscribers will unsubscribe services due to dissatisfaction with allocated resources or prices. In this paper, we study the pricing resources with profits and satisfaction optimization (PRPSO problem in the LTE networks, considering the operator profit and subscribers' satisfaction at the same time. The problem is modelled as nonlinear multiobjective optimization with two optimal objectives: (1 maximizing operator profit and (2 maximizing user satisfaction. We propose to solve the problem based on the framework of the NSGA-II. Simulations are conducted for evaluating the proposed solution.

  12. Optimizing Seismic Monitoring Networks for EGS and Conventional Geothermal Projects

    Science.gov (United States)

    Kraft, Toni; Herrmann, Marcus; Bethmann, Falko; Stefan, Wiemer

    2013-04-01

    In the past several years, geological energy technologies receive growing attention and have been initiated in or close to urban areas. Some of these technologies involve injecting fluids into the subsurface (e.g., oil and gas development, waste disposal, and geothermal energy development) and have been found or suspected to cause small to moderate sized earthquakes. These earthquakes, which may have gone unnoticed in the past when they occurred in remote sparsely populated areas, are now posing a considerable risk for the public acceptance of these technologies in urban areas. The permanent termination of the EGS project in Basel, Switzerland after a number of induced ML~3 (minor) earthquakes in 2006 is one prominent example. It is therefore essential for the future development and success of these geological energy technologies to develop strategies for managing induced seismicity and keeping the size of induced earthquakes at a level that is acceptable to all stakeholders. Most guidelines and recommendations on induced seismicity published since the 1970ies conclude that an indispensable component of such a strategy is the establishment of seismic monitoring in an early stage of a project. This is because an appropriate seismic monitoring is the only way to detect and locate induced microearthquakes with sufficient certainty to develop an understanding of the seismic and geomechanical response of the reservoir to the geotechnical operation. In addition, seismic monitoring lays the foundation for the establishment of advanced traffic light systems and is therefore an important confidence building measure towards the local population and authorities. We have developed an optimization algorithm for seismic monitoring networks in urban areas that allows to design and evaluate seismic network geometries for arbitrary geotechnical operation layouts. The algorithm is based on the D-optimal experimental design that aims to minimize the error ellipsoid of the linearized

  13. Automatic verification of a lip-synchronisation protocol using Uppaal

    NARCIS (Netherlands)

    Bowman, H.; Faconti, G.; Katoen, J.-P.; Latella, D.; Massink, M.

    1998-01-01

    We present the formal specification and verification of a lip-synchronisation protocol using the real-time model checker Uppaal. A number of specifications of this protocol can be found in the literature, but this is the first automatic verification. We take a published specification of the

  14. Oxytocin improves synchronisation in leader-follower interaction

    DEFF Research Database (Denmark)

    Gebauer, L.; Witek, M. A. G.; Hansen, N. C.

    2016-01-01

    , there was no effect when following a regular metronome or when both tappers were mutually adapting to each other. Furthermore, relative to their self-paced tapping partners, oxytocin followers were less variable than placebo followers. Our data suggests that oxytocin improves synchronisation to an unresponsive...

  15. On the Expressive Power of Polyadic Synchronisation in π- calculus

    DEFF Research Database (Denmark)

    Carbone, Marco; Maffeis, Sergio

    2002-01-01

    We extend the pi-calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of pi-calculus, we suggest that it permits divergence-free encodings of distributed calculi, ...

  16. Design of optimised backstepping controller for the synchronisation

    Indian Academy of Sciences (India)

    In this paper, an adaptive backstepping controller has been tuned to synchronise two chaotic Colpitts oscillators in a master–slave configuration. The parameters of the controller are determined using shark smell optimisation (SSO) algorithm. Numerical results are presented and compared with those of particle swarm ...

  17. Design of optimised backstepping controller for the synchronisation ...

    Indian Academy of Sciences (India)

    Ehsan Fouladi

    2017-12-18

    Dec 18, 2017 ... for the proposed optimised method compared to PSO optimised controller or any non-optimised backstepping controller. Keywords. Colpitts oscillator; backstepping controller; chaos synchronisation; shark smell algorithm; particle .... The velocity model is based on the gradient of the objective function, tilting ...

  18. Globalisation, the Challenge of Educational Synchronisation and Teacher Education

    Science.gov (United States)

    Papastephanou, Marianna; Christou, Miranda; Gregoriou, Zelia

    2013-01-01

    In this article, we set out from the challenge that globalising synchronisation--usually exemplified by Organization for Economic Cooperation and Development and World Bank initiatives--presents for education to argue that the time-space compression effected by globalisation must educationally be dealt with with caution, critical vigilance and a…

  19. A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization.

    Science.gov (United States)

    Liu, Qingshan; Guo, Zhishan; Wang, Jun

    2012-02-01

    In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed. Copyright © 2011 Elsevier Ltd. All rights reserved.

  20. A network security situation prediction model based on wavelet neural network with optimized parameters

    Directory of Open Access Journals (Sweden)

    Haibo Zhang

    2016-08-01

    Full Text Available The security incidents ion networks are sudden and uncertain, it is very hard to precisely predict the network security situation by traditional methods. In order to improve the prediction accuracy of the network security situation, we build a network security situation prediction model based on Wavelet Neural Network (WNN with optimized parameters by the Improved Niche Genetic Algorithm (INGA. The proposed model adopts WNN which has strong nonlinear ability and fault-tolerance performance. Also, the parameters for WNN are optimized through the adaptive genetic algorithm (GA so that WNN searches more effectively. Considering the problem that the adaptive GA converges slowly and easily turns to the premature problem, we introduce a novel niche technology with a dynamic fuzzy clustering and elimination mechanism to solve the premature convergence of the GA. Our final simulation results show that the proposed INGA-WNN prediction model is more reliable and effective, and it achieves faster convergence-speed and higher prediction accuracy than the Genetic Algorithm-Wavelet Neural Network (GA-WNN, Genetic Algorithm-Back Propagation Neural Network (GA-BPNN and WNN.

  1. Design and optimization of all-optical networks

    Science.gov (United States)

    Xiao, Gaoxi

    1999-10-01

    In this thesis, we present our research results on the design and optimization of all-optical networks. We divide our results into the following four parts: 1.In the first part, we consider broadcast-and-select networks. In our research, we propose an alternative and cheaper network configuration to hide the tuning time. In addition, we derive lower bounds on the optimal schedule lengths and prove that they are tighter than the best existing bounds. 2.In the second part, we consider all-optical wide area networks. We propose a set of algorithms for allocating a given number of WCs to the nodes. We adopt a simulation-based optimization approach, in which we collect utilization statistics of WCs from computer simulation and then perform optimization to allocate the WCs. Therefore, our algorithms are widely applicable and they are not restricted to any particular model and assumption. We have conducted extensive computer simulation on regular and irregular networks under both uniform and non-uniform traffic. We see that our method can get nearly the same performance as that of full wavelength conversion by using a much smaller number of WCs. Compared with the best existing method, the results show that our algorithms can significantly reduce (1)the overall blocking probability (i.e., better mean quality of service) and (2)the maximum of the blocking probabilities experienced at all the source nodes (i.e., better fairness). Equivalently, for a given performance requirement on blocking probability, our algorithms can significantly reduce the number of WCs required. 3.In the third part, we design and optimize the physical topology of all-optical wide area networks. We show that the design problem is NP-complete and we propose a heuristic algorithm called two-stage cut saturation algorithm for this problem. Simulation results show that (1)the proposed algorithm can efficiently design networks with low cost and high utilization, and (2)if wavelength converters are

  2. A low complexity method for the optimization of network path length in spatially embedded networks

    International Nuclear Information System (INIS)

    Chen, Guang; Yang, Xu-Hua; Xu, Xin-Li; Ming, Yong; Chen, Sheng-Yong; Wang, Wan-Liang

    2014-01-01

    The average path length of a network is an important index reflecting the network transmission efficiency. In this paper, we propose a new method of decreasing the average path length by adding edges. A new indicator is presented, incorporating traffic flow demand, to assess the decrease in the average path length when a new edge is added during the optimization process. With the help of the indicator, edges are selected and added into the network one by one. The new method has a relatively small time computational complexity in comparison with some traditional methods. In numerical simulations, the new method is applied to some synthetic spatially embedded networks. The result shows that the method can perform competitively in decreasing the average path length. Then, as an example of an application of this new method, it is applied to the road network of Hangzhou, China. (paper)

  3. Information spread in networks: Games, optimal control, and stabilization

    Science.gov (United States)

    Khanafer, Ali

    This thesis focuses on designing efficient mechanisms for controlling information spread in networks. We consider two models for information spread. The first one is the well-known distributed averaging dynamics. The second model is a nonlinear one that describes virus spread in computer and biological networks. We seek to design optimal, robust, and stabilizing controllers under practical constraints. For distributed averaging networks, we study the interaction between a network designer and an adversary. We consider two types of attacks on the network. In Attack-I, the adversary strategically disconnects a set of links to prevent the nodes from reaching consensus. Meanwhile, the network designer assists the nodes in reaching consensus by changing the weights of a limited number of links in the network. We formulate two problems to describe this competition where the order in which the players act is reversed in the two problems. Although the canonical equations provided by the Pontryagin's Maximum Principle (MP) seem to be intractable, we provide an alternative characterization for the optimal strategies that makes connection to potential theory. Further, we provide a sufficient condition for the existence of a saddle-point equilibrium (SPE) for the underlying zero-sum game. In Attack-II, the designer and the adversary are both capable of altering the measurements of all nodes in the network by injecting global signals. We impose two constraints on both players: a power constraint and an energy constraint. We assume that the available energy to each player is not sufficient to operate at maximum power throughout the horizon of the game. We show the existence of an SPE and derive the optimal strategies in closed form for this attack scenario. As an alternative to the "network designer vs. adversary" framework, we investigate the possibility of stabilizing unknown network diffusion processes using a distributed mechanism, where the uncertainty is due to an attack

  4. Towards Optimal Event Detection and Localization in Acyclic Flow Networks

    KAUST Repository

    Agumbe Suresh, Mahima

    2012-01-03

    Acyclic flow networks, present in many infrastructures of national importance (e.g., oil & gas and water distribution systems), have been attracting immense research interest. Existing solutions for detecting and locating attacks against these infrastructures, have been proven costly and imprecise, especially when dealing with large scale distribution systems. In this paper, to the best of our knowledge for the first time, we investigate how mobile sensor networks can be used for optimal event detection and localization in acyclic flow networks. Sensor nodes move along the edges of the network and detect events (i.e., attacks) and proximity to beacon nodes with known placement in the network. We formulate the problem of minimizing the cost of monitoring infrastructure (i.e., minimizing the number of sensor and beacon nodes deployed), while ensuring a degree of sensing coverage in a zone of interest and a required accuracy in locating events. We propose algorithms for solving these problems and demonstrate their effectiveness with results obtained from a high fidelity simulator.

  5. Development of a Deterministic Optimization Model for Design of an Integrated Utility and Hydrogen Supply Network

    International Nuclear Information System (INIS)

    Hwangbo, Soonho; Lee, In-Beum; Han, Jeehoon

    2014-01-01

    Lots of networks are constructed in a large scale industrial complex. Each network meet their demands through production or transportation of materials which are needed to companies in a network. Network directly produces materials for satisfying demands in a company or purchase form outside due to demand uncertainty, financial factor, and so on. Especially utility network and hydrogen network are typical and major networks in a large scale industrial complex. Many studies have been done mainly with focusing on minimizing the total cost or optimizing the network structure. But, few research tries to make an integrated network model by connecting utility network and hydrogen network. In this study, deterministic mixed integer linear programming model is developed for integrating utility network and hydrogen network. Steam Methane Reforming process is necessary for combining two networks. After producing hydrogen from Steam-Methane Reforming process whose raw material is steam vents from utility network, produced hydrogen go into hydrogen network and fulfill own needs. Proposed model can suggest optimized case in integrated network model, optimized blueprint, and calculate optimal total cost. The capability of the proposed model is tested by applying it to Yeosu industrial complex in Korea. Yeosu industrial complex has the one of the biggest petrochemical complex and various papers are based in data of Yeosu industrial complex. From a case study, the integrated network model suggests more optimal conclusions compared with previous results obtained by individually researching utility network and hydrogen network

  6. Evaluation of Persian Professional Web Social Networks\\\\\\' Features, to Provide a Suitable Solution for Optimization of These Networks in Iran

    Directory of Open Access Journals (Sweden)

    Nadjla Hariri

    2013-03-01

    Full Text Available This study aimed to determine the status of Persian professional web social networks' features and provide a suitable solution for optimization of these networks in Iran. The research methods were library research and evaluative method, and study population consisted of 10 Persian professional web social networks. In this study, for data collection, a check list of social networks important tools and features was used. According to the results, “Cloob”, “IR Experts” and “Doreh” were the most compatible networks with the criteria of social networks. Finally, some solutions were presented for optimization of capabilities of Persian professional web social networks.

  7. Computation of optimal transport and related hedging problems via penalization and neural networks

    OpenAIRE

    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...

  8. Optimal interval for major maintenance actions in electricity distribution networks

    Energy Technology Data Exchange (ETDEWEB)

    Louit, Darko; Pascual, Rodrigo [Centro de Mineria, Pontificia Universidad Catolica de Chile, Av. Vicuna MacKenna, 4860 Santiago (Chile); Banjevic, Dragan [Centre for Maintenance Optimization and Reliability Engineering, University of Toronto, 5 King' s College Rd., Toronto, Ontario (Canada)

    2009-09-15

    Many systems require the periodic undertaking of major (preventive) maintenance actions (MMAs) such as overhauls in mechanical equipment, reconditioning of train lines, resurfacing of roads, etc. In the long term, these actions contribute to achieving a lower rate of occurrence of failures, though in many cases they increase the intensity of the failure process shortly after performed, resulting in a non-monotonic trend for failure intensity. Also, in the special case of distributed assets such as communications and energy networks, pipelines, etc., it is likely that the maintenance action takes place sequentially over an extended period of time, implying that different sections of the network underwent the MMAs at different periods. This forces the development of a model based on a relative time scale (i.e. time since last major maintenance event) and the combination of data from different sections of a grid, under a normalization scheme. Additionally, extended maintenance times and sequential execution of the MMAs make it difficult to identify failures occurring before and after the preventive maintenance action. This results in the loss of important information for the characterization of the failure process. A simple model is introduced to determine the optimal MMA interval considering such restrictions. Furthermore, a case study illustrates the optimal tree trimming interval around an electricity distribution network. (author)

  9. Optimal allocation of resources for suppressing epidemic spreading on networks

    Science.gov (United States)

    Chen, Hanshuang; Li, Guofeng; Zhang, Haifeng; Hou, Zhonghuai

    2017-07-01

    Efficient allocation of limited medical resources is crucial for controlling epidemic spreading on networks. Based on the susceptible-infected-susceptible model, we solve the optimization problem of how best to allocate the limited resources so as to minimize prevalence, providing that the curing rate of each node is positively correlated to its medical resource. By quenched mean-field theory and heterogeneous mean-field (HMF) theory, we prove that an epidemic outbreak will be suppressed to the greatest extent if the curing rate of each node is directly proportional to its degree, under which the effective infection rate λ has a maximal threshold λcopt=1 / , where is the average degree of the underlying network. For a weak infection region (λ ≳λcopt ), we combine perturbation theory with the Lagrange multiplier method (LMM) to derive the analytical expression of optimal allocation of the curing rates and the corresponding minimized prevalence. For a general infection region (λ >λcopt ), the high-dimensional optimization problem is converted into numerically solving low-dimensional nonlinear equations by the HMF theory and LMM. Counterintuitively, in the strong infection region the low-degree nodes should be allocated more medical resources than the high-degree nodes to minimize prevalence. Finally, we use simulated annealing to validate the theoretical results.

  10. Synchronisation hubs in the visual cortex may arise from strong rhythmic inhibition during gamma oscillations.

    Science.gov (United States)

    Folias, Stefanos E; Yu, Shan; Snyder, Abigail; Nikolić, Danko; Rubin, Jonathan E

    2013-09-01

    Neurons in the visual cortex exhibit heterogeneity in feature selectivity and the tendency to generate action potentials synchronously with other nearby neurons. By examining visual responses from cat area 17 we found that, during gamma oscillations, there was a positive correlation between each unit's sharpness of orientation tuning, strength of oscillations, and propensity towards synchronisation with other units. Using a computational model, we demonstrated that heterogeneity in the strength of rhythmic inhibitory inputs can account for the correlations between these three properties. Neurons subject to strong inhibition tend to oscillate strongly in response to both optimal and suboptimal stimuli and synchronise promiscuously with other neurons, even if they have different orientation preferences. Moreover, these strongly inhibited neurons can exhibit sharp orientation selectivity provided that the inhibition they receive is broadly tuned relative to their excitatory inputs. These results predict that the strength and orientation tuning of synaptic inhibition are heterogeneous across area 17 neurons, which could have important implications for these neurons' sensory processing capabilities. Furthermore, although our experimental recordings were conducted in the visual cortex, our model and simulation results can apply more generally to any brain region with analogous neuron types in which heterogeneity in the strength of rhythmic inhibition can arise during gamma oscillations. © 2013 Federation of European Neuroscience Societies and John Wiley & Sons Ltd.

  11. Optimal information transfer in enzymatic networks: A field theoretic formulation

    Science.gov (United States)

    Samanta, Himadri S.; Hinczewski, Michael; Thirumalai, D.

    2017-07-01

    Signaling in enzymatic networks is typically triggered by environmental fluctuations, resulting in a series of stochastic chemical reactions, leading to corruption of the signal by noise. For example, information flow is initiated by binding of extracellular ligands to receptors, which is transmitted through a cascade involving kinase-phosphatase stochastic chemical reactions. For a class of such networks, we develop a general field-theoretic approach to calculate the error in signal transmission as a function of an appropriate control variable. Application of the theory to a simple push-pull network, a module in the kinase-phosphatase cascade, recovers the exact results for error in signal transmission previously obtained using umbral calculus [Hinczewski and Thirumalai, Phys. Rev. X 4, 041017 (2014), 10.1103/PhysRevX.4.041017]. We illustrate the generality of the theory by studying the minimal errors in noise reduction in a reaction cascade with two connected push-pull modules. Such a cascade behaves as an effective three-species network with a pseudointermediate. In this case, optimal information transfer, resulting in the smallest square of the error between the input and output, occurs with a time delay, which is given by the inverse of the decay rate of the pseudointermediate. Surprisingly, in these examples the minimum error computed using simulations that take nonlinearities and discrete nature of molecules into account coincides with the predictions of a linear theory. In contrast, there are substantial deviations between simulations and predictions of the linear theory in error in signal propagation in an enzymatic push-pull network for a certain range of parameters. Inclusion of second-order perturbative corrections shows that differences between simulations and theoretical predictions are minimized. Our study establishes that a field theoretic formulation of stochastic biological signaling offers a systematic way to understand error propagation in

  12. Optimizing the African VLBI Network for Astronomy and Geodesy

    Science.gov (United States)

    de Witt, A.; Mayer, D.; MacLeod, G.; Combrinck, L.; Petrov, L.; Nickola, M.

    2016-12-01

    The African VLBI Network will be a pan-African network of radio telescopes comprised of converted redundant satellite Earth-station antennas and new purpose-built radio telescopes. The first of these antennas, in Ghana, is currently being converted to a radio telescope and current funding is estimated to permit the conversion of two more antennas in Africa. These antennas will initially be equipped with a 5-GHz and 6.7-GHz receiver and the next receiver likely to be fitted is a 1.4-1.7-GHz receiver. While it would be advantageous for the AVN antennas to be able to participate also in geodetic and astrometric VLBI observations, there is no funding currently for this. In this paper we re-visit the scientific justifications for the AVN in an attempt to optimize the AVN for each science case, both astronomical and geodetic.

  13. Optimizing the Heat Exchanger Network of a Steam Reforming System

    DEFF Research Database (Denmark)

    Nielsen, Mads Pagh; Korsgaard, Anders Risum; Kær, Søren Knudsen

    2004-01-01

    Proton Exchange Membrane (PEM) based combined heat and power production systems are highly integrated energy systems. They may include a hydrogen production system and fuel cell stacks along with post combustion units optionally coupled with gas turbines. The considered system is based on a natural...... stationary numerical system model was used and process integration techniques for optimizing the heat exchanger network for the reforming unit are proposed. Objective is to minimize the system cost. Keywords: Fuel cells; Steam Reforming; Heat Exchanger Network (HEN) Synthesis; MINLP....... gas steam reformer along with gas purification reactors to generate clean hydrogen suited for a PEM stack. The temperatures in the various reactors in the fuel processing system vary from around 1000°C to the stack temperature at 80°C. Furthermore, external heating must be supplied to the endothermic...

  14. Loss optimization in distribution networks with distributed generation

    DEFF Research Database (Denmark)

    Pokhrel, Basanta Raj; Nainar, Karthikeyan; Bak-Jensen, Birgitte

    2017-01-01

    This paper presents a novel power loss minimization approach in distribution grids considering network reconfiguration, distributed generation and storage installation. Identification of optimum configuration in such scenario is one of the main challenges faced by distribution system operators...... in highly active distribution grids. This issue is tackled by formulating a hybrid loss optimization problem and solved using the Interior Point Method. Sensitivity analysis is used to identify the optimum location of storage units. Different scenarios of reconfiguration, storage and distributed generation...... penetration are created to test the proposed algorithm. It is tested in a benchmark medium voltage network to show the effectiveness and performance of the algorithm. Results obtained are found to be encouraging for radial distribution system. It shows that we can reduce the power loss by more than 30% using...

  15. Optimal Node Placement in Underwater Wireless Sensor Networks

    KAUST Repository

    Felamban, M.

    2013-03-25

    Wireless Sensor Networks (WSN) are expected to play a vital role in the exploration and monitoring of underwater areas which are not easily reachable by humans. However, underwater communication via acoustic waves is subject to several performance limitations that are very different from those used for terresstrial networks. In this paper, we investigate node placement for building an initial underwater WSN infrastructure. We formulate this problem as a nonlinear mathematical program with the objective of minimizing the total transmission loss under a given number of sensor nodes and targeted coverage volume. The obtained solution is the location of each node represented via a truncated octahedron to fill out the 3D space. Experiments are conducted to verify the proposed formulation, which is solved using Matlab optimization tool. Simulation is also conducted using an ns-3 simulator, and the simulation results are consistent with the obtained results from mathematical model with less than 10% error.

  16. Big Data Reduction and Optimization in Sensor Monitoring Network

    Directory of Open Access Journals (Sweden)

    Bin He

    2014-01-01

    Full Text Available Wireless sensor networks (WSNs are increasingly being utilized to monitor the structural health of the underground subway tunnels, showing many promising advantages over traditional monitoring schemes. Meanwhile, with the increase of the network size, the system is incapable of dealing with big data to ensure efficient data communication, transmission, and storage. Being considered as a feasible solution to these issues, data compression can reduce the volume of data travelling between sensor nodes. In this paper, an optimization algorithm based on the spatial and temporal data compression is proposed to cope with these issues appearing in WSNs in the underground tunnel environment. The spatial and temporal correlation functions are introduced for the data compression and data recovery. It is verified that the proposed algorithm is applicable to WSNs in the underground tunnel.

  17. Distributed optimization of a multisubchannel Ad Hoc cognitive radio network

    KAUST Repository

    Leith, Alex

    2012-05-01

    In this paper, we study the distributed-duality-based optimization of a multisubchannel ad hoc cognitive radio network (CRN) that coexists with a multicell primary radio network (PRN). For radio resource allocation in multiuser orthogonal frequency-division multiplexing (MU-OFDM) systems, the orthogonal-access-based exclusive subchannel assignment (ESA) technique has been a popular method, but it is suboptimal in ad hoc networks, because nonorthogonal access between multiple secondary-user links by using shared subchannel assignment (SSA) can bring a higher weighted sum rate. We utilize the Lagrangian dual composition tool and design low-complexity near-optimal SSA resource allocation methods, assuming practical discrete-rate modulation and that the CRN-to-PRN interference constraint has to strictly be satisfied. However, available SSA methods for CRNs are either suboptimal or involve high complexity and suffer from slow convergence. To address this problem, we design fast-convergence SSA duality schemes and introduce several novel methods to increase the speed of convergence and to satisfy various system constraints with low complexity. For practical implementation in ad hoc CRNs, we design distributed-duality schemes that involve only a small number of CRN local information exchanges for dual update. The effects of many system parameters are presented through simulation results, which show that the near-optimal SSA duality scheme can perform significantly better than the suboptimal ESA duality and SSA-iterative waterfilling schemes and that the performance loss of the distributed schemes is small, compared with their centralized counterparts. © 2012 IEEE.

  18. Iterative free-energy optimization for recurrent neural networks (INFERNO)

    Science.gov (United States)

    2017-01-01

    The intra-parietal lobe coupled with the Basal Ganglia forms a working memory that demonstrates strong planning capabilities for generating robust yet flexible neuronal sequences. Neurocomputational models however, often fails to control long range neural synchrony in recurrent spiking networks due to spontaneous activity. As a novel framework based on the free-energy principle, we propose to see the problem of spikes’ synchrony as an optimization problem of the neurons sub-threshold activity for the generation of long neuronal chains. Using a stochastic gradient descent, a reinforcement signal (presumably dopaminergic) evaluates the quality of one input vector to move the recurrent neural network to a desired activity; depending on the error made, this input vector is strengthened to hill-climb the gradient or elicited to search for another solution. This vector can be learned then by one associative memory as a model of the basal-ganglia to control the recurrent neural network. Experiments on habit learning and on sequence retrieving demonstrate the capabilities of the dual system to generate very long and precise spatio-temporal sequences, above two hundred iterations. Its features are applied then to the sequential planning of arm movements. In line with neurobiological theories, we discuss its relevance for modeling the cortico-basal working memory to initiate flexible goal-directed neuronal chains of causation and its relation to novel architectures such as Deep Networks, Neural Turing Machines and the Free-Energy Principle. PMID:28282439

  19. Optimal Power Allocation Algorithm for Radar Network Systems Based on Low Probability of Intercept Optimization(in English

    Directory of Open Access Journals (Sweden)

    Shi Chen-guang

    2014-08-01

    Full Text Available A novel optimal power allocation algorithm for radar network systems is proposed for Low Probability of Intercept (LPI technology in modern electronic warfare. The algorithm is based on the LPI optimization. First, the Schleher intercept factor for a radar network is derived, and then the Schleher intercept factor is minimized by optimizing the transmission power allocation among netted radars in the network to guarantee target-tracking performance. Furthermore, the Nonlinear Programming Genetic Algorithm (NPGA is used to solve the resulting nonconvex, nonlinear, and constrained optimization problem. Numerical simulation results show the effectiveness of the proposed algorithm.

  20. Optimal pinnate leaf-like network/matrix structure for enhanced conductive cooling

    International Nuclear Information System (INIS)

    Hu, Liguo; Zhou, Han; Zhu, Hanxing; Fan, Tongxiang; Zhang, Di

    2015-01-01

    Highlights: • We present a pinnate leaf-like network/matrix structure for conductive cooling. • We study the effect of matrix thickness on network conductive cooling performance. • Matrix thickness determines optimal distance between collection channels in network. • We determine the optimal network architecture from a global perspective. • Optimal network greatly reduces the maximum temperature difference in the network. - Abstract: Heat generated in electronic devices has to be effectively removed because excessive temperature strongly impairs their performance and reliability. Embedding a high thermal conductivity network into an electronic device is an effective method to conduct the generated heat to the outside. In this study, inspired by the pinnate leaf, we present a pinnate leaf-like network embedded in the matrix (i.e., electronic device) to cool the matrix by conduction and develop a method to construct the optimal network. In this method, we first investigate the effect of the matrix thickness on the conductive cooling performance of the network, and then optimize the network architecture from a global perspective so that to minimize the maximum temperature difference between the heat sink and the matrix. The results indicate that the matrix thickness determines the optimal distance of the neighboring collection channels in the network, which minimizes the maximum temperature difference between the matrix and the network, and that the optimal network greatly reduces the maximum temperature difference in the network. The results can serve as a design guide for efficient conductive cooling of electronic devices

  1. Cellular Neural Networks for NP-Hard Optimization

    Directory of Open Access Journals (Sweden)

    Mária Ercsey-Ravasz

    2009-02-01

    Full Text Available A cellular neural/nonlinear network (CNN is used for NP-hard optimization. We prove that a CNN in which the parameters of all cells can be separately controlled is the analog correspondent of a two-dimensional Ising-type (Edwards-Anderson spin-glass system. Using the properties of CNN, we show that one single operation (template always yields a local minimum of the spin-glass energy function. This way, a very fast optimization method, similar to simulated annealing, can be built. Estimating the simulation time needed on CNN-based computers, and comparing it with the time needed on normal digital computers using the simulated annealing algorithm, the results are astonishing. CNN computers could be faster than digital computers already at 10×10 lattice sizes. The local control of the template parameters was already partially realized on some of the hardwares, we think this study could further motivate their development in this direction.

  2. Optimizing a Drone Network to Deliver Automated External Defibrillators.

    Science.gov (United States)

    Boutilier, Justin J; Brooks, Steven C; Janmohamed, Alyf; Byers, Adam; Buick, Jason E; Zhan, Cathy; Schoellig, Angela P; Cheskes, Sheldon; Morrison, Laurie J; Chan, Timothy C Y

    2017-06-20

    Public access defibrillation programs can improve survival after out-of-hospital cardiac arrest, but automated external defibrillators (AEDs) are rarely available for bystander use at the scene. Drones are an emerging technology that can deliver an AED to the scene of an out-of-hospital cardiac arrest for bystander use. We hypothesize that a drone network designed with the aid of a mathematical model combining both optimization and queuing can reduce the time to AED arrival. We applied our model to 53 702 out-of-hospital cardiac arrests that occurred in the 8 regions of the Toronto Regional RescuNET between January 1, 2006, and December 31, 2014. Our primary analysis quantified the drone network size required to deliver an AED 1, 2, or 3 minutes faster than historical median 911 response times for each region independently. A secondary analysis quantified the reduction in drone resources required if RescuNET was treated as a large coordinated region. The region-specific analysis determined that 81 bases and 100 drones would be required to deliver an AED ahead of median 911 response times by 3 minutes. In the most urban region, the 90th percentile of the AED arrival time was reduced by 6 minutes and 43 seconds relative to historical 911 response times in the region. In the most rural region, the 90th percentile was reduced by 10 minutes and 34 seconds. A single coordinated drone network across all regions required 39.5% fewer bases and 30.0% fewer drones to achieve similar AED delivery times. An optimized drone network designed with the aid of a novel mathematical model can substantially reduce the AED delivery time to an out-of-hospital cardiac arrest event. © 2017 American Heart Association, Inc.

  3. Optimal resource allocation solutions for heterogeneous cognitive radio networks

    Directory of Open Access Journals (Sweden)

    Babatunde Awoyemi

    2017-05-01

    Full Text Available Cognitive radio networks (CRN are currently gaining immense recognition as the most-likely next-generation wireless communication paradigm, because of their enticing promise of mitigating the spectrum scarcity and/or underutilisation challenge. Indisputably, for this promise to ever materialise, CRN must of necessity devise appropriate mechanisms to judiciously allocate their rather scarce or limited resources (spectrum and others among their numerous users. ‘Resource allocation (RA in CRN', which essentially describes mechanisms that can effectively and optimally carry out such allocation, so as to achieve the utmost for the network, has therefore recently become an important research focus. However, in most research works on RA in CRN, a highly significant factor that describes a more realistic and practical consideration of CRN has been ignored (or only partially explored, i.e., the aspect of the heterogeneity of CRN. To address this important aspect, in this paper, RA models that incorporate the most essential concepts of heterogeneity, as applicable to CRN, are developed and the imports of such inclusion in the overall networking are investigated. Furthermore, to fully explore the relevance and implications of the various heterogeneous classifications to the RA formulations, weights are attached to the different classes and their effects on the network performance are studied. In solving the developed complex RA problems for heterogeneous CRN, a solution approach that examines and exploits the structure of the problem in achieving a less-complex reformulation, is extensively employed. This approach, as the results presented show, makes it possible to obtain optimal solutions to the rather difficult RA problems of heterogeneous CRN.

  4. Optimal Switch Configuration in Software-Defined Networks

    Directory of Open Access Journals (Sweden)

    Béla GENGE

    2016-06-01

    Full Text Available The emerging Software-Defined Networks (SDN paradigm facilitates innovative applications and enables the seamless provisioning of resilient communications. Nevertheless, the installation of communication flows in SDN requires careful planning in order to avoid configuration errors and to fulfill communication requirements. In this paper we propose an approach that installs automatically and optimally static flows in SDN switches. The approach aims to select high capacity links and shortest path routing, and enforces communication link and switch capacity limitations. Experimental results demonstrate the effectiveness and scalability of the developed methodology.

  5. A method of network topology optimization design considering application process characteristic

    Science.gov (United States)

    Wang, Chunlin; Huang, Ning; Bai, Yanan; Zhang, Shuo

    2018-03-01

    Communication networks are designed to meet the usage requirements of users for various network applications. The current studies of network topology optimization design mainly considered network traffic, which is the result of network application operation, but not a design element of communication networks. A network application is a procedure of the usage of services by users with some demanded performance requirements, and has obvious process characteristic. In this paper, we first propose a method to optimize the design of communication network topology considering the application process characteristic. Taking the minimum network delay as objective, and the cost of network design and network connective reliability as constraints, an optimization model of network topology design is formulated, and the optimal solution of network topology design is searched by Genetic Algorithm (GA). Furthermore, we investigate the influence of network topology parameter on network delay under the background of multiple process-oriented applications, which can guide the generation of initial population and then improve the efficiency of GA. Numerical simulations show the effectiveness and validity of our proposed method. Network topology optimization design considering applications can improve the reliability of applications, and provide guidance for network builders in the early stage of network design, which is of great significance in engineering practices.

  6. Hierarchical Artificial Bee Colony Algorithm for RFID Network Planning Optimization

    Directory of Open Access Journals (Sweden)

    Lianbo Ma

    2014-01-01

    Full Text Available This paper presents a novel optimization algorithm, namely, hierarchical artificial bee colony optimization, called HABC, to tackle the radio frequency identification network planning (RNP problem. In the proposed multilevel model, the higher-level species can be aggregated by the subpopulations from lower level. In the bottom level, each subpopulation employing the canonical ABC method searches the part-dimensional optimum in parallel, which can be constructed into a complete solution for the upper level. At the same time, the comprehensive learning method with crossover and mutation operators is applied to enhance the global search ability between species. Experiments are conducted on a set of 10 benchmark optimization problems. The results demonstrate that the proposed HABC obtains remarkable performance on most chosen benchmark functions when compared to several successful swarm intelligence and evolutionary algorithms. Then HABC is used for solving the real-world RNP problem on two instances with different scales. Simulation results show that the proposed algorithm is superior for solving RNP, in terms of optimization accuracy and computation robustness.

  7. Optimization of Multiple Related Negotiation through Multi-Negotiation Network

    Science.gov (United States)

    Ren, Fenghui; Zhang, Minjie; Miao, Chunyan; Shen, Zhiqi

    In this paper, a Multi-Negotiation Network (MNN) and a Multi- Negotiation Influence Diagram (MNID) are proposed to optimally handle Multiple Related Negotiations (MRN) in a multi-agent system. Most popular, state-of-the-art approaches perform MRN sequentially. However, a sequential procedure may not optimally execute MRN in terms of maximizing the global outcome, and may even lead to unnecessary losses in some situations. The motivation of this research is to use a MNN to handle MRN concurrently so as to maximize the expected utility of MRN. Firstly, both the joint success rate and the joint utility by considering all related negotiations are dynamically calculated based on a MNN. Secondly, by employing a MNID, an agent's possible decision on each related negotiation is reflected by the value of expected utility. Lastly, through comparing expected utilities between all possible policies to conduct MRN, an optimal policy is generated to optimize the global outcome of MRN. The experimental results indicate that the proposed approach can improve the global outcome of MRN in a successful end scenario, and avoid unnecessary losses in an unsuccessful end scenario.

  8. Hierarchical artificial bee colony algorithm for RFID network planning optimization.

    Science.gov (United States)

    Ma, Lianbo; Chen, Hanning; Hu, Kunyuan; Zhu, Yunlong

    2014-01-01

    This paper presents a novel optimization algorithm, namely, hierarchical artificial bee colony optimization, called HABC, to tackle the radio frequency identification network planning (RNP) problem. In the proposed multilevel model, the higher-level species can be aggregated by the subpopulations from lower level. In the bottom level, each subpopulation employing the canonical ABC method searches the part-dimensional optimum in parallel, which can be constructed into a complete solution for the upper level. At the same time, the comprehensive learning method with crossover and mutation operators is applied to enhance the global search ability between species. Experiments are conducted on a set of 10 benchmark optimization problems. The results demonstrate that the proposed HABC obtains remarkable performance on most chosen benchmark functions when compared to several successful swarm intelligence and evolutionary algorithms. Then HABC is used for solving the real-world RNP problem on two instances with different scales. Simulation results show that the proposed algorithm is superior for solving RNP, in terms of optimization accuracy and computation robustness.

  9. Optimal assignment of multiple utilities in heat exchange networks

    International Nuclear Information System (INIS)

    Salama, A.I.A.

    2009-01-01

    Existing numerical geometry-based techniques, developed by [A.I.A. Salama, Numerical techniques for determining heat energy targets in pinch analysis, Computers and Chemical Engineering 29 (2005) 1861-1866; A.I.A. Salama, Determination of the optimal heat energy targets in heat pinch analysis using a geometry-based approach, Computers and Chemical Engineering 30 (2006) 758-764], have been extended to optimally assign multiple utilities in heat exchange network (HEN). These techniques utilize the horizontal shift between the cold composite curve (CC) and the stationary hot CC to determine the HEN optimal energy targets, grand composite curve (GCC), and the complement grand composite curve (CGCC). The proposed numerical technique developed in this paper is direct and simultaneously determines the optimal heat-energy targets and optimally assigns multiple utilities as compared with an existing technique based on sequential assignment of multiple utilities. The technique starts by arranging in an ascending order the HEN stream and target temperatures, and the resulting set is labelled T. Furthermore, the temperature sets where multiple utilities are introduced are arranged in an ascending order and are labelled T ic and T ih for the cold and hot sides, respectively. The graphical presentation of the results is facilitated by the insertion at each multiple-utility temperature a perturbed temperature equals the insertion temperature minus a small perturbation. Furthermore, using the heat exchanger network (HEN) minimum temperature-differential approach (ΔT min ) and stream heat-capacity flow rates, the presentation is facilitated by using the conventional temperature shift of the HEN CCs. The set of temperature-shifted stream and target temperatures and perturbed temperatures in the overlap range between the CCs is labelled T ol . Using T ol , a simple formula employing enthalpy-flow differences between the hot composite curve CC h and the cold composite curve CC c is

  10. Optimal Bidding Strategy for Renewable Microgrid with Active Network Management

    Directory of Open Access Journals (Sweden)

    Seung Wan Kim

    2016-01-01

    Full Text Available Active Network Management (ANM enables a microgrid to optimally dispatch the active/reactive power of its Renewable Distributed Generation (RDG and Battery Energy Storage System (BESS units in real time. Thus, a microgrid with high penetration of RDGs can handle their uncertainties and variabilities to achieve the stable operation using ANM. However, the actual power flow in the line connecting the main grid and microgrid may deviate significantly from the day-ahead bids if the bids are determined without consideration of the real-time adjustment through ANM, which will lead to a substantial imbalance cost. Therefore, this study proposes a formulation for obtaining an optimal bidding which reflects the change of power flow in the connecting line by real-time adjustment using ANM. The proposed formulation maximizes the expected profit of the microgrid considering various network and physical constraints. The effectiveness of the proposed bidding strategy is verified through the simulations with a 33-bus test microgrid. The simulation results show that the proposed bidding strategy improves the expected operating profit by reducing the imbalance cost to a greater degree compared to the basic bidding strategy without consideration of ANM.

  11. Proposal for optimal placement platform of bikes using queueing networks.

    Science.gov (United States)

    Mizuno, Shinya; Iwamoto, Shogo; Seki, Mutsumi; Yamaki, Naokazu

    2016-01-01

    In recent social experiments, rental motorbikes and rental bicycles have been arranged at nodes, and environments where users can ride these bikes have been improved. When people borrow bikes, they return them to nearby nodes. Some experiments have been conducted using the models of Hamachari of Yokohama, the Niigata Rental Cycle, and Bicing. However, from these experiments, the effectiveness of distributing bikes was unclear, and many models were discontinued midway. Thus, we need to consider whether these models are effectively designed to represent the distribution system. Therefore, we construct a model to arrange the nodes for distributing bikes using a queueing network. To adopt realistic values for our model, we use the Google Maps application program interface. Thus, we can easily obtain values of distance and transit time between nodes in various places in the world. Moreover, we apply the distribution of a population to a gravity model and we compute the effective transition probability for this queueing network. If the arrangement of the nodes and number of bikes at each node is known, we can precisely design the system. We illustrate our system using convenience stores as nodes and optimize the node configuration. As a result, we can optimize simultaneously the number of nodes, node places, and number of bikes for each node, and we can construct a base for a rental cycle business to use our system.

  12. Optimal power flow for distribution networks with distributed generation

    Directory of Open Access Journals (Sweden)

    Radosavljević Jordan

    2015-01-01

    Full Text Available This paper presents a genetic algorithm (GA based approach for the solution of the optimal power flow (OPF in distribution networks with distributed generation (DG units, including fuel cells, micro turbines, diesel generators, photovoltaic systems and wind turbines. The OPF is formulated as a nonlinear multi-objective optimization problem with equality and inequality constraints. Due to the stochastic nature of energy produced from renewable sources, i.e. wind turbines and photovoltaic systems, as well as load uncertainties, a probabilisticalgorithm is introduced in the OPF analysis. The Weibull and normal distributions are employed to model the input random variables, namely the wind speed, solar irradiance and load power. The 2m+1 point estimate method and the Gram Charlier expansion theory are used to obtain the statistical moments and the probability density functions (PDFs of the OPF results. The proposed approach is examined and tested on a modified IEEE 34 node test feeder with integrated five different DG units. The obtained results prove the efficiency of the proposed approach to solve both deterministic and probabilistic OPF problems for different forms of the multi-objective function. As such, it can serve as a useful decision-making supporting tool for distribution network operators. [Projekat Ministarstva nauke Republike Srbije, br. TR33046

  13. A One-Layer Recurrent Neural Network for Constrained Complex-Variable Convex Optimization.

    Science.gov (United States)

    Qin, Sitian; Feng, Jiqiang; Song, Jiahui; Wen, Xingnan; Xu, Chen

    2018-03-01

    In this paper, based on calculus and penalty method, a one-layer recurrent neural network is proposed for solving constrained complex-variable convex optimization. It is proved that for any initial point from a given domain, the state of the proposed neural network reaches the feasible region in finite time and converges to an optimal solution of the constrained complex-variable convex optimization finally. In contrast to existing neural networks for complex-variable convex optimization, the proposed neural network has a lower model complexity and better convergence. Some numerical examples and application are presented to substantiate the effectiveness of the proposed neural network.

  14. Femto-second synchronisation with a waveguide interferometer

    Science.gov (United States)

    Dexter, A. C.; Smith, S. J.; Woolley, B. J.; Grudiev, A.

    2018-03-01

    CERN's compact linear collider CLIC requires crab cavities on opposing linacs to rotate bunches of particles into alignment at the interaction point (IP). These cavities are located approximately 25 metres either side of the IP. The luminosity target requires synchronisation of their RF phases to better than 5 fs r.m.s. This is to be achieved by powering both cavities from one high power RF source, splitting the power and delivering it along two waveguide paths that are controlled to be identical in length to within a micrometre. The waveguide will be operated as an interferometer. A high power phase shifter for adjusting path lengths has been successfully developed and operated in an interferometer. The synchronisation target has been achieved in a low power prototype system.

  15. Evolutionary Artificial Neural Network Weight Tuning to Optimize Decision Making for an Abstract Game

    Science.gov (United States)

    2010-03-01

    EVOLUTIONARY ARTIFICIAL NEURAL NETWORK WEIGHT TUNING TO OPTIMIZE DECISION MAKING FOR AN ABSTRACT...AFIT/GCS/ENG/10-06 EVOLUTIONARY ARTIFICIAL NEURAL NETWORK WEIGHT TUNING TO OPTIMIZE DECISION MAKING FOR AN ABSTRACT GAME THESIS Presented...35 14: Diagram of pLoGANN’s Artificial Neural Network and

  16. OPTIMAL CONFIGURATION OF A COMMAND AND CONTROL NETWORK: BALANCING PERFORMANCE AND RECONFIGURATION CONSTRAINTS

    Energy Technology Data Exchange (ETDEWEB)

    L. DOWELL

    1999-07-01

    The optimization of the configuration of communications and control networks is important for assuring the reliability and performance of the networks. This paper presents techniques for determining the optimal configuration for such a network in the presence of communication and connectivity constraints.

  17. Optimization of RFID network planning using Zigbee and WSN

    Science.gov (United States)

    Hasnan, Khalid; Ahmed, Aftab; Badrul-aisham, Bakhsh, Qadir

    2015-05-01

    Everyone wants to be ease in their life. Radio frequency identification (RFID) wireless technology is used to make our life easier. RFID technology increases productivity, accuracy and convenience in delivery of service in supply chain. It is used for various applications such as preventing theft of automobiles, tolls collection without stopping, no checkout lines at grocery stores, managing traffic, hospital management, corporate campuses and airports, mobile asset tracking, warehousing, tracking library books, and to track a wealth of assets in supply chain management. Efficiency of RFID can be enhanced by integrating with wireless sensor network (WSN), zigbee mesh network and internet of things (IOT). The proposed system is used for identifying, sensing and real-time locating system (RTLS) of items in an indoor heterogeneous region. The system gives real-time richer information of object's characteristics, location and their environmental parameters like temperature, noise and humidity etc. RTLS reduce human error, optimize inventory management, increase productivity and information accuracy at indoor heterogeneous network. The power consumption and the data transmission rate of the system can be minimized by using low power hardware design.

  18. Optimal Retrofit Scheme for Highway Network under Seismic Hazards

    Directory of Open Access Journals (Sweden)

    Yongxi Huang

    2014-06-01

    Full Text Available Many older highway bridges in the United States (US are inadequate for seismic loads and could be severely damaged or collapsed in a relatively small earthquake. According to the most recent American Society of Civil Engineers’ infrastructure report card, one-third of the bridges in the US are rated as structurally deficient and many of these structurally deficient bridges are located in seismic zones. To improve this situation, at-risk bridges must be identified and evaluated and effective retrofitting programs should be in place to reduce their seismic vulnerabilities. In this study, a new retrofit strategy decision scheme for highway bridges under seismic hazards is developed and seamlessly integrate the scenario-based seismic analysis of bridges and the traffic network into the proposed optimization modeling framework. A full spectrum of bridge retrofit strategies is considered based on explicit structural assessment for each seismic damage state. As an empirical case study, the proposed retrofit strategy decision scheme is utilized to evaluate the bridge network in one of the active seismic zones in the US, Charleston, South Carolina. The developed modeling framework, on average, will help increase network throughput traffic capacity by 45% with a cost increase of only $15million for the Mw 5.5 event and increase the capacity fourfold with a cost of only $32m for the Mw 7.0 event.

  19. A Synchronisation Method For Informed Spread-Spectrum Audiowatermarking

    OpenAIRE

    Pierre-Yves Fulchiron; Barry O'Donovan; Guenole Silvestre; Neil Hurley

    2003-01-01

    Under perfect synchronisation conditions, watermarking schemes employing asymmetric spread-spectrum techniques are suitable for copy-protection of audio signals. This paper proposes to combine the use of a robust psychoacoustic projection for the extraction of a watermark feature vector along with non-linear detection functions optimised with side-information. The new proposed scheme benefits from an increased level of security through the use of asymmetric detectors. We apply this scheme to ...

  20. Algorithms for finding optimal paths in network games with p players

    Directory of Open Access Journals (Sweden)

    R. Boliac

    1997-08-01

    Full Text Available We study the problem of finding optimal paths in network games with p players. Some polynomial-time algorithms for finding optimal paths and optimal by Nash strategies of the players in network games with p players are proposed.

  1. Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks

    Science.gov (United States)

    Langner, Tobias; Schindelhauer, Christian; Souza, Alexander

    We consider an optimisation problem which is motivated from storage virtualisation in the Internet. While storage networks make use of dedicated hardware to provide homogeneous bandwidth between servers and clients, in the Internet, connections between storage servers and clients are heterogeneous and often asymmetric with respect to upload and download. Thus, for a large file, the question arises how it should be fragmented and distributed among the servers to grant "optimal" access to the contents. We concentrate on the transfer time of a file, which is the time needed for one upload and a sequence of n downloads, using a set of m servers with heterogeneous bandwidths. We assume that fragments of the file can be transferred in parallel to and from multiple servers. This model yields a distribution problem that examines the question of how these fragments should be distributed onto those servers in order to minimise the transfer time. We present an algorithm, called FlowScaling, that finds an optimal solution within running time {O}(m log m). We formulate the distribution problem as a maximum flow problem, which involves a function that states whether a solution with a given transfer time bound exists. This function is then used with a scaling argument to determine an optimal solution within the claimed time complexity.

  2. Designing Artificial Neural Networks Using Particle Swarm Optimization Algorithms.

    Science.gov (United States)

    Garro, Beatriz A; Vázquez, Roberto A

    2015-01-01

    Artificial Neural Network (ANN) design is a complex task because its performance depends on the architecture, the selected transfer function, and the learning algorithm used to train the set of synaptic weights. In this paper we present a methodology that automatically designs an ANN using particle swarm optimization algorithms such as Basic Particle Swarm Optimization (PSO), Second Generation of Particle Swarm Optimization (SGPSO), and a New Model of PSO called NMPSO. The aim of these algorithms is to evolve, at the same time, the three principal components of an ANN: the set of synaptic weights, the connections or architecture, and the transfer functions for each neuron. Eight different fitness functions were proposed to evaluate the fitness of each solution and find the best design. These functions are based on the mean square error (MSE) and the classification error (CER) and implement a strategy to avoid overtraining and to reduce the number of connections in the ANN. In addition, the ANN designed with the proposed methodology is compared with those designed manually using the well-known Back-Propagation and Levenberg-Marquardt Learning Algorithms. Finally, the accuracy of the method is tested with different nonlinear pattern classification problems.

  3. Feed Forward Neural Network and Optimal Control Problem with Control and State Constraints

    Science.gov (United States)

    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.

  4. Techniques for Pump-Probe Synchronisation of Fsec Radiation Pulses

    CERN Document Server

    Schlarb, Holger

    2005-01-01

    The increasing interest on the production of ultra-short photon pulses in future generations of Free-Electron Lasers operating in the UV, VUV or X-ray regime demands new techniques to reliably measure and control the arrival time of the FEL-pulses at the experiment. For pump-probe experiments using external optical lasers the desired synchronisation is in the order of tens of femtoseconds, the typical duration of the FEL pulse. Since, the accelerators are large scale facilities of the length of several hundred meters or even kilometers, the problem of synchronisation has to be attacked twofold. First, the RF acceleration sections upstream of the magnetic bunch compressors need to be stabilised in amplitude and phase to high precision. Second, the remain electron beam timing jitter needs to be determined with femtosecond accuracy for off-line analysis. In this talk, several techniques using the electron or the FEL beam to monitor the arrival time are presented, and the proposed layout of the synchronisation sy...

  5. Cosmogenic radionuclides as a synchronisation tool - present status

    Science.gov (United States)

    Muscheler, Raimund; Adolphi, Florian; Mekhaldi, Florian; Mellström, Anette; Svensson, Anders; Aldahan, Ala; Possnert, Göran

    2014-05-01

    Changes in the flux of galactic cosmic rays into Earth's atmosphere produce variations in the production rates of cosmogenic radionuclides. The resulting globally synchronous signal in cosmogenic radionuclide records can be used to compare time scales and synchronise climate records. The most prominent example is the 14C wiggle match dating approach where variations in the atmospheric 14C concentration are used to match climate records and the tree-ring based part of the 14C calibration record. This approach can be extended to other cosmogenic radionuclide records such as 10Be time series provided that the different geochemical behaviour of 10Be and 14C is taken into account. Here we will present some recent results that illustrate the potential of using cosmogenic radionuclide records for comparing and synchronising different time scales. The focus will be on the last 50000 years where we will show examples how geomagnetic field, solar activity and unusual short-term cosmic ray changes can be used for comparing ice core, tree ring and sediment time scales. We will discuss some unexpected offsets between Greenland ice core and 14C time scale and we will examine how far back in time solar induced 10Be and 14C variations presently can be used to reliably synchronise ice core and 14C time scales.

  6. Optimized energy-delay sub-network routing protocol development and implementation for wireless sensor networks

    International Nuclear Information System (INIS)

    Fonda, James W; Zawodniok, Maciej; Jagannathan, S; Watkins, Steve E

    2008-01-01

    The development and the implementation issues of a reactive optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSN) are introduced and its performance is contrasted with the popular ad hoc on-demand distance vector (AODV) routing protocol. Analytical results illustrate the performance of the proposed OEDSR protocol, while experimental results utilizing a hardware testbed under various scenarios demonstrate improvements in energy efficiency of the OEDSR protocol. A hardware platform constructed at the University of Missouri-Rolla (UMR), now the Missouri University of Science and Technology (MST), based on the Generation 4 Smart Sensor Node (G4-SSN) prototyping platform is also described. Performance improvements are shown in terms of end-to-end (E2E) delay, throughput, route-set-up time and drop rates and energy usage is given for three topologies, including a mobile topology. Additionally, results from the hardware testbed provide valuable lessons for network deployments. Under testing OEDSR provides a factor of ten improvement in the energy used in the routing session and extends network lifetime compared to AODV. Depletion experiments show that the time until the first node failure is extended by a factor of three with the network depleting and network lifetime is extended by 6.7%

  7. Algorithms for optimization of branching gravity-driven water networks

    Science.gov (United States)

    Dardani, Ian; Jones, Gerard F.

    2018-05-01

    The design of a water network involves the selection of pipe diameters that satisfy pressure and flow requirements while considering cost. A variety of design approaches can be used to optimize for hydraulic performance or reduce costs. To help designers select an appropriate approach in the context of gravity-driven water networks (GDWNs), this work assesses three cost-minimization algorithms on six moderate-scale GDWN test cases. Two algorithms, a backtracking algorithm and a genetic algorithm, use a set of discrete pipe diameters, while a new calculus-based algorithm produces a continuous-diameter solution which is mapped onto a discrete-diameter set. The backtracking algorithm finds the global optimum for all but the largest of cases tested, for which its long runtime makes it an infeasible option. The calculus-based algorithm's discrete-diameter solution produced slightly higher-cost results but was more scalable to larger network cases. Furthermore, the new calculus-based algorithm's continuous-diameter and mapped solutions provided lower and upper bounds, respectively, on the discrete-diameter global optimum cost, where the mapped solutions were typically within one diameter size of the global optimum. The genetic algorithm produced solutions even closer to the global optimum with consistently short run times, although slightly higher solution costs were seen for the larger network cases tested. The results of this study highlight the advantages and weaknesses of each GDWN design method including closeness to the global optimum, the ability to prune the solution space of infeasible and suboptimal candidates without missing the global optimum, and algorithm run time. We also extend an existing closed-form model of Jones (2011) to include minor losses and a more comprehensive two-part cost model, which realistically applies to pipe sizes that span a broad range typical of GDWNs of interest in this work, and for smooth and commercial steel roughness values.

  8. Algorithms for optimization of branching gravity-driven water networks

    Directory of Open Access Journals (Sweden)

    I. Dardani

    2018-05-01

    Full Text Available The design of a water network involves the selection of pipe diameters that satisfy pressure and flow requirements while considering cost. A variety of design approaches can be used to optimize for hydraulic performance or reduce costs. To help designers select an appropriate approach in the context of gravity-driven water networks (GDWNs, this work assesses three cost-minimization algorithms on six moderate-scale GDWN test cases. Two algorithms, a backtracking algorithm and a genetic algorithm, use a set of discrete pipe diameters, while a new calculus-based algorithm produces a continuous-diameter solution which is mapped onto a discrete-diameter set. The backtracking algorithm finds the global optimum for all but the largest of cases tested, for which its long runtime makes it an infeasible option. The calculus-based algorithm's discrete-diameter solution produced slightly higher-cost results but was more scalable to larger network cases. Furthermore, the new calculus-based algorithm's continuous-diameter and mapped solutions provided lower and upper bounds, respectively, on the discrete-diameter global optimum cost, where the mapped solutions were typically within one diameter size of the global optimum. The genetic algorithm produced solutions even closer to the global optimum with consistently short run times, although slightly higher solution costs were seen for the larger network cases tested. The results of this study highlight the advantages and weaknesses of each GDWN design method including closeness to the global optimum, the ability to prune the solution space of infeasible and suboptimal candidates without missing the global optimum, and algorithm run time. We also extend an existing closed-form model of Jones (2011 to include minor losses and a more comprehensive two-part cost model, which realistically applies to pipe sizes that span a broad range typical of GDWNs of interest in this work, and for smooth and commercial steel

  9. Selecting Optimal Parameters of Random Linear Network Coding for Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Heide, J; Zhang, Qi; Fitzek, F H P

    2013-01-01

    This work studies how to select optimal code parameters of Random Linear Network Coding (RLNC) in Wireless Sensor Networks (WSNs). With Rateless Deluge [1] the authors proposed to apply Network Coding (NC) for Over-the-Air Programming (OAP) in WSNs, and demonstrated that with NC a significant...... reduction in the number of transmitted packets can be achieved. However, NC introduces additional computations and potentially a non-negligible transmission overhead, both of which depend on the chosen coding parameters. Therefore it is necessary to consider the trade-off that these coding parameters...... present in order to obtain the lowest energy consumption per transmitted bit. This problem is analyzed and suitable coding parameters are determined for the popular Tmote Sky platform. Compared to the use of traditional RLNC, these parameters enable a reduction in the energy spent per bit which grows...

  10. Spiking neural networks for handwritten digit recognition-Supervised learning and network optimization.

    Science.gov (United States)

    Kulkarni, Shruti R; Rajendran, Bipin

    2018-07-01

    We demonstrate supervised learning in Spiking Neural Networks (SNNs) for the problem of handwritten digit recognition using the spike triggered Normalized Approximate Descent (NormAD) algorithm. Our network that employs neurons operating at sparse biological spike rates below 300Hz achieves a classification accuracy of 98.17% on the MNIST test database with four times fewer parameters compared to the state-of-the-art. We present several insights from extensive numerical experiments regarding optimization of learning parameters and network configuration to improve its accuracy. We also describe a number of strategies to optimize the SNN for implementation in memory and energy constrained hardware, including approximations in computing the neuronal dynamics and reduced precision in storing the synaptic weights. Experiments reveal that even with 3-bit synaptic weights, the classification accuracy of the designed SNN does not degrade beyond 1% as compared to the floating-point baseline. Further, the proposed SNN, which is trained based on the precise spike timing information outperforms an equivalent non-spiking artificial neural network (ANN) trained using back propagation, especially at low bit precision. Thus, our study shows the potential for realizing efficient neuromorphic systems that use spike based information encoding and learning for real-world applications. Copyright © 2018 Elsevier Ltd. All rights reserved.

  11. Control of the formation of projective synchronisation in lower-dimensional discrete-time systems

    International Nuclear Information System (INIS)

    Chee, C.Y.; Xu Daolin

    2003-01-01

    Projective synchronisation was recently observed in partially linear discrete-time systems. The scaling factor that characterises the behaviour of projective synchronisation is however unpredictable. In order to manipulate the ultimate state of the synchronisation, a control algorithm based on Schur-Chon stability criteria is proposed to direct the scaling factor onto any predestined value. In the numerical experiment, we illustrate the application on two chaotic discrete-time systems

  12. The existence of generalized synchronisation of three bidirectionally coupled chaotic systems

    International Nuclear Information System (INIS)

    Ai-Hua, Hu; Zhen-Yuan, Xu; Liu-Xiao, Guo

    2010-01-01

    The existence of two types of generalized synchronisation is studied. The model considered here includes three bidirectionally coupled chaotic systems, and two of them denote the driving systems, while the rest stands for the response system. Under certain conditions, the existence of generalised synchronisation can be turned to a problem of compression fixed point in the family of Lipschitz functions. In addition, theoretical proofs are proposed to the exponential attractive property of generalised synchronisation manifold. Numerical simulations validate the theory. (general)

  13. Towards probabilistic synchronisation of local controllers

    Czech Academy of Sciences Publication Activity Database

    Herzallah, R.; Kárný, Miroslav

    2017-01-01

    Roč. 48, č. 3 (2017), s. 604-615 ISSN 0020-7721 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : cooperative control * optimal control * complex system s * stochastic system s * fully probabilistic desing Subject RIV: BB - Applied Statistics, Operational Research OBOR OECD: Statistics and probability Impact factor: 2.285, year: 2016

  14. Outage Analysis and Optimization of SWIPT in Network-Coded Two-Way Relay Networks

    Directory of Open Access Journals (Sweden)

    Ruihong Jiang

    2017-01-01

    Full Text Available This paper investigates the outage performance of simultaneous wireless information and power transfer (SWIPT in network-coded two-way relay systems, where a relay first harvests energy from the signals transmitted by two sources and then uses the harvested energy to forward the received information to the two sources. We consider two transmission protocols, power splitting two-way relay (PS-TWR and time switching two-way relay (TS-TWR protocols. We present two explicit expressions for the system outage probability of the two protocols and further derive approximate expressions for them in high and low SNR cases. To explore the system performance limits, two optimization problems are formulated to minimize the system outage probability. Since the problems are nonconvex and have no known solution methods, a genetic algorithm- (GA- based algorithm is designed. Numerical and simulation results validate our theoretical analysis. It is shown that, by jointly optimizing the time assignment and SWIPT receiver parameters, a great performance gain can be achieved for both PS-TWR and TS-TWR. Moreover, the optimized PS-TWR always outperforms the optimized TS-TWR in terms of outage performance. Additionally, the effects of parameters including relay location and transmit powers are also discussed, which provide some insights for the SWIPT-enabled two-way relay networks.

  15. Research on robust optimization of emergency logistics network considering the time dependence characteristic

    Science.gov (United States)

    WANG, Qingrong; ZHU, Changfeng; LI, Ying; ZHANG, Zhengkun

    2017-06-01

    Considering the time dependence of emergency logistic network and complexity of the environment that the network exists in, in this paper the time dependent network optimization theory and robust discrete optimization theory are combined, and the emergency logistics dynamic network optimization model with characteristics of robustness is built to maximize the timeliness of emergency logistics. On this basis, considering the complexity of dynamic network and the time dependence of edge weight, an improved ant colony algorithm is proposed to realize the coupling of the optimization algorithm and the network time dependence and robustness. Finally, a case study has been carried out in order to testify validity of this robustness optimization model and its algorithm, and the value of different regulation factors was analyzed considering the importance of the value of the control factor in solving the optimal path. Analysis results show that this model and its algorithm above-mentioned have good timeliness and strong robustness.

  16. Optimal siting of capacitors in radial distribution network using Whale Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    D.B. Prakash

    2017-12-01

    Full Text Available In present days, continuous effort is being made in bringing down the line losses of the electrical distribution networks. Therefore proper allocation of capacitors is of utmost importance because, it will help in reducing the line losses and maintaining the bus voltage. This in turn results in improving the stability and reliability of the system. In this paper Whale Optimization Algorithm (WOA is used to find optimal sizing and placement of capacitors for a typical radial distribution system. Multi objectives such as operating cost reduction and power loss minimization with inequality constraints on voltage limits are considered and the proposed algorithm is validated by applying it on standard radial systems: IEEE-34 bus and IEEE-85 bus radial distribution test systems. The results obtained are compared with those of existing algorithms. The results show that the proposed algorithm is more effective in bringing down the operating costs and in maintaining better voltage profile. Keywords: Whale Optimization Algorithm (WOA, Optimal allocation and sizing of capacitors, Power loss reduction and voltage stability improvement, Radial distribution system, Operating cost minimization

  17. Synchronisation in coupled quantum Hamiltonian superconducting oscillator via a control potential

    International Nuclear Information System (INIS)

    Al-Khawaja, Sameer

    2009-01-01

    This paper presents chaos synchronisation in a SQUID device mutually coupled to a resonant LC classical circuit. Via the Hamiltonian of the coupled quantum-classical system and by means of a 'control potential' in the form of a double-well, measure synchronisation has been found to exist. A transition from quasi-periodic to chaotically synchronised orbits in the phase space has been observed, as the strength of coupling is increased between both oscillators. The system reaches a non-synchronised state if the choice of the control potential were to render both oscillators non-identical.

  18. On the Expressive Power of Polyadic Synchronisation in Pi-Calculus

    DEFF Research Database (Denmark)

    Carbone, Marco; Maffeis, Sergio

    2003-01-01

    We extend the π-calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of π-calculus, we suggest that it permits divergence-free encodings of distributed calculi......, and we show that a limited form of polyadic synchronisation can be encoded weakly in π-calculus. After showing that matching cannot be derived in π-calculus, we compare the expressivity of polyadic synchronisation, mixed choice and matching. In particular we show that the degree of synchronisation...

  19. Modeling and optimization of cloud-ready and content-oriented networks

    CERN Document Server

    Walkowiak, Krzysztof

    2016-01-01

    This book focuses on modeling and optimization of cloud-ready and content-oriented networks in the context of different layers and accounts for specific constraints following from protocols and technologies used in a particular layer. It addresses a wide range of additional constraints important in contemporary networks, including various types of network flows, survivability issues, multi-layer networking, and resource location. The book presents recent existing and new results in a comprehensive and cohesive way. The contents of the book are organized in five chapters, which are mostly self-contained. Chapter 1 briefly presents information on cloud computing and content-oriented services, and introduces basic notions and concepts of network modeling and optimization. Chapter 2 covers various optimization problems that arise in the context of connection-oriented networks. Chapter 3 focuses on modeling and optimization of Elastic Optical Networks. Chapter 4 is devoted to overlay networks. The book concludes w...

  20. Optimization of patterns of control bars using neural networks

    International Nuclear Information System (INIS)

    Mejia S, D.M.; Ortiz S, J.J.

    2005-01-01

    In this work the RENOPBC system that is based on a recurrent multi state neural network, for the optimization of patterns of control bars in a cycle of balance of a boiling water reactor (BWR for their initials in English) is presented. The design of patterns of bars is based on the execution of operation thermal limits, to maintain criticizes the reactor and that the axial profile of power is adjusted to one predetermined along several steps of burnt. The patterns of control bars proposed by the system are comparable to those proposed by human experts with many hour-man of experience. These results are compared with those proposed by other techniques as genetic algorithms, colonies of ants and tabu search for the same operation cycle. As consequence it is appreciated that the proposed patterns of control bars, have bigger operation easiness that those proposed by the other techniques. (Author)

  1. Routing Optimization of AVB Streams in TSN Networks

    DEFF Research Database (Denmark)

    Laursen, Sune Mølgaard; Pop, Paul; Steiner, Wilfried

    2016-01-01

    In this paper we are interested in safety-critical real-time applications implemented on distributed architectures using the Time-Sensitive Networking (TSN) standard. The ongoing standardization of TSN is an IEEE effort to bring deterministic real-time capabilities into the IEEE 802.1 Ethernet...... standard supporting safety-critical systems and guaranteed Quality-of-Service. TSN will support Time-Triggered (TT) communication based on schedule tables, Audio-Video-Bridging (AVB) streams with bounded end-to-end latency as well as Best-Effort messages. We consider that we know the topology...... Procedure (GRASP)-based heuristic for this routing optimization problem. The proposed approaches has been evaluated using several test cases....

  2. Optimal Time Allocation in Backscatter Assisted Wireless Powered Communication Networks

    Science.gov (United States)

    Lyu, Bin; Yang, Zhen; Gui, Guan; Sari, Hikmet

    2017-01-01

    This paper proposes a wireless powered communication network (WPCN) assisted by backscatter communication (BackCom). This model consists of a power station, an information receiver and multiple users that can work in either BackCom mode or harvest-then-transmit (HTT) mode. The time block is mainly divided into two parts corresponding to the data backscattering and transmission periods, respectively. The users first backscatter data to the information receiver in time division multiple access (TDMA) during the data backscattering period. When one user works in the BackCom mode, the other users harvest energy from the power station. During the data transmission period, two schemes, i.e., non-orthogonal multiple access (NOMA) and TDMA, are considered. To maximize the system throughput, the optimal time allocation policies are obtained. Simulation results demonstrate the superiority of the proposed model. PMID:28587171

  3. Optimal Dimensioning of Broadband Integrated Services Digital Network

    Directory of Open Access Journals (Sweden)

    Zdenka Chmelikova

    2005-01-01

    Full Text Available Tasks of this paper are research of input flow statistic parametres influence and parameters demands relating to VP (Virtual Path or VC (Virtual Channel dimensioning. However it is necessary to consider different time of flow arrival and differend time of holding time during connection level. Process of input flow arrival is considered as Poisson process. Holding time is considered as exponential function. Permanent allocation of VP is made by separate VP, where each of VPs enable transmitting offered laod with explicit bandwidth and explicit loss. The mathematic model was created to verify the above mentioned dependences for different types of telecomunications signals and different input flows. "Comnet III" software was selected for experimental verification of process optimization. The simulation model was based on thiss software, which simulate ATM network traffic in behalf of different input flow.

  4. Optimization of power distribution networks; Optimierung von Energieverteilungsnetzen

    Energy Technology Data Exchange (ETDEWEB)

    Casteren, J. van [Digsilent GmbH (Netherlands); Chalmers Univ. of Technology, Goeteborg (Sweden)

    2000-03-01

    In a competition-oriented power market the optimization of distribution networks is more and more becoming a search for minimum investment and operating cost where all relevant cost factors should be taken into account. A so far neglected factor is the expectation of reliability-related cost. A new analytical calculation method permits flexible, realistic estimation of interruption costs to be expected. (orig.) [German] In einem wettbewerbsorientierten Strom-Markt wird die Optimierung der Verteilungsnetze mehr und mehr zu einer Suche nach den minimalen Investitions- und Betriebskosten, wobei moeglichst alle relevanten Kostenfaktoren beruecksichtigt werden muessen. Ein bisher vernachlaessigter Faktor ist dabei die Erwartung der zuverlaessigkeitsbedingten Kosten. Ein neues analytisches Berechnungsverfahren erlaubt nun flexibel eine realistische Abschaetzung der zu erwarteten Unterbrechungskosten. (orig.)

  5. Optimal and secure measurement protocols for quantum sensor networks

    Science.gov (United States)

    Eldredge, Zachary; Foss-Feig, Michael; Gross, Jonathan A.; Rolston, S. L.; Gorshkov, Alexey V.

    2018-04-01

    Studies of quantum metrology have shown that the use of many-body entangled states can lead to an enhancement in sensitivity when compared with unentangled states. In this paper, we quantify the metrological advantage of entanglement in a setting where the measured quantity is a linear function of parameters individually coupled to each qubit. We first generalize the Heisenberg limit to the measurement of nonlocal observables in a quantum network, deriving a bound based on the multiparameter quantum Fisher information. We then propose measurement protocols that can make use of Greenberger-Horne-Zeilinger (GHZ) states or spin-squeezed states and show that in the case of GHZ states the protocol is optimal, i.e., it saturates our bound. We also identify nanoscale magnetic resonance imaging as a promising setting for this technology.

  6. Application of Neural Network Optimized by Mind Evolutionary Computation in Building Energy Prediction

    Science.gov (United States)

    Song, Chen; Zhong-Cheng, Wu; Hong, Lv

    2018-03-01

    Building Energy forecasting plays an important role in energy management and plan. Using mind evolutionary algorithm to find the optimal network weights and threshold, to optimize the BP neural network, can overcome the problem of the BP neural network into a local minimum point. The optimized network is used for time series prediction, and the same month forecast, to get two predictive values. Then two kinds of predictive values are put into neural network, to get the final forecast value. The effectiveness of the method was verified by experiment with the energy value of three buildings in Hefei.

  7. Optimal brain network synchrony visualization: application in an alcoholism paradigm.

    Science.gov (United States)

    Sakkalis, Vangelis; Tsiaras, Vassilis; Zervakis, Michalis; Tollis, Ioannis

    2007-01-01

    Although Electroencephalographic (EEG) signal synchronization studies have been a topic of increasing interest lately, there is no similar effort in the visualization of such measures. In this direction a graph-theoretic approach devised to study and stress the coupling dynamics of task-performing dynamical networks is proposed. Both linear and nonlinear interdependence measures are investigated in an alcoholism paradigm during mental rehearsal of pictures, which is known to reflect synchronization impairment. More specifically, the widely used magnitude squared coherence; phase synchronization and a robust nonlinear state-space generalized synchronization assessment method are investigated. This paper mostly focuses on a signal-based technique of selecting the optimal visualization threshold using surrogate datasets to correctly identify the most significant correlation patterns. Furthermore, a graph statistical parameter attempts to capture and quantify collective motifs present in the functional brain network. The results are in accordance with previous psychophysiology studies suggesting that an alcoholic subject has impaired synchronization of brain activity and loss of lateralization during the rehearsal process, most prominently in alpha (8-12 Hz) band, as compared to a control subject. Lower beta (13-30 Hz) synchronization was also evident in the alcoholic subject.

  8. Optimized Reputable Sensing Participants Extraction for Participatory Sensor Networks

    Directory of Open Access Journals (Sweden)

    Weiwei Yuan

    2014-01-01

    Full Text Available By collecting data via sensors embedded personal smart devices, sensing participants play a key role in participatory sensor networks. Using information provided by reputable sensing participants ensures the reliability of participatory sensing data. Setting a threshold for the reputation, and those whose reputations are bigger than this value are regarded as reputable. The bigger the threshold value is, the more reliable the extracted reputable sensing participant is. However, if the threshold value is too big, only very limited participatory sensing data can be involved. This may cause unexpected bias in information collection. Existing works did not consider the relationship between the reliability of extracted reputable sensing participants and the ratio of usable participatory sensing data. In this work, we propose a criterion for optimized reputable sensing participant extraction in participatory sensor networks. This is achieved based on the mathematical analysis on the ratio of available participatory sensing data and the reliability of extracted reputable sensing participants. Our suggested threshold value for reputable sensing participant extraction is only related to the power of sensing participant’s reputation distribution. It is easy to be applied in real applications. Simulation results tested on real application data further verified the effectiveness of our proposed method.

  9. Optimal Node Placement in Underwater Acoustic Sensor Network

    KAUST Repository

    Felemban, Muhamad

    2011-10-01

    Almost 70% of planet Earth is covered by water. A large percentage of underwater environment is unexplored. In the past two decades, there has been an increase in the interest of exploring and monitoring underwater life among scientists and in industry. Underwater operations are extremely difficult due to the lack of cheap and efficient means. Recently, Wireless Sensor Networks have been introduced in underwater environment applications. However, underwater communication via acoustic waves is subject to several performance limitations, which makes the relevant research issues very different from those on land. In this thesis, we investigate node placement for building an initial Underwater Wireless Sensor Network infrastructure. Firstly, we formulated the problem into a nonlinear mathematic program with objectives of minimizing the total transmission loss under a given number of sensor nodes and targeted volume. We conducted experiments to verify the proposed formulation, which is solved using Matlab optimization tool. We represented each node with a truncated octahedron to fill out the 3D space. The truncated octahedrons are tiled in the 3D space with each node in the center where locations of the nodes are given using 3D coordinates. Results are supported using ns-3 simulator. Results from simulation are consistent with the obtained results from mathematical model with less than 10% error.

  10. Statistical process control using optimized neural networks: a case study.

    Science.gov (United States)

    Addeh, Jalil; Ebrahimzadeh, Ata; Azarbad, Milad; Ranaee, Vahid

    2014-09-01

    The most common statistical process control (SPC) tools employed for monitoring process changes are control charts. A control chart demonstrates that the process has altered by generating an out-of-control signal. This study investigates the design of an accurate system for the control chart patterns (CCPs) recognition in two aspects. First, an efficient system is introduced that includes two main modules: feature extraction module and classifier module. In the feature extraction module, a proper set of shape features and statistical feature are proposed as the efficient characteristics of the patterns. In the classifier module, several neural networks, such as multilayer perceptron, probabilistic neural network and radial basis function are investigated. Based on an experimental study, the best classifier is chosen in order to recognize the CCPs. Second, a hybrid heuristic recognition system is introduced based on cuckoo optimization algorithm (COA) algorithm to improve the generalization performance of the classifier. The simulation results show that the proposed algorithm has high recognition accuracy. Copyright © 2013 ISA. Published by Elsevier Ltd. All rights reserved.

  11. Finding the optimal Bayesian network given a constraint graph

    Directory of Open Access Journals (Sweden)

    Jacob M. Schreiber

    2017-07-01

    Full Text Available Despite recent algorithmic improvements, learning the optimal structure of a Bayesian network from data is typically infeasible past a few dozen variables. Fortunately, domain knowledge can frequently be exploited to achieve dramatic computational savings, and in many cases domain knowledge can even make structure learning tractable. Several methods have previously been described for representing this type of structural prior knowledge, including global orderings, super-structures, and constraint rules. While super-structures and constraint rules are flexible in terms of what prior knowledge they can encode, they achieve savings in memory and computational time simply by avoiding considering invalid graphs. We introduce the concept of a “constraint graph” as an intuitive method for incorporating rich prior knowledge into the structure learning task. We describe how this graph can be used to reduce the memory cost and computational time required to find the optimal graph subject to the encoded constraints, beyond merely eliminating invalid graphs. In particular, we show that a constraint graph can break the structure learning task into independent subproblems even in the presence of cyclic prior knowledge. These subproblems are well suited to being solved in parallel on a single machine or distributed across many machines without excessive communication cost.

  12. Coherent Network Optimizing of Rail-Based Urban Mass Transit

    Directory of Open Access Journals (Sweden)

    Ying Zhang

    2012-01-01

    Full Text Available An efficient public transport is more than ever a crucial factor when it comes to the quality of life and competitiveness of many cities and regions in Asia. In recent years, the rail-based urban mass transit has been regarded as one of the key means to overcoming the great challenges in Chinese megacities. The purpose of this study is going to develop a coherent network optimizing for rail-based urban mass transit to find the best alternatives for the user and to demonstrate how to meet sustainable development needs and to match the enormous capacity requirements simultaneously. This paper presents an introduction to the current situation of the important lines, and transfer points in the metro system Shanghai. The insufficient aspects are analyzed and evaluated; while the optimizing ideas and measurements are developed and concreted. A group of examples are used to illustrate the approach. The whole study could be used for the latest reference for other megacities which have to be confronted with the similar situations and processes with enormous dynamic travel and transport demands.

  13. Optimizing Soil Moisture Sampling Locations for Validation Networks for SMAP

    Science.gov (United States)

    Roshani, E.; Berg, A. A.; Lindsay, J.

    2013-12-01

    Soil Moisture Active Passive satellite (SMAP) is scheduled for launch on Oct 2014. Global efforts are underway for establishment of soil moisture monitoring networks for both the pre- and post-launch validation and calibration of the SMAP products. In 2012 the SMAP Validation Experiment, SMAPVEX12, took place near Carman Manitoba, Canada where nearly 60 fields were sampled continuously over a 6 week period for soil moisture and several other parameters simultaneous to remotely sensed images of the sampling region. The locations of these sampling sites were mainly selected on the basis of accessibility, soil texture, and vegetation cover. Although these criteria are necessary to consider during sampling site selection, they do not guarantee optimal site placement to provide the most efficient representation of the studied area. In this analysis a method for optimization of sampling locations is presented which combines the state-of-art multi-objective optimization engine (non-dominated sorting genetic algorithm, NSGA-II), with the kriging interpolation technique to minimize the number of sampling sites while simultaneously minimizing the differences between the soil moisture map resulted from the kriging interpolation and soil moisture map from radar imaging. The algorithm is implemented in Whitebox Geospatial Analysis Tools, which is a multi-platform open-source GIS. The optimization framework is subject to the following three constraints:. A) sampling sites should be accessible to the crew on the ground, B) the number of sites located in a specific soil texture should be greater than or equal to a minimum value, and finally C) the number of sampling sites with a specific vegetation cover should be greater than or equal to a minimum constraint. The first constraint is implemented into the proposed model to keep the practicality of the approach. The second and third constraints are considered to guarantee that the collected samples from each soil texture categories

  14. Recurrent neural network for non-smooth convex optimization problems with application to the identification of genetic regulatory networks.

    Science.gov (United States)

    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.

  15. A One-Layer Recurrent Neural Network for Real-Time Portfolio Optimization With Probability Criterion.

    Science.gov (United States)

    Liu, Qingshan; Dang, Chuangyin; Huang, Tingwen

    2013-02-01

    This paper presents a decision-making model described by a recurrent neural network for dynamic portfolio optimization. The portfolio-optimization problem is first converted into a constrained fractional programming problem. Since the objective function in the programming problem is not convex, the traditional optimization techniques are no longer applicable for solving this problem. Fortunately, the objective function in the fractional programming is pseudoconvex on the feasible region. It leads to a one-layer recurrent neural network modeled by means of a discontinuous dynamic system. To ensure the optimal solutions for portfolio optimization, the convergence of the proposed neural network is analyzed and proved. In fact, the neural network guarantees to get the optimal solutions for portfolio-investment advice if some mild conditions are satisfied. A numerical example with simulation results substantiates the effectiveness and illustrates the characteristics of the proposed neural network.

  16. Optimizing Low Speed VoIP Network for Rural Next Generation Network (R-NGN

    Directory of Open Access Journals (Sweden)

    Yoanes Bandung

    2007-11-01

    Full Text Available In this research, we propose an optimization method based-on E-Model for designing an efficient low speed VoIP network for Rural Next Generation Network (R-NGN. We are choosing 128 kbps and 256 kbps bandwidth as the typical community link to be used in the designing of R-NGN infrastructure. The method is based on selection of some VoIP network parameters such as voice coder, communication protocol, packet loss level, network utilization and resource allocation. We draw analytic approach for achieving rating value (R of E-model that represent level of quality of service. In this approach, we focus on delay and packet loss calculation to find the rating value. We state the rating value = 70 as minimum level of quality of service for each call, equivalent to 3.6 of Mean Opinion Score (MOS. In our experiments, either G.723.1 5.3 kbps or G.729 is chosen for maximizing the number of VoIP calls, it depends on link utilization and level of packet loss.

  17. Jointly Optimize Data Augmentation and Network Training: Adversarial Data Augmentation in Human Pose Estimation

    OpenAIRE

    Peng, Xi; Tang, Zhiqiang; Yang, Fei; Feris, Rogerio; Metaxas, Dimitris

    2018-01-01

    Random data augmentation is a critical technique to avoid overfitting in training deep neural network models. However, data augmentation and network training are usually treated as two isolated processes, limiting the effectiveness of network training. Why not jointly optimize the two? We propose adversarial data augmentation to address this limitation. The main idea is to design an augmentation network (generator) that competes against a target network (discriminator) by generating `hard' au...

  18. Market Share Delegation in a Bertrand Duopoly: Synchronisation and Multistability

    Directory of Open Access Journals (Sweden)

    Luciano Fanti

    2015-01-01

    Full Text Available This paper tackles the issue of local and global analyses of a duopoly game with price competition and market share delegation. The dynamics of the economy is characterised by a differentiable two-dimensional discrete time system. The paper stresses the importance of complementarity between products as a source of synchronisation in the long term, in contrast to the case of their substitutability. This means that when products are complements, players may coordinate their behaviour even if initial conditions are different. In addition, there exist multiple attractors so that even starting with similar conditions may end up generating very different dynamic patterns.

  19. A Synchronisation Method For Informed Spread-Spectrum Audiowatermarking

    Directory of Open Access Journals (Sweden)

    Pierre-Yves Fulchiron

    2003-12-01

    Full Text Available Under perfect synchronisation conditions, watermarking schemes employing asymmetric spread-spectrum techniques are suitable for copy-protection of audio signals. This paper proposes to combine the use of a robust psychoacoustic projection for the extraction of a watermark feature vector along with non-linear detection functions optimised with side-information. The new proposed scheme benefits from an increased level of security through the use of asymmetric detectors. We apply this scheme to real audio signals and experimental results show an increased robustness to desynchronisation attacks such as random cropping.

  20. A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks

    KAUST Repository

    Xia, Li

    2014-11-20

    This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.

  1. A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks

    KAUST Repository

    Xia, Li; Shihada, Basem

    2014-01-01

    This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.

  2. Optimization of heat exchanger networks using genetic algorithms

    International Nuclear Information System (INIS)

    Teyssedou, A.; Dipama, J.; Sorin, M.

    2004-01-01

    Most thermal processes encountered in the power industry (chemical, metallurgical, nuclear and thermal power stations) necessitate the transfer of large amounts of heat between fluids having different thermal potentials. A common practice applied to achieve such a requirement consists of using heat exchangers. In general, each current of fluid is conveniently cooled or heated independently from each other in the power plant. When the number of heat exchangers is large enough, however, a convenient arrangement of different flow currents may allow a considerable reduction in energy consumption to be obtained (Linnhoff and Hidmarsh, 1983). In such a case the heat exchangers form a 'Heat Exchanger Network' (HEN) that can be optimized to reduce the overall energy consumption. This type of optimization problem, involves two separates calculation procedures. First, it is necessary to optimize the topology of the HEN that will permit a reduction in energy consumption to be obtained. In a second step the power distribution across the HEN should be optimized without violating the second law of thermodynamics. The numerical treatment of this kind of problem requires the use of both discrete variables (for taking into account each heat exchanger unit) and continuous variables for handling the thermal load of each unit. It is obvious that for a large number of heat exchangers, the use of conventional calculation methods, i.e., Simplexe, becomes almost impossible. Therefore, in this paper we present a 'Genetic Algorithm' (GA), that has been implemented and successfully used to treat complex HENs, containing a large number of heat exchangers. As opposed to conventional optimization techniques that require the knowledge of the derivatives of a function, GAs start the calculation process from a large population of possible solutions of a given problem (Goldberg, 1999). Each possible solution is in turns evaluated according to a 'fitness' criterion obtained from an objective

  3. Model-based dynamic control and optimization of gas networks

    Energy Technology Data Exchange (ETDEWEB)

    Hofsten, Kai

    2001-07-01

    This work contributes to the research on control, optimization and simulation of gas transmission systems to support the dispatch personnel at gas control centres for the decision makings in the daily operation of the natural gas transportation systems. Different control and optimization strategies have been studied. The focus is on the operation of long distance natural gas transportation systems. Stationary optimization in conjunction with linear model predictive control using state space models is proposed for supply security, the control of quality parameters and minimization of transportation costs for networks offering transportation services. The result from the stationary optimization together with a reformulation of a simplified fluid flow model formulates a linear dynamic optimization model. This model is used in a finite time control and state constrained linear model predictive controller. The deviation from the control and the state reference determined from the stationary optimization is penalized quadratically. Because of the time varying status of infrastructure, the control space is also generally time varying. When the average load is expected to change considerably, a new stationary optimization is performed, giving a new state and control reference together with a new dynamic model that is used for both optimization and state estimation. Another proposed control strategy is a control and output constrained nonlinear model predictive controller for the operation of gas transmission systems. Here, the objective is also the security of the supply, quality control and minimization of transportation costs. An output vector is defined, which together with a control vector are both penalized quadratically from their respective references in the objective function. The nonlinear model predictive controller can be combined with a stationary optimization. At each sampling instant, a non convex nonlinear programming problem is solved giving a local minimum

  4. Supporting the Maritime Information Dominance: Optimizing Tactical Network for Biometric Data Sharing in Maritime Interdiction Operations

    Science.gov (United States)

    2015-03-01

    biometric data collection. Capture role- player mock biometric data including finger prints, iris scans, and facial recognition photos. (MOC training...MARITIME INFORMATION DOMINANCE: OPTIMIZING TACTICAL NETWORK FOR BIOMETRIC DATA SHARING IN MARITIME INTERDICTION OPERATIONS by Adam R. Sinsel...MARITIME INFORMATION DOMINANCE: OPTIMIZING TACTICAL NETWORK FOR BIOMETRIC DATA SHARING IN MARITIME INTERDICTION OPERATIONS 6. AUTHOR(S) Adam R

  5. Nonlinear feedback synchronisation control between fractional-order and integer-order chaotic systems

    International Nuclear Information System (INIS)

    Jia Li-Xin; Dai Hao; Hui Meng

    2010-01-01

    This paper focuses on the synchronisation between fractional-order and integer-order chaotic systems. Based on Lyapunov stability theory and numerical differentiation, a nonlinear feedback controller is obtained to achieve the synchronisation between fractional-order and integer-order chaotic systems. Numerical simulation results are presented to illustrate the effectiveness of this method

  6. Electromagnetic synchronisation of clocks with finite separation in a rotating system

    International Nuclear Information System (INIS)

    Cohen, J.M.; Moses, H.E.; Rosenblum, A.; Temple Univ., Philadelphia, PA

    1984-01-01

    For clocks on the vertices of a triangle, it is shown that clock synchronisation using electromagnetic signals between finitely spaced clocks in a rotating frame leads to the same synchronisation error as a closely spaced band of clocks along the same light path. In addition, the above result is generalised to n equally spaced clocks. (author)

  7. Nonparametric identification of nonlinear dynamic systems using a synchronisation-based method

    Science.gov (United States)

    Kenderi, Gábor; Fidlin, Alexander

    2014-12-01

    The present study proposes an identification method for highly nonlinear mechanical systems that does not require a priori knowledge of the underlying nonlinearities to reconstruct arbitrary restoring force surfaces between degrees of freedom. This approach is based on the master-slave synchronisation between a dynamic model of the system as the slave and the real system as the master using measurements of the latter. As the model synchronises to the measurements, it becomes an observer of the real system. The optimal observer algorithm in a least-squares sense is given by the Kalman filter. Using the well-known state augmentation technique, the Kalman filter can be turned into a dual state and parameter estimator to identify parameters of a priori characterised nonlinearities. The paper proposes an extension of this technique towards nonparametric identification. A general system model is introduced by describing the restoring forces as bilateral spring-dampers with time-variant coefficients, which are estimated as augmented states. The estimation procedure is followed by an a posteriori statistical analysis to reconstruct noise-free restoring force characteristics using the estimated states and their estimated variances. Observability is provided using only one measured mechanical quantity per degree of freedom, which makes this approach less demanding in the number of necessary measurement signals compared with truly nonparametric solutions, which typically require displacement, velocity and acceleration signals. Additionally, due to the statistical rigour of the procedure, it successfully addresses signals corrupted by significant measurement noise. In the present paper, the method is described in detail, which is followed by numerical examples of one degree of freedom (1DoF) and 2DoF mechanical systems with strong nonlinearities of vibro-impact type to demonstrate the effectiveness of the proposed technique.

  8. Optimal Allocation of Generalized Power Sources in Distribution Network Based on Multi-Objective Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Li Ran

    2017-01-01

    Full Text Available Optimal allocation of generalized power sources in distribution network is researched. A simple index of voltage stability is put forward. Considering the investment and operation benefit, the stability of voltage and the pollution emissions of generalized power sources in distribution network, a multi-objective optimization planning model is established. A multi-objective particle swarm optimization algorithm is proposed to solve the optimal model. In order to improve the global search ability, the strategies of fast non-dominated sorting, elitism and crowding distance are adopted in this algorithm. Finally, tested the model and algorithm by IEEE-33 node system to find the best configuration of GP, the computed result shows that with the generalized power reasonable access to the active distribution network, the investment benefit and the voltage stability of the system is improved, and the proposed algorithm has better global search capability.

  9. Risk-based optimization of pipe inspections in large underground networks with imprecise information

    International Nuclear Information System (INIS)

    Mancuso, A.; Compare, M.; Salo, A.; Zio, E.; Laakso, T.

    2016-01-01

    In this paper, we present a novel risk-based methodology for optimizing the inspections of large underground infrastructure networks in the presence of incomplete information about the network features and parameters. The methodology employs Multi Attribute Value Theory to assess the risk of each pipe in the network, whereafter the optimal inspection campaign is built with Portfolio Decision Analysis (PDA). Specifically, Robust Portfolio Modeling (RPM) is employed to identify Pareto-optimal portfolios of pipe inspections. The proposed methodology is illustrated by reporting a real case study on the large-scale maintenance optimization of the sewerage network in Espoo, Finland. - Highlights: • Risk-based approach to optimize pipe inspections on large underground networks. • Reasonable computational effort to select efficient inspection portfolios. • Possibility to accommodate imprecise expert information. • Feasibility of the approach shown by Espoo water system case study.

  10. Synchronisation of a femtosecond laser and a Q-switched laser to within 50 ps

    International Nuclear Information System (INIS)

    Katin, E V; Lozhkarev, V V; Palashov, O V; Khazanov, E A

    2003-01-01

    A Nd:YLF laser emitting 2-ns pulses synchronised with a femtosecond Cr:forsterite laser is built. The pulse duration and synchronisation are ensured by two Pockels cells, in which voltage pulses are synchronised with the femtosecond laser by fast emitter-coupled logic elements. One of the Pockels cells ensures Q-switching, while the other cuts a short pulse from a 15-ns Q-switched pulse. The experimental results show that the two-step scheme proposed for synchronisation of a Q-switched laser and a passively mode-locked laser provides quite simple and reliable synchronisation of these lasers with a jitter of a few tens of picoseconds. (control of laser radiation parameters)

  11. Network synthesis and parameter optimization for vehicle suspension with inerter

    Directory of Open Access Journals (Sweden)

    Long Chen

    2016-12-01

    Full Text Available In order to design a comfortable-oriented vehicle suspension structure, the network synthesis method was utilized to transfer the problem into solving a timing robust control problem and determine the structure of “inerter–spring–damper” suspension. Bilinear Matrix Inequality was utilized to obtain the timing transfer function. Then, the transfer function of suspension system can be physically implemented by passive elements such as spring, damper, and inerter. By analyzing the sensitivity and quantum genetic algorithm, the optimized parameters of inerter–spring–damper suspension were determined. A quarter-car model was established. The performance of the inerter–spring–damper suspension was verified under random input. The simulation results manifested that the dynamic performance of the proposed suspension was enhanced in contrast with traditional suspension. The root mean square of vehicle body acceleration decreases by 18.9%. The inerter–spring–damper suspension can inhibit the vertical vibration within the frequency of 1–3 Hz effectively and enhance the performance of ride comfort significantly.

  12. NLP model and stochastic multi-start optimization approach for heat exchanger networks

    International Nuclear Information System (INIS)

    Núñez-Serna, Rosa I.; Zamora, Juan M.

    2016-01-01

    Highlights: • An NLP model for the optimal design of heat exchanger networks is proposed. • The NLP model is developed from a stage-wise grid diagram representation. • A two-phase stochastic multi-start optimization methodology is utilized. • Improved network designs are obtained with different heat load distributions. • Structural changes and reductions in the number of heat exchangers are produced. - Abstract: Heat exchanger network synthesis methodologies frequently identify good network structures, which nevertheless, might be accompanied by suboptimal values of design variables. The objective of this work is to develop a nonlinear programming (NLP) model and an optimization approach that aim at identifying the best values for intermediate temperatures, sub-stream flow rate fractions, heat loads and areas for a given heat exchanger network topology. The NLP model that minimizes the total annual cost of the network is constructed based on a stage-wise grid diagram representation. To improve the possibilities of obtaining global optimal designs, a two-phase stochastic multi-start optimization algorithm is utilized for the solution of the developed model. The effectiveness of the proposed optimization approach is illustrated with the optimization of two network designs proposed in the literature for two well-known benchmark problems. Results show that from the addressed base network topologies it is possible to achieve improved network designs, with redistributions in exchanger heat loads that lead to reductions in total annual costs. The results also show that the optimization of a given network design sometimes leads to structural simplifications and reductions in the total number of heat exchangers of the network, thereby exposing alternative viable network topologies initially not anticipated.

  13. Optimization of hot water transport and distribution networks by analytical method: OPTAL program

    International Nuclear Information System (INIS)

    Barreau, Alain; Caizergues, Robert; Moret-Bailly, Jean

    1977-06-01

    This report presents optimization studies of hot water transport and distribution network by minimizing operating cost. Analytical optimization is used: Lagrange's method of undetermined multipliers. Optimum diameter of each pipe is calculated for minimum network operating cost. The characteristics of the computer program used for calculations, OPTAL, are given in this report. An example of network is calculated and described: 52 branches and 27 customers. Results are discussed [fr

  14. Near-Optimal Resource Allocation in Cooperative Cellular Networks Using Genetic Algorithms

    OpenAIRE

    Luo, Zihan; Armour, Simon; McGeehan, Joe

    2015-01-01

    This paper shows how a genetic algorithm can be used as a method of obtaining the near-optimal solution of the resource block scheduling problem in a cooperative cellular network. An exhaustive search is initially implementedto guarantee that the optimal result, in terms of maximizing the bandwidth efficiency of the overall network, is found, and then the genetic algorithm with the properly selected termination conditions is used in the same network. The simulation results show that the genet...

  15. Pareto evolution of gene networks: an algorithm to optimize multiple fitness objectives

    International Nuclear Information System (INIS)

    Warmflash, Aryeh; Siggia, Eric D; Francois, Paul

    2012-01-01

    The computational evolution of gene networks functions like a forward genetic screen to generate, without preconceptions, all networks that can be assembled from a defined list of parts to implement a given function. Frequently networks are subject to multiple design criteria that cannot all be optimized simultaneously. To explore how these tradeoffs interact with evolution, we implement Pareto optimization in the context of gene network evolution. In response to a temporal pulse of a signal, we evolve networks whose output turns on slowly after the pulse begins, and shuts down rapidly when the pulse terminates. The best performing networks under our conditions do not fall into categories such as feed forward and negative feedback that also encode the input–output relation we used for selection. Pareto evolution can more efficiently search the space of networks than optimization based on a single ad hoc combination of the design criteria. (paper)

  16. Pareto evolution of gene networks: an algorithm to optimize multiple fitness objectives.

    Science.gov (United States)

    Warmflash, Aryeh; Francois, Paul; Siggia, Eric D

    2012-10-01

    The computational evolution of gene networks functions like a forward genetic screen to generate, without preconceptions, all networks that can be assembled from a defined list of parts to implement a given function. Frequently networks are subject to multiple design criteria that cannot all be optimized simultaneously. To explore how these tradeoffs interact with evolution, we implement Pareto optimization in the context of gene network evolution. In response to a temporal pulse of a signal, we evolve networks whose output turns on slowly after the pulse begins, and shuts down rapidly when the pulse terminates. The best performing networks under our conditions do not fall into categories such as feed forward and negative feedback that also encode the input-output relation we used for selection. Pareto evolution can more efficiently search the space of networks than optimization based on a single ad hoc combination of the design criteria.

  17. Improved Artificial Fish Algorithm for Parameters Optimization of PID Neural Network

    OpenAIRE

    Jing Wang; Yourui Huang

    2013-01-01

    In order to solve problems such as initial weights are difficult to be determined, training results are easy to trap in local minima in optimization process of PID neural network parameters by traditional BP algorithm, this paper proposed a new method based on improved artificial fish algorithm for parameters optimization of PID neural network. This improved artificial fish algorithm uses a composite adaptive artificial fish algorithm based on optimal artificial fish and nearest artificial fi...

  18. Optimal stabilization of Boolean networks through collective influence

    Science.gov (United States)

    Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming

    2018-03-01

    Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.

  19. Function-Oriented Networking and On-Demand Routing System in Network Using Ant Colony Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Young-Bo Sim

    2017-11-01

    Full Text Available In this paper, we proposed and developed Function-Oriented Networking (FON, a platform for network users. It has a different philosophy as opposed to technologies for network managers of Software-Defined Networking technology, OpenFlow. It is a technology that can immediately reflect the demands of the network users in the network, unlike the existing OpenFlow and Network Functions Virtualization (NFV, which do not reflect directly the needs of the network users. It allows the network user to determine the policy of the direct network, so it can be applied more precisely than the policy applied by the network manager. This is expected to increase the satisfaction of the service users when the network users try to provide new services. We developed FON function that performs on-demand routing for Low-Delay Required service. We analyzed the characteristics of the Ant Colony Optimization (ACO algorithm and found that the algorithm is suitable for low-delay required services. It was also the first in the world to implement the routing software using ACO Algorithm in the real Ethernet network. In order to improve the routing performance, several algorithms of the ACO Algorithm have been developed to enable faster path search-routing and path recovery. The relationship between the network performance index and the ACO routing parameters is derived, and the results are compared and analyzed. Through this, it was possible to develop the ACO algorithm.

  20. Sewer Networks Optimization by Particle Swarm Optimization with Abilities of Fly-Back Mechanism and Harmony Memory

    Directory of Open Access Journals (Sweden)

    محسن نفیسی

    2014-10-01

    Full Text Available Lack of an efficient sewer network in urban areas threatens public health and may give rise to contagious diseases. Various optimization methods have been developed for use in designing sewers networks in response to a number of requirements such as the high costs of constructing sewer networks, financial limitations, the presence of both discrete and continuous decision variables, and the nonlinear time complexity of such design problems. In this study, the particle swarm optimization algorithm (PSO with the capability of “fly-back” mechanism equipped with the harmony search (HPSO is used for the optimization of sewers network designs. The objective function consists of minimizing the excavation and embedding costs of commercial pipes. The fly-back mechanism and the harmony memory method are used to prevent leaving out variables from the feasible space of the problem in an attempt to enhance model efficiency. Model constraints are satisfied at two levels, which leads to the desirable convergence of the PSO algorithm as compared to the conventional penalty methods in alternative evolutionary algorithms. In order to determine the admissible decision variables, the Manning equation is used as a hydraulic model. The performance of the proposed algorithm is shown by presenting two examples of sewer networks. Compared to the PSO algorithm used in sewer network optimization models, the proposed model exhibits a tangible improvement in cost reduction and a higher computational stability.

  1. Optimized Charging Scheduling with Single Mobile Charger for Wireless Rechargeable Sensor Networks

    Directory of Open Access Journals (Sweden)

    Qihua Wang

    2017-11-01

    Full Text Available Due to the rapid development of wireless charging technology, the recharging issue in wireless rechargeable sensor network (WRSN has been a popular research problem in the past few years. The weakness of previous work is that charging route planning is not reasonable. In this work, a dynamic optimal scheduling scheme aiming to maximize the vacation time ratio of a single mobile changer for WRSN is proposed. In the proposed scheme, the wireless sensor network is divided into several sub-networks according to the initial topology of deployed sensor networks. After comprehensive analysis of energy states, working state and constraints for different sensor nodes in WRSN, we transform the optimized charging path problem of the whole network into the local optimization problem of the sub networks. The optimized charging path with respect to dynamic network topology in each sub-network is obtained by solving an optimization problem, and the lifetime of the deployed wireless sensor network can be prolonged. Simulation results show that the proposed scheme has good and reliable performance for a small wireless rechargeable sensor network.

  2. Compensatory Analysis and Optimization for MADM for Heterogeneous Wireless Network Selection

    Directory of Open Access Journals (Sweden)

    Jian Zhou

    2016-01-01

    Full Text Available In the next-generation heterogeneous wireless networks, a mobile terminal with a multi-interface may have network access from different service providers using various technologies. In spite of this heterogeneity, seamless intersystem mobility is a mandatory requirement. One of the major challenges for seamless mobility is the creation of a network selection scheme, which is for users that select an optimal network with best comprehensive performance between different types of networks. However, the optimal network may be not the most reasonable one due to compensation of MADM (Multiple Attribute Decision Making, and the network is called pseudo-optimal network. This paper conducts a performance evaluation of a number of widely used MADM-based methods for network selection that aim to keep the mobile users always best connected anywhere and anytime, where subjective weight and objective weight are all considered. The performance analysis shows that the selection scheme based on MEW (weighted multiplicative method and combination weight can better avoid accessing pseudo-optimal network for balancing network load and reducing ping-pong effect in comparison with three other MADM solutions.

  3. Towards Optimal Buffer Size in Wi-Fi Networks

    KAUST Repository

    Showail, Ahmad

    2016-01-01

    extensively for wired networks. However, there is little work addressing the unique challenges of wireless environment. In this dissertation, we discuss buffer sizing challenges in wireless networks, classify the state-of-the-art solutions, and propose two

  4. Optimizing Virtual Network Functions Placement in Virtual Data Center Infrastructure Using Machine Learning

    Science.gov (United States)

    Bolodurina, I. P.; Parfenov, D. I.

    2018-01-01

    We have elaborated a neural network model of virtual network flow identification based on the statistical properties of flows circulating in the network of the data center and characteristics that describe the content of packets transmitted through network objects. This enabled us to establish the optimal set of attributes to identify virtual network functions. We have established an algorithm for optimizing the placement of virtual data functions using the data obtained in our research. Our approach uses a hybrid method of visualization using virtual machines and containers, which enables to reduce the infrastructure load and the response time in the network of the virtual data center. The algorithmic solution is based on neural networks, which enables to scale it at any number of the network function copies.

  5. Optimality principles in the regulation of metabolic networks

    NARCIS (Netherlands)

    Berkhout, J.; Bruggeman, F.J.; Teusink, B.

    2012-01-01

    One of the challenging tasks in systems biology is to understand how molecular networks give rise to emergent functionality and whether universal design principles apply to molecular networks. To achieve this, the biophysical, evolutionary and physiological constraints that act on those networks

  6. Optimal Software Strategies in the Presence of Network Externalities

    Science.gov (United States)

    Liu, Yipeng

    2009-01-01

    Network externalities or alternatively termed network effects are pervasive in computer software markets. While software vendors consider pricing strategies, they must also take into account the impact of network externalities on their sales. My main interest in this research is to describe a firm's strategies and behaviors in the presence of…

  7. Optimal cost for strengthening or destroying a given network

    Science.gov (United States)

    Patron, Amikam; Cohen, Reuven; Li, Daqing; Havlin, Shlomo

    2017-05-01

    Strengthening or destroying a network is a very important issue in designing resilient networks or in planning attacks against networks, including planning strategies to immunize a network against diseases, viruses, etc. Here we develop a method for strengthening or destroying a random network with a minimum cost. We assume a correlation between the cost required to strengthen or destroy a node and the degree of the node. Accordingly, we define a cost function c (k ) , which is the cost of strengthening or destroying a node with degree k . Using the degrees k in a network and the cost function c (k ) , we develop a method for defining a list of priorities of degrees and for choosing the right group of degrees to be strengthened or destroyed that minimizes the total price of strengthening or destroying the entire network. We find that the list of priorities of degrees is universal and independent of the network's degree distribution, for all kinds of random networks. The list of priorities is the same for both strengthening a network and for destroying a network with minimum cost. However, in spite of this similarity, there is a difference between their pc, the critical fraction of nodes that has to be functional to guarantee the existence of a giant component in the network.

  8. Epidemics in Networks : Modeling, Optimization and Security Games

    NARCIS (Netherlands)

    Omic, J.

    2010-01-01

    Epidemic theory has wide range of applications in computer networks, from spreading of malware to the information dissemination algorithms. Our society depends more strongly than ever on such computer networks. Many of these networks rely to a large extent on decentralization and self-organization.

  9. A one-layer recurrent neural network for constrained nonsmooth optimization.

    Science.gov (United States)

    Liu, Qingshan; Wang, Jun

    2011-10-01

    This paper presents a novel one-layer recurrent neural network modeled by means of a differential inclusion for solving nonsmooth optimization problems, in which the number of neurons in the proposed neural network is the same as the number of decision variables of optimization problems. Compared with existing neural networks for nonsmooth optimization problems, the global convexity condition on the objective functions and constraints is relaxed, which allows the objective functions and constraints to be nonconvex. It is proven that the state variables of the proposed neural network are convergent to optimal solutions if a single design parameter in the model is larger than a derived lower bound. Numerical examples with simulation results substantiate the effectiveness and illustrate the characteristics of the proposed neural network.

  10. The research on optimization of auto supply chain network robust model under macroeconomic fluctuations

    International Nuclear Information System (INIS)

    Guo, Chunxiang; Liu, Xiaoli; Jin, Maozhu; Lv, Zhihan

    2016-01-01

    Considering the uncertainty of the macroeconomic environment, the robust optimization method is studied for constructing and designing the automotive supply chain network, and based on the definition of robust solution a robust optimization model is built for integrated supply chain network design that consists of supplier selection problem and facility location–distribution problem. The tabu search algorithm is proposed for supply chain node configuration, analyzing the influence of the level of uncertainty on robust results, and by comparing the performance of supply chain network design through the stochastic programming model and robustness optimize model, on this basis, determining the rational layout of supply chain network under macroeconomic fluctuations. At last the contrastive test result validates that the performance of tabu search algorithm is outstanding on convergence and computational time. Meanwhile it is indicated that the robust optimization model can reduce investment risks effectively when it is applied to supply chain network design.

  11. Optimization of municipal pressure pumping station layout and sewage pipe network design

    Science.gov (United States)

    Tian, Jiandong; Cheng, Jilin; Gong, Yi

    2018-03-01

    Accelerated urbanization places extraordinary demands on sewer networks; thus optimization research to improve the design of these systems has practical significance. In this article, a subsystem nonlinear programming model is developed to optimize pumping station layout and sewage pipe network design. The subsystem model is expanded into a large-scale complex nonlinear programming system model to find the minimum total annual cost of the pumping station and network of all pipe segments. A comparative analysis is conducted using the sewage network in Taizhou City, China, as an example. The proposed method demonstrated that significant cost savings could have been realized if the studied system had been optimized using the techniques described in this article. Therefore, the method has practical value for optimizing urban sewage projects and provides a reference for theoretical research on optimization of urban drainage pumping station layouts.

  12. Joint Optimization of Receiver Placement and Illuminator Selection for a Multiband Passive Radar Network.

    Science.gov (United States)

    Xie, Rui; Wan, Xianrong; Hong, Sheng; Yi, Jianxin

    2017-06-14

    The performance of a passive radar network can be greatly improved by an optimal radar network structure. Generally, radar network structure optimization consists of two aspects, namely the placement of receivers in suitable places and selection of appropriate illuminators. The present study investigates issues concerning the joint optimization of receiver placement and illuminator selection for a passive radar network. Firstly, the required radar cross section (RCS) for target detection is chosen as the performance metric, and the joint optimization model boils down to the partition p -center problem (PPCP). The PPCP is then solved by a proposed bisection algorithm. The key of the bisection algorithm lies in solving the partition set covering problem (PSCP), which can be solved by a hybrid algorithm developed by coupling the convex optimization with the greedy dropping algorithm. In the end, the performance of the proposed algorithm is validated via numerical simulations.

  13. Complex fluid network optimization and control integrative design based on nonlinear dynamic model

    International Nuclear Information System (INIS)

    Sui, Jinxue; Yang, Li; Hu, Yunan

    2016-01-01

    In view of distribution according to complex fluid network’s needs, this paper proposed one optimization computation method of the nonlinear programming mathematical model based on genetic algorithm. The simulation result shows that the overall energy consumption of the optimized fluid network has a decrease obviously. The control model of the fluid network is established based on nonlinear dynamics. We design the control law based on feedback linearization, take the optimal value by genetic algorithm as the simulation data, can also solve the branch resistance under the optimal value. These resistances can provide technical support and reference for fluid network design and construction, so can realize complex fluid network optimization and control integration design.

  14. Optimal network structure in an open market environment

    International Nuclear Information System (INIS)

    2002-01-01

    The focus of this report is on network planning in the new environment of a liberalized electricity market. The development of the network is viewed from different stakeholders objectives. The stakeholders in the transmission network are groups or individuals who have a stake in, or an expectation of the development and performance of the network. An open network exists when all market players meet equal admission rights and obligations. This required that the grid be administered through a transparent set of rules such as a grid code. (author)

  15. Ripple-Spreading Network Model Optimization by Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Xiao-Bing Hu

    2013-01-01

    Full Text Available Small-world and scale-free properties are widely acknowledged in many real-world complex network systems, and many network models have been developed to capture these network properties. The ripple-spreading network model (RSNM is a newly reported complex network model, which is inspired by the natural ripple-spreading phenomenon on clam water surface. The RSNM exhibits good potential for describing both spatial and temporal features in the development of many real-world networks where the influence of a few local events spreads out through nodes and then largely determines the final network topology. However, the relationships between ripple-spreading related parameters (RSRPs of RSNM and small-world and scale-free topologies are not as obvious or straightforward as in many other network models. This paper attempts to apply genetic algorithm (GA to tune the values of RSRPs, so that the RSNM may generate these two most important network topologies. The study demonstrates that, once RSRPs are properly tuned by GA, the RSNM is capable of generating both network topologies and therefore has a great flexibility to study many real-world complex network systems.

  16. Turbofan engine diagnostics neuron network size optimization method which takes into account overlaerning effect

    Directory of Open Access Journals (Sweden)

    О.С. Якушенко

    2010-01-01

    Full Text Available  The article is devoted to the problem of gas turbine engine (GTE technical state class automatic recognition with operation parameters by neuron networks. The one of main problems for creation the neuron networks is determination of their optimal structures size (amount of layers in network and count of neurons in each layer.The method of neuron network size optimization intended for classification of GTE technical state is considered in the article. Optimization is cared out with taking into account of overlearning effect possibility when a learning network loses property of generalization and begins strictly describing educational data set. To determinate a moment when overlearning effect is appeared in learning neuron network the method  of three data sets is used. The method is based on the comparison of recognition quality parameters changes which were calculated during recognition of educational and control data sets. As the moment when network overlearning effect is appeared the moment when control data set recognition quality begins deteriorating but educational data set recognition quality continues still improving is used. To determinate this moment learning process periodically is terminated and simulation of network with education and control data sets is fulfilled. The optimization of two-, three- and four-layer networks is conducted and some results of optimization are shown. Also the extended educational set is created and shown. The set describes 16 GTE technical state classes and each class is represented with 200 points (200 possible technical state class realizations instead of 20 points using in the former articles. It was done to increase representativeness of data set.In the article the algorithm of optimization is considered and some results which were obtained with it are shown. The results of experiments were analyzed to determinate most optimal neuron network structure. This structure provides most high-quality GTE

  17. A Two-Stage Robust Optimization for Centralized-Optimal Dispatch of Photovoltaic Inverters in Active Distribution Networks

    DEFF Research Database (Denmark)

    Ding, Tao; Li, Cheng; Yang, Yongheng

    2017-01-01

    Optimally dispatching Photovoltaic (PV) inverters is an efficient way to avoid overvoltage in active distribution networks, which may occur in the case of PV generation surplus load demand. Typically, the dispatching optimization objective is to identify critical PV inverters that have the most...... nature of solar PV energy may affect the selection of the critical PV inverters and also the final optimal objective value. In order to address this issue, a two-stage robust optimization model is proposed in this paper to achieve a robust optimal solution to the PV inverter dispatch, which can hedge...... against any possible realization within the uncertain PV outputs. In addition, the conic relaxation-based branch flow formulation and second-order cone programming based column-and-constraint generation algorithm are employed to deal with the proposed robust optimization model. Case studies on a 33-bus...

  18. A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints

    International Nuclear Information System (INIS)

    Liu, Xiaolan; Zhou, Mi

    2016-01-01

    In this paper, a one-layer recurrent network is proposed for solving a non-smooth convex optimization subject to linear inequality constraints. Compared with the existing neural networks for optimization, the proposed neural network is capable of solving more general convex optimization with linear inequality constraints. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds.

  19. A practical algorithm for optimal operation management of distribution network including fuel cell power plants

    Energy Technology Data Exchange (ETDEWEB)

    Niknam, Taher; Meymand, Hamed Zeinoddini; Nayeripour, Majid [Electrical and Electronic Engineering Department, Shiraz University of Technology, Shiraz (Iran)

    2010-08-15

    Fuel cell power plants (FCPPs) have been taken into a great deal of consideration in recent years. The continuing growth of the power demand together with environmental constraints is increasing interest to use FCPPs in power system. Since FCPPs are usually connected to distribution network, the effect of FCPPs on distribution network is more than other sections of power system. One of the most important issues in distribution networks is optimal operation management (OOM) which can be affected by FCPPs. This paper proposes a new approach for optimal operation management of distribution networks including FCCPs. In the article, we consider the total electrical energy losses, the total electrical energy cost and the total emission as the objective functions which should be minimized. Whereas the optimal operation in distribution networks has a nonlinear mixed integer optimization problem, the optimal solution could be obtained through an evolutionary method. We use a new evolutionary algorithm based on Fuzzy Adaptive Particle Swarm Optimization (FAPSO) to solve the optimal operation problem and compare this method with Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Ant Colony Optimization (ACO) and Tabu Search (TS) over two distribution test feeders. (author)

  20. Probing the universality of synchronised hair around rotating black holes with Q-clouds

    Science.gov (United States)

    Herdeiro, Carlos; Kunz, Jutta; Radu, Eugen; Subagyo, Bintoro

    2018-04-01

    Recently, various families of black holes (BHs) with synchronised hair have been constructed. These are rotating BHs surrounded, as fully non-linear solutions of the appropriate Einstein-matter model, by a non-trivial bosonic field in synchronised rotation with the BH horizon. Some families bifurcate globally from a bald BH (e.g. the Kerr BH), whereas others bifurcate only locally from a bald BH (e.g. the D = 5 Myers-Perry BH). It would be desirable to understand how generically synchronisation allows hairy BHs to bifurcate from bald ones. However, the construction and scanning of the domain of existence of the former families of BHs can be a difficult and time consuming (numerical) task. Here, we first provide a simple perturbative argument to understand the generality of the synchronisation condition. Then, we observe that the study of Q-clouds is a generic tool to establish the existence of BHs with synchronised hair bifurcating (globally or locally) from a given bald BH without having to solve the fully non-linear coupled system of Einstein-matter equations. As examples, we apply this tool to establish the existence of synchronised hair around D = 6 Myers-Perry BHs, D = 5 black rings and D = 4 Kerr-AdS BHs, where D is the spacetime dimension. The black rings case provides an example of BHs with synchronised hair beyond spherical horizon topology, further establishing the generality of the mechanism.

  1. Modality-dependent effect of motion information in sensory-motor synchronised tapping.

    Science.gov (United States)

    Ono, Kentaro

    2018-05-14

    Synchronised action is important for everyday life. Generally, the auditory domain is more sensitive for coding temporal information, and previous studies have shown that auditory-motor synchronisation is much more precise than visuo-motor synchronisation. Interestingly, adding motion information improves synchronisation with visual stimuli and the advantage of the auditory modality seems to diminish. However, whether adding motion information also improves auditory-motor synchronisation remains unknown. This study compared tapping accuracy with a stationary or moving stimulus in both auditory and visual modalities. Participants were instructed to tap in synchrony with the onset of a sound or flash in the stationary condition, while these stimuli were perceived as moving from side to side in the motion condition. The results demonstrated that synchronised tapping with a moving visual stimulus was significantly more accurate than tapping with a stationary visual stimulus, as previous studies have shown. However, tapping with a moving auditory stimulus was significantly poorer than tapping with a stationary auditory stimulus. Although motion information impaired audio-motor synchronisation, an advantage of auditory modality compared to visual modality still existed. These findings are likely the result of higher temporal resolution in the auditory domain, which is likely due to the physiological and structural differences in the auditory and visual pathways in the brain. Copyright © 2018 Elsevier B.V. All rights reserved.

  2. A Hybrid Heuristic Optimization Approach for Leak Detection in Pipe Networks Using Ordinal Optimization Approach and the Symbiotic Organism Search

    Directory of Open Access Journals (Sweden)

    Chao-Chih Lin

    2017-10-01

    Full Text Available A new transient-based hybrid heuristic approach is developed to optimize a transient generation process and to detect leaks in pipe networks. The approach couples the ordinal optimization approach (OOA and the symbiotic organism search (SOS to solve the optimization problem by means of iterations. A pipe network analysis model (PNSOS is first used to determine steady-state head distribution and pipe flow rates. The best transient generation point and its relevant valve operation parameters are optimized by maximizing the objective function of transient energy. The transient event is created at the chosen point, and the method of characteristics (MOC is used to analyze the transient flow. The OOA is applied to sift through the candidate pipes and the initial organisms with leak information. The SOS is employed to determine the leaks by minimizing the sum of differences between simulated and computed head at the observation points. Two synthetic leaking scenarios, a simple pipe network and a water distribution network (WDN, are chosen to test the performance of leak detection ordinal symbiotic organism search (LDOSOS. Leak information can be accurately identified by the proposed approach for both of the scenarios. The presented technique makes a remarkable contribution to the success of leak detection in the pipe networks.

  3. An optimization on strontium separation model for fission products (inactive trace elements) using artificial neural networks

    International Nuclear Information System (INIS)

    Moosavi, K.; Setayeshi, S.; Maragheh, M.Gh.; Ahmadi, S.J.; Kardan, M.R.; Banaem, L.M.

    2009-01-01

    In this study, an experimental design using artificial neural networks for an optimization on the strontium separation model for fission products (inactive trace elements) is investigated. The goal is to optimize the separation parameters to achieve maximum amount of strontium that is separated from the fission products. The result of the optimization method causes a proper purity of Strontium-89 that was separated from the fission products. It is also shown that ANN may be establish a method to optimize the separation model.

  4. Optimal experiment design in a filtering context with application to sampled network data

    OpenAIRE

    Singhal, Harsh; Michailidis, George

    2010-01-01

    We examine the problem of optimal design in the context of filtering multiple random walks. Specifically, we define the steady state E-optimal design criterion and show that the underlying optimization problem leads to a second order cone program. The developed methodology is applied to tracking network flow volumes using sampled data, where the design variable corresponds to controlling the sampling rate. The optimal design is numerically compared to a myopic and a naive strategy. Finally, w...

  5. Application of particle swarm optimization to identify gamma spectrum with neural network

    International Nuclear Information System (INIS)

    Shi Dongsheng; Di Yuming; Zhou Chunlin

    2007-01-01

    In applying neural network to identification of gamma spectra back propagation (BP) algorithm is usually trapped to a local optimum and has a low speed of convergence, whereas particle swarm optimization (PSO) is advantageous in terms of globe optimal searching. In this paper, we propose a new algorithm for neural network training, i.e. combined BP and PSO optimization, or PSO-BP algorithm. Practical example shows that the new algorithm can overcome shortcomings of BP algorithm and the neural network trained by it has a high ability of generalization with identification result of 100% correctness. It can be used effectively and reliably to identify gamma spectra. (authors)

  6. A Hierarchical Modeling for Reactive Power Optimization With Joint Transmission and Distribution Networks by Curve Fitting

    DEFF Research Database (Denmark)

    Ding, Tao; Li, Cheng; Huang, Can

    2018-01-01

    –slave structure and improves traditional centralized modeling methods by alleviating the big data problem in a control center. Specifically, the transmission-distribution-network coordination issue of the hierarchical modeling method is investigated. First, a curve-fitting approach is developed to provide a cost......In order to solve the reactive power optimization with joint transmission and distribution networks, a hierarchical modeling method is proposed in this paper. It allows the reactive power optimization of transmission and distribution networks to be performed separately, leading to a master...... optimality. Numerical results on two test systems verify the effectiveness of the proposed hierarchical modeling and curve-fitting methods....

  7. Optimality principles in the regulation of metabolic networks.

    Science.gov (United States)

    Berkhout, Jan; Bruggeman, Frank J; Teusink, Bas

    2012-08-29

    One of the challenging tasks in systems biology is to understand how molecular networks give rise to emergent functionality and whether universal design principles apply to molecular networks. To achieve this, the biophysical, evolutionary and physiological constraints that act on those networks need to be identified in addition to the characterisation of the molecular components and interactions. Then, the cellular "task" of the network-its function-should be identified. A network contributes to organismal fitness through its function. The premise is that the same functions are often implemented in different organisms by the same type of network; hence, the concept of design principles. In biology, due to the strong forces of selective pressure and natural selection, network functions can often be understood as the outcome of fitness optimisation. The hypothesis of fitness optimisation to understand the design of a network has proven to be a powerful strategy. Here, we outline the use of several optimisation principles applied to biological networks, with an emphasis on metabolic regulatory networks. We discuss the different objective functions and constraints that are considered and the kind of understanding that they provide.

  8. Finding influential nodes for integration in brain networks using optimal percolation theory.

    Science.gov (United States)

    Del Ferraro, Gino; Moreno, Andrea; Min, Byungjoon; Morone, Flaviano; Pérez-Ramírez, Úrsula; Pérez-Cervera, Laura; Parra, Lucas C; Holodny, Andrei; Canals, Santiago; Makse, Hernán A

    2018-06-11

    Global integration of information in the brain results from complex interactions of segregated brain networks. Identifying the most influential neuronal populations that efficiently bind these networks is a fundamental problem of systems neuroscience. Here, we apply optimal percolation theory and pharmacogenetic interventions in vivo to predict and subsequently target nodes that are essential for global integration of a memory network in rodents. The theory predicts that integration in the memory network is mediated by a set of low-degree nodes located in the nucleus accumbens. This result is confirmed with pharmacogenetic inactivation of the nucleus accumbens, which eliminates the formation of the memory network, while inactivations of other brain areas leave the network intact. Thus, optimal percolation theory predicts essential nodes in brain networks. This could be used to identify targets of interventions to modulate brain function.

  9. Optimal Base Station Density of Dense Network: From the Viewpoint of Interference and Load.

    Science.gov (United States)

    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.

  10. A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Problems With Equality and Inequality Constraints.

    Science.gov (United States)

    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.

  11. Synchronisation Induced by Repulsive Interactions in a System of van der Pol Oscillators

    Science.gov (United States)

    Martins, T. V.; Toral, R.

    2011-09-01

    We consider a system of identical van der Pol oscillators, globally coupled through their velocities, and study how the presence of competitive interactions affects its synchronisation properties. We will address the question from two points of view. Firstly, we will investigate the role of competitive interactions on the synchronisation among identical oscillators. Then, we will show that the presence of a fraction of repulsive links results in the appearance of macroscopic oscillations at that signal's rhythm, in regions where the individual oscillator is unable to synchronise with a weak external signal.

  12. Multi-user bidirectional communication using isochronal synchronisation of array of chaotic directly modulated semiconductor lasers

    International Nuclear Information System (INIS)

    Krishna, Bindu M.; John, Manu P.; Nandakumaran, V.M.

    2010-01-01

    Isochronal synchronisation between the elements of an array of three mutually coupled directly modulated semiconductor lasers is utilized for the purpose of simultaneous bidirectional secure communication. Chaotic synchronisation is achieved by adding the coupling signal to the self feedback signal provided to each element of the array. A symmetric coupling is effective in inducing synchronisation between the elements of the array. This coupling scheme provides a direct link between every pair of elements thus making the method suitable for simultaneous bidirectional communication between them. Both analog and digital messages are successfully encrypted and decrypted simultaneously by each element of the array.

  13. Generalised synchronisation of spatiotemporal chaos using feedback control method and phase compression

    International Nuclear Information System (INIS)

    Xing-Yuan, Wang; Na, Zhang

    2010-01-01

    Coupled map lattices are taken as examples to study the synchronisation of spatiotemporal chaotic systems. First, a generalised synchronisation of two coupled map lattices is realised through selecting an appropriate feedback function and appropriate range of feedback parameter. Based on this method we use the phase compression method to extend the range of the parameter. So, we integrate the feedback control method with the phase compression method to implement the generalised synchronisation and obtain an exact range of feedback parameter. This technique is simple to implement in practice. Numerical simulations show the effectiveness and the feasibility of the proposed program. (general)

  14. Synchronising chaotic Chua's circuit using switching feedback control based on piecewise quadratic Lyapunov functions

    International Nuclear Information System (INIS)

    Hong-Bin, Zhang; Jian-Wei, Xia; Yong-Bin, Yu; Chuang-Yin, Dang

    2010-01-01

    This paper investigates the chaos synchronisation between two coupled chaotic Chua's circuits. The sufficient condition presented by linear matrix inequalities (LMIs) of global asymptotic synchronisation is attained based on piecewise quadratic Lyapunov functions. First, we obtain the piecewise linear differential inclusions (pwLDIs) model of synchronisation error dynamics, then we design a switching (piecewise-linear) feedback control law to stabilise it based on the piecewise quadratic Laypunov functions. Then we give some numerical simulations to demonstrate the effectiveness of our theoretical results

  15. Optimization of the Critical Diameter and Average Path Length of Social Networks

    Directory of Open Access Journals (Sweden)

    Haifeng Du

    2017-01-01

    Full Text Available Optimizing average path length (APL by adding shortcut edges has been widely discussed in connection with social networks, but the relationship between network diameter and APL is generally ignored in the dynamic optimization of APL. In this paper, we analyze this relationship and transform the problem of optimizing APL into the problem of decreasing diameter to 2. We propose a mathematic model based on a memetic algorithm. Experimental results show that our algorithm can efficiently solve this problem as well as optimize APL.

  16. A Distributed Algorithm for Energy Optimization in Hydraulic Networks

    DEFF Research Database (Denmark)

    Kallesøe, Carsten; Wisniewski, Rafal; Jensen, Tom Nørgaard

    2014-01-01

    An industrial case study in the form of a large-scale hydraulic network underlying a district heating system is considered. A distributed control is developed that minimizes the aggregated electrical energy consumption of the pumps in the network without violating the control demands. The algorithm...... a Plug & Play control system as most commissioning can be done during the manufacture of the pumps. Only information on the graph-structure of the hydraulic network is needed during installation....

  17. An optimally evolved connective ratio of neural networks that maximizes the occurrence of synchronized bursting behavior

    Science.gov (United States)

    2012-01-01

    Background Synchronized bursting activity (SBA) is a remarkable dynamical behavior in both ex vivo and in vivo neural networks. Investigations of the underlying structural characteristics associated with SBA are crucial to understanding the system-level regulatory mechanism of neural network behaviors. Results In this study, artificial pulsed neural networks were established using spike response models to capture fundamental dynamics of large scale ex vivo cortical networks. Network simulations with synaptic parameter perturbations showed the following two findings. (i) In a network with an excitatory ratio (ER) of 80-90%, its connective ratio (CR) was within a range of 10-30% when the occurrence of SBA reached the highest expectation. This result was consistent with the experimental observation in ex vivo neuronal networks, which were reported to possess a matured inhibitory synaptic ratio of 10-20% and a CR of 10-30%. (ii) No SBA occurred when a network does not contain any all-positive-interaction feedback loop (APFL) motif. In a neural network containing APFLs, the number of APFLs presented an optimal range corresponding to the maximal occurrence of SBA, which was very similar to the optimal CR. Conclusions In a neural network, the evolutionarily selected CR (10-30%) optimizes the occurrence of SBA, and APFL serves a pivotal network motif required to maximize the occurrence of SBA. PMID:22462685

  18. Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

    Science.gov (United States)

    Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

    2017-07-19

    Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

  19. 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.

  20. Towards Optimal Buffer Size in Wi-Fi Networks

    KAUST Repository

    Showail, Ahmad J.

    2016-01-19

    Buffer sizing is an important network configuration parameter that impacts the quality of data traffic. Falling memory cost and the fallacy that ‘more is better’ lead to over provisioning network devices with large buffers. Over-buffering or the so called ‘bufferbloat’ phenomenon creates excessive end-to-end delay in today’s networks. On the other hand, under-buffering results in frequent packet loss and subsequent under-utilization of network resources. The buffer sizing problem has been studied extensively for wired networks. However, there is little work addressing the unique challenges of wireless environment. In this dissertation, we discuss buffer sizing challenges in wireless networks, classify the state-of-the-art solutions, and propose two novel buffer sizing schemes. The first scheme targets buffer sizing in wireless multi-hop networks where the radio spectral resource is shared among a set of con- tending nodes. Hence, it sizes the buffer collectively and distributes it over a set of interfering devices. The second buffer sizing scheme is designed to cope up with recent Wi-Fi enhancements. It adapts the buffer size based on measured link characteristics and network load. Also, it enforces limits on the buffer size to maximize frame aggregation benefits. Both mechanisms are evaluated using simulation as well as testbed implementation over half-duplex and full-duplex wireless networks. Experimental evaluation shows that our proposal reduces latency by an order of magnitude.

  1. Optimality Principles in the Regulation of Metabolic Networks

    Directory of Open Access Journals (Sweden)

    Jan Berkhout

    2012-08-01

    Full Text Available One of the challenging tasks in systems biology is to understand how molecular networks give rise to emergent functionality and whether universal design principles apply to molecular networks. To achieve this, the biophysical, evolutionary and physiological constraints that act on those networks need to be identified in addition to the characterisation of the molecular components and interactions. Then, the cellular “task” of the network—its function—should be identified. A network contributes to organismal fitness through its function. The premise is that the same functions are often implemented in different organisms by the same type of network; hence, the concept of design principles. In biology, due to the strong forces of selective pressure and natural selection, network functions can often be understood as the outcome of fitness optimisation. The hypothesis of fitness optimisation to understand the design of a network has proven to be a powerful strategy. Here, we outline the use of several optimisation principles applied to biological networks, with an emphasis on metabolic regulatory networks. We discuss the different objective functions and constraints that are considered and the kind of understanding that they provide.

  2. The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks.

    Science.gov (United States)

    Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue

    2018-02-03

    One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C /2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C /2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi's model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.

  3. Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

    Science.gov (United States)

    Robinson, Y Harold; Rajaram, M

    2015-01-01

    Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique.

  4. Optimal Design of Multitype Groundwater Monitoring Networks Using Easily Accessible Tools.

    Science.gov (United States)

    Wöhling, Thomas; Geiges, Andreas; Nowak, Wolfgang

    2016-11-01

    Monitoring networks are expensive to establish and to maintain. In this paper, we extend an existing data-worth estimation method from the suite of PEST utilities with a global optimization method for optimal sensor placement (called optimal design) in groundwater monitoring networks. Design optimization can include multiple simultaneous sensor locations and multiple sensor types. Both location and sensor type are treated simultaneously as decision variables. Our method combines linear uncertainty quantification and a modified genetic algorithm for discrete multilocation, multitype search. The efficiency of the global optimization is enhanced by an archive of past samples and parallel computing. We demonstrate our methodology for a groundwater monitoring network at the Steinlach experimental site, south-western Germany, which has been established to monitor river-groundwater exchange processes. The target of optimization is the best possible exploration for minimum variance in predicting the mean travel time of the hyporheic exchange. Our results demonstrate that the information gain of monitoring network designs can be explored efficiently and with easily accessible tools prior to taking new field measurements or installing additional measurement points. The proposed methods proved to be efficient and can be applied for model-based optimal design of any type of monitoring network in approximately linear systems. Our key contributions are (1) the use of easy-to-implement tools for an otherwise complex task and (2) yet to consider data-worth interdependencies in simultaneous optimization of multiple sensor locations and sensor types. © 2016, National Ground Water Association.

  5. Optimal power allocation of a single transmitter-multiple receivers channel in a cognitive sensor network

    KAUST Repository

    Ayala Solares, Jose Roberto; Rezki, Zouheir; Alouini, Mohamed-Slim

    2012-01-01

    The optimal transmit power of a wireless sensor network with one transmitter and multiple receivers in a cognitive radio environment while satisfying independent peak, independent average, sum of peak and sum of average transmission rate constraints

  6. Hierarchical Winner-Take-All Particle Swarm Optimization Social Network for Neural Model Fitting

    Science.gov (United States)

    Coventry, Brandon S.; Parthasarathy, Aravindakshan; Sommer, Alexandra L.; Bartlett, Edward L.

    2016-01-01

    Particle swarm optimization (PSO) has gained widespread use as a general mathematical programming paradigm and seen use in a wide variety of optimization and machine learning problems. In this work, we introduce a new variant on the PSO social network and apply this method to the inverse problem of input parameter selection from recorded auditory neuron tuning curves. The topology of a PSO social network is a major contributor to optimization success. Here we propose a new social network which draws influence from winner-take-all coding found in visual cortical neurons. We show that the winner-take-all network performs exceptionally well on optimization problems with greater than 5 dimensions and runs at a lower iteration count as compared to other PSO topologies. Finally we show that this variant of PSO is able to recreate auditory frequency tuning curves and modulation transfer functions, making it a potentially useful tool for computational neuroscience models. PMID:27726048

  7. DRO: domain-based route optimization scheme for nested mobile networks

    Directory of Open Access Journals (Sweden)

    Chuang Ming-Chin

    2011-01-01

    Full Text Available Abstract The network mobility (NEMO basic support protocol is designed to support NEMO management, and to ensure communication continuity between nodes in mobile networks. However, in nested mobile networks, NEMO suffers from the pinball routing problem, which results in long packet transmission delays. To solve the problem, we propose a domain-based route optimization (DRO scheme that incorporates a domain-based network architecture and ad hoc routing protocols for route optimization. DRO also improves the intra-domain handoff performance, reduces the convergence time during route optimization, and avoids the out-of-sequence packet problem. A detailed performance analysis and simulations were conducted to evaluate the scheme. The results demonstrate that DRO outperforms existing mechanisms in terms of packet transmission delay (i.e., better route-optimization, intra-domain handoff latency, convergence time, and packet tunneling overhead.

  8. Concept development and needs identification for intelligent network flow optimization (INFLO) : concept of operations.

    Science.gov (United States)

    2012-06-01

    The purpose of this project is to develop for the Intelligent Network Flow Optimization (INFLO), which is one collection (or bundle) of high-priority transformative applications identified by the United States Department of Transportation (USDOT) Mob...

  9. Concept development and needs identification for intelligent network flow optimization (INFLO) : test readiness assessment.

    Science.gov (United States)

    2012-11-01

    The purpose of this project is to develop for the Intelligent Network Flow Optimization (INFLO), which is one collection (or bundle) of high-priority transformative applications identified by the United States Department of Transportation (USDOT) Mob...

  10. A non-penalty recurrent neural network for solving a class of constrained optimization problems.

    Science.gov (United States)

    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.

  11. A one-layer recurrent neural network for constrained nonconvex optimization.

    Science.gov (United States)

    Li, Guocheng; Yan, Zheng; Wang, Jun

    2015-01-01

    In this paper, a one-layer recurrent neural network is proposed for solving nonconvex optimization problems subject to general inequality constraints, designed based on an exact penalty function method. It is proved herein that any neuron state of the proposed neural network is convergent to the feasible region in finite time and stays there thereafter, provided that the penalty parameter is sufficiently large. The lower bounds of the penalty parameter and convergence time are also estimated. In addition, any neural state of the proposed neural network is convergent to its equilibrium point set which satisfies the Karush-Kuhn-Tucker conditions of the optimization problem. Moreover, the equilibrium point set is equivalent to the optimal solution to the nonconvex optimization problem if the objective function and constraints satisfy given conditions. Four numerical examples are provided to illustrate the performances of the proposed neural network.

  12. Multi-objective optimal power flow for active distribution network considering the stochastic characteristic of photovoltaic

    Science.gov (United States)

    Zhou, Bao-Rong; Liu, Si-Liang; Zhang, Yong-Jun; Yi, Ying-Qi; Lin, Xiao-Ming

    2017-05-01

    To mitigate the impact on the distribution networks caused by the stochastic characteristic and high penetration of photovoltaic, a multi-objective optimal power flow model is proposed in this paper. The regulation capability of capacitor, inverter of photovoltaic and energy storage system embedded in active distribution network are considered to minimize the expected value of active power the T loss and probability of voltage violation in this model. Firstly, a probabilistic power flow based on cumulant method is introduced to calculate the value of the objectives. Secondly, NSGA-II algorithm is adopted for optimization to obtain the Pareto optimal solutions. Finally, the best compromise solution can be achieved through fuzzy membership degree method. By the multi-objective optimization calculation of IEEE34-node distribution network, the results show that the model can effectively improve the voltage security and economy of the distribution network on different levels of photovoltaic penetration.

  13. Hierarchical winner-take-all particle swarm optimization social network for neural model fitting.

    Science.gov (United States)

    Coventry, Brandon S; Parthasarathy, Aravindakshan; Sommer, Alexandra L; Bartlett, Edward L

    2017-02-01

    Particle swarm optimization (PSO) has gained widespread use as a general mathematical programming paradigm and seen use in a wide variety of optimization and machine learning problems. In this work, we introduce a new variant on the PSO social network and apply this method to the inverse problem of input parameter selection from recorded auditory neuron tuning curves. The topology of a PSO social network is a major contributor to optimization success. Here we propose a new social network which draws influence from winner-take-all coding found in visual cortical neurons. We show that the winner-take-all network performs exceptionally well on optimization problems with greater than 5 dimensions and runs at a lower iteration count as compared to other PSO topologies. Finally we show that this variant of PSO is able to recreate auditory frequency tuning curves and modulation transfer functions, making it a potentially useful tool for computational neuroscience models.

  14. Simulation and Optimization Methodologies for Military Transportation Network Routing and Scheduling and for Military Medical Services

    National Research Council Canada - National Science Library

    Rodin, Ervin Y

    2005-01-01

    The purpose of this present research was to develop a generic model and methodology for analyzing and optimizing large-scale air transportation networks including both their routing and their scheduling...

  15. Technical report on prototype intelligent network flow optimization (INFLO) dynamic speed harmonization and queue warning.

    Science.gov (United States)

    2015-06-01

    This Technical Report on Prototype Intelligent Network Flow Optimization (INFLO) Dynamic Speed Harmonization and : Queue Warning is the final report for the project. It describes the prototyping, acceptance testing and small-scale : demonstration of ...

  16. PROBLEMS OF ROUTE NETWORK AND AIRCRAFT FLEET OPTIMIZATION AS A SPECIFIC TASK OF AIRLINE STRATEGIC PLANNING

    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.

  17. Optimal design of water supply networks for enhancing seismic reliability

    International Nuclear Information System (INIS)

    Yoo, Do Guen; Kang, Doosun; Kim, Joong Hoon

    2016-01-01

    The goal of the present study is to construct a reliability evaluation model of a water supply system taking seismic hazards and present techniques to enhance hydraulic reliability of the design into consideration. To maximize seismic reliability with limited budgets, an optimal design model is developed using an optimization technique called harmony search (HS). The model is applied to actual water supply systems to determine pipe diameters that can maximize seismic reliability. The reliabilities between the optimal design and existing designs were compared and analyzed. The optimal design would both enhance reliability by approximately 8.9% and have a construction cost of approximately 1.3% less than current pipe construction cost. In addition, the reinforcement of the durability of individual pipes without considering the system produced ineffective results in terms of both cost and reliability. Therefore, to increase the supply ability of the entire system, optimized pipe diameter combinations should be derived. Systems in which normal status hydraulic stability and abnormal status available demand could be maximally secured if configured through the optimal design. - Highlights: • We construct a seismic reliability evaluation model of water supply system. • We present technique to enhance hydraulic reliability in the aspect of design. • Harmony search algorithm is applied in optimal designs process. • The effects of the proposed optimal design are improved reliability about by 9%. • Optimized pipe diameter combinations should be derived indispensably.

  18. An Optimal Design Model for New Water Distribution Networks in ...

    African Journals Online (AJOL)

    The mathematical formulation is a Linear Programming Problem (LPP) which involves the design of a new network of water distribution considering the cost in the form of unit price of pipes, the hydraulic gradient and the loss of pressure. The objective function minimizes the cost of the network which is computed as the sum ...

  19. Optimal topology to minimizing congestion in connected communication complex network

    Science.gov (United States)

    Benyoussef, M.; Ez-Zahraouy, H.; Benyoussef, A.

    In this paper, a new model of the interdependent complex network is proposed, based on two assumptions that (i) the capacity of a node depends on its degree, and (ii) the traffic load depends on the distribution of the links in the network. Based on these assumptions, the presented model proposes a method of connection not based on the node having a higher degree but on the region containing hubs. It is found that the final network exhibits two kinds of degree distribution behavior, depending on the kind and the way of the connection. This study reveals a direct relation between network structure and traffic flow. It is found that pc the point of transition between the free flow and the congested phase depends on the network structure and the degree distribution. Moreover, this new model provides an improvement in the traffic compared to the results found in a single network. The same behavior of degree distribution found in a BA network and observed in the real world is obtained; except for this model, the transition point between the free phase and congested phase is much higher than the one observed in a network of BA, for both static and dynamic protocols.

  20. THE OPERATION MODES OPTIMIZATION OF THE NEUTRAL DISTRIBUTION NETWORKS

    Directory of Open Access Journals (Sweden)

    F. P. Shkarbets

    2009-03-01

    Full Text Available The variants of grounding the neutral wire of electric networks are considered and the recommendations are presented on increasing the level of operational reliability and electric safety of distribution networks with 6 kV voltage on the basis of limitation and suppression of transitional processes at asymmetrical damages.

  1. modeling and optimization of an electric power distribution network

    African Journals Online (AJOL)

    user

    EDNEPP) was solved by a mixed binary integer programming (MBIP) formulation of the network, where the steady-state operation of the network was modelled with non-linear mathematical expressions. The non-linear terms are linearized, using ...

  2. M2M Optimizations in Public Mobile Networks

    NARCIS (Netherlands)

    Norp, A.H.J.; Landais, B.

    2012-01-01

    Many M2M applications use public telecommunications networks to transfer data from M2M devices to an M2M server. These telecommunications networks will have to be adapted to cope with the traffic generated by the projected growth of M2M applications. In the near future, many more devices will be

  3. Optimal task scheduling policy in energy harvesting wireless sensor networks

    NARCIS (Netherlands)

    Rao, Vijay S.; Prasad, R. Venkatesha; Niemegeers, Ignas G M M

    2015-01-01

    Ambient energy harvesting for Wireless Sensor Networks (WSNs) is being pitched as a promising solution for long-lasting deployments in various WSN applications. However, the sensor nodes most often do not have enough energy to handle application, network and house-keeping tasks because amount of

  4. Multiobjective planning of distribution networks incorporating switches and protective devices using a memetic optimization

    International Nuclear Information System (INIS)

    Pombo, A. Vieira; Murta-Pina, João; Pires, V. Fernão

    2015-01-01

    A multi-objective planning approach for the reliability of electric distribution networks using a memetic optimization is presented. In this reliability optimization, the type of the equipment (switches or reclosers) and their location are optimized. The multiple objectives considered to find the optimal values for these planning variables are the minimization of the total equipment cost and at the same time the minimization of two distribution network reliability indexes. The reliability indexes are the system average interruption frequency index (SAIFI) and system average interruption duration index (SAIDI). To solve this problem a memetic evolutionary algorithm is proposed, which combines the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) with a local search algorithm. The obtained Pareto-optimal front contains solutions of different trade-offs with respect to the three objectives. A real distribution network is used to test the proposed algorithm. The obtained results show that this approach allows the utility to obtain the optimal type and location of the equipments to achieve the best reliability with the lower cost. - Highlights: • Reliability indexes SAIFI and SAIDI and Equipment Cost are optimized. • Optimization of equipment type, number and location on a MV network. • Memetic evolutionary algorithm with a local search algorithm is proposed. • Pareto optimal front solutions with respect to the three objective functions

  5. Optimal design of an IP/MPLS over DWDM network

    Directory of Open Access Journals (Sweden)

    Eduardo Canale

    2014-04-01

    Full Text Available Different approaches for deploying resilient optical networks of low cost constitute a traditional group of NP-Hard problems that have been widely studied. Most of them are based on the construction of low cost networks that fulfill connectivity constraints. However, recent trends to virtualize optical networks over the legacy fiber infrastructure, modified the nature of network design problems and turned inappropriate many of these models and algorithms. In this paper we study a design problem arising from the deployment of an IP/MPLS network over an existing DWDM infrastructure. Besides cost and resiliency, this problem integrates traffic and capacity constraints. We present: an integer programming formulation for the problem, theoretical results, and describe how several metaheuristics were applied in order to find good quality solutions, for a real application case of a telecommunications company.

  6. Forecasting outpatient visits using empirical mode decomposition coupled with back-propagation artificial neural networks optimized by particle swarm optimization.

    Science.gov (United States)

    Huang, Daizheng; Wu, Zhihui

    2017-01-01

    Accurately predicting the trend of outpatient visits by mathematical modeling can help policy makers manage hospitals effectively, reasonably organize schedules for human resources and finances, and appropriately distribute hospital material resources. In this study, a hybrid method based on empirical mode decomposition and back-propagation artificial neural networks optimized by particle swarm optimization is developed to forecast outpatient visits on the basis of monthly numbers. The data outpatient visits are retrieved from January 2005 to December 2013 and first obtained as the original time series. Second, the original time series is decomposed into a finite and often small number of intrinsic mode functions by the empirical mode decomposition technique. Third, a three-layer back-propagation artificial neural network is constructed to forecast each intrinsic mode functions. To improve network performance and avoid falling into a local minimum, particle swarm optimization is employed to optimize the weights and thresholds of back-propagation artificial neural networks. Finally, the superposition of forecasting results of the intrinsic mode functions is regarded as the ultimate forecasting value. Simulation indicates that the proposed method attains a better performance index than the other four methods.

  7. Achieving Consistent Near-Optimal Pattern Recognition Accuracy Using Particle Swarm Optimization to Pre-Train Artificial Neural Networks

    Science.gov (United States)

    Nikelshpur, Dmitry O.

    2014-01-01

    Similar to mammalian brains, Artificial Neural Networks (ANN) are universal approximators, capable of yielding near-optimal solutions to a wide assortment of problems. ANNs are used in many fields including medicine, internet security, engineering, retail, robotics, warfare, intelligence control, and finance. "ANNs have a tendency to get…

  8. CORAL off-line: an object-oriented tool for optimal control of sewer networks

    OpenAIRE

    Figueras, J.; Cembrano, Gabriela; Puig, Vicenç; Quevedo, Joseba; Salamero Sansalvado, María; Marti Marques, Joaquim

    2002-01-01

    This paper describes a tool to aid in the analysis and design of combined sewer networks. Complex drainage systems include actuators, like flow-diversion gates and detention tanks, which should be optimally controlled in order to minimize flooding and combined sewer overflow (CSO). Through these optimisations volume to waste water treatment plants (WWTP) is maximised. CORAL is a tool able to model a combined sewer network, simulate rain events, calculate actuators optimal policies, reproduce ...

  9. Analysis and optimization of gas-centrifugal separation of uranium isotopes by neural networks

    Directory of Open Access Journals (Sweden)

    Migliavacca S.C.P.

    2002-01-01

    Full Text Available Neural networks are an attractive alternative for modeling complex problems with too many difficulties to be solved by a phenomenological model. A feed-forward neural network was used to model a gas-centrifugal separation of uranium isotopes. The prediction showed good agreement with the experimental data. An optimization study was carried out. The optimal operational condition was tested by a new experiment and a difference of less than 1% was found.

  10. Optimization Models for Reaction Networks: Information Divergence, Quadratic Programming and Kirchhoff’s Laws

    Directory of Open Access Journals (Sweden)

    Julio Michael Stern

    2014-03-01

    Full Text Available This article presents a simple derivation of optimization models for reaction networks leading to a generalized form of the mass-action law, and compares the formal structure of Minimum Information Divergence, Quadratic Programming and Kirchhoff type network models. These optimization models are used in related articles to develop and illustrate the operation of ontology alignment algorithms and to discuss closely connected issues concerning the epistemological and statistical significance of sharp or precise hypotheses in empirical science.

  11. Bio-Mimic Optimization Strategies in Wireless Sensor Networks: A Survey

    Science.gov (United States)

    Adnan, Md. Akhtaruzzaman; Razzaque, Mohammd Abdur; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

    2014-01-01

    For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted. PMID:24368702

  12. Evolutionary optimization of neural networks with heterogeneous computation: study and implementation

    OpenAIRE

    FE, JORGE DEOLINDO; Aliaga Varea, Ramón José; Gadea Gironés, Rafael

    2015-01-01

    In the optimization of artificial neural networks (ANNs) via evolutionary algorithms and the implementation of the necessary training for the objective function, there is often a trade-off between efficiency and flexibility. Pure software solutions on general-purpose processors tend to be slow because they do not take advantage of the inherent parallelism, whereas hardware realizations usually rely on optimizations that reduce the range of applicable network topologies, or they...

  13. Bio-mimic optimization strategies in wireless sensor networks: a survey.

    Science.gov (United States)

    Adnan, Md Akhtaruzzaman; Abdur Razzaque, Mohammd; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

    2013-12-24

    For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted.

  14. Optimization of rainfall networks using information entropy and temporal variability analysis

    Science.gov (United States)

    Wang, Wenqi; Wang, Dong; Singh, Vijay P.; Wang, Yuankun; Wu, Jichun; Wang, Lachun; Zou, Xinqing; Liu, Jiufu; Zou, Ying; He, Ruimin

    2018-04-01

    Rainfall networks are the most direct sources of precipitation data and their optimization and evaluation are essential and important. Information entropy can not only represent the uncertainty of rainfall distribution but can also reflect the correlation and information transmission between rainfall stations. Using entropy this study performs optimization of rainfall networks that are of similar size located in two big cities in China, Shanghai (in Yangtze River basin) and Xi'an (in Yellow River basin), with respect to temporal variability analysis. Through an easy-to-implement greedy ranking algorithm based on the criterion called, Maximum Information Minimum Redundancy (MIMR), stations of the networks in the two areas (each area is further divided into two subareas) are ranked during sliding inter-annual series and under different meteorological conditions. It is found that observation series with different starting days affect the ranking, alluding to the temporal variability during network evaluation. We propose a dynamic network evaluation framework for considering temporal variability, which ranks stations under different starting days with a fixed time window (1-year, 2-year, and 5-year). Therefore, we can identify rainfall stations which are temporarily of importance or redundancy and provide some useful suggestions for decision makers. The proposed framework can serve as a supplement for the primary MIMR optimization approach. In addition, during different periods (wet season or dry season) the optimal network from MIMR exhibits differences in entropy values and the optimal network from wet season tended to produce higher entropy values. Differences in spatial distribution of the optimal networks suggest that optimizing the rainfall network for changing meteorological conditions may be more recommended.

  15. A one-layer recurrent neural network for constrained nonsmooth invex optimization.

    Science.gov (United States)

    Li, Guocheng; Yan, Zheng; Wang, Jun

    2014-02-01

    Invexity is an important notion in nonconvex optimization. In this paper, a one-layer recurrent neural network is proposed for solving constrained nonsmooth invex optimization problems, designed based on an exact penalty function method. It is proved herein that any state of the proposed neural network is globally convergent to the optimal solution set of constrained invex optimization problems, with a sufficiently large penalty parameter. In addition, any neural state is globally convergent to the unique optimal solution, provided that the objective function and constraint functions are pseudoconvex. Moreover, any neural state is globally convergent to the feasible region in finite time and stays there thereafter. The lower bounds of the penalty parameter and convergence time are also estimated. Two numerical examples are provided to illustrate the performances of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.

  16. Optimization of controllability and robustness of complex networks by edge directionality

    Science.gov (United States)

    Liang, Man; Jin, Suoqin; Wang, Dingjie; Zou, Xiufen

    2016-09-01

    Recently, controllability of complex networks has attracted enormous attention in various fields of science and engineering. How to optimize structural controllability has also become a significant issue. Previous studies have shown that an appropriate directional assignment can improve structural controllability; however, the evolution of the structural controllability of complex networks under attacks and cascading has always been ignored. To address this problem, this study proposes a new edge orientation method (NEOM) based on residual degree that changes the link direction while conserving topology and directionality. By comparing the results with those of previous methods in two random graph models and several realistic networks, our proposed approach is demonstrated to be an effective and competitive method for improving the structural controllability of complex networks. Moreover, numerical simulations show that our method is near-optimal in optimizing structural controllability. Strikingly, compared to the original network, our method maintains the structural controllability of the network under attacks and cascading, indicating that the NEOM can also enhance the robustness of controllability of networks. These results alter the view of the nature of controllability in complex networks, change the understanding of structural controllability and affect the design of network models to control such networks.

  17. Multi-Objective Distribution Network Operation Based on Distributed Generation Optimal Placement Using New Antlion Optimizer Considering Reliability

    Directory of Open Access Journals (Sweden)

    KHANBABAZADEH Javad

    2016-10-01

    Full Text Available Distribution network designers and operators are trying to deliver electrical energy with high reliability and quality to their subscribers. Due to high losses in the distribution systems, using distributed generation can improves reliability, reduces losses and improves voltage profile of distribution network. Therefore, the choice of the location of these resources and also determining the amount of their generated power to maximize the benefits of this type of resource is an important issue which is discussed from different points of view today. In this paper, a new multi-objective optimal location and sizing of distributed generation resources is performed to maximize its benefits on the 33 bus distribution test network considering reliability and using a new Antlion Optimizer (ALO. The benefits for DG are considered as system losses reduction, system reliability improvement and benefits from the sale electricity and voltage profile improvement. For each of the mentioned benefits, the ALO algorithm is used to optimize the location and sizing of distributed generation resources. In order to verify the proposed approach, the obtained results have been analyzed and compared with the results of particle swarm optimization (PSO algorithm. The results show that the ALO has shown better performance in optimization problem solution versus PSO.

  18. Resource Allocation Optimization Model of Collaborative Logistics Network Based on Bilevel Programming

    Directory of Open Access Journals (Sweden)

    Xiao-feng Xu

    2017-01-01

    Full Text Available Collaborative logistics network resource allocation can effectively meet the needs of customers. It can realize the overall benefit maximization of the logistics network and ensure that collaborative logistics network runs orderly at the time of creating value. Therefore, this article is based on the relationship of collaborative logistics network supplier, the transit warehouse, and sellers, and we consider the uncertainty of time to establish a bilevel programming model with random constraints and propose a genetic simulated annealing hybrid intelligent algorithm to solve it. Numerical example shows that the method has stronger robustness and convergence; it can achieve collaborative logistics network resource allocation rationalization and optimization.

  19. Performance improvement of optical CDMA networks with stochastic artificial bee colony optimization technique

    Science.gov (United States)

    Panda, Satyasen

    2018-05-01

    This paper proposes a modified artificial bee colony optimization (ABC) algorithm based on levy flight swarm intelligence referred as artificial bee colony levy flight stochastic walk (ABC-LFSW) optimization for optical code division multiple access (OCDMA) network. The ABC-LFSW algorithm is used to solve asset assignment problem based on signal to noise ratio (SNR) optimization in OCDM networks with quality of service constraints. The proposed optimization using ABC-LFSW algorithm provides methods for minimizing various noises and interferences, regulating the transmitted power and optimizing the network design for improving the power efficiency of the optical code path (OCP) from source node to destination node. In this regard, an optical system model is proposed for improving the network performance with optimized input parameters. The detailed discussion and simulation results based on transmitted power allocation and power efficiency of OCPs are included. The experimental results prove the superiority of the proposed network in terms of power efficiency and spectral efficiency in comparison to networks without any power allocation approach.

  20. Pareto Optimal Solutions for Network Defense Strategy Selection Simulator in Multi-Objective Reinforcement Learning

    Directory of Open Access Journals (Sweden)

    Yang Sun

    2018-01-01

    Full Text Available Using Pareto optimization in Multi-Objective Reinforcement Learning (MORL leads to better learning results for network defense games. This is particularly useful for network security agents, who must often balance several goals when choosing what action to take in defense of a network. If the defender knows his preferred reward distribution, the advantages of Pareto optimization can be retained by using a scalarization algorithm prior to the implementation of the MORL. In this paper, we simulate a network defense scenario by creating a multi-objective zero-sum game and using Pareto optimization and MORL to determine optimal solutions and compare those solutions to different scalarization approaches. We build a Pareto Defense Strategy Selection Simulator (PDSSS system for assisting network administrators on decision-making, specifically, on defense strategy selection, and the experiment results show that the Satisficing Trade-Off Method (STOM scalarization approach performs better than linear scalarization or GUESS method. The results of this paper can aid network security agents attempting to find an optimal defense policy for network security games.

  1. On Maximizing the Lifetime of Wireless Sensor Networks by Optimally Assigning Energy Supplies

    Science.gov (United States)

    Asorey-Cacheda, Rafael; García-Sánchez, Antonio Javier; García-Sánchez, Felipe; García-Haro, Joan; Gonzalez-Castaño, Francisco Javier

    2013-01-01

    The extension of the network lifetime of Wireless Sensor Networks (WSN) is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes) carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes) are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment) to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively. PMID:23939582

  2. On Maximizing the Lifetime of Wireless Sensor Networks by Optimally Assigning Energy Supplies

    Directory of Open Access Journals (Sweden)

    Francisco Javier González-Castano

    2013-08-01

    Full Text Available The extension of the network lifetime of Wireless Sensor Networks (WSN is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively.

  3. Optimal design of cluster-based ad-hoc networks using probabilistic solution discovery

    International Nuclear Information System (INIS)

    Cook, Jason L.; Ramirez-Marquez, Jose Emmanuel

    2009-01-01

    The reliability of ad-hoc networks is gaining popularity in two areas: as a topic of academic interest and as a key performance parameter for defense systems employing this type of network. The ad-hoc network is dynamic and scalable and these descriptions are what attract its users. However, these descriptions are also synonymous for undefined and unpredictable when considering the impacts to the reliability of the system. The configuration of an ad-hoc network changes continuously and this fact implies that no single mathematical expression or graphical depiction can describe the system reliability-wise. Previous research has used mobility and stochastic models to address this challenge successfully. In this paper, the authors leverage the stochastic approach and build upon it a probabilistic solution discovery (PSD) algorithm to optimize the topology for a cluster-based mobile ad-hoc wireless network (MAWN). Specifically, the membership of nodes within the back-bone network or networks will be assigned in such as way as to maximize reliability subject to a constraint on cost. The constraint may also be considered as a non-monetary cost, such as weight, volume, power, or the like. When a cost is assigned to each component, a maximum cost threshold is assigned to the network, and the method is run; the result is an optimized allocation of the radios enabling back-bone network(s) to provide the most reliable network possible without exceeding the allowable cost. The method is intended for use directly as part of the architectural design process of a cluster-based MAWN to efficiently determine an optimal or near-optimal design solution. It is capable of optimizing the topology based upon all-terminal reliability (ATR), all-operating terminal reliability (AoTR), or two-terminal reliability (2TR)

  4. Optimization of blanking process using neural network simulation

    International Nuclear Information System (INIS)

    Hambli, R.

    2005-01-01

    The present work describes a methodology using the finite element method and neural network simulation in order to predict the optimum punch-die clearance during sheet metal blanking processes. A damage model is used in order to describe crack initiation and propagation into the sheet. The proposed approach combines predictive finite element and neural network modeling of the leading blanking parameters. Numerical results obtained by finite element computation including damage and fracture modeling were utilized to train the developed simulation environment based on back propagation neural network modeling. The comparative study between the numerical results and the experimental ones shows the good agreement. (author)

  5. Lifetime Optimization of a Multiple Sink Wireless Sensor Network through Energy Balancing

    Directory of Open Access Journals (Sweden)

    Tapan Kumar Jain

    2015-01-01

    Full Text Available The wireless sensor network consists of small limited energy sensors which are connected to one or more sinks. The maximum energy consumption takes place in communicating the data from the nodes to the sink. Multiple sink WSN has an edge over the single sink WSN where very less energy is utilized in sending the data to the sink, as the number of hops is reduced. If the energy consumed by a node is balanced between the other nodes, the lifetime of the network is considerably increased. The network lifetime optimization is achieved by restructuring the network by modifying the neighbor nodes of a sink. Only those nodes are connected to a sink which makes the total energy of the sink less than the threshold. This energy balancing through network restructuring optimizes the network lifetime. This paper depicts this fact through simulations done in MATLAB.

  6. Genotype by environment interaction in sunflower (Helianthus annus L.) to optimize trial network efficiency

    Energy Technology Data Exchange (ETDEWEB)

    Gonzalez-Barrios, P.; Castro, M.; Pérez, O.; Vilaró, D.; Gutiérrez, L.

    2017-07-01

    Modeling genotype by environment interaction (GEI) is one of the most challenging aspects of plant breeding programs. The use of efficient trial networks is an effective way to evaluate GEI to define selection strategies. Furthermore, the experimental design and the number of locations, replications, and years are crucial aspects of multi-environment trial (MET) network optimization. The objective of this study was to evaluate the efficiency and performance of a MET network of sunflower (Helianthus annuus L.). Specifically, we evaluated GEI in the network by delineating mega-environments, estimating genotypic stability and identifying relevant environmental covariates. Additionally, we optimized the network by comparing experimental design efficiencies. We used the National Evaluation Network of Sunflower Cultivars of Uruguay (NENSU) in a period of 20 years. MET plot yield and flowering time information was used to evaluate GEI. Additionally, meteorological information was studied for each sunflower physiological stage. An optimal network under these conditions should have three replications, two years of evaluation and at least three locations. The use of incomplete randomized block experimental design showed reasonable performance. Three mega-environments were defined, explained mainly by different management of sowing dates. Late sowings dates had the worst performance in grain yield and oil production, associated with higher temperatures before anthesis and fewer days allocated to grain filling. The optimization of MET networks through the analysis of the experimental design efficiency, the presence of GEI, and appropriate management strategies have a positive impact on the expression of yield potential and selection of superior cultivars.

  7. Robust optimal control of material flows in demand-driven supply networks

    NARCIS (Netherlands)

    Laumanns, M.; Lefeber, A.A.J.

    2006-01-01

    We develop a model based on stochastic discrete-time controlleddynamical systems in order to derive optimal policies for controllingthe material flow in supply networks. Each node in the network isdescribed as a transducer such that the dynamics of the material andinformation flows within the entire

  8. Optimal Power Flow for resistive DC Network : A Port-Hamiltonian approach

    NARCIS (Netherlands)

    Benedito, Ernest; del Puerto-Flores, D.; Doria-Cerezo, A.; Scherpen, Jacquelien M.A.; Dochain, Denis; Henrion, Didier; Peaucelle, Dimitri

    This paper studies the optimal power flow problem for resistive DC networks. The gradient method algorithm is written in a port-Hamiltonian form and the stability of the resulting dynamics is studied. Stability conditions are provided for general cyclic networks and a solution, when these conditions

  9. Optimization of neural networks for time-domain simulation of mooring lines

    DEFF Research Database (Denmark)

    Christiansen, Niels Hørbye; Voie, Per Erlend Torbergsen; Winther, Ole

    2016-01-01

    , they also can be used to rank the importance of the various network inputs. The dynamic response of slender marine structures often depends on several external load components, and by applying the optimization procedures to a trained artificial neural network, it is possible to classify the external force...

  10. Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Ricciardi, Sergio; Fagertun, Anna Manolova

    2012-01-01

    In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...

  11. Applying self-organizing map and modified radial based neural network for clustering and routing optimal path in wireless network

    Science.gov (United States)

    Hoomod, Haider K.; Kareem Jebur, Tuka

    2018-05-01

    Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network research and consist of active nodes that can be in motion freely. Because it consider very important problem in this network, we suggested proposed method based on modified radial basis function networks RBFN and Self-Organizing Map SOM. These networks can be improved by the use of clusters because of huge congestion in the whole network. In such a system, the performance of MANET is improved by splitting the whole network into various clusters using SOM. The performance of clustering is improved by the cluster head selection and number of clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. Proposed routing algorithm depends on the group of factors and parameters to select the path between two points in the wireless network. The SOM clustering average time (1-10 msec for stall nodes) and (8-75 msec for mobile nodes). While the routing time range (92-510 msec).The proposed system is faster than the Dijkstra by 150-300%, and faster from the RBFNN (without modify) by 145-180%.

  12. Optimal Formation of Multirobot Systems Based on a Recurrent Neural Network.

    Science.gov (United States)

    Wang, Yunpeng; Cheng, Long; Hou, Zeng-Guang; Yu, Junzhi; Tan, Min

    2016-02-01

    The optimal formation problem of multirobot systems is solved by a recurrent neural network in this paper. The desired formation is described by the shape theory. This theory can generate a set of feasible formations that share the same relative relation among robots. An optimal formation means that finding one formation from the feasible formation set, which has the minimum distance to the initial formation of the multirobot system. Then, the formation problem is transformed into an optimization problem. In addition, the orientation, scale, and admissible range of the formation can also be considered as the constraints in the optimization problem. Furthermore, if all robots are identical, their positions in the system are exchangeable. Then, each robot does not necessarily move to one specific position in the formation. In this case, the optimal formation problem becomes a combinational optimization problem, whose optimal solution is very hard to obtain. Inspired by the penalty method, this combinational optimization problem can be approximately transformed into a convex optimization problem. Due to the involvement of the Euclidean norm in the distance, the objective function of these optimization problems are nonsmooth. To solve these nonsmooth optimization problems efficiently, a recurrent neural network approach is employed, owing to its parallel computation ability. Finally, some simulations and experiments are given to validate the effectiveness and efficiency of the proposed optimal formation approach.

  13. 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.

  14. Dependence of synchronization frequency of Kuramoto oscillators on symmetry of intrinsic frequency in ring network

    Science.gov (United States)

    Saha, Arindam; Amritkar, R. E.

    2014-12-01

    Kuramoto oscillators have been proposed earlier as a model for interacting systems that exhibit synchronisation. In this article we study the difference between networks with symmetric and asymmetric distribution of natural frequencies. We first indicate that the synchronisation frequency of the oscillators is independent of the natural frequency distribution for a completely connected network. Further we analyse the case of oscillators in a directed ring-network where asymmetry in the natural frequency distribution is seen to shift the synchronisation frequency of the network. We also present an estimate of the shift in the frequencies for slightly asymmetric distributions.

  15. Resource Optimization of Mobile Intelligent System with heart MPLS network

    Directory of Open Access Journals (Sweden)

    Mohammed Elkoutbi

    2009-10-01

    Full Text Available In this paper, we introduce the original Mobile Intelligent System (MIS in embeded FPGA architecture. This node will allow the construction of autonomous mobile network units which can move in unknowns, inaccessible or hostile environnement for human being, in order to collect data by various sensors and transmits them by routing to a unit of distant process. In the sake of improving the performance of transmission, we propose a global schema of QoS management using DiffServ/MPLS backbones. We provide an evaluation of several scenarios for combining QoS IP networks with MIS access network. We conclude with a study on interoperability between QoS patterns in access and backbone networks.

  16. Optimal Node Placement in Underwater Wireless Sensor Networks

    KAUST Repository

    Felamban, M.; Shihada, Basem; Jamshaid, K.

    2013-01-01

    Wireless Sensor Networks (WSN) are expected to play a vital role in the exploration and monitoring of underwater areas which are not easily reachable by humans. However, underwater communication via acoustic waves is subject to several performance

  17. Optical Performance Monitoring and Signal Optimization in Optical Networks

    DEFF Research Database (Denmark)

    Petersen, Martin Nordal

    2006-01-01

    The thesis studies performance monitoring for the next generation optical networks. The focus is on all-optical networks with bit-rates of 10 Gb/s or above. Next generation all-optical networks offer large challenges as the optical transmitted distance increases and the occurrence of electrical-optical......-electrical regeneration points decreases. This thesis evaluates the impact of signal degrading effects that are becoming of increasing concern in all-optical high-speed networks due to all-optical switching and higher bit-rates. Especially group-velocity-dispersion (GVD) and a number of nonlinear effects will require...... enhanced attention to avoid signal degradations. The requirements for optical performance monitoring features are discussed, and the thesis evaluates the advantages and necessity of increasing the level of performance monitoring parameters in the physical layer. In particular, methods for optical...

  18. Optimal UAS Assignments and Trajectories for Persistent Surveillance and Data Collection from a Wireless Sensor Network

    Science.gov (United States)

    2015-12-24

    Optimal UAS Assignments and Trajectories for Persistent Surveillance and Data Collection from a Wireless Sensor Network DISSERTATION Nidal M. Jodeh...ASSIGNMENTS AND TRAJECTORIES FOR PERSISTENT SURVEILLANCE AND DATA COLLECTION FROM A WIRELESS SENSOR NETWORK DISSERTATION Presented to the Faculty...COLLECTION FROM A WIRELESS SENSOR NETWORK Nidal M. Jodeh, B.S., M.A.S., M.S. Lieutenant Colonel, USAF Committee Membership: Richard G. Cobb, PhD Chairman

  19. Optimized district heating supply temperature for large networks; Optimerad framledningstemperatur foer stora fjaerrvaermenaet

    Energy Technology Data Exchange (ETDEWEB)

    Saarinen, Lisa; Boman, Katarina

    2012-02-15

    The supply temperature of the Uppsala district heating network was optimized using a model-based control strategy. Simulation of the network showed that the supply temperature could be decreased by in average 8 deg and the electricity production of the plants supplying the network could be increased with 2.5 % during the period January- April, giving an extra income of 1.2 MSEK due to increased income from electricity sales

  20. Price-based optimal control of power flow in electrical energy transmission networks

    NARCIS (Netherlands)

    Jokic, A.; Lazar, M.; Bosch, van den P.P.J.; Bemporad, A.; Bicchi, A.; Buttazzo, G.

    2007-01-01

    This article presents a novel control scheme for achieving optimal power balancing and congestion control in electrical energy transmission networks via nodal prices. We develop an explicit controller that guarantees economically optimal steady-state operation while respecting all line flow

  1. A Neural Network: Family Competition Genetic Algorithm and Its Applications in Electromagnetic Optimization

    Directory of Open Access Journals (Sweden)

    P.-Y. Chen

    2009-01-01

    Full Text Available This study proposes a neural network-family competition genetic algorithm (NN-FCGA for solving the electromagnetic (EM optimization and other general-purpose optimization problems. The NN-FCGA is a hybrid evolutionary-based algorithm, combining the good approximation performance of neural network (NN and the robust and effective optimum search ability of the family competition genetic algorithms (FCGA to accelerate the optimization process. In this study, the NN-FCGA is used to extract a set of optimal design parameters for two representative design examples: the multiple section low-pass filter and the polygonal electromagnetic absorber. Our results demonstrate that the optimal electromagnetic properties given by the NN-FCGA are comparable to those of the FCGA, but reducing a large amount of computation time and a well-trained NN model that can serve as a nonlinear approximator was developed during the optimization process of the NN-FCGA.

  2. Optimization of multilayer neural network parameters for speaker recognition

    Science.gov (United States)

    Tovarek, Jaromir; Partila, Pavol; Rozhon, Jan; Voznak, Miroslav; Skapa, Jan; Uhrin, Dominik; Chmelikova, Zdenka

    2016-05-01

    This article discusses the impact of multilayer neural network parameters for speaker identification. The main task of speaker identification is to find a specific person in the known set of speakers. It means that the voice of an unknown speaker (wanted person) belongs to a group of reference speakers from the voice database. One of the requests was to develop the text-independent system, which means to classify wanted person regardless of content and language. Multilayer neural network has been used for speaker identification in this research. Artificial neural network (ANN) needs to set parameters like activation function of neurons, steepness of activation functions, learning rate, the maximum number of iterations and a number of neurons in the hidden and output layers. ANN accuracy and validation time are directly influenced by the parameter settings. Different roles require different settings. Identification accuracy and ANN validation time were evaluated with the same input data but different parameter settings. The goal was to find parameters for the neural network with the highest precision and shortest validation time. Input data of neural networks are a Mel-frequency cepstral coefficients (MFCC). These parameters describe the properties of the vocal tract. Audio samples were recorded for all speakers in a laboratory environment. Training, testing and validation data set were split into 70, 15 and 15 %. The result of the research described in this article is different parameter setting for the multilayer neural network for four speakers.

  3. Optimizing the District Heating Primary Network from the Perspective of Economic-Specific Pressure Loss

    Directory of Open Access Journals (Sweden)

    Haichao Wang

    2017-07-01

    Full Text Available A district heating (DH system is one of the most important components of infrastructures in cold areas. Proper DH network design should balance the initial investment and the heat distribution cost of the DH network. Currently, this design is often based on a recommended value for specific pressure loss (R = ∆P/L in the main lines. This will result in a feasible network design, but probably not be optimal in most cases. The paper develops a novel optimization model to facilitate the design by considering the initial investment in the pipes and the heat distribution costs. The model will generate all possible network scenarios consisting of different series of diameters for each pipe in the flow direction of the network. Then, the annuity on the initial investment, the heat distribution cost, and the total annual cost will be calculated for each network scenario, taking into account the uncertainties of the material prices and the yearly operating time levels. The model is applied to a sample DH network and the results indicate that the model works quite well, clearly identifying the optimal network design and demonstrating that the heat distribution cost is more important than the initial investment in DH network design.

  4. Distributed optimization of a multisubchannel Ad Hoc cognitive radio network

    KAUST Repository

    Leith, Alex; Kim, Dongin; Alouini, Mohamed-Slim; Wu, Zhiqiang

    2012-01-01

    local information exchanges for dual update. The effects of many system parameters are presented through simulation results, which show that the near-optimal SSA duality scheme can perform significantly better than the suboptimal ESA duality and SSA

  5. Minimum energy control and optimal-satisfactory control of Boolean control network

    International Nuclear Information System (INIS)

    Li, Fangfei; Lu, Xiwen

    2013-01-01

    In the literatures, to transfer the Boolean control network from the initial state to the desired state, the expenditure of energy has been rarely considered. Motivated by this, this Letter investigates the minimum energy control and optimal-satisfactory control of Boolean control network. Based on the semi-tensor product of matrices and Floyd's algorithm, minimum energy, constrained minimum energy and optimal-satisfactory control design for Boolean control network are given respectively. A numerical example is presented to illustrate the efficiency of the obtained results.

  6. Balancing emergency message dissemination and network lifetime in wireless body area network using ant colony optimization and Bayesian game formulation

    Directory of Open Access Journals (Sweden)

    R. Latha

    Full Text Available Nowadays, Wireless Body Area Network (WBAN is emerging very fast and so many new methods and algorithms are coming up for finding the optimal path for disseminating emergency messages. Ant Colony Optimization (ACO is one of the cultural algorithms for solving many hard problems such as Travelling Salesman Problem (TSP. ACO is a natural behaviour of ants, which work stochastically with the help of pheromone trails deposited in the shortest route to find their food. This optimization procedure involves adapting, positive feedback and inherent parallelism. Each ant will deposit certain amount of pheromone in the tour construction it makes searching for food. This type of communication is known as stigmetric communication. In addition, if a dense WBAN environment prevails, such as hospital, i.e. in the environment of overlapping WBAN, game formulation was introduced for analyzing the mixed strategy behaviour of WBAN. In this paper, the ant colony optimization approach to the travelling salesman problem was applied to the WBAN to determine the shortest route for sending emergency message to the doctor via sensor nodes; and also a static Bayesian game formulation with mixed strategy was analysed to enhance the network lifetime. Whenever the patient needs any critical care or any other medical issue arises, emergency messages will be created by the WBAN and sent to the doctor's destination. All the modes of communication were realized in a simulation environment using OMNet++. The authors investigated a balanced model of emergency message dissemination and network lifetime in WBAN using ACO and Bayesian game formulation. Keywords: Wireless body area network, Ant colony optimization, Bayesian game model, Sensor network, Message latency, Network lifetime

  7. Profile-driven regression for modeling and runtime optimization of mobile networks

    DEFF Research Database (Denmark)

    McClary, Dan; Syrotiuk, Violet; Kulahci, Murat

    2010-01-01

    Computer networks often display nonlinear behavior when examined over a wide range of operating conditions. There are few strategies available for modeling such behavior and optimizing such systems as they run. Profile-driven regression is developed and applied to modeling and runtime optimization...... of throughput in a mobile ad hoc network, a self-organizing collection of mobile wireless nodes without any fixed infrastructure. The intermediate models generated in profile-driven regression are used to fit an overall model of throughput, and are also used to optimize controllable factors at runtime. Unlike...

  8. Heat exchanger network retrofit optimization involving heat transfer enhancement

    International Nuclear Information System (INIS)

    Wang Yufei; Smith, Robin; Kim, Jin-Kuk

    2012-01-01

    Heat exchanger network retrofit plays an important role in energy saving in process industry. Many design methods for the retrofit of heat exchanger networks have been proposed during the last three decades. Conventional retrofit methods rely heavily on topology modifications which often result in a long retrofit duration and high initial costs. Moreover, the addition of extra surface area to the heat exchanger can prove difficult due to topology, safety and downtime constraints. Both of these problems can be avoided through the use of heat transfer enhancement in heat exchanger network retrofit. This paper presents a novel design approach to solve heat exchanger network retrofit problems based on heat transfer enhancement. An optimisation method based on simulated annealing has been developed to find the appropriate heat exchangers to be enhanced and to calculate the level of enhancement required. The physical insight of enhanced exchangers is also analysed. The new methodology allows several possible retrofit strategies using different retrofit methods be determined. Comparison of these retrofit strategies demonstrates that retrofit modification duration and payback time are reduced when heat transfer enhancement is utilised. Heat transfer enhancement can be also used as a substitute for increased heat exchanger network surface area to reduce retrofit investment costs.

  9. Optimization of emergy sustainability index for biodiesel supply network design

    International Nuclear Information System (INIS)

    Ren, Jingzheng; Tan, Shiyu; Yang, Le; Goodsite, Michael Evan; Pang, Chengfang; Dong, Lichun

    2015-01-01

    Highlights: • A MINLP model for designing sustainable biodiesel supply network is developed. • Emergy sustainability index is used as the objective to be maximized. • Multiple alternatives in each stage of biodiesel supply network are considered. • Life cycle perspective is incorporated in the design of biodiesel supply network. - Abstract: Sustainability is an important and difficult consideration for the stakeholders/decision-makers when planning a biofuel supply network. In this paper, a Mixed-Integer Non-linear Programming (MINLP) model was developed with the aim to help the stakeholders/decision-maker to select the most sustainable design. In the proposed model, the emergy sustainability index of the whole biodiesel supply networks in a life cycle perspective is employed as the measure of the sustainability, and multiple feedstocks, multiple transport modes, multiple regions for biodiesel production and multiple distribution centers can be considered. After describing the process and mathematic framework of the model, an illustrative case was studied and demonstrated that the proposed methodology is feasible for finding the most sustainable design and planning of biodiesel supply chains

  10. Nuclear reactors project optimization based on neural network and genetic algorithm

    International Nuclear Information System (INIS)

    Pereira, Claudio M.N.A.; Schirru, Roberto; Martinez, Aquilino S.

    1997-01-01

    This work presents a prototype of a system for nuclear reactor core design optimization based on genetic algorithms and artificial neural networks. A neural network is modeled and trained in order to predict the flux and the neutron multiplication factor values based in the enrichment, network pitch and cladding thickness, with average error less than 2%. The values predicted by the neural network are used by a genetic algorithm in this heuristic search, guided by an objective function that rewards the high flux values and penalizes multiplication factors far from the required value. Associating the quick prediction - that may substitute the reactor physics calculation code - with the global optimization capacity of the genetic algorithm, it was obtained a quick and effective system for nuclear reactor core design optimization. (author). 11 refs., 8 figs., 3 tabs

  11. A complex systems approach to planning, optimization and decision making for energy networks

    International Nuclear Information System (INIS)

    Beck, Jessica; Kempener, Ruud; Cohen, Brett; Petrie, Jim

    2008-01-01

    This paper explores a new approach to planning and optimization of energy networks, using a mix of global optimization and agent-based modeling tools. This approach takes account of techno-economic, environmental and social criteria, and engages explicitly with inherent network complexity in terms of the autonomous decision-making capability of individual agents within the network, who may choose not to act as economic rationalists. This is an important consideration from the standpoint of meeting sustainable development goals. The approach attempts to set targets for energy planning, by determining preferred network development pathways through multi-objective optimization. The viability of such plans is then explored through agent-based models. The combined approach is demonstrated for a case study of regional electricity generation in South Africa, with biomass as feedstock

  12. Optimal design of supply chain network under uncertainty environment using hybrid analytical and simulation modeling approach

    Science.gov (United States)

    Chiadamrong, N.; Piyathanavong, V.

    2017-12-01

    Models that aim to optimize the design of supply chain networks have gained more interest in the supply chain literature. Mixed-integer linear programming and discrete-event simulation are widely used for such an optimization problem. We present a hybrid approach to support decisions for supply chain network design using a combination of analytical and discrete-event simulation models. The proposed approach is based on iterative procedures until the difference between subsequent solutions satisfies the pre-determined termination criteria. The effectiveness of proposed approach is illustrated by an example, which shows closer to optimal results with much faster solving time than the results obtained from the conventional simulation-based optimization model. The efficacy of this proposed hybrid approach is promising and can be applied as a powerful tool in designing a real supply chain network. It also provides the possibility to model and solve more realistic problems, which incorporate dynamism and uncertainty.

  13. Optimal Multiuser Zero Forcing with Per-Antenna Power Constraints for Network MIMO Coordination

    Directory of Open Access Journals (Sweden)

    Kaviani Saeed

    2011-01-01

    Full Text Available We consider a multicell multiple-input multiple-output (MIMO coordinated downlink transmission, also known as network MIMO, under per-antenna power constraints. We investigate a simple multiuser zero-forcing (ZF linear precoding technique known as block diagonalization (BD for network MIMO. The optimal form of BD with per-antenna power constraints is proposed. It involves a novel approach of optimizing the precoding matrices over the entire null space of other users' transmissions. An iterative gradient descent method is derived by solving the dual of the throughput maximization problem, which finds the optimal precoding matrices globally and efficiently. The comprehensive simulations illustrate several network MIMO coordination advantages when the optimal BD scheme is used. Its achievable throughput is compared with the capacity region obtained through the recently established duality concept under per-antenna power constraints.

  14. The Study of Cross-layer Optimization for Wireless Rechargeable Sensor Networks Implemented in Coal Mines

    Science.gov (United States)

    Ding, Xu; Shi, Lei; Han, Jianghong; Lu, Jingting

    2016-01-01

    Wireless sensor networks deployed in coal mines could help companies provide workers working in coal mines with more qualified working conditions. With the underground information collected by sensor nodes at hand, the underground working conditions could be evaluated more precisely. However, sensor nodes may tend to malfunction due to their limited energy supply. In this paper, we study the cross-layer optimization problem for wireless rechargeable sensor networks implemented in coal mines, of which the energy could be replenished through the newly-brewed wireless energy transfer technique. The main results of this article are two-fold: firstly, we obtain the optimal relay nodes’ placement according to the minimum overall energy consumption criterion through the Lagrange dual problem and KKT conditions; secondly, the optimal strategies for recharging locomotives and wireless sensor networks are acquired by solving a cross-layer optimization problem. The cyclic nature of these strategies is also manifested through simulations in this paper. PMID:26828500

  15. Converged Wireless Networking and Optimization for Next Generation Services

    Directory of Open Access Journals (Sweden)

    J. Rodriguez

    2010-01-01

    Full Text Available The Next Generation Network (NGN vision is tending towards the convergence of internet and mobile services providing the impetus for new market opportunities in combining the appealing services of internet with the roaming capability of mobile networks. However, this convergence does not go far enough, and with the emergence of new coexistence scenarios, there is a clear need to evolve the current architecture to provide cost-effective end-to-end communication. The LOOP project, a EUREKA-CELTIC driven initiative, is one piece in the jigsaw by helping European industry to sustain a leading role in telecommunications and manufacturing of high-value products and machinery by delivering pioneering converged wireless networking solutions that can be successfully demonstrated. This paper provides an overview of the LOOP project and the key achievements that have been tunneled into first prototypes for showcasing next generation services for operators and process manufacturers.

  16. Location Assisted Handover Optimization for Heterogeneous Wireless Networks

    DEFF Research Database (Denmark)

    Nielsen, Jimmy Jessen; Madsen, Tatiana Kozlova; Schwefel, Hans-Peter

    2011-01-01

    Mobile users typically experience better connectivity if their mobile device performs handover to an available WiFi network rather than using a cellular network. For a moving user the window of opportunity is limited and the timing of the handover is therefore crucial. In this work we propose two...... of these algorithms for a mobile user in an urban scenario with ubiquitous cellular coverage and 250 WiFi APs/km2, and compared the results to a hysteresis-based greedy algorithm and the case of ”always cellular-connected”. Our results show that the proposed look-ahead algorithms outperform the hysteresis...

  17. RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks

    Energy Technology Data Exchange (ETDEWEB)

    Balasundaram, Balabhaskar [Oklahoma State Univ., Stillwater, OK (United States); Butenko, Sergiy [Texas A & M Univ., College Station, TX (United States); Boginski, Vladimir [Univ. of Florida, Gainesville, FL (United States); Uryasev, Stan [Univ. of Florida, Gainesville, FL (United States)

    2013-12-25

    The goal of this project was to study robust connectivity and flow patterns of complex multi-scale systems modeled as networks. Networks provide effective ways to study global, system level properties, as well as local, multi-scale interactions at a component level. Numerous applications from power systems, telecommunication, transportation, biology, social science, and other areas have benefited from novel network-based models and their analysis. Modeling and optimization techniques that employ appropriate measures of risk for identifying robust clusters and resilient network designs in networks subject to uncertain failures were investigated in this collaborative multi-university project. In many practical situations one has to deal with uncertainties associated with possible failures of network components, thereby affecting the overall efficiency and performance of the system (e.g., every node/connection has a probability of partial or complete failure). Some extreme examples include power grid component failures, airline hub failures due to weather, or freeway closures due to emergencies. These are also situations in which people, materials, or other resources need to be managed efficiently. Important practical examples include rerouting flow through power grids, adjusting flight plans, and identifying routes for emergency services and supplies, in the event network elements fail unexpectedly. Solutions that are robust under uncertainty, in addition to being economically efficient, are needed. This project has led to the development of novel models and methodologies that can tackle the optimization problems arising in such situations. A number of new concepts, which have not been previously applied in this setting, were investigated in the framework of the project. The results can potentially help decision-makers to better control and identify robust or risk-averse decisions in such situations. Formulations and optimal solutions of the considered problems need

  18. A visual analytics system for optimizing the performance of large-scale networks in supercomputing systems

    Directory of Open Access Journals (Sweden)

    Takanori Fujiwara

    2018-03-01

    Full Text Available The overall efficiency of an extreme-scale supercomputer largely relies on the performance of its network interconnects. Several of the state of the art supercomputers use networks based on the increasingly popular Dragonfly topology. It is crucial to study the behavior and performance of different parallel applications running on Dragonfly networks in order to make optimal system configurations and design choices, such as job scheduling and routing strategies. However, in order to study these temporal network behavior, we would need a tool to analyze and correlate numerous sets of multivariate time-series data collected from the Dragonfly’s multi-level hierarchies. This paper presents such a tool–a visual analytics system–that uses the Dragonfly network to investigate the temporal behavior and optimize the communication performance of a supercomputer. We coupled interactive visualization with time-series analysis methods to help reveal hidden patterns in the network behavior with respect to different parallel applications and system configurations. Our system also provides multiple coordinated views for connecting behaviors observed at different levels of the network hierarchies, which effectively helps visual analysis tasks. We demonstrate the effectiveness of the system with a set of case studies. Our system and findings can not only help improve the communication performance of supercomputing applications, but also the network performance of next-generation supercomputers. Keywords: Supercomputing, Parallel communication network, Dragonfly networks, Time-series data, Performance analysis, Visual analytics

  19. Addressing the Influence of Hidden State on Wireless Network Optimizations using Performance Maps

    DEFF Research Database (Denmark)

    Højgaard-Hansen, Kim; Madsen, Tatiana Kozlova; Schwefel, Hans-Peter

    2015-01-01

    be used to optimize the use of the wireless net- work by predicting future network performance and scheduling the net- work communication for certain applications on mobile devices. However, other important factors influence the performance of the wireless communication such as changes in the propagation...... environment and resource sharing. In this work we extend the framework of performance maps for wireless networks by introducing network state as an abstraction for all other factors than location that influence the performance. Since network state might not always be directly observable the framework......Performance of wireless connectivity for network client devices is location dependent. It has been shown that it can be beneficial to collect network performance metrics along with location information to generate maps of the location dependent network performance. These performance maps can...

  20. Optimal redistribution of an urban air quality monitoring network using atmospheric dispersion model and genetic algorithm

    Science.gov (United States)

    Hao, Yufang; Xie, Shaodong

    2018-03-01

    Air quality monitoring networks play a significant role in identifying the spatiotemporal patterns of air pollution, and they need to be deployed efficiently, with a minimum number of sites. The revision and optimal adjustment of existing monitoring networks is crucial for cities that have undergone rapid urban expansion and experience temporal variations in pollution patterns. The approach based on the Weather Research and Forecasting-California PUFF (WRF-CALPUFF) model and genetic algorithm (GA) was developed to design an optimal monitoring network. The maximization of coverage with minimum overlap and the ability to detect violations of standards were developed as the design objectives for redistributed networks. The non-dominated sorting genetic algorithm was applied to optimize the network size and site locations simultaneously for Shijiazhuang city, one of the most polluted cities in China. The assessment on the current network identified the insufficient spatial coverage of SO2 and NO2 monitoring for the expanding city. The optimization results showed that significant improvements were achieved in multiple objectives by redistributing the original network. Efficient coverage of the resulting designs improved to 60.99% and 76.06% of the urban area for SO2 and NO2, respectively. The redistributing design for multi-pollutant including 8 sites was also proposed, with the spatial representation covered 52.30% of the urban area and the overlapped areas decreased by 85.87% compared with the original network. The abilities to detect violations of standards were not improved as much as the other two objectives due to the conflicting nature between the multiple objectives. Additionally, the results demonstrated that the algorithm was slightly sensitive to the parameter settings, with the number of generations presented the most significant effect. Overall, our study presents an effective and feasible procedure for air quality network optimization at a city scale.

  1. Wireless Sensor Network Congestion Control Based on Standard Particle Swarm Optimization and Single Neuron PID.

    Science.gov (United States)

    Yang, Xiaoping; Chen, Xueying; Xia, Riting; Qian, Zhihong

    2018-04-19

    Aiming at the problem of network congestion caused by the large number of data transmissions in wireless routing nodes of wireless sensor network (WSN), this paper puts forward an algorithm based on standard particle swarm⁻neural PID congestion control (PNPID). Firstly, PID control theory was applied to the queue management of wireless sensor nodes. Then, the self-learning and self-organizing ability of neurons was used to achieve online adjustment of weights to adjust the proportion, integral and differential parameters of the PID controller. Finally, the standard particle swarm optimization to neural PID (NPID) algorithm of initial values of proportion, integral and differential parameters and neuron learning rates were used for online optimization. This paper describes experiments and simulations which show that the PNPID algorithm effectively stabilized queue length near the expected value. At the same time, network performance, such as throughput and packet loss rate, was greatly improved, which alleviated network congestion and improved network QoS.

  2. A Particle Swarm Optimization Algorithm for Neural Networks in Recognition of Maize Leaf Diseases

    Directory of Open Access Journals (Sweden)

    Zhiyong ZHANG

    2014-03-01

    Full Text Available The neural networks have significance on recognition of crops disease diagnosis? but it has disadvantage of slow convergent speed and shortcoming of local optimum. In order to identify the maize leaf diseases by using machine vision more accurately, we propose an improved particle swarm optimization algorithm for neural networks. With the algorithm, the neural network property is improved. It reasonably confirms threshold and connection weight of neural network, and improves capability of solving problems in the image recognition. At last, an example of the emulation shows that neural network model based on recognizes significantly better than without optimization. Model accuracy has been improved to a certain extent to meet the actual needs of maize leaf diseases recognition.

  3. Identifying the optimal supply temperature in district heating networks - A modelling approach

    DEFF Research Database (Denmark)

    Mohammadi, Soma; Bojesen, Carsten

    2014-01-01

    of this study is to develop a model for thermo-hydraulic calculation of low temperature DH system. The modelling is performed with emphasis on transient heat transfer in pipe networks. The pseudo-dynamic approach is adopted to model the District Heating Network [DHN] behaviour which estimates the temperature...... dynamically while the flow and pressure are calculated on the basis of steady state conditions. The implicit finite element method is applied to simulate the transient temperature behaviour in the network. Pipe network heat losses, pressure drop in the network and return temperature to the plant...... are calculated in the developed model. The model will serve eventually as a basis to find out the optimal supply temperature in an existing DHN in later work. The modelling results are used as decision support for existing DHN; proposing possible modifications to operate at optimal supply temperature....

  4. A mathematical model for optimization of an integrated network logistic design

    Directory of Open Access Journals (Sweden)

    Lida Tafaghodi

    2011-10-01

    Full Text Available In this study, the integrated forward/reverse logistics network is investigated, and a capacitated multi-stage, multi-product logistics network design is proposed by formulating a generalized logistics network problem into a mixed-integer nonlinear programming model (MINLP for minimizing the total cost of the closed-loop supply chain network. Moreover, the proposed model is solved by using optimization solver, which provides the decisions related to the facility location problem, optimum quantity of shipped product, and facility capacity. Numerical results show the power of the proposed MINLP model to avoid th sub-optimality caused by separate design of forward and reverse logistics networks and to handle various transportation modes and periodic demand.

  5. How does network design constrain optimal operation of intermittent water supply?

    Science.gov (United States)

    Lieb, Anna; Wilkening, Jon; Rycroft, Chris

    2015-11-01

    Urban water distribution systems do not always supply water continuously or reliably. As pipes fill and empty, pressure transients may contribute to degraded infrastructure and poor water quality. To help understand and manage this undesirable side effect of intermittent water supply--a phenomenon affecting hundreds of millions of people in cities around the world--we study the relative contributions of fixed versus dynamic properties of the network. Using a dynamical model of unsteady transition pipe flow, we study how different elements of network design, such as network geometry, pipe material, and pipe slope, contribute to undesirable pressure transients. Using an optimization framework, we then investigate to what extent network operation decisions such as supply timing and inflow rate may mitigate these effects. We characterize some aspects of network design that make them more or less amenable to operational optimization.

  6. A two-layer recurrent neural network for nonsmooth convex optimization problems.

    Science.gov (United States)

    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.

  7. An optimization method of VON mapping for energy efficiency and routing in elastic optical networks

    Science.gov (United States)

    Liu, Huanlin; Xiong, Cuilian; Chen, Yong; Li, Changping; Chen, Derun

    2018-03-01

    To improve resources utilization efficiency, network virtualization in elastic optical networks has been developed by sharing the same physical network for difference users and applications. In the process of virtual nodes mapping, longer paths between physical nodes will consume more spectrum resources and energy. To address the problem, we propose a virtual optical network mapping algorithm called genetic multi-objective optimize virtual optical network mapping algorithm (GM-OVONM-AL), which jointly optimizes the energy consumption and spectrum resources consumption in the process of virtual optical network mapping. Firstly, a vector function is proposed to balance the energy consumption and spectrum resources by optimizing population classification and crowding distance sorting. Then, an adaptive crossover operator based on hierarchical comparison is proposed to improve search ability and convergence speed. In addition, the principle of the survival of the fittest is introduced to select better individual according to the relationship of domination rank. Compared with the spectrum consecutiveness-opaque virtual optical network mapping-algorithm and baseline-opaque virtual optical network mapping algorithm, simulation results show the proposed GM-OVONM-AL can achieve the lowest bandwidth blocking probability and save the energy consumption.

  8. Analysis of wireless sensor network topology and estimation of optimal network deployment by deterministic radio channel characterization.

    Science.gov (United States)

    Aguirre, Erik; Lopez-Iturri, Peio; Azpilicueta, Leire; Astrain, José Javier; Villadangos, Jesús; Falcone, Francisco

    2015-02-05

    One of the main challenges in the implementation and design of context-aware scenarios is the adequate deployment strategy for Wireless Sensor Networks (WSNs), mainly due to the strong dependence of the radiofrequency physical layer with the surrounding media, which can lead to non-optimal network designs. In this work, radioplanning analysis for WSN deployment is proposed by employing a deterministic 3D ray launching technique in order to provide insight into complex wireless channel behavior in context-aware indoor scenarios. The proposed radioplanning procedure is validated with a testbed implemented with a Mobile Ad Hoc Network WSN following a chain configuration, enabling the analysis and assessment of a rich variety of parameters, such as received signal level, signal quality and estimation of power consumption. The adoption of deterministic radio channel techniques allows the design and further deployment of WSNs in heterogeneous wireless scenarios with optimized behavior in terms of coverage, capacity, quality of service and energy consumption.

  9. Sonochemical optimization of the conductivity of single wall nanotube networks

    NARCIS (Netherlands)

    Kaempgen, M.; Lebert, M.; Haluska, M.; Nicoloso, N.; Roth, S.

    2008-01-01

    Networks of single-wall carbon nanotubes (SWCNTs) are covalently functionalized with oxygen-containing groups. In lower concentration, these functional groups act as stable dopands improving the conductivity of the SWCNT material. In higher concentration however, their role as defects with a certain

  10. Cooperative driving in mixed traffic networks - Optimizing for performance

    NARCIS (Netherlands)

    Calvert, S.C.; Broek, T.H.A. van den; Noort, M. van

    2012-01-01

    This paper discusses a cooperative adaptive cruise control application and its effects on the traffic system. In previous work this application has been tested on the road, and traffic simulation has been used to scale up the results of the field test to larger networks and more vehicles. The

  11. Optimal Near-Hitless Network Failure Recovery Using Diversity Coding

    Science.gov (United States)

    Avci, Serhat Nazim

    2013-01-01

    Link failures in wide area networks are common and cause significant data losses. Mesh-based protection schemes offer high capacity efficiency but they are slow, require complex signaling, and instable. Diversity coding is a proactive coding-based recovery technique which offers near-hitless (sub-ms) restoration with a competitive spare capacity…

  12. Optimal operation of water distribution networks by predictive control ...

    African Journals Online (AJOL)

    This paper presents an approach for the operational optimisation of potable water distribution networks. The maximisation of the use of low-cost power (e.g. overnight pumping) and the maintenance of a target chlorine concentration at final delivery points were defined as important optimisation objectives. The first objective ...

  13. Towards an optimal topology for hybrid energy networks

    NARCIS (Netherlands)

    Mazairac, L.A.J.; Salenbien, R.; de Vries, B.

    2015-01-01

    Existing networks do not have the quantitative and qualitative capacity to facilitate the transition towards distributed renewable energy sources. Irregular production of energy over time at different locations will alter the current patters of energy flow, necessitating the implementation of short-

  14. On Optimizing Radio Resource Usage in Cellular Networks

    Directory of Open Access Journals (Sweden)

    Bogdan Ciobanu

    2011-01-01

    Full Text Available The control of the interference between mobile terminals and radio access points inside the network represented since always a challenge for all mobile telecommunications service providers. The present paper represents a study regarding the optimum utilization of radio resources in order to obtain a system with as high a capacity as possible for a certain available bandwidth.

  15. Routing versus energy optimization in a linear network

    NARCIS (Netherlands)

    Coenen, Tom Johannes Maria; van Ommeren, Jan C.W.; de Graaf, Maurits

    In wireless networks, devices (or nodes) often have a limited battery supply to use for the sending and reception of transmissions. By allowing nodes to relay messages for other nodes, the distance that needs to be bridged can be reduced, thus limiting the energy needed for a transmission. However,

  16. Optimal Tax Routing : Network Analysis of FDI Diversion

    NARCIS (Netherlands)

    van 't Riet, Maarten; Lejour, Arjen

    2017-01-01

    The international corporate tax system is considered as a network and, just like for transportation, ‘shortest’ paths are computed, minimizing tax payments for multinational enterprises when repatriating profits. We include corporate income tax rates, withholding taxes on dividends, double tax

  17. Camera Network Coverage Improving by Particle Swarm Optimization

    NARCIS (Netherlands)

    Xu, Y.C.; Lei, B.; Hendriks, E.A.

    2011-01-01

    This paper studies how to improve the field of view (FOV) coverage of a camera network. We focus on a special but practical scenario where the cameras are randomly scattered in a wide area and each camera may adjust its orientation but cannot move in any direction. We propose a particle swarm

  18. Hardware Abstraction and Protocol Optimization for Coded Sensor Networks

    DEFF Research Database (Denmark)

    Nistor, Maricica; Roetter, Daniel Enrique Lucani; Barros, João

    2015-01-01

    The design of the communication protocols in wireless sensor networks (WSNs) often neglects several key characteristics of the sensor's hardware, while assuming that the number of transmitted bits is the dominating factor behind the system's energy consumption. A closer look at the hardware speci...

  19. Optimal capacity of Ashkin-Teller neural networks

    International Nuclear Information System (INIS)

    Kozleowski, P.; Bolle, D.

    2001-01-01

    The maximal capacity per number of couplings is calculated for Ashkin-Teller type neural networks using a replica-symmetric Gardner approach. The results are compared with numerical simulations. The best value obtained at κ=0 is α c =2.26±0.01

  20. Finding quasi-optimal network topologies for information transmission in active networks.

    Science.gov (United States)

    Baptista, Murilo S; de Carvalho, Josué X; Hussein, Mahir S

    2008-01-01

    This work clarifies the relation between network circuit (topology) and behaviour (information transmission and synchronization) in active networks, e.g. neural networks. As an application, we show how one can find network topologies that are able to transmit a large amount of information, possess a large number of communication channels, and are robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements) whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons.