WorldWideScience

Sample records for hierarchical interconnection networks

  1. Interconnected networks

    CERN Document Server

    2016-01-01

    This volume provides an introduction to and overview of the emerging field of interconnected networks which include multi layer or multiplex networks, as well as networks of networks. Such networks present structural and dynamical features quite different from those observed in isolated networks. The presence of links between different networks or layers of a network typically alters the way such interconnected networks behave – understanding the role of interconnecting links is therefore a crucial step towards a more accurate description of real-world systems. While examples of such dissimilar properties are becoming more abundant – for example regarding diffusion, robustness and competition – the root of such differences remains to be elucidated. Each chapter in this topical collection is self-contained and can be read on its own, thus making it also suitable as reference for experienced researchers wishing to focus on a particular topic.

  2. Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm

    Directory of Open Access Journals (Sweden)

    M. Kalpana

    2014-01-01

    Full Text Available This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN. It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP. The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.

  3. Interconnection networks

    Science.gov (United States)

    Faber, V.; Moore, J.W.

    1988-06-20

    A network of interconnected processors is formed from a vertex symmetric graph selected from graphs GAMMA/sub d/(k) with degree d, diameter k, and (d + 1)exclamation/ (d /minus/ k + 1)exclamation processors for each d greater than or equal to k and GAMMA/sub d/(k, /minus/1) with degree d /minus/ 1, diameter k + 1, and (d + 1)exclamation/(d /minus/ k + 1)exclamation processors for each d greater than or equal to k greater than or equal to 4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, where each processor has one less channel than the selected number of letters forming the sequence. Where a network GAMMA/sub d/(k, /minus/1) is provided, no processor has a channel connected to form an edge in a direction delta/sub 1/. Each of the channels has an identification number selected from the sequence of letters and connected from a first processor having a first extended address to a second processor having a second address formed from a second extended address defined by moving to the front of the first extended address the letter found in the position within the first extended address defined by the channel identification number. The second address is then formed by selecting the first elements of the second extended address corresponding to the selected number used to form the address permutations. 9 figs.

  4. Interconnected network of cameras

    Science.gov (United States)

    Hosseini Kamal, Mahdad; Afshari, Hossein; Leblebici, Yusuf; Schmid, Alexandre; Vandergheynst, Pierre

    2013-02-01

    The real-time development of multi-camera systems is a great challenge. Synchronization and large data rates of the cameras adds to the complexity of these systems as well. The complexity of such system also increases as the number of their incorporating cameras increases. The customary approach to implementation of such system is a central type, where all the raw stream from the camera are first stored then processed for their target application. An alternative approach is to embed smart cameras to these systems instead of ordinary cameras with limited or no processing capability. Smart cameras with intra and inter camera processing capability and programmability at the software and hardware level will offer the right platform for distributed and parallel processing for multi- camera systems real-time application development. Inter camera processing requires the interconnection of smart cameras in a network arrangement. A novel hardware emulating platform is introduced for demonstrating the concept of the interconnected network of cameras. A methodology is demonstrated for the interconnection network of camera construction and analysis. A sample application is developed and demonstrated.

  5. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    of different types of hierarchical networks. This is supplemented by a review of ring network design problems and a presentation of a model allowing for modeling most hierarchical networks. We use methods based on linear programming to design the hierarchical networks. Thus, a brief introduction to the various....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...... linear programming based methods is included. The thesis is thus suitable as a foundation for study of design of hierarchical networks. The major contribution of the thesis consists of seven papers which are included in the appendix. The papers address hierarchical network design and/or ring network...

  6. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...

  7. Hierarchical nanostructures with unique Y-shaped interconnection networks in manganese substituted cobalt oxides: the enhancement effect on electrochemical sensing performance.

    Science.gov (United States)

    Lan, Wen-Jie; Kuo, Cheng-Chi; Chen, Chun-Hu

    2013-04-14

    A general redox procedure was successfully developed for the controlled synthesis of substituted cobalt oxides with hierarchical flower-like nanostructures comprising unique Y-shaped interconnections. The substitution and nanostructures synergistically enhance the material's electrochemical activities for highly efficient sensing of H2O2.

  8. Graph theory and interconnection networks

    CERN Document Server

    Hsu, Lih-Hsing

    2008-01-01

    The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to graph terminology, the book presents well-known interconnection networks as examples of graphs, followed by in-depth coverage of Hamiltonian graphs. Different types of problems illustrate the wide range of available methods for solving such problems. The text also explores recent progress on the diagnosability of graphs under various models.

  9. Modular, Hierarchical Learning By Artificial Neural Networks

    Science.gov (United States)

    Baldi, Pierre F.; Toomarian, Nikzad

    1996-01-01

    Modular and hierarchical approach to supervised learning by artificial neural networks leads to neural networks more structured than neural networks in which all neurons fully interconnected. These networks utilize general feedforward flow of information and sparse recurrent connections to achieve dynamical effects. The modular organization, sparsity of modular units and connections, and fact that learning is much more circumscribed are all attractive features for designing neural-network hardware. Learning streamlined by imitating some aspects of biological neural networks.

  10. H-P2PSIP: Interconnection of P2PSIP domains for Global Multimedia Services based on a Hierarchical DHT Overlay Network

    OpenAIRE

    Martínez-Yelmo, Isaías; Bikfalvi, Alex; Cuevas, Rubén; Guerrero, Carmen; García-Reinoso, Jaime

    2009-01-01

    The IETF P2PSIP WG is currently standardising a protocol for distributed mul- timedia services combining the media session functionality of SIP and the decentralised distribution and localisation of resources in peer-to-peer networks. The current P2PSIP scenarios only consider the infrastructure for the connectivity inside a single domain. This paper proposes an extension of the current work to a hierarchical multi-domain scenario: a two level hierarchical peer-to-peer overlay architecture...

  11. Centrality in Interconnected Multilayer Networks

    CERN Document Server

    De Domenico, Manlio; Omodei, Elisa; Gómez, Sergio; Arenas, Alex

    2013-01-01

    Real-world complex systems exhibit multiple levels of relationships. In many cases, they require to be modeled by interconnected multilayer networks, characterizing interactions on several levels simultaneously. It is of crucial importance in many fields, from economics to biology, from urban planning to social sciences, to identify the most (or the less) influent nodes in a network. However, defining the centrality of actors in an interconnected structure is not trivial. In this paper, we capitalize on the tensorial formalism, recently proposed to characterize and investigate this kind of complex topologies, to show how several centrality measures -- well-known in the case of standard ("monoplex") networks -- can be extended naturally to the realm of interconnected multiplexes. We consider diagnostics widely used in different fields, e.g., computer science, biology, communication and social sciences, to cite only some of them. We show, both theoretically and numerically, that using the weighted monoplex obta...

  12. Local Network Wideband Interconnection Alternatives.

    Science.gov (United States)

    1984-01-01

    greater than 1.5 Mbps and two standard televison channels. 1.1 SCOPE Interconnection of local area networks within the continental United States is...may influence : a. Media selection, b. Interface design, c. The use of the 1.5 Mbps data transmission capacity, and d. Adherence to the full-motion video

  13. Driving Interconnected Networks to Supercriticality

    Directory of Open Access Journals (Sweden)

    Filippo Radicchi

    2014-04-01

    Full Text Available Networks in the real world do not exist as isolated entities, but they are often part of more complicated structures composed of many interconnected network layers. Recent studies have shown that such mutual dependence makes real networked systems potentially exposed to atypical structural and dynamical behaviors, and thus there is an urgent necessity to better understand the mechanisms at the basis of these anomalies. Previous research has mainly focused on the emergence of atypical properties in relation to the moments of the intra- and interlayer degree distributions. In this paper, we show that an additional ingredient plays a fundamental role for the possible scenario that an interconnected network can face: the correlation between intra- and interlayer degrees. For sufficiently high amounts of correlation, an interconnected network can be tuned, by varying the moments of the intra- and interlayer degree distributions, in distinct topological and dynamical regimes. When instead the correlation between intra- and interlayer degrees is lower than a critical value, the system enters in a supercritical regime where dynamical and topological phases are no longer distinguishable.

  14. Onboard hierarchical network

    Science.gov (United States)

    Tunesi, Luca; Armbruster, Philippe

    2004-02-01

    The objective of this paper is to demonstrate a suitable hierarchical networking solution to improve capabilities and performances of space systems, with significant recurrent costs saving and more efficient design & manufacturing flows. Classically, a satellite can be split in two functional sub-systems: the platform and the payload complement. The platform is in charge of providing power, attitude & orbit control and up/down-link services, whereas the payload represents the scientific and/or operational instruments/transponders and embodies the objectives of the mission. One major possibility to improve the performance of payloads, by limiting the data return to pertinent information, is to process data on board thanks to a proper implementation of the payload data system. In this way, it is possible to share non-recurring development costs by exploiting a system that can be adopted by the majority of space missions. It is believed that the Modular and Scalable Payload Data System, under development by ESA, provides a suitable solution to fulfil a large range of future mission requirements. The backbone of the system is the standardised high data rate SpaceWire network http://www.ecss.nl/. As complement, a lower speed command and control bus connecting peripherals is required. For instance, at instrument level, there is a need for a "local" low complexity bus, which gives the possibility to command and control sensors and actuators. Moreover, most of the connections at sub-system level are related to discrete signals management or simple telemetry acquisitions, which can easily and efficiently be handled by a local bus. An on-board hierarchical network can therefore be defined by interconnecting high-speed links and local buses. Additionally, it is worth stressing another important aspect of the design process: Agencies and ESA in particular are frequently confronted with a big consortium of geographically spread companies located in different countries, each one

  15. Interconnectivity structure of a general interdependent network.

    Science.gov (United States)

    Van Mieghem, P

    2016-04-01

    A general two-layer network consists of two networks G_{1} and G_{2}, whose interconnection pattern is specified by the interconnectivity matrix B. We deduce desirable properties of B from a dynamic process point of view. Many dynamic processes are described by the Laplacian matrix Q. A regular topological structure of the interconnectivity matrix B (constant row and column sum) enables the computation of a nontrivial eigenmode (eigenvector and eigenvalue) of Q. The latter eigenmode is independent from G_{1} and G_{2}. Such a regularity in B, associated to equitable partitions, suggests design rules for the construction of interconnected networks and is deemed crucial for the interconnected network to show intriguing behavior, as discovered earlier for the special case where B=wI refers to an individual node to node interconnection with interconnection strength w. Extensions to a general m-layer network are also discussed.

  16. Epidemics in interconnected small-world networks

    NARCIS (Netherlands)

    Liu, M.; Li, D.; Qin, P.; Liu, C.; Wang, H.; Wang, F.

    2015-01-01

    Networks can be used to describe the interconnections among individuals, which play an important role in the spread of disease. Although the small-world effect has been found to have a significant impact on epidemics in single networks, the small-world effect on epidemics in interconnected networks

  17. Epidemics spreading in interconnected complex networks

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Y. [School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798 (Singapore); Institute of High Performance Computing, Agency for Science, Technology and Research (A-STAR), Singapore 138632 (Singapore); Xiao, G., E-mail: egxxiao@ntu.edu.sg [School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798 (Singapore)

    2012-09-03

    We study epidemic spreading in two interconnected complex networks. It is found that in our model the epidemic threshold of the interconnected network is always lower than that in any of the two component networks. Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. Theoretical analysis and simulation results show that, generally speaking, the epidemic size is not significantly affected by the inter-network correlation. In interdependent networks which can be viewed as a special case of interconnected networks, however, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant. -- Highlights: ► We study epidemic spreading in two interconnected complex networks. ► The epidemic threshold is lower than that in any of the two networks. And Interconnection correlation has impacts on threshold and average outbreak size. ► Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. ► We demonstrated and proved that Interconnection correlation does not affect epidemic size significantly. ► In interdependent networks, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant.

  18. Interconnection of systems : the network paradigm

    NARCIS (Netherlands)

    Maschke, B.M.; Schaft, A.J. van der

    1996-01-01

    In this paper we propose first to recall the different interconnection structures appearing in network models and to show their exact correspondence with Dirac structures. This definition of interconnection is purely implicit hence does not discriminate between inputs and outputs among the interconn

  19. Traffic congestion in interconnected complex networks.

    Science.gov (United States)

    Tan, Fei; Wu, Jiajing; Xia, Yongxiang; Tse, Chi K

    2014-06-01

    Traffic congestion in isolated complex networks has been investigated extensively over the last decade. Coupled network models have recently been developed to facilitate further understanding of real complex systems. Analysis of traffic congestion in coupled complex networks, however, is still relatively unexplored. In this paper, we try to explore the effect of interconnections on traffic congestion in interconnected Barabási-Albert scale-free networks. We find that assortative coupling can alleviate traffic congestion more readily than disassortative and random coupling when the node processing capacity is allocated based on node usage probability. Furthermore, the optimal coupling probability can be found for assortative coupling. However, three types of coupling preferences achieve similar traffic performance if all nodes share the same processing capacity. We analyze interconnected Internet autonomous-system-level graphs of South Korea and Japan and obtain similar results. Some practical suggestions are presented to optimize such real-world interconnected networks accordingly.

  20. Some LCP Decompositions of Multistage Interconnection Networks

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Some useful layered cross product decompositons are derived both for general bit permutation networks and for(2n-1)-stage multistage interconnection networks. Several issues in related works are clarified and the rearrangeability of some interesting networks are considered. In particular, the rearrangeability of one class of networks is formulated as a new type of combinatorial design problmes.

  1. An new representation for interconnection network structures

    Institute of Scientific and Technical Information of China (English)

    刘丽华; 陈建二; 陈松乔; 贾维嘉

    2002-01-01

    An important theoretic interest is to study the relations between different interconnection networks, and to compare the capability and performance of the network structures. The most popular way to do the investigation is network emulation. Based on the classical voltage graph theory, the authors develop a new representation scheme for interconnection network structures. The new approach is a combination of algebraic methods and combinatorial methods. The results demonstrate that the voltage graph theory is a powerful tool for representing well-known interconnection networks and in implementing optimal network emulation algorithms, and in particular, show that all popular interconnection networks have very simple and intuitive representations under the new scheme. The new representation scheme also offers powerful tools for the study of network routings and emulations. For example, we present very simple constructions for optimal network emulations from the cube-connected cycles networks to the butterfly networks, and from the butterfly networks to the hypercube networks. Compared with the most popular way of network emulation, this new scheme is intuitive and easy to realize, and easy to apply to other network structures.

  2. Detecting Hierarchical Structure in Networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard;

    2012-01-01

    a generative Bayesian model that is able to infer whether hierarchies are present or not from a hypothesis space encompassing all types of hierarchical tree structures. For efficient inference we propose a collapsed Gibbs sampling procedure that jointly infers a partition and its hierarchical structure......Many real-world networks exhibit hierarchical organization. Previous models of hierarchies within relational data has focused on binary trees; however, for many networks it is unknown whether there is hierarchical structure, and if there is, a binary tree might not account well for it. We propose....... On synthetic and real data we demonstrate that our model can detect hierarchical structure leading to better link-prediction than competing models. Our model can be used to detect if a network exhibits hierarchical structure, thereby leading to a better comprehension and statistical account the network....

  3. Optical Interconnects for Future Data Center Networks

    CERN Document Server

    Bergman, Keren; Tomkos, Ioannis

    2013-01-01

    Optical Interconnects for Future Data Center Networks covers optical networks and how they can provide high bandwidth, energy efficient interconnects with increased communication bandwidth. This volume, with contributions from leading researchers in the field, presents an integrated view of the expected future requirements of data centers and serves as a reference for some of the most advanced and promising solutions proposed by researchers from leading universities, research labs, and companies. The work also includes several novel architectures, each demonstrating different technologies such as optical circuits, optical switching, MIMO optical OFDM, and others. Additionally, Optical Interconnects for Future Data Center Networks provides invaluable insights into the benefits and advantages of optical interconnects and how they can be a promising alternative for future data center networks.

  4. Traffic congestion in interconnected complex networks

    CERN Document Server

    Tan, Fei; Xia, Yongxiang; Tse, Chi K

    2014-01-01

    Traffic congestion in isolated complex networks has been investigated extensively over the last decade. Coupled network models have recently been developed to facilitate further understanding of real complex systems. Analysis of traffic congestion in coupled complex networks, however, is yet to come. In this paper, we try to explore the effect of interconnections on traffic congestion in interconnected BA scale-free networks. We find that assortative coupling can alleviate traffic congestion better than disassortative and random coupling when the node processing capacity is allocated based on node usage probability. Furthermore, the optimal coupling probability can be found for assortative coupling. However, three types of coupling preferences achieve similar traffic performance if all nodes share the same processing capacity. We analyze interconnected Internet AS-level graphs of Japan and South Korea and obtain similar results. Some practical suggestions are presented to optimize such real-world interconnect...

  5. Navigability of interconnected networks under random failures

    Science.gov (United States)

    De Domenico, Manlio; Solé-Ribalta, Albert; Gómez, Sergio; Arenas, Alex

    2014-01-01

    Assessing the navigability of interconnected networks (transporting information, people, or goods) under eventual random failures is of utmost importance to design and protect critical infrastructures. Random walks are a good proxy to determine this navigability, specifically the coverage time of random walks, which is a measure of the dynamical functionality of the network. Here, we introduce the theoretical tools required to describe random walks in interconnected networks accounting for structure and dynamics inherent to real systems. We develop an analytical approach for the covering time of random walks in interconnected networks and compare it with extensive Monte Carlo simulations. Generally speaking, interconnected networks are more resilient to random failures than their individual layers per se, and we are able to quantify this effect. As an application––which we illustrate by considering the public transport of London––we show how the efficiency in exploring the multiplex critically depends on layers’ topology, interconnection strengths, and walk strategy. Our findings are corroborated by data-driven simulations, where the empirical distribution of check-ins and checks-out is considered and passengers travel along fastest paths in a network affected by real disruptions. These findings are fundamental for further development of searching and navigability strategies in real interconnected systems. PMID:24912174

  6. Partial Synchronization of Interconnected Boolean Networks.

    Science.gov (United States)

    Chen, Hongwei; Liang, Jinling; Lu, Jianquan

    2017-01-01

    This paper addresses the partial synchronization problem for the interconnected Boolean networks (BNs) via the semi-tensor product (STP) of matrices. First, based on an algebraic state space representation of BNs, a necessary and sufficient criterion is presented to ensure the partial synchronization of the interconnected BNs. Second, by defining an induced digraph of the partial synchronized states set, an equivalent graphical description for the partial synchronization of the interconnected BNs is established. Consequently, the second partial synchronization criterion is derived in terms of adjacency matrix of the induced digraph. Finally, two examples (including an epigenetic model) are provided to illustrate the efficiency of the obtained results.

  7. Random walk centrality in interconnected multilayer networks

    CERN Document Server

    Solé-Ribalta, Albert; Gómez, Sergio; Arenas, Alex

    2015-01-01

    Real-world complex systems exhibit multiple levels of relationships. In many cases they require to be modeled as interconnected multilayer networks, characterizing interactions of several types simultaneously. It is of crucial importance in many fields, from economics to biology and from urban planning to social sciences, to identify the most (or the less) influential nodes in a network using centrality measures. However, defining the centrality of actors in interconnected complex networks is not trivial. In this paper, we rely on the tensorial formalism recently proposed to characterize and investigate this kind of complex topologies, and extend two well known random walk centrality measures, the random walk betweenness and closeness centrality, to interconnected multilayer networks. For each of the measures we provide analytical expressions that completely agree with numerically results.

  8. An Improved Interconnection Network Based on NIN

    Institute of Scientific and Technical Information of China (English)

    Li Fei; Li Zhi-tang

    2004-01-01

    The Novel Interconnection Network (NIN)based on inverted-graph topology and crossbar switch is a kind of lower latency and higher throughput interconnection network. But it bas a vital disadvantage, high hardware complexity. In order to reduce system hardware cost, an improved NIN (ININ) structure is proposed. As same as NIN,ININ has constant network diameter. Besides of keeping ad vantages of NIN, hardware cost of ININ is lower than NIN.Furthermore, we design a new deadlock-free routing algorithm for the improved NIN.

  9. Nonlinear Dynamics on Interconnected Networks

    Science.gov (United States)

    Arenas, Alex; De Domenico, Manlio

    2016-06-01

    Networks of dynamical interacting units can represent many complex systems, from the human brain to transportation systems and societies. The study of these complex networks, when accounting for different types of interactions has become a subject of interest in the last few years, especially because its representational power in the description of users' interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.) [1], or in representing different transportation modes in urban networks [2,3]. The general name coined for these networks is multilayer networks, where each layer accounts for a type of interaction (see Fig. 1).

  10. High Performance Interconnect Network for Tianhe System

    Institute of Scientific and Technical Information of China (English)

    廖湘科; 庞征斌; 王克非; 卢宇彤; 谢旻; 夏军; 董德尊; 所光

    2015-01-01

    In this paper, we present the Tianhe-2 interconnect network and message passing services. We describe the architecture of the router and network interface chips, and highlight a set of hardware and software features effectively supporting high performance communications, ranging over remote direct memory access, collective optimization, hardware-enable reliable end-to-end communication, user-level message passing services, etc. Measured hardware performance results are also presented.

  11. Memory Stacking in Hierarchical Networks.

    Science.gov (United States)

    Westö, Johan; May, Patrick J C; Tiitinen, Hannu

    2016-02-01

    Robust representations of sounds with a complex spectrotemporal structure are thought to emerge in hierarchically organized auditory cortex, but the computational advantage of this hierarchy remains unknown. Here, we used computational models to study how such hierarchical structures affect temporal binding in neural networks. We equipped individual units in different types of feedforward networks with local memory mechanisms storing recent inputs and observed how this affected the ability of the networks to process stimuli context dependently. Our findings illustrate that these local memories stack up in hierarchical structures and hence allow network units to exhibit selectivity to spectral sequences longer than the time spans of the local memories. We also illustrate that short-term synaptic plasticity is a potential local memory mechanism within the auditory cortex, and we show that it can bring robustness to context dependence against variation in the temporal rate of stimuli, while introducing nonlinearities to response profiles that are not well captured by standard linear spectrotemporal receptive field models. The results therefore indicate that short-term synaptic plasticity might provide hierarchically structured auditory cortex with computational capabilities important for robust representations of spectrotemporal patterns.

  12. Electric currents in networks of interconnected memristors.

    Science.gov (United States)

    Nedaaee Oskoee, Ehsan; Sahimi, Muhammad

    2011-03-01

    Chua [IEEE Trans. Circuit Theory 1, 507 (1971).] argued that, in addition to the standard resistors, capacitors, and inductors, there must be a fourth fundamental element in electrical circuits, which he called a memory resistor or memristor. Strukov et al. [Nature (London) 453, 80 (2008)] showed how memristive behavior arises in some thin semiconducting films. Unlike other passive elements, however, a memristor with large sizes cannot be fabricated, because scale up of a memristor to dimensions of the order of microns causes loss of the memristive effect by decreasing the width of the doped region relative to the overall size of the memristor. A microscale memristor is, however, essential to most of the potential applications. One way of fabricating such a microscale memristor without losing the memristive effect is to make a network of very small interconnected memristors. We report the results of numerical simulations of electrical currents in such networks of interconnected memristors, as well as memristors and Ohmic conductors. The memristor networks exhibit a rich variety of interesting properties, including weakly and strongly memristive regimes, a possible first-order transition at the connectivity threshold, generation of second harmonics in the strongly memristive regime, and the universal dependence of the network's strength on the frequency. Moreover, we show that the polarity of the memristors can play an important role in the overall properties of the memristor network, in particular its speed of switching, which may have a potentially important application to faster computers. None of these properties are exhibited by linear resistor networks, or even by nonlinear resistor networks without a memory effect.

  13. Manipulating Multistage Interconnection Networks Using Fundamental Arrangements

    Directory of Open Access Journals (Sweden)

    E. Gur

    2010-12-01

    Full Text Available Optimizing interconnection networks is a prime object in switching schemes. In this work the authors present a novel approach for obtaining a required channel arrangement in a multi-stage interconnectionnetwork, using a new concept – a fundamental arrangement. The fundamental arrangement is an initial N-1 stage switch arrangement that allows obtaining any required output channel arrangement given an input arrangement, using N/2 binary switches at each stage. The paper demonstrates how a fundamental arrangement can be achieved and how, once this is done, any required arrangement may be obtained within 2(N-1 steps.

  14. Dynamic load balancing based on restricted multicast tree in triplet-based hierarchical interconnection network%基三分层互连网络中基于受限多播树的动态负载平衡

    Institute of Scientific and Technical Information of China (English)

    刘滨; 石峰; 高玉金; 计卫星; 宋红

    2008-01-01

    To solve the load balancing problem in a triplet-based hierarchical interconnection network(THIN)system,a dynamic load balancing(DLB)algorithm-THINDLBA,which adopts multicast tree(MT)technology to improve the efficiency of interchanging load information,is presented.To support the algorithm,a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed.The load migration request messages from the heavily loaded node(HLN)are spread along an MT whose root is the HLN.And the lightly loaded nodes(LLNs) covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT.So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA,and its load state can be improved as quickly as possible.To avoid wrongly transmitted or redundant DLB messages due to MT overlapping,the MT construction is restricted in the design of the THINDLBA.Through experiments,the effectiveness of four DLB algorithms are compared,and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale compute-intensive tasks more than others.%为了解决基三分层互连网络(THIN)系统中的负载平衡问题,提出一种采用多播树技术提高节点间交换负载信息效率的动态负载平衡(DLB)算法--THINDLBA.设计了一套完整的DLB消息和各节点处的信息维护机制以辅助算法实现.重载节点的负载迁移请求消息沿着一棵以该节点为根的多播树传播,被该树覆盖的轻载节点均成为负载迁移的候选目标节点,可以沿着该树和重载节点交互负载信息,从而使重载节点能够在算法的一次执行中外迁最多的过载进程,尽快改善自身负载状态.算法设计中约束了多播树的构造过程,以避免因树间覆盖造成的消息误传或冗余.通过实验对比了4

  15. Hierarchical networks of scientific journals

    CERN Document Server

    Palla, Gergely; Mones, Enys; Pollner, Péter; Vicsek, Tamás

    2015-01-01

    Scientific journals are the repositories of the gradually accumulating knowledge of mankind about the world surrounding us. Just as our knowledge is organised into classes ranging from major disciplines, subjects and fields to increasingly specific topics, journals can also be categorised into groups using various metrics. In addition to the set of topics characteristic for a journal, they can also be ranked regarding their relevance from the point of overall influence. One widespread measure is impact factor, but in the present paper we intend to reconstruct a much more detailed description by studying the hierarchical relations between the journals based on citation data. We use a measure related to the notion of m-reaching centrality and find a network which shows the level of influence of a journal from the point of the direction and efficiency with which information spreads through the network. We can also obtain an alternative network using a suitably modified nested hierarchy extraction method applied ...

  16. Interacting Social Processes on Interconnected Networks

    Science.gov (United States)

    Alvarez-Zuzek, Lucila G.; La Rocca, Cristian E.; Vazquez, Federico; Braunstein, Lidia A.

    2016-01-01

    We propose and study a model for the interplay between two different dynamical processes –one for opinion formation and the other for decision making– on two interconnected networks A and B. The opinion dynamics on network A corresponds to that of the M-model, where the state of each agent can take one of four possible values (S = −2,−1, 1, 2), describing its level of agreement on a given issue. The likelihood to become an extremist (S = ±2) or a moderate (S = ±1) is controlled by a reinforcement parameter r ≥ 0. The decision making dynamics on network B is akin to that of the Abrams-Strogatz model, where agents can be either in favor (S = +1) or against (S = −1) the issue. The probability that an agent changes its state is proportional to the fraction of neighbors that hold the opposite state raised to a power β. Starting from a polarized case scenario in which all agents of network A hold positive orientations while all agents of network B have a negative orientation, we explore the conditions under which one of the dynamics prevails over the other, imposing its initial orientation. We find that, for a given value of β, the two-network system reaches a consensus in the positive state (initial state of network A) when the reinforcement overcomes a crossover value r*(β), while a negative consensus happens for r βc. We develop an analytical mean-field approach that gives an insight into these regimes and shows that both dynamics are equivalent along the crossover line (r*, β*). PMID:27689698

  17. SIP Trunking — General Requirements for Interconnecting Enterprise Networks

    Directory of Open Access Journals (Sweden)

    Stephan Massner

    2013-10-01

    Full Text Available Based on defined User-to-Network Interconnection (UNI as well as Network-to-Network Interconnection (NNI types various interconnection modes are practicable. These modes allow a further description of interconnection models as well as architecture models including interconnection functions and related interfaces. Topics covered in this article comprise functional entities and related interfaces interconnecting Internet Protocol (IP network domains as well as interfaces between these border functions. Mainly focussed functionalities are Session Border Controllers (SBC from various vendors handling Voice over IP (VoIP session control traffic, SIP traffic specifically. Furthermore, partial and not standardised topics belonging to sub-functions and reference points are disclosed. Prerequisites in view of the continuous work are treated of beyond analyses and classifications of standardisation even if not all open-end questions can be answered completely in subsequent studies 

  18. Performance evaluation of interconnected logistics networks confronted to hub disruptions

    OpenAIRE

    2016-01-01

    International audience; This paper investigates performance of interconnected logistics networks confronted to disruptions at hub level. With traditional supply chain network design, companies define and optimize their own logistics networks, resulting in current logistics systems being a set of independent heterogeneous logistics networks. The concept of PI aims to integrate independent logistics networks into a global, open, interconnected system. Prior research has shown that the new organ...

  19. Maximizing Algebraic Connectivity in Interconnected Networks

    CERN Document Server

    Shakeri, Heman; Sahneh, Faryad Darabi; Poggi-Corradini, Pietro; Scoglio, Caterina

    2015-01-01

    Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with inter-layer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these inter-layer links considering realistic constraints. In this work, we solve the problem of finding an optimal weight distribution for one-to-one inter-layer links under budget constraint. We show that for the special multiplex configurations with identical layers, the uniform weight distribution is always optimal. On the other hand, when the two layers are arbitrary, increasing the budget reveals the existence of two different regimes. Up to a certain threshold budget, the second eigenvalue of the supra-Laplacian is simple, the optimal weight distribution is uniform, and the Fiedler vector is constant on each layer. Increasing t...

  20. Effect of the Interconnected Network Structure on the Epidemic Threshold

    CERN Document Server

    Wang, Huijuan; D'Agostino, Gregorio; Havlin, Shlomo; Stanley, H Eugene; Van Mieghem, Piet

    2013-01-01

    Most real-world networks are not isolated. In order to function fully, they are interconnected with other networks, and this interconnection influences their dynamic processes. For example, when the spread of a disease involves two species, the dynamics of the spread within each species (the contact network) differs from that of the spread between the two species (the interconnected network). We model two generic interconnected networks using two adjacency matrices, A and B, in which A is a 2N*2N matrix that depicts the connectivity within each of two networks of size N, and B a 2N*2N matrix that depicts the interconnections between the two. Using an N-intertwined mean-field approximation, we determine that a critical susceptable-infected-susceptable (SIS) epidemic threshold in two interconnected networks is 1/{\\lambda}1(A+\\alpha B), where the infection rate is \\beta within each of the two individual networks and \\alpha\\beta in the interconnected links between the two networks and {\\lambda}1(A+\\alpha B) is th...

  1. Hierarchical Network Design Using Simulated Annealing

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Clausen, Jens

    2002-01-01

    The hierarchical network problem is the problem of finding the least cost network, with nodes divided into groups, edges connecting nodes in each groups and groups ordered in a hierarchy. The idea of hierarchical networks comes from telecommunication networks where hierarchies exist. Hierarchical...... networks are described and a mathematical model is proposed for a two level version of the hierarchical network problem. The problem is to determine which edges should connect nodes, and how demand is routed in the network. The problem is solved heuristically using simulated annealing which as a sub......-algorithm uses a construction algorithm to determine edges and route the demand. Performance for different versions of the algorithm are reported in terms of runtime and quality of the solutions. The algorithm is able to find solutions of reasonable quality in approximately 1 hour for networks with 100 nodes....

  2. Interconnection Optimization for Multi-Cluster Avionics Networks

    OpenAIRE

    2013-01-01

    National audience; The increasing complexity and heterogeneity of avionics networks make resource optimization a challenging task. In contrast to many previous approaches pursuing the optimization of traffic-source mapping and backbone network analysis, our work presented herein mainly focuses on the optimization of interconnection devices for multi-cluster avionics networks. In this paper, we introduce an optimized interconnection device, integrating novel frame packing strategies and schedu...

  3. Hierarchical modularity in human brain functional networks

    CERN Document Server

    Meunier, D; Fornito, A; Ersche, K D; Bullmore, E T; 10.3389/neuro.11.037.2009

    2010-01-01

    The idea that complex systems have a hierarchical modular organization originates in the early 1960s and has recently attracted fresh support from quantitative studies of large scale, real-life networks. Here we investigate the hierarchical modular (or "modules-within-modules") decomposition of human brain functional networks, measured using functional magnetic resonance imaging (fMRI) in 18 healthy volunteers under no-task or resting conditions. We used a customized template to extract networks with more than 1800 regional nodes, and we applied a fast algorithm to identify nested modular structure at several hierarchical levels. We used mutual information, 0 < I < 1, to estimate the similarity of community structure of networks in different subjects, and to identify the individual network that is most representative of the group. Results show that human brain functional networks have a hierarchical modular organization with a fair degree of similarity between subjects, I=0.63. The largest 5 modules at ...

  4. About message routing in different hypercube interconnection network types

    Directory of Open Access Journals (Sweden)

    M. Popa

    1999-10-01

    Full Text Available The paper treats the problem of message routing in different hypercube interconnection network types. Because the communication algorithms frequently use a few basic communication operations, the purpose was to optain relationships for the total communication time at the implementation of these basic operations in different hypercube interconnection types. The basic communication operations considered were: simple message transfer between two processors, one to all broadcast, all to all broadcast, one to all personalized communication, and all to all personalized communication. For establishing the desired relationships, the starting point were the relationships for the total communication time for the above mentioned operations implemented on three basic interconnection networks: classical hypercube, ring and mesh. The different hypercube interconnection network types considered were: the cube connected cycles network, the extended hypercube, the hypernet network, the k array n hypercube and the composed hypercube. The obtained relationships are useful to establish the performances of the considered networks, from the total communication time point of view, making comparisons between them and between them and the classical hypercube interconnection network with the same number of nodes. The most advantageous interconnection network from the above mentioned point of view, is the composed hypercube with the dynamic position of the nodes.

  5. Analyzing security protocols in hierarchical networks

    DEFF Research Database (Denmark)

    Zhang, Ye; Nielson, Hanne Riis

    2006-01-01

    Validating security protocols is a well-known hard problem even in a simple setting of a single global network. But a real network often consists of, besides the public-accessed part, several sub-networks and thereby forms a hierarchical structure. In this paper we first present a process calculus...... capturing the characteristics of hierarchical networks and describe the behavior of protocols on such networks. We then develop a static analysis to automate the validation. Finally we demonstrate how the technique can benefit the protocol development and the design of network systems by presenting a series...

  6. Torus–Connected Cycles: A Simple and Scalable Topology for Interconnection Networks

    Directory of Open Access Journals (Sweden)

    Bossard Antoine

    2015-12-01

    Full Text Available Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other. Different interconnection networks have been proposed; high performance topologies have been introduced as a replacement for the conventional topologies of recent decades. A high order, a low degree and a small diameter are the usual properties aimed for by such topologies. However, this is not sufficient to lead to actual hardware implementations. Network scalability and topology simplicity are two critical parameters, and they are two of the reasons why modern supercomputers are often based on torus interconnection networks (e.g., Fujitsu K, IBM Sequoia. In this paper we first describe a new topology, torus-connected cycles (TCCs, realizing a combination of a torus and a ring, thus retaining interesting properties of torus networks in addition to those of hierarchical interconnection networks (HINs. Then, we formally establish the diameter of a TCC, and deduce a point-to-point routing algorithm. Next, we propose routing algorithms solving the Hamiltonian cycle problem, and, in a two dimensional TCC, the Hamiltonian path one. Correctness and complexities are formally proved. The proposed algorithms are time-optimal.

  7. Universal hierarchical behavior of citation networks

    CERN Document Server

    Mones, Enys; Vicsek, Tamás

    2014-01-01

    Many of the essential features of the evolution of scientific research are imprinted in the structure of citation networks. Connections in these networks imply information about the transfer of knowledge among papers, or in other words, edges describe the impact of papers on other publications. This inherent meaning of the edges infers that citation networks can exhibit hierarchical features, that is typical of networks based on decision-making. In this paper, we investigate the hierarchical structure of citation networks consisting of papers in the same field. We find that the majority of the networks follow a universal trend towards a highly hierarchical state, and i) the various fields display differences only concerning their phase in life (distance from the "birth" of a field) or ii) the characteristic time according to which they are approaching the stationary state. We also show by a simple argument that the alterations in the behavior are related to and can be understood by the degree of specializatio...

  8. Genetic Algorithm for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sajid Hussain

    2007-09-01

    Full Text Available Large scale wireless sensor networks (WSNs can be used for various pervasive and ubiquitous applications such as security, health-care, industry automation, agriculture, environment and habitat monitoring. As hierarchical clusters can reduce the energy consumption requirements for WSNs, we investigate intelligent techniques for cluster formation and management. A genetic algorithm (GA is used to create energy efficient clusters for data dissemination in wireless sensor networks. The simulation results show that the proposed intelligent hierarchical clustering technique can extend the network lifetime for different network deployment environments.

  9. Spontaneous synchronization driven by energy transport in interconnected networks

    CERN Document Server

    Nicosia, Vincenzo; Latora, Vito; Arenas, Alex

    2014-01-01

    The existence of intertwined dynamical processes in interconnected networks is a distinctive aspect of complex systems. For example, cerebral circulation delivers oxygenated blood to the brain through blood vessels, and in turn the neural system in the brain is responsible, through neural network connections, for mediating changes in cerebral blood flow. To understand the effects of the coupling between different processes we study the case of two interconnected networks, one accounting for energy transport and the other for a synchronization dynamics. We observe the emergence of switch-like spontaneous synchronization, similar to that seen in the transition between resting-state and cognitive activity in the human brain, for a wide range of control parameters and for different network topologies. We suggest that similarly interconnected dynamical processes could be responsible for spontaneous synchronization transitions observed in natural systems.

  10. Fundamentals of reliability engineering applications in multistage interconnection networks

    CERN Document Server

    Gunawan, Indra

    2014-01-01

    This book presents fundamentals of reliability engineering with its applications in evaluating reliability of multistage interconnection networks. In the first part of the book, it introduces the concept of reliability engineering, elements of probability theory, probability distributions, availability and data analysis.  The second part of the book provides an overview of parallel/distributed computing, network design considerations, and more.  The book covers a comprehensive reliability engineering methods and its practical aspects in the interconnection network systems. Students, engineers, researchers, managers will find this book as a valuable reference source.

  11. Hierarchical social networks and information flow

    Science.gov (United States)

    López, Luis; F. F. Mendes, Jose; Sanjuán, Miguel A. F.

    2002-12-01

    Using a simple model for the information flow on social networks, we show that the traditional hierarchical topologies frequently used by companies and organizations, are poorly designed in terms of efficiency. Moreover, we prove that this type of structures are the result of the individual aim of monopolizing as much information as possible within the network. As the information is an appropriate measurement of centrality, we conclude that this kind of topology is so attractive for leaders, because the global influence each actor has within the network is completely determined by the hierarchical level occupied.

  12. Strategic games on a hierarchical network model

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Among complex network models, the hierarchical network model is the one most close to such real networks as world trade web, metabolic network, WWW, actor network, and so on. It has not only the property of power-law degree distribution, but growth based on growth and preferential attachment, showing the scale-free degree distribution property. In this paper, we study the evolution of cooperation on a hierarchical network model, adopting the prisoner's dilemma (PD) game and snowdrift game (SG) as metaphors of the interplay between connected nodes. BA model provides a unifying framework for the emergence of cooperation. But interestingly, we found that on hierarchical model, there is no sign of cooperation for PD game, while the frequency of cooperation decreases as the common benefit decreases for SG. By comparing the scaling clustering coefficient properties of the hierarchical network model with that of BA model, we found that the former amplifies the effect of hubs. Considering different performances of PD game and SG on complex network, we also found that common benefit leads to cooperation in the evolution. Thus our study may shed light on the emergence of cooperation in both natural and social environments.

  13. Ultrafast Hierarchical OTDM/WDM Network

    Directory of Open Access Journals (Sweden)

    Hideyuki Sotobayashi

    2003-12-01

    Full Text Available Ultrafast hierarchical OTDM/WDM network is proposed for the future core-network. We review its enabling technologies: C- and L-wavelength-band generation, OTDM-WDM mutual multiplexing format conversions, and ultrafast OTDM wavelengthband conversions.

  14. Hierarchical Power Flow Control Strategy and Algorithm for Multi-terminal Interconnected AC/DC Distribution Network%多端互联交直流配电网的潮流分层控制策略及算法

    Institute of Scientific and Technical Information of China (English)

    彭克; 咸日常; 张新慧; 陈羽; 陆海

    2016-01-01

    随着直流配电系统的提出与发展,传统配电网的网架结构与运行方式正在逐渐改变,未来会形成交直流混联的配电网新型供电模式,交直流之间的电气量耦合给潮流的有序控制以及混联求解都带来了新的挑战。为此,提出了多端互联的交直流配电网分层潮流控制策略,实现交直流电压的有序控制。第一层控制由交直流互联的换流器实现,采用下垂控制均摊直流配电网内的负荷,并根据下垂曲线对直流母线电压进行控制。第二层控制由具有调压功能的分布式电源实现,维持就地电压平衡。第三层控制由电压调节器实现,进行区域电压调整。针对交直流配电网的特点,提出了高斯—牛顿交直流混合潮流算法,提高了算法的收敛性能。最后,在改进的 IEEE 123节点系统上进行了测试,验证了所述控制策略及算法的有效性与正确性。%With the development of DC distribution system , the network structure and operation mode of traditional distribution system have greatly changed . The AC/DC hybrid distribution network will be dominant in the future and poses a new challenge to power flow control and the AC/DC hybrid algorithm . For this reason , a hierarchical power flow control strategy is proposed to carry out orderly voltage control . At the first layer , DC load sharing is realized by the bidirectional converter with droop control , and DC bus voltage is controlled according to the droop control curve , at the second layer , local voltage balance is regulated by the distributed generator , while at the third , regional voltage is controlled by the voltage regulator . Secondly , the Gauss‐Newton hybrid algorithm is proposed according to the characteristics of the AC/DC hybrid distribution system to improve the convergence performance of the algorithm . Finally , the test results on a modified IEEE 123‐bus system show the validity and

  15. Noise enhances information transfer in hierarchical networks.

    Science.gov (United States)

    Czaplicka, Agnieszka; Holyst, Janusz A; Sloot, Peter M A

    2013-01-01

    We study the influence of noise on information transmission in the form of packages shipped between nodes of hierarchical networks. Numerical simulations are performed for artificial tree networks, scale-free Ravasz-Barabási networks as well for a real network formed by email addresses of former Enron employees. Two types of noise are considered. One is related to packet dynamics and is responsible for a random part of packets paths. The second one originates from random changes in initial network topology. We find that the information transfer can be enhanced by the noise. The system possesses optimal performance when both kinds of noise are tuned to specific values, this corresponds to the Stochastic Resonance phenomenon. There is a non-trivial synergy present for both noisy components. We found also that hierarchical networks built of nodes of various degrees are more efficient in information transfer than trees with a fixed branching factor.

  16. Optical interconnection networks for high-performance computing systems.

    Science.gov (United States)

    Biberman, Aleksandr; Bergman, Keren

    2012-04-01

    Enabled by silicon photonic technology, optical interconnection networks have the potential to be a key disruptive technology in computing and communication industries. The enduring pursuit of performance gains in computing, combined with stringent power constraints, has fostered the ever-growing computational parallelism associated with chip multiprocessors, memory systems, high-performance computing systems and data centers. Sustaining these parallelism growths introduces unique challenges for on- and off-chip communications, shifting the focus toward novel and fundamentally different communication approaches. Chip-scale photonic interconnection networks, enabled by high-performance silicon photonic devices, offer unprecedented bandwidth scalability with reduced power consumption. We demonstrate that the silicon photonic platforms have already produced all the high-performance photonic devices required to realize these types of networks. Through extensive empirical characterization in much of our work, we demonstrate such feasibility of waveguides, modulators, switches and photodetectors. We also demonstrate systems that simultaneously combine many functionalities to achieve more complex building blocks. We propose novel silicon photonic devices, subsystems, network topologies and architectures to enable unprecedented performance of these photonic interconnection networks. Furthermore, the advantages of photonic interconnection networks extend far beyond the chip, offering advanced communication environments for memory systems, high-performance computing systems, and data centers.

  17. Biased trapping issue on weighted hierarchical networks

    Indian Academy of Sciences (India)

    Meifeng Dai; Jie Liu; Feng Zhu

    2014-10-01

    In this paper, we present trapping issues of weight-dependent walks on weighted hierarchical networks which are based on the classic scale-free hierarchical networks. Assuming that edge’s weight is used as local information by a random walker, we introduce a biased walk. The biased walk is that a walker, at each step, chooses one of its neighbours with a probability proportional to the weight of the edge. We focus on a particular case with the immobile trap positioned at the hub node which has the largest degree in the weighted hierarchical networks. Using a method based on generating functions, we determine explicitly the mean first-passage time (MFPT) for the trapping issue. Let parameter (0 < < 1) be the weight factor. We show that the efficiency of the trapping process depends on the parameter a; the smaller the value of a, the more efficient is the trapping process.

  18. Novel paradigm for integrated photonics circuits: transient interconnection network

    Science.gov (United States)

    Fazio, Eugenio; Belardini, Alessandro; Bastiani, Lorenzo; Alonzo, Massimo; Chauvet, Mathieu; Zheludev, Nikolay I.; Soci, Cesare

    2017-01-01

    Self-confined beams and spatial solitons were always investigated for a purely academic point of view, describing their formation and cross-interaction. We propose a novel paradigm for integrated photonics circuits based on self-confined interconnections. We consider that circuits are not designed since beginning; a network of writing lasers provide the circuit configuration inside which information at a different wavelength travels. we propose new designs for interconnections and both digital and analog switching gates somehow inspired by Nature, following analog decision routes used in biological networks like brain synapsis or animal path finding.

  19. Hierarchical Neural Network Structures for Phoneme Recognition

    CERN Document Server

    Vasquez, Daniel; Minker, Wolfgang

    2013-01-01

    In this book, hierarchical structures based on neural networks are investigated for automatic speech recognition. These structures are evaluated on the phoneme recognition task where a  Hybrid Hidden Markov Model/Artificial Neural Network paradigm is used. The baseline hierarchical scheme consists of two levels each which is based on a Multilayered Perceptron. Additionally, the output of the first level serves as a second level input. The computational speed of the phoneme recognizer can be substantially increased by removing redundant information still contained at the first level output. Several techniques based on temporal and phonetic criteria have been investigated to remove this redundant information. The computational time could be reduced by 57% whilst keeping the system accuracy comparable to the baseline hierarchical approach.

  20. Non-homogeneous fractal hierarchical weighted networks.

    Science.gov (United States)

    Dong, Yujuan; Dai, Meifeng; Ye, Dandan

    2015-01-01

    A model of fractal hierarchical structures that share the property of non-homogeneous weighted networks is introduced. These networks can be completely and analytically characterized in terms of the involved parameters, i.e., the size of the original graph Nk and the non-homogeneous weight scaling factors r1, r2, · · · rM. We also study the average weighted shortest path (AWSP), the average degree and the average node strength, taking place on the non-homogeneous hierarchical weighted networks. Moreover the AWSP is scrupulously calculated. We show that the AWSP depends on the number of copies and the sum of all non-homogeneous weight scaling factors in the infinite network order limit.

  1. Hierarchical community structure in complex (social) networks

    CERN Document Server

    Massaro, Emanuele

    2014-01-01

    The investigation of community structure in networks is a task of great importance in many disciplines, namely physics, sociology, biology and computer science where systems are often represented as graphs. One of the challenges is to find local communities from a local viewpoint in a graph without global information in order to reproduce the subjective hierarchical vision for each vertex. In this paper we present the improvement of an information dynamics algorithm in which the label propagation of nodes is based on the Markovian flow of information in the network under cognitive-inspired constraints \\cite{Massaro2012}. In this framework we have introduced two more complex heuristics that allow the algorithm to detect the multi-resolution hierarchical community structure of networks from a source vertex or communities adopting fixed values of model's parameters. Experimental results show that the proposed methods are efficient and well-behaved in both real-world and synthetic networks.

  2. Very Large Scale Optical Interconnect Systems For Different Types of Optical Interconnection Networks

    Directory of Open Access Journals (Sweden)

    Ahmed Nabih Zaki Rashed

    2012-04-01

    Full Text Available The need for scalable systems in market demands in terms of lower computing costs and protection of customer investment in computing: scaling up the system to quickly meet business growth is obviously a better way of protecting investment: hardware, software, and human resources. A scalable system should be incrementally expanded, delivering linear incremental performance with a near linear cost increase, and with minimal system redesign (size scalability, additionally, it should be able to use successive, faster processors with minimal additional costs and redesign (generation scalability. On the architecture side, the key design element is the interconnection network. The interconnection network must be able to increase in size using few building blocks and with minimum redesign, deliver a bandwidth that grows linearly with the increase in system size, maintain a low or (constant latency, incur linear cost increase, and readily support the use of new faster processors. The major problem is the ever-increasing speed of the processors themselves and the growing performance gap between processor technology and interconnect technology. Increased central processing unit (CPU speeds and effectiveness of memory latency-tolerating techniques.

  3. Study of General Incomplete Star Interconnection Networks

    Institute of Scientific and Technical Information of China (English)

    史云涛; 侯紫峰; 宋建平

    2002-01-01

    The star networks, which were originally proposed by Akers and Harel, have suffered from a rigorous restriction on the number of nodes. The general incomplete star networks (GISN) are proposed in this paper to relieve this restriction. An efficient labeling scheme for GISN is given, and routing and broadcasting algorithms are also presented for GISN. The communication diameter of GISN is shown to be bounded by 4n - 7. The proposed single node broadcasting algorithm is optimal with respect to time complexity O(n log2 n).

  4. A Unified Access Model for Interconnecting Heterogeneous Wireless Networks

    Science.gov (United States)

    2015-05-01

    with each other via a central controller. The 2 access technologies used were 802.11 ( WiFi ) and a Carrier-Sense Multiple Access (CSMA) protocol ...wireless subnets could communicate with each other. 3. Results and Discussion Using the 3-VM LTE/ WiFi configuration, we placed a User Datagram Protocol ...control plane protocols . A network model that can abstract disparate MAC layers in heterogeneous networks and interconnect them using a unified and

  5. Interconnecting Networks of Practice for Professional Learning

    Directory of Open Access Journals (Sweden)

    Julie Mackey

    2011-03-01

    Full Text Available The article explores the complementary connections between communities of practice and the ways in which individuals orchestrate their engagement with others to further their professional learning. It does so by reporting on part of a research project conducted in New Zealand on teachers’ online professional learning in a university graduate diploma program on ICT education. Evolving from social constructivist pedagogy for online professional development, the research describes how teachers create their own networks of practice as they blend online and offline interactions with fellow learners and workplace colleagues. Teachers’ perspectives of their professional learning activities challenge the way universities design formal online learning communities and highlight the potential for networked learning in the zones and intersections between professional practice and study.The article extends the concepts of Lave and Wenger’s (1991 communities of practice social theory of learning by considering the role participants play in determining their engagement and connections in and across boundaries between online learning communities and professional practice. It provides insights into the applicability of connectivist concepts for developing online pedagogies to promote socially networked learning and for emphasising the role of the learner in defining their learning pathways.

  6. The Hourglass Effect in Hierarchical Dependency Networks

    CERN Document Server

    Sabrin, Kaeser M

    2016-01-01

    Many hierarchically modular systems are structured in a way that resembles a bow-tie or hourglass. This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system (the waist of the hourglass). We investigate the hourglass effect in general (not necessarily layered) hierarchical dependency networks. Our analysis focuses on the number of source-to-target dependency paths that traverse each vertex, and it identifies the core of a dependency network as the smallest set of vertices that collectively cover almost all dependency paths. We then examine if a given network exhibits the hourglass property or not, comparing its core size with a "flat" (i.e., non-hierarchical) network that preserves the source dependencies of each target in the original network. As a possible explanation for the hourglass effect, we propose the Reuse Preference (RP) model that captures the bias of new mo...

  7. Derivatives and credit contagion in interconnected networks

    Science.gov (United States)

    Heise, S.; Kühn, R.

    2012-04-01

    The importance of adequately modeling credit risk has once again been highlighted in the recent financial crisis. Defaults tend to cluster around times of economic stress due to poor macro-economic conditions, but also by directly triggering each other through contagion. Although credit default swaps have radically altered the dynamics of contagion for more than a decade, models quantifying their impact on systemic risk are still missing. Here, we examine contagion through credit default swaps in a stylized economic network of corporates and financial institutions. We analyse such a system using a stochastic setting, which allows us to exploit limit theorems to exactly solve the contagion dynamics for the entire system. Our analysis shows that, by creating additional contagion channels, CDS can actually lead to greater instability of the entire network in times of economic stress. This is particularly pronounced when CDS are used by banks to expand their loan books (arguing that CDS would offload the additional risks from their balance sheets). Thus, even with complete hedging through CDS, a significant loan book expansion can lead to considerably enhanced probabilities for the occurrence of very large losses and very high default rates in the system. Our approach adds a new dimension to research on credit contagion, and could feed into a rational underpinning of an improved regulatory framework for credit derivatives.

  8. Synchronization patterns: from network motifs to hierarchical networks

    Science.gov (United States)

    Krishnagopal, Sanjukta; Lehnert, Judith; Poel, Winnie; Zakharova, Anna; Schöll, Eckehard

    2017-03-01

    We investigate complex synchronization patterns such as cluster synchronization and partial amplitude death in networks of coupled Stuart-Landau oscillators with fractal connectivities. The study of fractal or self-similar topology is motivated by the network of neurons in the brain. This fractal property is well represented in hierarchical networks, for which we present three different models. In addition, we introduce an analytical eigensolution method and provide a comprehensive picture of the interplay of network topology and the corresponding network dynamics, thus allowing us to predict the dynamics of arbitrarily large hierarchical networks simply by analysing small network motifs. We also show that oscillation death can be induced in these networks, even if the coupling is symmetric, contrary to previous understanding of oscillation death. Our results show that there is a direct correlation between topology and dynamics: hierarchical networks exhibit the corresponding hierarchical dynamics. This helps bridge the gap between mesoscale motifs and macroscopic networks. This article is part of the themed issue 'Horizons of cybernetical physics'.

  9. Probabilistic Analysis of Multistage Interconnection Network Performance

    Science.gov (United States)

    1992-04-01

    out itndep~endlence of channel loads has b~een pie -co.nr)tited. and channels have been assigned itatnes genleratedl from thle namies of the their nodes...lthe exam pie below: > (setq d8x8 (parse-multistage-network determinist ically-interwired-8x8-rep)) (HA PTER I. j1I:1?F� Nx(’l0 A ( I’ . iI’l.I...performs considerably worse than either. (71.1 I’TI’) I . tI’IIOXI.I.IJTO.\\’.0’ -)? A1 I’L TIPO I’ll Xl7J0IK.K 71 Throughput 12 1 10 8 O 6 4 2 0 0.2 0.4

  10. First-passage phenomena in hierarchical networks

    CERN Document Server

    Tavani, Flavia

    2016-01-01

    In this paper we study Markov processes and related first passage problems on a class of weighted, modular graphs which generalize the Dyson hierarchical model. In these networks, the coupling strength between two nodes depends on their distance and is modulated by a parameter $\\sigma$. We find that, in the thermodynamic limit, ergodicity is lost and the "distant" nodes can not be reached. Moreover, for finite-sized systems, there exists a threshold value for $\\sigma$ such that, when $\\sigma$ is relatively large, the inhomogeneity of the coupling pattern prevails and "distant" nodes are hardly reached. The same analysis is carried on also for generic hierarchical graphs, where interactions are meant to involve $p$-plets ($p>2$) of nodes, finding that ergodicity is still broken in the thermodynamic limit, but no threshold value for $\\sigma$ is evidenced, ultimately due to a slow growth of the network diameter with the size.

  11. Exploiting the Capabilities of the Interconnection Network on Dawning-1000

    Institute of Scientific and Technical Information of China (English)

    XIAO Limin; ZHU Mingfa

    1999-01-01

    On Dawning-1000, the two-dimension mesh interconnection network enables low-latency, high-bandwidth communication, however, these capabilities have not been realized because of the high processing overhead imposed by existing communication software. Active Messages provide an efficient communication mechanism with small overhead, which may expose the raw capabilities of the underlying hardware. In addition, one of the most promising techniques, user-level communication, is often used to improve the performance of the traditional protocols such as TCP and UDP, andis also adopted in implementing the novel abstractions like Active Messages. Thus a user-level Active Messages model is designed and implemented on Dawning-1000. Preliminary experiments show that the combination of Active Messages mechanism and user-level communication technique is quite efficient in reducing software overhead associated with sending and receiving messages, and in exploiting the capabilitiesof the interconnection network.

  12. A 3D bus interconnect for network line cards

    OpenAIRE

    Engel, J; Kocak, T

    2004-01-01

    In this paper, we propose a 3D bus architecture as a processor-memory interconnection system to increase the throughput of the memory system currently used on line cards. The 3D bus architecture allows multiple processing elements on a line card to access a shared memory. The main advantage of the proposed architecture is to increase the network processor off-chip memory bandwidth while diminishing the latency otherwise caused by the single bus competition.

  13. Performance evaluation of two highly interconnected Data Center networks

    DEFF Research Database (Denmark)

    Andrus, Bogdan-Mihai; Mihai Poncea, Ovidiu; Vegas Olmos, Juan José;

    2015-01-01

    In this paper we present the analysis of highly interconnected topologies like hypercube and torus and how they can be implemented in data centers in order to cope with the rapid increase and demands for performance of the internal traffic. By replicating the topologies and subjecting them...... of the network was increased by a factor of 32. The performance measurements are supported by abstract metrics that also give a cost and complexity indication in choosing the right topology for the required application....

  14. A New Family of Interconnection Networks of Fixed Degree Three

    Institute of Scientific and Technical Information of China (English)

    Shu-Ming Zhou; Wen-Jun Xiao

    2004-01-01

    A new family of interconnection networks WGn is proposed, that is constant degree 3 Cayley graph,and is isomorphic to a Cayley graph of the wreath product Z2lSn when the generator set is chosen properly. Its different algebraic properties is investigated and a routing algorithm is given with the diameter upper bounded by 3n2 - 6n + 4. The embedding properties and the fault tolerance are devired. In conclusion, we present a comparison of some familiar networks with constant degree 3.

  15. Rescue of endemic states in interconnected networks with adaptive coupling

    CERN Document Server

    Vazquez, F; Miguel, M San

    2015-01-01

    We study the Susceptible-Infected-Susceptible model of epidemic spreading on two layers of networks interconnected by adaptive links, which are rewired at random to avoid contacts between infected and susceptible nodes at the interlayer. We find that the rewiring reduces the effective connectivity for the transmission of the disease between layers, and may even totally decouple the networks. Weak endemic states, in which the epidemics spreads only if the two layers are interconnected, show a transition from the endemic to the healthy phase when the rewiring overcomes a threshold value that depends on the infection rate, the strength of the coupling and the mean connectivity of the networks. In the strong endemic scenario, in which the epidemics is able to spread on each separate network, the prevalence in each layer decreases when increasing the rewiring, arriving to single network values only in the limit of infinitely fast rewiring. We also find that finite-size effects are amplified by the rewiring, as the...

  16. Interconnection between packet switching national networks and local packet radio communication networks

    Science.gov (United States)

    Talone, P.; Trigila, S.

    1985-07-01

    Multipoint topology networks based on a single statistically distributed radiocommunication channel are considered, referring only to restricted area networks with line of sight type links. The architecture and protocols of such networks are reviewed. The problems related to the interconnection of such networks with large public packet switching communication networks are examined. Several hypothesis are studied concluding that mainly in the case of emergencies or catastrophic events these networks are an extremely useful resource.

  17. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems.

    Directory of Open Access Journals (Sweden)

    Martin Rosvall

    Full Text Available To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between compression and pattern detection; by compressing a description of a random walker as a proxy for real flow on a network, we find regularities in the network that induce this system-wide flow. Finding the shortest multilevel description of the random walker therefore gives us the best hierarchical clustering of the network--the optimal number of levels and modular partition at each level--with respect to the dynamics on the network. With a novel search algorithm, we extract and illustrate the rich multilevel organization of several large social and biological networks. For example, from the global air traffic network we uncover countries and continents, and from the pattern of scientific communication we reveal more than 100 scientific fields organized in four major disciplines: life sciences, physical sciences, ecology and earth sciences, and social sciences. In general, we find shallow hierarchical structures in globally interconnected systems, such as neural networks, and rich multilevel organizations in systems with highly separated regions, such as road networks.

  18. A Cost-Effective Architecture For Optical Multistage Interconnection Network

    Directory of Open Access Journals (Sweden)

    Mehrnaz Moudi

    2013-02-01

    Full Text Available In this paper a new architecture for Optical Multistage Interconnection Networks (OMINs has been proposed to avoid crosstalk problem. At the same time, the probablity of losing pass through an optical long connection path is reduced in this architecture. The new architecture is inherent form the standard OMIN by converting two switches of the network to one switch in each row. By reducing the number of switches in new architecture, the reduction in the execution time is considered. The modifying in the number of passes via the same low stage transformation is negligible. The ability of the new architecture to decrease cost and avoid crosstalk has been validated through simulations that show improvement in the network performance in terms of approximately 30% reduction in the execution time.

  19. A reconfigurable optoelectronic interconnect technology for multi-processor networks

    Energy Technology Data Exchange (ETDEWEB)

    Lu, Y.C.; Cheng, J. [Univ. of New Mexico, Albuquerque, NM (United States). Center for High Technology Materials; Zolper, J.C.; Klem, J. [Sandia National Labs., Albuquerque, NM (United States)

    1995-05-01

    This paper describes a new optical interconnect architecture and the integrated optoelectronic circuit technology for implementing a parallel, reconfigurable, multiprocessor network. The technology consists of monolithic array`s of optoelectronic switches that integrate vertical-cavity surface-emitting lasers with three-terminal heterojunction phototransistors, which effectively combined the functions of an optical transceiver and an optical spatial routing switch. These switches have demonstrated optical switching at 200 Mb/s, and electrical-to-optical data conversion at > 500 Mb/s, with a small-signal electrical-to-optical modulation bandwidth of {approximately} 4 GHz.

  20. HIDEN: Hierarchical decomposition of regulatory networks

    Directory of Open Access Journals (Sweden)

    Gülsoy Günhan

    2012-09-01

    Full Text Available Abstract Background Transcription factors regulate numerous cellular processes by controlling the rate of production of each gene. The regulatory relations are modeled using transcriptional regulatory networks. Recent studies have shown that such networks have an underlying hierarchical organization. We consider the problem of discovering the underlying hierarchy in transcriptional regulatory networks. Results We first transform this problem to a mixed integer programming problem. We then use existing tools to solve the resulting problem. For larger networks this strategy does not work due to rapid increase in running time and space usage. We use divide and conquer strategy for such networks. We use our method to analyze the transcriptional regulatory networks of E. coli, H. sapiens and S. cerevisiae. Conclusions Our experiments demonstrate that: (i Our method gives statistically better results than three existing state of the art methods; (ii Our method is robust against errors in the data and (iii Our method’s performance is not affected by the different topologies in the data.

  1. The hierarchical brain network for face recognition.

    Science.gov (United States)

    Zhen, Zonglei; Fang, Huizhen; Liu, Jia

    2013-01-01

    Numerous functional magnetic resonance imaging (fMRI) studies have identified multiple cortical regions that are involved in face processing in the human brain. However, few studies have characterized the face-processing network as a functioning whole. In this study, we used fMRI to identify face-selective regions in the entire brain and then explore the hierarchical structure of the face-processing network by analyzing functional connectivity among these regions. We identified twenty-five regions mainly in the occipital, temporal and frontal cortex that showed a reliable response selective to faces (versus objects) across participants and across scan sessions. Furthermore, these regions were clustered into three relatively independent sub-networks in a face-recognition task on the basis of the strength of functional connectivity among them. The functionality of the sub-networks likely corresponds to the recognition of individual identity, retrieval of semantic knowledge and representation of emotional information. Interestingly, when the task was switched to object recognition from face recognition, the functional connectivity between the inferior occipital gyrus and the rest of the face-selective regions were significantly reduced, suggesting that this region may serve as an entry node in the face-processing network. In sum, our study provides empirical evidence for cognitive and neural models of face recognition and helps elucidate the neural mechanisms underlying face recognition at the network level.

  2. Hierarchical mutual information for the comparison of hierarchical community structures in complex networks

    CERN Document Server

    Perotti, Juan Ignacio; Caldarelli, Guido

    2015-01-01

    The quest for a quantitative characterization of community and modular structure of complex networks produced a variety of methods and algorithms to classify different networks. However, it is not clear if such methods provide consistent, robust and meaningful results when considering hierarchies as a whole. Part of the problem is the lack of a similarity measure for the comparison of hierarchical community structures. In this work we give a contribution by introducing the {\\it hierarchical mutual information}, which is a generalization of the traditional mutual information, and allows to compare hierarchical partitions and hierarchical community structures. The {\\it normalized} version of the hierarchical mutual information should behave analogously to the traditional normalized mutual information. Here, the correct behavior of the hierarchical mutual information is corroborated on an extensive battery of numerical experiments. The experiments are performed on artificial hierarchies, and on the hierarchical ...

  3. Antiferromagnetic Ising Model in Hierarchical Networks

    Science.gov (United States)

    Cheng, Xiang; Boettcher, Stefan

    2015-03-01

    The Ising antiferromagnet is a convenient model of glassy dynamics. It can introduce geometric frustrations and may give rise to a spin glass phase and glassy relaxation at low temperatures [ 1 ] . We apply the antiferromagnetic Ising model to 3 hierarchical networks which share features of both small world networks and regular lattices. Their recursive and fixed structures make them suitable for exact renormalization group analysis as well as numerical simulations. We first explore the dynamical behaviors using simulated annealing and discover an extremely slow relaxation at low temperatures. Then we employ the Wang-Landau algorithm to investigate the energy landscape and the corresponding equilibrium behaviors for different system sizes. Besides the Monte Carlo methods, renormalization group [ 2 ] is used to study the equilibrium properties in the thermodynamic limit and to compare with the results from simulated annealing and Wang-Landau sampling. Supported through NSF Grant DMR-1207431.

  4. Scaling silicon photonic switch fabrics for data center interconnection networks.

    Science.gov (United States)

    Nikolova, Dessislava; Rumley, Sébastien; Calhoun, David; Li, Qi; Hendry, Robert; Samadi, Payman; Bergman, Keren

    2015-01-26

    With the rapidly increasing aggregate bandwidth requirements of data centers there is a growing interest in the insertion of optically interconnected networks with high-radix transparent optical switch fabrics. Silicon photonics is a particularly promising and applicable technology due to its small footprint, CMOS compatibility, high bandwidth density, and the potential for nanosecond scale dynamic connectivity. In this paper we analyze the feasibility of building silicon photonic microring based switch fabrics for data center scale optical interconnection networks. We evaluate the scalability of a microring based switch fabric for WDM signals. Critical parameters including crosstalk, insertion loss and switching speed are analyzed, and their sensitivity with respect to device parameters is examined. We show that optimization of physical layer parameters can reduce crosstalk and increase switch fabric scalability. Our analysis indicates that with current state-of-the-art devices, a high radix 128 × 128 silicon photonic single chip switch fabric with tolerable power penalty is feasible. The applicability of silicon photonic microrings for data center switching is further supported via review of microring operations and control demonstrations. The challenges and opportunities for this technology platform are discussed.

  5. A high-speed interconnect network using ternary logic

    DEFF Research Database (Denmark)

    Madsen, Jens Kargaard; Long, S. I.

    1995-01-01

    This paper describes the design and implementation of a high-speed interconnect network (ICN) for a multiprocessor system using ternary logic. By using ternary logic and a fast point-to-point communication technique called STARI (Self-Timed At Receiver's Input), the communication between the proc......This paper describes the design and implementation of a high-speed interconnect network (ICN) for a multiprocessor system using ternary logic. By using ternary logic and a fast point-to-point communication technique called STARI (Self-Timed At Receiver's Input), the communication between...... the processors is free of clock skew and insensitive to any delay differences in buffers and wires. In addition, the number of signal wires and pins are reduced by 50 percent in comparison with a similar binary implementation. The ICN architecture is based on a crossbar topology and the high-speed part consists...... of two LSI GaAs chips, Interface and Crossbar, which were implemented in a 0.8 μm MESFET process. In a 4×4 ICN, communication at 300 Mbit/s per wire was demonstrated, which is twice as fast as pure synchronous and four times faster than pure asynchronous communication in the specific test set-up...

  6. Winner-Take-All Neural Network with Massively Optoelectronic Interconnections

    Directory of Open Access Journals (Sweden)

    Wissam H. Ali

    2009-01-01

    Full Text Available The increased interconnection density, bandwidth, nonlocality and fan-out-fan-in offered by optics over conventional electronic technologies make it a very attractive medium for a variety of application particularity in the field of communication system implementation for all types of computing engines is achieved. This is especially true for neural networks in which the demand for communication resources is extremely high. In this study, the implementation of a neural network that exploits an optical interconnect to perform a real task is described. A pnpn semiconductor device has been connected in parallel with a common load resistance for optical switching. When illuminated, only this device with maximum input will turn on. The voltages across the other devices drop and inhibit their switching ability. With suitable biasing, the winning device can be recall at any time. The result shows, a much faster response (<10ns can be obtained from thyristors made of III-V compound semiconductors, because their carrier lifetime is considerably shorter than in silicon. With III-V photothyristor, it is possible to combine light emission (even lasing and photothyristor action in the same unit.

  7. Silicon photonics for high-performance interconnection networks

    Science.gov (United States)

    Biberman, Aleksandr

    2011-12-01

    We assert in the course of this work that silicon photonics has the potential to be a key disruptive technology in computing and communication industries. The enduring pursuit of performance gains in computing, combined with stringent power constraints, has fostered the ever-growing computational parallelism associated with chip multiprocessors, memory systems, high-performance computing systems, and data centers. Sustaining these parallelism growths introduces unique challenges for on- and off-chip communications, shifting the focus toward novel and fundamentally different communication approaches. This work showcases that chip-scale photonic interconnection networks, enabled by high-performance silicon photonic devices, enable unprecedented bandwidth scalability with reduced power consumption. We demonstrate that the silicon photonic platforms have already produced all the high-performance photonic devices required to realize these types of networks. Through extensive empirical characterization in much of this work, we demonstrate such feasibility of waveguides, modulators, switches, and photodetectors. We also demonstrate systems that simultaneously combine many functionalities to achieve more complex building blocks. Furthermore, we leverage the unique properties of available silicon photonic materials to create novel silicon photonic devices, subsystems, network topologies, and architectures to enable unprecedented performance of these photonic interconnection networks and computing systems. We show that the advantages of photonic interconnection networks extend far beyond the chip, offering advanced communication environments for memory systems, high-performance computing systems, and data centers. Furthermore, we explore the immense potential of all-optical functionalities implemented using parametric processing in the silicon platform, demonstrating unique methods that have the ability to revolutionize computation and communication. Silicon photonics

  8. Epidemic spreading in interconnected networks: a continuous time approach

    CERN Document Server

    de Arruda, Guilherme Ferraz; Peixoto, Tiago P; Rodrigues, Francisco A; Moreno, Yamir

    2015-01-01

    We present a continuous formulation of epidemic spreading on interconnected networks using a tensorial notation, extending the models of monoplex networks to this context. We derive analytical expressions for the epidemic threshold on the SIS and SIR dynamics, as well as upper and lower bounds for the steady-state. Using the quasi-stationary state (QS) method we show the emergence of two or more phase transitions, and propose an analytical and numerical analysis based on the inverse participation ratio. Furthermore, when mapping the critical epidemic dynamics to the eigenvalue problem, we observe a characteristic transition in the eigenvalue spectra of the supra-contact tensor as a function of the ratio of spreading rates: If the spreading rate within each layer is comparable to the rate across layers, the individual spectra of each layer merge with the coupling between layers. Our formalism provides a mathematical approach to epidemic spreading in multiplex systems and our results reinforce the importance of...

  9. Interconnection and Competition Among Asymmetric Networks in the Internet Backbone Market

    NARCIS (Netherlands)

    Jahn, E.; Prüfer, J.

    2006-01-01

    We examine the interrelation between interconnection and competition in the internet backbone market.Networks asymmetric in size choose among different interconnection regimes and compete for end-users.We show that a direct interconnection regime, Peering, softens competition compared to indirect in

  10. Field experiment on a robust hierarchical metropolitan quantum cryptography network

    Institute of Scientific and Technical Information of China (English)

    XU FangXing; CHEN Wei; WANG Shuang; YIN ZhenQiang; ZHANG Yang; LIU Yun; ZHOU Zheng; ZHAO YiBo; LI HongWei; LIU Dong; HAN ZhengFu; GUO GuangCan

    2009-01-01

    these bureaus.The whole implementation including the hierarchical quantum cryptographic communication network links and the corresponding application software shows a big step toward the practical user-oriented network with a high security level.

  11. LTAR Linkages with Other Research Networks: Capitalizing on Network Interconnections

    Science.gov (United States)

    Havstad, K.

    2015-12-01

    The USDA ARS Research Unit based at the Jornada Experimental Range outside of Las Cruces, NM, is a member of the USDA's Long Term Agro-ecosystem Research (LTAR) Network, the National Science Foundation's Long Term Ecological Research (LTER) Network, the National Ecological Observation Network (NEON), and the USDA's Climate Hub Network. Each of these networks has distinct functions, missions, operational characteristics, and distinct scientific and management sub-cultures (though some are fairly new and developing). Some are a fairly independent collection of research sites functioning as a network in name only, and others are truly working to develop a research synergy that could be holistic and uniquely productive. All have real scientific value, and collectively represent an investment in US research infrastructure in biology and agriculture in excess of $3B. To effectively utilize and exploit this unique research infrastructure will require a concerted effort to meld attributes of each to the benefits of their common stakeholders. Real opportunities exist to collectively utilize this infrastructure to address grand research challenges.

  12. A Hierarchical Sensor Network Based on Voronoi Diagram

    Institute of Scientific and Technical Information of China (English)

    SHANG Rui-qiang; ZHAO Jian-li; SUN Qiu-xia; WANG Guang-xing

    2006-01-01

    A hierarchical sensor network is proposed which places the sensing and routing capacity at different layer nodes.It thus simplifies the hardware design and reduces cost. Adopting Voronoi diagram in the partition of backbone network,a mathematical model of data aggregation based on hierarchical architecture is given. Simulation shows that the number of transmission data packages is sharply cut down in the network, thus reducing the needs in the bandwidth and energy resources and is thus well adapted to sensor networks.

  13. Automatic Construction of Hierarchical Road Networks

    Science.gov (United States)

    Yang, Weiping

    2016-06-01

    This paper describes an automated method of constructing a hierarchical road network given a single dataset, without the presence of thematic attributes. The method is based on a pattern graph which maintains nodes and paths as junctions and through-traffic roads. The hierarchy is formed incrementally in a top-down fashion for highways, ramps, and major roads directly connected to ramps; and bottom-up for the rest of major and minor roads. Through reasoning and analysis, ramps are identified as unique characteristics for recognizing and assembling high speed roads. The method makes distinctions on the types of ramps by articulating their connection patterns with highways. Major and minor roads will be identified by both quantitative and qualitative analysis of spatial properties and by discovering neighbourhood patterns revealed in the data. The result of the method would enrich data description and support comprehensive queries on sorted exit or entry points on highways and their related roads. The enrichment on road network data is important to a high successful rate of feature matching for road networks and to geospatial data integration.

  14. Hierarchical Network Models for Education Research: Hierarchical Latent Space Models

    Science.gov (United States)

    Sweet, Tracy M.; Thomas, Andrew C.; Junker, Brian W.

    2013-01-01

    Intervention studies in school systems are sometimes aimed not at changing curriculum or classroom technique, but rather at changing the way that teachers, teaching coaches, and administrators in schools work with one another--in short, changing the professional social networks of educators. Current methods of social network analysis are…

  15. Big Data Processing in Complex Hierarchical Network Systems

    CERN Document Server

    Polishchuk, Olexandr; Tyutyunnyk, Maria; Yadzhak, Mykhailo

    2016-01-01

    This article covers the problem of processing of Big Data that describe process of complex networks and network systems operation. It also introduces the notion of hierarchical network systems combination into associations and conglomerates alongside with complex networks combination into multiplexes. The analysis is provided for methods of global network structures study depending on the purpose of the research. Also the main types of information flows in complex hierarchical network systems being the basic components of associations and conglomerates are covered. Approaches are proposed for creation of efficient computing environments, distributed computations organization and information processing methods parallelization at different levels of system hierarchy.

  16. Object recognition with hierarchical discriminant saliency networks

    Directory of Open Access Journals (Sweden)

    Sunhyoung eHan

    2014-09-01

    Full Text Available The benefits of integrating attention and object recognition are investigated. While attention is frequently modeled as pre-processor for recognition, we investigate the hypothesis that attention is an intrinsic component of recognition and vice-versa. This hypothesis is tested with a recognitionmodel, the hierarchical discriminant saliency network (HDSN, whose layers are top-down saliency detectors, tuned for a visual class according to the principles of discriminant saliency. The HDSN has two possible implementations. In a biologically plausible implementation, all layers comply with the standard neurophysiological model of visual cortex, with sub-layers of simple and complex units that implement a combination of filtering, divisive normalization, pooling, and non-linearities. In a neuralnetwork implementation, all layers are convolutional and implement acombination of filtering, rectification, and pooling. The rectificationis performed with a parametric extension of the now popular rectified linearunits (ReLUs, whose parameters can be tuned for the detection of targetobject classes. This enables a number of functional enhancementsover neural network models that lack a connection to saliency, including optimal feature denoising mechanisms for recognition, modulation ofsaliency responses by the discriminant power of the underlying features,and the ability to detect both feature presence and absence.In either implementation, each layer has a precise statistical interpretation, and all parameters are tuned by statistical learning. Each saliency detection layer learns more discriminant saliency templates than its predecessors and higher layers have larger pooling fields. This enables the HDSN to simultaneously achieve high selectivity totarget object classes and invariance. The resulting performance demonstrates benefits for all the functional enhancements of the HDSN.

  17. Object recognition with hierarchical discriminant saliency networks.

    Science.gov (United States)

    Han, Sunhyoung; Vasconcelos, Nuno

    2014-01-01

    The benefits of integrating attention and object recognition are investigated. While attention is frequently modeled as a pre-processor for recognition, we investigate the hypothesis that attention is an intrinsic component of recognition and vice-versa. This hypothesis is tested with a recognition model, the hierarchical discriminant saliency network (HDSN), whose layers are top-down saliency detectors, tuned for a visual class according to the principles of discriminant saliency. As a model of neural computation, the HDSN has two possible implementations. In a biologically plausible implementation, all layers comply with the standard neurophysiological model of visual cortex, with sub-layers of simple and complex units that implement a combination of filtering, divisive normalization, pooling, and non-linearities. In a convolutional neural network implementation, all layers are convolutional and implement a combination of filtering, rectification, and pooling. The rectification is performed with a parametric extension of the now popular rectified linear units (ReLUs), whose parameters can be tuned for the detection of target object classes. This enables a number of functional enhancements over neural network models that lack a connection to saliency, including optimal feature denoising mechanisms for recognition, modulation of saliency responses by the discriminant power of the underlying features, and the ability to detect both feature presence and absence. In either implementation, each layer has a precise statistical interpretation, and all parameters are tuned by statistical learning. Each saliency detection layer learns more discriminant saliency templates than its predecessors and higher layers have larger pooling fields. This enables the HDSN to simultaneously achieve high selectivity to target object classes and invariance. The performance of the network in saliency and object recognition tasks is compared to those of models from the biological and

  18. Road network safety evaluation using Bayesian hierarchical joint model.

    Science.gov (United States)

    Wang, Jie; Huang, Helai

    2016-05-01

    Safety and efficiency are commonly regarded as two significant performance indicators of transportation systems. In practice, road network planning has focused on road capacity and transport efficiency whereas the safety level of a road network has received little attention in the planning stage. This study develops a Bayesian hierarchical joint model for road network safety evaluation to help planners take traffic safety into account when planning a road network. The proposed model establishes relationships between road network risk and micro-level variables related to road entities and traffic volume, as well as socioeconomic, trip generation and network density variables at macro level which are generally used for long term transportation plans. In addition, network spatial correlation between intersections and their connected road segments is also considered in the model. A road network is elaborately selected in order to compare the proposed hierarchical joint model with a previous joint model and a negative binomial model. According to the results of the model comparison, the hierarchical joint model outperforms the joint model and negative binomial model in terms of the goodness-of-fit and predictive performance, which indicates the reasonableness of considering the hierarchical data structure in crash prediction and analysis. Moreover, both random effects at the TAZ level and the spatial correlation between intersections and their adjacent segments are found to be significant, supporting the employment of the hierarchical joint model as an alternative in road-network-level safety modeling as well.

  19. Performance Optimization of Multiple Interconnected Heterogeneous Sensor Networks via Collaborative Information Sharing

    CERN Document Server

    Pal, Sougata; Bellalta, Boris; Oliver, Miquel

    2012-01-01

    Interconnecting multiple sensor networks is a relatively new research field which has emerged in the Wireless Sensor Network domain. Wireless Sensor Networks (WSNs) have typically been seen as logically separate, and few works have considered interconnection and interaction between them. Interconnecting multiple heterogeneous sensor networks therefore opens up a new field besides more traditional research on, e.g., routing, self organization, or MAC layer development. Up to now, some approaches have been proposed for interconnecting multiple sensor networks with goals like information sharing or monitoring multiple sensor networks. In this paper, we propose to utilize inter-WSN communication to enable Collaborative Performance Optimization, i.e., our approach aims to optimize the performance of individual WSNs by taking into account measured information from others. The parameters to be optimized are energy consumption on the one hand and sensing quality on the other.

  20. Nanoclay-based hierarchical interconnected mesoporous CNT/PPy electrode with improved specific capacitance for high performance supercapacitors.

    Science.gov (United States)

    Oraon, Ramesh; De Adhikari, Amrita; Tiwari, Santosh Kumar; Nayak, Ganesh Chandra

    2016-05-31

    A natural layered clay known as montmorillonite, a lamellar aluminosilicate with ∼1 nm thickness, has attracted intense attention in ongoing research due to its large natural abundance and environmental friendliness. Endowed with highly active surface sites the nanoclay has been extensively used in various fields viz. catalysis, biosensors etc. even though the role played by nanoclay on energy storage performance has not been elucidated. In this present work, a series of nanoclay (Closite 30B) based hierarchical open interconnected mesoporous electrode materials for supercapacitors (SCs) has been synthesized in the presence of carbon nanotubes (CNTs) and polypyrrole (PPy) by a facile in situ and ex situ approach. The role of nanoclay was explored as a dopant and its substantial doping effect exerted on the electrochemical performance towards energy storage was investigated. A coating of PPy over CNTs and nanoclay was confirmed from FESEM analysis which revealed the genesis of a nanoclay-supported hierarchical interconnected mesoporous framework. Furthermore, a PPy-coated CNT array in the presence of nanoclay was found to be highly porous with a high specific surface area without obvious deterioration. These interconnected structures can contribute to better penetration of electrolyte ions by shortening the path length for rapid transport of ions and electrons even at high rates. Cyclic voltammetry measurements revealed that nanoclay based in situ composite (CNP) and ex situ composite (CPN) exhibited a maximum specific capacitance of 425 F g(-1) and 317 F g(-1), respectively at a scan rate of 10 mV s(-1), which is comparatively higher than that of CP (i.e. PPy-coated CNTs) (76.77 F g(-1)). Similarly, a 273% increase in the specific capacitance of PPy was achieved after nanoclay incorporation in the nanocomposite NP (i.e. PPy-coated nanoclay) as compared to virgin PPy. These results are in good agreement with the specific capacitance performance by galvanostatic

  1. Road Network Selection Based on Road Hierarchical Structure Control

    Directory of Open Access Journals (Sweden)

    HE Haiwei

    2015-04-01

    Full Text Available A new road network selection method based on hierarchical structure is studied. Firstly, road network is built as strokes which are then classified into hierarchical collections according to the criteria of betweenness centrality value (BC value. Secondly, the hierarchical structure of the strokes is enhanced using structural characteristic identification technique. Thirdly, the importance calculation model was established according to the relationships among the hierarchical structure of the strokes. Finally, the importance values of strokes are got supported with the model's hierarchical calculation, and with which the road network is selected. Tests are done to verify the advantage of this method by comparing it with other common stroke-oriented methods using three kinds of typical road network data. Comparision of the results show that this method had few need to semantic data, and could eliminate the negative influence of edge strokes caused by the criteria of BC value well. So, it is better to maintain the global hierarchical structure of road network, and suitable to meet with the selection of various kinds of road network at the same time.

  2. Neural Mechanisms of Hierarchical Planning in a Virtual Subway Network.

    Science.gov (United States)

    Balaguer, Jan; Spiers, Hugo; Hassabis, Demis; Summerfield, Christopher

    2016-05-18

    Planning allows actions to be structured in pursuit of a future goal. However, in natural environments, planning over multiple possible future states incurs prohibitive computational costs. To represent plans efficiently, states can be clustered hierarchically into "contexts". For example, representing a journey through a subway network as a succession of individual states (stations) is more costly than encoding a sequence of contexts (lines) and context switches (line changes). Here, using functional brain imaging, we asked humans to perform a planning task in a virtual subway network. Behavioral analyses revealed that humans executed a hierarchically organized plan. Brain activity in the dorsomedial prefrontal cortex and premotor cortex scaled with the cost of hierarchical plan representation and unique neural signals in these regions signaled contexts and context switches. These results suggest that humans represent hierarchical plans using a network of caudal prefrontal structures. VIDEO ABSTRACT.

  3. A Quality-of-Service Mechanism for Interconnection Networks in System-on-Chips

    CERN Document Server

    Weber, Wolf-Dietrich; Swarbrick, Ian; Wingard, Drew

    2011-01-01

    As Moore's Law continues to fuel the ability to build ever increasingly complex system-on-chips (SoCs), achieving performance goals is rising as a critical challenge to completing designs. In particular, the system interconnect must efficiently service a diverse set of data flows with widely ranging quality-of-service (QoS) requirements. However, the known solutions for off-chip interconnects such as large-scale networks are not necessarily applicable to the on-chip environment. Latency and memory constraints for on-chip interconnects are quite different from larger-scale interconnects. This paper introduces a novel on-chip interconnect arbitration scheme. We show how this scheme can be distributed across a chip for high-speed implementation. We compare the performance of the arbitration scheme with other known interconnect arbitration schemes. Existing schemes typically focus heavily on either low latency of service for some initiators, or alternatively on guaranteed bandwidth delivery for other initiators. ...

  4. Interconnected Hierarchical Porous Carbon from Lignin-Derived Byproducts of Bioethanol Production for Ultra-High Performance Supercapacitors.

    Science.gov (United States)

    Zhang, Liming; You, Tingting; Zhou, Tian; Zhou, Xia; Xu, Feng

    2016-06-08

    The advent of bioethanol production has generated abundant lignin-derived byproducts which contain proteins and polysaccharides. These byproducts are inapplicable for direct material applications. In this study, lignin-derived byproducts were used for the first time as carbon precursors to construct an interconnected hierarchical porous nitrogen-doped carbon (HPNC) via hydrothermal treatment and activation. The obtained HPNC exhibited favorable features for supercapacitor applications, such as hierarchical bowl-like pore structures, a large specific surface area of 2218 m(2) g(-1), a high electronic conductivity of 4.8 S cm(-1), and a nitrogen doping content of 3.4%. HPNC-based supercapacitors in a 6 M KOH aqueous electrolyte exhibited high-rate performance with a high specific capacitance of 312 F g(-1) at 1 A g(-1) and 81% retention at 80 A g(-1) as well as an excellent cyclic life of 98% initial capacitance after 20 000 cycles at 10 A g(-1). Moreover, HPNC-based supercapacitors in the ionic liquid electrolyte of EMI-BF4 displayed an enhanced energy density of 44.7 Wh kg(-1) (remaining 74% of max value) at an ultrahigh power density of 73.1 kW kg(-1). The proposed strategy may facilitate lignin utilization and lead to a green bioethanol production process.

  5. Cost and Availability Analysis of 2- and 3-Connected WDM Networks Physical Interconnection

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Pedersen, Jens Myrup

    2012-01-01

    Our future in personal and professional lives is becoming more attached to the evolution of communication technologies and their applications. Consequently, the way Next Generation Network are currently being planned and deployed, might have a great impact on common people depending on how networks...... are physically interconnected. Ideally networks should be cheap, reliable, flexible, and energy efficient, among other properties. However, some of these properties are contradictory, i.e. higher fault tolerant networks usually imply higher deployment costs. Therefore, the interconnection decision is a search...... the nodes has a significant impact on the cost and availability of the network....

  6. High Speed PAM -8 Optical Interconnects with Digital Equalization based on Neural Network

    DEFF Research Database (Denmark)

    Gaiarin, Simone; Pang, Xiaodan; Ozolins, Oskars

    2016-01-01

    We experimentally evaluate a high-speed optical interconnection link with neural network equalization. Enhanced equalization performances are shown comparing to standard linear FFE for an EML-based 32 GBd PAM-8 signal after 4-km SMF transmission.......We experimentally evaluate a high-speed optical interconnection link with neural network equalization. Enhanced equalization performances are shown comparing to standard linear FFE for an EML-based 32 GBd PAM-8 signal after 4-km SMF transmission....

  7. High Speed PAM -8 Optical Interconnects with Digital Equalization based on Neural Network

    DEFF Research Database (Denmark)

    Gaiarin, Simone; Pang, Xiaodan; Ozolins, Oskars

    2016-01-01

    We experimentally evaluate a high-speed optical interconnection link with neural network equalization. Enhanced equalization performances are shown comparing to standard linear FFE for an EML-based 32 GBd PAM-8 signal after 4-km SMF transmission.......We experimentally evaluate a high-speed optical interconnection link with neural network equalization. Enhanced equalization performances are shown comparing to standard linear FFE for an EML-based 32 GBd PAM-8 signal after 4-km SMF transmission....

  8. Field Experiment on a Robust Hierarchical Metropolitan Quantum Cryptography Network

    CERN Document Server

    Xu, Fangxing; Wang, Shuang; Yin, Zhenqiang; Zhang, Yang; Liu, Yun; Zhou, Zheng; Zhao, Yibo; Li, Hongwei; Liu, Dong; Han, Zhengfu; Guo, Guangcan

    2009-01-01

    A hierarchical metropolitan quantum cryptography network upon the inner-city commercial telecom fiber cables is reported in this paper. The seven-user network contains a four-node backbone net with one node acting as the subnet gateway, a two-user subnet and a single-fiber access link, which is realized by the Faraday-Michelson Interferometer set-ups. The techniques of the quantum router, optical switch and trusted relay are assembled here to guarantee the feasibility and expandability of the quantum cryptography network. Five nodes of the network are located in the government departments and the secure keys generated by the quantum key distribution network are utilized to encrypt the instant video, sound, text messages and confidential files transmitting between these bureaus. The whole implementation including the hierarchical quantum cryptographic communication network links and corresponding application software shows a big step toward the practical user-oriented network with high security level.

  9. Complex Evaluation of Hierarchically-Network Systems

    CERN Document Server

    Polishchuk, Dmytro; Yadzhak, Mykhailo

    2016-01-01

    Methods of complex evaluation based on local, forecasting, aggregated, and interactive evaluation of the state, function quality, and interaction of complex system's objects on the all hierarchical levels is proposed. Examples of analysis of the structural elements of railway transport system are used for illustration of efficiency of proposed approach.

  10. A Methodology for Physical Interconnection Decisions of Next Generation Transport Networks

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Madsen, Ole Brun

    2011-01-01

    The physical interconnection for optical transport networks has critical relevance in the overall network performance and deployment costs. As telecommunication services and technologies evolve, the provisioning of higher capacity and reliability levels is becoming essential for the proper...... development of Next Generation Networks. Currently, there is a lack of specific procedures that describe the basic guidelines to design such networks better than "best possible performance for the lowest investment". Therefore, the research from different points of view will allow a broader space...... of possibilities when designing the physical network interconnection. This paper develops and presents a methodology in order to deal with aspects related to the interconnection problem of optical transport networks. This methodology is presented as independent puzzle pieces, covering diverse topics going from...

  11. Well-dispersed sulfur anchored on interconnected polypyrrole nanofiber network as high performance cathode for lithium-sulfur batteries

    Science.gov (United States)

    Yin, Fuxing; Liu, Xinyi; Zhang, Yongguang; Zhao, Yan; Menbayeva, Almagul; Bakenov, Zhumabay; Wang, Xin

    2017-04-01

    Preparation of novel sulfur/polypyrrole (S/PPy) composite consisting well-dispersed sulfur particles anchored on interconnected PPy nanowire network was demonstrated. In such hybrid structure, the as-prepared PPy clearly displays a three-dimensionally cross-linked and hierarchical porous structure, which was utilized in the composite cathode as a conductive network trapping soluble polysulfide intermediates and enhancing the overall electrochemical performance of the system. Benefiting from this unique structure, the S/PPy composite demonstrated excellent cycling stability, resulting in a discharge capacity of 931 mAh g-1 at the second cycle and retained about 54% of this value over 100 cycles at 0.1 C. Furthermore, the S/PPy composite cathode exhibits a good rate capability with a discharge capacity of 584 mAh g-1 at 1 C.

  12. Research on reliability index of a large communication network with domain partition and interconnection

    Institute of Scientific and Technical Information of China (English)

    Dai Fusheng

    2009-01-01

    In order to indicate the performances of a large-scale communication network with domain partition and interconnection today, a kind of reliability index weighed by normalized capacity is defined. Based on the route rules of network with domain partition and interconnection, the interconnection indexes among the nodes within the domain and among the domains are given from several aspects. It is expatiated on that the index can thoroughly represent the effect on the reliability index of the objective factor and the subjective measures of the designer, which obeys the route rules of a network with domain partition and interconnection. It is discussed that the defined index is rational and compatible with the traditional index.

  13. Modelling hierarchical and modular complex networks: division and independence

    Science.gov (United States)

    Kim, D.-H.; Rodgers, G. J.; Kahng, B.; Kim, D.

    2005-06-01

    We introduce a growing network model which generates both modular and hierarchical structure in a self-organized way. To this end, we modify the Barabási-Albert model into the one evolving under the principles of division and independence as well as growth and preferential attachment (PA). A newly added vertex chooses one of the modules composed of existing vertices, and attaches edges to vertices belonging to that module following the PA rule. When the module size reaches a proper size, the module is divided into two, and a new module is created. The karate club network studied by Zachary is a simple version of the current model. We find that the model can reproduce both modular and hierarchical properties, characterized by the hierarchical clustering function of a vertex with degree k, C(k), being in good agreement with empirical measurements for real-world networks.

  14. Hierarchical Overlapping Clustering of Network Data Using Cut Metrics

    CERN Document Server

    Gama, Fernando; Ribeiro, Alejandro

    2016-01-01

    A novel method to obtain hierarchical and overlapping clusters from network data -i.e., a set of nodes endowed with pairwise dissimilarities- is presented. The introduced method is hierarchical in the sense that it outputs a nested collection of groupings of the node set depending on the resolution or degree of similarity desired, and it is overlapping since it allows nodes to belong to more than one group. Our construction is rooted on the facts that a hierarchical (non-overlapping) clustering of a network can be equivalently represented by a finite ultrametric space and that a convex combination of ultrametrics results in a cut metric. By applying a hierarchical (non-overlapping) clustering method to multiple dithered versions of a given network and then convexly combining the resulting ultrametrics, we obtain a cut metric associated to the network of interest. We then show how to extract a hierarchical overlapping clustering structure from the aforementioned cut metric. Furthermore, the so-called overlappi...

  15. The Distributed Network Processor: a novel off-chip and on-chip interconnection network architecture

    CERN Document Server

    Biagioni, Andrea; Lonardo, Alessandro; Paolucci, Pier Stanislao; Perra, Mersia; Rossetti, Davide; Sidore, Carlo; Simula, Francesco; Tosoratto, Laura; Vicini, Piero

    2012-01-01

    One of the most demanding challenges for the designers of parallel computing architectures is to deliver an efficient network infrastructure providing low latency, high bandwidth communications while preserving scalability. Besides off-chip communications between processors, recent multi-tile (i.e. multi-core) architectures face the challenge for an efficient on-chip interconnection network between processor's tiles. In this paper, we present a configurable and scalable architecture, based on our Distributed Network Processor (DNP) IP Library, targeting systems ranging from single MPSoCs to massive HPC platforms. The DNP provides inter-tile services for both on-chip and off-chip communications with a uniform RDMA style API, over a multi-dimensional direct network with a (possibly) hybrid topology.

  16. Minimizing the Switch and Link Conflicts in an Optical Multi-stage Interconnection Network

    CERN Document Server

    Bhardwaj, Ved Prakash; Tyagi, Vipin

    2012-01-01

    Multistage Interconnection Networks (MINs) are very popular in switching and communication applications. A MIN connects N inputs to N outputs and is referred as an N \\times N MIN; having size N. Optical Multistage Interconnection Network (OMIN) represents an important class of Interconnection networks. Crosstalk is the basic problem of OMIN. Switch Conflict and Link Conflict are the two main reason of crosstalk. In this paper, we are considering both problems. A number of techniques like Optical window, Improved Window, Heuristic, Genetic, and Zero have been proposed earlier in this research domain. In this paper, we have proposed two algorithms called Address Selection Algorithm and Route Selection Algorithm (RSA). RSA is based on Improved Window Method. We have applied the proposed algorithms on existing Omega network, having shuffle-exchange connection pattern. The main functionality of ASA and RSA is to minimize the number of switch and link conflicts in the network and to provide conflict free routes.

  17. Minimizing the Switch and Link Conflicts in an Optical Multi-stage Interconnection Network

    Directory of Open Access Journals (Sweden)

    Ved Prakash Bhardwaj

    2011-07-01

    Full Text Available Multistage Interconnection Networks (MINs are very popular in switching and communication applications. A MIN connects N inputs to N outputs and is referred as an N andamp;times; N MIN; having size N. Optical Multistage Interconnection Network (OMIN represents an important class of Interconnection networks. Crosstalk is the basic problem of OMIN. Switch Conflict and Link Conflict are the two main reason of crosstalk. In this paper, we are considering both problems. A number of techniques like Optical window, Improved Window, Heuristic, Genetic, and Zero have been proposed earlier in this research domain. In this paper, we have proposed two algorithms called Address Selection Algorithm and Route Selection Algorithm (RSA. RSA is based on Improved Window Method. We have applied the proposed algorithms on existing Omega network, having shuffleexchange connection pattern. The main functionality of ASA and RSA is to minimize the number of switch and link conflicts in the network and to provide conflict free routes.

  18. Detect overlapping and hierarchical community structure in networks

    CERN Document Server

    Shen, Huawei; Cai, Kai; Hu, Mao-Bin

    2008-01-01

    Clustering and community structure is crucial for many network systems and the related dynamic processes. It has been shown that communities are usually overlapping and hierarchical. However, previous methods investigate these two properties of community structure separately. This paper propose an algorithm (EAGLE) to detect both the overlapping and hierarchical properties of complex community structure together. This algorithm deals with the set of maximal cliques and adopts an agglomerative framework. The quality function of modularity is extended to evaluate the goodness of a cover. The examples of application to real world networks give excellent results.

  19. Hierarchical Routing over Dynamic Wireless Networks

    CERN Document Server

    Tschopp, Dominique; Grossglauser, Matthias

    2009-01-01

    Wireless network topologies change over time and maintaining routes requires frequent updates. Updates are costly in terms of consuming throughput available for data transmission, which is precious in wireless networks. In this paper, we ask whether there exist low-overhead schemes that produce low-stretch routes. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks.

  20. Tiresias: Online Anomaly Detection for Hierarchical Operational Network Data

    CERN Document Server

    Hong, Chi-Yao; Duffield, Nick; Wang, Jia

    2012-01-01

    Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect problems in their networks. Unfortunately, there is lack of efficient tools to automatically track and detect anomalous events on operational data, causing ISP operators to rely on manual inspection of this data. While anomaly detection has been widely studied in the context of network data, operational data presents several new challenges, including the volatility and sparseness of data, and the need to perform fast detection (complicating application of schemes that require offline processing or large/stable data sets to converge). To address these challenges, we propose Tiresias, an automated approach to locating anomalous events on hierarchical operational data. Tiresias leverages the hierarchical structure of operational data to identify high-impact aggregates (e.g., locations in the network, failure modes) likely to be associated w...

  1. Analytical Model based on Green Criteria for Optical Backbone Network Interconnection

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Pedersen, Jens Myrup

    2011-01-01

    to the evaluation of the environmental impact of networks from physical interconnection point of view. Networks deployment, usage, and disposal are analyzed as contributing elements to ICT’s (Information and Communications Technology) CO2 emissions. This paper presents an analytical model for evaluating...... and quantifying the CO2 emissions of optical backbone networks during their lifetime. The main goal of this work is to present the model and illustrate how to evaluate the physical interconnection of backbones from an environmental perspective. This model can be applied as a new type of decision support criteria...... for backbone’s interconnection, since minimization of CO2 emissions is becoming an important factor. In addition, two case studies are presented to illustrate the use and application of this model, and the need for de facto and international standards to reduce CO2 emissions through good network planning....

  2. Hierarchicality of trade flow networks reveals complexity of products.

    Science.gov (United States)

    Shi, Peiteng; Zhang, Jiang; Yang, Bo; Luo, Jingfei

    2014-01-01

    With globalization, countries are more connected than before by trading flows, which amounts to at least 36 trillion dollars today. Interestingly, around 30-60 percents of exports consist of intermediate products in global. Therefore, the trade flow network of particular product with high added values can be regarded as value chains. The problem is weather we can discriminate between these products from their unique flow network structure? This paper applies the flow analysis method developed in ecology to 638 trading flow networks of different products. We claim that the allometric scaling exponent η can be used to characterize the degree of hierarchicality of a flow network, i.e., whether the trading products flow on long hierarchical chains. Then, it is pointed out that the flow networks of products with higher added values and complexity like machinary, transport equipment etc. have larger exponents, meaning that their trade flow networks are more hierarchical. As a result, without the extra data like global input-output table, we can identify the product categories with higher complexity, and the relative importance of a country in the global value chain by the trading network solely.

  3. Hierarchicality of trade flow networks reveals complexity of products.

    Directory of Open Access Journals (Sweden)

    Peiteng Shi

    Full Text Available With globalization, countries are more connected than before by trading flows, which amounts to at least 36 trillion dollars today. Interestingly, around 30-60 percents of exports consist of intermediate products in global. Therefore, the trade flow network of particular product with high added values can be regarded as value chains. The problem is weather we can discriminate between these products from their unique flow network structure? This paper applies the flow analysis method developed in ecology to 638 trading flow networks of different products. We claim that the allometric scaling exponent η can be used to characterize the degree of hierarchicality of a flow network, i.e., whether the trading products flow on long hierarchical chains. Then, it is pointed out that the flow networks of products with higher added values and complexity like machinary, transport equipment etc. have larger exponents, meaning that their trade flow networks are more hierarchical. As a result, without the extra data like global input-output table, we can identify the product categories with higher complexity, and the relative importance of a country in the global value chain by the trading network solely.

  4. Hierarchical document categorization using associative networks

    NARCIS (Netherlands)

    Bloom, Niels; Theune, Mariet; de Jong, Franciska M.G.; Klement, E.P.; Borutzky, W.; Fahringer, T.; Hamza, M.H.; Uskov, V.

    Associative networks are a connectionist language model with the ability to handle dynamic data. We used two associative networks to categorize random sets of related Wikipedia articles with only their raw text as input. We then compared the resulting categorization to a gold standard: the manual

  5. Changes of hierarchical network in local and world stock market

    Science.gov (United States)

    Patwary, Enayet Ullah; Lee, Jong Youl; Nobi, Ashadun; Kim, Doo Hwan; Lee, Jae Woo

    2017-10-01

    We consider the cross-correlation coefficients of the daily returns in the local and global stock markets. We generate the minimal spanning tree (MST) using the correlation matrix. We observe that the MSTs change their structure from chain-like networks to star-like networks during periods of market uncertainty. We quantify the measure of the hierarchical network utilizing the value of the hierarchy measured by the hierarchical path. The hierarchy and betweenness centrality characterize the state of the market regarding the impact of crises. During crises, the non-financial company is established as the central node of the MST. However, before the crisis and during stable periods, the financial company is occupying the central node of the MST in the Korean and the U.S. stock markets. The changes in the network structure and the central node are good indicators of an upcoming crisis.

  6. Information Sharing During Crisis Management in Hierarchical vs. Network Teams

    NARCIS (Netherlands)

    Schraagen, J.M.C.; Veld, M.H.I.T.; Koning, L. de

    2010-01-01

    This study examines the differences between hierarchical and network teams in emergency management. A controlled experimental environment was created in which we could study teams that differed in decision rights, availability of information, information sharing, and task division. Thirty-two teams

  7. Interconnecting PV on New York City's Secondary Network Distribution System

    Energy Technology Data Exchange (ETDEWEB)

    Anderson, K; Coddington, M; Burman, K; Hayter, S; Kroposki, B; Watson, and A

    2009-11-01

    The U.S. Department of Energy (DOE) has teamed with cities across the country through the Solar America Cities (SAC) partnership program to help reduce barriers and accelerate implementation of solar energy. The New York City SAC team is a partnership between the City University of New York (CUNY), the New York City Mayor s Office of Long-term Planning and Sustainability, and the New York City Economic Development Corporation (NYCEDC).The New York City SAC team is working with DOE s National Renewable Energy Laboratory (NREL) and Con Edison, the local utility, to develop a roadmap for photovoltaic (PV) installations in the five boroughs. The city set a goal to increase its installed PV capacity from1.1 MW in 2005 to 8.1 MW by 2015 (the maximum allowed in 2005). A key barrier to reaching this goal, however, is the complexity of the interconnection process with the local utility. Unique challenges are associated with connecting distributed PV systems to secondary network distribution systems (simplified to networks in this report). Although most areas of the country use simpler radial distribution systems to distribute electricity, larger metropolitan areas like New York City typically use networks to increase reliability in large load centers. Unlike the radial distribution system, where each customer receives power through a single line, a network uses a grid of interconnected lines to deliver power to each customer through several parallel circuits and sources. This redundancy improves reliability, but it also requires more complicated coordination and protection schemes that can be disrupted by energy exported from distributed PV systems. Currently, Con Edison studies each potential PV system in New York City to evaluate the system s impact on the network, but this is time consuming for utility engineers and may delay the customer s project or add cost for larger installations. City leaders would like to streamline this process to facilitate faster, simpler, and

  8. Self-organized Criticality in Hierarchical Brain Network

    Institute of Scientific and Technical Information of China (English)

    YANG Qiu-Ying; ZHANG Ying-Yue; CHEN Tian-Lun

    2008-01-01

    It is shown that the cortical brain network of the macaque displays a hierarchically clustered organization and the neuron network shows small-world properties. Now the two factors will be considered in our model and the dynamical behavior of the model will be studied. We study the characters of the model and find that the distribution of avalanche size of the model follows power-law behavior.

  9. An Extended Hierarchical Trusted Model for Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    DU Ruiying; XU Mingdi; ZHANG Huanguo

    2006-01-01

    Cryptography and authentication are traditional approach for providing network security. However, they are not sufficient for solving the problems which malicious nodes compromise whole wireless sensor network leading to invalid data transmission and wasting resource by using vicious behaviors. This paper puts forward an extended hierarchical trusted architecture for wireless sensor network, and establishes trusted congregations by three-tier framework. The method combines statistics, economics with encrypt mechanism for developing two trusted models which evaluate cluster head nodes and common sensor nodes respectively. The models form logical trusted-link from command node to common sensor nodes and guarantees the network can run in secure and reliable circumstance.

  10. Hierarchical Ring Network Design Using Branch-and-Price

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2005-01-01

    We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed l...... for jointly solving the clustering problem, the metro ring design problem and the routing problem. Computational results are given for networks with up to 36 nodes.......We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed...... link establishment costs and the link capacity costs into account. Hierarchical ring network design problems combines the following optimization problems: Clustering, hub selection, metro ring design, federal ring design and routing problems. In this paper a branch-and-price algorithm is presented...

  11. Dynamics of Complex Interconnected Systems: Networks and Bioprocesses

    CERN Document Server

    Skjeltorp, Arne T

    2006-01-01

    The book reviews the synergism between various fields of research that are confronted with networks, such as genetic and metabolic networks, social networks, the Internet and ecological systems. In many cases, the interacting networks manifest so-called emergent properties that are not possessed by any of the individual components. This means that the detailed knowledge of the components is insufficient to describe the whole system. Recent work has indicated that networks in nature have so-called scale-free characteristics, and the associated dynamic network modelling shows unexpected results such as an amazing robustness against accidental failures. Modelling the signal transduction networks in bioprocesses as in living cells is a challenging interdisciplinary research area. It is now realized that the many features of molecular interaction networks within a cell are shared to a large degree by the other complex systems mentioned above, such as the Internet, computer chips and society. Thus knowledge gained ...

  12. Polish and English wordnets -- statistical analysis of interconnected networks

    CERN Document Server

    Bujok, Maksymilian; Fronczak, Agata

    2014-01-01

    Wordnets are semantic networks containing nouns, verbs, adjectives, and adverbs organized according to linguistic principles, by means of semantic relations. In this work, we adopt a complex network perspective to perform a comparative analysis of the English and Polish wordnets. We determine their similarities and show that the networks exhibit some of the typical characteristics observed in other real-world networks. We analyse interlingual relations between both wordnets and deliberate over the problem of mapping the Polish lexicon onto the English one.

  13. Toward exa-scale optical circuit switch interconnect networks for future datacenter/HPC

    Science.gov (United States)

    Ishii, Kiyo; Inoue, Takashi; Namiki, Shu

    2017-01-01

    This paper discusses how to realize an optical circuit switching interconnect capable of more than 10 Tbps link bandwidth and more than 100,000 end points scalability. To keep continuous performance improvement of datacenters or high performance computers, high capacity and low latency interconnect network is essential. To handle such large bandwidth interconnect networks with low energy consumption, optical switch technologies will become inevitable. This paper firstly examines the scaling of the energy consumption of optical circuit switching networks based on the state of the art silicon photonics switch technology. Secondly to achieve Tbps-class link bandwidth, the WDM transmission technology and a shared WDM light source mechanism named "wavelength bank" are introduced. Due to the shared light source, each optical transceiver does not have to carry individual light sources, which enables simple WDM transceivers with cost-efficient silicon photonics technologies. Then a new optical switch control approach which reduces the control overhead time is discussed. In the proposed approach, the optical data plane itself represents the path destination, which enables a simple distributed-like control procedure. The proposed approach is expected to achieve the scalability and flexibility supporting more than 10 Tbps link bandwidth and more than 100,000 endpoints with 40 WDM channels. The proposed interconnect architecture offers direct end-to-end optical paths enabling low latencies with the "speed of light". The paper also discusses some of the challenges which should be resolved to practically realize the future large bandwidth optical interconnect networks.

  14. Learning Contextual Dependence With Convolutional Hierarchical Recurrent Neural Networks

    Science.gov (United States)

    Zuo, Zhen; Shuai, Bing; Wang, Gang; Liu, Xiao; Wang, Xingxing; Wang, Bing; Chen, Yushi

    2016-07-01

    Existing deep convolutional neural networks (CNNs) have shown their great success on image classification. CNNs mainly consist of convolutional and pooling layers, both of which are performed on local image areas without considering the dependencies among different image regions. However, such dependencies are very important for generating explicit image representation. In contrast, recurrent neural networks (RNNs) are well known for their ability of encoding contextual information among sequential data, and they only require a limited number of network parameters. General RNNs can hardly be directly applied on non-sequential data. Thus, we proposed the hierarchical RNNs (HRNNs). In HRNNs, each RNN layer focuses on modeling spatial dependencies among image regions from the same scale but different locations. While the cross RNN scale connections target on modeling scale dependencies among regions from the same location but different scales. Specifically, we propose two recurrent neural network models: 1) hierarchical simple recurrent network (HSRN), which is fast and has low computational cost; and 2) hierarchical long-short term memory recurrent network (HLSTM), which performs better than HSRN with the price of more computational cost. In this manuscript, we integrate CNNs with HRNNs, and develop end-to-end convolutional hierarchical recurrent neural networks (C-HRNNs). C-HRNNs not only make use of the representation power of CNNs, but also efficiently encodes spatial and scale dependencies among different image regions. On four of the most challenging object/scene image classification benchmarks, our C-HRNNs achieve state-of-the-art results on Places 205, SUN 397, MIT indoor, and competitive results on ILSVRC 2012.

  15. Application of some graph invariants to the analysis of multiprocessor interconnection networks

    Directory of Open Access Journals (Sweden)

    Cvetković Dragoš

    2008-01-01

    Full Text Available Let G be a graph with diameter D, maximum vertex degree Δ, the largest eigenvalue λ1 and m distinct eigenvalues. The products mΔ and (D+1 λ1 are called the tightness of G of the first and second type, respectively. In the recent literature it was suggested that graphs with a small tightness of the first type are good models for the multiprocessor interconnection networks. We study these and some other types of tightness and some related graph invariants and demonstrate their usefulness in the analysis of multiprocessor interconnection networks. Tightness values for graphs of some standard interconnection networks are determined. We also present some facts showing that the tightness of the second type is a relevant graph invariant. We prove that the number of connected graphs with a bounded tightness is finite.

  16. Brain rhythms reveal a hierarchical network organization.

    Directory of Open Access Journals (Sweden)

    G Karl Steinke

    2011-10-01

    Full Text Available Recordings of ongoing neural activity with EEG and MEG exhibit oscillations of specific frequencies over a non-oscillatory background. The oscillations appear in the power spectrum as a collection of frequency bands that are evenly spaced on a logarithmic scale, thereby preventing mutual entrainment and cross-talk. Over the last few years, experimental, computational and theoretical studies have made substantial progress on our understanding of the biophysical mechanisms underlying the generation of network oscillations and their interactions, with emphasis on the role of neuronal synchronization. In this paper we ask a very different question. Rather than investigating how brain rhythms emerge, or whether they are necessary for neural function, we focus on what they tell us about functional brain connectivity. We hypothesized that if we were able to construct abstract networks, or "virtual brains", whose dynamics were similar to EEG/MEG recordings, those networks would share structural features among themselves, and also with real brains. Applying mathematical techniques for inverse problems, we have reverse-engineered network architectures that generate characteristic dynamics of actual brains, including spindles and sharp waves, which appear in the power spectrum as frequency bands superimposed on a non-oscillatory background dominated by low frequencies. We show that all reconstructed networks display similar topological features (e.g. structural motifs and dynamics. We have also reverse-engineered putative diseased brains (epileptic and schizophrenic, in which the oscillatory activity is altered in different ways, as reported in clinical studies. These reconstructed networks show consistent alterations of functional connectivity and dynamics. In particular, we show that the complexity of the network, quantified as proposed by Tononi, Sporns and Edelman, is a good indicator of brain fitness, since virtual brains modeling diseased states

  17. Effect of Coupling on the Epidemic Threshold in Interconnected Complex Networks: A Spectral Analysis

    CERN Document Server

    Sahneh, Faryad Darabi; Chowdhury, Fahmida N

    2012-01-01

    In epidemic modeling, the term infection strength indicates the ratio of infection rate and cure rate. If the infection strength is higher than a certain threshold -- which we define as the epidemic threshold - then the epidemic spreads through the population and persists in the long run. For a single generic graph representing the contact network of the population under consideration, the epidemic threshold turns out to be equal to the inverse of the spectral radius of the contact graph. However, in a real world scenario it is not possible to isolate a population completely: there is always some interconnection with another network, which partially overlaps with the contact network. Results for epidemic threshold in interconnected networks are limited to homogeneous mixing populations and degree distribution arguments. In this paper, we adopt a spectral approach. We show how the epidemic threshold in a given network changes as a result of being coupled with another network with fixed infection strength. In o...

  18. Reliability theory for diffusion processes on interconnected networks

    Science.gov (United States)

    Khorramzadeh, Yasamin; Youssef, Mina; Eubank, Stephen

    2014-03-01

    We present the concept of network reliability as a framework to study diffusion dynamics in interdependent networks. We illustrate how different outcomes of diffusion processes, such as cascading failure, can be studied by estimating the reliability polynomial under different reliability rules. As an example, we investigate the effect of structural properties on diffusion dynamics for a few different topologies of two coupled networks. We evaluate the effect of varying the probability of failure propagating along the edges, both within a single network as well as between the networks. We exhibit the sensitivity of interdependent network reliability and connectivity to edge failures in each topology. Network Dynamics and Simulation Science Laboratory, Virginia Bioinformatics Institute, Virginia Tech, Blacksburg, Virginia 24061, USA.

  19. Design of Hierarchical Ring Networks Using Branch-and-Price

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2004-01-01

    We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed...... link establishment costs and the link capacity costs into account. The hierarchical two layer ring network design problem is solved in two stages: First the bottom layer, i.e. the metro-rings are designed, implicitly taking into account the capacity cost of the federal-ring. Then the federal......-ring is designed connecting the metro-rings, minimizing fixed link establishment costs of the federal-ring. A branch-and-price algorithm is presented for the design of the bottom layer and it is suggested that existing methods are used for the design of the federal-ring. Computational results are given...

  20. Strongly Resilient Non-Interactive Key Predistribution For Hierarchical Networks

    CERN Document Server

    Chen, Hao

    2010-01-01

    Key establishment is the basic necessary tool in the network security, by which pairs in the network can establish shared keys for protecting their pairwise communications. There have been some key agreement or predistribution schemes with the property that the key can be established without the interaction (\\cite{Blom84,BSHKY92,S97}). Recently the hierarchical cryptography and the key management for hierarchical networks have been active topics(see \\cite{BBG05,GHKRRW08,GS02,HNZI02,HL02,Matt04}. ). Key agreement schemes for hierarchical networks were presented in \\cite{Matt04,GHKRRW08} which is based on the Blom key predistribution scheme(Blom KPS, [1]) and pairing. In this paper we introduce generalized Blom-Blundo et al key predistribution schemes. These generalized Blom-Blundo et al key predistribution schemes have the same security functionality as the Blom-Blundo et al KPS. However different and random these KPSs can be used for various parts of the networks for enhancing the resilience. We also presentk...

  1. Hierarchical Compressed Sensing for Cluster Based Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Vishal Krishna Singh

    2016-02-01

    Full Text Available Data transmission consumes significant amount of energy in large scale wireless sensor networks (WSNs. In such an environment, reducing the in-network communication and distributing the load evenly over the network can reduce the overall energy consumption and maximize the network lifetime significantly. In this work, the aforementioned problem of network lifetime and uneven energy consumption in large scale wireless sensor networks is addressed. This work proposes a hierarchical compressed sensing (HCS scheme to reduce the in-network communication during the data gathering process. Co-related sensor readings are collected via a hierarchical clustering scheme. A compressed sensing (CS based data processing scheme is devised to transmit the data from the source to the sink. The proposed HCS is able to identify the optimal position for the application of CS to achieve reduced and similar number of transmissions on all the nodes in the network. An activity map is generated to validate the reduced and uniformly distributed communication load of the WSN. Based on the number of transmissions per data gathering round, the bit-hop metric model is used to analyse the overall energy consumption. Simulation results validate the efficiency of the proposed method over the existing CS based approaches.

  2. Time Synchronization in Hierarchical TESLA Wireless Sensor Networks

    Energy Technology Data Exchange (ETDEWEB)

    Jason L. Wright; Milos Manic

    2009-08-01

    Time synchronization and event time correlation are important in wireless sensor networks. In particular, time is used to create a sequence events or time line to answer questions of cause and effect. Time is also used as a basis for determining the freshness of received packets and the validity of cryptographic certificates. This paper presents secure method of time synchronization and event time correlation for TESLA-based hierarchical wireless sensor networks. The method demonstrates that events in a TESLA network can be accurately timestamped by adding only a few pieces of data to the existing protocol.

  3. SOFM Neural Network Based Hierarchical Topology Control for Wireless Sensor Networks

    OpenAIRE

    2014-01-01

    Well-designed network topology provides vital support for routing, data fusion, and target tracking in wireless sensor networks (WSNs). Self-organization feature map (SOFM) neural network is a major branch of artificial neural networks, which has self-organizing and self-learning features. In this paper, we propose a cluster-based topology control algorithm for WSNs, named SOFMHTC, which uses SOFM neural network to form a hierarchical network structure, completes cluster head selection by the...

  4. Extending stability through hierarchical clusters in Echo State Networks

    Directory of Open Access Journals (Sweden)

    Sarah Jarvis

    2010-07-01

    Full Text Available Echo State Networks (ESN are reservoir networks that satisfy well-established criteria for stability when constructed as feedforward networks. Recent evidence suggests that stability criteria are altered in the presence of reservoir substructures, such as clusters. Understanding how the reservoir architecture affects stability is thus important for the appropriate design of any ESN. To quantitatively determine the influence of the most relevant network parameters, we analysed the impact of reservoir substructures on stability in hierarchically clustered ESNs (HESN, as they allow a smooth transition from highly structured to increasingly homogeneous reservoirs. Previous studies used the largest eigenvalue of the reservoir connectivity matrix (spectral radius as a predictor for stable network dynamics. Here, we evaluate the impact of clusters, hierarchy and intercluster connectivity on the predictive power of the spectral radius for stability. Both hierarchy and low relative cluster sizes extend the range of spectral radius values, leading to stable networks, while increasing intercluster connectivity decreased maximal spectral radius.

  5. Magnetic and Magnetoresistive Properties of 3D Interconnected NiCo Nanowire Networks

    Science.gov (United States)

    da Câmara Santa Clara Gomes, Tristan; De La Torre Medina, Joaquín; Lemaitre, Matthieu; Piraux, Luc

    2016-10-01

    Track-etched polymer membranes with crossed nanochannels have been revealed to be most suitable as templates to produce large surface area and mechanically stable 3D interconnected nanowire (NW) networks by electrodeposition. Geometrically controlled NW superstructures made of NiCo ferromagnetic alloys exhibit appealing magnetoresistive properties. The combination of exact alloy compositions with the spatial arrangement of NWs in the 3D network is decisive to obtain specific magnetic and magneto-transport behavior. A proposed simple model based on topological aspects of the 3D NW networks is used to accurately determine the anisotropic magnetoresistance ratios. Despite of their complex topology, the microstructure of Co-rich NiCo NW networks display mixed fcc-hcp phases with the c-axis of the hcp phase oriented perpendicular to their axis. These interconnected NW networks have high potential as reliable and stable magnetic field sensors.

  6. A practical interconnection network RP(k) and its routing algorithms

    Institute of Scientific and Technical Information of China (English)

    刘方爱; 刘志勇; 乔香珍

    2001-01-01

    Based on Petersen graph, a new interconnection network, the RP(k) network, is developed and the properties of the RP(k) network are investigated. The diameter of the RP(k) network is [ k/2] + 2 and its degree is 5. We prove that the diameter of the RP(k) network is much smaller than that of the 2-D Torus network when the number of nodes in interconnection networks is less than or equal to 300. In order to analyze the communication performance in a group of nodes, we propose the concepts of the optimal node groups and the diameter of the optimal node groups. We also show that the diameter of the optimal node groups in the RP(k) network is less than that in the 2-D Torus network. Especially when the number of nodes in an optimal node group is between 6 and 100, the diameter of the optimal node groups in the RP(k) network is half of that in the 2-D Torus network. Furthermore based on the RP(k) network we design a set of routing algorithms which are point-to-point routing, permutation routing, one-to-all routing and all-to-all routing. Their communication efficiencies are [k/2] + 2, k + 5, [k/2] + 2, and k + 5 respectively. The RP(k) network and the routing algorithms can provide efficient communication means for parallel and distributed computer system.

  7. Traffic Load on Interconnection Lines of Generalized Double Ring Network Structures

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Riaz, Muhammad Tahir; Madsen, Ole Brun

    2004-01-01

    Generalized Double Ring (N2R) network structures possess a number of good properties, but being not planar they are hard to physically embed in communication networks. However, if some of the lines, the interconnection lines, are implemented by wireless technologies, the remaining structure...... consists of two planar rings, which are easily embedded by fiber or other wired solutions. It is shown that for large N2R structures, the interconnection lines carry notably lower loads than the other lines if shortest-path routing is used, and the effects of two other routing schemes are explored, leading...... to lower load on interconnection lines at the price of larger efficient average distance and diameter....

  8. Hierarchical Resource Allocation in Femtocell Networks using Graph Algorithms

    CERN Document Server

    Sadr, Sanam

    2012-01-01

    This paper presents a hierarchical approach to resource allocation in open-access femtocell networks. The major challenge in femtocell networks is interference management which in our system, based on the Long Term Evolution (LTE) standard, translates to which user should be allocated which physical resource block (or fraction thereof) from which femtocell access point (FAP). The globally optimal solution requires integer programming and is mathematically intractable. We propose a hierarchical three-stage solution: first, the load of each FAP is estimated considering the number of users connected to the FAP, their average channel gain and required data rates. Second, based on each FAP's load, the physical resource blocks (PRBs) are allocated to FAPs in a manner that minimizes the interference by coloring the modified interference graph. Finally, the resource allocation is performed at each FAP considering users' instantaneous channel gain. The two major advantages of this suboptimal approach are the significa...

  9. Replanning Using Hierarchical Task Network and Operator-Based Planning

    Science.gov (United States)

    Wang, X.; Chien, S.

    1997-01-01

    In order to scale-up to real-world problems, planning systems must be able to replan in order to deal with changes in problem context. In this paper we describe hierarchical task network and operatorbased re-planning techniques which allow adaptation of a previous plan to account for problems associated with executing plans in real-world domains with uncertainty, concurrency, changing objectives.

  10. Three-dimensional interconnected nickel phosphide networks with hollow microstructures and desulfurization performance

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Shuna, E-mail: zhangshujuan@tust.edu.cn [College of Textile Engineering, Zhejiang Industry Polytechnic College, Shaoxing 312000 (China); Zhang, Shujuan [College of Science, Tianjin University of Science and Technology, Tianjin 300457 (China); Song, Limin, E-mail: tjpu2012@sohu.com [College of Environment and Chemical Engineering and State Key Laboratory of Hollow-Fiber Membrane Materials and Membrane Processes, Tianjin Polytechnic University, Tianjin 300387 (China); Wu, Xiaoqing [Institute of Composite Materials and Ministry of Education Key Laboratory of Advanced Textile Composite Materials, Tianjin Polytechnic University, Tianjin 300387 (China); Fang, Sheng, E-mail: songlmnk@sohu.com [College of Environment and Chemical Engineering and State Key Laboratory of Hollow-Fiber Membrane Materials and Membrane Processes, Tianjin Polytechnic University, Tianjin 300387 (China)

    2014-05-01

    Graphical abstract: Three-dimensional interconnected nickel phosphide networks with hollow microstructures and desulfurization performance. - Highlights: • Three-dimensional Ni{sub 2}P has been prepared using foam nickel as a template. • The microstructures interconnected and formed sponge-like porous networks. • Three-dimensional Ni{sub 2}P shows superior hydrodesulfurization activity. - Abstract: Three-dimensional microstructured nickel phosphide (Ni{sub 2}P) was fabricated by the reaction between foam nickel (Ni) and phosphorus red. The as-prepared Ni{sub 2}P samples, as interconnected networks, maintained the original mesh structure of foamed nickel. The crystal structure and morphology of the as-synthesized Ni{sub 2}P were characterized by X-ray diffraction, scanning electron microscopy, automatic mercury porosimetry and X-ray photoelectron spectroscopy. The SEM study showed adjacent hollow branches were mutually interconnected to form sponge-like networks. The investigation on pore structure provided detailed information for the hollow microstructures. The growth mechanism for the three-dimensionally structured Ni{sub 2}P was postulated and discussed in detail. To investigate its catalytic properties, SiO{sub 2} supported three-dimensional Ni{sub 2}P was prepared successfully and evaluated for the hydrodesulfurization (HDS) of dibenzothiophene (DBT). DBT molecules were mostly hydrogenated and then desulfurized by Ni{sub 2}P/SiO{sub 2}.

  11. Fuzzy-information-based robustness of interconnected networks against attacks and failures

    Science.gov (United States)

    Zhu, Qian; Zhu, Zhiliang; Wang, Yifan; Yu, Hai

    2016-09-01

    Cascading failure is fatal in applications and its investigation is essential and therefore became a focal topic in the field of complex networks in the last decade. In this paper, a cascading failure model is established for interconnected networks and the associated data-packet transport problem is discussed. A distinguished feature of the new model is its utilization of fuzzy information in resisting uncertain failures and malicious attacks. We numerically find that the giant component of the network after failures increases with tolerance parameter for any coupling preference and attacking ambiguity. Moreover, considering the effect of the coupling probability on the robustness of the networks, we find that the robustness of the assortative coupling and random coupling of the network model increases with the coupling probability. However, for disassortative coupling, there exists a critical phenomenon for coupling probability. In addition, a critical value that attacking information accuracy affects the network robustness is observed. Finally, as a practical example, the interconnected AS-level Internet in South Korea and Japan is analyzed. The actual data validates the theoretical model and analytic results. This paper thus provides some guidelines for preventing cascading failures in the design of architecture and optimization of real-world interconnected networks.

  12. Multi-mode clustering model for hierarchical wireless sensor networks

    Science.gov (United States)

    Hu, Xiangdong; Li, Yongfu; Xu, Huifen

    2017-03-01

    The topology management, i.e., clusters maintenance, of wireless sensor networks (WSNs) is still a challenge due to its numerous nodes, diverse application scenarios and limited resources as well as complex dynamics. To address this issue, a multi-mode clustering model (M2 CM) is proposed to maintain the clusters for hierarchical WSNs in this study. In particular, unlike the traditional time-trigger model based on the whole-network and periodic style, the M2 CM is proposed based on the local and event-trigger operations. In addition, an adaptive local maintenance algorithm is designed for the broken clusters in the WSNs using the spatial-temporal demand changes accordingly. Numerical experiments are performed using the NS2 network simulation platform. Results validate the effectiveness of the proposed model with respect to the network maintenance costs, node energy consumption and transmitted data as well as the network lifetime.

  13. The interconnected rhizosphere: High network complexity dominates rhizosphere assemblages.

    Science.gov (United States)

    Shi, Shengjing; Nuccio, Erin E; Shi, Zhou J; He, Zhili; Zhou, Jizhong; Firestone, Mary K

    2016-08-01

    While interactions between roots and microorganisms have been intensively studied, we know little about interactions among root-associated microbes. We used random matrix theory-based network analysis of 16S rRNA genes to identify bacterial networks associated with wild oat (Avena fatua) over two seasons in greenhouse microcosms. Rhizosphere networks were substantially more complex than those in surrounding soils, indicating the rhizosphere has a greater potential for interactions and niche-sharing. Network complexity increased as plants grew, even as diversity decreased, highlighting that community organisation is not captured by univariate diversity. Covariations were predominantly positive (> 80%), suggesting that extensive mutualistic interactions may occur among rhizosphere bacteria; we identified quorum-based signalling as one potential strategy. Putative keystone taxa often had low relative abundances, suggesting low-abundance taxa may significantly contribute to rhizosphere function. Network complexity, a previously undescribed property of the rhizosphere microbiome, appears to be a defining characteristic of this habitat. © 2016 John Wiley & Sons Ltd/CNRS.

  14. Hierarchical Communication Network Architectures for Offshore Wind Power Farms

    Directory of Open Access Journals (Sweden)

    Mohamed A. Ahmed

    2014-05-01

    Full Text Available Nowadays, large-scale wind power farms (WPFs bring new challenges for both electric systems and communication networks. Communication networks are an essential part of WPFs because they provide real-time control and monitoring of wind turbines from a remote location (local control center. However, different wind turbine applications have different requirements in terms of data volume, latency, bandwidth, QoS, etc. This paper proposes a hierarchical communication network architecture that consist of a turbine area network (TAN, farm area network (FAN, and control area network (CAN for offshore WPFs. The two types of offshore WPFs studied are small-scale WPFs close to the grid and medium-scale WPFs far from the grid. The wind turbines are modelled based on the logical nodes (LN concepts of the IEC 61400-25 standard. To keep pace with current developments in wind turbine technology, the network design takes into account the extension of the LNs for both the wind turbine foundation and meteorological measurements. The proposed hierarchical communication network is based on Switched Ethernet. Servers at the control center are used to store and process the data received from the WPF. The network architecture is modelled and evaluated via OPNET. We investigated the end-to-end (ETE delay for different WPF applications. The results are validated by comparing the amount of generated sensing data with that of received traffic at servers. The network performance is evaluated, analyzed and discussed in view of end-to-end (ETE delay for different link bandwidths.

  15. Nanorings and rods interconnected by self-assembly mimicking an artificial network of neurons

    Science.gov (United States)

    Escárcega-Bobadilla, Martha V.; Zelada-Guillén, Gustavo A.; Pyrlin, Sergey V.; Wegrzyn, Marcin; Ramos, Marta M. D.; Giménez, Enrique; Stewart, Andrew; Maier, Gerhard; Kleij, Arjan W.

    2013-11-01

    Molecular electronics based on structures ordered as neural networks emerges as the next evolutionary milestone in the construction of nanodevices with unprecedented applications. However, the straightforward formation of geometrically defined and interconnected nanostructures is crucial for the production of electronic circuitry nanoequivalents. Here we report on the molecularly fine-tuned self-assembly of tetrakis-Schiff base compounds into nanosized rings interconnected by unusually large nanorods providing a set of connections that mimic a biological network of neurons. The networks are produced through self-assembly resulting from the molecular conformation and noncovalent intermolecular interactions. These features can be easily generated on flat surfaces and in a polymeric matrix by casting from solution under ambient conditions. The structures can be used to guide the position of electron-transporting agents such as carbon nanotubes on a surface or in a polymer matrix to create electrically conducting networks that can find direct use in constructing nanoelectronic circuits.

  16. Optical interconnection network for parallel access to multi-rank memory in future computing systems.

    Science.gov (United States)

    Wang, Kang; Gu, Huaxi; Yang, Yintang; Wang, Kun

    2015-08-10

    With the number of cores increasing, there is an emerging need for a high-bandwidth low-latency interconnection network, serving core-to-memory communication. In this paper, aiming at the goal of simultaneous access to multi-rank memory, we propose an optical interconnection network for core-to-memory communication. In the proposed network, the wavelength usage is delicately arranged so that cores can communicate with different ranks at the same time and broadcast for flow control can be achieved. A distributed memory controller architecture that works in a pipeline mode is also designed for efficient optical communication and transaction address processes. The scaling method and wavelength assignment for the proposed network are investigated. Compared with traditional electronic bus-based core-to-memory communication, the simulation results based on the PARSEC benchmark show that the bandwidth enhancement and latency reduction are apparent.

  17. Exabits/s integrated photonic interconnection technology for flexible data-centric optical networks

    Science.gov (United States)

    Binh, Le N.; Tao, Thomas W.; Ning, Gordon L.

    2016-03-01

    Optical networking is evolving from classical service-provider base data-center centric (DCC) internetworking environment with massive capacity, hence demanding novel optical switching and interconnecting technologies. The traditional telecom networks are under a flattening transformation to meet challenges from DCC networks for massive capacity serving in order of multi-Pb/s. We present proposed distributed and concentric data center based networks and the essential optical interconnection technologies, from the photonic kernels to electronic and optoelectronic server clusters, in both passive and active structures. Optical switching devices and integrated matrices are proposed composing of tunable (bandwidth and center wavelength) optical filters and switches as well as resonant microring modulators (μRM)(switching and spectral demux/mux) for multi-wavelength flexible-bandwidth optical channels of aggregate capacity reaching Ebps. The design principles and some experimental results are also reported.

  18. Layer aggregation and reducibility of multilayer interconnected networks

    CERN Document Server

    De Domenico, M; Arenas, A; Latora, V

    2014-01-01

    Many complex systems can be represented as networks composed by distinct layers, interacting and depending on each others. For example, in biology, a good description of the full protein-protein interactome requires, for some organisms, up to seven distinct network layers, with thousands of protein-protein interactions each. A fundamental open question is then how much information is really necessary to accurately represent the structure of a multilayer complex system, and if and when some of the layers can indeed be aggregated. Here we introduce a method, based on information theory, to reduce the number of layers in multilayer networks, while minimizing information loss. We validate our approach on a set of synthetic benchmarks, and prove its applicability to an extended data set of protein-genetic interactions, showing cases where a strong reduction is possible and cases where it is not. Using this method we can describe complex systems with an optimal trade--off between accuracy and complexity.

  19. Identifying Modular Flows on Multilayer Networks Reveals Highly Overlapping Organization in Interconnected Systems

    Science.gov (United States)

    De Domenico, Manlio; Lancichinetti, Andrea; Arenas, Alex; Rosvall, Martin

    2015-01-01

    To comprehend interconnected systems across the social and natural sciences, researchers have developed many powerful methods to identify functional modules. For example, with interaction data aggregated into a single network layer, flow-based methods have proven useful for identifying modular dynamics in weighted and directed networks that capture constraints on flow processes. However, many interconnected systems consist of agents or components that exhibit multiple layers of interactions, possibly from several different processes. Inevitably, representing this intricate network of networks as a single aggregated network leads to information loss and may obscure the actual organization. Here, we propose a method based on a compression of network flows that can identify modular flows both within and across layers in nonaggregated multilayer networks. Our numerical experiments on synthetic multilayer networks, with some layers originating from the same interaction process, show that the analysis fails in aggregated networks or when treating the layers separately, whereas the multilayer method can accurately identify modules across layers that originate from the same interaction process. We capitalize on our findings and reveal the community structure of two multilayer collaboration networks with topics as layers: scientists affiliated with the Pierre Auger Observatory and scientists publishing works on networks on the arXiv. Compared to conventional aggregated methods, the multilayer method uncovers connected topics and reveals smaller modules with more overlap that better capture the actual organization.

  20. Routing and wavelength assignment in hierarchical WDM networks

    Institute of Scientific and Technical Information of China (English)

    Yiyi LU; Ruxiang JIN; Chen HE

    2008-01-01

    A new routing and wavelength assignment method applied in hierarchical wavelength division multiplexing(WDM)networks is proposed.The algorithm is called offiine band priority algorithm(offiine BPA).The offline BPA targets to maximize the number of waveband paths under the condition of minimum number of wavelengths,and solve the routing and wavelength assignment(RWA)problem with waveband grooming to reduce cost.Based on the circle construction algorithm,waveband priority function is introduced to calculate the RWA problem.Simulation results demonstrate that the proposed algorithm achieves significant cost reduction in WDM network construction.

  1. Hierarchical control based on Hopfield network for nonseparable optimization problems

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    The nonseparable optimization control problem is considered, where the overall objective function is not of an additive form with respect to subsystems. Since there exists the problem that computation is very slow when using iterative algorithms in multiobjective optimization, Hopfield optimization hierarchical network based on IPM is presented to overcome such slow computation difficulty. Asymptotic stability of this Hopfield network is proved and its equilibrium point is the optimal point of the original problem. The simulation shows that the net is effective to deal with the optimization control problem for large-scale nonseparable steady state systems.

  2. Physical Properties of 3D Interconnected Graphite Networks - Aerographite

    Science.gov (United States)

    2015-10-30

    carbon based nanomaterial formed to a 3-D network of directly inter- connected thin-walled graphite layers with an ultralow density of some 200 µg/cm...initial value of resistance is already reached at about 800 µm displacement. Thus, the Aer- ographite seems to unfold itself again after removing the

  3. The Linked System Project : a network interconnection project between three major bibliographic utilities and LC

    Science.gov (United States)

    Kurihara, Shin'ichi

    The Linked Systems Project (LSP) is the first network project based on the Open Systems Interconnection (OSI) in the world. The purpose of the project is to interconnect between three major bibliographic utilities and LC, and to perform as one system on the whole. The first application developed for the LSP is the sharing of name authority data based on the Name Authority Cooperative (NACO) Project. In 1985, LC began to send name authority records to RLG/RLIN. Since 1987, RLG/RLIN and OCLC send name authority records to LC. Bibliographic records will be sent mutually between three major bibliographic utilities and LC near future.

  4. Bridging Women Rights Networks: Analyzing Interconnected Online Collective Actions

    OpenAIRE

    Serpil T. Yuce; Nitin Agarwal; Wigand, Rolf T.; Merlyna Lim; Rebecca S. Robinson

    2014-01-01

    In recent mass protests such as the Arab Spring and Occupy movements, protesters used social media to spread awareness, coordinate, and mobilize support. Social media-assisted collective action has attracted much attention from journalists, political observers, and researchers of various disciplines. In this article, the authors study transnational online collective action through the lens of inter-network cooperation. The authors analyze interaction and support between the women's rights net...

  5. Hierarchical organization of brain functional network during visual task

    CERN Document Server

    Zhuo, Zhao; Fu, Zhong-Qian; Zhang, Jie

    2011-01-01

    In this paper, the brain functional networks derived from high-resolution synchronous EEG time series during visual task are generated by calculating the phase synchronization among the time series. The hierarchical modular organizations of these networks are systematically investigated by the fast Girvan-Newman algorithm. At the same time, the spatially adjacent electrodes (corresponding to EEG channels) are clustered into functional groups based on anatomical parcellation of brain cortex, and this clustering information are compared to that of the functional network. The results show that the modular architectures of brain functional network are in coincidence with that from the anatomical structures over different levels of hierarchy, which suggests that population of neurons performing the same function excite and inhibit in identical rhythms. The structure-function relationship further reveals that the correlations among EEG time series in the same functional group are much stronger than those in differe...

  6. Complex networks with scale-free nature and hierarchical modularity

    Science.gov (United States)

    Shekatkar, Snehal M.; Ambika, G.

    2015-09-01

    Generative mechanisms which lead to empirically observed structure of networked systems from diverse fields like biology, technology and social sciences form a very important part of study of complex networks. The structure of many networked systems like biological cell, human society and World Wide Web markedly deviate from that of completely random networks indicating the presence of underlying processes. Often the main process involved in their evolution is the addition of links between existing nodes having a common neighbor. In this context we introduce an important property of the nodes, which we call mediating capacity, that is generic to many networks. This capacity decreases rapidly with increase in degree, making hubs weak mediators of the process. We show that this property of nodes provides an explanation for the simultaneous occurrence of the observed scale-free structure and hierarchical modularity in many networked systems. This also explains the high clustering and small-path length seen in real networks as well as non-zero degree-correlations. Our study also provides insight into the local process which ultimately leads to emergence of preferential attachment and hence is also important in understanding robustness and control of real networks as well as processes happening on real networks.

  7. 局部扭立方体环互连网络及其性质%Locally twisted cube-connected ring interconnect network and their properties

    Institute of Scientific and Technical Information of China (English)

    何高兴; 梁家荣; 史胜男

    2014-01-01

    The optimization of network topology structure is an important research direction on the research of interconnection network.Locally twisted cube (LTQn )is the optimized variant of hypercube (Qn ).However,if LTQn is upgraded,it will multiply the number of nodes of the network,which goes against the application and development of LTQn .In order to solve this problem,this paper proposed a kind of new network topology structure:locally twisted cube-connected ring interconnect network (LRN).It gave the definition of LRN and its topology structure,and studied the problems on the diameter,connec-tivity,Hamilton-connectivity,pancyclicity and routing of LRN.At last it proves the LRN is a kind of hierarchical ring inter-connection networks (HRN),and it is easy to upgrade and has many excellent properties of LTQn.%优化网络的拓扑结构是互连网络研究的重要研究方向。局部扭立方体(locally twisted cube,LTQn )是对超立方体(hypercube,Qn )互连网络的优化变种,然而当对LTQn 升级时,需要成倍地增加网络的节点,这不利于LTQn的应用和发展。为了克服LTQn 这一缺陷,提出了一种新的互连网络拓扑结构:局部扭立方体环互连网络(locally twisted cube-connected ring interconnect network,LRN),给出了LRN的定义及其拓扑结构,并研究了LRN的网络直径、连接度、汉密尔顿连通性、泛圈性、路由等问题,证明了LRN是一种易于升级又具有LTQn 许多优良性质的层次环互连网络(hierarchical ring interconnection networks,HRN)。

  8. Doubly Optimal Secure Multicasting: Hierarchical Hybrid Communication Network : Disaster Relief

    CERN Document Server

    Garimella, Rama Murthy; Singhal, Deepti

    2011-01-01

    Recently, the world has witnessed the increasing occurrence of disasters, some of natural origin and others caused by man. The intensity of the phenomenon that cause such disasters, the frequency in which they occur, the number of people affected and the material damage caused by them have been growing substantially. Disasters are defined as natural, technological, and human-initiated events that disrupt the normal functioning of the economy and society on a large scale. Areas where disasters have occurred bring many dangers to rescue teams and the communication network infrastructure is usually destroyed. To manage these hazards, different wireless technologies can be launched in the area of disaster. This paper discusses the innovative wireless technologies for Disaster Management. Specifically, issues related to the design of Hierarchical Hybrid Communication Network (arising in the communication network for disaster relief) are discussed.

  9. Hierarchical modular granular neural networks with fuzzy aggregation

    CERN Document Server

    Sanchez, Daniela

    2016-01-01

    In this book, a new method for hybrid intelligent systems is proposed. The proposed method is based on a granular computing approach applied in two levels. The techniques used and combined in the proposed method are modular neural networks (MNNs) with a Granular Computing (GrC) approach, thus resulting in a new concept of MNNs; modular granular neural networks (MGNNs). In addition fuzzy logic (FL) and hierarchical genetic algorithms (HGAs) are techniques used in this research work to improve results. These techniques are chosen because in other works have demonstrated to be a good option, and in the case of MNNs and HGAs, these techniques allow to improve the results obtained than with their conventional versions; respectively artificial neural networks and genetic algorithms.

  10. Retrieval capabilities of hierarchical networks: from Dyson to Hopfield.

    Science.gov (United States)

    Agliari, Elena; Barra, Adriano; Galluzzi, Andrea; Guerra, Francesco; Tantari, Daniele; Tavani, Flavia

    2015-01-16

    We consider statistical-mechanics models for spin systems built on hierarchical structures, which provide a simple example of non-mean-field framework. We show that the coupling decay with spin distance can give rise to peculiar features and phase diagrams much richer than their mean-field counterpart. In particular, we consider the Dyson model, mimicking ferromagnetism in lattices, and we prove the existence of a number of metastabilities, beyond the ordered state, which become stable in the thermodynamic limit. Such a feature is retained when the hierarchical structure is coupled with the Hebb rule for learning, hence mimicking the modular architecture of neurons, and gives rise to an associative network able to perform single pattern retrieval as well as multiple-pattern retrieval, depending crucially on the external stimuli and on the rate of interaction decay with distance; however, those emergent multitasking features reduce the network capacity with respect to the mean-field counterpart. The analysis is accomplished through statistical mechanics, Markov chain theory, signal-to-noise ratio technique, and numerical simulations in full consistency. Our results shed light on the biological complexity shown by real networks, and suggest future directions for understanding more realistic models.

  11. Category theoretic analysis of hierarchical protein materials and social networks.

    Directory of Open Access Journals (Sweden)

    David I Spivak

    Full Text Available Materials in biology span all the scales from Angstroms to meters and typically consist of complex hierarchical assemblies of simple building blocks. Here we describe an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs. An olog is like a "concept web" or "semantic network" except that it follows a rigorous mathematical formulation based on category theory. This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other olog. We consider simple cases of beta-helical and amyloid-like protein filaments subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties. We also construct a representation of a social network in which people send text-messages to their nearest neighbors and act as a team to perform a task. We show that the olog for the protein and the olog for the social network feature identical category-theoretic representations, and we proceed to precisely explicate the analogy or isomorphism between them. The examples presented here demonstrate that the intrinsic nature of a complex system, which in particular includes a precise relationship between structure and function at different hierarchical levels, can be effectively represented by an olog. This, in turn, allows for comparative studies between disparate materials or fields of application, and results in novel approaches to derive functionality in the design of de novo hierarchical systems. We discuss opportunities and challenges associated with the description of complex biological materials by using ologs as a powerful tool for analysis and design in the context of materiomics, and we present the potential impact of this approach for engineering, life sciences, and medicine.

  12. An analysis of inhibitory pseudo-interconnections in unsupervised neural networks

    Science.gov (United States)

    Tran, Minh-Triet; Le, Nam Do-Hoang

    2013-12-01

    Lateral connection is a fundamental element of human neural networks which enables sparse learning and topographical order in feature maps. Due to high complexity and computational cost, computer scientists tend to simplify it in practical implementations. To utilize the simplicity of traditional networks while preserving the effects of interconnections, the authors employ numerical filters in unsupervised learning networks. These filters suppress low activations and decorrelate high ones, which are similar to how inhibitory lateral connections behave. Inhibitory networks outperform conventional approach in both standard datasets CIFAR-10 and STL-10. Our method also yields competitive results in comparison with other single-layer unsupervised networks. Furthermore, it is promising to apply inhibitory networks into deep learning systems for complex recognition problem.

  13. Nature-Inspired Interconnects for Self-Assembled Large-Scale Network-on-Chip Designs

    CERN Document Server

    Teuscher, Christof

    2007-01-01

    Future nano-scale electronics built up from an Avogadro number of components needs efficient, highly scalable, and robust means of communication in order to be competitive with traditional silicon approaches. In recent years, the Networks-on-Chip (NoC) paradigm emerged as a promising solution to interconnect challenges in silicon-based electronics. Current NoC architectures are either highly regular or fully customized, both of which represent implausible assumptions for emerging bottom-up self-assembled molecular electronics that are generally assumed to have a high degree of irregularity and imperfection. Here, we pragmatically and experimentally investigate important design trade-offs and properties of an irregular, abstract, yet physically plausible 3D small-world interconnect fabric that is inspired by modern network-on-chip paradigms. We vary the framework's key parameters, such as the connectivity, the number of switch nodes, the distribution of long- versus short-range connections, and measure the net...

  14. INTERCONNECTING NETWORKS WITH DIFFERENT LEVELS OF SECURITY – A PRESENT NATO PROBLEM

    Directory of Open Access Journals (Sweden)

    LIVIU TATOMIR

    2016-07-01

    Full Text Available A situation often met in the Romanian Armed Forces in recent years is the need for interconnecting two networks (domains with different levels of classification. Considering that the Romanian armed troops are involved in numerous missions with NATO partners, solutions, already implemented across the organization, are considered to be applied in domestic systems, also. This paper presents the solutions adopted by NATO in order to solve the problem of cross -domains interconnections. We present the maturity level reached by these solutions and the possibility of implementing these solutions in the Romanian Armed Forces, with or without specific adaptation to our own rules and regulations. The goal is to use a NATO already proved solution to our national classified networks.

  15. Fast Multicast on Multistage Interconnection Networks Using Multi-Head Worms

    Institute of Scientific and Technical Information of China (English)

    WANG Xiaodong; XU Ming; ZHOU Xingming

    1999-01-01

    Abstract This paper proposes a new approach forimplementing fast multicast on multistage interconnection networks (MINs)with multi-head worms. For an MIN with n stages of k×k switches,a singlemulti-head worm can cover an arbitrary set of destinations with asingle communication start-up. Compared with schemes using unicastmessages, this approach reduces multicast latency significantly andperforms better than multi-destination worms.

  16. Genomic analysis of the hierarchical structure of regulatory networks

    Science.gov (United States)

    Yu, Haiyuan; Gerstein, Mark

    2006-01-01

    A fundamental question in biology is how the cell uses transcription factors (TFs) to coordinate the expression of thousands of genes in response to various stimuli. The relationships between TFs and their target genes can be modeled in terms of directed regulatory networks. These relationships, in turn, can be readily compared with commonplace “chain-of-command” structures in social networks, which have characteristic hierarchical layouts. Here, we develop algorithms for identifying generalized hierarchies (allowing for various loop structures) and use these approaches to illuminate extensive pyramid-shaped hierarchical structures existing in the regulatory networks of representative prokaryotes (Escherichia coli) and eukaryotes (Saccharomyces cerevisiae), with most TFs at the bottom levels and only a few master TFs on top. These masters are situated near the center of the protein–protein interaction network, a different type of network from the regulatory one, and they receive most of the input for the whole regulatory hierarchy through protein interactions. Moreover, they have maximal influence over other genes, in terms of affecting expression-level changes. Surprisingly, however, TFs at the bottom of the regulatory hierarchy are more essential to the viability of the cell. Finally, one might think master TFs achieve their wide influence through directly regulating many targets, but TFs with most direct targets are in the middle of the hierarchy. We find, in fact, that these midlevel TFs are “control bottlenecks” in the hierarchy, and this great degree of control for “middle managers” has parallels in efficient social structures in various corporate and governmental settings. PMID:17003135

  17. Hierarchical surface code for network quantum computing with modules of arbitrary size

    Science.gov (United States)

    Li, Ying; Benjamin, Simon C.

    2016-10-01

    The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noise while operations within modules have a significantly higher fidelity. To optimize fault tolerance in such architectures we introduce a hierarchical generalization of the surface code: a small "patch" of the code exists within each module and constitutes a single effective qubit of the logic-level surface code. Errors primarily occur in a two-dimensional subspace, i.e., patch perimeters extruded over time, and the resulting noise threshold for intermodule links can exceed ˜10 % even in the absence of purification. Increasing the number of qubits within each module decreases the number of qubits necessary for encoding a logical qubit. But this advantage is relatively modest, and broadly speaking, a "fine-grained" network of small modules containing only about eight qubits is competitive in total qubit count versus a "course" network with modules containing many hundreds of qubits.

  18. A HIERARCHICAL INTRUSION DETECTION ARCHITECTURE FOR WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    Hossein Jadidoleslamy

    2011-10-01

    Full Text Available Networks protection against different types of attacks is one of most important posed issue into the network andinformation security application domains. This problem on Wireless Sensor Networks (WSNs, in attention to theirspecial properties, has more importance. Now, there are some of proposed architectures and guide lines to protectWireless Sensor Networks (WSNs against different types of intrusions; but any one of them do not has acomprehensive view to this problem and they are usually designed and implemented in single-purpose; but, theproposed design in this paper tries to has been a comprehensive view to this issue by presenting a complete andcomprehensive Intrusion Detection Architecture (IDA. The main contribution of this architecture is its hierarchicalstructure; i.e., it is designed and applicable, in one or two levels, consistent to the application domain and itsrequired security level. Focus of this paper is on the clustering WSNs, designing and deploying Cluster-basedIntrusion Detection System (CIDS on cluster-heads and Wireless Sensor Network wide level Intrusion DetectionSystem (WSNIDS on the central server. Suppositions of the WSN and Intrusion Detection Architecture (IDA are:static and heterogeneous network, hierarchical and clustering structure, clusters' overlapping and using hierarchicalrouting protocol such as LEACH, but along with minor changes. Finally, the proposed idea has been verified bydesigning a questionnaire, representing it to some (about 50 people experts and then, analyzing and evaluating itsacquired results.

  19. Combined multi-nozzle deposition and freeze casting process to superimpose two porous networks for hierarchical three-dimensional microenvironment.

    Science.gov (United States)

    Snyder, Jessica E; Hunger, Philipp M; Wang, Chengyang; Hamid, Qudus; Wegst, Ulrike G K; Sun, Wei

    2014-03-01

    An engineered three-dimensional scaffold with hierarchical porosity and multiple niche microenvironments is produced using a combined multi-nozzle deposition-freeze casting technique. In this paper we present a process to fabricate a scaffold with improved interconnectivity and hierarchical porosity. The scaffold is produced using a two-stage manufacturing process which superimposes a printed porous alginate (Alg) network and a directionally frozen ceramic-polymer matrix. The combination of two processes, multi-nozzle deposition and freeze casting, provides engineering control of the microenvironment of the scaffolds over several length scales; including the addition of lateral porosity and the ratio of polymer to ceramic microstructures. The printed polymer scaffold is submerged in a ceramic-polymer slurry and subsequently, both structures are directionally frozen (freeze cast), superimposing and patterning both microenvironments into a single hierarchical architecture. An optional additional sintering step removes the organic material and densifies the ceramic phase to produce a well-defined network of open pores and a homogenous cell wall material composition. The techniques presented in this contribution address processing challenges, such as structure definition, reproducibility and fine adjustments of unique length scales, which one typically encounters when fabricating topological channels between longitudinal and transverse porous networks.

  20. [A medical image semantic modeling based on hierarchical Bayesian networks].

    Science.gov (United States)

    Lin, Chunyi; Ma, Lihong; Yin, Junxun; Chen, Jianyu

    2009-04-01

    A semantic modeling approach for medical image semantic retrieval based on hierarchical Bayesian networks was proposed, in allusion to characters of medical images. It used GMM (Gaussian mixture models) to map low-level image features into object semantics with probabilities, then it captured high-level semantics through fusing these object semantics using a Bayesian network, so that it built a multi-layer medical image semantic model, aiming to enable automatic image annotation and semantic retrieval by using various keywords at different semantic levels. As for the validity of this method, we have built a multi-level semantic model from a small set of astrocytoma MRI (magnetic resonance imaging) samples, in order to extract semantics of astrocytoma in malignant degree. Experiment results show that this is a superior approach.

  1. Spatially Resolved Monitoring of Drying of Hierarchical Porous Organic Networks.

    Science.gov (United States)

    Velasco, Manuel Isaac; Silletta, Emilia V; Gomez, Cesar G; Strumia, Miriam C; Stapf, Siegfried; Monti, Gustavo Alberto; Mattea, Carlos; Acosta, Rodolfo H

    2016-03-01

    Evaporation kinetics of water confined in hierarchal polymeric porous media is studied by low field nuclear magnetic resonance (NMR). Systems synthesized with various degrees of cross-linker density render networks with similar pore sizes but different response when soaked with water. Polymeric networks with low percentage of cross-linker can undergo swelling, which affects the porosity as well as the drying kinetics. The drying process is monitored macroscopically by single-sided NMR, with spatial resolution of 100 μm, while microscopic information is obtained by measurements of spin-spin relaxation times (T2). Transition from a funicular to a pendular regime, where hydraulic connectivity is lost and the capillary flow cannot compensate for the surface evaporation, can be observed from inspection of the water content in different sample layers. Relaxation measurements indicate that even when the larger pore structures are depleted of water, capillary flow occurs through smaller voids.

  2. Architecture of the parallel hierarchical network for fast image recognition

    Science.gov (United States)

    Timchenko, Leonid; Wójcik, Waldemar; Kokriatskaia, Natalia; Kutaev, Yuriy; Ivasyuk, Igor; Kotyra, Andrzej; Smailova, Saule

    2016-09-01

    Multistage integration of visual information in the brain allows humans to respond quickly to most significant stimuli while maintaining their ability to recognize small details in the image. Implementation of this principle in technical systems can lead to more efficient processing procedures. The multistage approach to image processing includes main types of cortical multistage convergence. The input images are mapped into a flexible hierarchy that reflects complexity of image data. Procedures of the temporal image decomposition and hierarchy formation are described in mathematical expressions. The multistage system highlights spatial regularities, which are passed through a number of transformational levels to generate a coded representation of the image that encapsulates a structure on different hierarchical levels in the image. At each processing stage a single output result is computed to allow a quick response of the system. The result is presented as an activity pattern, which can be compared with previously computed patterns on the basis of the closest match. With regard to the forecasting method, its idea lies in the following. In the results synchronization block, network-processed data arrive to the database where a sample of most correlated data is drawn using service parameters of the parallel-hierarchical network.

  3. Reliable Point to Multipoint Hierarchical Routing in Scatternet Sensor Network

    Directory of Open Access Journals (Sweden)

    R.Dhaya

    2011-01-01

    Full Text Available In the recent development of communication, Bluetooth Scatternet wireless is a technology developed for wideband local accesses. Bluetooth technology is very popular because of its low cost and easy deployment which is based on IEEE 802.11standards. On the other hand Wireless Sensor Network (WSN consists of large number of sensor nodes distributed to monitor an environment and each node in a WSN consists of a small CPU, a sensing device and battery. Mostly, the sensor networks are distributed in an inconvenient location and it is difficult to recharge often. So routing in WSN is an important issue to consume energy and as well as to increase the life of the network, since a routing protocol finds the path between sources and sink. Moreover it is a challenging task to schedule the data between nodes in a scatternet in a congestive environment. Here this paper presents a new scheduling method for point to multi- point routing in Scatternet sensor network and the new dynamic routing method designed is cluster-based with hierarchical routing. The efficiency of this method is also compared in terms of energy consumption and the results show that the proposed routing is an energy efficient one which simultaneously increases the lifetime of the network.

  4. GSMNet: A Hierarchical Graph Model for Moving Objects in Networks

    Directory of Open Access Journals (Sweden)

    Hengcai Zhang

    2017-03-01

    Full Text Available Existing data models for moving objects in networks are often limited by flexibly controlling the granularity of representing networks and the cost of location updates and do not encompass semantic information, such as traffic states, traffic restrictions and social relationships. In this paper, we aim to fill the gap of traditional network-constrained models and propose a hierarchical graph model called the Geo-Social-Moving model for moving objects in Networks (GSMNet that adopts four graph structures, RouteGraph, SegmentGraph, ObjectGraph and MoveGraph, to represent the underlying networks, trajectories and semantic information in an integrated manner. The bulk of user-defined data types and corresponding operators is proposed to handle moving objects and answer a new class of queries supporting three kinds of conditions: spatial, temporal and semantic information. Then, we develop a prototype system with the native graph database system Neo4Jto implement the proposed GSMNet model. In the experiment, we conduct the performance evaluation using simulated trajectories generated from the BerlinMOD (Berlin Moving Objects Database benchmark and compare with the mature MOD system Secondo. The results of 17 benchmark queries demonstrate that our proposed GSMNet model has strong potential to reduce time-consuming table join operations an d shows remarkable advantages with regard to representing semantic information and controlling the cost of location updates.

  5. Nanostructured CuS networks composed of interconnected nanoparticles for asymmetric supercapacitors.

    Science.gov (United States)

    Fu, Wenbin; Han, Weihua; Zha, Heming; Mei, Junfeng; Li, Yunxia; Zhang, Zemin; Xie, Erqing

    2016-09-21

    Nanostructured metal sulfides with excellent electrochemical activity and electrical conductivity are particularly promising for applications in high-performance energy storage devices. Here, we report on the facile synthesis of nanostructured CuS networks composed of interconnected nanoparticles as novel battery-type materials for asymmetric supercapacitors. We find that the CuS networks exhibit a high specific capacity of 49.8 mA g(-1) at a current density of 1 A g(-1), good rate capability and cycle stability. The superior performance could be attributed to the interconnected nanoparticles of CuS networks, which can facilitate electrolyte diffusion and provide fast electron pathways. Furthermore, an aqueous asymmetric supercapacitor has been assembled by using the CuS networks as the positive electrode and activated carbon as the negative electrode. The assembled device can work at a high operating voltage of 1.6 V and show a maximum energy density of 17.7 W h kg(-1) at a power density of 504 W kg(-1). This study indicates that the CuS networks have great potential for supercapacitor applications.

  6. CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks

    Science.gov (United States)

    Franke, R.

    2016-11-01

    In many networks discovered in biology, medicine, neuroscience and other disciplines special properties like a certain degree distribution and hierarchical cluster structure (also called communities) can be observed as general organizing principles. Detecting the cluster structure of an unknown network promises to identify functional subdivisions, hierarchy and interactions on a mesoscale. It is not trivial choosing an appropriate detection algorithm because there are multiple network, cluster and algorithmic properties to be considered. Edges can be weighted and/or directed, clusters overlap or build a hierarchy in several ways. Algorithms differ not only in runtime, memory requirements but also in allowed network and cluster properties. They are based on a specific definition of what a cluster is, too. On the one hand, a comprehensive network creation model is needed to build a large variety of benchmark networks with different reasonable structures to compare algorithms. On the other hand, if a cluster structure is already known, it is desirable to separate effects of this structure from other network properties. This can be done with null model networks that mimic an observed cluster structure to improve statistics on other network features. A third important application is the general study of properties in networks with different cluster structures, possibly evolving over time. Currently there are good benchmark and creation models available. But what is left is a precise sandbox model to build hierarchical, overlapping and directed clusters for undirected or directed, binary or weighted complex random networks on basis of a sophisticated blueprint. This gap shall be closed by the model CHIMERA (Cluster Hierarchy Interconnection Model for Evaluation, Research and Analysis) which will be introduced and described here for the first time.

  7. All-optical code routing in interconnected optical CDMA and WDM ring networks.

    Science.gov (United States)

    Deng, Yanhua; Fok, Mable P; Prucnal, Paul R; Wang, Ting

    2010-11-01

    We propose an all-optical hybrid network composed of optical code division multiple access (CDMA) rings interconnecting through a reconfigurable wavelength division multiplexing (WDM) metro area ring. This network retains the advantages of both the optical CDMA and WDM techniques, including asynchronous access and differentiated quality of service, while removing the hard limit on the number of subscribers and increasing network flexibility. The all-optical network is enabled by using nonlinear optical loop mirrors in an add/drop router (ADR) that performs code conversion, dropping, and switching asynchronously. We experimentally demonstrate the functionalities of the ADR in the proposed scheme asynchronously and obtain error-free performance. The bit-error rate measurements show acceptable power penalties for different code routes.

  8. A hierarchical network modeling method for railway tunnels safety assessment

    Science.gov (United States)

    Zhou, Jin; Xu, Weixiang; Guo, Xin; Liu, Xumin

    2017-02-01

    Using network theory to model risk-related knowledge on accidents is regarded as potential very helpful in risk management. A large amount of defects detection data for railway tunnels is collected in autumn every year in China. It is extremely important to discover the regularities knowledge in database. In this paper, based on network theories and by using data mining techniques, a new method is proposed for mining risk-related regularities to support risk management in railway tunnel projects. A hierarchical network (HN) model which takes into account the tunnel structures, tunnel defects, potential failures and accidents is established. An improved Apriori algorithm is designed to rapidly and effectively mine correlations between tunnel structures and tunnel defects. Then an algorithm is presented in order to mine the risk-related regularities table (RRT) from the frequent patterns. At last, a safety assessment method is proposed by consideration of actual defects and possible risks of defects gained from the RRT. This method cannot only generate the quantitative risk results but also reveal the key defects and critical risks of defects. This paper is further development on accident causation network modeling methods which can provide guidance for specific maintenance measure.

  9. Hierarchical Interference Mitigation for Massive MIMO Cellular Networks

    Science.gov (United States)

    Liu, An; Lau, Vincent

    2014-09-01

    We propose a hierarchical interference mitigation scheme for massive MIMO cellular networks. The MIMO precoder at each base station (BS) is partitioned into an inner precoder and an outer precoder. The inner precoder controls the intra-cell interference and is adaptive to local channel state information (CSI) at each BS (CSIT). The outer precoder controls the inter-cell interference and is adaptive to channel statistics. Such hierarchical precoding structure reduces the number of pilot symbols required for CSI estimation in massive MIMO downlink and is robust to the backhaul latency. We study joint optimization of the outer precoders, the user selection, and the power allocation to maximize a general concave utility which has no closed-form expression. We first apply random matrix theory to obtain an approximated problem with closed-form objective. We show that the solution of the approximated problem is asymptotically optimal with respect to the original problem as the number of antennas per BS grows large. Then using the hidden convexity of the problem, we propose an iterative algorithm to find the optimal solution for the approximated problem. We also obtain a low complexity algorithm with provable convergence. Simulations show that the proposed design has significant gain over various state-of-the-art baselines.

  10. Distributed Plume Source Localization Using Hierarchical Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    KUANG Xing-hong; LIU Yu-qing; WU Yan-xiang; SHAO Hui-he

    2009-01-01

    A hierarchical wireless sensor networks (WSN) was proposed to estimate the plume source location. Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident. The entire surveillant field is divided into several small sub-regions. In each sub-region, the localization algorithm based on the improved particle filter (IPF) was performed to estimate the location. Some improved methods such as weighted centroid, residual resampling were introduced to the IPF algorithm to increase the localization performance. This distributed estimation method elirninates many drawbacks inherent with the traditional centralized optimization method. Simulation results show that localization algorithm is efficient far estimating the plume source location.

  11. Hierarchical self-organization of cytoskeletal active networks

    CERN Document Server

    Gordon, Daniel; Keasar, Chen; Farago, Oded

    2012-01-01

    The structural reorganization of the actin cytoskeleton is facilitated through the action of motor proteins that crosslink the actin filaments and transport them relative to each other. Here, we present a combined experimental-computational study that probes the dynamic evolution of mixtures of actin filaments and clusters of myosin motors. While on small spatial and temporal scales the system behaves in a very noisy manner, on larger scales it evolves into several well distinct patterns such as bundles, asters, and networks. These patterns are characterized by junctions with high connectivity, whose formation is possible due to the organization of the motors in "oligoclusters" (intermediate-size aggregates). The simulations reveal that the self-organization process proceeds through a series of hierarchical steps, starting from local microscopic moves and ranging up to the macroscopic large scales where the steady-state structures are formed. Our results shed light into the mechanisms involved in processes li...

  12. Learning Probabilistic Hierarchical Task Networks to Capture User Preferences

    CERN Document Server

    Li, Nan; Kambhampati, Subbarao; Yoon, Sungwook

    2010-01-01

    We propose automatically learning probabilistic Hierarchical Task Networks (pHTNs) in order to capture a user's preferences on plans, by observing only the user's behavior. HTNs are a common choice of representation for a variety of purposes in planning, including work on learning in planning. Our contributions are (a) learning structure and (b) representing preferences. In contrast, prior work employing HTNs considers learning method preconditions (instead of structure) and representing domain physics or search control knowledge (rather than preferences). Initially we will assume that the observed distribution of plans is an accurate representation of user preference, and then generalize to the situation where feasibility constraints frequently prevent the execution of preferred plans. In order to learn a distribution on plans we adapt an Expectation-Maximization (EM) technique from the discipline of (probabilistic) grammar induction, taking the perspective of task reductions as productions in a context-free...

  13. Locus heterogeneity disease genes encode proteins with high interconnectivity in the human protein interaction network.

    Science.gov (United States)

    Keith, Benjamin P; Robertson, David L; Hentges, Kathryn E

    2014-01-01

    Mutations in genes potentially lead to a number of genetic diseases with differing severity. These disease genes have been the focus of research in recent years showing that the disease gene population as a whole is not homogeneous, and can be categorized according to their interactions. Locus heterogeneity describes a single disorder caused by mutations in different genes each acting individually to cause the same disease. Using datasets of experimentally derived human disease genes and protein interactions, we created a protein interaction network to investigate the relationships between the products of genes associated with a disease displaying locus heterogeneity, and use network parameters to suggest properties that distinguish these disease genes from the overall disease gene population. Through the manual curation of known causative genes of 100 diseases displaying locus heterogeneity and 397 single-gene Mendelian disorders, we use network parameters to show that our locus heterogeneity network displays distinct properties from the global disease network and a Mendelian network. Using the global human proteome, through random simulation of the network we show that heterogeneous genes display significant interconnectivity. Further topological analysis of this network revealed clustering of locus heterogeneity genes that cause identical disorders, indicating that these disease genes are involved in similar biological processes. We then use this information to suggest additional genes that may contribute to diseases with locus heterogeneity.

  14. An approach to architecture 3D scaffold with interconnective microchannel networks inducing angiogenesis for tissue engineering.

    Science.gov (United States)

    Sun, Jiaoxia; Wang, Yuanliang; Qian, Zhiyong; Hu, Chenbo

    2011-11-01

    The angiogenesis of 3D scaffold is one of the major current limitations in clinical practice tissue engineering. The new strategy of construction 3D scaffold with microchannel circulation network may improve angiogenesis. In this study, 3D poly(D: ,L: -lactic acid) scaffolds with controllable microchannel structures were fabricated using sacrificial sugar structures. Melt drawing sugar-fiber network produced by a modified filament spiral winding method was used to form the microchannel with adjustable diameters and porosity. This fabrication process was rapid, inexpensive, and highly scalable. The porosity, microchannel diameter, interconnectivity and surface topographies of the scaffold were characterized by scanning electron microscopy. Mechanical properties were evaluated by compression tests. The mean porosity values of the scaffolds were in the 65-78% and the scaffold exhibited microchannel structure with diameter in the 100-200 μm range. The results showed that the scaffolds exhibited an adequate porosity, interconnective microchannel network, and mechanical properties. The cell culture studies with endothelial cells (ECs) demonstrated that the scaffold allowed cells to proliferate and penetrate into the volume of the entire scaffold. Overall, these findings suggest that the fabrication process offers significant advantages and flexibility in generating a variety of non-cytotoxic tissue engineering scaffolds with controllable distributions of porosity and physical properties that could provide the necessary physical cues for ECs and further improve angiogenesis for tissue engineering.

  15. CATO: a CAD tool for intelligent design of optical networks and interconnects

    Science.gov (United States)

    Chlamtac, Imrich; Ciesielski, Maciej; Fumagalli, Andrea F.; Ruszczyk, Chester; Wedzinga, Gosse

    1997-10-01

    Increasing communication speed requirements have created a great interest in very high speed optical and all-optical networks and interconnects. The design of these optical systems is a highly complex task, requiring the simultaneous optimization of various parts of the system, ranging from optical components' characteristics to access protocol techniques. Currently there are no computer aided design (CAD) tools on the market to support the interrelated design of all parts of optical communication systems, thus the designer has to rely on costly and time consuming testbed evaluations. The objective of the CATO (CAD tool for optical networks and interconnects) project is to develop a prototype of an intelligent CAD tool for the specification, design, simulation and optimization of optical communication networks. CATO allows the user to build an abstract, possible incomplete, model of the system, and determine its expected performance. Based on design constraints provided by the user, CATO will automatically complete an optimum design, using mathematical programming techniques, intelligent search methods and artificial intelligence (AI). Initial design and testing of a CATO prototype (CATO-1) has been completed recently. The objective was to prove the feasibility of combining AI techniques, simulation techniques, an optical device library and a graphical user interface into a flexible CAD tool for obtaining optimal communication network designs in terms of system cost and performance. CATO-1 is an experimental tool for designing packet-switching wavelength division multiplexing all-optical communication systems using a LAN/MAN ring topology as the underlying network. The two specific AI algorithms incorporated are simulated annealing and a genetic algorithm. CATO-1 finds the optimal number of transceivers for each network node, using an objective function that includes the cost of the devices and the overall system performance.

  16. Registration Cost Performance Analysis of a Hierarchical Mobile Internet Protocol Network

    Institute of Scientific and Technical Information of China (English)

    XU Kai; JI Hong; YUE Guang-xin

    2004-01-01

    On the basis of introducing principles for hierarchical mobile Internet protocol networks, the registration cost performance in this network model is analyzed in detail. Furthermore, the functional relationship is also established in the paper among registration cost, hierarchical level number and the maximum handover time for gateway foreign agent regional registration. At last, the registration cost of the hierarchical mobile Internet protocol network is compared with that of the traditional mobile Internet protocol. Theoretic analysis and computer simulation results show that the hierarchical level number and the maximum handover times can both affect the registration cost importantly, when suitable values of which are chosen, the hierarchical network can significantly improve the registration performance compared with the traditional mobile IP.

  17. Hierarchical Real-time Network Traffic Classification Based on ECOC

    Directory of Open Access Journals (Sweden)

    Yaou Zhao

    2013-09-01

    Full Text Available Classification of network traffic is basic and essential for manynetwork researches and managements. With the rapid development ofpeer-to-peer (P2P application using dynamic port disguisingtechniques and encryption to avoid detection, port-based and simplepayload-based network traffic classification methods were diminished.An alternative method based on statistics and machine learning hadattracted researchers' attention in recent years. However, most ofthe proposed algorithms were off-line and usually used a single classifier.In this paper a new hierarchical real-time model was proposed which comprised of a three tuple (source ip, destination ip and destination portlook up table(TT-LUT part and layered milestone part. TT-LUT was used to quickly classify short flows whichneed not to pass the layered milestone part, and milestones in layered milestone partcould classify the other flows in real-time with the real-time feature selection and statistics.Every milestone was a ECOC(Error-Correcting Output Codes based model which was usedto improve classification performance. Experiments showed that the proposedmodel can improve the efficiency of real-time to 80%, and themulti-class classification accuracy encouragingly to 91.4% on the datasets which had been captured from the backbone router in our campus through a week.

  18. Category theoretic analysis of hierarchical protein materials and social networks

    CERN Document Server

    Spivak, David I; Buehler, Markus J

    2011-01-01

    Materials in biology span all the scales from Angstroms to meters and typically consist of complex hierarchical assemblies of simple building blocks. Here we review an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs. An olog is like a "concept web" or "semantic network" except that it follows a rigorous mathematical formulation based on category theory. This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other ologs. We consider a simple example of an alpha-helical and an amyloid-like protein filament subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties. We also construct a representation of a social network in which people send text-messages to their nearest neighbors and act as a team to perform a task. We show that the olog for the protein and the olog f...

  19. A General Approach to L(h, k)-Label Interconnection Networks

    Institute of Scientific and Technical Information of China (English)

    Tiziana Calamoneri; Saverio Caminiti; Rossella Petreschi

    2008-01-01

    Given two non-negative integers h and k, an L(h, k)-labelin9 of a graph G = (V, E) is a function from the set V to a set of colors, such that adjacent nodes take colors at distance at least h, and nodes at distance 2 take colors at distanceat least k. The aim of the L(h, k)-labeling problem is to minimize the greatest used color. Since the decisional version of this problem is NP-complete, it is important to investigate particular classes of graphs for which the problem can be efficiently solved. It is well known that the most common interconnection topologies, such as Butterfly-like, Benes, CCC, Trivalent Cayley networks, are all characterized by a similar structure: they have nodes organized as a matrix and connections are divided into layers. So we naturally introduce a new class of graphs, called (l×n)-multistage graphs, containing the most common interconnection topologies, on which we study the L(h, k)-labeling. A general algorithm for L(h, k)-labeling these graphs is presented, and from this method an efficient L(2, 1)-labeling for Butterfly and CCC networks is derived. Finally we describe a possible generalization of our approach.

  20. A Visually Attractive "Interconnected Network of Ideas" for Organizing the Teaching and Learning of Descriptive Inorganic Chemistry

    Science.gov (United States)

    Rodgers, Glen E.

    2014-01-01

    A visually attractive interconnected network of ideas that helps general and second-year inorganic chemistry students make sense of the descriptive inorganic chemistry of the main-group elements is presented. The eight network components include the periodic law, the uniqueness principle, the diagonal effect, the inert-pair effect, the…

  1. A Visually Attractive "Interconnected Network of Ideas" for Organizing the Teaching and Learning of Descriptive Inorganic Chemistry

    Science.gov (United States)

    Rodgers, Glen E.

    2014-01-01

    A visually attractive interconnected network of ideas that helps general and second-year inorganic chemistry students make sense of the descriptive inorganic chemistry of the main-group elements is presented. The eight network components include the periodic law, the uniqueness principle, the diagonal effect, the inert-pair effect, the…

  2. Sensor Networks Hierarchical Optimization Model for Security Monitoring in High-Speed Railway Transport Hub

    Directory of Open Access Journals (Sweden)

    Zhengyu Xie

    2015-01-01

    Full Text Available We consider the sensor networks hierarchical optimization problem in high-speed railway transport hub (HRTH. The sensor networks are optimized from three hierarchies which are key area sensors optimization, passenger line sensors optimization, and whole area sensors optimization. Case study on a specific HRTH in China showed that the hierarchical optimization method is effective to optimize the sensor networks for security monitoring in HRTH.

  3. Spectral characterization of hierarchical network modularity and limits of modularity detection.

    Directory of Open Access Journals (Sweden)

    Somwrita Sarkar

    Full Text Available Many real world networks are reported to have hierarchically modular organization. However, there exists no algorithm-independent metric to characterize hierarchical modularity in a complex system. The main results of the paper are a set of methods to address this problem. First, classical results from random matrix theory are used to derive the spectrum of a typical stochastic block model hierarchical modular network form. Second, it is shown that hierarchical modularity can be fingerprinted using the spectrum of its largest eigenvalues and gaps between clusters of closely spaced eigenvalues that are well separated from the bulk distribution of eigenvalues around the origin. Third, some well-known results on fingerprinting non-hierarchical modularity in networks automatically follow as special cases, threreby unifying these previously fragmented results. Finally, using these spectral results, it is found that the limits of detection of modularity can be empirically established by studying the mean values of the largest eigenvalues and the limits of the bulk distribution of eigenvalues for an ensemble of networks. It is shown that even when modularity and hierarchical modularity are present in a weak form in the network, they are impossible to detect, because some of the leading eigenvalues fall within the bulk distribution. This provides a threshold for the detection of modularity. Eigenvalue distributions of some technological, social, and biological networks are studied, and the implications of detecting hierarchical modularity in real world networks are discussed.

  4. Decentralized direct adaptive neural network control for a class of interconnected systems

    Institute of Scientific and Technical Information of China (English)

    Zhang Tianping; Mei Jiandong

    2006-01-01

    The problem of direct adaptive neural network control for a class of large-scale systems with unknown function control gains and the high-order interconnections is studied in this paper. Based on the principle of sliding mode control and the approximation capability of multilayer neural networks, a design scheme of decentralized direct adaptive sliding mode controller is proposed. The plant dynamic uncertainty and modeling errors are adaptively compensated by adjusted the weights and sliding mode gains on-line for each subsystem using only local information. According to the Lyapunov method, the closed-loop adaptive control system is proven to be globally stable, with tracking errors converging to a neighborhood of zero. Simulation results demonstrate the effectiveness of the proposed approach.

  5. Vibration control in plates by uniformly distributed PZT actuators interconnected via electric networks

    CERN Document Server

    Vidoli, Stefano

    2010-01-01

    In this paper a novel device aimed at controlling the mechanical vibrations of plates by means of a set of electrically-interconnected piezoelectric actuators is described. The actuators are embedded uniformly in the plate wherein they connect every node of an electric network to ground, thus playing the two-fold role of capacitive element in the electric network and of couple suppliers. A mathematical model is introduced to describe the propagation of electro-mechanical waves in the device; its validity is restricted to the case of wave-forms with wave-length greater than the dimension of the piezoelectric actuators used. A self-resonance criterion is established which assures the possibility of electro-mechanical energy exchange. Finally the problem of vibration control in simply supported and clamped plates is addressed; the optimal net-impedance is determined. The results indicate that the proposed device can improve the performances of piezoelectric actuation

  6. Performance analysis of dynamic load balancing algorithm for multiprocessor interconnection network

    Directory of Open Access Journals (Sweden)

    M.U. Bokhari

    2016-09-01

    Full Text Available Multiprocessor interconnection network have become powerful parallel computing system for real-time applications. Nowadays the many researchers posses studies on the dynamic load balancing in multiprocessor system. Load balancing is the method of dividing the total load among the processors of the distributed system to progress task's response time as well as resource utilization whereas ignoring a condition where few processors are overloaded or underloaded or moderately loaded. However, in dynamic load balancing algorithm presumes no priori information about behaviour of tasks or the global state of the system. There are numerous issues while designing an efficient dynamic load balancing algorithm that involves utilization of system, amount of information transferred among processors, selection of tasks for migration, load evaluation, comparison of load levels and many more. This paper enlightens the performance analysis on dynamic load balancing strategy (DLBS algorithm, used for hypercube network in multiprocessor system.

  7. Performance Study of Multilayered Multistage Interconnection Networks under Hotspot Traffic Conditions

    Directory of Open Access Journals (Sweden)

    Dimitris Vasiliadis

    2010-01-01

    Full Text Available The performance of Multistage Interconnection Networks (MINs under hotspot traffic, where some percentage of the traffic is targeted at single nodes, which are also called hot spots, is of crucial interest. The prioritizing of packets has already been proposed at previous works as alleviation to the tree saturation problem, leading to a scheme that natively supports 2-class priority traffic. In order to prevent hotspot traffic from degrading uniform traffic we expand previous studies by introducing multilayer Switching Elements (SEs at last stages in an attempt to balance between MIN performance and cost. In this paper the performance evaluation of dual-priority, double-buffered, multilayer MINs under single hotspot setups is presented and analyzed using simulation experiments. The findings of this paper can be used by MIN designers to optimally configure their networks.

  8. Hierarchical Structure, Disassortativity and Information Measures of the US Flight Network

    Institute of Scientific and Technical Information of China (English)

    WANG Ru; CAI Xu

    2005-01-01

    @@ We investigate the mixing structure of directed and evolutionary US flight network. It is shown that such a network is a hierarchical network, with average assortativity coefficient -0.37. Application of the informationbased method that can give the same result provides a way to explore the structure of complex networks.

  9. Resolution of Singularities Introduced by Hierarchical Structure in Deep Neural Networks.

    Science.gov (United States)

    Nitta, Tohru

    2016-06-30

    We present a theoretical analysis of singular points of artificial deep neural networks, resulting in providing deep neural network models having no critical points introduced by a hierarchical structure. It is considered that such deep neural network models have good nature for gradient-based optimization. First, we show that there exist a large number of critical points introduced by a hierarchical structure in deep neural networks as straight lines, depending on the number of hidden layers and the number of hidden neurons. Second, we derive a sufficient condition for deep neural networks having no critical points introduced by a hierarchical structure, which can be applied to general deep neural networks. It is also shown that the existence of critical points introduced by a hierarchical structure is determined by the rank and the regularity of weight matrices for a specific class of deep neural networks. Finally, two kinds of implementation methods of the sufficient conditions to have no critical points are provided. One is a learning algorithm that can avoid critical points introduced by the hierarchical structure during learning (called avoidant learning algorithm). The other is a neural network that does not have some critical points introduced by the hierarchical structure as an inherent property (called avoidant neural network).

  10. Bacterial-cellulose-derived interconnected meso-microporous carbon nanofiber networks as binder-free electrodes for high-performance supercapacitors

    Science.gov (United States)

    Hao, Xiaodong; Wang, Jie; Ding, Bing; Wang, Ya; Chang, Zhi; Dou, Hui; Zhang, Xiaogang

    2017-06-01

    Bacterial cellulose (BC), a typical biomass prepared from the microbial fermentation process, has been proved that it can be an ideal platform for design of three-dimensional (3D) multifunctional nanomaterials in energy storage and conversion field. Here we developed a simple and general silica-assisted strategy for fabrication of interconnected 3D meso-microporous carbon nanofiber networks by confine nanospace pyrolysis of sustainable BC, which can be used as binder-free electrodes for high-performance supercapacitors. The synthesized carbon nanofibers exhibited the features of interconnected 3D networks architecture, large surface area (624 m2 g-1), mesopores-dominated hierarchical porosity, and high graphitization degree. The as-prepared electrode (CN-BC) displayed a maximum specific capacitance of 302 F g-1 at a current density of 0.5 A g-1, high-rate capability and good cyclicity in 6 M KOH electrolyte. This work, together with cost-effective preparation strategy to make high-value utilization of cheap biomass, should have significant implications in the green and mass-producible energy storage.

  11. Study on the energy-efficient scheme based on the interconnection of optical-network-units for next generation optical access network

    Science.gov (United States)

    Lv, Yunxin; Jiang, Ning; Qiu, Kun; Xue, Chenpeng

    2014-12-01

    An energy-efficient scheme based on the interconnection of optical network unit (ONU) is introduced, which can significantly reduce the energy consumption of the low-traffic operation. The energy consumption model for the ONU-interconnected optical access network (OAN) based on the electronic switch (ES) technology is established, and the energy efficiency of the proposed scheme is analyzed and compared with that of the OAN using optical switch (OS). The simulation results demonstrate that the ONU-interconnected scheme can efficiently reduce the energy consumption of OAN, and it shows a good energy consumption performance under daily traffic model.

  12. A Tool for Fast Development of Modular and Hierarchic Neural Network-based Systems

    Directory of Open Access Journals (Sweden)

    Francisco Reinaldo

    2006-08-01

    Full Text Available This paper presents PyramidNet tool as a fast and easy way to develop Modular and Hierarchic Neural Network-based Systems. This tool facilitates the fast emergence of autonomous behaviors in agents because it uses a hierarchic and modular control methodology of heterogeneous learning modules: the pyramid. Using the graphical resources of PyramidNet the user is able to specify a behavior system even having little understanding of artificial neural networks. Experimental tests have shown that a very significant speedup is attained in the development of modular and hierarchic neural network-based systems by using this tool.

  13. Design of wide-area time-delay supplementary controller for interconnected Network based on Hamilton function method

    Science.gov (United States)

    Hailati, G.; Hu, Z. H.

    2016-08-01

    The transient stability of interconnected network with supplementary time-delay controller for generator excitations and static var compensator (SVC) has been investigated in this paper. Firstly, a delay-dependent stability criterion based on Hamilton function method is derived, and the criterion is in term of matrix inequalities. Secondly, a nonlinear time-delay Hamilton function model of interconnected network with SVCs is constructed. Thirdly, the wide-area time-delay supplementary controller (WATSC) for the interconnected network is designed and converted into the form of Hamiltonian system. The delay-dependent stability of the closed-loop power system is analysed. The gains of the WATSC are determined by using the theoretical analysis results. It is effective for the designed WATSC installed in the 16- machine, 68-bus power system for damping the inter-area modes. Then simulation results show that the method of the controller is effective.

  14. SO2 Emissions in China - Their Network and Hierarchical Structures

    Science.gov (United States)

    Yan, Shaomin; Wu, Guang

    2017-04-01

    SO2 emissions lead to various harmful effects on environment and human health. The SO2 emission in China has significant contribution to the global SO2 emission, so it is necessary to employ various methods to study SO2 emissions in China with great details in order to lay the foundation for policymaking to improve environmental conditions in China. Network analysis is used to analyze the SO2 emissions from power generation, industrial, residential and transportation sectors in China for 2008 and 2010, which are recently available from 1744 ground surface monitoring stations. The results show that the SO2 emissions from power generation sector were highly individualized as small-sized clusters, the SO2 emissions from industrial sector underwent an integration process with a large cluster contained 1674 places covering all industrial areas in China, the SO2 emissions from residential sector was not impacted by time, and the SO2 emissions from transportation sector underwent significant integration. Hierarchical structure is obtained by further combining SO2 emissions from all four sectors and is potentially useful to find out similar patterns of SO2 emissions, which can provide information on understanding the mechanisms of SO2 pollution and on designing different environmental measure to combat SO2 emissions.

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

  16. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems

    CERN Document Server

    Rosvall, M

    2010-01-01

    To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation that reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between compression and pattern detection; by compressing a description of a random walker as a proxy for real flow on a network, we find regularities in the network that induce this system-wide flow. Finding the shortest multilevel description of the random walker therefore gives us the best hierarchical clustering of the network, the optimal number of levels and modular partition at each level, with respect to the dynamics on the network. With a novel search algorithm, we extract and illustrate the rich multilevel organization of several large social and biological networks. For example, from the global air traffic network we uncover countries and continents, and from the pattern of scientific communication we reveal more than 100 scientific fields organized in four major disciplines:...

  17. Interconnected TiO2 Nanowire Networks for PbS Quantum Dot Solar Cell Applications

    Directory of Open Access Journals (Sweden)

    Fan Xu

    2012-01-01

    Full Text Available We present a simple method for the fabrication of an interconnected porous TiO2 nanostructured film via dip coating in a colloidal suspension of ultrathin TiO2 nanowires followed by high-temperature annealing. The spheroidization of the nanowires and the fusing of the loosely packed nanowire films at the contact points lead to the formation of nanopores. Using this interconnected TiO2 nanowire network for electron transport, a PbS/TiO2 heterojunction solar cell with a large short-circuit current of 2.5 mA/cm2, a Voc of 0.6 V, and a power conversion efficiency of 5.4% is achieved under 8.5 mW/cm2 white light illumination. Compared to conventional planar TiO2 film structures, these results suggest superior electron transport properties while still providing the large interfacial area between PbS quantum dots and TiO2 required for efficient exciton dissociation.

  18. A proxy design to leverage the interconnection of CoAP wireless sensor networks with web applications

    OpenAIRE

    Alessandro Ludovici; Anna Calveras

    2015-01-01

    In this paper, we present the design of a Constrained Application Protocol (CoAP) proxy able to interconnect Web applications based on Hypertext Transfer Protocol (HTTP) and WebSocket with CoAP based Wireless Sensor Networks. Sensor networks are commonly used to monitor and control physical objects or environments. Smart Cities represent applications of such a nature. Wireless Sensor Networks gather data from their surroundings and send them to a remote application. This data flow may be shor...

  19. Estimating Urban Traffic Patterns through Probabilistic Interconnectivity of Road Network Junctions.

    Directory of Open Access Journals (Sweden)

    Ed Manley

    Full Text Available The emergence of large, fine-grained mobility datasets offers significant opportunities for the development and application of new methodologies for transportation analysis. In this paper, the link between routing behaviour and traffic patterns in urban areas is examined, introducing a method to derive estimates of traffic patterns from a large collection of fine-grained routing data. Using this dataset, the interconnectivity between road network junctions is extracted in the form of a Markov chain. This representation encodes the probability of the successive usage of adjacent road junctions, encoding routes as flows between decision points rather than flows along road segments. This network of functional interactions is then integrated within a modified Markov chain Monte Carlo (MCMC framework, adapted for the estimation of urban traffic patterns. As part of this approach, the data-derived links between major junctions influence the movement of directed random walks executed across the network to model origin-destination journeys. The simulation process yields estimates of traffic distribution across the road network. The paper presents an implementation of the modified MCMC approach for London, United Kingdom, building an MCMC model based on a dataset of nearly 700000 minicab routes. Validation of the approach clarifies how each element of the MCMC framework contributes to junction prediction performance, and finds promising results in relation to the estimation of junction choice and minicab traffic distribution. The paper concludes by summarising the potential for the development and extension of this approach to the wider urban modelling domain.

  20. Interconnection and power transportation networks: operation; Reseaux d'interconnexion et de transport: fonctionnement

    Energy Technology Data Exchange (ETDEWEB)

    Bornard, P. [Reseau de Transport d' Electricite (RTE), Div. Systeme Electrique, 92 - Paris la Defense (France); Pavard, M. [Electricite de France (EDF), 75 - Paris (France); Testud, G. [Reseau de Transport d' Electricite (RTE), Dept. Exploitation du Systeme Electrique, 92 - Paris la Defense (France)

    2005-10-01

    For economical or technical reasons, the power generation units are in general grouped together in the same geographical areas, while the consumption points are much more dispersed. The power transportation and interconnection networks ensure the link between the big generation areas and the big consumption areas, and also with other foreign networks. The network manager must keep the balance between the available offer and the potential demand and ensures the transit of energy between the production units and the end-users with respecting the contractual voltage and frequency ranges. Incidents must be mastered to limit the inconvenience to users and to avoid the complete collapse of the power transportation system. This article describes the operation of such systems: 1 - problems linked with networks operation; 2 - transits distribution: general problem, transmissible power in a power line, voltage drop, calculations of power distributions; 3 - voltage and frequency adjustments; 4 - operation in disturbed regime: mastery of common incidents, mechanisms of major incidents (operation of a power system in strongly disturbed regime), protection of the power system, recovery; 5 - conclusion. (J.S.)

  1. Performance Analysis of Dual-Priority Multilayer Multistage Interconnection Networks under Multicast Environment

    Directory of Open Access Journals (Sweden)

    Dimitris C. Vasiliadis

    2011-06-01

    Full Text Available Next-generation network architectures strive to achieve high bandwidth and ultralow latency for the packets traversing the offered end-to-end paths. Multistage Interconnection Networks (MINs are often employed for implementing NGNs, but while MINs are fairly flexible in handling varieties of traffic loads, they tend to quickly saturate under broadcast and multicast traffic, especially at increasing size networks. As a response to this issue, multilayer MINs have been proposed, however their performance prediction and evaluation has not been studied sufficiently insofar. In this paper, we evaluate and discuss the performance of multilayer MINs under multicast traffic, considering also two levels of packet priorities, since support for multiple QoS levels is an indispensible requirement for NGNs. Different offered loads and buffer size configurations are examined in this context, and performance results are given for the two most important network performance factors, namely packet throughput and delay. We also introduce and calculate a universal performance fac­tor, which includes the importance aspect of each of the above main performance factors. The findings of this study can be used by NGN system designers in order to predict the performance of each configuration and adjust the design of their communication infrastructure to the traffic requirements at hand.

  2. Multiple dynamical time-scales in networks with hierarchically nested modular organization

    Indian Academy of Sciences (India)

    Sitabhra Sinha; Swarup Poria

    2011-11-01

    Many natural and engineered complex networks have intricate mesoscopic organization, e.g., the clustering of the constituent nodes into several communities or modules. Often, such modularity is manifested at several different hierarchical levels, where the clusters defined at one level appear as elementary entities at the next higher level. Using a simple model of a hierarchical modular network, we show that such a topological structure gives rise to characteristic time-scale separation between dynamics occurring at different levels of the hierarchy. This generalizes our earlier result for simple modular networks, where fast intramodular and slow intermodular processes were clearly distinguished. Investigating the process of synchronization of oscillators in a hierarchical modular network, we show the existence of as many distinct time-scales as there are hierarchical levels in the system. This suggests a possible functional role of such mesoscopic organization principle in natural systems, viz., in the dynamical separation of events occurring at different spatial scales.

  3. Loss Performance Modeling for Hierarchical Heterogeneous Wireless Networks With Speed-Sensitive Call Admission Control

    DEFF Research Database (Denmark)

    Huang, Qian; Huang, Yue-Cai; Ko, King-Tim;

    2011-01-01

    dimensioning and planning. This paper investigates the computationally efficient loss performance modeling for multiservice in hierarchical heterogeneous wireless networks. A speed-sensitive call admission control (CAC) scheme is considered in our model to assign overflowed calls to appropriate tiers...

  4. Advancing interconnect density for spiking neural network hardware implementations using traffic-aware adaptive network-on-chip routers.

    Science.gov (United States)

    Carrillo, Snaider; Harkin, Jim; McDaid, Liam; Pande, Sandeep; Cawley, Seamus; McGinley, Brian; Morgan, Fearghal

    2012-09-01

    The brain is highly efficient in how it processes information and tolerates faults. Arguably, the basic processing units are neurons and synapses that are interconnected in a complex pattern. Computer scientists and engineers aim to harness this efficiency and build artificial neural systems that can emulate the key information processing principles of the brain. However, existing approaches cannot provide the dense interconnect for the billions of neurons and synapses that are required. Recently a reconfigurable and biologically inspired paradigm based on network-on-chip (NoC) and spiking neural networks (SNNs) has been proposed as a new method of realising an efficient, robust computing platform. However, the use of the NoC as an interconnection fabric for large-scale SNNs demands a good trade-off between scalability, throughput, neuron/synapse ratio and power consumption. This paper presents a novel traffic-aware, adaptive NoC router, which forms part of a proposed embedded mixed-signal SNN architecture called EMBRACE (EMulating Biologically-inspiRed ArChitectures in hardwarE). The proposed adaptive NoC router provides the inter-neuron connectivity for EMBRACE, maintaining router communication and avoiding dropped router packets by adapting to router traffic congestion. Results are presented on throughput, power and area performance analysis of the adaptive router using a 90 nm CMOS technology which outperforms existing NoCs in this domain. The adaptive behaviour of the router is also verified on a Stratix II FPGA implementation of a 4 × 2 router array with real-time traffic congestion. The presented results demonstrate the feasibility of using the proposed adaptive NoC router within the EMBRACE architecture to realise large-scale SNNs on embedded hardware.

  5. Self-Calibrated Energy-Efficient and Reliable Channels for On-Chip Interconnection Networks

    Directory of Open Access Journals (Sweden)

    Po-Tsang Huang

    2012-01-01

    Full Text Available Energy-efficient and reliable channels are provided for on-chip interconnection networks (OCINs using a self-calibrated voltage scaling technique with self-corrected green (SCG coding scheme. This self-calibrated low-power coding and voltage scaling technique increases reliability and reduces energy consumption simultaneously. The SCG coding is a joint bus and error correction coding scheme that provides a reliable mechanism for channels. In addition, it achieves a significant reduction in energy consumption via a joint triplication bus power model for crosstalk avoidance. Based on SCG coding scheme, the proposed self-calibrated voltage scaling technique adjusts voltage swing for energy reduction. Furthermore, this technique tolerates timing variations. Based on UMC 65 nm CMOS technology, the proposed channels reduces energy consumption by nearly 28.3% compared with that for uncoded channels at the lowest voltage. This approach makes the channels of OCINs tolerant of transient malfunctions and realizes energy efficiency.

  6. A Distributed Network Mobility Management Scheme for Hierarchical Mobile IPv6 Networks

    Science.gov (United States)

    Kawano, Keita; Kinoshita, Kazuhiko; Yamai, Nariyoshi

    Route optimization for network mobility is a key technique for providing a node in a mobile network (Mobile Network Node or MNN) with high quality broadband communications. Many schemes adding route optimization function to Network Mobility (NEMO) Basic Support protocol, the standardized network mobility management protocol from the IETF nemo working group, have already been proposed in recent years. One such scheme, a scheme using Hierarchical Mobile IPv6 (HMIPv6) aims to overcome micromobility management issues as well by applying a mechanism based on HMIPv6. The traditional scheme, however, suffers from a significant number of signaling messages as the number of MNNs and/or the number of their Correspondent Nodes (CNs) increase, because many messages notifying the MNNs' Home Agents (HAMNNs) and the CNs of the mobile network's movement are generated simultaneously each time the mobile network moves to the domain of another micromobility management router (Mobility Anchor Point or MAP). This paper proposes a scheme to overcome this problem. Our scheme reduces the number of signaling messages generated at the same time by managing the mobility of MNNs using multiple MAPs distributed within a network for load sharing. The results of simulation experiments show that our scheme works efficiently compared to the traditional scheme when a mobile network has many MNNs and/or these MNNs communicate with many CNs.

  7. IPTV traffic management using topology-based hierarchical scheduling in Carrier Ethernet transport networks

    DEFF Research Database (Denmark)

    Yu, Hao; Yan, Ying; Berger, Michael Stubert

    2009-01-01

    of Service (QoS) provisioning abilities, which guarantee end-to-end performances of voice, video and data traffic delivered over networks. This paper introduces a topology-based hierarchical scheduler scheme, which controls the incoming traffic at the edge of the network based on the network topology...

  8. Interconnected Nanoflake Network Derived from a Natural Resource for High-Performance Lithium-Ion Batteries.

    Science.gov (United States)

    Cheng, Fei; Li, Wen-Cui; Lu, An-Hui

    2016-10-06

    Numerous natural resources have a highly interconnected network with developed porous structure, so enabling directional and fast matrix transport. Such structures are appealing for the design of efficient anode materials for lithium-ion batteries, although they can be challenging to prepare. Inspired by nature, a novel synthesis route from biomass is proposed by using readily available auricularia as retractable support and carbon coating precursor to soak up metal salt solution. Using the swelling properties of the auricularia with the complexation of metal ions, a nitrogen-containing MnO@C nanoflake network has been easily synthesized with fast electrochemical reaction dynamics and a superior lithium storage performance. A subsequent carbonization results in the in situ synthesis of MnO nanoparticles throughout the porous carbon flake network. When evaluated as an anode material for lithium-ion batteries, an excellent reversible capacity is achieved of 868 mA h g(-1) at 0.2 A g(-1) over 300 cycles and 668 mA h g(-1) at 1 A g(-1) over 500 cycles, indicating a high tolerance to the volume expansion. The approach investigated opens up new avenues for the design of high performance electrodes with highly cross-linked nanoflake structures, which may have great application prospects.

  9. Hierarchical Route Optimization By Using Memetic Algorithm In A Mobile Networks

    Directory of Open Access Journals (Sweden)

    K .K. Gautam

    2011-02-01

    Full Text Available The networks Mobility (NEMO Protocol is a way of managing the mobility of an entire network, and mobile internet protocol is the basic solution for networks Mobility. A hierarchical route optimization system for mobile network is proposed to solve management of hierarchical route optimization problems. In present paper we study hierarchical Route Optimization scheme using memetic algorithm(HROSMA The concept of optimization- finding the extreme of a function that maps candidate ‘solution’ to scalar values of ‘quality’ – is an extremely general and useful idea. For solving this problem, we use a few salient adaptations, and we also extend HROSMA perform routing between the mobile networks.

  10. Interconnection between biological abnormalities in borderline personality disorder: use of the Bayesian networks model.

    Science.gov (United States)

    De la Fuente, José Manuel; Bengoetxea, Endika; Navarro, Felipe; Bobes, Julio; Alarcón, Renato Daniel

    2011-04-30

    There is agreement in that strengthening the sets of neurobiological data would reinforce the diagnostic objectivity of many psychiatric entities. This article attempts to use this approach in borderline personality disorder (BPD). Assuming that most of the biological findings in BPD reflect common underlying pathophysiological processes we hypothesized that most of the data involved in the findings would be statistically interconnected and interdependent, indicating biological consistency for this diagnosis. Prospectively obtained data on scalp and sleep electroencephalography (EEG), clinical neurologic soft signs, the dexamethasone suppression and thyrotropin-releasing hormone stimulation tests of 20 consecutive BPD patients were used to generate a Bayesian network model, an artificial intelligence paradigm that visually illustrates eventual associations (or inter-dependencies) between otherwise seemingly unrelated variables. The Bayesian network model identified relationships among most of the variables. EEG and TSH were the variables that influence most of the others, especially sleep parameters. Neurological soft signs were linked with EEG, TSH, and sleep parameters. The results suggest the possibility of using objective neurobiological variables to strengthen the validity of future diagnostic criteria and nosological characterization of BPD.

  11. Identifying time-delayed gene regulatory networks via an evolvable hierarchical recurrent neural network.

    Science.gov (United States)

    Kordmahalleh, Mina Moradi; Sefidmazgi, Mohammad Gorji; Harrison, Scott H; Homaifar, Abdollah

    2017-01-01

    The modeling of genetic interactions within a cell is crucial for a basic understanding of physiology and for applied areas such as drug design. Interactions in gene regulatory networks (GRNs) include effects of transcription factors, repressors, small metabolites, and microRNA species. In addition, the effects of regulatory interactions are not always simultaneous, but can occur after a finite time delay, or as a combined outcome of simultaneous and time delayed interactions. Powerful biotechnologies have been rapidly and successfully measuring levels of genetic expression to illuminate different states of biological systems. This has led to an ensuing challenge to improve the identification of specific regulatory mechanisms through regulatory network reconstructions. Solutions to this challenge will ultimately help to spur forward efforts based on the usage of regulatory network reconstructions in systems biology applications. We have developed a hierarchical recurrent neural network (HRNN) that identifies time-delayed gene interactions using time-course data. A customized genetic algorithm (GA) was used to optimize hierarchical connectivity of regulatory genes and a target gene. The proposed design provides a non-fully connected network with the flexibility of using recurrent connections inside the network. These features and the non-linearity of the HRNN facilitate the process of identifying temporal patterns of a GRN. Our HRNN method was implemented with the Python language. It was first evaluated on simulated data representing linear and nonlinear time-delayed gene-gene interaction models across a range of network sizes and variances of noise. We then further demonstrated the capability of our method in reconstructing GRNs of the Saccharomyces cerevisiae synthetic network for in vivo benchmarking of reverse-engineering and modeling approaches (IRMA). We compared the performance of our method to TD-ARACNE, HCC-CLINDE, TSNI and ebdbNet across different network

  12. Neural-Network-Based Adaptive Decentralized Fault-Tolerant Control for a Class of Interconnected Nonlinear Systems.

    Science.gov (United States)

    Li, Xiao-Jian; Yang, Guang-Hong

    2016-10-26

    This paper is concerned with the adaptive decentralized fault-tolerant tracking control problem for a class of uncertain interconnected nonlinear systems with unknown strong interconnections. An algebraic graph theory result is introduced to address the considered interconnections. In addition, to achieve the desirable tracking performance, a neural-network-based robust adaptive decentralized fault-tolerant control (FTC) scheme is given to compensate the actuator faults and system uncertainties. Furthermore, via the Lyapunov analysis method, it is proven that all the signals of the resulting closed-loop system are semiglobally bounded, and the tracking errors of each subsystem exponentially converge to a compact set, whose radius is adjustable by choosing different controller design parameters. Finally, the effectiveness and advantages of the proposed FTC approach are illustrated with two simulated examples.

  13. Coevolution of Information Processing and Topology in Hierarchical Adaptive Random Boolean Networks

    CERN Document Server

    Gorski, Piotr J; Holyst, Janusz A

    2015-01-01

    Random Boolean networks (RBNs) are frequently employed for modelling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive RBN (HARBN) as a system consisting of distinct adaptive RBNs - subnetworks - connected by a set of permanent interlinks. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. We investigate mean node information, mean edge information as well as a mean node degree as functions of model parameters and demonstrate HARBN's ability to describe complex hierarchical systems.

  14. Sustained Activity in Hierarchical Modular Neural Networks: Self-Organized Criticality and Oscillations

    Science.gov (United States)

    Wang, Sheng-Jun; Hilgetag, Claus C.; Zhou, Changsong

    2010-01-01

    Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. In particular, they are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality (SOC). We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. Previously, it was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We found that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and SOC, which are not present in the respective random networks. The mechanism underlying the sustained activity is that each dense module cannot sustain activity on its own, but displays SOC in the presence of weak perturbations. Therefore, the hierarchical modular networks provide the coupling among subsystems with SOC. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivity of critical states and the predictability and timing of oscillations for efficient information

  15. Sustained activity in hierarchical modular neural networks: self-organized criticality and oscillations

    Directory of Open Access Journals (Sweden)

    Sheng-Jun Wang

    2011-06-01

    Full Text Available Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. They are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality. We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. It was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We find that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and self-organized criticality, which are not present in the respective random networks. The underlying mechanism is that each dense module cannot sustain activity on its own, but displays self-organized criticality in the presence of weak perturbations. The hierarchical modular networks provide the coupling among subsystems with self-organized criticality. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivityof critical state and predictability and timing of oscillations for efficient

  16. Sustained activity in hierarchical modular neural networks: self-organized criticality and oscillations.

    Science.gov (United States)

    Wang, Sheng-Jun; Hilgetag, Claus C; Zhou, Changsong

    2011-01-01

    Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. In particular, they are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality (SOC). We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. Previously, it was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We found that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and SOC, which are not present in the respective random networks. The mechanism underlying the sustained activity is that each dense module cannot sustain activity on its own, but displays SOC in the presence of weak perturbations. Therefore, the hierarchical modular networks provide the coupling among subsystems with SOC. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivity of critical states and the predictability and timing of oscillations for efficient information

  17. NEMS (Nanoelectromechanicsl Systems) Networks: A Novel Validation Platform for Controlling Interconnected Dynamical Networks

    Science.gov (United States)

    2015-08-01

    bump  bonding...N251.       NEMS  Networks:  Raison  d’être 12   “standard  NEMS  process”  at  the  200mm  (8”)   wafer -­‐scale...designed   precursor   wafers   fabricated   at   CEA/LETI.   The   CMOS   Net   ASIC   chips,   which   will  

  18. A Flexible LDPC code decoder with a Network on Chip as underlying interconnect architecture

    CERN Document Server

    Condo, Carlo

    2011-01-01

    LDPC (Low Density Parity Check) codes are among the most powerful and widely adopted modern error correcting codes. The iterative decoding algorithms required for these codes involve high computational complexity and high processing throughput is achieved by allocating a sufficient number of processing elements (PEs). Supporting multiple heterogeneous LDPC codes on a parallel decoder poses serious problems in the design of the interconnect structure for such PEs. The aim of this work is to explore the feasibility of NoC (Network on Chip) based decoders, where full flexibility in terms of supported LDPC codes is obtained resorting to an NoC to connect PEs. NoC based LDPC decoders have been previously considered unfeasible because of the cost overhead associated to packet management and routing. On the contrary, the designed NoC adopts a low complexity routing, which introduces a very limited cost overhead with respect to architectures dedicated to specific classes of codes. Moreover the paper proposes an effic...

  19. Design of T-shaped nanophotonic wire waveguide for optical interconnection in H-tree network.

    Science.gov (United States)

    Kurt, H; Giden, I H; Citrin, D S

    2011-12-19

    Nanophotonic wire waveguides play an important role for the realization of highly dense integrated photonic circuits. The miniaturization of optoelectronic devices and realization of ultra-small integrated circuits strongly demand compact waveguide branches. T-shaped versions of nanophotonic wires are the first stage of both power splitting and optical-interconnection systems based on guided-wave optics; however, the acute transitions at the waveguide junctions typically induce huge bending losses in terms of radiated modes. Both 2D and 3D finite-difference time-domain methods are employed to monitor the efficient light propagation. By introducing appropriate combinations of dielectric posts around the dielectric-waveguide junctions within the 4.096μm×4.096μm region, we are able to reduce the bending losses dramatically and increase the transmission efficiency from low values of 18% in the absence of the dielectric posts to approximately 49% and 43% in 2D and 3D cases, respectively. These findings may lead to the implementation of such T-junctions in near-future high-density integrated photonics to deliver optical-clock signals via H-tree network.

  20. Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chih-Yu Wen

    2009-05-01

    Full Text Available This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

  1. An Isolation Intrusion Detection System for Hierarchical Wireless Sensor Networks

    OpenAIRE

    Rung-Ching Chen; Chia-Fen Hsieh; Yung-Fa Huang

    2010-01-01

    A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to cooperatively monitor environmental conditions, such as battlefield data and personal health information, and some environment limited resources. To avoid malicious damage is important while information is transmitted in wireless network. Thus, Wireless Intrusion Detection Systems are crucial to safe operation in wireless sensor networks. Wireless networks are subject ...

  2. Exact and Approximate Inference in Associative Hierarchical Networks using Graph Cuts

    CERN Document Server

    Russell, Chris; Kohli, Pushmeet; Torr, Philip H S

    2012-01-01

    Markov Networks are widely used through out computer vision and machine learning. An important subclass are the Associative Markov Networks which are used in a wide variety of applications. For these networks a good approximate minimum cost solution can be found efficiently using graph cut based move making algorithms such as alpha- expansion. Recently a related model has been proposed, the associative hierarchical net- work, which provides a natural generalisation of the Associative Markov Network for higher order cliques (i.e. clique size greater than two). This method provides a good model for object class segmentation problem in com- puter vision. Within this paper we briefly describe the associative hierarchical network and provide a computationally efficient method for ap- proximate inference based on graph cuts. Our method performs well for networks con- taining hundreds of thousand of variables, and higher order potentials are defined over cliques containing tens of thousands of vari- ables. Due to th...

  3. The Griffiths Phase on Hierarchical Modular Networks with Small-world Edges

    CERN Document Server

    Li, Shanshan

    2016-01-01

    The Griffiths phase has been proposed to induce a stretched critical regime that facilitates self organizing of brain networks for optimal function. This phase stems from the intrinsic structural heterogeneity of brain networks, such as the hierarchical modular structure. In this work, we extend this concept to modified hierarchical networks with small-world connections based on Hanoi networks [1]. Through extensive simulations, we identify the essential role played by the exponential distribution of the inter-moduli connectivity probability across hierarchies on the emergence of the Griffiths phase in this network. Additionally, the spectral analysis on the adjacency matrix of the relevant networks [2] shows that a localized principle eigenvector is not necessarily the fingerprint of the Griffiths phase.

  4. NEW METHOD TO ESTIMATE SCALING OF POWER-LAW DEGREE DISTRIBUTION AND HIERARCHICAL NETWORKS

    Institute of Scientific and Technical Information of China (English)

    YANG Bo; DUAN Wen-qi; CHEN Zhong

    2006-01-01

    A new method and corresponding numerical procedure are introduced to estimate scaling exponents of power-law degree distribution and hierarchical clustering func tion for complex networks. This method can overcome the biased and inaccurate faults of graphical linear fitting methods commonly used in current network research. Furthermore, it is verified to have higher goodness-of-fit than graphical methods by comparing the KS (Kolmogorov-Smirnov) test statistics for 10 CNN (Connecting Nearest-Neighbor)networks.

  5. Modular networks with hierarchical organization: The dynamical implications of complex structure

    Indian Academy of Sciences (India)

    Raj Kumar Pan; Sitabhra Sinha

    2008-08-01

    Several networks occurring in real life have modular structures that are arranged in a hierarchical fashion. In this paper, we have proposed a model for such networks, using a stochastic generation method. Using this model we show that, the scaling relation between the clustering and degree of the nodes is not a necessary property of hierarchical modular networks, as had previously been suggested on the basis of a deterministically constructed model. We also look at dynamics on such networks, in particular, the stability of equilibria of network dynamics and of synchronized activity in the network. For both of these, we find that, increasing modularity or the number of hierarchical levels tends to increase the probability of instability. As both hierarchy and modularity are seen in natural systems, which necessarily have to be robust against environmental fluctuations, we conclude that additional constraints are necessary for the emergence of hierarchical structure, similar to the occurrence of modularity through multi-constraint optimization as shown by us previously.

  6. All-To-All Personalized Communication in Wormhole-Routed 2D/3D Meshes and Multidimensional Interconnection Networks

    Institute of Scientific and Technical Information of China (English)

    Huizhi Xu; Shuming Zhou

    2004-01-01

    All-to-all personalized communication ,or complete exchange ,is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper,we consider this problem in a 2D/ 3D mesh and a multidimensional interconnection network with the wormhole-routing capability. We propose complete exchange algorithms for them respectively. We propose O(mn2)phase algorithm for 2D mesh Pm×Pn and O(mn2l2)phase algorithm for 3D mesh Pm×Pn×Pl,where m,n,l are any positive integers. Also O(ph(G1)n2)phase algorithm is proposed for a multidimensional interconnection network G1×G2,where ph(G1)stands for complete exchange phases of G1 and |G2|=n.

  7. Improvement of system security with unified-power-flow controller at suitable locations under network contingencies of interconnected systems

    OpenAIRE

    Thukaram, D; Jenkins, L.; Visakha, K

    2005-01-01

    The operation and planning of large interconnected power systems are becoming increasingly complex. To maintain security of such systems, it is desirable to estimate the effect of contingencies and plan suitable measures to improve system security/stability. The paper presents an approach for selection of unified-power-flow-controller (UPFC-) suitable locations considering normal and network contingencies after evaluating the degree of severity of the contingencies. The ranking is evaluated u...

  8. 超级递归基准互连网络性能分析%Performance Analysis of Super Recursive Baseline Interconnection Networks

    Institute of Scientific and Technical Information of China (English)

    侯国峰; 杨愚鲁

    2001-01-01

    Based on Delta network, Baseline network and current VLSI technique development level, a new family of MINs using 8× 8 switches which is called Super Recursive Baseline Interconnection Net-work (SRB) has been presented. This paper makes network performance analysis, simulation and com-parison, and proves that SRB has superior qualities in network pass rates, bandwidths and perfor-mance/cost ratios, etc. Therefore, SRB is proved to be a family of Multistage Interconnection Network simple in routing, superior in performance, and easy in expanding.

  9. Compiler-directed power optimization of high-performance interconnection networks for load-balancing MPI applications

    Institute of Scientific and Technical Information of China (English)

    YANG Xuejun; YI Huizhan; QU Xiangli; ZHOU Haifang

    2007-01-01

    Energy consumption of parallel computers has been becoming the obstruction to higher-performance systems.In this paper,we focus on power optimization of highperformance interconnection networks for MPI applications in high-performance parallel computers.Compared with the past history-based work,we propose the idea of compilerdirected power-aware on/off network links.There are some idle intervals for network links during the execution of parallel applications,at which the links still consume large amounts of energy.Using on/off network links,compiler first divides load-balancing MPI applications into the communication intervals and the computation intervals,and then inserts the on/off instruction into the applications to switch the link state.To avoid the time overhead of state switching,we use a time estimation technique to analyze the computation time,and insert the on instruction before reaching the communication intervals.Results from simulations and experiments show that the proposed compiler- directed method can reduce energy consumption of interconnection networks by 20~70%,at a loss of less than 1% network latency and performance degradation.

  10. Application of growing hierarchical SOM for visualisation of network forensics traffic data.

    Science.gov (United States)

    Palomo, E J; North, J; Elizondo, D; Luque, R M; Watson, T

    2012-08-01

    Digital investigation methods are becoming more and more important due to the proliferation of digital crimes and crimes involving digital evidence. Network forensics is a research area that gathers evidence by collecting and analysing network traffic data logs. This analysis can be a difficult process, especially because of the high variability of these attacks and large amount of data. Therefore, software tools that can help with these digital investigations are in great demand. In this paper, a novel approach to analysing and visualising network traffic data based on growing hierarchical self-organising maps (GHSOM) is presented. The self-organising map (SOM) has been shown to be successful for the analysis of highly-dimensional input data in data mining applications as well as for data visualisation in a more intuitive and understandable manner. However, the SOM has some problems related to its static topology and its inability to represent hierarchical relationships in the input data. The GHSOM tries to overcome these limitations by generating a hierarchical architecture that is automatically determined according to the input data and reflects the inherent hierarchical relationships among them. Moreover, the proposed GHSOM has been modified to correctly treat the qualitative features that are present in the traffic data in addition to the quantitative features. Experimental results show that this approach can be very useful for a better understanding of network traffic data, making it easier to search for evidence of attacks or anomalous behaviour in a network environment. Copyright © 2012 Elsevier Ltd. All rights reserved.

  11. A Hierarchical Approach to Persistent Scatterer Network Construction and Deformation Time Series Estimation

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2014-12-01

    Full Text Available This paper presents a hierarchical approach to network construction and time series estimation in persistent scatterer interferometry (PSI for deformation analysis using the time series of high-resolution satellite SAR images. To balance between computational efficiency and solution accuracy, a dividing and conquering algorithm (i.e., two levels of PS networking and solution is proposed for extracting deformation rates of a study area. The algorithm has been tested using 40 high-resolution TerraSAR-X images collected between 2009 and 2010 over Tianjin in China for subsidence analysis, and validated by using the ground-based leveling measurements. The experimental results indicate that the hierarchical approach can remarkably reduce computing time and memory requirements, and the subsidence measurements derived from the hierarchical solution are in good agreement with the leveling data.

  12. Optical Backplane Interconnection

    Science.gov (United States)

    Hendricks, Herbert D.

    1991-01-01

    Optical backplane interconnection (OBIT), method of optically interconnecting many parallel outputs from data processor to many parallel inputs of other data processors by optically changing wavelength of output optical beam. Requires only one command: exact wavelength necessary to make connection between two desired processors. Many features, including smallness advantageous to incorporate OBIT into integrated optical device. Simplifies or eliminates wiring and speeds transfer of data over existing electrical or optical interconnections. Computer hookups and fiber-optical communication networks benefit from concept.

  13. Detecting Hidden Hierarchy of Non Hierarchical Terrorist Networks

    DEFF Research Database (Denmark)

    Memon, Nasrullah

    to analyze terrorist networks and prioritize their targets. Applying recently introduced mathematical methods for constructing the hidden hierarchy of "nonhierarchical" terrorist networks; we present case studies of the terrorist attacks occurred / planned in the past, in order to identify hidden hierarchy...

  14. A cost-effective and fast recovery mechanism for multi-ring interconnection networks based on RPR

    Science.gov (United States)

    Zhan, Yichun; Ji, Meng; Yu, Shaohua

    2005-11-01

    Resilient Packet Ring (RPR) has been standardized in the IEEE 802.17 working group. In multi-ring networks, similarly with other ring-based technology, intra-ring traffic demand is protected against single node and span failures within 50 ms by the "steering" and "wrapping" protection. Inter-ring traffic demand, however, is susceptible to failures at nodes or links where the traffic demand transits from one ring to another. Normally, the survivability of interconnecting node or link failure has to be provided by other technologies, such as MPLS and Spanning Tree Protocol. Unfortunately, most schemes cannot provide a cost-effective solution with guaranteeing the restoration within the 50 ms timeframe. In this paper we proposed a cost-effective and fast Recovery Mechanism for Multi-ring Interconnection Networks Based on RPR. Differential from Spanning Tree Protocol (STP) and other protection technologies, this mechanism has the ability of sub-50ms protection provisioning and scalability based on the bridging function in RPR. Particular with enhanced bridging support, this mechanism can provide efficient bandwidth spatial reuse on multi-ring RPR networks. The proposed novel mechanism has been implemented on our 10Gbps network processor (NP) based multi-service provisioning platform. All experimental results presented in this paper come from actual testing on the network test bed and show that the all the inter-ring traffic are given the sub-50ms recovery guarantee as intra-ring traffic in normal case.

  15. Performance evaluation of time-aware enhanced software defined networking (TeSDN) for elastic data center optical interconnection.

    Science.gov (United States)

    Yang, Hui; Zhang, Jie; Zhao, Yongli; Ji, Yuefeng; Li, Hui; Lin, Yi; Li, Gang; Han, Jianrui; Lee, Young; Ma, Teng

    2014-07-28

    Data center interconnection with elastic optical networks is a promising scenario to meet the high burstiness and high-bandwidth requirements of data center services. We previously implemented enhanced software defined networking over elastic optical network for data center application [Opt. Express 21, 26990 (2013)]. On the basis of it, this study extends to consider the time-aware data center service scheduling with elastic service time and service bandwidth according to the various time sensitivity requirements. A novel time-aware enhanced software defined networking (TeSDN) architecture for elastic data center optical interconnection has been proposed in this paper, by introducing a time-aware resources scheduling (TaRS) scheme. The TeSDN can accommodate the data center services with required QoS considering the time dimensionality, and enhance cross stratum optimization of application and elastic optical network stratums resources based on spectrum elasticity, application elasticity and time elasticity. The overall feasibility and efficiency of the proposed architecture is experimentally verified on our OpenFlow-based testbed. The performance of TaRS scheme under heavy traffic load scenario is also quantitatively evaluated based on TeSDN architecture in terms of blocking probability and resource occupation rate.

  16. A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes

    Science.gov (United States)

    Craveirinha, José; Girão-Silva, Rita; Clímaco, João; Martins, Lúcia

    This work presents a model for multiobjective routing in MPLS networks formulated within a hierarchical network-wide optimization framework, with two classes of services, namely QoS and Best Effort (BE) services. The routing model uses alternative routing and hierarchical optimization with two optimization levels, including fairness objectives. Another feature of the model is the use of an approximate stochastic representation of the traffic flows in the network, based on the concept of effective bandwidth. The theoretical foundations of a heuristic strategy for finding “good” compromise solutions to the very complex bi-level routing optimization problem, based on a conjecture concerning the definition of marginal implied costs for QoS flows and BE flows, will be described. The main features of a first version of this heuristic based on a bi-objective shortest path model and some preliminary results for a benchmark network will also be revealed.

  17. An Advanced Survey on Secure Energy-Efficient Hierarchical Routing Protocols in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Abdoulaye Diop

    2013-01-01

    Full Text Available Wireless Sensor Networks (WSNs are often deployed in hostile environments, which make such networks highly vulnerable and increase the risk of attacks against this type of network. WSN comprise of large number of sensor nodes with different hardware abilities and functions. Due to the limited memory resources and energy constraints, complex security algorithms cannot be used in sensor networks. Therefore, it is necessary to balance between the security level and the associated energy consumption overhead to mitigate the security risks. Hierarchical routing protocol is more energy-efficient than other routing protocols in WSNs. Many secure cluster-based routing protocols have been proposed in the literature to overcome these constraints. In this paper, we discuss Secure Energy-Efficient Hierarchical Routing Protocols in WSNs and compare them in terms of security, performance and efficiency. Security issues for WSNs and their solutions are also discussed.

  18. Effective Hierarchical Routing Algorithm for Large-scale Wireless Mobile Networks

    Directory of Open Access Journals (Sweden)

    Guofeng Yan

    2014-02-01

    Full Text Available The growing interest in wireless mobile network techniques has resulted in many routing protocol proposals. The unpredictable motion and the unreliable behavior of mobile nodes is one of the key issues in wireless mobile network. Virtual mobile node (VMN consists of robust virtual nodes that are both predictable and reliable. Based on VMN, in this paper, we present a hierarchical routing algorithm, i.e., EHRA-WAVE, for large-scale wireless mobile networks. By using mobile WAVE technology, a routing path can be found rapidly between VMNs without accurate topology information. We introduce the routing algorithm and the implementation issues of the proposed EHRA-WAVE routing algorithm. Finally, we evaluate the performance of EHRA-WAVE through experiments, and compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing methods. However, due to the large amounts WAVE flooding, EHRAWAVE results in too large load which would impede the application of the EHRA-WAVE algorithm. Therefore, the further routing protocol focuses on minimizing the number of WAVE using hierarchical structures in large-scale wireless mobile networks

  19. Bottom-up GGM algorithm for constructing multiple layered hierarchical gene regulatory networks

    Science.gov (United States)

    Multilayered hierarchical gene regulatory networks (ML-hGRNs) are very important for understanding genetics regulation of biological pathways. However, there are currently no computational algorithms available for directly building ML-hGRNs that regulate biological pathways. A bottom-up graphic Gaus...

  20. A Novel Hierarchical Semi-centralized Telemedicine Network Architecture Proposition for Bangladesh

    DEFF Research Database (Denmark)

    Choudhury, Samiul; Peterson, Carrie Beth; Kyriazakos, Sofoklis

    2011-01-01

    where there are extreme paucities of efficient healthcare professionals and equipments, specifically in the rural areas. In this paper a novel, hierarchical and semi-centralized telemedicine network architecture has been proposed holisti-cally focusing on the rural underdeveloped areas of Bangladesh...... of Bangladesh. Finally, some features and services associated with the model have also been proposed which are pragmatic and easily implementable....

  1. The exact Laplacian spectrum for the Dyson hierarchical network

    CERN Document Server

    Agliari, Elena

    2016-01-01

    We consider the Dyson hierarchical graph $\\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\\sigma \\in (1/2, 1]$. Exploiting the deterministic recursivity through which $\\mathcal{G}$ is built, we are able to derive explicitly the whole set of the eigenvalues and the eigenvectors for its Laplacian matrix. Given that the Laplacian operator is intrinsically implied in the analysis of dynamic processes (e.g., random walks) occurring on the graph, as well as in the investigation of the dynamical properties of connected structures themselves (e.g., vibrational structures and the relaxation modes), this result allows addressing analytically a large class of problems. In particular, as examples of applications, we study the random walk and the continuous-time quantum walk embedded in $\\mathcal{G}$, and the relaxation times of a polymer whose structure is described by $\\mathcal{G}$.

  2. The exact Laplacian spectrum for the Dyson hierarchical network

    Science.gov (United States)

    Agliari, Elena; Tavani, Flavia

    2017-01-01

    We consider the Dyson hierarchical graph , that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter σ ∈ (1/2, 1]. Exploiting the deterministic recursivity through which is built, we are able to derive explicitly the whole set of the eigenvalues and the eigenvectors for its Laplacian matrix. Given that the Laplacian operator is intrinsically implied in the analysis of dynamic processes (e.g., random walks) occurring on the graph, as well as in the investigation of the dynamical properties of connected structures themselves (e.g., vibrational structures and relaxation modes), this result allows addressing analytically a large class of problems. In particular, as examples of applications, we study the random walk and the continuous-time quantum walk embedded in , the relaxation times of a polymer whose structure is described by , and the community structure of in terms of modularity measures.

  3. Cluster based hierarchical resource searching model in P2P network

    Institute of Scientific and Technical Information of China (English)

    Yang Ruijuan; Liu Jian; Tian Jingwen

    2007-01-01

    For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer (P2P) network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network,auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.

  4. Avalanche transmission and critical behaviour in load-bearing hierarchical networks

    Indian Academy of Sciences (India)

    Ajay Deep Kachhvah; Neelima Gupte

    2011-11-01

    The strength and stability properties of hierarchical load-bearing networks and their strengthened variants have been discussed in a recent work. Here, we study the avalanche time distributions on these load-bearing networks. The avalanche time distributions of the V-lattice, a unique realization of the networks, show power-law behaviour when tested with certain fractions of its trunk weights. All other avalanche distributions show Gaussian peaked behaviour. Thus the V-lattice is the critical case of the network. We discuss the implications of this result.

  5. Internal representation of hierarchical sequences involves the default network

    Directory of Open Access Journals (Sweden)

    Rogers Baxter P

    2010-04-01

    Full Text Available Abstract Background The default network is a set of brain regions that exhibit a reduction in BOLD response during attention-demanding cognitive tasks, and distinctive patterns of functional connectivity that typically include anti-correlations with a fronto-parietal network involved in attention, working memory, and executive control. The function of the default network regions has been attributed to introspection, self-awareness, and theory of mind judgments, and some of its regions are involved in episodic memory processes. Results Using the method of psycho-physiological interactions, we studied the functional connectivity of several regions in a fronto-parietal network involved in a paired image discrimination task involving transitive inference. Some image pairs were derived from an implicit underlying sequence A>B>C>D>E, and some were independent (F>G, H>J, etc. Functional connectivity between the fronto-parietal regions and the default network regions depended on the presence of the underlying sequence relating the images. When subjects viewed learned and novel pairs from the sequence, connectivity between these two networks was higher than when subjects viewed learned and novel pairs from the independent sets. Conclusions These results suggest that default network regions were involved in maintaining the internal model that subserved discrimination of image pairs derived from the implicit sequence, and contributed to introspective access of an internal sequence model built during training. The default network may not be a unified entity with a specific function, but rather may interact with other functional networks in task-dependent ways.

  6. Multilevel hierarchical kernel spectral clustering for real-life large scale complex networks.

    Directory of Open Access Journals (Sweden)

    Raghvendra Mall

    Full Text Available Kernel spectral clustering corresponds to a weighted kernel principal component analysis problem in a constrained optimization framework. The primal formulation leads to an eigen-decomposition of a centered Laplacian matrix at the dual level. The dual formulation allows to build a model on a representative subgraph of the large scale network in the training phase and the model parameters are estimated in the validation stage. The KSC model has a powerful out-of-sample extension property which allows cluster affiliation for the unseen nodes of the big data network. In this paper we exploit the structure of the projections in the eigenspace during the validation stage to automatically determine a set of increasing distance thresholds. We use these distance thresholds in the test phase to obtain multiple levels of hierarchy for the large scale network. The hierarchical structure in the network is determined in a bottom-up fashion. We empirically showcase that real-world networks have multilevel hierarchical organization which cannot be detected efficiently by several state-of-the-art large scale hierarchical community detection techniques like the Louvain, OSLOM and Infomap methods. We show that a major advantage of our proposed approach is the ability to locate good quality clusters at both the finer and coarser levels of hierarchy using internal cluster quality metrics on 7 real-life networks.

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

  8. Transurban interconnectivities

    DEFF Research Database (Denmark)

    Jørgensen, Claus Møller

    2012-01-01

    This essay discusses the interpretation of the revolutionary situations of 1848 in light of recent debates on interconnectivity in history. The concept of transurban interconnectivities is proposed as the most precise concept to capture the nature of interconnectivity in 1848. It is argued......, radicalism and nationalism in 1848. In the concluding paragraph, the limitations of the notion of urban–rural nterconnectivity are discussed in order to clarify the nature of transurban interconnectivity. 1848 revolutions; European history; interconnectivity; transurban; urban political movements...

  9. Hierarchical Synchrony of Phase Oscillators in Modular Networks

    CERN Document Server

    Skardal, Per Sebastian

    2011-01-01

    We study synchronization of sinusoidally coupled phase oscillators on networks with modular structure and a large number of oscillators in each community. Of particular interest is the hierarchy of local and global synchrony, i.e., synchrony within and between communities, respectively. Using the recent ansatz of Ott and Antonsen, we find that the degree of local synchrony can be determined from a set of coupled low-dimensional equations. If the number of communities in the network is large, a low-dimensional description of global synchrony can be also found. Using these results, we study bifurcations between different types of synchrony. We find that, depending on the relative strength of local and global coupling, the transition to synchrony in the network can be mediated by local or global effects.

  10. Identifying overlapping and hierarchical thematic structures in networks of scholarly papers: a comparison of three approaches.

    Science.gov (United States)

    Havemann, Frank; Gläser, Jochen; Heinz, Michael; Struck, Alexander

    2012-01-01

    The aim of this paper is to introduce and assess three algorithms for the identification of overlapping thematic structures in networks of papers. We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles, abstracts, and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three predefined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields.

  11. Identifying overlapping and hierarchical thematic structures in networks of scholarly papers: a comparison of three approaches.

    Directory of Open Access Journals (Sweden)

    Frank Havemann

    Full Text Available The aim of this paper is to introduce and assess three algorithms for the identification of overlapping thematic structures in networks of papers. We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles, abstracts, and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three predefined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields.

  12. Hierarchical network architectures of carbon fiber paper supported cobalt oxide nanonet for high-capacity pseudocapacitors.

    Science.gov (United States)

    Yang, Lei; Cheng, Shuang; Ding, Yong; Zhu, Xingbao; Wang, Zhong Lin; Liu, Meilin

    2012-01-11

    We present a high-capacity pseudocapacitor based on a hierarchical network architecture consisting of Co(3)O(4) nanowire network (nanonet) coated on a carbon fiber paper. With this tailored architecture, the electrode shows ideal capacitive behavior (rectangular shape of cyclic voltammograms) and large specific capacitance (1124 F/g) at high charge/discharge rate (25.34 A/g), still retaining ~94% of the capacitance at a much lower rate of 0.25 A/g. The much-improved capacity, rate capability, and cycling stability may be attributed to the unique hierarchical network structures, which improves electron/ion transport, enhances the kinetics of redox reactions, and facilitates facile stress relaxation during cycling.

  13. A CDMA Based Scalable Hierarchical Architecture for Network-On-Chip

    Directory of Open Access Journals (Sweden)

    Mohamed A. Abd El Ghany

    2012-09-01

    Full Text Available A Scalable hierarchical architecture based Code-Division Multiple Access (CDMA is proposed for high performance Network-on-Chip (NoC. This hierarchical architecture provides the integration of a large number of IPs in a single on-chip system. The network encoding and decoding schemes for CDMA transmission are provided. The proposed CDMA NoC architecture is compared to the conventional architecture in terms of latency, area and power dissipation. The overall area required to implement the proposed CDMA NoC design is reduced by 24.2%. The design decreases the latency of the network by 40%. The total power consumption required to achieve the proposed design is also decreased by 25%.

  14. Scaling of the Average Receiving Time on a Family of Weighted Hierarchical Networks

    Science.gov (United States)

    Sun, Yu; Dai, Meifeng; Sun, Yanqiu; Shao, Shuxiang

    2016-08-01

    In this paper, based on the un-weight hierarchical networks, a family of weighted hierarchical networks are introduced, the weight factor is denoted by r. The weighted hierarchical networks depend on the number of nodes in complete bipartite graph, denoted by n1, n2 and n = n1 + n2. Assume that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the weight of edge linking them. We deduce the analytical expression of the average receiving time (ART). The obtained remarkable results display two conditions. In the large network, when nr > n1n2, the ART grows as a power-law function of the network size |V (Gk)| with the exponent, represented by θ =logn( nr n1n2 ), 0 < θ < 1. This means that the smaller the value of θ, the more efficient the process of receiving information. When nr ≤ n1n2, the ART grows with increasing order |V (Gk)| as logn|V (Gk)| or (logn|V (Gk)|)2.

  15. Traffic Load on Interconnection Lines of Generalized Double Ring Network Structures

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Riaz, Muhammad Tahir; Madsen, Ole Brun

    2005-01-01

    consists of two planar rings, which are easily embedded by fiber or other wired solutions. It is shown that for large N2R structures, the interconnection lines carry notably lower loads than the other lines if shortest-path routing is used, and the effects of two other routing schemes are explored, leading...

  16. ROBUST SLIDING MODE DECENTRALIZED CONTROL FOR A CLASS OF NONLINEAR INTERCONNECTED LARGE-SCALE SYSTEM WITH NEURAL NETWORKS

    Institute of Scientific and Technical Information of China (English)

    CHENMou; JIANGChang-sheng; CHENWen-hua

    2004-01-01

    A new decentralized robust control method is discussed for a class of nonlinear interconnected largescale system with unknown bounded disturbance and unknown nonlinear function term. A decentralized control law is proposed which combines the approximation method of neural network with sliding mode control. The decentralized controller consists of an equivalent controller and an adaptive sliding mode controller. The sliding mode controller is a robust controller used to reduce the track error of the control system. The neural networks are used to approximate the unknown nonlinear functions, meanwhile the approximation errors of the neural networks are applied to the weight value updated law to improve performance of the system. Finally, an example demonstrates the availability of the decentralized control method.

  17. Synchronization in heterogeneous FitzHugh-Nagumo networks with hierarchical architecture

    Science.gov (United States)

    Plotnikov, S. A.; Lehnert, J.; Fradkov, A. L.; Schöll, E.

    2016-07-01

    We study synchronization in heterogeneous FitzHugh-Nagumo networks. It is well known that heterogeneities in the nodes hinder synchronization when becoming too large. Here we develop a controller to counteract the impact of these heterogeneities. We first analyze the stability of the equilibrium point in a ring network of heterogeneous nodes. We then derive a sufficient condition for synchronization in the absence of control. Based on these results we derive the controller providing synchronization for parameter values where synchronization without control is absent. We demonstrate our results in networks with different topologies. Particular attention is given to hierarchical (fractal) topologies, which are relevant for the architecture of the brain.

  18. Hierarchical micro-mobility management in high-speed multihop access networks

    Institute of Scientific and Technical Information of China (English)

    TANG Bi-hua; MA Xiao-lei; LIU Yuan-an; GAO Jin-chun

    2006-01-01

    This article integrates the hierarchical micro-mobility management and the high-speed multihop access networks (HMAN), to accomplish the smooth handover between different access routers. The proposed soft handover scheme in the high-speed HMAN can solve the micro-mobility management problem in the access network. This article also proposes the hybrid access router (AR) advertisement scheme and AR selection algorithm, which uses the time delay and stable route to the AR as the gateway selection parameters. By simulation, the proposed micro-mobility management scheme can achieve high packet delivery fraction and improve the lifetime of network.

  19. Topology of the correlation networks among major currencies using hierarchical structure methods

    Science.gov (United States)

    Keskin, Mustafa; Deviren, Bayram; Kocakaplan, Yusuf

    2011-02-01

    We studied the topology of correlation networks among 34 major currencies using the concept of a minimal spanning tree and hierarchical tree for the full years of 2007-2008 when major economic turbulence occurred. We used the USD (US Dollar) and the TL (Turkish Lira) as numeraires in which the USD was the major currency and the TL was the minor currency. We derived a hierarchical organization and constructed minimal spanning trees (MSTs) and hierarchical trees (HTs) for the full years of 2007, 2008 and for the 2007-2008 period. We performed a technique to associate a value of reliability to the links of MSTs and HTs by using bootstrap replicas of data. We also used the average linkage cluster analysis for obtaining the hierarchical trees in the case of the TL as the numeraire. These trees are useful tools for understanding and detecting the global structure, taxonomy and hierarchy in financial data. We illustrated how the minimal spanning trees and their related hierarchical trees developed over a period of time. From these trees we identified different clusters of currencies according to their proximity and economic ties. The clustered structure of the currencies and the key currency in each cluster were obtained and we found that the clusters matched nicely with the geographical regions of corresponding countries in the world such as Asia or Europe. As expected the key currencies were generally those showing major economic activity.

  20. Mapping the hierarchical layout of the structural network of the macaque prefrontal cortex.

    Science.gov (United States)

    Goulas, Alexandros; Uylings, Harry B M; Stiers, Peter

    2014-05-01

    A consensus on the prefrontal cortex (PFC) holds that it is pivotal for flexible behavior and the integration of the cognitive, affective, and motivational domains. Certain models have been put forth and a dominant model postulates a hierarchical anterior-posterior gradient. The structural connectivity principles of this model dictate that increasingly anterior PFC regions exhibit more efferent connections toward posterior ones than vice versa. Such hierarchical asymmetry principles are thought to pertain to the macaque PFC. Additionally, the laminar patterns of the connectivity of PFC regions can be used for defining hierarchies. In the current study, we formally tested the asymmetry-based hierarchical principles of the anterior-posterior model by employing an exhaustive dataset on macaque PFC connectivity and tools from network science. On the one hand, the asymmetry-based principles and predictions of the hierarchical anterior-posterior model were not confirmed. The wiring of the macaque PFC does not fully correspond to the principles of the model, and its asymmetry-based hierarchical layout does not follow a strict anterior-posterior gradient. On the other hand, our results suggest that the laminar-based hierarchy seems a more tenable working hypothesis for models advocating an anterior-posterior gradient. Our results can inform models of the human PFC.

  1. Sleeping of a Complex Brain Networks with Hierarchical Organization

    Institute of Scientific and Technical Information of China (English)

    ZHANG Ying-Yue; YANG Qiu-Ying; CHEN Tian-Lun

    2009-01-01

    The dynamical behavior in the cortical brain network of macaque is studied by modeling each cortical area with a subnetwork of interacting excitable neurons. We characterize the system by studying how to perform the transition, which is now topology-dependent, from the active state to that with no activity. This could be a naive model for the wakening and sleeping of a brain-like system, i.e., a multi-component system with two different dynamical behavior.

  2. Hierarchical brain networks active in approach and avoidance goal pursuit

    Directory of Open Access Journals (Sweden)

    Jeffrey Martin Spielberg

    2013-06-01

    Full Text Available Effective approach/avoidance goal pursuit is critical for attaining long-term health and well-being. Research on the neural correlates of key goal pursuit processes (e.g., motivation has long been of interest, with lateralization in prefrontal cortex being a particularly fruitful target of investigation. However, this literature has often been limited by a lack of spatial specificity and has not delineated the precise aspects of approach/avoidance motivation involved. Additionally, the relationships among brain regions (i.e., network connectivity vital to goal pursuit remain largely unexplored. Specificity in location, process, and network relationship is vital for moving beyond gross characterizations of function and identifying the precise cortical mechanisms involved in motivation. The present paper integrates research using more spatially specific methodologies (e.g., functional magnetic resonance imaging with the rich psychological literature on approach/avoidance to propose an integrative network model that takes advantage of the strengths of each of these literatures.

  3. Frontoparietal Connectivity and Hierarchical Structure of the Brain’s Functional Network during Sleep

    Directory of Open Access Journals (Sweden)

    Victor I Spoormaker

    2012-05-01

    Full Text Available Frontal and parietal regions are associated with some of the most complex cognitive functions, and several frontoparietal resting-state networks can be observed in wakefulness. We used functional magnetic resonance imaging (fMRI data acquired in polysomnographically validated wakefulness, light sleep and slow-wave sleep to examine the hierarchical structure of a low-frequency functional brain network, and to examine whether frontoparietal connectivity would disintegrate in sleep. Whole-brain analyses with hierarchical cluster analysis on predefined atlases were performed, as well as regression of inferior parietal lobules seeds against all voxels in the brain, and an evaluation of the integrity of voxel time-courses in subcortical regions-of-interest. We observed that frontoparietal functional connectivity disintegrated in sleep stage 1 and was absent in deeper sleep stages. Slow-wave sleep was characterized by strong hierarchical clustering of local submodules. Frontoparietal connectivity between inferior parietal lobules and superior medial and right frontal gyrus was lower in sleep stages than in wakefulness. Moreover, thalamus voxels showed maintained integrity in sleep stage 1, making intrathalamic desynchronization an unlikely source of reduced thalamocortical connectivity in this sleep stage. Our data suggest a transition from a globally integrated functional brain network in wakefulness to a disintegrated network consisting of local submodules in slow-wave sleep, in which frontoparietal inter-modular nodes may play a crucial role, possibly in combination with the thalamus.

  4. HIERARCHICAL DESIGN BASED INTRUSION DETECTION SYSTEM FOR WIRELESS AD HOC SENSOR NETWORK

    Directory of Open Access Journals (Sweden)

    Mohammad Saiful Islam Mamun

    2010-07-01

    Full Text Available In recent years, wireless ad hoc sensor network becomes popular both in civil and military jobs.However, security is one of the significant challenges for sensor network because of their deploymentin open and unprotected environment. As cryptographic mechanism is not enough to protect sensornetwork from external attacks, intrusion detection system needs to be introduced. Though intrusionprevention mechanism is one of the major and efficient methods against attacks, but there might besome attacks for which prevention method is not known. Besides preventing the system from someknown attacks, intrusion detection system gather necessary information related to attack technique andhelp in the development of intrusion prevention system. In addition to reviewing the present attacksavailable in wireless sensor network this paper examines the current efforts to intrusion detectionsystem against wireless sensor network. In this paper we propose a hierarchical architectural designbased intrusion detection system that fits the current demands and restrictions of wireless ad hocsensor network. In this proposed intrusion detection system architecture we followed clusteringmechanism to build a four level hierarchical network which enhances network scalability to largegeographical area and use both anomaly and misuse detection techniques for intrusion detection. Weintroduce policy based detection mechanism as well as intrusion response together with GSM cellconcept for intrusion detection architecture.

  5. Predicting Hierarchical Structure in Small World Social Networks

    DEFF Research Database (Denmark)

    Hussain, Dil Muhammad Akbar

    2009-01-01

    Typisk analytisk foranstaltninger i grafteori gerne grad centralitet, betweenness og nærhed centralities er meget almindelige og har lang tradition for deres vellykkede brug. Men modellering af skjult, terrorister eller kriminelle netværk gennem sociale grafer ikke rigtig give den hierarkiske str...... udnyttet til at forudsige den kommandostruktur af nettet. Nøgleord: Social Networks Analyse, Bayes Teorem, entropi, hierarkisk struktur.......Typisk analytisk foranstaltninger i grafteori gerne grad centralitet, betweenness og nærhed centralities er meget almindelige og har lang tradition for deres vellykkede brug. Men modellering af skjult, terrorister eller kriminelle netværk gennem sociale grafer ikke rigtig give den hierarkiske...

  6. Photovoltaic systems interconnected to the electric network; Sistemas fotovoltaicos interconectados a la red electrica

    Energy Technology Data Exchange (ETDEWEB)

    Agredano Diaz, Jaime [Instituto de Investigaciones Electricas, Cuernavaca, Morelos (Mexico)

    2007-06-15

    This presentation is about the project carried out in the State of Baja California, Mexico, more specifically in the region called Mexicalli. In the first part, there are given the reasons and the effects developed in this region due to the climatologic changes occurred every summer. In effect, there are described both the cause and the economic impact representing for those families that live around there, the summer's arrival. Next, it is shown the solution found by the State government participating the Mexican Electric Research Institute (IIE). Such participation is translated on a project that shows the feasibility of installing photovoltaic systems on households. Such systems are interconnected to the Mexico's Federal Commission of Electricity's (CFE) electric network. Next, it is given a description of both its methodology and its performance. Then, it is firstly given the positive effect in both issues economic and environmental and secondly the general parameters of the installation of the system on the 220 households of the complex Valle de las Misiones. In addition, it is mentioned the method that would be used in order to get a bigger impact as well as better coverage of the system. Finally, there are presented the project's sponsors, among there can be found: the Mexican Energy Secretariat (SENER), the CFE, the Mexican Energy Regulatory Commission (CRE), the Universidad Autonoma de Baja California (UABC), the IIE, the North American Development Bank (NADB), and the Government of the State of Baja California. [Spanish] Esta ponencia es acerca del proyecto de sistemas fotovoltaicos desarrollado en el Estado de Baja California, mas especificamente en Mexicalli. En la primera parte, se presentan las causas y las consecuencias que ocasionan los cambios climatologicos desarrollados en esta region durante el verano; es decir, se describe la razon y el impacto economico que representa para las familias de esta region la llegada del verano

  7. Natural forest conservation hierarchical program with neural network

    Institute of Scientific and Technical Information of China (English)

    LUO Chuanwen; LI Jihong

    2006-01-01

    In this paper,the implementing steps of a natural forest protection program grading (NFPPG) with neural network (NN) were summarized and the concepts of program illustration,patch sign unification and regression,and inclining factor were set forth.Employing Arc/Info GIS,the tree species diversity and rarity,disturbance degree,protection of channel system,and classification management in the Maoershan National Forest Park were described,and used as the input factors of NN.The relationships between NFPPG and above factors were also analyzed.By artificially determining training samples,the NFPPG of Moershan National Forest Park was created.Tested with all patches in the park,the generalization of NFPPG was satisfied.NFPPG took both the classification management and the protection of forest community types into account,as well as the ecological environment.The excitation function of NFPPG was not seriously saturated,indicating the leading effect of the inclining factor on the network optimization.

  8. NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    CHENG Hong-bing; YANG Geng; HU Su-jun

    2008-01-01

    Considering severe resources constraints and security threat of wireless sensor networks (WSN), the article proposed a novel hierarchical routing protocol algorithm. The proposed routing protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node compromise attacks, the results show that the proposed routing protocol algorithm is more efficient for wireless sensor networks.

  9. Identifying Overlapping and Hierarchical Thematic Structures in Networks of Scholarly Papers: A Comparison of Three Approaches

    CERN Document Server

    Havemann, Frank; Heinz, Michael; Struck, Alexander

    2011-01-01

    We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three pre-defined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields.

  10. Systemic risk and hierarchical transitions of financial networks

    Science.gov (United States)

    Nobi, Ashadun; Lee, Jae Woo

    2017-06-01

    In this paper, the change in topological hierarchy, which is measured by the minimum spanning tree constructed from the cross-correlations between the stock indices from the S & P 500 for 1998-2012 in a one year moving time window, was used to analyze a financial crisis. The hierarchy increased in all minor crises in the observation time window except for the sharp crisis of 2007-2008 when the global financial crisis occurred. The sudden increase in hierarchy just before the global financial crisis can be used for the early detection of an upcoming crisis. Clearly, the higher the hierarchy, the higher the threats to financial stability. The scaling relations were developed to observe the changes in hierarchy with the network topology. These scaling relations can also identify and quantify the financial crisis periods, and appear to contain the predictive power of an upcoming crisis.

  11. Communication Theories and Protocols for Smart Grid Hierarchical Network

    Directory of Open Access Journals (Sweden)

    CHHAYA Lipi

    2017-05-01

    Full Text Available Smart grid technology is a revolutionary approach for improvisation in existing power grid. Integration of electrical and communication infrastructure is inevitable for the deployment of Smart grid network. Smart grid infrastructure is characterized by full duplex communication, automatic metering infrastructure, renewable energy integration, distribution automation and complete monitoring and control of entire power grid. Different levels of smart grid deployment require diverse set of communication protocols. Application of information theory and optimization of various communication technologies is essential for layered architecture of smart grid technology. This paper is anticipated to serve as a comprehensive survey and analysis of communication theories and wireless communication protocols for optimization and design of energy efficient smart grid communication infrastructure.

  12. Sensor Network Data Fault Detection using Hierarchical Bayesian Space-Time Modeling

    OpenAIRE

    Ni, Kevin; Pottie, G J

    2009-01-01

    We present a new application of hierarchical Bayesian space-time (HBST) modeling: data fault detection in sensor networks primarily used in environmental monitoring situations. To show the effectiveness of HBST modeling, we develop a rudimentary tagging system to mark data that does not fit with given models. Using this, we compare HBST modeling against first order linear autoregressive (AR) modeling, which is a commonly used alternative due to its simplicity. We show that while HBST is mo...

  13. An energy efficient cooperative hierarchical MIMO clustering scheme for wireless sensor networks.

    Science.gov (United States)

    Nasim, Mehwish; Qaisar, Saad; Lee, Sungyoung

    2012-01-01

    In this work, we present an energy efficient hierarchical cooperative clustering scheme for wireless sensor networks. Communication cost is a crucial factor in depleting the energy of sensor nodes. In the proposed scheme, nodes cooperate to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Performance is enhanced by cooperative multiple-input multiple-output (MIMO) communication ensuring energy efficiency for WSN deployments over large geographical areas. We test our scheme using TOSSIM and compare the proposed scheme with cooperative multiple-input multiple-output (CMIMO) clustering scheme and traditional multihop Single-Input-Single-Output (SISO) routing approach. Performance is evaluated on the basis of number of clusters, number of hops, energy consumption and network lifetime. Experimental results show significant energy conservation and increase in network lifetime as compared to existing schemes.

  14. A hierarchical P2P overlay network for interest-based media contents lookup

    Science.gov (United States)

    Lee, HyunRyong; Kim, JongWon

    2006-10-01

    We propose a P2P (peer-to-peer) overlay architecture, called IGN (interest grouping network), for contents lookup in the DHC (digital home community), which aims to provide a formalized home-network-extended construction of current P2P file sharing community. The IGN utilizes the Chord and de Bruijn graph for its hierarchical overlay network construction. By combining two schemes and by inheriting its features, the IGN efficiently supports contents lookup. More specifically, by introducing metadata-based lookup keyword, the IGN offers detailed contents lookup that can reflect the user interests. Moreover, the IGN tries to reflect home network environments of DHC by utilizing HG (home gateway) of each home network as a participating node of the IGN. Through experimental and analysis results, we show that the IGN is more efficient than Chord, a well-known DHT (distributed hash table)-based lookup protocol.

  15. Hardware and Software Design of FPGA-based PCIe Gen3 interface for APEnet+ network interconnect system

    Science.gov (United States)

    Ammendola, R.; Biagioni, A.; Frezza, O.; Lo Cicero, F.; Lonardo, A.; Martinelli, M.; Paolucci, P. S.; Pastorelli, E.; Rossetti, D.; Simula, F.; Tosoratto, L.; Vicini, P.

    2015-12-01

    In the attempt to develop an interconnection architecture optimized for hybrid HPC systems dedicated to scientific computing, we designed APEnet+, a point-to-point, low-latency and high-performance network controller supporting 6 fully bidirectional off-board links over a 3D torus topology. The first release of APEnet+ (named V4) was a board based on a 40 nm Altera FPGA, integrating 6 channels at 34 Gbps of raw bandwidth per direction and a PCIe Gen2 x8 host interface. It has been the first-of-its-kind device to implement an RDMA protocol to directly read/write data from/to Fermi and Kepler NVIDIA GPUs using NVIDIA peer-to-peer and GPUDirect RDMA protocols, obtaining real zero-copy GPU-to-GPU transfers over the network. The latest generation of APEnet+ systems (now named V5) implements a PCIe Gen3 x8 host interface on a 28 nm Altera Stratix V FPGA, with multi-standard fast transceivers (up to 14.4 Gbps) and an increased amount of configurable internal resources and hardware IP cores to support main interconnection standard protocols. Herein we present the APEnet+ V5 architecture, the status of its hardware and its system software design. Both its Linux Device Driver and the low-level libraries have been redeveloped to support the PCIe Gen3 protocol, introducing optimizations and solutions based on hardware/software co-design.

  16. Impact of informal networks on opinion dynamics in hierarchically formal organization

    Science.gov (United States)

    Song, Xiao; Shi, Wen; Ma, Yaofei; Yang, Chen

    2015-10-01

    Traditional opinion dynamics model focused mainly on the conditions under which a group of agents would reach a consensus. Conclusion has been gained that continuous opinion dynamics are subject to the constraint that convergent opinion adjustment only proceeds when opinion difference is below a given tolerance. This conclusion is useful but neglected the fact that an organization often consists of overlapped networks including formally hierarchical network and small-world/scale-free informal networks. To study the impact of different types of informal networks on converging speed or the number of opinion clusters, four typical types of informal networks (small-world, scale-free, tree and fully connected) are modeled and proposed as complements to formal communications. Experiments to compare formal network and hybrid networks are then carried out. It is observed that opinion dynamics with supplemented communications of informal networks can benefit convergence speed and reduce opinion clusters. More importantly, it is revealed that three key factors of informal networks affect their impact on formal network. These factors of informal network in descending orders are: agents' tolerances, scale and number of links.

  17. 3D Networked Tin Oxide/Graphene Aerogel with a Hierarchically Porous Architecture for High-Rate Performance Sodium-Ion Batteries.

    Science.gov (United States)

    Xie, Xiuqiang; Chen, Shuangqiang; Sun, Bing; Wang, Chengyin; Wang, Guoxiu

    2015-09-07

    Low-cost and sustainable sodium-ion batteries are regarded as a promising technology for large-scale energy storage and conversion. The development of high-rate anode materials is highly desirable for sodium-ion batteries. The optimization of mass transport and electron transfer is crucial in the discovery of electrode materials with good high-rate performances. Herein, we report the synthesis of 3 D interconnected SnO2 /graphene aerogels with a hierarchically porous structure as anode materials for sodium-ion batteries. The unique 3 D architecture was prepared by a facile in situ process, during which cross-linked 3 D conductive graphene networks with macro-/meso-sized hierarchical pores were formed and SnO2 nanoparticles were dispersed uniformly on the graphene surface simultaneously. Such a 3 D functional architecture not only facilitates the electrode-electrolyte interaction but also provides an efficient electron pathway within the graphene networks. When applied as anode materials in sodium-ion batteries, the as-prepared SnO2 /graphene aerogel exhibited high reversible capacity, improved cycling performance compared to SnO2 , and promising high-rate capability.

  18. A new Hierarchical Group Key Management based on Clustering Scheme for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Ayman EL-SAYED

    2014-05-01

    Full Text Available The migration from wired network to wireless network has been a global trend in the past few decades because they provide anytime-anywhere networking services. The wireless networks are rapidly deployed in the future, secure wireless environment will be mandatory. As well, The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks,Mobile Ad hoc Networks (MANET is one of the most important and unique applications. MANET is a collection of autonomous nodes or terminals which communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. Due to the nature of unreliable wireless medium data transfer is a major problem in MANET and it lacks security and reliability of data. The most suitable solution to provide the expected level of security to these services is the provision of a key management protocol. A Key management is vital part of security. This issue is even bigger in wireless network compared to wired network. The distribution of keys in an authenticated manner is a difficult task in MANET. When a member leaves or joins the group, it needs to generate a new key to maintain forward and backward secrecy. In this paper, we propose a new group key management schemes namely a Hierarchical, Simple, Efficient and Scalable Group Key (HSESGK based on clustering management scheme for MANETs and different other schemes are classified. Group members deduce the group key in a distributed manner.

  19. New Architecture of Optical Interconnect for High-Speed Optical Computerized Data Networks (Nonlinear Response

    Directory of Open Access Journals (Sweden)

    El-Sayed A. El-Badawy

    2008-02-01

    Full Text Available Although research into the use of optics in computers has increased in the last and current decades, the fact remains that electronics is still superior to optics in almost every way. Research into the use of optics at this stage mirrors the research into electronics after the 2nd World War. The advantages of using fiber optics over wiring are the same as the argument for using optics over electronics in computers. Even through totally optical computers are now a reality, computers that combine both electronics and optics, electro-optic hybrids, have been in use for some time. In the present paper, architecture of optical interconnect is built up on the bases of four Vertical-Cavity Surface- Emitting Laser Diodes (VCSELD and two optical links where thermal effects of both the diodes and the links are included. Nonlinear relations are correlated to investigate the power-current and the voltage-current dependences of the four devices. The good performance (high speed of the interconnect is deeply and parametrically investigated under wide ranges of the affecting parameters. The high speed performance is processed through three different effects, namely the device 3-dB bandwidth, the link dispersion characteristics, and the transmitted bit rate (soliton. Eight combinations are investigated; each possesses its own characteristics. The best architecture is the one composed of VCSELD that operates at 850 nm and the silica fiber whatever the operating set of causes. This combination possesses the largest device 3-dB bandwidth, the largest link bandwidth and the largest soliton transmitted bit rate. The increase of the ambient temperature reduces the high-speed performance of the interconnect

  20. New Architecture of Optical Interconnect for High-Speed Optical Computerized Data Networks (Nonlinear Response

    Directory of Open Access Journals (Sweden)

    El-Sayed A. El-Badawy

    2008-02-01

    Full Text Available Although research into the use of optics in computers has increased in the last and current decades, the fact remains that electronics is still superior to optics in almost every way. Research into the use of optics at this stage mirrors the research into electronics after the 2nd World War. The advantages of using fiber optics over wiring are the same as the argument for using optics over electronics in computers. Even through totally optical computers are now a reality, computers that combine both electronics and optics, electro-optic hybrids, have been in use for some time. In the present paper, architecture of optical interconnect is built up on the bases of four Vertical-Cavity Surface- Emitting Laser Diodes (VCSELD and two optical links where thermal effects of both the diodes and the links are included. Nonlinear relations are correlated to investigate the power-current and the voltage-current dependences of the four devices. The good performance (high speed of the interconnect is deeply and parametrically investigated under wide ranges of the affecting parameters. The high speed performance is processed through three different effects, namely the device 3-dB bandwidth, the link dispersion characteristics, and the transmitted bit rate (soliton. Eight combinations are investigated; each possesses its own characteristics. The best architecture is the one composed of VCSELD that operates at 850 nm and the silica fiber whatever the operating set of causes. This combination possesses the largest device 3-dB bandwidth, the largest link bandwidth and the largest soliton transmitted bit rate. The increase of the ambient temperature reduces the high-speed performance of the interconnect

  1. Electrically robust metal nanowire network formation by in-situ interconnection with single-walled carbon nanotubes.

    Science.gov (United States)

    Woo, Jong Seok; Han, Joong Tark; Jung, Sunshin; Jang, Jeong In; Kim, Ho Young; Jeong, Hee Jin; Jeong, Seung Yol; Baeg, Kang-Jun; Lee, Geon-Woong

    2014-01-01

    Modulation of the junction resistance between metallic nanowires is a crucial factor for high performance of the network-structured conducting film. Here, we show that under current flow, silver nanowire (AgNW) network films can be stabilised by minimizing the Joule heating at the NW-NW junction assisted by in-situ interconnection with a small amount (less than 3 wt%) of single-walled carbon nanotubes (SWCNTs). This was achieved by direct deposition of AgNW suspension containing SWCNTs functionalised with quadruple hydrogen bonding moieties excluding dispersant molecules. The electrical stabilisation mechanism of AgNW networks involves the modulation of the electrical transportation pathway by the SWCNTs through the SWCNT-AgNW junctions, which results in a relatively lower junction resistance than the NW-NW junction in the network film. In addition, we propose that good contact and Fermi level matching between AgNWs and modified SWCNTs lead to the modulation of the current pathway. The SWCNT-induced stabilisation of the AgNW networks was also demonstrated by irradiating the film with microwaves. The development of the high-throughput fabrication technology provides a robust and scalable strategy for realizing high-performance flexible transparent conductor films.

  2. Hierarchically Coordinated Power Management for Target Tracking in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Feng Juan

    2013-10-01

    Full Text Available Energy efficiency is very important for wireless sensor networks (WSNs since sensor nodes have a limited energy supply from a battery. So far, a lot research has focused on this issue, while less emphasis has been placed on the adaptive sleep time for each node with a consideration for the application constraints. In this paper, we propose a hierarchically coordinated power management (HCPM approach, which both addresses the energy conservation problem and reduces the packet forwarding delay for target tracking WSNs based on a virtual‐grid‐based network structure. We extend the network lifetime by adopting an adaptive sleep scheduling scheme that combines the local power management (PM and the adaptive coordinate PM strategies to schedule the activities of the sensor nodes at the surveillance stage. Furthermore, we propose a hierarchical structure for the tracking stage. Experimental results show that the proposed approach has a greater capability of extending the network lifetime while maintaining a short transmission delay when compared with the protocol which does not consider the application constraints in target tracking sensor networks.

  3. A Vision of China-Arab Interconnection Transmission Network Planning with UHVDC Technology

    Science.gov (United States)

    Wu, Dan; Liu, Yujun; Yin, Hongyuan; Xu, Qingshan; Xu, Xiaohui; Ding, Maosheng

    2017-05-01

    Developments in ultra-high-voltage (UHV) power systems and clean energy technologies are paving the way towards unprecedented energy market globalization. In accordance with the international community’s enthusiasm for building up the Global Energy Internet, this paper focuses on the feasibility of transmitting large-size electricity from northwest China to Arab world through a long-distance transnational power interconnection. The complete investigations on the grids of both the sending-end and receiving-end is firstly presented. Then system configuration of the transmission scheme and corridor route planning is proposed with UHVDC technology. Based on transmission costs’ investigation about similar transmission projects worldwide, the costs of the proposed transmission scheme are estimated through adjustment factors which represent differences in latitude, topography and economy. The proposed China-Arab transmission line sheds light on the prospects of power cooperation and resource sharing between China and Arab states, and appeals for more emphasis on green energy concentrated power interconnections from a global perspective.

  4. Hierarchical differentiation of myeloid progenitors is encoded in the transcription factor network.

    Science.gov (United States)

    Krumsiek, Jan; Marr, Carsten; Schroeder, Timm; Theis, Fabian J

    2011-01-01

    Hematopoiesis is an ideal model system for stem cell biology with advanced experimental access. A systems view on the interactions of core transcription factors is important for understanding differentiation mechanisms and dynamics. In this manuscript, we construct a Boolean network to model myeloid differentiation, specifically from common myeloid progenitors to megakaryocytes, erythrocytes, granulocytes and monocytes. By interpreting the hematopoietic literature and translating experimental evidence into Boolean rules, we implement binary dynamics on the resulting 11-factor regulatory network. Our network contains interesting functional modules and a concatenation of mutual antagonistic pairs. The state space of our model is a hierarchical, acyclic graph, typifying the principles of myeloid differentiation. We observe excellent agreement between the steady states of our model and microarray expression profiles of two different studies. Moreover, perturbations of the network topology correctly reproduce reported knockout phenotypes in silico. We predict previously uncharacterized regulatory interactions and alterations of the differentiation process, and line out reprogramming strategies.

  5. Spectral dimensions of hierarchical scale-free networks with weighted shortcuts

    Science.gov (United States)

    Hwang, S.; Yun, C.-K.; Lee, D.-S.; Kahng, B.; Kim, D.

    2010-11-01

    Spectral dimensions have been widely used to understand transport properties on regular and fractal lattices. However, they have received little attention with regard to complex networks such as scale-free and small-world networks. Here, we study the spectral dimension and the return-to-origin probability of random walks on hierarchical scale-free networks, which can be either fractal or nonfractal depending on the weight of the shortcuts. Applying the renormalization-group (RG) approach to a Gaussian model, we obtain the exact spectral dimension. While the spectral dimension varies between 1 and 2 for the fractal case, it remains at 2, independent of the variation in the network structure, for the nonfractal case. The crossover behavior between the two cases is studied by carrying out the RG flow analysis. The analytical results are confirmed by simulation results and their implications for the architecture of complex systems are discussed.

  6. Hierarchical Location Service with Prediction in Mobile Ad-Hoc Networks

    CERN Document Server

    Amar, Ebtisam; Renault, Éric; 10.5121/ijcnc.2010.2204

    2010-01-01

    Position-based routing protocols take advantage of location information to perform a stateless and efficient routing. To enable position-based routing, a node must be able to discover the location of the messages' destination node. This task is typically accomplished by a location service. Recently, several location service protocols have been developed for ad hoc networks. In this paper we propose a novel location service called PHLS: Predictive Hierarchical Location Service. In PHLS, the entire network is partitioned into a hierarchy of smaller and smaller regions. For each node, one node in each-level region of the hierarchy is chosen as its local location server. When the network initializes or when a node attaches the network, nodes contact their local location server with their current location information (ie. position and velocity). Then, they only need to update their location server when they move away from their current region. Finally, nodes query their location servers and get the exact or predic...

  7. TWO-LEVEL HIERARCHICAL COORDINATION QUEUING METHOD FOR TELECOMMUNICATION NETWORK NODES

    Directory of Open Access Journals (Sweden)

    M. V. Semenyaka

    2014-07-01

    Full Text Available The paper presents hierarchical coordination queuing method. Within the proposed method a queuing problem has been reduced to optimization problem solving that was presented as two-level hierarchical structure. The required distribution of flows and bandwidth allocation was calculated at the first level independently for each macro-queue; at the second level solutions obtained on lower level for each queue were coordinated in order to prevent probable network link overload. The method of goal coordination has been determined for multilevel structure managing, which makes it possible to define the order for consideration of queue cooperation restrictions and calculation tasks distribution between levels of hierarchy. Decisions coordination was performed by the method of Lagrange multipliers. The study of method convergence has been carried out by analytical modeling.

  8. Secure Session Mobility using Hierarchical Authentication Key Management in Next Generation Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Zubair

    2014-05-01

    Full Text Available In this paper we propose a novel authentication mechanism for session mobility in Next Generation Networks named as Hierarchical Authentication Key Management (HAKM. The design objectives of HAKM are twofold: i to minimize the authentication latency in NGNs; ii to provide protection against an assortment of attacks such as denial-of-service attacks, man-in-the-middle attacks, guessing attacks, and capturing node attacks. In order to achieve these objectives, we combine Session Initiation Protocol (SIP with Hierarchical Mobile IPv6 (HMIPv6 to perform local authentication for session mobility. The concept of group keys and pairwise keys with one way hash function is employed to make HAKM vigorous against the aforesaid attacks. The performance analysis and numerical results demonstrate that HAKM outperforms the existing approaches in terms of latency and protection against the abovementioned attacks

  9. A Hybrid P2P Overlay Network for Non-strictly Hierarchically Categorized Content

    Science.gov (United States)

    Wan, Yi; Asaka, Takuya; Takahashi, Tatsuro

    In P2P content distribution systems, there are many cases in which the content can be classified into hierarchically organized categories. In this paper, we propose a hybrid overlay network design suitable for such content called Pastry/NSHCC (Pastry for Non-Strictly Hierarchically Categorized Content). The semantic information of classification hierarchies of the content can be utilized regardless of whether they are in a strict tree structure or not. By doing so, the search scope can be restrained to any granularity, and the number of query messages also decreases while maintaining keyword searching availability. Through simulation, we showed that the proposed method provides better performance and lower overhead than unstructured overlays exploiting the same semantic information.

  10. Coevolution of information processing and topology in hierarchical adaptive random Boolean networks

    Science.gov (United States)

    Górski, Piotr J.; Czaplicka, Agnieszka; Hołyst, Janusz A.

    2016-02-01

    Random Boolean Networks (RBNs) are frequently used for modeling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive random Boolean Network (HARBN) as a system consisting of distinct adaptive RBNs (ARBNs) - subnetworks - connected by a set of permanent interlinks. We investigate mean node information, mean edge information as well as mean node degree. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. The main natural feature of ARBNs, i.e. their adaptability, is preserved in HARBNs and they evolve towards critical configurations which is documented by power law distributions of network attractor lengths. The mean information processed by a single node or a single link increases with the number of interlinks added to the system. The mean length of network attractors and the mean steady-state connectivity possess minima for certain specific values of the quotient between the density of interlinks and the density of all links in networks. It means that the modular network displays extremal values of its observables when subnetworks are connected with a density a few times lower than a mean density of all links.

  11. Bifurcation analysis on a generalized recurrent neural network with two interconnected three-neuron components

    Energy Technology Data Exchange (ETDEWEB)

    Hajihosseini, Amirhossein, E-mail: hajihosseini@khayam.ut.ac.ir [School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran 19395-5746 (Iran, Islamic Republic of); Center of Excellence in Biomathematics, School of Mathematics, Statistics and Computer Science, University of Tehran, Tehran 14176-14411 (Iran, Islamic Republic of); Maleki, Farzaneh, E-mail: farzanmaleki83@khayam.ut.ac.ir [School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran 14176-14411 (Iran, Islamic Republic of); School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran 19395-5746 (Iran, Islamic Republic of); Center of Excellence in Biomathematics, School of Mathematics, Statistics and Computer Science, University of Tehran, Tehran 14176-14411 (Iran, Islamic Republic of); Rokni Lamooki, Gholam Reza, E-mail: rokni@khayam.ut.ac.ir [School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran 14176-14411 (Iran, Islamic Republic of); School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran 19395-5746 (Iran, Islamic Republic of); Center of Excellence in Biomathematics, School of Mathematics, Statistics and Computer Science, University of Tehran, Tehran 14176-14411 (Iran, Islamic Republic of)

    2011-11-15

    Highlights: > We construct a recurrent neural network by generalizing a specific n-neuron network. > Several codimension 1 and 2 bifurcations take place in the newly constructed network. > The newly constructed network has higher capabilities to learn periodic signals. > The normal form theorem is applied to investigate dynamics of the network. > A series of bifurcation diagrams is given to support theoretical results. - Abstract: A class of recurrent neural networks is constructed by generalizing a specific class of n-neuron networks. It is shown that the newly constructed network experiences generic pitchfork and Hopf codimension one bifurcations. It is also proved that the emergence of generic Bogdanov-Takens, pitchfork-Hopf and Hopf-Hopf codimension two, and the degenerate Bogdanov-Takens bifurcation points in the parameter space is possible due to the intersections of codimension one bifurcation curves. The occurrence of bifurcations of higher codimensions significantly increases the capability of the newly constructed recurrent neural network to learn broader families of periodic signals.

  12. Sustainable Energy Solutions Task 1.0: Networked Monitoring and Control of Small Interconnected Wind Energy Systems

    Energy Technology Data Exchange (ETDEWEB)

    edu, Janet. twomey@wichita. [Wichita State Univ., KS (United States)

    2010-04-30

    This report presents accomplishments, results, and future work for one task of five in the Wichita State University Sustainable Energy Solutions Project: To develop a scale model laboratory distribution system for research into questions that arise from networked control and monitoring of low-wind energy systems connected to the AC distribution system. The lab models developed under this task are located in the Electric Power Quality Lab in the Engineering Research Building on the Wichita State University campus. The lab system consists of four parts: 1. A doubly-fed induction generator 2. A wind turbine emulator 3. A solar photovoltaic emulator, with battery energy storage 4. Distribution transformers, lines, and other components, and wireless and wired communications and control These lab elements will be interconnected and will function together to form a complete testbed for distributed resource monitoring and control strategies and smart grid applications testing. Development of the lab system will continue beyond this project.

  13. Integration of relational and hierarchical network information for protein function prediction

    Directory of Open Access Journals (Sweden)

    Jiang Xiaoyu

    2008-08-01

    Full Text Available Abstract Background In the current climate of high-throughput computational biology, the inference of a protein's function from related measurements, such as protein-protein interaction relations, has become a canonical task. Most existing technologies pursue this task as a classification problem, on a term-by-term basis, for each term in a database, such as the Gene Ontology (GO database, a popular rigorous vocabulary for biological functions. However, ontology structures are essentially hierarchies, with certain top to bottom annotation rules which protein function predictions should in principle follow. Currently, the most common approach to imposing these hierarchical constraints on network-based classifiers is through the use of transitive closure to predictions. Results We propose a probabilistic framework to integrate information in relational data, in the form of a protein-protein interaction network, and a hierarchically structured database of terms, in the form of the GO database, for the purpose of protein function prediction. At the heart of our framework is a factorization of local neighborhood information in the protein-protein interaction network across successive ancestral terms in the GO hierarchy. We introduce a classifier within this framework, with computationally efficient implementation, that produces GO-term predictions that naturally obey a hierarchical 'true-path' consistency from root to leaves, without the need for further post-processing. Conclusion A cross-validation study, using data from the yeast Saccharomyces cerevisiae, shows our method offers substantial improvements over both standard 'guilt-by-association' (i.e., Nearest-Neighbor and more refined Markov random field methods, whether in their original form or when post-processed to artificially impose 'true-path' consistency. Further analysis of the results indicates that these improvements are associated with increased predictive capabilities (i.e., increased

  14. A Hierarchical Energy Efficient Reliable Transport Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Prabhudutta Mohanty

    2014-12-01

    Full Text Available The two important requirements for many Wireless Senor Networks (WSNs are prolonged network lifetime and end-to-end reliability. The sensor nodes consume more energy during data transmission than the data sensing. In WSN, the redundant data increase the energy consumption, latency and reduce reliability during data transmission. Therefore, it is important to support energy efficient reliable data transport in WSNs. In this paper, we present a Hierarchical Energy Efficient Reliable Transport Protocol (HEERTP for the data transmission within the WSN. This protocol maximises the network lifetime by controlling the redundant data transmission with the co-ordination of Base Station (BS. The proposed protocol also achieves end-to-end reliability using a hop-by-hop acknowledgement scheme. We evaluate the performance of the proposed protocol through simulation. The simulation results reveal that our proposed protocol achieves better performance in terms of energy efficiency, latency and reliability than the existing protocols.

  15. A Hierarchical Approach to Real-time Activity Recognition in Body Sensor Networks

    DEFF Research Database (Denmark)

    Wang, Liang; Gu, Tao; Tao, Xianping

    2012-01-01

    algorithm to detect gestures at the sensor node level, and then propose a pattern based real-time algorithm to recognize complex, high-level activities at the portable device level. We evaluate our algorithms over a real-world dataset. The results show that the proposed system not only achieves good......Real-time activity recognition in body sensor networks is an important and challenging task. In this paper, we propose a real-time, hierarchical model to recognize both simple gestures and complex activities using a wireless body sensor network. In this model, we rst use a fast and lightweight...... performance (an average utility of 0.81, an average accuracy of 82.87%, and an average real-time delay of 5.7 seconds), but also signicantly reduces the network communication cost by 60.2%....

  16. Toughening mystery of natural rubber deciphered by double network incorporating hierarchical structures.

    Science.gov (United States)

    Zhou, Weiming; Li, Xiangyang; Lu, Jie; Huang, Ningdong; Chen, Liang; Qi, Zeming; Li, Liangbin; Liang, Haiyi

    2014-12-16

    As an indispensible material for modern society, natural rubber possesses peerless mechanical properties such as strength and toughness over its artificial analogues, which remains a mystery. Intensive experimental and theoretical investigations have revealed the self-enhancement of natural rubber due to strain-induced crystallization. However a rigorous model on the self-enhancement, elucidating natural rubber's extraordinary mechanical properties, is obscured by deficient understanding of the local hierarchical structure under strain. With spatially resolved synchrotron radiation micro-beam scanning X-ray diffraction we discover weak oscillation in distributions of strain-induced crystallinity around crack tip for stretched natural rubber film, demonstrating a soft-hard double network structure. The fracture energy enhancement factor obtained by utilizing the double network model indicates an enhancement of toughness by 3 orders. It's proposed that upon stretching spontaneously developed double network structures integrating hierarchy at multi length-scale in natural rubber play an essential role in its remarkable mechanical performance.

  17. Decentralized Cooperative TOA/AOA Target Tracking for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chih-Yu Wen

    2012-11-01

    Full Text Available This paper proposes a distributed method for cooperative target tracking in hierarchical wireless sensor networks. The concept of leader-based information processingis conducted to achieve object positioning, considering a cluster-based network topology. Random timers and local information are applied to adaptively select a sub-cluster for thelocalization task. The proposed energy-efficient tracking algorithm allows each sub-clustermember to locally estimate the target position with a Bayesian filtering framework and a neural networking model, and further performs estimation fusion in the leader node with the covariance intersection algorithm. This paper evaluates the merits and trade-offs of the protocol design towards developing more efficient and practical algorithms for objectposition estimation. 

  18. Decentralized cooperative TOA/AOA target tracking for hierarchical wireless sensor networks.

    Science.gov (United States)

    Chen, Ying-Chih; Wen, Chih-Yu

    2012-11-08

    This paper proposes a distributed method for cooperative target tracking in hierarchical wireless sensor networks. The concept of leader-based information processing is conducted to achieve object positioning, considering a cluster-based network topology. Random timers and local information are applied to adaptively select a sub-cluster for the localization task. The proposed energy-efficient tracking algorithm allows each sub-cluster member to locally estimate the target position with a Bayesian filtering framework and a neural networking model, and further performs estimation fusion in the leader node with the covariance intersection algorithm. This paper evaluates the merits and trade-offs of the protocol design towards developing more efficient and practical algorithms for object position estimation.

  19. Structure function relationship in complex brain networks expressed by hierarchical synchronization

    Science.gov (United States)

    Zhou, Changsong; Zemanová, Lucia; Zamora-López, Gorka; Hilgetag, Claus C.; Kurths, Jürgen

    2007-06-01

    The brain is one of the most complex systems in nature, with a structured complex connectivity. Recently, large-scale corticocortical connectivities, both structural and functional, have received a great deal of research attention, especially using the approach of complex network analysis. Understanding the relationship between structural and functional connectivity is of crucial importance in neuroscience. Here we try to illuminate this relationship by studying synchronization dynamics in a realistic anatomical network of cat cortical connectivity. We model the nodes (cortical areas) by a neural mass model (population model) or by a subnetwork of interacting excitable neurons (multilevel model). We show that if the dynamics is characterized by well-defined oscillations (neural mass model and subnetworks with strong couplings), the synchronization patterns are mainly determined by the node intensity (total input strengths of a node) and the detailed network topology is rather irrelevant. On the other hand, the multilevel model with weak couplings displays more irregular, biologically plausible dynamics, and the synchronization patterns reveal a hierarchical cluster organization in the network structure. The relationship between structural and functional connectivity at different levels of synchronization is explored. Thus, the study of synchronization in a multilevel complex network model of cortex can provide insights into the relationship between network topology and functional organization of complex brain networks.

  20. Interconnection policy: a theoretical survey

    Directory of Open Access Journals (Sweden)

    César Mattos

    2003-01-01

    Full Text Available This article surveys the theoretical foundations of interconnection policy. The requirement of an interconnection policy should not be taken for granted in all circumstances, even considering the issue of network externalities. On the other hand, when it is required, an encompassing interconnection policy is usually justified. We provide an overview of the theory on interconnection pricing that results in several different prescriptions depending on which problem the regulator aims to address. We also present a survey on the literature on two-way interconnection.

  1. A method for identifying hierarchical sub-networks / modules and weighting network links based on their similarity in sub-network / module affiliation

    Directory of Open Access Journals (Sweden)

    WenJun Zhang

    2016-06-01

    Full Text Available Some networks, including biological networks, consist of hierarchical sub-networks / modules. Based on my previous study, in present study a method for both identifying hierarchical sub-networks / modules and weighting network links is proposed. It is based on the cluster analysis in which between-node similarity in sets of adjacency nodes is used. Two matrices, linkWeightMat and linkClusterIDs, are achieved by using the algorithm. Two links with both the same weight in linkWeightMat and the same cluster ID in linkClusterIDs belong to the same sub-network / module. Two links with the same weight in linkWeightMat but different cluster IDs in linkClusterIDs belong to two sub-networks / modules at the same hirarchical level. However, a link with an unique cluster ID in linkClusterIDs does not belong to any sub-networks / modules. A sub-network / module of the greater weight is the more connected sub-network / modules. Matlab codes of the algorithm are presented.

  2. A proxy design to leverage the interconnection of CoAP Wireless Sensor Networks with Web applications.

    Science.gov (United States)

    Ludovici, Alessandro; Calveras, Anna

    2015-01-09

    In this paper, we present the design of a Constrained Application Protocol (CoAP) proxy able to interconnect Web applications based on Hypertext Transfer Protocol (HTTP) and WebSocket with CoAP based Wireless Sensor Networks. Sensor networks are commonly used to monitor and control physical objects or environments. Smart Cities represent applications of such a nature. Wireless Sensor Networks gather data from their surroundings and send them to a remote application. This data flow may be short or long lived. The traditional HTTP long-polling used by Web applications may not be adequate in long-term communications. To overcome this problem, we include the WebSocket protocol in the design of the CoAP proxy. We evaluate the performance of the CoAP proxy in terms of latency and memory consumption. The tests consider long and short-lived communications. In both cases, we evaluate the performance obtained by the CoAP proxy according to the use of WebSocket and HTTP long-polling.

  3. A Proxy Design to Leverage the Interconnection of CoAP Wireless Sensor Networks with Web Applications

    Directory of Open Access Journals (Sweden)

    Alessandro Ludovici

    2015-01-01

    Full Text Available In this paper, we present the design of a Constrained Application Protocol (CoAP proxy able to interconnect Web applications based on Hypertext Transfer Protocol (HTTP and WebSocket with CoAP based Wireless Sensor Networks. Sensor networks are commonly used to monitor and control physical objects or environments. Smart Cities represent applications of such a nature. Wireless Sensor Networks gather data from their surroundings and send them to a remote application. This data flow may be short or long lived. The traditional HTTP long-polling used by Web applications may not be adequate in long-term communications. To overcome this problem, we include the WebSocket protocol in the design of the CoAP proxy. We evaluate the performance of the CoAP proxy in terms of latency and memory consumption. The tests consider long and short-lived communications. In both cases, we evaluate the performance obtained by the CoAP proxy according to the use of WebSocket and HTTP long-polling.

  4. A Proxy Design to Leverage the Interconnection of CoAP Wireless Sensor Networks with Web Applications

    Science.gov (United States)

    Ludovici, Alessandro; Calveras, Anna

    2015-01-01

    In this paper, we present the design of a Constrained Application Protocol (CoAP) proxy able to interconnect Web applications based on Hypertext Transfer Protocol (HTTP) and WebSocket with CoAP based Wireless Sensor Networks. Sensor networks are commonly used to monitor and control physical objects or environments. Smart Cities represent applications of such a nature. Wireless Sensor Networks gather data from their surroundings and send them to a remote application. This data flow may be short or long lived. The traditional HTTP long-polling used by Web applications may not be adequate in long-term communications. To overcome this problem, we include the WebSocket protocol in the design of the CoAP proxy. We evaluate the performance of the CoAP proxy in terms of latency and memory consumption. The tests consider long and short-lived communications. In both cases, we evaluate the performance obtained by the CoAP proxy according to the use of WebSocket and HTTP long-polling. PMID:25585107

  5. Hierarchical neural network model of the visual system determining figure/ground relation

    Science.gov (United States)

    Kikuchi, Masayuki

    2017-07-01

    One of the most important functions of the visual perception in the brain is figure/ground interpretation from input images. Figural region in 2D image corresponding to object in 3D space are distinguished from background region extended behind the object. Previously the author proposed a neural network model of figure/ground separation constructed on the standpoint that local geometric features such as curvatures and outer angles at corners are extracted and propagated along input contour in a single layer network (Kikuchi & Akashi, 2001). However, such a processing principle has the defect that signal propagation requires manyiterations despite the fact that actual visual system determines figure/ground relation within the short period (Zhou et al., 2000). In order to attain speed-up for determining figure/ground, this study incorporates hierarchical architecture into the previous model. This study confirmed the effect of the hierarchization as for the computation time by simulation. As the number of layers increased, the required computation time reduced. However, such speed-up effect was saturatedas the layers increased to some extent. This study attempted to explain this saturation effect by the notion of average distance between vertices in the area of complex network, and succeeded to mimic the saturation effect by computer simulation.

  6. Hierarchical self-assembly of a striped gyroid formed by threaded chiral mesoscale networks

    DEFF Research Database (Denmark)

    Kirkensgaard, Jacob Judas Kain; Evans, Myfanwy; de Campo, Lilliana;

    2014-01-01

    the gyroid film are densely packed and contain either graphitic hcb nets (chicken wire) or srs nets, forming convoluted intergrowths of multiple nets. Furthermore, each net is ideally a single chiral enantiomer, induced by the gyroid architecture. However, the numerical simulations result in defect......Numerical simulations reveal a family of hierarchical and chiral multicontinuous network structures self-assembled from a melt blend of Y-shaped ABC and ABD three-miktoarm star terpolymers, constrained to have equal-sized A/B and C/D chains, respectively. The C and D majority domains within...

  7. A hierarchical virtual backbone construction protocol for mobile ad hoc networks

    Directory of Open Access Journals (Sweden)

    Bharti Sharma

    2016-07-01

    Full Text Available We propose a hierarchical backbone construction protocol for mobile ad hoc networks. Our protocol is based on the idea of using an efficient extrema finding method to create clusters comprising the nodes that are within certain prespecified wireless hop distance. Afterward, we apply our ‘diameter’ algorithm among clusters to identify the dominating nodes that are, finally, connected via multi-hop virtual links to construct the backbone. We present the analytic as well as simulation study of our algorithm and also a method for the dynamic maintenance of constructed backbone. In the end, we illustrate the use of the virtual backbone with the help of an interesting application.

  8. On Hierarchical Extensions of Large-Scale 4-regular Grid Network Structures

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Patel, A.; Knudsen, Thomas Phillip

    It is studied how the introduction of ordered hierarchies in 4-regular grid network structures decreses distances remarkably, while at the same time allowing for simple topological routing schemes. Both meshes and tori are considered; in both cases non-hierarchical structures have power law......, and it is shown that while they allow for more flexibility in design and construction of structures supporting topological routing, their performances are comparable to the performance of the perfect square mesh. Finally suggestions for further research within the field are given....

  9. On Hierarchical Extensions of Large-Scale 4-regular Grid Network Structures

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Patel, A.; Knudsen, Thomas Phillip

    2004-01-01

    It is studied how the introduction of ordered hierarchies in 4-regular grid network structures decreases distances remarkably, while at the same time allowing for simple topological routing schemes. Both meshes and tori are considered; in both cases non-hierarchical structures have power law......, and it is shown that while they allow for more flexibility in design and construction of structures supporting topological routing, their performances are comparable to the performance of the perfect square mesh. Finally suggestions for further research within the field are given....

  10. Hierarchical Self-healing Key Distribution for Heterogeneous Wireless Sensor Networks

    Science.gov (United States)

    Yang, Yanjiang; Zhou, Jianying; Deng, Robert H.; Bao, Feng

    Self-healing group key distribution aims to achieve robust key distribution over lossy channels in wireless sensor networks (WSNs). However, all existing self-healing group key distribution schemes in the literature consider homogenous WSNs which are known to be unscalable. Heterogeneous WSNs have better scalability and performance than homogenous ones. We are thus motivated to study hierarchial self-healing group key distribution, tailored to the heterogeneous WSN architecture. In particular, we revisit and adapt Dutta et al.’s model to the setting of hierarchical self-healing group key distribution, and propose a concrete scheme that achieves computational security and high efficiency.

  11. Hierarchical organization of functional connectivity in the mouse brain: a complex network approach

    Science.gov (United States)

    Bardella, Giampiero; Bifone, Angelo; Gabrielli, Andrea; Gozzi, Alessandro; Squartini, Tiziano

    2016-08-01

    This paper represents a contribution to the study of the brain functional connectivity from the perspective of complex networks theory. More specifically, we apply graph theoretical analyses to provide evidence of the modular structure of the mouse brain and to shed light on its hierarchical organization. We propose a novel percolation analysis and we apply our approach to the analysis of a resting-state functional MRI data set from 41 mice. This approach reveals a robust hierarchical structure of modules persistent across different subjects. Importantly, we test this approach against a statistical benchmark (or null model) which constrains only the distributions of empirical correlations. Our results unambiguously show that the hierarchical character of the mouse brain modular structure is not trivially encoded into this lower-order constraint. Finally, we investigate the modular structure of the mouse brain by computing the Minimal Spanning Forest, a technique that identifies subnetworks characterized by the strongest internal correlations. This approach represents a faster alternative to other community detection methods and provides a means to rank modules on the basis of the strength of their internal edges.

  12. Evaluating the Performance of Fast Handover for Hierarchical MIPv6 in Cellular Networks

    Directory of Open Access Journals (Sweden)

    Li Jun Zhang

    2008-06-01

    Full Text Available Next-Generation Wireless Networks (NGWNs present an all-IP-based architecture integrating existing cellular networks with Wireless Local Area Networks (WLANs, Wireless Metropolitan Area Networks (WMANs, ad hoc networks, Bluetooth, etc. This makes mobility management an important issue for users roaming among these networks/systems. On one hand, intelligent schemes need to be devised to empower mobile users to benefit from the IP-based technology. On the other hand, new solutions are required to take into account global roaming among various radio access technologies and support of real-time multimedia services. This paper presents a comprehensive performance analysis of Fast handover for Hierarchical Mobile IPv6 (F-HMIPv6 using the fluid-flow and randomwalk mobility models. Location update cost, packet delivery cost and total cost functions are formulated based on the proposed analytical models. We investigate the impact of several wireless system factors such as user velocity, user density, mobility domain size, session-to-mobility ratio on these costs, and present some numerical results.

  13. Mobile Agent Based Hierarchical Intrusion Detection System in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Surraya Khanum

    2012-01-01

    Full Text Available Security mechanism is a fundamental requirement of wireless networks in general and Wireless Sensor Networks (WSN in particular. Therefore, it is necessary that this security concern must be articulate right from the beginning of the network design and deployment. WSN needs strong security mechanism as it is usually deployed in a critical, hostile and sensitive environment where human labour is usually not involved. However, due to inbuilt resource and computing restriction, security in WSN needs a special consideration. Traditional security techniques such as encryption, VPN, authentication and firewalls cannot be directly applied to WSN as it provides defence only against external threats. The existing literature shows that there seems an inverse relationship between strong security mechanism and efficient network resource utilization. In this research article, we have proposed a Mobile Agent Based Hierarchical Intrusion Detection System (MABHIDS for WSN. The Proposed scheme performs two levels of intrusion detection by utilizing minimum possible network resources. Our proposed idea enhance network lifetime by reducing the work load on Cluster Head (CH and it also provide enhanced level of security in WSN.

  14. Hierarchical Supervisor and Agent Routing Algorithm in LEO/MEO Double-layered Optical Satellite Network

    Science.gov (United States)

    Li, Yongjun; Zhao, Shanghong

    2016-09-01

    A novel routing algorithm (Hierarchical Supervisor and Agent Routing Algorithm, HSARA) for LEO/MEO (low earth orbit/medium earth orbit) double-layered optical satellite network is brought forward. The so-called supervisor (MEO satellite) is designed for failure recovery and network management. LEO satellites are grouped according to the virtual managed field of MEO which is different from coverage area of MEO satellite in RF satellite network. In each LEO group, one LEO satellite which has maximal persistent link with its supervisor is called the agent. A LEO group is updated when this optical inter-orbit links between agent LEO satellite and the corresponding MEO satellite supervisor cuts off. In this way, computations of topology changes and LEO group updating can be decreased. Expense of routing is integration of delay and wavelength utilization. HSARA algorithm simulations are implemented and the results are as follows: average network delay of HSARA can reduce 21 ms and 31.2 ms compared with traditional multilayered satellite routing and single-layer LEO satellite respectively; LEO/MEO double-layered optical satellite network can cover polar region which cannot be covered by single-layered LEO satellite and throughput is 1% more than that of single-layered LEO satellite averagely. Therefore, exact global coverage can be achieved with this double-layered optical satellite network.

  15. Hierarchical alteration of brain structural and functional networks in female migraine sufferers.

    Directory of Open Access Journals (Sweden)

    Jixin Liu

    Full Text Available BACKGROUND: Little is known about the changes of brain structural and functional connectivity networks underlying the pathophysiology in migraine. We aimed to investigate how the cortical network reorganization is altered by frequent cortical overstimulation associated with migraine. METHODOLOGY/PRINCIPAL FINDINGS: Gray matter volumes and resting-state functional magnetic resonance imaging signal correlations were employed to construct structural and functional networks between brain regions in 43 female patients with migraine (PM and 43 gender-matched healthy controls (HC by using graph theory-based approaches. Compared with the HC group, the patients showed abnormal global topology in both structural and functional networks, characterized by higher mean clustering coefficients without significant change in the shortest absolute path length, which indicated that the PM lost optimal topological organization in their cortical networks. Brain hubs related to pain-processing revealed abnormal nodal centrality in both structural and functional networks, including the precentral gyrus, orbital part of the inferior frontal gyrus, parahippocampal gyrus, anterior cingulate gyrus, thalamus, temporal pole of the middle temporal gyrus and the inferior parietal gyrus. Negative correlations were found between migraine duration and regions with abnormal centrality. Furthermore, the dysfunctional connections in patients' cortical networks formed into a connected component and three dysregulated modules were identified involving pain-related information processing and motion-processing visual networks. CONCLUSIONS: Our results may reflect brain alteration dynamics resulting from migraine and suggest that long-term and high-frequency headache attacks may cause both structural and functional connectivity network reorganization. The disrupted information exchange between brain areas in migraine may be reshaped into a hierarchical modular structure progressively.

  16. Optical interconnects

    CERN Document Server

    Chen, Ray T

    2006-01-01

    This book describes fully embedded board level optical interconnect in detail including the fabrication of the thin-film VCSEL array, its characterization, thermal management, the fabrication of optical interconnection layer, and the integration of devices on a flexible waveguide film. All the optical components are buried within electrical PCB layers in a fully embedded board level optical interconnect. Therefore, we can save foot prints on the top real estate of the PCB and relieve packaging difficulty reduced by separating fabrication processes. To realize fully embedded board level optical

  17. Analysis of Hierarchical Diff-EDF Schedulability over Heterogeneous Real-Time Packet Networks

    Directory of Open Access Journals (Sweden)

    M. Saleh

    2007-01-01

    Full Text Available Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees with Earliest Deadline First (EDF as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First, which can meet the real-time needs of these applications while continuing to provide best effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. To examine our proposed scheduler model, we introduced our attempt to provide an exact analytical solution. The attempt showed that the solution was apparently very complicated due to the high interdependence between the system queues' service. Hence, the use of simulation techniques seems inevitable. The simulation results showed that the Hierarchical Diff-EDF achieved the minimum packet average delay when compared with both EDF and Diff-EDF schedulers.

  18. Hierarchical structures of correlations networks among Turkey’s exports and imports by currencies

    Science.gov (United States)

    Kocakaplan, Yusuf; Deviren, Bayram; Keskin, Mustafa

    2012-12-01

    We have examined the hierarchical structures of correlations networks among Turkey’s exports and imports by currencies for the 1996-2010 periods, using the concept of a minimal spanning tree (MST) and hierarchical tree (HT) which depend on the concept of ultrametricity. These trees are useful tools for understanding and detecting the global structure, taxonomy and hierarchy in financial markets. We derived a hierarchical organization and build the MSTs and HTs during the 1996-2001 and 2002-2010 periods. The reason for studying two different sub-periods, namely 1996-2001 and 2002-2010, is that the Euro (EUR) came into use in 2001, and some countries have made their exports and imports with Turkey via the EUR since 2002, and in order to test various time-windows and observe temporal evolution. We have carried out bootstrap analysis to associate a value of the statistical reliability to the links of the MSTs and HTs. We have also used the average linkage cluster analysis (ALCA) to observe the cluster structure more clearly. Moreover, we have obtained the bidimensional minimal spanning tree (BMST) due to economic trade being a bidimensional problem. From the structural topologies of these trees, we have identified different clusters of currencies according to their proximity and economic ties. Our results show that some currencies are more important within the network, due to a tighter connection with other currencies. We have also found that the obtained currencies play a key role for Turkey’s exports and imports and have important implications for the design of portfolio and investment strategies.

  19. Fixed latency on-chip interconnect for hardware spiking neural network architectures

    NARCIS (Netherlands)

    Pande, Sandeep; Morgan, Fearghal; Smit, Gerard; Bruintjes, Tom; Rutgers, Jochem; Cawley, Seamus; Harkin, Jim; McDaid, Liam

    2013-01-01

    Information in a Spiking Neural Network (SNN) is encoded as the relative timing between spikes. Distortion in spike timings can impact the accuracy of SNN operation by modifying the precise firing time of neurons within the SNN. Maintaining the integrity of spike timings is crucial for reliable oper

  20. Gel-based composite polymer electrolytes with novel hierarchical mesoporous silica network for lithium batteries

    Energy Technology Data Exchange (ETDEWEB)

    Wang Xiaoliang; Cai Qiang [Department of Materials Science and Engineering, and State Key Laboratory of New Ceramics and Fine Processing, Tsinghua University, Beijing 100084 (China); Fan Lizhen [School of Materials Science and Engineering, University of Science and Technology Beijing, Beijing 100083 (China); Hua Tao; Lin Yuanhua [Department of Materials Science and Engineering, and State Key Laboratory of New Ceramics and Fine Processing, Tsinghua University, Beijing 100084 (China); Nan Cewen [Department of Materials Science and Engineering, and State Key Laboratory of New Ceramics and Fine Processing, Tsinghua University, Beijing 100084 (China)], E-mail: cwnan@tsinghua.edu.cn

    2008-11-15

    In the present work, novel gel-based composite polymer electrolytes for lithium batteries were prepared by introducing a hierarchical mesoporous silica network to the poly(vinylidene fluoride-hexafluoropropylene) (PVDF-HFP)-based gel electrolytes. As compared with the PVDF-HFP-based gel electrolytes with/without conventional nano-sized silica fillers, the novel electrolytes have shown more homogeneous microstructure, higher ionic conductivity and better mechanical stability, which could be caused by the strong silica network and the effective interactions among the polymer, the liquid electrolytes and the silica. Moreover, the cell with this kind of electrolytes could achieve a discharge capacity as much as 150 mAh g{sup -1} at room temperature (LiCoO{sub 2} as the cathode active material), with high Coulomb efficiency.

  1. Gel-based composite polymer electrolytes with novel hierarchical mesoporous silica network for lithium batteries

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Xiao-Liang; Cai, Qiang; Hua, Tao; Lin, Yuan-Hua; Nan, Ce-Wen [Department of Materials Science and Engineering, and State Key Laboratory of New Ceramics and Fine Processing, Tsinghua University, Beijing 100084 (China); Fan, Li-Zhen [School of Materials Science and Engineering, University of Science and Technology Beijing, Beijing 100083 (China)

    2008-11-15

    In the present work, novel gel-based composite polymer electrolytes for lithium batteries were prepared by introducing a hierarchical mesoporous silica network to the poly(vinylidene fluoride-hexafluoropropylene) (PVDF-HFP)-based gel electrolytes. As compared with the PVDF-HFP-based gel electrolytes with/without conventional nano-sized silica fillers, the novel electrolytes have shown more homogeneous microstructure, higher ionic conductivity and better mechanical stability, which could be caused by the strong silica network and the effective interactions among the polymer, the liquid electrolytes and the silica. Moreover, the cell with this kind of electrolytes could achieve a discharge capacity as much as 150 mAh g{sup -1} at room temperature (LiCoO{sub 2} as the cathode active material), with high Coulomb efficiency. (author)

  2. A New Enhanced Fast Handover Algorithm in Hierarchical Mobile IPv6 Network

    Institute of Scientific and Technical Information of China (English)

    XU Kai; JI Hong; YUE Guang-xin

    2004-01-01

    Hierarchical Mobile IPv6 (HMIPv6) can reduce the delay and the amount of signaling during handover compared with the basic mobile IPv6. However, the protocol still cannot meet the requirement for traffic that is delay sensitive, such as voice, especially in macro mobility handover. Duplicate address detection and the transmission time for the handover operation could cause high handover delay. This paper proposes a new mechanism to improve the fast handover algorithms efficiency in HMIPv6 network. And we present and analyze the performance testing for our proposal by comparing it with the traditional HMIPv6 fast handover algorithm. The results of simulation show that our scheme can reduce the handover delay much more than the traditional fast handover method for HMIPv6 network.

  3. A special hierarchical fuzzy neural-networks based reinforcement learning for multi-variables system

    Institute of Scientific and Technical Information of China (English)

    ZHANG Wen-zhi; LU Tian-sheng

    2005-01-01

    Proposes a reinforcement learning scheme based on a special Hierarchical Fuzzy Neural-Networks (HFNN) for solving complicated learning tasks in a continuous multi-variables environment. The output of the previous layer in the HFNN is no longer used as if-part of the next layer, but used only in then-part. Thus it can deal with the difficulty when the output of the previous layer is meaningless or its meaning is uncertain. The proposed HFNN has a minimal number of fuzzy rules and can successfully solve the problem of rules combination explosion and decrease the quantity of computation and memory requirement. In the learning process, two HFNN with the same structure perform fuzzy action composition and evaluation function approximation simultaneously where the parameters of neural-networks are tuned and updated on line by using gradient descent algorithm. The reinforcement learning method is proved to be correct and feasible by simulation of a double inverted pendulum system.

  4. Hierarchical Neural Networks Method for Fault Diagnosis of Large-Scale Analog Circuits

    Institute of Scientific and Technical Information of China (English)

    TAN Yanghong; HE Yigang; FANG Gefeng

    2007-01-01

    A novel hierarchical neural networks (HNNs) method for fault diagnosis of large-scale circuits is proposed. The presented techniques using neural networks(NNs) approaches require a large amount of computation for simulating various faulty component possibilities. For large scale circuits, the number of possible faults, and hence the simulations, grow rapidly and become tedious and sometimes even impractical. Some NNs are distributed to the torn sub-blocks according to the proposed torn principles of large scale circuits. And the NNs are trained in batches by different patterns in the light of the presented rules of various patterns when the DC, AC and transient responses of the circuit are available. The method is characterized by decreasing the over-lapped feasible domains of responses of circuits with tolerance and leads to better performance and higher correct classification. The methodology is illustrated by means of diagnosis examples.

  5. Robustness Results for Hierarchical Diff-EDF Scheduling upon Heterogeneous Real-Time Packet Networks

    Directory of Open Access Journals (Sweden)

    Moutaz Saleh

    2007-01-01

    Full Text Available Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees with Earliest Deadline First (EDF as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this study, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First, which can meet the real-time needs of these applications while continuing to provide best effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly.

  6. SMR-Based Adaptive Mobility Management Scheme in Hierarchical SIP Networks

    Directory of Open Access Journals (Sweden)

    KwangHee Choi

    2014-10-01

    Full Text Available In hierarchical SIP networks, paging is performed to reduce location update signaling cost for mobility management. However, the cost efficiency largely depends on each mobile node’s session-to-mobility-ratio (SMR, which is defined as a ratio of the session arrival rate to the movement rate. In this paper, we propose the adaptive mobility management scheme that can determine the policy regarding to each mobile node’s SMR. Each mobile node determines whether the paging is applied or not after comparing its SMR with the threshold. In other words, the paging is applied to a mobile node when a mobile node’s SMR is less than the threshold. Therefore, the proposed scheme provides a way to minimize signaling costs according to each mobile node’s SMR. We find out the optimal threshold through performance analysis, and show that the proposed scheme can reduce signaling cost than the existing SIP and paging schemes in hierarchical SIP networks.

  7. Hierarchical modularity in ERα transcriptional network is associated with distinct functions and implicates clinical outcomes.

    Science.gov (United States)

    Tang, Binhua; Hsu, Hang-Kai; Hsu, Pei-Yin; Bonneville, Russell; Chen, Su-Shing; Huang, Tim H-M; Jin, Victor X

    2012-01-01

    Recent genome-wide profiling reveals highly complex regulation networks among ERα and its targets. We integrated estrogen (E2)-stimulated time-series ERα ChIP-seq and gene expression data to identify the ERα-centered transcription factor (TF) hubs and their target genes, and inferred the time-variant hierarchical network structures using a Bayesian multivariate modeling approach. With its recurrent motif patterns, we determined three embedded regulatory modules from the ERα core transcriptional network. The GO analyses revealed the distinct biological function associated with each of three embedded modules. The survival analysis showed the genes in each module were able to render a significant survival correlation in breast cancer patient cohorts. In summary, our Bayesian statistical modeling and modularity analysis not only reveals the dynamic properties of the ERα-centered regulatory network and associated distinct biological functions, but also provides a reliable and effective genomic analytical approach for the analysis of dynamic regulatory network for any given TF.

  8. A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

    Directory of Open Access Journals (Sweden)

    Nabil Sabor

    2017-01-01

    Full Text Available Introducing mobility to Wireless Sensor Networks (WSNs puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs. Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

  9. Source-synchronous networks-on-chip circuit and architectural interconnect modeling

    CERN Document Server

    Mandal, Ayan; Mahapatra, Rabi

    2014-01-01

    This book describes novel methods for network-on-chip (NoC) design, using source-synchronous high-speed resonant clocks.  The authors discuss NoCs from the bottom up, providing circuit level details, before providing architectural simulations. As a result, readers will get a complete picture of how a NoC can be designed and optimized.  Using the methods described in this book, readers are enabled to design NoCs that are 5X better than existing approaches in terms of latency and throughput and can also sustain a significantly greater amount of traffic.   • Describes novel methods for high-speed network-on-chip (NoC) design; • Enables readers to understand NoC design from both circuit and architectural levels; • Provides circuit-level details of the NoC (including clocking, router design), along with a high-speed, resonant clocking style which is used in the NoC; • Includes architectural simulations of the NoC, demonstrating significantly superior performance over the state-of-the-art.

  10. Recurrent fuzzy neural network by using feedback error learning approaches for LFC in interconnected power system

    Energy Technology Data Exchange (ETDEWEB)

    Sabahi, Kamel; Teshnehlab, Mohammad; Shoorhedeli, Mahdi Aliyari [Department of Electrical Engineering, K.N. Toosi University of Technology, Intelligent System Lab, Tehran (Iran)

    2009-04-15

    In this study, a new adaptive controller based on modified feedback error learning (FEL) approaches is proposed for load frequency control (LFC) problem. The FEL strategy consists of intelligent and conventional controllers in feedforward and feedback paths, respectively. In this strategy, a conventional feedback controller (CFC), i.e. proportional, integral and derivative (PID) controller, is essential to guarantee global asymptotic stability of the overall system; and an intelligent feedforward controller (INFC) is adopted to learn the inverse of the controlled system. Therefore, when the INFC learns the inverse of controlled system, the tracking of reference signal is done properly. Generally, the CFC is designed at nominal operating conditions of the system and, therefore, fails to provide the best control performance as well as global stability over a wide range of changes in the operating conditions of the system. So, in this study a supervised controller (SC), a lookup table based controller, is addressed for tuning of the CFC. During abrupt changes of the power system parameters, the SC adjusts the PID parameters according to these operating conditions. Moreover, for improving the performance of overall system, a recurrent fuzzy neural network (RFNN) is adopted in INFC instead of the conventional neural network, which was used in past studies. The proposed FEL controller has been compared with the conventional feedback error learning controller (CFEL) and the PID controller through some performance indices. (author)

  11. Scalable Hierarchical Network Management System for Displaying Network Information in Three Dimensions

    Science.gov (United States)

    George, Jude (Inventor); Schlecht, Leslie (Inventor); McCabe, James D. (Inventor); LeKashman, John Jr. (Inventor)

    1998-01-01

    A network management system has SNMP agents distributed at one or more sites, an input output module at each site, and a server module located at a selected site for communicating with input output modules, each of which is configured for both SNMP and HNMP communications. The server module is configured exclusively for HNMP communications, and it communicates with each input output module according to the HNMP. Non-iconified, informationally complete views are provided of network elements to aid in network management.

  12. AN OPTIMUM VEHICULAR PATH ALGORITHM FOR TRAFFIC NETWORK BASED ON HIERARCHICAL SPATIAL REASONING

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Human beings' intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms.It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic,so as to improve running efficiency and suitability of shortest path algorithm for traffic network.The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path.It is argued that the shortest path,no matter distance shortest or time shortest,is usually not the favorite of drivers in practice.Some factors difficult to expect or quantify influence the drivers' choice greatly.It makes the drivers prefer choosing a less shortest,but more reliable or flexible path to travel on.The presented optimum path algorithm,in addition to the improvement of the running efficiency of shortest path algorithms up to several times,reduces the emergence of those factors,conforms to the intellection characteristic of human beings,and is more easily accepted by drivers.Moreover,it does not require the completeness of networks in the lowest hierarchy and the applicability and fault tolerance of the algorithm have improved.The experiment result shows the advantages of the presented algorithm.The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks.

  13. Clustering-based classification of road traffic accidents using hierarchical clustering and artificial neural networks.

    Science.gov (United States)

    Taamneh, Madhar; Taamneh, Salah; Alkheder, Sharaf

    2017-09-01

    Artificial neural networks (ANNs) have been widely used in predicting the severity of road traffic crashes. All available information about previously occurred accidents is typically used for building a single prediction model (i.e., classifier). Too little attention has been paid to the differences between these accidents, leading, in most cases, to build less accurate predictors. Hierarchical clustering is a well-known clustering method that seeks to group data by creating a hierarchy of clusters. Using hierarchical clustering and ANNs, a clustering-based classification approach for predicting the injury severity of road traffic accidents was proposed. About 6000 road accidents occurred over a six-year period from 2008 to 2013 in Abu Dhabi were used throughout this study. In order to reduce the amount of variation in data, hierarchical clustering was applied on the data set to organize it into six different forms, each with different number of clusters (i.e., clusters from 1 to 6). Two ANN models were subsequently built for each cluster of accidents in each generated form. The first model was built and validated using all accidents (training set), whereas only 66% of the accidents were used to build the second model, and the remaining 34% were used to test it (percentage split). Finally, the weighted average accuracy was computed for each type of models in each from of data. The results show that when testing the models using the training set, clustering prior to classification achieves (11%-16%) more accuracy than without using clustering, while the percentage split achieves (2%-5%) more accuracy. The results also suggest that partitioning the accidents into six clusters achieves the best accuracy if both types of models are taken into account.

  14. Dynamics and thermodynamics in hierarchically organized systems applications in physics, biology and economics

    CERN Document Server

    Auger, P

    2013-01-01

    One of the most fundamental and efficient ways of conceptualizing complex systems is to organize them hierarchically. A hierarchically organized system is represented by a network of interconnected subsystems, each of which has its own network of subsystems, and so on, until some elementary subsystems are reached that are not further decomposed. This original and important book proposes a general mathematical theory of a hierarchical system and shows how it can be applied to very different topics such as physics (Hamiltonian systems), biology (coupling the molecular and the cellular levels), e

  15. Independent power producer parallel operation modeling in transient network simulations for interconnected distributed generation studies

    Energy Technology Data Exchange (ETDEWEB)

    Moura, Fabricio A.M.; Camacho, Jose R. [Universidade Federal de Uberlandia, School of Electrical Engineering, Rural Electricity and Alternative Sources Lab, PO Box 593, 38400.902 Uberlandia, MG (Brazil); Chaves, Marcelo L.R.; Guimaraes, Geraldo C. [Universidade Federal de Uberlandia, School of Electrical Engineering, Power Systems Dynamics Group, PO Box: 593, 38400.902 Uberlandia, MG (Brazil)

    2010-02-15

    The main task in this paper is to present a performance analysis of a distribution network in the presence of an independent power producer (IP) synchronous generator with its speed governor and voltage regulator modeled using TACS -Transient Analysis of Control Systems, for distributed generation studies. Regulators were implemented through their transfer functions in the S domain. However, since ATP-EMTP (Electromagnetic Transient Program) works in the time domain, a discretization is necessary to return the TACS output to time domain. It must be highlighted that this generator is driven by a steam turbine, and the whole system with regulators and the equivalent of the power authority system at the common coupling point (CCP) are modeled in the ''ATP-EMTP -Alternative Transients Program''. (author)

  16. Dynamics of complex interconnected systems: Networks and bioprocesses[A NATO study seminary

    Energy Technology Data Exchange (ETDEWEB)

    Wilhelmsen, Line K.

    2005-07-01

    Rapid detection of chemical and biological agents and weapons, and rapid diagnosis of their effects on people will require molecular recognition as well as signal discrimination, i.e. avoiding false positives and negatives, and signal transduction. It will be important to have reagentless, cheap, easily manufactured sensors that can be field deployed in large numbers. While this problem is urgent it is not yet solved. This ASI brought together researchers with various interests and background including theoretical physicists, soft condensed matter experimentalists, biological physicists, and molecular biologists to identify and discuss areas where synergism between modem physics and biology may be most fruitfully applied to the study of bioprocesses for molecular recognition and of networks for converting molecular reactions into usable signals and appropriate responses. (Author)

  17. Hierarchical transport networks optimizing dynamic response of permeable energy-storage materials.

    Science.gov (United States)

    Nilson, Robert H; Griffiths, Stewart K

    2009-07-01

    Channel widths and spacing in latticelike hierarchical transport networks are optimized to achieve maximum extraction of gas or electrical charge from nanoporous energy-storage materials during charge and discharge cycles of specified duration. To address a range of physics, the effective transport diffusivity is taken to vary as a power, m , of channel width. Optimal channel widths and spacing in all levels of the hierarchy are found to increase in a power-law manner with normalized system size, facilitating the derivation of closed-form approximations for the optimal dimensions. Characteristic response times and ratios of channel width to spacing are both shown to vary by the factor 2/m between successive levels of any optimal hierarchy. This leads to fractal-like self-similar geometry, but only for m=2 . For this case of quadratic dependence of diffusivity on channel width, the introduction of transport channels permits increases in system size on the order of 10;{4} , 10;{8} , and 10;{10} , without any reduction in extraction efficiency, for hierarchies having 1, 2 and, 8 levels, respectively. However, we also find that for a given system size there is an optimum number of hierarchical levels that maximizes extraction efficiency.

  18. Emergence of hierarchical structure mirroring linguistic composition in a recurrent neural network.

    Science.gov (United States)

    Hinoshita, Wataru; Arie, Hiroaki; Tani, Jun; Okuno, Hiroshi G; Ogata, Tetsuya

    2011-05-01

    We show that a Multiple Timescale Recurrent Neural Network (MTRNN) can acquire the capabilities to recognize, generate, and correct sentences by self-organizing in a way that mirrors the hierarchical structure of sentences: characters grouped into words, and words into sentences. The model can control which sentence to generate depending on its initial states (generation phase) and the initial states can be calculated from the target sentence (recognition phase). In an experiment, we trained our model over a set of unannotated sentences from an artificial language, represented as sequences of characters. Once trained, the model could recognize and generate grammatical sentences, even if they were not learned. Moreover, we found that our model could correct a few substitution errors in a sentence, and the correction performance was improved by adding the errors to the training sentences in each training iteration with a certain probability. An analysis of the neural activations in our model revealed that the MTRNN had self-organized, reflecting the hierarchical linguistic structure by taking advantage of the differences in timescale among its neurons: in particular, neurons that change the fastest represented "characters", those that change more slowly, "words", and those that change the slowest, "sentences".

  19. Hierarchical graph-based segmentation for extracting road networks from high-resolution satellite images

    Science.gov (United States)

    Alshehhi, Rasha; Marpu, Prashanth Reddy

    2017-04-01

    Extraction of road networks in urban areas from remotely sensed imagery plays an important role in many urban applications (e.g. road navigation, geometric correction of urban remote sensing images, updating geographic information systems, etc.). It is normally difficult to accurately differentiate road from its background due to the complex geometry of the buildings and the acquisition geometry of the sensor. In this paper, we present a new method for extracting roads from high-resolution imagery based on hierarchical graph-based image segmentation. The proposed method consists of: 1. Extracting features (e.g., using Gabor and morphological filtering) to enhance the contrast between road and non-road pixels, 2. Graph-based segmentation consisting of (i) Constructing a graph representation of the image based on initial segmentation and (ii) Hierarchical merging and splitting of image segments based on color and shape features, and 3. Post-processing to remove irregularities in the extracted road segments. Experiments are conducted on three challenging datasets of high-resolution images to demonstrate the proposed method and compare with other similar approaches. The results demonstrate the validity and superior performance of the proposed method for road extraction in urban areas.

  20. Semiautomatic transfer function initialization for abdominal visualization using self-generating hierarchical radial basis function networks.

    Science.gov (United States)

    Selver, M Alper; Güzeliş, Cüneyt

    2009-01-01

    As being a tool that assigns optical parameters used in interactive visualization, Transfer Functions (TF) have important effects on the quality of volume rendered medical images. Unfortunately, finding accurate TFs is a tedious and time consuming task because of the trade off between using extensive search spaces and fulfilling the physician's expectations with interactive data exploration tools and interfaces. By addressing this problem, we introduce a semi-automatic method for initial generation of TFs. The proposed method uses a Self Generating Hierarchical Radial Basis Function Network to determine the lobes of a Volume Histogram Stack (VHS) which is introduced as a new domain by aligning the histograms of slices of a image series. The new self generating hierarchical design strategy allows the recognition of suppressed lobes corresponding to suppressed tissues and representation of the overlapping regions which are parts of the lobes but can not be represented by the Gaussian bases in VHS. Moreover, approximation with a minimum set of basis functions provides the possibility of selecting and adjusting suitable units to optimize the TF. Applications on different CT and MR data sets show enhanced rendering quality and reduced optimization time in abdominal studies.

  1. Hierarchical leak detection and localization method in natural gas pipeline monitoring sensor networks.

    Science.gov (United States)

    Wan, Jiangwen; Yu, Yang; Wu, Yinfeng; Feng, Renjian; Yu, Ning

    2012-01-01

    In light of the problems of low recognition efficiency, high false rates and poor localization accuracy in traditional pipeline security detection technology, this paper proposes a type of hierarchical leak detection and localization method for use in natural gas pipeline monitoring sensor networks. In the signal preprocessing phase, original monitoring signals are dealt with by wavelet transform technology to extract the single mode signals as well as characteristic parameters. In the initial recognition phase, a multi-classifier model based on SVM is constructed and characteristic parameters are sent as input vectors to the multi-classifier for initial recognition. In the final decision phase, an improved evidence combination rule is designed to integrate initial recognition results for final decisions. Furthermore, a weighted average localization algorithm based on time difference of arrival is introduced for determining the leak point's position. Experimental results illustrate that this hierarchical pipeline leak detection and localization method could effectively improve the accuracy of the leak point localization and reduce the undetected rate as well as false alarm rate.

  2. Application of Percolation Theory to Complex Interconnected Networks in Advanced Functional Composites

    Science.gov (United States)

    Hing, P.

    2011-11-01

    Percolation theory deals with the behaviour of connected clusters in a system. Originally developed for studying the flow of liquid in a porous body, the percolation theory has been extended to quantum computation and communication, entanglement percolation in quantum networks, cosmology, chaotic situations, properties of disordered solids, pandemics, petroleum industry, finance, control of traffic and so on. In this paper, the application of various models of the percolation theory to predict and explain the properties of a specially developed family of dense sintered and highly refractory Al2O3-W composites for potential application in high intensity discharge light sources such as high pressure sodium lamps and ceramic metal halide lamps are presented and discussed. The low cost, core-shell concept can be extended to develop functional composite materials with unusual dielectric, electrical, magnetic, superconducting, and piezoelectric properties starting from a classical insulator. The core shell concept can also be applied to develop catalysts with high specific surface areas with minimal amount of expensive platinium, palladium or rare earth nano structured materials for light harvesting, replicating natural photosynthesis, in synthetic zeolite composites for the cracking and separation of crude oil. There is also possibility of developing micron and nanosize Faraday cages for quantum devices, nano electronics and spintronics. The possibilities are limitless.

  3. On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs

    CERN Document Server

    Ghosh, Esha; Rangan, C Pandu

    2011-01-01

    Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network wherever such algorithm exists for linear-array and ring, and can ensure deadlock freedom in some routing algorithms in hierarchical interconnection networks. Hamiltonicity can also be used for construction of independent spanning tree and leads to designing fault tolerant protocols. Optical Transpose Interconnection Systems or OTIS (also referred to as two-level swapped network) is a widely studied interconnection network topology which is popular due to high degree of scalability, regularity, modularity and package ability. Surprisingly, to our knowledge, only one strong result is known regarding Hamiltonicity of OTIS - showing that OTIS graph built of Hamiltonian base graphs are Hamiltonian. In this work we consider Hamiltonicity of OTIS networks, built on Non-Hamiltonian base and answer some important questions. First, we prove tha...

  4. Bayesian methods for estimating the reliability in complex hierarchical networks (interim report).

    Energy Technology Data Exchange (ETDEWEB)

    Marzouk, Youssef M.; Zurn, Rena M.; Boggs, Paul T.; Diegert, Kathleen V. (Sandia National Laboratories, Albuquerque, NM); Red-Horse, John Robert (Sandia National Laboratories, Albuquerque, NM); Pebay, Philippe Pierre

    2007-05-01

    Current work on the Integrated Stockpile Evaluation (ISE) project is evidence of Sandia's commitment to maintaining the integrity of the nuclear weapons stockpile. In this report, we undertake a key element in that process: development of an analytical framework for determining the reliability of the stockpile in a realistic environment of time-variance, inherent uncertainty, and sparse available information. This framework is probabilistic in nature and is founded on a novel combination of classical and computational Bayesian analysis, Bayesian networks, and polynomial chaos expansions. We note that, while the focus of the effort is stockpile-related, it is applicable to any reasonably-structured hierarchical system, including systems with feedback.

  5. Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance

    Institute of Scientific and Technical Information of China (English)

    黄理灿; 吴朝晖; 潘云鹤

    2004-01-01

    This paper presents an overlay network topology called Virtual and Dynamic Hierarchical Architecture (VDHA) for discovering Grid services with high performance. Service discovery based on VDHA has scalable, autonomous, efficient, reliable and quick responsive. We propose two service discovery algorithms. Full Search Query and Discovery Protocol (FSQDP) discovers the nodes that match the request message from all N nodes, which has time complexity O(logN), space complexity O(nvg) (nvg being node numbers of each virtual group), and message-cost O(N), and Domain-Specific Query and Discovery Protocol (DSQDP) searches nodes in only specific domains with time complexity O(nvg), space complexity O(nvg), and message-cost O(nvg). In this paper, we also describe VDHA, its formal definition, and Grid Group Management Protocol.

  6. AH-MAC: Adaptive Hierarchical MAC Protocol for Low-Rate Wireless Sensor Network Applications

    Directory of Open Access Journals (Sweden)

    Adnan Ismail Al-Sulaifanie

    2017-01-01

    Full Text Available This paper proposes an adaptive hierarchical MAC protocol (AH-MAC with cross-layer optimization for low-rate and large-scale wireless sensor networks. The main goal of the proposed protocol is to combine the strengths of LEACH and IEEE 802.15.4 while offsetting their weaknesses. The predetermined cluster heads are supported with an energy harvesting circuit, while the normal nodes are battery-operated. To prolong the network’s operational lifetime, the proposed protocol transfers most of the network’s activities to the cluster heads while minimizing the node’s activity. Some of the main features of this protocol include energy efficiency, self-configurability, scalability, and self-healing. The simulation results showed great improvement of the AH-MAC over LEACH protocol in terms of energy consumption and throughput. AH-MAC consumes eight times less energy while improving throughput via acknowledgment support.

  7. Electropolymerized Star-Shaped Benzotrithiophenes Yield π-Conjugated Hierarchical Networks with High Areal Capacitance

    KAUST Repository

    Ringk, Andreas

    2016-03-30

    High-surface-area π-conjugated polymeric networks have the potential to lend outstanding capacitance to supercapacitors because of the pronounced faradaic processes that take place across the dense intimate interface between active material and electrolytes. In this report, we describe how benzo[1,2-b:3,4-b’:5,6-b’’]trithiophene (BTT) and tris-EDOT-benzo[1,2-b:3,4-b’:5,6-b’’]trithiophene (TEBTT) can serve as 2D (trivalent) building blocks in the development of electropolymerized hierarchical π-conjugated frameworks with particularly high areal capacitance. In comparing electropolymerized networks of BTT, TEBTT, and their copolymers with EDOT, we show that P(TEBTT/EDOT)-based frameworks can achieve higher areal capacitance (e.g., as high as 443.8 mF cm-2 at 1 mA cm-2) than those achieved by their respective homopolymers (PTEBTT and PEDOT) in the same experimental conditions of electrodeposition (PTEBTT: 271.1 mF cm-2 (at 1 mA cm-2) and PEDOT: 12.1 mF cm-2 (at 1 mA cm-2)). For example, P(TEBTT/EDOT)-based frameworks synthesized in a 1:1 monomer-to-comonomer ratio show a ca. 35x capacitance improvement over PEDOT. The high areal capacitance measured for P(TEBTT/EDOT) copolymers can be explained by the open, highly porous hierarchical morphologies formed during the electropolymerization step. With >70% capacitance retention over 1,000 cycles (up to 89% achieved), both PTEBTT- and P(TEBTT/EDOT)-based frameworks are resilient to repeated electrochemical cycling and can be considered promising systems for high life cycle capacitive electrode applications.

  8. Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications

    Institute of Scientific and Technical Information of China (English)

    Xiao-Lin Li; Jian-Nong Cao

    2008-01-01

    To minimize the execution time of a sensing task over a multi-hop hierarchical sensor network, we present acoordinated scheduling method following the divisible load scheduling paradigm. The proposed scheduling strategy builds on eliminating transmission collisions and idle gaps between two successive data transmissions. We consider a sensor network consisting of several clusters. In a cluster, after related raw data measured by source nodes are collected at the fusion node,in-network data aggregation is further considered. The scheduling strategies consist of two phases: intra-cluster scheduling and inter-cluster scheduling. Intra-cluster scheduling deals with assigning different fractions of a sensing workload among source nodes in each cluster; inter-cluster scheduling involves the distribution of fused data among all fusion nodes. Closed-form solutions to the problem of task scheduling are derived. Finally, numerical examples are presented to demonstrate the impacts of different system parameters such as the number of sensor nodes, measurement, communication, and processing speed, on the finish time and energy consumption.

  9. A Dynamic Key Management Scheme Based on Secret Sharing for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Enjian Bai

    2013-01-01

    Full Text Available Since wireless sensor networks (WSN for short are often deployed in hostile environments in many applications, security becomes one of the critical issues in WSN. Moreover, due to the limitation of the sensor nodes, traditional key management schemes are not suitable for it. Thereby,a feasible and efficient key management scheme is an important guarantee for WSN to communicate securely. For the moment, many protocols have been proposed and each has its own advantages. However, these protocols cannot provide sufficient security in many cases, such as node capture attack, which makes WSN more vulnerable than traditional wireless networks. Key protection and revocation issues must be considered with special attention in WSN. To address these two issues, we propose a dynamically clustering key management scheme based on secret sharing for WSN. The scheme combined the hierarchical structure of wireless sensor networks with dynamic key management scheme. The analysis results show that the scheme has strong security and resistance of captured attack, as well as low communicational overhead, and it well meets the requirement of scalability.

  10. Hierarchical network model for the analysis of human spatio-temporal information processing

    Science.gov (United States)

    Schill, Kerstin; Baier, Volker; Roehrbein, Florian; Brauer, Wilfried

    2001-06-01

    The perception of spatio-temporal pattern is a fundamental part of visual cognition. In order to understand more about the principles behind these biological processes, we are analyzing and modeling the presentation of spatio-temporal structures on different levels of abstraction. For the low- level processing of motion information we have argued for the existence of a spatio-temporal memory in early vision. The basic properties of this structure are reflected in a neural network model which is currently developed. Here we discuss major architectural features of this network which is base don Kohonens SOMs. In order to enable the representation, processing and prediction of spatio-temporal pattern on different levels of granularity and abstraction the SOMs are organized in a hierarchical manner. The model has the advantage of a 'self-teaching' learning algorithm and stored temporal information try local feedback in each computational layer. The constraints for the neural modeling and data set for training the neural network are obtained by psychophysical experiments where human subjects' abilities for dealing with spatio-temporal information is investigated.

  11. APPLICATION OF NEURAL NETWORK WITH MULTI-HIERARCHIC STRUCTURE TO EVALUATE SUSTAINABLE DEVELOPMENT OF THE COAL MINES

    Institute of Scientific and Technical Information of China (English)

    李新春; 陶学禹

    2000-01-01

    The neural network with multi-hierarchic structure is provided in this paper to evaluate sustainable development of the coal mines based on analyzing its effect factors. The whole evaluating system is composed of 5 neural networks.The feasibility of this method has been proved by case study. This study will provide a scientfic and theoretic foundation for evaluating the sustainable development of coal mines.

  12. Method of Parallel-Hierarchical Network Self-Training and its Application for Pattern Classification and Recognition

    Directory of Open Access Journals (Sweden)

    TIMCHENKO, L.

    2012-11-01

    Full Text Available Propositions necessary for development of parallel-hierarchical (PH network training methods are discussed in this article. Unlike already known structures of the artificial neural network, where non-normalized (absolute similarity criteria are used for comparison, the suggested structure uses a normalized criterion. Based on the analysis of training rules, a conclusion is made that application of two training methods with a teacher is optimal for PH network training: error correction-based training and memory-based training. Mathematical models of training and a combined method of PH network training for recognition of static and dynamic patterns are developed.

  13. Hierarchical structure and modules in the Escherichia coli transcriptional regulatory network revealed by a new top-down approach

    Directory of Open Access Journals (Sweden)

    Buer Jan

    2004-12-01

    Full Text Available Abstract Background Cellular functions are coordinately carried out by groups of genes forming functional modules. Identifying such modules in the transcriptional regulatory network (TRN of organisms is important for understanding the structure and function of these fundamental cellular networks and essential for the emerging modular biology. So far, the global connectivity structure of TRN has not been well studied and consequently not applied for the identification of functional modules. Moreover, network motifs such as feed forward loop are recently proposed to be basic building blocks of TRN. However, their relationship to functional modules is not clear. Results In this work we proposed a top-down approach to identify modules in the TRN of E. coli. By studying the global connectivity structure of the regulatory network, we first revealed a five-layer hierarchical structure in which all the regulatory relationships are downward. Based on this regulatory hierarchy, we developed a new method to decompose the regulatory network into functional modules and to identify global regulators governing multiple modules. As a result, 10 global regulators and 39 modules were identified and shown to have well defined functions. We then investigated the distribution and composition of the two basic network motifs (feed forward loop and bi-fan motif in the hierarchical structure of TRN. We found that most of these network motifs include global regulators, indicating that these motifs are not basic building blocks of modules since modules should not contain global regulators. Conclusion The transcriptional regulatory network of E. coli possesses a multi-layer hierarchical modular structure without feedback regulation at transcription level. This hierarchical structure builds the basis for a new and simple decomposition method which is suitable for the identification of functional modules and global regulators in the transcriptional regulatory network of E

  14. An Efficient Admission Control Algorithm for Load Balancing In Hierarchical Mobile IPv6 Networks

    CERN Document Server

    Harini, Prof P

    2009-01-01

    In hierarchical Mobile IPv6 networks, Mobility Anchor Point (MAP) may become a single point of bottleneck as it handles more and more mobile nodes (MNs). A number of schemes have been proposed to achieve load balancing among different MAPs. However, signaling reduction is still imperfect because these schemes also avoid the effect of the number of CNs. Also only the balancing of MN is performed, but not the balancing of the actual traffic load, since CN of each MN may be different. This paper proposes an efficient admission control algorithm along with a replacement mechanism for HMIPv6 networks. The admission control algorithm is based on the number of serving CNs and achieves actual load balancing among MAPs. Moreover, a replacement mechanism is introduced to decrease the new MN blocking probability and the handoff MN dropping probability. By simulation results, we show that, the handoff delay and packet loss are reduced in our scheme, when compared with the standard HMIPv6 based handoff.

  15. A Hybrid System of Hierarchical Planning of Behaviour Selection Networks for Mobile Robot Control

    Directory of Open Access Journals (Sweden)

    Young-Seol Lee

    2014-04-01

    Full Text Available An office delivery robot receives a large amount of sensory data and there is uncertainty in its action outcomes. The robot should not only accomplish its goals using environmental information, but also consider various exceptions simultaneously. In this paper, we propose a hybrid system using hierarchical planning of modular behaviour selection networks to generate autonomous behaviour in the office delivery robot. Behaviour selection networks, one of the well-known behaviour-based methods suitable for goal-oriented tasks, are made up of several smaller behaviour modules. Planning is attached to the construct and adjust sequences of the modules by considering the sub-goals, the priority in each task and the user feedback. This helps the robot to quickly react in dynamic situations as well as achieve global goals efficiently. The proposed system is verified with both the Webot simulator and a Khepera II robot that runs in a real office environment carrying out delivery tasks. Experimental results have shown that a robot can achieve goals and generate module sequences successfully even in unpredictable situations. Additionally, the proposed planning method reduced the elapsed time during tasks by 17.5% since it adjusts the behaviour module sequences more effectively.

  16. Hierarchical Agglomerative Clustering Schemes for Energy-Efficiency in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Taleb Tariq

    2017-06-01

    Full Text Available Extending the lifetime of wireless sensor networks (WSNs while delivering the expected level of service remains a hot research topic. Clustering has been identified in the literature as one of the primary means to save communication energy. In this paper, we argue that hierarchical agglomerative clustering (HAC provides a suitable foundation for designing highly energy efficient communication protocols for WSNs. To this end, we study a new mechanism for selecting cluster heads (CHs based both on the physical location of the sensors and their residual energy. Furthermore, we study different patterns of communications between the CHs and the base station depending on the possible transmission ranges and the ability of the sensors to act as traffic relays. Simulation results show that our proposed clustering and communication schemes outperform well-knows existing approaches by comfortable margins. In particular, networks lifetime is increased by more than 60% compared to LEACH and HEED, and by more than 30% compared to K-means clustering.

  17. A Social Potential Fields Approach for Self-Deployment and Self-Healing in Hierarchical Mobile Wireless Sensor Networks

    Science.gov (United States)

    González-Parada, Eva; Cano-García, Jose; Aguilera, Francisco; Sandoval, Francisco; Urdiales, Cristina

    2017-01-01

    Autonomous mobile nodes in mobile wireless sensor networks (MWSN) allow self-deployment and self-healing. In both cases, the goals are: (i) to achieve adequate coverage; and (ii) to extend network life. In dynamic environments, nodes may use reactive algorithms so that each node locally decides when and where to move. This paper presents a behavior-based deployment and self-healing algorithm based on the social potential fields algorithm. In the proposed algorithm, nodes are attached to low cost robots to autonomously navigate in the coverage area. The proposed algorithm has been tested in environments with and without obstacles. Our study also analyzes the differences between non-hierarchical and hierarchical routing configurations in terms of network life and coverage. PMID:28075364

  18. 47 CFR 101.519 - Interconnection.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Interconnection. 101.519 Section 101.519... SERVICES 24 GHz Service and Digital Electronic Message Service § 101.519 Interconnection. (a) All DEMS... the public all information necessary to allow interconnection of DEMS networks....

  19. Hierarchical mechanisms of spatially contagious seed dispersal in complex seed-disperser networks.

    Science.gov (United States)

    Fedriani, José M; Wiegand, Thorsten

    2014-02-01

    Intra- and interspecific spatially contagious seed dispersal has far-reaching implications for plant recruitment, distribution, and community assemblage. However, logistical and analytical limitations have curtailed our understanding concerning the mechanisms and resulting spatial patterns of contagious seed dispersal in most systems and, especially, in complex seed-disperser networks. We investigated mechanisms of seed aggregation using techniques of spatial point pattern analysis and extensive data sets on mutispecific endozoochorous seed rain generated by five frugivorous mammals in three Mediterranean shrublands over two seasons. Our novel analytical approach revealed three hierarchical and complementary mechanisms of seed aggregation acting at different levels (fecal samples, seeds, pairs of seed species) and spatial scales. First, the three local guilds of frugivores tended to deliver their feces highly aggregated at small and intermediate spatial scales, and the overall pattern of fecal delivery could be described well by a nested double-cluster Thomas process. Second, once the strong observed fecal aggregation was accounted for, the distribution of mammal feces containing seeds was clustered within the pattern of all feces (i.e., with and without seeds), and the density of fecal samples containing seeds was higher than expected around other feces containing seeds in two out of the three studied seed-disperser networks. Finally, at a finer level, mark correlation analyses revealed that for some plant species pairs, the number of dispersed seeds was positively associated either at small or large spatial scales. Despite the relatively invariant patterning of nested double-clustering, some attributes of endozoochorous seed rain (e.g., intensity, scales of aggregation) were variable among study sites due to changes in the ecological context in which seeds and their dispersers interact. Our investigation disentangles for the first time the hierarchy of synergic

  20. 47 CFR 90.477 - Interconnected systems.

    Science.gov (United States)

    2010-10-01

    ...) Applicants for new land stations to be interconnected with the public switched telephone network must... switched telephone network only after modifying their license. See § 1.929 of this chapter. In all cases a..., 896-901 MHz, and 935-940 MHz, interconnection with the public switched telephone network is...

  1. Hierarchical hybrid control network design based on LON and master-slave RS-422/485 protocol

    Institute of Scientific and Technical Information of China (English)

    彭可; 陈际达; 陈岚

    2002-01-01

    Aiming at the weaknesses of LON bus, combining the coexistence of fieldbus and DCS (Distribu-ted Control Systems) in control networks, the authors introduce a hierarchical hybrid control network design based on LON and master-slave RS-422/485 protocol. This design adopts LON as the trunk, master-slave RS-422/485 control networks are connected to LON as special subnets by dedicated gateways. It is an implementation method for isomerous control network integration. Data management is ranked according to real-time requirements for different network data. The core components, such as control network nodes, router and gateway, are detailed in the paper. The design utilizes both communication advantage of LonWorks technology and the more powerful control ability of universal MCUs or PLCs, thus it greatly increases system response speed and performance-cost ratio.

  2. Carbon nanotube-based polymer nanocomposites: Fractal network to hierarchical morphology

    Science.gov (United States)

    Chatterjee, Tirtha

    The dispersion of anisotropic nanoparticles such as single-walled carbon nanotubes in polymeric matrices promises the ability to develop advanced materials with controlled and tailored combinations of properties. However, dispersion of such nanotubes in a polymer matrix is an extremely challenging task due to strong attractive interactions between the nanotubes. The successful dispersion of single-walled carbon nanotubes in poly(ethylene oxide) using an anionic surfactant (lithium dodecyl sulfate) as compatibilizer is reported here. The geometrical percolation threshold (pc, in vol %) of nanotubes, as revealed by melt-state rheological measurements, is found to be at ˜ 0.09 vol % loading, which corresponds to an effective tube anisotropy of ˜ 650. The system shows an even earlier development of the electrical percolation at 0.03 vol % SWNT loading as obtained by electrical conductivity measurements. In their quiescent state, the nanotubes show hierarchical fractal network (mass fractal dimension ˜ 2.3 +/- 0.2) made of aggregated flocs. Inside the floc, individual or small bundles of nanotubes overlap each other to form a dense mesh. The interfloc interactions provides the stress bearing capacity for these nano composites and are responsible for the unique modulus scaling of these systems (˜(p-pc)delta, 3.0 ≤ delta ≤ 4.5). The interaction is inversely related to the particle dispersion state, which influences the absolute values of the viscoelastic parameters. As a direct consequence of the self-similar fractal network, the linear flow properties display 'time-temperature-composition' superposition. This superposability can be extended for non-linear deformations when the non-linear properties are scaled by the local strain experienced by the elements of the network. More interestingly, under steady shear, these nanocomposites show network-independent behavior. The absolute stress value is a function of the nanotube loading, but the characteristic time

  3. SO2 Emissions in China – Their Network and Hierarchical Structures

    Science.gov (United States)

    Yan, Shaomin; Wu, Guang

    2017-01-01

    SO2 emissions lead to various harmful effects on environment and human health. The SO2 emission in China has significant contribution to the global SO2 emission, so it is necessary to employ various methods to study SO2 emissions in China with great details in order to lay the foundation for policymaking to improve environmental conditions in China. Network analysis is used to analyze the SO2 emissions from power generation, industrial, residential and transportation sectors in China for 2008 and 2010, which are recently available from 1744 ground surface monitoring stations. The results show that the SO2 emissions from power generation sector were highly individualized as small-sized clusters, the SO2 emissions from industrial sector underwent an integration process with a large cluster contained 1674 places covering all industrial areas in China, the SO2 emissions from residential sector was not impacted by time, and the SO2 emissions from transportation sector underwent significant integration. Hierarchical structure is obtained by further combining SO2 emissions from all four sectors and is potentially useful to find out similar patterns of SO2 emissions, which can provide information on understanding the mechanisms of SO2 pollution and on designing different environmental measure to combat SO2 emissions. PMID:28387301

  4. A Hierarchical of Security Situation Element Acquisition Mechanism in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Li Fangwei

    2015-08-01

    Full Text Available In wireless sensor network, the processing ability of the sensor nodes is poor. And the security situational element acquisition is also a serious problem. Thus, this paper proposes a hierarchical framework of security situational elements acquisition mechanism. In this framework, support vector machine hyper sphere multi class algorithm is introduced as basic classifier. The method of attribute reduction uses non negative matrix factorization algorithm. The fuzzy classification algorithm used to initialize non negative matrix factorization, in order to avoid the local optimal which is caused by non negative matrix factorization random initialization. In the sink node classification rules and attribute reduction rules are formed by learning. The classification analyses respectively focus on the cluster head and sink node, which can reduce the requirement of the sensor node properties. Attribute reduction before the data transmission, which reduces communication consumption data transmission, improves the performance of classifiers. By simulation analysis, the scheme has preferably accuracy in the situation elements acquisiton, and smaller communication overhead in the process of information transmission.

  5. Interference mitigation for broadcast in hierarchical cell structure networks: Transmission strategy and area spectral efficiency

    KAUST Repository

    Yang, Yuli

    2014-10-01

    In this paper, a hierarchical cell structure (HCS) is considered, where an access point (AP) broadcasts to local nodes (LNs) over orthogonal frequency subbands within a local cell located in a macrocell. Since the local cell shares the spectrum licensed to the macrocell, a given LN is interfered with by the macrocell user (MU)\\'s transmissions over the same subband. To improve the performance of the AP\\'s broadcast service, a novel transmission strategy is proposed to mitigate the interference from the MU to the LN while achieving diversity gain. For the purpose of performance evaluation, the ergodic capacity of the proposed scheme is quantified, and the corresponding closed-form expression is obtained. By comparing with the traditional transmission scheme, which suffers from MU\\'s interference, illustrative numerical results substantiate that the proposed scheme achieves better performance than the traditional scheme as the MU-LN mean channel power gain is larger than half of the AP-LN mean channel power gain. Subsequently, we develop an optimized network design by maximizing the area spectral efficiency (ASE) of the AP\\'s broadcast in the local cell.

  6. A comparative performance evaluation of intrusion detection techniques for hierarchical wireless sensor networks

    Directory of Open Access Journals (Sweden)

    H.H. Soliman

    2012-11-01

    Full Text Available An explosive growth in the field of wireless sensor networks (WSNs has been achieved in the past few years. Due to its important wide range of applications especially military applications, environments monitoring, health care application, home automation, etc., they are exposed to security threats. Intrusion detection system (IDS is one of the major and efficient defensive methods against attacks in WSN. Therefore, developing IDS for WSN have attracted much attention recently and thus, there are many publications proposing new IDS techniques or enhancement to the existing ones. This paper evaluates and compares the most prominent anomaly-based IDS systems for hierarchical WSNs and identifying their strengths and weaknesses. For each IDS, the architecture and the related functionality are briefly introduced, discussed, and compared, focusing on both the operational strengths and weakness. In addition, a comparison of the studied IDSs is carried out using a set of critical evaluation metrics that are divided into two groups; the first one related to performance and the second related to security. Finally based on the carried evaluation and comparison, a set of design principles are concluded, which have to be addressed and satisfied in future research of designing and implementing IDS for WSNs.

  7. A Secure Hierarchical Identify Authentication Scheme Combining Trust Mechanism in Mobile IPv6 Networks

    Directory of Open Access Journals (Sweden)

    Zhi Zhang

    2009-07-01

    Full Text Available During the last few years, it has become more and more conpeling in mobile applications, mobile IPv6 technology is convenient, but also produces a series of security compromise. Identify authentication is an important part of the network security. In this paper, we proposed a secure identify authentication scheme combining reputation mechanism, which considers inters domain trust relationship between mobile node home domain and the access domain in the pre-handoff procedure and realizes effective mutual authentication between mobile node(MN and the access domain. A dynamic reputation maintenance mechanism for inter domain relationship is also designed. Based SMC signature, a hierarchical signature and verification scheme is designed in one round mutual authentication. Theoretical analysis and numerical results show that proposed scheme is more effective in reducing total authentication and handoff delay and the signaling overhead than relative schemes. Security analysis shows, basing on the security of SMC-IBS, the proposed scheme is sufficient for private key privacy, signature unforgeability. Moreover, our scheme first provide public key revocation and key escrow problem in mobile IPv6 networks’ access authentication.

  8. Learning invariant object recognition from temporal correlation in a hierarchical network.

    Science.gov (United States)

    Lessmann, Markus; Würtz, Rolf P

    2014-06-01

    Invariant object recognition, which means the recognition of object categories independent of conditions like viewing angle, scale and illumination, is a task of great interest that humans can fulfill much better than artificial systems. During the last years several basic principles were derived from neurophysiological observations and careful consideration: (1) Developing invariance to possible transformations of the object by learning temporal sequences of visual features that occur during the respective alterations. (2) Learning in a hierarchical structure, so basic level (visual) knowledge can be reused for different kinds of objects. (3) Using feedback to compare predicted input with the current one for choosing an interpretation in the case of ambiguous signals. In this paper we propose a network which implements all of these concepts in a computationally efficient manner which gives very good results on standard object datasets. By dynamically switching off weakly active neurons and pruning weights computation is sped up and thus handling of large databases with several thousands of images and a number of categories in a similar order becomes possible. The involved parameters allow flexible adaptation to the information content of training data and allow tuning to different databases relatively easily. Precondition for successful learning is that training images are presented in an order assuring that images of the same object under similar viewing conditions follow each other. Through an implementation with sparse data structures the system has moderate memory demands and still yields very good recognition rates.

  9. 3D Graphene-Foam-Reduced-Graphene-Oxide Hybrid Nested Hierarchical Networks for High-Performance Li-S Batteries.

    Science.gov (United States)

    Hu, Guangjian; Xu, Chuan; Sun, Zhenhua; Wang, Shaogang; Cheng, Hui-Ming; Li, Feng; Ren, Wencai

    2016-02-24

    A 3D graphene-foam-reduced-graphene-oxide hybrid nested hierarchical network is synthesized to achieve high sulfur loading and content simultaneously, which solves the "double low" issues of Li-S batteries. The obtained Li-S cathodes show a high areal capacity two times larger than that of commercial lithium-ion batteries, and a good cycling performance comparable to those at low sulfur loading.

  10. Interconnections 180

    CERN Multimedia

    180

    2013-01-01

    The LHC's main magnets operate at a temperature of 1.9 K (-271.3°C), colder than the 2.7 K (-270.5°C) of outer space. This ensures that the cables supplying power to the magnets operate in a superconducting state; they conduct electricity with no resistance. The cold magnets are insulated from the surrounding tunnel – kept at room temperature – with multiple layers of thermal insulation. Over the next 18 months, 1695 interconnections between LHC magnets will be opened and their insulation consolidated. In the video above, narrated by Jean-Philippe Tock of the Technology department, technicians demonstrate the process on an interconnection between spare LHC magnets. A "W bellows" system slides out of the way to reveal accelerator components inside. The technicians add aluminium sheeting and further insulating material before closing the W bellows for a leak-proof connection. The section is then brought to a pressure of 10-6 mbar, to further limit the possibility of heat leaks from the cold magnets. Insul...

  11. RedeR: R/Bioconductor package for representing modular structures, nested networks and multiple levels of hierarchical associations.

    Science.gov (United States)

    Castro, Mauro A A; Wang, Xin; Fletcher, Michael N C; Meyer, Kerstin B; Markowetz, Florian

    2012-04-24

    Visualization and analysis of molecular networks are both central to systems biology. However, there still exists a large technological gap between them, especially when assessing multiple network levels or hierarchies. Here we present RedeR, an R/Bioconductor package combined with a Java core engine for representing modular networks. The functionality of RedeR is demonstrated in two different scenarios: hierarchical and modular organization in gene co-expression networks and nested structures in time-course gene expression subnetworks. Our results demonstrate RedeR as a new framework to deal with the multiple network levels that are inherent to complex biological systems. RedeR is available from http://bioconductor.org/packages/release/bioc/html/RedeR.html.

  12. The Generalized Fixed-Charge Network Design Problem

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2007-01-01

    In this paper we present the generalized fixed-charge network design (GFCND) problem. The GFCND problem is an instance of the so-called generalized network design problems. In such problems, clusters instead of nodes have to be interconnected by a network. The network interconnecting the clusters...... is a fixed-charge network, and thus the GFCND problem generalizes the fixed-charge network design problem. The GFCND problem is related to the more general problem of designing hierarchical telecommunication networks. A mixed integer programming model is described and a branch-cut-and-price algorithm...

  13. Electrical interconnect

    Energy Technology Data Exchange (ETDEWEB)

    Frost, John S.; Brandt, Randolph J.; Hebert, Peter; Al Taher, Omar

    2015-10-06

    An interconnect includes a first set of connector pads, a second set of connector pads, and a continuous central portion. A first plurality of legs extends at a first angle from the continuous central portion. Each leg of the first plurality of legs is connected to a connector pad of a first set of connector pads. A second plurality of legs extends at a second angle from the continuous central portion. Each leg of the second plurality of legs is connected to a connector pad of the second set of connector pads. Gaps are defined between legs. The gaps enable movement of the first set of connector pads relative to the second set of connector pads.

  14. Application of hierarchical dissociated neural network in closed-loop hybrid system integrating biological and mechanical intelligence.

    Directory of Open Access Journals (Sweden)

    Yongcheng Li

    Full Text Available Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including 'random' and '4Q' (cultured neurons artificially divided into four interconnected parts neural network. Compared to the random cultures, the '4Q' cultures presented absolutely different activities, and the robot controlled by the '4Q' network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems.

  15. Application of hierarchical dissociated neural network in closed-loop hybrid system integrating biological and mechanical intelligence.

    Science.gov (United States)

    Li, Yongcheng; Sun, Rong; Zhang, Bin; Wang, Yuechao; Li, Hongyi

    2015-01-01

    Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including 'random' and '4Q' (cultured neurons artificially divided into four interconnected parts) neural network. Compared to the random cultures, the '4Q' cultures presented absolutely different activities, and the robot controlled by the '4Q' network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems.

  16. Recursive random forest algorithm for constructing multilayered hierarchical gene regulatory networks that govern biological pathways

    Science.gov (United States)

    Zhang, Kui; Busov, Victor; Wei, Hairong

    2017-01-01

    Background Present knowledge indicates a multilayered hierarchical gene regulatory network (ML-hGRN) often operates above a biological pathway. Although the ML-hGRN is very important for understanding how a pathway is regulated, there is almost no computational algorithm for directly constructing ML-hGRNs. Results A backward elimination random forest (BWERF) algorithm was developed for constructing the ML-hGRN operating above a biological pathway. For each pathway gene, the BWERF used a random forest model to calculate the importance values of all transcription factors (TFs) to this pathway gene recursively with a portion (e.g. 1/10) of least important TFs being excluded in each round of modeling, during which, the importance values of all TFs to the pathway gene were updated and ranked until only one TF was remained in the list. The above procedure, termed BWERF. After that, the importance values of a TF to all pathway genes were aggregated and fitted to a Gaussian mixture model to determine the TF retention for the regulatory layer immediately above the pathway layer. The acquired TFs at the secondary layer were then set to be the new bottom layer to infer the next upper layer, and this process was repeated until a ML-hGRN with the expected layers was obtained. Conclusions BWERF improved the accuracy for constructing ML-hGRNs because it used backward elimination to exclude the noise genes, and aggregated the individual importance values for determining the TFs retention. We validated the BWERF by using it for constructing ML-hGRNs operating above mouse pluripotency maintenance pathway and Arabidopsis lignocellulosic pathway. Compared to GENIE3, BWERF showed an improvement in recognizing authentic TFs regulating a pathway. Compared to the bottom-up Gaussian graphical model algorithm we developed for constructing ML-hGRNs, the BWERF can construct ML-hGRNs with significantly reduced edges that enable biologists to choose the implicit edges for experimental

  17. Fluctuation relations between hierarchical kinetically equivalent networks with Arrhenius-type transitions and their roles in systems and structural biology

    Science.gov (United States)

    Deng, De-Ming; Lu, Yi-Ta; Chang, Cheng-Hung

    2017-06-01

    The legality of using simple kinetic schemes to determine the stochastic properties of a complex system depends on whether the fluctuations generated from hierarchical equivalent schemes are consistent with one another. To analyze this consistency, we perform lumping processes on the stochastic differential equations and the generalized fluctuation-dissipation theorem and apply them to networks with the frequently encountered Arrhenius-type transition rates. The explicit Langevin force derived from those networks enables us to calculate the state fluctuations caused by the intrinsic and extrinsic noises on the free energy surface and deduce their relations between kinetically equivalent networks. In addition to its applicability to wide classes of network related systems, such as those in structural and systems biology, the result sheds light on the fluctuation relations for general physical variables in Keizer's canonical theory.

  18. Interconnections; Interconnexions

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2001-07-01

    Theses documents define and present the contracts to access the public french electric power network for importation, exportation and transit of electric power. The rules, the notifications and the guarantees are defined. (A.L.B.)

  19. An Improved Particle Swarm Optimization Based on Deluge Approach for Enhanced Hierarchical Cache Optimization in IPTV Networks

    Directory of Open Access Journals (Sweden)

    M. Somu

    2014-05-01

    Full Text Available In recent years, IP network has been considered as a new delivery network for TV services. A majority of the telecommunication industries have used IP network to offer on-demand services and linear TV services as it can offer a two-way and high-speed communication. In order to effectively and economically utilize the IP network, caching is the technique which is usually preferred. In IPTV system, a managed network is utilized to bring out TV services, the requests of Video on Demand (VOD objects are usually combined in a limited period intensively and user preferences are fluctuated dynamically. Furthermore, the VOD content updates often under the control of IPTV providers. In order to minimize this traffic and overall network cost, a segment of the video content is stored in caches closer to subscribers, for example, Digital Subscriber Line Access Multiplexer (DSLAM, a Central Office (CO and Intermediate Office (IO. The major problem focused in this approach is to determine the optimal cache memory that should be assigned in order to attain maximum cost effectiveness. This approach uses an effective Grate Deluge algorithm based Particle Swarm Optimization (GDPSO approach for attaining the optimal cache memory size which in turn minimizes the overall network cost. The analysis shows that hierarchical distributed caching can save significant network cost through the utilization of the GDPSO algorithm.

  20. Interconnections 180

    CERN Multimedia

    CERN Visual Media Office; Noemi Caraban Gonzales

    2013-01-01

    Throughout the LS1 (Long Shutdown 1 planned for 2013-14), the consolidation of the 13 kA splices consists of the opening of M sleeves to access the bus-bars and install the consolidation system features (shunt, electrical insulation and mechanical restraint system). Once the features are installed, the sleeves are rewelded (10000 welds in total). The interconnect regions between adjacent cryomagnets consist of a number of lines spanning from one machine element to another. Within a magnet-to-magnet connection several welds are made. An automatic orbital weld without filler material closes the three main bus-bar lines M1, M2 and M3 (M1 and M2 for the main quadrupole bus-bars and M3 for the main dipole bus-bars). These welds are performed in a radial clearance of only 45 mm. A very reliable weld process is required. The weld configuration shall also ease future interventions. Automatic orbital TIG welding associated to specific weld geometry meets all these requirements. Edge weld preparation has the following ...

  1. Efficient routing mechanisms for Dragonfly networks

    OpenAIRE

    Garcia M.; Vallejo E.; Beivide R.; Odriozola M.; Valero M.

    2013-01-01

    High-radix hierarchical networks are cost-effective topologies for large scale computers. In such networks, routers are organized in super nodes, with local and global interconnections. These networks, known as Dragonflies, outperform traditional topologies such as multi-trees or tori, in cost and scalability. However, depending on the traffic pattern, network congestion can lead to degraded performance. Misrouting (non-minimal routing) can be employed to avoid saturated global or local links...

  2. SU-8 cantilever chip interconnection

    DEFF Research Database (Denmark)

    Johansson, Alicia Charlotte; Janting, Jakob; Schultz, Peter;

    2006-01-01

    the electrodes on the SU-8 chip to a printed circuit board. Here, we present two different methods of electrically connecting an SU-8 chip, which contains a microfluidic network and free-hanging mechanical parts. The tested electrical interconnection techniques are flip chip bonding using underfill or flip chip...... bonding using an anisotropic conductive film (ACF). These are both widely used in the Si industry and might also be used for the large scale interconnection of SU-8 chips. The SU-8 chip, to which the interconnections are made, has a microfluidic channel with integrated micrometer-sized cantilevers...... that can be used for label-free biochemical detection. All the bonding tests are compared with results obtained using similar Si chips. It is found that it is significantly more complicated to interconnect SU-8 than Si cantilever chips primarily due to the softness of SU-8....

  3. On Energy Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks

    CERN Document Server

    Comaniciu, Cristina

    2007-01-01

    In this paper, a hierarchical cross-layer design approach is proposed to increase energy efficiency in ad hoc networks through joint adaptation of nodes' transmitting powers and route selection. The design maintains the advantages of the classic OSI model, while accounting for the cross-coupling between layers, through information sharing. The proposed joint power control and routing algorithm is shown to increase significantly the overall energy efficiency of the network, at the expense of a moderate increase in complexity. Performance enhancement of the joint design using multiuser detection is also investigated, and it is shown that the use of multiuser detection can increase the capacity of the ad hoc network significantly for a given level of energy consumption.

  4. Synchronization of chaotic systems and identification of nonlinear systems by using recurrent hierarchical type-2 fuzzy neural networks.

    Science.gov (United States)

    Mohammadzadeh, Ardashir; Ghaemi, Sehraneh

    2015-09-01

    This paper proposes a novel approach for training of proposed recurrent hierarchical interval type-2 fuzzy neural networks (RHT2FNN) based on the square-root cubature Kalman filters (SCKF). The SCKF algorithm is used to adjust the premise part of the type-2 FNN and the weights of defuzzification and the feedback weights. The recurrence property in the proposed network is the output feeding of each membership function to itself. The proposed RHT2FNN is employed in the sliding mode control scheme for the synchronization of chaotic systems. Unknown functions in the sliding mode control approach are estimated by RHT2FNN. Another application of the proposed RHT2FNN is the identification of dynamic nonlinear systems. The effectiveness of the proposed network and its learning algorithm is verified by several simulation examples. Furthermore, the universal approximation of RHT2FNNs is also shown.

  5. On Energy-Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Poor HVincent

    2007-01-01

    Full Text Available A hierarchical cross-layer design approach is proposed to increase energy efficiency in ad hoc networks through joint adaptation of nodes' transmitting powers and route selection. The design maintains the advantages of the classic OSI model, while accounting for the cross-coupling between layers, through information sharing. The proposed joint power control and routing algorithm is shown to increase significantly the overall energy efficiency of the network, at the expense of a moderate increase in complexity. Performance enhancement of the joint design using multiuser detection is also investigated, and it is shown that the use of multiuser detection can increase the capacity of the ad hoc network significantly for a given level of energy consumption.

  6. Facile solid-state synthesis of Ni@C nanosheet-assembled hierarchical network for high-performance lithium storage

    Science.gov (United States)

    Gu, Jinghe; Li, Qiyun; Zeng, Pan; Meng, Yulin; Zhang, Xiukui; Wu, Ping; Zhou, Yiming

    2017-08-01

    Micro/nano-architectured transition-metal@C hybrids possess unique structural and compositional features toward lithium storage, and are thus expected to manifest ideal anodic performances in advanced lithium-ion batteries (LIBs). Herein, we propose a facile and scalable solid-state coordination and subsequent pyrolysis route for the formation of a novel type of micro/nano-architectured transition-metal@C hybrid (i.e., Ni@C nanosheet-assembled hierarchical network, Ni@C network). Moreover, this coordination-pyrolysis route has also been applied for the construction of bare carbon network using zinc salts instead of nickel salts as precursors. When applied as potential anodic materials in LIBs, the Ni@C network exhibits Ni-content-dependent electrochemical performances, and the partially-etched Ni@C network manifests markedly enhanced Li-storage performances in terms of specific capacities, cycle life, and rate capability than the pristine Ni@C network and carbon network. The proposed solid-state coordination and pyrolysis strategy would open up new opportunities for constructing micro/nano-architectured transition-metal@C hybrids as advanced anode materials for LIBs.

  7. Bistability of mixed states in a neural network storing hierarchical patterns

    Science.gov (United States)

    Toya, Kaname; Fukushima, Kunihiko; Kabashima, Yoshiyuki; Okada, Masato

    2000-04-01

    We discuss the properties of equilibrium states in an autoassociative memory model storing hierarchically correlated patterns (hereafter, hierarchical patterns). We will show that symmetric mixed states (hereafter, mixed states) are bistable on the associative memory model storing the hierarchical patterns in a region of the ferromagnetic phase. This means that the first-order transition occurs in this ferromagnetic phase. We treat these contents with a statistical mechanical method (SCSNA) and by computer simulation. Finally, we discuss a physiological implication of this model. Sugase et al (1999 Nature 400 869) analysed the time-course of the information carried by the firing of face-responsive neurons in the inferior temporal cortex. We also discuss the relation between the theoretical results and the physiological experiments of Sugase et al .

  8. The Super Locally Twisted Cube Interconnection Networks and Their Properties%超级局部扭立方体互连网络及其性质

    Institute of Scientific and Technical Information of China (English)

    王喜; 樊建席; 韩月娟; 周吴军; 张书奎

    2012-01-01

    局部扭立方体是近年来提出的超立方体的一个变型,由于它的许多优越性质(如低直径),在并行处理领域越来越受到人们的重视.然而,像超立方体一样,它也有一个缺点,即要使局部扭立方体升级,就必须成倍地增加其顶点个数.为了解决这一问题,文中将顶点个数为2的次幂的局部扭立方体推广到具有任意个顶点的互连网络,提出了超级局部扭立方体(SLTC)的定义,并证明它保持了局部扭立方体的最高连通度、对数级的直径和顶点度数、Hamilton性质等方面的优良性质,从而证明了超级局部扭立方体是既保持了局部扭立方体的多种优越性质又易于升级的互连网络.%The recently introduced interconnection network, the locally twisted cube, has attracted much attention in the parallel processing area due to its many attractive features, for example: the diameter of the locally twisted cube is approximately half that of the hypercube. However, like the hypercube, it is necessary to double the node number to upgrade the locally twisted cube. In order to solve the problem, this paper generalizes the locally twisted cube with node number of power 2 to the interconnection network with arbitrary node number, and proposes a definition of the super locally twisted cube (SLTC). We prove that, the super locally twisted cube has the greatest connectivity, the logarithm node degree and diameter, and the Hamilton property. Thus, it is proved that the super locally twisted cubes are a kind of interconnection networks which keep the advantageous properties of locally twisted cubes and are easy to be upgraded.

  9. 一种 RPR 多环互联网络公平算法%A Fairness Algorithm of Interconnected RPR Network

    Institute of Scientific and Technical Information of China (English)

    梁德智

    2013-01-01

      针对 RPR 公平算法在应用于 RPR 多环互联网络时出现诸多对网络运行不利因素的问题,提出一种改进的、用于 RPR 多环互联网络的公平算法,通过理论分析及仿真验证,表明改进后的公平算法能够提高传输效率,与单环公平算法比较,能更有效地发挥 RPR 多环互联网络的性能。%In this paper, we focus in unfavorable factors of the standard fairness algorithm when it used in interconnected RPR network. And get an improved fairness algorithm which is more suitable for interconnected RPR. The result of theoreti-cal analysis and computer simulation show the improved fairness algorithm is more efficient.

  10. Hierarchical spatial segregation of two Mediterranean vole species: the role of patch-network structure and matrix composition.

    Science.gov (United States)

    Pita, Ricardo; Lambin, Xavier; Mira, António; Beja, Pedro

    2016-09-01

    According to ecological theory, the coexistence of competitors in patchy environments may be facilitated by hierarchical spatial segregation along axes of environmental variation, but empirical evidence is limited. Cabrera and water voles show a metapopulation-like structure in Mediterranean farmland, where they are known to segregate along space, habitat, and time axes within habitat patches. Here, we assess whether segregation also occurs among and within landscapes, and how this is influenced by patch-network and matrix composition. We surveyed 75 landscapes, each covering 78 ha, where we mapped all habitat patches potentially suitable for Cabrera and water voles, and the area effectively occupied by each species (extent of occupancy). The relatively large water vole tended to be the sole occupant of landscapes with high habitat amount but relatively low patch density (i.e., with a few large patches), and with a predominantly agricultural matrix, whereas landscapes with high patch density (i.e., many small patches) and low agricultural cover, tended to be occupied exclusively by the small Cabrera vole. The two species tended to co-occur in landscapes with intermediate patch-network and matrix characteristics, though their extents of occurrence were negatively correlated after controlling for environmental effects. In combination with our previous studies on the Cabrera-water vole system, these findings illustrated empirically the occurrence of hierarchical spatial segregation, ranging from within-patches to among-landscapes. Overall, our study suggests that recognizing the hierarchical nature of spatial segregation patterns and their major environmental drivers should enhance our understanding of species coexistence in patchy environments.

  11. Design of MOEMS adjustable optical delay line to reduce link set-up time in a tera-bit/s optical interconnection network.

    Science.gov (United States)

    Jing, Wencai; Zhang, Yimo; Zhou, Ge

    2002-07-15

    A new structure for bit synchronization in a tera-bit/s optical interconnection network has been designed using micro-electro-mechanical system (MEMS) technique. Link multiplexing has been adopted to reduce data packet communication latency. To eliminate link set-up time, adjustable optical delay lines (AODLs) have been adopted to shift the phases of the distributed optical clock signals for bit synchronization. By changing the optical path distance of the optical clock signal, the phase of the clock signal can be shifted at a very high resolution. A phase-shift resolution of 0.1 ps can be easily achieved with 30-microm alternation of the optical path length in vacuum.

  12. Nanophotonic Devices for Optical Interconnect

    DEFF Research Database (Denmark)

    Van Thourhout, D.; Spuesens, T.; Selvaraja, S.K.;

    2010-01-01

    We review recent progress in nanophotonic devices for compact optical interconnect networks. We focus on microdisk-laser-based transmitters and discuss improved design and advanced functionality including all-optical wavelength conversion and flip-flops. Next we discuss the fabrication uniformity...... of the passive routing circuits and their thermal tuning. Finally, we discuss the performance of a wavelength selective detector....

  13. Interconnection of J-lossless behaviours

    NARCIS (Netherlands)

    Rao, S.

    In this paper, motivated by the phenomenon of the interconnection of lossless electrical networks, a class of behaviours known as J-lossless behaviours is introduced, where J is a symmetric two-variable polynomial matrix. It is shown that for certain values of J, interconnection of J-lossless

  14. Interconnection of J-lossless behaviours

    NARCIS (Netherlands)

    Rao, Shodhan

    2010-01-01

    In this paper, motivated by the phenomenon of the interconnection of lossless electrical networks, a class of behaviours known as J-lossless behaviours is introduced, where J is a symmetric two-variable polynomial matrix. It is shown that for certain values of J, interconnection of J-lossless behav

  15. Task 5. Grid interconnection of building integrated and other dispersed photovoltaic power systems. Risk analysis of islanding of photovoltaic power systems within low voltage distribution networks

    Energy Technology Data Exchange (ETDEWEB)

    Cullen, N. [Freelance Consultant, Hillside House, Swindon SN1 3QA (United Kingdom); Thornycroft, J. [Halcrow Group Ltd, Burderop Park, Swindon SN4 0QD (United Kingdom); Collinson, A. [EA Technology, Capenhurst Technology Park, Chester CH1 6ES (United Kingdom)

    2002-03-15

    This report for the International Energy Agency (IEA) made by Task 5 of the Photovoltaic Power Systems (PVPS) programme presents the results of a risk analysis concerning photovoltaic power systems islanding in low-voltage distribution networks. The mission of the Photovoltaic Power Systems Programme is to enhance the international collaboration efforts which accelerate the development and deployment of photovoltaic solar energy. Task 5 deals with issues concerning grid-interconnection and distributed PV power systems. The purpose of this study was to apply formal risk analysis techniques to the issue of islanding of photovoltaic power systems within low voltage distribution networks. The aim was to determine the additional level of risk that islanding could present to the safety of customers and network maintenance staff. The study identified the reliability required for islanding detection and control systems based on standard procedures for developing a safety assurance strategy. The main conclusions are presented and discussed and recommendations are made. The report is concluded with an appendix that lists the relative risks involved.

  16. Qwest provides high-speed network for major research institutions in Illinois eight campuses interconnected to foster collaborative, virtual research

    CERN Multimedia

    2003-01-01

    Qwest Communications International Inc. today announced that Argonne National Laboratory has deployed Qwest's broadband fiber optic network for the Illinois Wired/Wireless Infrastructure for Research and Education (I-WIRE) project (1 page).

  17. A blind hierarchical coherent search for gravitational-wave signals from coalescing compact binaries in a network of interferometric detectors

    Energy Technology Data Exchange (ETDEWEB)

    Bose, Sukanta; Dayanga, Thilina; Ghosh, Shaon; Talukder, Dipongkar, E-mail: sukanta@wsu.edu, E-mail: wdayanga@wsu.edu, E-mail: shaonghosh@mail.wsu.edu, E-mail: talukder_d@wsu.edu [Department of Physics and Astronomy, Washington State University, 1245 Webster, Pullman, WA 99164-2814 (United States)

    2011-07-07

    We describe a hierarchical data analysis pipeline for coherently searching for gravitational-wave signals from non-spinning compact binary coalescences (CBCs) in the data of multiple earth-based detectors. This search assumes no prior information on the sky position of the source or the time of occurrence of its transient signals and, hence, is termed 'blind'. The pipeline computes the coherent network search statistic that is optimal in stationary, Gaussian noise. More importantly, it allows for the computation of a suite of alternative multi-detector coherent search statistics and signal-based discriminators that can improve the performance of CBC searches in real data, which can be both non-stationary and non-Gaussian. Also, unlike the coincident multi-detector search statistics that have been employed so far, the coherent statistics are different in the sense that they check for the consistency of the signal amplitudes and phases in the different detectors with their different orientations and with the signal arrival times in them. Since the computation of coherent statistics entails searching in the sky, it is more expensive than that of the coincident statistics that do not require it. To reduce computational costs, the first stage of the hierarchical pipeline constructs coincidences of triggers from the multiple interferometers, by requiring their proximity in time and component masses. The second stage follows up on these coincident triggers by computing the coherent statistics. Here, we compare the performances of this hierarchical pipeline with and without the second (or coherent) stage in Gaussian noise. Although introducing hierarchy can be expected to cause some degradation in the detection efficiency compared to that of a single-stage coherent pipeline, nevertheless it improves the computational speed of the search considerably. The two main results of this work are as follows: (1) the performance of the hierarchical coherent pipeline on

  18. Network Physiology: Mapping Interactions Between Networks of Physiologic Networks

    Science.gov (United States)

    Ivanov, Plamen Ch.; Bartsch, Ronny P.

    The human organism is an integrated network of interconnected and interacting organ systems, each representing a separate regulatory network. The behavior of one physiological system (network) may affect the dynamics of all other systems in the network of physiologic networks. Due to these interactions, failure of one system can trigger a cascade of failures throughout the entire network. We introduce a systematic method to identify a network of interactions between diverse physiologic organ systems, to quantify the hierarchical structure and dynamics of this network, and to track its evolution under different physiologic states. We find a robust relation between network structure and physiologic states: every state is characterized by specific network topology, node connectivity and links strength. Further, we find that transitions from one physiologic state to another trigger a markedly fast reorganization in the network of physiologic interactions on time scales of just a few minutes, indicating high network flexibility in response to perturbations. This reorganization in network topology occurs simultaneously and globally in the entire network as well as at the level of individual physiological systems, while preserving a hierarchical order in the strength of network links. Our findings highlight the need of an integrated network approach to understand physiologic function, since the framework we develop provides new information which can not be obtained by studying individual systems. The proposed system-wide integrative approach may facilitate the development of a new field, Network Physiology.

  19. The angular nature of road networks

    CERN Document Server

    Molinero, Carlos; Arcaute, Elsa

    2015-01-01

    Road networks are characterised by several structural and geometric properties. Their topological structure determines partially its hierarchical arrangement, but since these are networks that are spatially situated and, therefore, spatially constrained, to fully understand the role that each road plays in the system it is fundamental to characterize the influence that geometrical properties have over the network's behaviour. In this work, we percolate the UK's road network using the relative angle between street segments as the occupation probability. We argue that road networks undergo a non-equilibrium first-order phase transition at the moment the main roads start to interconnect forming the spanning percolation cluster. The percolation process uncovers the hierarchical structure of the roads in the network, and as such, its classification. Furthermore, this technique serves to extract the set of most important roads of the network and to create a hierarchical index for each road in the system.

  20. Perturbation Detection Through Modeling of Gene Expression on a Latent Biological Pathway Network: A Bayesian hierarchical approach.

    Science.gov (United States)

    Pham, Lisa M; Carvalho, Luis; Schaus, Scott; Kolaczyk, Eric D

    Cellular response to a perturbation is the result of a dynamic system of biological variables linked in a complex network. A major challenge in drug and disease studies is identifying the key factors of a biological network that are essential in determining the cell's fate. Here our goal is the identification of perturbed pathways from high-throughput gene expression data. We develop a three-level hierarchical model, where (i) the first level captures the relationship between gene expression and biological pathways using confirmatory factor analysis, (ii) the second level models the behavior within an underlying network of pathways induced by an unknown perturbation using a conditional autoregressive model, and (iii) the third level is a spike-and-slab prior on the perturbations. We then identify perturbations through posterior-based variable selection. We illustrate our approach using gene transcription drug perturbation profiles from the DREAM7 drug sensitivity predication challenge data set. Our proposed method identified regulatory pathways that are known to play a causative role and that were not readily resolved using gene set enrichment analysis or exploratory factor models. Simulation results are presented assessing the performance of this model relative to a network-free variant and its robustness to inaccuracies in biological databases.

  1. Interconnection and transportation networks: adjustments and stability; Reseaux d'interconnexion et de transport: reglages et stabilite

    Energy Technology Data Exchange (ETDEWEB)

    Bornard, P. [Reseau de Transport d' Electricite (RTE), Div. Systeme Electrique, 92 - Paris la Defense (France); Pavard, M. [Electricite de France (EDF), 75 - Paris (France); Testud, G. [Reseau de Transport d' Electricite (RTE), Dept. Exploitation du Systeme Electrique, 92 - Paris la Defense (France)

    2005-10-01

    Keeping the mastery of the safety of a power transportation system and respecting the contractual commitments with respect to the network users implies the implementation of efficient frequency and voltage adjustment systems. This article presents a synthetic overview of the methods and means implemented to ensure the adjustment of the voltage and frequency and the stability of very-high voltage power transportation networks: 1 - recalls of the general problem; 2 - frequency and active power adjustment: adapting generation to consumption, adapting consumption to generation; 3 - voltage and reactive power adjustment: duality of the voltage-reactive compensation adjustment, compensation of the reactive power, voltage adjustment chain, voltage adjustment of very high voltage networks, collapse of the voltage plan; 4 - alternators stability: static stability, transient stability, numerical simulation methods, stability improvement; 5 - conclusion. (J.S.)

  2. Design and implementation of a system to interconnect VoIP services and CERN’s telephony networks

    CERN Document Server

    Pohančeník, Martin; Segeč, Pavel

    The purpose of this diploma thesis was to design and implement a system that would provide an interface of CERN’s telephony network for Voice over IP services (SIP-based services specifically). This system thus serves as an entry point for calls originating from outside of CERN’s telephony network and enables users of these services to call CERN’s fixed and mobile phone numbers. The theoretical part of the thesis talks in detail about the project specification and describes the goals that were trying to be achieved. It also describes the topic of VoIP telephony and current trends, alongside with analysis of the current telephone network of CERN. The practical part is targeted to explain the design of the solution and deployment of the system at CERN. The final part of the thesis shows testing scenarios and results and states several extension capabilities.

  3. 一种实用的互联网络RPn(k)及其路由算法%Interconnection network RPn ( k) and its routing algorithms

    Institute of Scientific and Technical Information of China (English)

    邢长明; 杨林; 刘方爱

    2011-01-01

    Based on these properties of Petersen graph and the simple scalable property of ring, presented a new interconnection network RPn (k) and analyzed the properties of the RPn (k).RPn (k) not only has good regularity and extensibility, but also has shorter diameter, better grouping ability and smaller construction costs than the RP(k) network.Finally, discussed the routing algorithm of RPn (k) and proposed the point-to-point routing on the RPn (k) network.The performances of the algorithm is [k/2]+ 2n routing time steps.When the number of nodes is same, the communication efficiency of the routing algorithm on RPn(k) is better than the routing algorithm on RP(k) network.%基于环的简单扩展性和Petersen图的短直径,提出了一类新型互联网络RPn(k),研究了该互联网络的性质,它不但具有正则性和良好的可扩展性,还具有比RP(k)互联网络更短的网络直径、更好的可分组性以及更小的网络构造开销.讨论了RPn(k)网络的路由问题,给出了点点路由算法,其通信效率为[k/2]+2n个时间步.在节点个数相同时,RPn(k)比RP(k)网络上的路由算法的通信效率有明显提高.

  4. Enzyme-regulated the changes of pH values for assembling a colorimetric and multistage interconnection logic network with multiple readouts.

    Science.gov (United States)

    Huang, Yanyan; Ran, Xiang; Lin, Youhui; Ren, Jinsong; Qu, Xiaogang

    2015-04-22

    Based on enzymatic reactions-triggered changes of pH values and biocomputing, a novel and multistage interconnection biological network with multiple easy-detectable signal outputs has been developed. Compared with traditional chemical computing, the enzyme-based biological system could overcome the interference between reactions or the incompatibility of individual computing gates and offer a unique opportunity to assemble multicomponent/multifunctional logic circuitries. Our system included four enzyme inputs: β-galactosidase (β-gal), glucose oxidase (GOx), esterase (Est) and urease (Ur). With the assistance of two signal transducers (gold nanoparticles and acid-base indicators) or pH meter, the outputs of the biological network could be conveniently read by the naked eyes. In contrast to current methods, the approach present here could realize cost-effective, label-free and colorimetric logic operations without complicated instrument. By designing a series of Boolean logic operations, we could logically make judgment of the compositions of the samples on the basis of visual output signals. Our work offered a promising paradigm for future biological computing technology and might be highly useful in future intelligent diagnostics, prodrug activation, smart drug delivery, process control, and electronic applications. Copyright © 2015 Elsevier B.V. All rights reserved.

  5. A Resting-State Brain Functional Network Study in MDD Based on Minimum Spanning Tree Analysis and the Hierarchical Clustering

    Directory of Open Access Journals (Sweden)

    Xiaowei Li

    2017-01-01

    Full Text Available A large number of studies demonstrated that major depressive disorder (MDD is characterized by the alterations in brain functional connections which is also identifiable during the brain’s “resting-state.” But, in the present study, the approach of constructing functional connectivity is often biased by the choice of the threshold. Besides, more attention was paid to the number and length of links in brain networks, and the clustering partitioning of nodes was unclear. Therefore, minimum spanning tree (MST analysis and the hierarchical clustering were first used for the depression disease in this study. Resting-state electroencephalogram (EEG sources were assessed from 15 healthy and 23 major depressive subjects. Then the coherence, MST, and the hierarchical clustering were obtained. In the theta band, coherence analysis showed that the EEG coherence of the MDD patients was significantly higher than that of the healthy controls especially in the left temporal region. The MST results indicated the higher leaf fraction in the depressed group. Compared with the normal group, the major depressive patients lost clustering in frontal regions. Our findings suggested that there was a stronger brain interaction in the MDD group and a left-right functional imbalance in the frontal regions for MDD controls.

  6. Energy Efficient Backoff Hierarchical Clustering Algorithms for Multi-Hop Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    Jun Wang; Yong-Tao Cao; Jun-Yuan Xie; Shi-Fu Chen

    2011-01-01

    Compared with flat routing protocols, clustering is a fundamental performance improvement technique in wireless sensor networks, which can increase network scalability and lifetime. In this paper, we integrate the multi-hop technique with a backoff-based clustering algorithm to organize sensors. By using an adaptive backoff strategy, the algorithm not only realizes load balance among sensor node, but also achieves fairly uniform cluster head distribution across the network. Simulation results also demonstrate our algorithm is more energy-efficient than classical ones. Our algorithm is also easily extended to generate a hierarchy of cluster heads to obtain better network management and energy-efficiency.

  7. Risk Assessment for Mobile Systems Through a Multilayered Hierarchical Bayesian Network.

    Science.gov (United States)

    Li, Shancang; Tryfonas, Theo; Russell, Gordon; Andriotis, Panagiotis

    2016-08-01

    Mobile systems are facing a number of application vulnerabilities that can be combined together and utilized to penetrate systems with devastating impact. When assessing the overall security of a mobile system, it is important to assess the security risks posed by each mobile applications (apps), thus gaining a stronger understanding of any vulnerabilities present. This paper aims at developing a three-layer framework that assesses the potential risks which apps introduce within the Android mobile systems. A Bayesian risk graphical model is proposed to evaluate risk propagation in a layered risk architecture. By integrating static analysis, dynamic analysis, and behavior analysis in a hierarchical framework, the risks and their propagation through each layer are well modeled by the Bayesian risk graph, which can quantitatively analyze risks faced to both apps and mobile systems. The proposed hierarchical Bayesian risk graph model offers a novel way to investigate the security risks in mobile environment and enables users and administrators to evaluate the potential risks. This strategy allows to strengthen both app security as well as the security of the entire system.

  8. Inference of hierarchical regulatory network of estrogen-dependent breast cancer through ChIP-based data

    Directory of Open Access Journals (Sweden)

    Parvin Jeffrey

    2010-12-01

    Full Text Available Abstract Background Global profiling of in vivo protein-DNA interactions using ChIP-based technologies has evolved rapidly in recent years. Although many genome-wide studies have identified thousands of ERα binding sites and have revealed the associated transcription factor (TF partners, such as AP1, FOXA1 and CEBP, little is known about ERα associated hierarchical transcriptional regulatory networks. Results In this study, we applied computational approaches to analyze three public available ChIP-based datasets: ChIP-seq, ChIP-PET and ChIP-chip, and to investigate the hierarchical regulatory network for ERα and ERα partner TFs regulation in estrogen-dependent breast cancer MCF7 cells. 16 common TFs and two common new TF partners (RORA and PITX2 were found among ChIP-seq, ChIP-chip and ChIP-PET datasets. The regulatory networks were constructed by scanning the ChIP-peak region with TF specific position weight matrix (PWM. A permutation test was performed to test the reliability of each connection of the network. We then used DREM software to perform gene ontology function analysis on the common genes. We found that FOS, PITX2, RORA and FOXA1 were involved in the up-regulated genes. We also conducted the ERα and Pol-II ChIP-seq experiments in tamoxifen resistance MCF7 cells (denoted as MCF7-T in this study and compared the difference between MCF7 and MCF7-T cells. The result showed very little overlap between these two cells in terms of targeted genes (21.2% of common genes and targeted TFs (25% of common TFs. The significant dissimilarity may indicate totally different transcriptional regulatory mechanisms between these two cancer cells. Conclusions Our study uncovers new estrogen-mediated regulatory networks by mining three ChIP-based data in MCF7 cells and ChIP-seq data in MCF7-T cells. We compared the different ChIP-based technologies as well as different breast cancer cells. Our computational analytical approach may guide biologists to

  9. Inference of hierarchical regulatory network of estrogen-dependent breast cancer through ChIP-based data

    Science.gov (United States)

    2010-01-01

    Background Global profiling of in vivo protein-DNA interactions using ChIP-based technologies has evolved rapidly in recent years. Although many genome-wide studies have identified thousands of ERα binding sites and have revealed the associated transcription factor (TF) partners, such as AP1, FOXA1 and CEBP, little is known about ERα associated hierarchical transcriptional regulatory networks. Results In this study, we applied computational approaches to analyze three public available ChIP-based datasets: ChIP-seq, ChIP-PET and ChIP-chip, and to investigate the hierarchical regulatory network for ERα and ERα partner TFs regulation in estrogen-dependent breast cancer MCF7 cells. 16 common TFs and two common new TF partners (RORA and PITX2) were found among ChIP-seq, ChIP-chip and ChIP-PET datasets. The regulatory networks were constructed by scanning the ChIP-peak region with TF specific position weight matrix (PWM). A permutation test was performed to test the reliability of each connection of the network. We then used DREM software to perform gene ontology function analysis on the common genes. We found that FOS, PITX2, RORA and FOXA1 were involved in the up-regulated genes. We also conducted the ERα and Pol-II ChIP-seq experiments in tamoxifen resistance MCF7 cells (denoted as MCF7-T in this study) and compared the difference between MCF7 and MCF7-T cells. The result showed very little overlap between these two cells in terms of targeted genes (21.2% of common genes) and targeted TFs (25% of common TFs). The significant dissimilarity may indicate totally different transcriptional regulatory mechanisms between these two cancer cells. Conclusions Our study uncovers new estrogen-mediated regulatory networks by mining three ChIP-based data in MCF7 cells and ChIP-seq data in MCF7-T cells. We compared the different ChIP-based technologies as well as different breast cancer cells. Our computational analytical approach may guide biologists to further study the

  10. Cross-linked carbon network with hierarchical porous structure for high performance solid-state electrochemical capacitor

    Science.gov (United States)

    Cheng, Yongliang; Huang, Liang; Xiao, Xu; Yao, Bin; Hu, Zhimi; Li, Tianqi; Liu, Kang; Zhou, Jun

    2016-09-01

    The development of portable electronics strongly requires flexible, lightweight, and inexpensive energy-storage devices with high power density, long cycling stability, and high reliability. In this work, we prepare a flexible solid-state electrochemical capacitor using cross-linked hierarchical porous carbon network as electrode material via electrospinning and carbonization process. This device can reversibly deliver a maximum energy density of 10.18 W h/kg with excellent cycling stability which achieves 95% capacitance retention after 20000 charge/discharge cycles. Moreover, it also demonstrates outstanding mechanical flexibility and excellent capacitance retention even when the device is repeatedly bended 10000 cycles under 90°. All of these results suggest its promising perspective in flexible energy storage device.

  11. Virtual and Dynamic Hierarchical Architecture:an overlay network topology for discovering grid services with high performance

    Institute of Scientific and Technical Information of China (English)

    黄理灿; 吴朝晖; 潘云鹤

    2004-01-01

    This paper presents an overlay network topology called Virtual and Dynamic Hierarchical Architecture (VDHA) for discovering Grid services with high performance. Service discovery based on VDHA has scalable, autonomous, efficient, reliable and quick responsive. We propose two service discovery algorithms. Full Search Query and Discovery Protocol (FSQDP) discovers the nodes that match the request message from all N nodes, which has time complexity O(logN), space complexity O(nvg) (nvg being node numbers of each virtual group), and message-cost O(N), and Domain-Specific Query and Discovery Protocol (DSQDP) searches nodes in only specific domains with time complexity O(nvg), space complexity O(nvg), and message-cost O(nvg). In this paper, we also describe VDHA, its formal definition, and Grid Group Management Protocol.

  12. Criticality governed by the stable renormalization fixed point of the Ising model in the hierarchical small-world network.

    Science.gov (United States)

    Nogawa, Tomoaki; Hasegawa, Takehisa; Nemoto, Koji

    2012-09-01

    We study the Ising model in a hierarchical small-world network by renormalization group analysis and find a phase transition between an ordered phase and a critical phase, which is driven by the coupling strength of the shortcut edges. Unlike ordinary phase transitions, which are related to unstable renormalization fixed points (FPs), the singularity in the ordered phase of the present model is governed by the FP that coincides with the stable FP of the ordered phase. The weak stability of the FP yields peculiar criticalities, including logarithmic behavior. On the other hand, the critical phase is related to a nontrivial FP, which depends on the coupling strength and is continuously connected to the ordered FP at the transition point. We show that this continuity indicates the existence of a finite correlation-length-like quantity inside the critical phase, which diverges upon approaching the transition point.

  13. Multi-level infrastructure of interconnected testbeds of large-scale wireless sensor networks (MI2T-WSN)

    CSIR Research Space (South Africa)

    Abu-Mahfouz, Adnan M

    2012-06-01

    Full Text Available ] N. Wirawan, S. Rachman, I. Pratomo and N. Mita, "Design of low cost wireless sensor networks-based environmental monitoring system for developing country," in Proceedings of the 14th IEEE Asia-Pacific Conference on Communications — APCC '08...-real testbeds will be constructed. A simple web-based interface will be created to allow researchers, developers and students within our research institute and collaborating universities to access and use these two testbeds. In the second phase, the other...

  14. Hierarchical Group Based Mutual Authentication and Key Agreement for Machine Type Communication in LTE and Future 5G Networks

    Directory of Open Access Journals (Sweden)

    Probidita Roychoudhury

    2017-01-01

    Full Text Available In view of the exponential growth in the volume of wireless data communication among heterogeneous devices ranging from smart phones to tiny sensors across a wide range of applications, 3GPP LTE-A has standardized Machine Type Communication (MTC which allows communication between entities without any human intervention. The future 5G cellular networks also envisage massive deployment of MTC Devices (MTCDs which will increase the total number of connected devices hundredfold. This poses a huge challenge to the traditional cellular system processes, especially the traditional Mutual Authentication and Key Agreement (AKA mechanism currently used in LTE systems, as the signaling load caused by the increasingly large number of devices may have an adverse effect on the regular Human to Human (H2H traffic. A solution in the literature has been the use of group based architecture which, while addressing the authentication traffic, has their share of issues. This paper introduces Hierarchical Group based Mutual Authentication and Key Agreement (HGMAKA protocol to address those issues and also enables the small cell heterogeneous architecture in line with 5G networks to support MTC services. The aggregate Message Authentication Code based approach has been shown to be lightweight and significantly efficient in terms of resource usage compared to the existing protocols, while being robust to authentication message failures, and scalable to heterogeneous network architectures.

  15. RAHIM: Robust Adaptive Approach Based on Hierarchical Monitoring Providing Trust Aggregation for Wireless Sensor Networks

    NARCIS (Netherlands)

    Labraoui, Nabila; Gueroui, Mourad; Aliouat, Makhlouf; Petit, Jonathan

    2011-01-01

    In-network data aggregation has a great impact on the energy consumption in large-scale wireless sensor networks. However, the resource constraints and vulnerable deployment environments challenge the application of this technique in terms of security and efficiency. A compromised node may forge

  16. RAHIM: Robust Adaptive Approach Based on Hierarchical Monitoring Providing Trust Aggregation for Wireless Sensor Networks

    NARCIS (Netherlands)

    Labraoui, Nabila; Gueroui, Mourad; Aliouat, Makhlouf; Petit, Jonathan

    2011-01-01

    In-network data aggregation has a great impact on the energy consumption in large-scale wireless sensor networks. However, the resource constraints and vulnerable deployment environments challenge the application of this technique in terms of security and efficiency. A compromised node may forge arb

  17. Self-organized Critical Model Based on Complex Brain Networks with Hierarchical Organization

    Institute of Scientific and Technical Information of China (English)

    ZHANG Ying-Yue; ZHANG Gui-Qing; YANG Qiu-Ying; CHEN Tian-Lun

    2008-01-01

    The dynamical behavior in the cortical brain network of macaque is studied by modelling each cortical area with a subnetwork of interacting excitable neurons.We find that the avalanche of our model on different levels exhibits power-law.Furthermore the power-law exponent of the distribution and the average avalanche Size are affected by the topology of the network.

  18. On the use of topological features and hierarchical characterization for disambiguating names in collaborative networks

    CERN Document Server

    Amancio, Diego R; Costa, Luciano da F; 10.1209/0295-5075/99/48002

    2013-01-01

    Many features of complex systems can now be unveiled by applying statistical physics methods to treat them as social networks. The power of the analysis may be limited, however, by the presence of ambiguity in names, e.g., caused by homonymy in collaborative networks. In this paper we show that the ability to distinguish between homonymous authors is enhanced when longer-distance connections are considered, rather than looking at only the immediate neighbors of a node in the collaborative network. Optimized results were obtained upon using the 3rd hierarchy in connections. Furthermore, reasonable distinction among authors could also be achieved upon using pattern recognition strategies for the data generated from the topology of the collaborative network. These results were obtained with a network from papers in the arXiv repository, into which homonymy was deliberately introduced to test the methods with a controlled, reliable dataset. In all cases, several methods of supervised and unsupervised machine lear...

  19. Last electrical interconnections

    CERN Multimedia

    CERN audiovisual service

    2009-01-01

    Sector 3-4 was closely followed by Sector 5-6, where interconnections were completely closed two days later. All the helium pressure release ports were installed in the sector back in April, but the sector remained open so that tests and repairs could be made on the copper stabilized busbar interconnections: in total ten busbar interconnections were repaired.

  20. Enzyme-regulated the changes of pH values for assembling a colorimetric and multistage interconnection logic network with multiple readouts

    Energy Technology Data Exchange (ETDEWEB)

    Huang, Yanyan; Ran, Xiang; Lin, Youhui [Laboratory of Chemical Biology, Division of Biological Inorganic Chemistry, State Key Laboratory of Rare Earth Resource Utilization, Changchun Institute of Applied Chemistry, Chinese Academy of Sciences, Changchun, Jilin 130022 (China); Graduate School of University of Chinese Academy of Sciences, Beijing 100039 (China); Ren, Jinsong, E-mail: jren@ciac.ac.cn [Laboratory of Chemical Biology, Division of Biological Inorganic Chemistry, State Key Laboratory of Rare Earth Resource Utilization, Changchun Institute of Applied Chemistry, Chinese Academy of Sciences, Changchun, Jilin 130022 (China); Qu, Xiaogang [Laboratory of Chemical Biology, Division of Biological Inorganic Chemistry, State Key Laboratory of Rare Earth Resource Utilization, Changchun Institute of Applied Chemistry, Chinese Academy of Sciences, Changchun, Jilin 130022 (China)

    2015-04-22

    Highlights: • A colorimetric and multistage biological network has been developed. • This system was on the basis of the enzyme-regulated changes of pH values. • This enzyme-based system could assemble large biological circuit. • Two signal transducers (DNA/AuNPs and acid–base indicators) were used. • The compositions of samples could be detected through visual output signals. - Abstract: Based on enzymatic reactions-triggered changes of pH values and biocomputing, a novel and multistage interconnection biological network with multiple easy-detectable signal outputs has been developed. Compared with traditional chemical computing, the enzyme-based biological system could overcome the interference between reactions or the incompatibility of individual computing gates and offer a unique opportunity to assemble multicomponent/multifunctional logic circuitries. Our system included four enzyme inputs: β-galactosidase (β-gal), glucose oxidase (GOx), esterase (Est) and urease (Ur). With the assistance of two signal transducers (gold nanoparticles and acid–base indicators) or pH meter, the outputs of the biological network could be conveniently read by the naked eyes. In contrast to current methods, the approach present here could realize cost-effective, label-free and colorimetric logic operations without complicated instrument. By designing a series of Boolean logic operations, we could logically make judgment of the compositions of the samples on the basis of visual output signals. Our work offered a promising paradigm for future biological computing technology and might be highly useful in future intelligent diagnostics, prodrug activation, smart drug delivery, process control, and electronic applications.

  1. A data management proposal to connect in a hierarchical way nodes of the Spanish Long Term Ecological Research (LTER) network

    Science.gov (United States)

    Fuentes, Daniel; Pérez-Luque, Antonio J.; Bonet García, Francisco J.; Moreno-LLorca, Ricardo A.; Sánchez-Cano, Francisco M.; Suárez-Muñoz, María

    2017-04-01

    The Long Term Ecological Research (LTER) network aims to provide the scientific community, policy makers, and society with the knowledge and predictive understanding necessary to conserve, protect, and manage the ecosystems. LTER is organized into networks ranging from the global to national scale. In the top of network, the International Long Term Ecological Research (ILTER) Network coordinates among ecological researchers and LTER research networks at local, regional and global scales. In Spain, the Spanish Long Term Ecological Research (LTER-Spain) network was built to foster the collaboration and coordination between longest-lived ecological researchers and networks on a local scale. Currently composed by nine nodes, this network facilitates the data exchange, documentation and preservation encouraging the development of cross-disciplinary works. However, most nodes have no specific information systems, tools or qualified personnel to manage their data for continued conservation and there are no harmonized methodologies for long-term monitoring protocols. Hence, the main challenge is to place the nodes in its correct position in the network, providing the best tools that allow them to manage their data autonomously and make it easier for them to access information and knowledge in the network. This work proposes a connected structure composed by four LTER nodes located in southern Spain. The structure is built considering hierarchical approach: nodes that create information which is documented using metadata standards (such as Ecological Metadata Language, EML); and others nodes that gather metadata and information. We also take into account the capacity of each node to manage their own data and the premise that the data and metadata must be maintained where it is generated. The current state of the nodes is a follows: two of them have their own information management system (Sierra Nevada-Granada and Doñana Long-Term Socio-ecological Research Platform) and

  2. Brain networks for confidence weighting and hierarchical inference during probabilistic learning.

    Science.gov (United States)

    Meyniel, Florent; Dehaene, Stanislas

    2017-05-09

    Learning is difficult when the world fluctuates randomly and ceaselessly. Classical learning algorithms, such as the delta rule with constant learning rate, are not optimal. Mathematically, the optimal learning rule requires weighting prior knowledge and incoming evidence according to their respective reliabilities. This "confidence weighting" implies the maintenance of an accurate estimate of the reliability of what has been learned. Here, using fMRI and an ideal-observer analysis, we demonstrate that the brain's learning algorithm relies on confidence weighting. While in the fMRI scanner, human adults attempted to learn the transition probabilities underlying an auditory or visual sequence, and reported their confidence in those estimates. They knew that these transition probabilities could change simultaneously at unpredicted moments, and therefore that the learning problem was inherently hierarchical. Subjective confidence reports tightly followed the predictions derived from the ideal observer. In particular, subjects managed to attach distinct levels of confidence to each learned transition probability, as required by Bayes-optimal inference. Distinct brain areas tracked the likelihood of new observations given current predictions, and the confidence in those predictions. Both signals were combined in the right inferior frontal gyrus, where they operated in agreement with the confidence-weighting model. This brain region also presented signatures of a hierarchical process that disentangles distinct sources of uncertainty. Together, our results provide evidence that the sense of confidence is an essential ingredient of probabilistic learning in the human brain, and that the right inferior frontal gyrus hosts a confidence-based statistical learning algorithm for auditory and visual sequences.

  3. Two-user opportunistic scheduling using hierarchical modulations in wireless networks with heterogenous average link gains

    KAUST Repository

    Hossain, Md Jahangir

    2010-03-01

    Our contribution, in this paper, is two-fold. First, we analyze the performance of a hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) scheme, which was proposed by the authors, in a fading environment where different users have different average link gains. Specifically, we present a new expression for the spectral efficiency (SE) of the users and using this expression, we compare the degrees of fairness (DOF) of the TBS scheme with that of classical single user opportunistic scheduling schemes, namely, absolute carrier-to-noise ratio (CNR) based single-best user scheduling (SBS) and normalized CNR based proportional fair scheduling (PFS) schemes. The second contribution is that we propose a new hybrid two-user opportunistic scheduling (HTS) scheme based on our earlier proposed TBS scheme. This HTS scheme selects the first user based on the largest absolute CNR value among all the users while the second user is selected based on the ratios of the absolute CNRs to the corresponding average CNRs of the remaining users. The total transmission rate i.e., the constellation size is selected according to the absolute CNR of the first best user. The total transmission rate is then allocated among these selected users by joint consideration of their absolute CNRs and allocated number of information bit(s) are transmitted to them using hierarchical modulations. Numerical results are presented for a fading environment where different users experience independent but non-identical (i.n.d.) channel fading. These selected numerical results show that the proposed HTS scheme can considerably increase the system\\'s fairness without any degradation of the link spectral efficiency (LSE) i.e., the multiuser diversity gain compared to the classical SBS scheme. These results also show that the proposed HTS scheme has a lower fairness in comparison to the PFS scheme which suffers from a considerable degradation in LSE. © 2010 IEEE.

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

  5. Hierarchical block structures and high-resolution model selection in large networks

    CERN Document Server

    Peixoto, Tiago P

    2013-01-01

    Discovering the large-scale topological features in empirical networks is a crucial tool in understanding how complex systems function. However most existing methods used to obtain the modular structure of networks suffer from serious problems, such as the resolution limit on the size of communities, where smaller but well-defined clusters are not detectable when the network becomes large. This phenomenon occurs for the very popular approach of modularity optimization, but also for more principled ones based on statistical inference and model selection. Here we construct a nested generative model which, through a complete description of the entire network hierarchy at multiple scales, is capable of avoiding this limitation, and enables the detection of modular structure at levels far beyond those possible by current approaches. Even with this increased resolution, the method is based on the principle of parsimony, and is capable of separating signal from noise, and thus will not lead to the identification of ...

  6. Multipath Routing for Self-Organizing Hierarchical Mobile Ad-Hoc Networks – A Review

    OpenAIRE

    Udayachandran Ramasamy; Sankaranarayanan, K.

    2010-01-01

    Security has become a primary concern for providing protected communication between mobile nodes in a hostile environment. The characteristics of Ad-hoc networks (dynamic topology, infrastructure less, variable capacity links, etc) are origin of many issues. Limited bandwidth, energy constraints, high cost security are the encountered problems. This type of networks pose particular challenges in terms of Quality of Service (QoS) and performance. In this paper, the issues of multipath routing ...

  7. Inter-Cluster Routing Authentication for Ad Hoc Networks by a Hierarchical Key Scheme

    Institute of Scientific and Technical Information of China (English)

    Yueh-Min Huang; Hua-Yi Lin; Tzone-I Wang

    2006-01-01

    Dissimilar to traditional networks, the features of mobile wireless devices that can actively form a network without any infrastructure mean that mobile ad hoc networks frequently display partition due to node mobility or link failures. These indicate that an ad hoc network is difficult to provide on-line access to a trusted authority server. Therefore,applying traditional Public Key Infrastructure (PKI) security framework to mobile ad hoc networks will cause insecurities.This study proposes a scalable and elastic key management scheme integrated into Cluster Based Secure Routing Protocol (CBSRP) to enhance security and non-repudiation of routing authentication, and introduces an ID-Based internal routing authentication scheme to enhance the routing performance in an internal cluster. Additionally, a method of performing routing authentication between internal and external clusters, as well as inter-cluster routing authentication, is developed.The proposed cluster-based key management scheme distributes trust to an aggregation of cluster heads using a threshold scheme faculty, provides Certificate Authority (CA) with a fault tolerance mechanism to prevent a single point of compromise or failure, and saves CA large repositories from maintaining member certificates, making ad hoc networks robust to malicious behaviors and suitable for numerous mobile devices.

  8. ICND2 MAESTRO - An Android App Companion and Cisco IOS Command Guide for Interconnecting Networking Devices 2

    Directory of Open Access Journals (Sweden)

    Nomar B. Maestro

    2016-12-01

    Full Text Available This study aimed to develop and Android application specifically for AMA Computer College - Makati, to improve ICND 2 (CCNA R&S Modules 3 and 4 classes as well as to motivate and inspire Cisco Networking Academy students and instructors The cross platform application which is available for Android contains 18 summarized chapters from the 2 modules of ICND 2, as well as exercises, command guides, glossary of terms and cheat sheets. It also contains a quiz page that could help students review for examinations. Video tutorials are also made available for study. The software was evaluated on the basis of efficiency, reliability, accuracy, and user-friendliness, with the goals of being more efficient and user-friendly when compared with references provided by Cisco and other online resources, while maintaining a high level of accuracy and reliability.

  9. Neurospora crassa as a model organism to explore the interconnected network of the cell cycle and the circadian clock.

    Science.gov (United States)

    Zámborszky, Judit; Csikász-Nagy, Attila; Hong, Christian I

    2014-10-01

    Budding and fission yeast pioneered uncovering molecular mechanisms of eukaryotic cell division cycles. However, they do not possess canonical circadian clock machinery that regulates physiological processes with a period of about 24h. On the other hand, Neurospora crassa played a critical role in elucidating molecular mechanisms of circadian rhythms, but have not been utilized frequently for cell cycle studies. Recent findings demonstrate that there exists a conserved coupling between the cell cycle and the circadian clock from N.crassa to Mus musculus, which poses Neurospora as an ideal model organism to investigate molecular mechanisms and emerging behavior of the coupled network of the cell cycle and circadian rhythms. In this review, we briefly describe generic eukaryotic cell cycle regulation focusing on G1/S and G2/M transitions, and highlight that these transitions may be targeted for the circadian clock to influence timing of cell division cycles.

  10. Translating the Interconnections between Ecological and Hydrological Processes in a Small Watershed into Process Networks using Information Theory

    Science.gov (United States)

    Kim, J.; Woo, N. C.; Kim, S.; Yun, J.; Kim, S.; Kang, M.; Cho, C. H.; Chun, J. H.

    2014-12-01

    We demonstrate how field measurements can inform the selection of model frameworks in small watershed applications. Based on the assumption that ecohydrological systems are open and complex, we employ the process network analysis to identify the system state and the subsystems architecture with changing environment conditions. Ecohydrological and biogeochemical processes in a watershed can be viewed as a network of processes of a wide range of scales involving various feedback loops and time delay. Using the KoFlux tower-based measurements of energy, water and CO2 flux time series along with those representing the soil-plant-atmospheric continuum; we evaluated statistical measures of characterizing the organization of the information flows in the system. We used Shannon's information entropy and calculated the mutual information and transfer entropy, following Ruddell and Kumar (2009). Transfer entropy can measure the relative strength and time scale of couplings between the variables. In this analysis, we selected 15 variables associated with ecohydrological processes, which are groundwater table height, water temperature, specific conductivity, soil moisture contents at three depths, ecosystem respiration, gross primary productivity, sensible heat flux, latent heat flux, precipitation, air temperature, vapor pressure deficit, atmospheric pressure, and solar radiation. The data-driven nature of this investigation may shed a light on reconciling model parsimony with equifinality in small watershed applications. (Acknowledgment: This work and the data used in the study were funded by the Korea Meteorological Administration Research and Development Program under Grant Weather Information Service Engine (WISE) project,153-3100-3133-302-350 and Grant CATER 2014-3030, respectively. The KoFlux site was supported by the Long-term Ecological Study and Monitoring of Forest Ecosystem Project of Korea Forest Research Institute.)

  11. 3D Interconnected Carbon Fiber Network-Enabled Ultralong Life Na3 V2 (PO4 )3 @Carbon Paper Cathode for Sodium-Ion Batteries.

    Science.gov (United States)

    Kretschmer, Katja; Sun, Bing; Zhang, Jinqiang; Xie, Xiuqiang; Liu, Hao; Wang, Guoxiu

    2017-03-01

    Sodium-ion batteries (NIBs) are an emerging technology, which can meet increasing demands for large-scale energy storage. One of the most promising cathode material candidates for sodium-ion batteries is Na3 V2 (PO4 )3 due to its high capacity, thermal stability, and sodium (Na) Superionic Conductor 3D (NASICON)-type framework. In this work, the authors have significantly improved electrochemical performance and cycling stability of Na3 V2 (PO4 )3 by introducing a 3D interconnected conductive network in the form of carbon fiber derived from ordinary paper towel. The free-standing Na3 V2 (PO4 )3 -carbon paper (Na3 V2 (PO4 )3 @CP) hybrid electrodes do not require a metallic current collector, polymeric binder, or conducting additives to function as a cathode material in an NIB system. The Na3 V2 (PO4 )3 @CP cathode demonstrates extraordinary long term cycling stability for 30 000 deep charge-discharge cycles at a current density of 2.5 mA cm(-2) . Such outstanding cycling stability can meet the stringent requirements for renewable energy storage.

  12. Soft sensor of chemical processes with large numbers of input parameters using auto-associative hierarchical neural network

    Institute of Scientific and Technical Information of China (English)

    Yanlin He; Yuan Xu; Zhiqiang Geng; Qunxiong Zhu

    2015-01-01

    To explore the problems of monitoring chemical processes with large numbers of input parameters, a method based on Auto-associative Hierarchical Neural Network (AHNN) is proposed. AHNN focuses on dealing with datasets in high-dimension. AHNNs consist of two parts:groups of subnets based on well trained Auto-associative Neural Networks (AANNs) and a main net. The subnets play an important role on the performance of AHNN. A simple but effective method of designing the subnets is developed in this paper. In this method, the subnets are designed according to the classification of the data attributes. For getting the classification, an effective method called Extension Data Attributes Classification (EDAC) is adopted. Soft sensor using AHNN based on EDAC (EDAC-AHNN) is introduced. As a case study, the production data of Purified Terephthalic Acid (PTA) solvent system are selected to examine the proposed model. The results of the EDAC-AHNN model are compared with the experimental data extracted from the literature, which shows the efficiency of the proposed model.

  13. Interconnection of industrial centers with the electric network of the public service; Interconexion de centros industriales con la red electrica del servicio publico

    Energy Technology Data Exchange (ETDEWEB)

    Rosales Sedano, Inocente; Lopez Velazquez, Juan Jose; Garcia Paredes, Job; Robles Pimentel, Edgar [Instituto de Investigaciones Electricas, Temixco, Morelos (Mexico); Garcia Alvarez, David; Guzman Camacho, Benigno [Petroleos Mexicanos (Mexico)

    2000-07-01

    The large industrial centers that have continuous production processes and consume high amounts of electrical energy, generally have their own power generation. The petrochemical complexes, the paper and steel factories and the sugar mills are examples of this type of centers. On the other hand, the new regulation for the generation of electrical energy that allows to the electrical energy interchange between private companies and the public network, has originated the necessity of connecting systems that formerly operated isolated. Since the original design of the isolated electrical systems was to operate in an independent form, making the interconnection can generate technical problems that must be analyzed and solved. In this paper, some experiences related with the behavior of electrical equipment when connected to operate with the public network, are presented. [Spanish] Los grandes centros industriales que tienen procesos de produccion continua y consumen altas cantidades de energia electrica, generalmente cuentan con generacion propia. Los complejos petroquimicos, las fabricas de papel y acero y los ingenios azucareros son ejemplos de este tipo de centros. Por otro lado, la nueva reglamentacion de generacion de energia electrica que permite el intercambio de energia electrica entre las companias privadas y la red publica, ha originado la necesidad de conectar sistemas que antes operaban aislados. Debido a que el diseno original de los sistemas electricos aislados fue trabajar en forma independiente, el realizar la interconexion puede generar problemas tecnicos que tienen que analizarse y resolverse. En este articulo, se presentan algunas experiencias relacionadas con el comportamiento del equipo electrico al operar conectado con la red publica.

  14. Efficient hierarchical analysis of the stability of a network through dimensional reduction of its influence topology

    CERN Document Server

    Kinkhabwala, Ali

    2013-01-01

    The connection between network topology and stability remains unclear. General approaches that clarify this relationship and allow for more efficient stability analysis would be desirable. In this manuscript, I examine the mathematical notion of influence topology, which is fundamentally based on the network reaction stoichiometries and the first derivatives of the reactions with respect to each species at the steady state solution(s). The influence topology is naturally represented as a signed directed bipartite graph with arrows or blunt arrows connecting a species node to a reaction node (positive/negative derivative) or a reaction node to a species node (positive/negative stoichiometry). The set of all such graphs is denumerable. A significant reduction in dimensionality is possible through stoichiometric scaling, cycle compaction, and temporal scaling. All cycles in a network can be read directly from the graph of its influence topology, enabling efficient and intuitive computation of the principal minor...

  15. NiO-Microflower Formed by Nanowire-weaving Nanosheets with Interconnected Ni-network Decoration as Supercapacitor Electrode.

    Science.gov (United States)

    Ci, Suqing; Wen, Zhenhai; Qian, Yuanyuan; Mao, Shun; Cui, Shumao; Chen, Junhong

    2015-07-13

    We propose a 'weaving' evolution mechanism, by systematically investigating the products obtained in controlled experiments, to demonstrate the formation of Ni-based 'microflowers' which consists of multiple characteristic dimensions, in which the three dimensional (3D) NiO 'microflower' is constructed by a two-dimensional (2D) nanosheet framework that is derived from weaving one-dimensional (1D) nanowires. We found such unique nanostructures are conducive for the generation of an electrically conductive Ni-network on the nanosheet surface after being exposed to a reducing atmosphere. Our study offers a promising strategy to address the intrinsic issue of poor electrical conductivity for NiO-based materials with significant enhancement of utilization of NiO active materials, leading to a remarkable improvement in the performance of the Ni-NiO microflower based supercapacitor. The optimized Ni-NiO microflower material showed a mass specific capacitance of 1,828 F g(-1), and an energy density of 15.9 Wh kg(-1) at a current density of 0.5 A g(-1). This research not only contributes to understanding the formation mechanism of such 'microflower' structures but also offers a promising route to advance NiO based supercapacitor given their ease of synthesis, low cost, and long-term stability.

  16. NiO-Microflower Formed by Nanowire-weaving Nanosheets with Interconnected Ni-network Decoration as Supercapacitor Electrode

    Science.gov (United States)

    Ci, Suqing; Wen, Zhenhai; Qian, Yuanyuan; Mao, Shun; Cui, Shumao; Chen, Junhong

    2015-07-01

    We propose a ‘weaving’ evolution mechanism, by systematically investigating the products obtained in controlled experiments, to demonstrate the formation of Ni-based ‘microflowers’ which consists of multiple characteristic dimensions, in which the three dimensional (3D) NiO ‘microflower’ is constructed by a two-dimensional (2D) nanosheet framework that is derived from weaving one-dimensional (1D) nanowires. We found such unique nanostructures are conducive for the generation of an electrically conductive Ni-network on the nanosheet surface after being exposed to a reducing atmosphere. Our study offers a promising strategy to address the intrinsic issue of poor electrical conductivity for NiO-based materials with significant enhancement of utilization of NiO active materials, leading to a remarkable improvement in the performance of the Ni-NiO microflower based supercapacitor. The optimized Ni-NiO microflower material showed a mass specific capacitance of 1,828 F g-1, and an energy density of 15.9 Wh kg-1 at a current density of 0.5 A g-1. This research not only contributes to understanding the formation mechanism of such ‘microflower’ structures but also offers a promising route to advance NiO based supercapacitor given their ease of synthesis, low cost, and long-term stability.

  17. EFFECTIVE HEURISTIC ALGORITHM FOR DYNAMIC ROUTING AND BANDWIDTH MANAGEMENT UNDER QUALITY OF SERVICE CONSTRAINTS IN MULTISTAGE INTERCONNECTION NETWORKS

    Directory of Open Access Journals (Sweden)

    R. Deepalakshmi

    2014-01-01

    Full Text Available Today, Internet of Things (IoT has introduced abundant bandwidth consumption and necessities in multimedia communications from online games to video-conferencing applications with the constraint of QoS requirements from time to time. The expected rapid proliferation of services would require performance unprecedented in the currently available best-effort routing algorithms. In, particular, the present routing mechanisms are based on the best-effort paradigm are unlikely to provide satisfactory end-to-end performance for services required in the real time applications. Thus, there is a definite need for architectures and algorithms that provide bandwidth guaranteed and QoS guarantees beyond those of the currently available ones. The proposed routing algorithm addressed the problem by computing low cost trees with delay bounded within the model wherein the bandwidth can be reserved and guaranteed once reserved on various links of the network there by providing QoS guarantees. This novel tree-pruning algorithm aids the bandwidth measurement tools by applying heuristic approach and the effectiveness of the algorithm is determined by two factors (i the end-to-end delay (ii the cost of routing. The new data structure significantly improves the running time complexity by O (log k for routing procedures under a variety of QoS constraints and checking tree routing runs in O(m+n2.

  18. Fluidic interconnections for microfluidic systems: A new integrated fluidic interconnection allowing plug 'n' play functionality

    DEFF Research Database (Denmark)

    Perozziello, Gerardo; Bundgaard, Frederik; Geschke, Oliver

    2008-01-01

    A crucial challenge in packaging of microsystems is microfluidic interconnections. These have to seal the ports of the system, and have to provide the appropriate interface to other devices or the external environment. Integrated fluidic interconnections appear to be a good solution...... for interconnecting polymer microsystems in terms of cost, space and performance. Following this path we propose a new reversible, integrated fluidic interconnection composed of custom-made cylindrical rings integrated in a polymer house next to the fluidic network. This allows plug 'n' play functionality between...... external metal ferrules and the system. Theoretical calculations are made to dimension and model the integrated fluidic interconnection. Leakage tests are performed on the interconnections, in order to experimentally confirm the model, and detect its limits....

  19. Bayesian hierarchical models for network meta-analysis incorporating nonignorable missingness.

    Science.gov (United States)

    Zhang, Jing; Chu, Haitao; Hong, Hwanhee; Virnig, Beth A; Carlin, Bradley P

    2015-07-28

    Network meta-analysis expands the scope of a conventional pairwise meta-analysis to simultaneously compare multiple treatments, synthesizing both direct and indirect information and thus strengthening inference. Since most of trials only compare two treatments, a typical data set in a network meta-analysis managed as a trial-by-treatment matrix is extremely sparse, like an incomplete block structure with significant missing data. Zhang et al. proposed an arm-based method accounting for correlations among different treatments within the same trial and assuming that absent arms are missing at random. However, in randomized controlled trials, nonignorable missingness or missingness not at random may occur due to deliberate choices of treatments at the design stage. In addition, those undertaking a network meta-analysis may selectively choose treatments to include in the analysis, which may also lead to missingness not at random. In this paper, we extend our previous work to incorporate missingness not at random using selection models. The proposed method is then applied to two network meta-analyses and evaluated through extensive simulation studies. We also provide comprehensive comparisons of a commonly used contrast-based method and the arm-based method via simulations in a technical appendix under missing completely at random and missing at random.

  20. AtPID: the overall hierarchical functional protein interaction network interface and analytic platform for Arabidopsis.

    Science.gov (United States)

    Li, Peng; Zang, Weidong; Li, Yuhua; Xu, Feng; Wang, Jigang; Shi, Tieliu

    2011-01-01

    Protein interactions are involved in important cellular functions and biological processes that are the fundamentals of all life activities. With improvements in experimental techniques and progress in research, the overall protein interaction network frameworks of several model organisms have been created through data collection and integration. However, most of the networks processed only show simple relationships without boundary, weight or direction, which do not truly reflect the biological reality. In vivo, different types of protein interactions, such as the assembly of protein complexes or phosphorylation, often have their specific functions and qualifications. Ignorance of these features will bring much bias to the network analysis and application. Therefore, we annotate the Arabidopsis proteins in the AtPID database with further information (e.g. functional annotation, subcellular localization, tissue-specific expression, phosphorylation information, SNP phenotype and mutant phenotype, etc.) and interaction qualifications (e.g. transcriptional regulation, complex assembly, functional collaboration, etc.) via further literature text mining and integration of other resources. Meanwhile, the related information is vividly displayed to users through a comprehensive and newly developed display and analytical tools. The system allows the construction of tissue-specific interaction networks with display of canonical pathways. The latest updated AtPID database is available at http://www.megabionet.org/atpid/.

  1. Hebbian learning of hand-centred representations in a hierarchical neural network model of the primate visual system.

    Science.gov (United States)

    Born, Jannis; Galeazzi, Juan M; Stringer, Simon M

    2017-01-01

    A subset of neurons in the posterior parietal and premotor areas of the primate brain respond to the locations of visual targets in a hand-centred frame of reference. Such hand-centred visual representations are thought to play an important role in visually-guided reaching to target locations in space. In this paper we show how a biologically plausible, Hebbian learning mechanism may account for the development of localized hand-centred representations in a hierarchical neural network model of the primate visual system, VisNet. The hand-centered neurons developed in the model use an invariance learning mechanism known as continuous transformation (CT) learning. In contrast to previous theoretical proposals for the development of hand-centered visual representations, CT learning does not need a memory trace of recent neuronal activity to be incorporated in the synaptic learning rule. Instead, CT learning relies solely on a Hebbian learning rule, which is able to exploit the spatial overlap that naturally occurs between successive images of a hand-object configuration as it is shifted across different retinal locations due to saccades. Our simulations show how individual neurons in the network model can learn to respond selectively to target objects in particular locations with respect to the hand, irrespective of where the hand-object configuration occurs on the retina. The response properties of these hand-centred neurons further generalise to localised receptive fields in the hand-centred space when tested on novel hand-object configurations that have not been explored during training. Indeed, even when the network is trained with target objects presented across a near continuum of locations around the hand during training, the model continues to develop hand-centred neurons with localised receptive fields in hand-centred space. With the help of principal component analysis, we provide the first theoretical framework that explains the behavior of Hebbian learning

  2. Hierarchal Variable Switching Sets of Interacting Multiple Model for Tracking Maneuvering Targets in Sensor Network

    Directory of Open Access Journals (Sweden)

    Seham Moawoud Ay Ebrahim

    2013-01-01

    Full Text Available Tracking maneuvering targets introduce two major directions to improve the Multiple Model (MM approach: Develop a better MM algorithm and design a better model set. The Interacting Multiple Model (IMM estimator is a suboptimal hybrid filter that has been shown to be one of the most cost-effective hybrid state estimation schemes. The main feature of this algorithm is the ability to estimate the state of a dynamic system with several behavior modes which can "switch" from one to another. In particular, the use of too many models is performance-wise as bad as that of too few models. In this paper we show that the use of too many models is performance-wise as bad as that of too few models. To overcome this we divide the models into a small number of sets, tuning these sets during operation at the right operating set. We proposed Hierarchal Switching sets of IMM (HSIMM. The state space of the nonlinear variable is divided into sets each set has its own IMM. The connection between them is the switching algorithm which manages the activation and termination of sets. Also the re-initialization process overcomes the error accumulation due to the targets changes from one model to another. This switching can introduce a number of different models while no restriction on their number. The activation of sets depends on the threshold value of set likely hood. As the likely hood of the set is higher than threshold it is active otherwise it is minimized. The result is the weighted sum of the output of active sets. The computational time is minimum than introduced by IMM and VIMM. HSIMM introduces less error as the noise increase and there is no need for re adjustment to the Covariance as the noise increase so it is more robust against noise and introduces minimum computational time.

  3. Optimizing data access for wind farm control over hierarchical communication networks

    DEFF Research Database (Denmark)

    Madsen, Jacob Theilgaard; Findrik, Mislav; Madsen, Tatiana Kozlova

    2016-01-01

    and communication networks on the controller performance. We start by investigating the effects of a communication network that introduces delays in the information access for the central controller. The control performance as measured by accumulated fatigue is shown to be significantly impacted by communication....... This information quality metric is called mismatch probability, mmPr, and is used to express quantitatively the information accuracy in a given scenario. Lastly measurements of different communication technologies have been performed in order to carry out the analysis in a practically relevant scenario......In this paper we investigate a centralized wind farm controller which runs periodically. The controller attempts to reduce the damage a wind turbine sustains during operation by estimating fatigue based on the wind turbine state. The investigation focuses on the impact of information access...

  4. A hierarchical network approach for modeling Rift Valley fever epidemics with applications in North America.

    Directory of Open Access Journals (Sweden)

    Ling Xue

    Full Text Available Rift Valley fever is a vector-borne zoonotic disease which causes high morbidity and mortality in livestock. In the event Rift Valley fever virus is introduced to the United States or other non-endemic areas, understanding the potential patterns of spread and the areas at risk based on disease vectors and hosts will be vital for developing mitigation strategies. Presented here is a general network-based mathematical model of Rift Valley fever. Given a lack of empirical data on disease vector species and their vector competence, this discrete time epidemic model uses stochastic parameters following several PERT distributions to model the dynamic interactions between hosts and likely North American mosquito vectors in dispersed geographic areas. Spatial effects and climate factors are also addressed in the model. The model is applied to a large directed asymmetric network of 3,621 nodes based on actual farms to examine a hypothetical introduction to some counties of Texas, an important ranching area in the United States of America. The nodes of the networks represent livestock farms, livestock markets, and feedlots, and the links represent cattle movements and mosquito diffusion between different nodes. Cattle and mosquito (Aedes and Culex populations are treated with different contact networks to assess virus propagation. Rift Valley fever virus spread is assessed under various initial infection conditions (infected mosquito eggs, adults or cattle. A surprising trend is fewer initial infectious organisms result in a longer delay before a larger and more prolonged outbreak. The delay is likely caused by a lack of herd immunity while the infection expands geographically before becoming an epidemic involving many dispersed farms and animals almost simultaneously. Cattle movement between farms is a large driver of virus expansion, thus quarantines can be efficient mitigation strategy to prevent further geographic spread.

  5. A hierarchical network approach for modeling Rift Valley fever epidemics with applications in North America.

    Science.gov (United States)

    Xue, Ling; Cohnstaedt, Lee W; Scott, H Morgan; Scoglio, Caterina

    2013-01-01

    Rift Valley fever is a vector-borne zoonotic disease which causes high morbidity and mortality in livestock. In the event Rift Valley fever virus is introduced to the United States or other non-endemic areas, understanding the potential patterns of spread and the areas at risk based on disease vectors and hosts will be vital for developing mitigation strategies. Presented here is a general network-based mathematical model of Rift Valley fever. Given a lack of empirical data on disease vector species and their vector competence, this discrete time epidemic model uses stochastic parameters following several PERT distributions to model the dynamic interactions between hosts and likely North American mosquito vectors in dispersed geographic areas. Spatial effects and climate factors are also addressed in the model. The model is applied to a large directed asymmetric network of 3,621 nodes based on actual farms to examine a hypothetical introduction to some counties of Texas, an important ranching area in the United States of America. The nodes of the networks represent livestock farms, livestock markets, and feedlots, and the links represent cattle movements and mosquito diffusion between different nodes. Cattle and mosquito (Aedes and Culex) populations are treated with different contact networks to assess virus propagation. Rift Valley fever virus spread is assessed under various initial infection conditions (infected mosquito eggs, adults or cattle). A surprising trend is fewer initial infectious organisms result in a longer delay before a larger and more prolonged outbreak. The delay is likely caused by a lack of herd immunity while the infection expands geographically before becoming an epidemic involving many dispersed farms and animals almost simultaneously. Cattle movement between farms is a large driver of virus expansion, thus quarantines can be efficient mitigation strategy to prevent further geographic spread.

  6. Non-Linear Behaviour Of Gelatin Networks Reveals A Hierarchical Structure

    KAUST Repository

    Yang, Zhi

    2015-12-14

    We investigate the strain hardening behaviour of various gelatin networks - namely physically-crosslinked gelatin gel, chemically-crosslinked gelatin gels, and a hybrid gels made of a combination of the former two - under large shear deformations using the pre-stress, strain ramp, and large amplitude oscillation shear protocols. Further, the internal structures of physically-crosslinked gelatin gel and chemically-crosslinked gelatin gels were characterized by small angle neutron scattering (SANS) to enable their internal structures to be correlated with their nonlinear rheology. The Kratky plots of SANS data demonstrate the presence of small cross-linked aggregates within the chemically-crosslinked network, whereas in the physically-crosslinked gels a relatively homogeneous structure is observed. Through model fitting to the scattering data, we were able to obtain structural parameters, such as correlation length (ξ), cross-sectional polymer chain radius (Rc), and the fractal dimension (df) of the gel networks. The fractal dimension df obtained from the SANS data of the physically-crosslinked and chemically crosslinked gels is 1.31 and 1.53, respectively. These values are in excellent agreement with the ones obtained from a generalized non-linear elastic theory we used to fit our stress-strain curves. The chemical crosslinking that generates coils and aggregates hinders the free stretching of the triple helices bundles in the physically-crosslinked gels.

  7. Admission Control for Multiservices Traffic in Hierarchical Mobile IPv6 Networks by Using Fuzzy Inference System

    Directory of Open Access Journals (Sweden)

    Jung-Shyr Wu

    2012-01-01

    Full Text Available CAC (Call Admission Control plays a significant role in providing QoS (Quality of Service in mobile wireless networks. In addition to much research that focuses on modified Mobile IP to get better efficient handover performance, CAC should be introduced to Mobile IP-based network to guarantee the QoS for users. In this paper, we propose a CAC scheme which incorporates multiple traffic types and adjusts the admission threshold dynamically using fuzzy control logic to achieve better usage of resources. The method can provide QoS in Mobile IPv6 networks with few modifications on MAP (Mobility Anchor Point functionality and slight change in BU (Binding Update message formats. According to the simulation results, the proposed scheme presents good performance of voice and video traffic at the expenses of poor performance on data traffic. It is evident that these CAC schemes can reduce the probability of the handoff dropping and the cell overload and limit the probability of the new call blocking.

  8. Energy Efficient Zone Division Multihop Hierarchical Clustering Algorithm for Load Balancing in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Ashim Kumar Ghosh

    2011-12-01

    Full Text Available Wireless sensor nodes are use most embedded computing application. Multihop cluster hierarchy has been presented for large wireless sensor networks (WSNs that can provide scalable routing, data aggregation, and querying. The energy consumption rate for sensors in a WSN varies greatly based on the protocols the sensors use for communications. In this paper we present a cluster based routing algorithm. One of our main goals is to design the energy efficient routing protocol. Here we try to solve the usual problems of WSNs. We know the efficiency of WSNs depend upon the distance between node to base station and the amount of data to be transferred and the performance of clustering is greatly influenced by the selection of cluster-heads, which are in charge of creating clusters and controlling member nodes. This algorithm makes the best use of node with low number of cluster head know as super node. Here we divided the full region in four equal zones and the centre area of the region is used to select for super node. Each zone is considered separately and the zone may be or not divided further that’s depending upon the density of nodes in that zone and capability of the super node. This algorithm forms multilayer communication. The no of layer depends on the network current load and statistics. Our algorithm is easily extended to generate a hierarchy of cluster heads to obtain better network management and energy efficiency.

  9. Vocabulary of interconnections. Vocabulaire des interconnexions

    Energy Technology Data Exchange (ETDEWEB)

    1990-03-01

    A French vocabulary of terms used in the field of interconnection of electric power systems, is provided in order to standardize terminology at Hydro-Quebec. The vocabulary encompasses many subfields directly or indirectly related to interconnections, such as overhead lines, load forecasting, network operation, and interconnection contracts and conventions. International French terminology is adopted throughout, except for specifically North American realities for which new terms have been proposed. English equivalents of terms are provided for informative purposes and are not standardized. An index of the English terms is included. 128 refs.

  10. Enhanced Deployment Strategy for Role-based Hierarchical Application Agents in Wireless Sensor Networks with Established Clusterheads

    Science.gov (United States)

    Gendreau, Audrey

    Efficient self-organizing virtual clusterheads that supervise data collection based on their wireless connectivity, risk, and overhead costs, are an important element of Wireless Sensor Networks (WSNs). This function is especially critical during deployment when system resources are allocated to a subsequent application. In the presented research, a model used to deploy intrusion detection capability on a Local Area Network (LAN), in the literature, was extended to develop a role-based hierarchical agent deployment algorithm for a WSN. The resulting model took into consideration the monitoring capability, risk, deployment distribution cost, and monitoring cost associated with each node. Changing the original LAN methodology approach to model a cluster-based sensor network depended on the ability to duplicate a specific parameter that represented the monitoring capability. Furthermore, other parameters derived from a LAN can elevate costs and risk of deployment, as well as jeopardize the success of an application on a WSN. A key component of the approach presented in this research was to reduce the costs when established clusterheads in the network were found to be capable of hosting additional detection agents. In addition, another cost savings component of the study addressed the reduction of vulnerabilities associated with deployment of agents to high volume nodes. The effectiveness of the presented method was validated by comparing it against a type of a power-based scheme that used each node's remaining energy as the deployment value. While available energy is directly related to the model used in the presented method, the study deliberately sought out nodes that were identified with having superior monitoring capability, cost less to create and sustain, and are at low-risk of an attack. This work investigated improving the efficiency of an intrusion detection system (IDS) by using the proposed model to deploy monitoring agents after a temperature sensing

  11. Hierarchically designed agarose and poly(ethylene glycol) interpenetrating network hydrogels for cartilage tissue engineering.

    Science.gov (United States)

    DeKosky, Brandon J; Dormer, Nathan H; Ingavle, Ganesh C; Roatch, Christopher H; Lomakin, Joseph; Detamore, Michael S; Gehrke, Stevin H

    2010-12-01

    A new method for encapsulating cells in interpenetrating network (IPN) hydrogels of superior mechanical integrity was developed. In this study, two biocompatible materials-agarose and poly(ethylene glycol) (PEG) diacrylate-were combined to create a new IPN hydrogel with greatly enhanced mechanical performance. Unconfined compression of hydrogel samples revealed that the IPN displayed a fourfold increase in shear modulus relative to a pure PEG-diacrylate network (39.9 vs. 9.9 kPa) and a 4.9-fold increase relative to a pure agarose network (8.2 kPa). PEG and IPN compressive failure strains were found to be 71% ± 17% and 74% ± 17%, respectively, while pure agarose gels failed around 15% strain. Similar mechanical property improvements were seen when IPNs-encapsulated chondrocytes, and LIVE/DEAD cell viability assays demonstrated that cells survived the IPN encapsulation process. The majority of IPN-encapsulated chondrocytes remained viable 1 week postencapsulation, and chondrocytes exhibited glycosaminoglycan synthesis comparable to that of agarose-encapsulated chondrocytes at 3 weeks postencapsulation. The introduction of a new method for encapsulating cells in a hydrogel with enhanced mechanical performance is a promising step toward cartilage defect repair. This method can be applied to fabricate a broad variety of cell-based IPNs by varying monomers and polymers in type and concentration and by adding functional groups such as degradable sequences or cell adhesion groups. Further, this technology may be applicable in other cell-based applications where mechanical integrity of cell-containing hydrogels is of great importance.

  12. A Hierarchical Network of Provably Optimal Learning Control Systems: Extensions of the Associative Control Process (ACP) Network

    Science.gov (United States)

    1993-01-01

    either behavior or learning, The modified ACP network does not have a negative reinforcement center yet is able to reproduce the simulation results of...Assuming N = 0 at all times, there is only one reinforcement center that is active, the positive reinforcement ccnter (PC). The negative ... reinforcement center (NC) is never active, and the weights associated with NC never change. The state is sensed through the sensors, and the actions are

  13. 47 CFR 95.1313 - Interconnection prohibited.

    Science.gov (United States)

    2010-10-01

    ... facilities of the public switched telephone network to permit the transmission of messages or signals between points in the wireline or radio network of a public telephone company and persons served by multi-use... prohibited. MURS stations are prohibited from interconnection with the public switched...

  14. Types of solutions improving passenger transport interconnectivity

    Directory of Open Access Journals (Sweden)

    Monika BĄK

    2012-01-01

    Full Text Available The objective of the paper is to present different types of solutions which could improve interconnectivity of passenger transport especially within interconnections between long and short transport distance. The topic has particular relevance at the European level because the European transport networks’ role as integrated international networks is compromised by poor interconnectivity and because the next generation of European transport policies will have to be sensitive to the differences between short, medium and long-term transport markets and the market advantages of each transport mode. In this context, a realistic assessment of intermodal opportunities is a key ingredient to future policy development.Effective interconnection requires the provision of integrated networks and services which are attractive to potential users and this is likely to require co-operation between a range of authorities and providers in the public and private sectors and may necessitate a wider vision than might otherwise prevail.The paper is based on the results of the project realised by the team of the University of Gdansk in the EU funded 7 Framework Programme - INTERCONNECT (Interconnection between short- and long-distance transport networks with partners in the UK, Germany, Denmark, Poland, Spain and Italy. Different types of solutions will be summarized in the paper including e.g. local link infrastructure solutions, improved local public transport services, improvements at the interchange, solutions involving improved procedures for check-in or luggage transfer & documentation, pricing and ticketing solutions, solutions involving marketing, information and sales.

  15. Cellulose nanofiber-templated three-dimension TiO2 hierarchical nanowire network for photoelectrochemical photoanode

    Science.gov (United States)

    Li, Zhaodong; Yao, Chunhua; Wang, Fei; Cai, Zhiyong; Wang, Xudong

    2014-12-01

    Three dimensional (3D) nanostructures with extremely large porosity possess a great promise for the development of high-performance energy harvesting and storage devices. In this paper, we developed a high-density 3D TiO2 fiber-nanorod (NR) heterostructure for efficient photoelectrochemical (PEC) water splitting. The hierarchical structure was synthesized on a ZnO-coated cellulose nanofiber (CNF) template using atomic layer deposition (ALD)-based thin film and NR growth procedures. The tubular structure evolution was in good agreement with the recently discovered vapor-phase Kirkendall effect in high-temperature ALD processes. The NR morphology was formed via the surface-reaction-limited pulsed chemical vapor deposition (SPCVD) mechanism. Under Xenon lamp illumination without and with an AM 1.5G filter or a UV cut off filter, the PEC efficiencies of a 3D TiO2 fiber-NR heterostructure were found to be 22-249% higher than those of the TiO2-ZnO bilayer tubular nanofibers and TiO2 nanotube networks that were synthesized as reference samples. Such a 3D TiO2 fiber-NR heterostructure offers a new route for a cellulose-based nanomanufacturing technique, which can be used for large-area, low-cost, and green fabrication of nanomaterials as well as their utilizations for efficient solar energy harvesting and conversion.

  16. A CAD System for Identification and Classification of Breast Cancer Tumors in DCE-MR Images Based on Hierarchical Convolutional Neural Networks

    Directory of Open Access Journals (Sweden)

    Reza Rastiboroujeni

    2015-06-01

    Full Text Available In this paper, we propose a computer aided diagnosis (CAD system based on hierarchical convolutional neural networks (HCNNs to discriminate between malignant and benign tumors in breast DCE-MRIs. A HCNN is a hierarchical neural network that operates on two-dimensional images. A HCNN integrates feature extraction and classification processes into one single and fully adaptive structure. It can extract two-dimensional key features automatically, and it is relatively tolerant to geometric and local distortions in input images. We evaluate CNN implementation learning and testing processes based on gradient descent (GD and resilient back-propagation (RPROP approaches. We show that, proposed HCNN with RPROP learning approach provide an effective and robust neural structure to design a CAD base system for breast MRI, and has potential as a mechanism for the evaluation of different types of abnormalities in medical images.

  17. Path-finding through flexible hierarchical road networks: An experiential approach using taxi trajectory data

    Science.gov (United States)

    Li, Qingquan; Zeng, Zhe; Zhang, Tong; Li, Jonathan; Wu, Zhongheng

    2011-02-01

    Optimal paths computed by conventional path-planning algorithms are usually not "optimal" since realistic traffic information and local road network characteristics are not considered. We present a new experiential approach that computes optimal paths based on the experience of taxi drivers by mining a huge number of floating car trajectories. The approach consists of three steps. First, routes are recovered from original taxi trajectories. Second, an experiential road hierarchy is constructed using travel frequency and speed information for road segments. Third, experiential optimal paths are planned based on the experiential road hierarchy. Compared with conventional path-planning methods, the proposed method provides better experiential optimal path identification. Experiments demonstrate that the travel time is less for these experiential paths than for paths planned by conventional methods. Results obtained for a case study in the city of Wuhan, China, demonstrate that experiential optimal paths can be flexibly obtained in different time intervals, particularly during peak hours.

  18. Hierarchical tree-structured control network for the Antares laser facility

    Energy Technology Data Exchange (ETDEWEB)

    McGirt, F.

    1979-01-01

    The design and implementation of a distributed, computer-based control system for the Antares 100-kJ gas laser fusion facility is presented. Control system requirements and their operational interrelationships that consider both integrated system control and individual subsystem control are described. Several configurations of minicomputers are established to provide direct control of sets of microcomputers and to provide points of operator-laser interaction. Over 100 microcomputers are located very close to the laser device control points or sources of data and perform the real-time functions of the control system, such as data and control signal multiplexing, stepping motor control, and vacuum and gas system control. These microcomputers are designed to be supported as an integral part of the control network and to be software compatible with the larger minicomputers.

  19. Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels

    Science.gov (United States)

    de Juan Marín, Ruben; Cholvi, Vicent; Jiménez, Ernesto; Muñoz-Escoí, Francesc D.

    This paper proposes new protocols for the interconnection of FIFO- and causal-ordered broadcast systems, thus increasing their scalability. They use several interconnection links between systems, which avoids bottleneck problems due to the network traffic, since messages are not forced to go throughout a single link but instead through the several links we establish. General architectures to interconnect FIFO- and causal-ordered systems are proposed. Failure management is also discussed and a performance analysis is given, detailing the benefits introduced by these interconnection approaches that are able to easily increase the resulting interconnection bandwidth.

  20. Economic and environmental benefits of interconnected systems. The Spanish example

    Energy Technology Data Exchange (ETDEWEB)

    Chicharro, A.S.; Dios Alija, R. de [Red Electrica de Espana, Madrid (Spain)

    1996-12-31

    The interconnected systems provide large technical and economic benefits which, evaluated and contrasted with the associated network investment cost, usually produce important net savings. There are continental electrical systems formed by many interconnected subsystems. The optimal size of an interconnection should be defined within an economic background. It is necessary to take into account the global environmental effects. The approach and results of studies carried out by Red Electrica is presented, in order to analyse both economic and environmental benefits resulting from an increase in the present Spanish interconnection capacities. From both economic and environmental points of view, the development of the interconnected systems is highly positive. (author). 4 refs.

  1. Top-down feedback in an HMAX-like cortical model of object perception based on hierarchical Bayesian networks and belief propagation.

    Directory of Open Access Journals (Sweden)

    Salvador Dura-Bernal

    Full Text Available Hierarchical generative models, such as Bayesian networks, and belief propagation have been shown to provide a theoretical framework that can account for perceptual processes, including feedforward recognition and feedback modulation. The framework explains both psychophysical and physiological experimental data and maps well onto the hierarchical distributed cortical anatomy. However, the complexity required to model cortical processes makes inference, even using approximate methods, very computationally expensive. Thus, existing object perception models based on this approach are typically limited to tree-structured networks with no loops, use small toy examples or fail to account for certain perceptual aspects such as invariance to transformations or feedback reconstruction. In this study we develop a Bayesian network with an architecture similar to that of HMAX, a biologically-inspired hierarchical model of object recognition, and use loopy belief propagation to approximate the model operations (selectivity and invariance. Crucially, the resulting Bayesian network extends the functionality of HMAX by including top-down recursive feedback. Thus, the proposed model not only achieves successful feedforward recognition invariant to noise, occlusions, and changes in position and size, but is also able to reproduce modulatory effects such as illusory contour completion and attention. Our novel and rigorous methodology covers key aspects such as learning using a layerwise greedy algorithm, combining feedback information from multiple parents and reducing the number of operations required. Overall, this work extends an established model of object recognition to include high-level feedback modulation, based on state-of-the-art probabilistic approaches. The methodology employed, consistent with evidence from the visual cortex, can be potentially generalized to build models of hierarchical perceptual organization that include top-down and bottom

  2. On Maintenance of Inter-connectivity Among Multi-representations

    Institute of Scientific and Technical Information of China (English)

    WANG Yan-hui; MENG Hao; LIU Xiao-meng

    2006-01-01

    As the problems of conceptual and representational differences will arise among multi-representations, inter-connectivity maintenance among multi-representations exists as a foundational task in building multi-scale data model. Since the existing methods are still not satisfactory in practice, the inter-connectivity among multiple representations can be only achieved if the multi-scale model is capable of explicitly inter-relating them and dealing with their differences. So, this paper firstly explores the relation among multiple representations from the same entity, such as multi-semantic, multi-geometry, multi-attributes, hierarchical semantic relations and so on. Based on these, this paper proposes aggregation-based semantic hierarchical matching rules (ASHMR) as the basis of tackling inter-connectivity among multi-representations, and defines the available hierarchical semantic knowledge, namely semantically equal, semantically related and semantically irrelevant. According to different change among multi-representations from different types of objects, the applications and techniques of the corresponding hierarchy inter-connectivity matching criterion are explored. And taken the road intersections as examples, a case in point is given in details for describing the strategies of inter-connectivity maintenance, showing that this method is feasible to deal with inter-connectivity.

  3. Hierarchical Wireless Multimedia Sensor Networks for Collaborative Hybrid Semi-Supervised Classifier Learning

    Directory of Open Access Journals (Sweden)

    Liang Ding

    2007-11-01

    Full Text Available Wireless multimedia sensor networks (WMSN have recently emerged as one ofthe most important technologies, driven by the powerful multimedia signal acquisition andprocessing abilities. Target classification is an important research issue addressed in WMSN,which has strict requirement in robustness, quickness and accuracy. This paper proposes acollaborative semi-supervised classifier learning algorithm to achieve durative onlinelearning for support vector machine (SVM based robust target classification. The proposedalgorithm incrementally carries out the semi-supervised classifier learning process inhierarchical WMSN, with the collaboration of multiple sensor nodes in a hybrid computingparadigm. For decreasing the energy consumption and improving the performance, somemetrics are introduced to evaluate the effectiveness of the samples in specific sensor nodes,and a sensor node selection strategy is also proposed to reduce the impact of inevitablemissing detection and false detection. With the ant optimization routing, the learningprocess is implemented with the selected sensor nodes, which can decrease the energyconsumption. Experimental results demonstrate that the collaborative hybrid semi-supervised classifier learning algorithm can effectively implement target classification inhierarchical WMSN. It has outstanding performance in terms of energy efficiency and timecost, which verifies the effectiveness of the sensor nodes selection and ant optimizationrouting.

  4. An Optimal Hierarchical Decision Model for a Regional Logistics Network with Environmental Impact Consideration

    Directory of Open Access Journals (Sweden)

    Dezhi Zhang

    2014-01-01

    Full Text Available This paper proposes a new model of simultaneous optimization of three-level logistics decisions, for logistics authorities, logistics operators, and logistics users, for regional logistics network with environmental impact consideration. The proposed model addresses the interaction among the three logistics players in a complete competitive logistics service market with CO2 emission charges. We also explicitly incorporate the impacts of the scale economics of the logistics park and the logistics users’ demand elasticity into the model. The logistics authorities aim to maximize the total social welfare of the system, considering the demand of green logistics development by two different methods: optimal location of logistics nodes and charging a CO2 emission tax. Logistics operators are assumed to compete with logistics service fare and frequency, while logistics users minimize their own perceived logistics disutility given logistics operators’ service fare and frequency. A heuristic algorithm based on the multinomial logit model is presented for the three-level decision model, and a numerical example is given to illustrate the above optimal model and its algorithm. The proposed model provides a useful tool for modeling competitive logistics services and evaluating logistics policies at the strategic level.

  5. An optimal hierarchical decision model for a regional logistics network with environmental impact consideration.

    Science.gov (United States)

    Zhang, Dezhi; Li, Shuangyan; Qin, Jin

    2014-01-01

    This paper proposes a new model of simultaneous optimization of three-level logistics decisions, for logistics authorities, logistics operators, and logistics users, for regional logistics network with environmental impact consideration. The proposed model addresses the interaction among the three logistics players in a complete competitive logistics service market with CO2 emission charges. We also explicitly incorporate the impacts of the scale economics of the logistics park and the logistics users' demand elasticity into the model. The logistics authorities aim to maximize the total social welfare of the system, considering the demand of green logistics development by two different methods: optimal location of logistics nodes and charging a CO2 emission tax. Logistics operators are assumed to compete with logistics service fare and frequency, while logistics users minimize their own perceived logistics disutility given logistics operators' service fare and frequency. A heuristic algorithm based on the multinomial logit model is presented for the three-level decision model, and a numerical example is given to illustrate the above optimal model and its algorithm. The proposed model provides a useful tool for modeling competitive logistics services and evaluating logistics policies at the strategic level.

  6. An Optimal Hierarchical Decision Model for a Regional Logistics Network with Environmental Impact Consideration

    Science.gov (United States)

    Zhang, Dezhi; Li, Shuangyan

    2014-01-01

    This paper proposes a new model of simultaneous optimization of three-level logistics decisions, for logistics authorities, logistics operators, and logistics users, for regional logistics network with environmental impact consideration. The proposed model addresses the interaction among the three logistics players in a complete competitive logistics service market with CO2 emission charges. We also explicitly incorporate the impacts of the scale economics of the logistics park and the logistics users' demand elasticity into the model. The logistics authorities aim to maximize the total social welfare of the system, considering the demand of green logistics development by two different methods: optimal location of logistics nodes and charging a CO2 emission tax. Logistics operators are assumed to compete with logistics service fare and frequency, while logistics users minimize their own perceived logistics disutility given logistics operators' service fare and frequency. A heuristic algorithm based on the multinomial logit model is presented for the three-level decision model, and a numerical example is given to illustrate the above optimal model and its algorithm. The proposed model provides a useful tool for modeling competitive logistics services and evaluating logistics policies at the strategic level. PMID:24977209

  7. Auditing Complex Concepts of SNOMED using a Refined Hierarchical Abstraction Network

    Science.gov (United States)

    Wang, Yue; Halper, Michael; Wei, Duo; Gu, Huanying; Perl, Yehoshua; Xu, Junchuan; Elhanan, Gai; Chen, Yan; Spackman, Kent A.; Case, James T.; Hripcsak, George

    2012-01-01

    Auditors of a large terminology, such as SNOMED CT, face a daunting challenge. To aid them in their efforts, it is essential to devise techniques that can automatically identify concepts warranting special attention. “Complex” concepts, which by their very nature are more difficult to model, fall neatly into this category. A special kind of grouping, called a partial-area, is utilized in the characterization of complex concepts. In particular, the complex concepts that are the focus of this work are those appearing in intersections of multiple partial-areas and are thus referred to as overlapping concepts. In a companion paper, an automatic methodology for identifying and partitioning the entire collection of overlapping concepts into disjoint, singly-rooted groups, that are more manageable to work with and comprehend, has been presented. The partitioning methodology formed the foundation for the development of an abstraction network for the overlapping concepts called a disjoint partial-area taxonomy. This new disjoint partial-area taxonomy offers a collection of semantically uniform partial-areas and is exploited herein as the basis for a novel auditing methodology. The review of the overlapping concepts is done in a top-down order within semantically uniform groups. These groups are themselves reviewed in a top-down order, which proceeds from the less complex to the more complex overlapping concepts. The results of applying the methodology to SNOMED’s Specimen hierarchy are presented. Hypotheses regarding error ratios for overlapping concepts and between different kinds of overlapping concepts are formulated. Two phases of auditing the Specimen hierarchy for two releases of SNOMED are reported on. With the use of the double bootstrap and Fisher’s exact test (two-tailed), the auditing of concepts and especially roots of overlapping partial-areas is shown to yield a statistically significant higher proportion of errors. PMID:21907827

  8. APHiD: Hierarchical Task Placement to Enable a Tapered Fat Tree Topology for Lower Power and Cost in HPC Networks

    Energy Technology Data Exchange (ETDEWEB)

    Michelogiannakis, George; Ibrahim, Khaled Z.; Shalf, John; Wilke, Jeremiah J.; Knight, Samuel; Kenny, Joseph P.

    2017-05-14

    The power and procurement cost of bandwidth in system-wide networks has forced a steady drop in the byte/flop ratio. This trend of computation becoming faster relative to the network is expected to hold. In this paper, we explore how cost-oriented task placement enables reducing the cost of system-wide networks by enabling high performance even on tapered topologies where more bandwidth is provisioned at lower levels. We describe APHiD, an efficient hierarchical placement algorithm that uses new techniques to improve the quality of heuristic solutions and reduces the demand on high-level, expensive bandwidth in hierarchical topologies. We apply APHiD to a tapered fat-tree, demonstrating that APHiD maintains application scalability even for severely tapered network configurations. Using simulation, we show that for tapered networks APHiD improves performance by more than 50% over random placement and even 15% in some cases over costlier, state-of-the-art placement algorithms.

  9. THE SUPER TWISTED CUBE INTERCONNECTION NETWORKS AND THEIR PROPERTIES%超级扭立方体互连网络及其性质

    Institute of Scientific and Technical Information of China (English)

    王喜; 樊建席

    2011-01-01

    The Twisted Cube is a hypercube variant. It has some superior properties to the hypercube. However,like the hypercube,it is also an n-regular graph with 2n nodes. In order to increase 1 dimension(I. E. Upgrade one level) ,the nodes of the Twisted Cube must be multiplied. Inorder to solve the problem, the topological structure of the Twisted Cube with 2n nodes is modified to create an interconnection network--theSuper Twisted Cube (STN),which contains an arbitrary number of nodes. It is proven that the STN maintains the greatest connectivity,numerical diameter node numbers, Hamilton property, connectivity level tp-diagnostic properties of the Twisted Cube. Moreover, since it contains an arbitrary number of nodes,it only needs to add an arbitrary number of nodes to upgrade. Therefore it overcomes the above mentioned drawback of having to multiply its nodes .to upgrade the Twisted Cube.%扭立方体是超立方体的一类变体,它具有比超立方体更好的性质.但是,同超立方体一样,它也是具有2n个顶点的n-正则图,故要使一个扭立方体的维数(即顶点度数)增加1(称为升级),就必须成倍地增加扭立方体中的顶点个数.为了解决这一问题,将具有2n个顶点的扭立方体的拓扑结构加以改变,得到了包含任意多个顶点的互连网络——超级扭立方体(STN).证明了超级扭立方体保持了扭立方体的最高连通度、对数级的直径和顶点度数、Hamilton性质、连通度级的tp-可诊断度等方面的优良性质,更进一步地,由于它包含了任意多个顶点,所以对它的升级只需增加任意多个顶点,从而克服了扭立方体的升级必须成倍增加其顶点个数的缺点.

  10. Discussion on the Hierarchical Cell Structure of LTE under the Network Simulation%从网络仿真看LTE网络分层结构部署

    Institute of Scientific and Technical Information of China (English)

    刘彦婷; 南作用

    2015-01-01

    “网络分层”并不是一个新的概念或组网模式,其在2008年WCDMA网络建设之初即被明确提出,但至今仍未贯彻至网络规划建设中。从LTE网络规划中遇到的问题入手,基于某运营商多地网络现状,分析问题产生的根源,并加以详细的理论分析,重新提出网络分层理念及未来网络规划建设的布局及趋势建议。并通过网络仿真分析其对LTE网络性能的影响,提出若干问题的解决方法。为后期LTE网络规划与建设提供参考。%Hierarchical cel structure is not a new concept or mode,it has been put forward in the beginning of WCDMA network con-struction in 2008,but has not been carried out in network planning and construction. Beginning with the problems on LTE net-work planning,based on the current network conditions of some operator,it analyzes the origin of the problems and explores them theoretical y,presents the hierarchical cel structure again and the layout of future network planning and the trend sug-gestion. It analyzes the impact on LTE network performance through network simulation,presents the resolutions on some problems,to provide reference for LTE network planning and construction in later stage.

  11. Thin film interconnect processes

    Science.gov (United States)

    Malik, Farid

    Interconnects and associated photolithography and etching processes play a dominant role in the feature shrinkage of electronic devices. Most interconnects are fabricated by use of thin film processing techniques. Planarization of dielectrics and novel metal deposition methods are the focus of current investigations. Spin-on glass, polyimides, etch-back, bias-sputtered quartz, and plasma-enhanced conformal films are being used to obtain planarized dielectrics over which metal films can be reliably deposited. Recent trends have been towards chemical vapor depositions of metals and refractory metal silicides. Interconnects of the future will be used in conjunction with planarized dielectric layers. Reliability of devices will depend to a large extent on the quality of the interconnects.

  12. 水声通信网层次路由算法%Research on hierarchical routing algorithm for underwater acoustic communication networks

    Institute of Scientific and Technical Information of China (English)

    卞金洪; 徐新洲; 魏昕; 赵力

    2013-01-01

    针对水声通信网中由于节点能耗不均衡而影响网络生命周期的问题,基于无线传感网络的层次路由算法,提出了一种适用于水下环境的水声通信网层次路由算法.该算法采用分轮的思想,使用改进的复杂网络社团结构检测谱方法的相关算法.通过网络初始化等措施构建水声通信网的图结构,并利用Laplacian阵与聚类算法得到簇结构,进而实现网络中数据的正常传输.仿真实验表明,在水声通信网的特殊条件下,该算法相对于传统的LEACH协议能取得较好的效果,在网络稳定传输数据的情况下,网络各轮的存活节点数均优于LEACH.%In order to overcome the existing problem facing underwater acoustic communication networks, the researchers propose to examine a novel hierarchical routing algorithm for underwater acoustic communication networks. This study will be conducted in accordance to the hierarchical routing algorithms in wireless sensor network. While focusing on the problems of the network life cycle affected by the unbalanced node' s energy consumption. The improved detection spectral algorithm of complex network is introduced based on the ideal of sub-wheel. First, the graph structure of acoustic communication networks is constructed by means of network initialization. Next, the Laplacian matrix and cluster algorithm will be used to generate the cluster structure thus realizing normal data transmission successfully. The simulation results shows, under the special condition of underwater acoustic communication networks, the hierarchical routing algorithm can achieve better results compared to the traditional LEACH protocol. The number of surviving nodes for each round in our algorithm exceeds that in LEACH, and in the condition of stable network data transmission.

  13. Zee electrical interconnect

    Science.gov (United States)

    Rust, Thomas M. (Inventor); Gaddy, Edward M. (Inventor); Herriage, Michael J. (Inventor); Patterson, Robert E. (Inventor); Partin, Richard D. (Inventor)

    2001-01-01

    An interconnect, having some length, that reliably connects two conductors separated by the length of the interconnect when the connection is made but in which one length if unstressed would change relative to the other in operation. The interconnect comprises a base element an intermediate element and a top element. Each element is rectangular and formed of a conducting material and has opposed ends. The elements are arranged in a generally Z-shape with the base element having one end adapted to be connected to one conductor. The top element has one end adapted to be connected to another conductor and the intermediate element has its ends disposed against the other end of the base and the top element. Brazes mechanically and electrically interconnect the intermediate element to the base and the top elements proximate the corresponding ends of the elements. When the respective ends of the base and the top elements are connected to the conductors, an electrical connection is formed therebetween, and when the conductors are relatively moved or the interconnect elements change length the elements accommodate the changes and the associated compression and tension forces in such a way that the interconnect does not mechanically fatigue.

  14. Credit networks and systemic risk of Chinese local financing platforms: Too central or too big to fail?. -based on different credit correlations using hierarchical methods

    Science.gov (United States)

    He, Fang; Chen, Xi

    2016-11-01

    The accelerating accumulation and risk concentration of Chinese local financing platforms debts have attracted wide attention throughout the world. Due to the network of financial exposures among institutions, the failure of several platforms or regions of systemic importance will probably trigger systemic risk and destabilize the financial system. However, the complex network of credit relationships in Chinese local financing platforms at the state level remains unknown. To fill this gap, we presented the first complex networks and hierarchical cluster analysis of the credit market of Chinese local financing platforms using the ;bottom up; method from firm-level data. Based on balance-sheet channel, we analyzed the topology and taxonomy by applying the analysis paradigm of subdominant ultra-metric space to an empirical data in 2013. It is remarked that we chose to extract the network of co-financed financing platforms in order to evaluate the effect of risk contagion from platforms to bank system. We used the new credit similarity measure by combining the factor of connectivity and size, to extract minimal spanning trees (MSTs) and hierarchical trees (HTs). We found that: (1) the degree distributions of credit correlation backbone structure of Chinese local financing platforms are fat tailed, and the structure is unstable with respect to targeted failures; (2) the backbone is highly hierarchical, and largely explained by the geographic region; (3) the credit correlation backbone structure based on connectivity and size is significantly heterogeneous; (4) key platforms and regions of systemic importance, and contagion path of systemic risk are obtained, which are contributed to preventing systemic risk and regional risk of Chinese local financing platforms and preserving financial stability under the framework of macro prudential supervision. Our approach of credit similarity measure provides a means of recognizing ;systemically important; institutions and regions

  15. Research on Interconnected River System Network:Conceptual Framework%河湖水系连通研究:概念框架

    Institute of Scientific and Technical Information of China (English)

    李宗礼; 李原园; 王中根; 郝秀平; 刘晓洁

    2011-01-01

    The remarkable growth in China' s population and economy over the past several decades has come to realize at a tremendous cost to the country' s environment, particularly around water. China' s water resources are over-allocated, inefficiently used, and grossly polluted by domestic and industrial wastes, to the point that vast stretches of rivers are dead and dying, lakes are cesspools of waste, groundwater aquifers are over-pumped and unsustainably consumed, and direct adverse impacts on both human and ecosystem health are widespread and growing. For addressing these crippling water problems, a new strategy of Interconnected River System Network (IRSN) is put forward, which is of great necessity for improving the capacity of water resources allocation, sustaining river' s heath and enhancing flood and drought control. However, up to now both the theory and technology of IRSN have still been a blank, far from the practices. Based on the further requirement of national water security and the improvement of the ecological civilization, with the new idea of human-water harmony and water resources livelihood, this paper presents a concept of IRSN, which can be defined as a river system network formed by constructing the hydraulic connection of water bodies of rivers, lakes and wetlands with various kinds of water projects, characterized by proper diversion and drainage, reasonable storage and discharge, adjustment of low and high runoff, complementary water multisource, controllable capacity, and the river system network appears to be complex, systematic, dynamic, temporal and spatial. Then the general thoughts of IRSN is proposed on the basis of the river system connection goal, the study of the IRSN can be carried out at four steps: 1 ) mechanism analysis, the theoretical basis of the whole study; 2) system identification and assessment, the analysis of the current status of IRSN in the researched region/basin, and the construction of Safety Evaluation Model with

  16. Discussion on Water Cycle Mechanism of Interconnected River System Network%河湖水系连通的理论探讨

    Institute of Scientific and Technical Information of China (English)

    王中根; 李宗礼; 刘昌明; 李原园; 刘晓洁; 郝秀平

    2011-01-01

    Climate change and human activities affected water supply and water management, and brought a lot of water issues, such as drought, flood, water shortage, deterioration of water environment, etc. In order to fundamentally increase water resources allocation ability, improve ecological environment quality, and enhance the capacity to withstand flood and drought disasters, in China, a new national strategic plan on the constructing river system network was put forward. We have called this plan as IRSN (Interconnected River System Network) plan. To grasp the strategic thinking of IRSN, this paper, based on the basic concept of river, lake, and water system, discussed the hydrological characteristics of rivers and lakes, and analyzed the role of rivers and lakes in the river system network, and pointed out that the river is the main component and lake is the "connector ", "converter" and "storage device" of constructing river system network, and reservoir can be seen as an artificial lake. How to keep the river water mobility and continuity and play the role of lake water storage capacity and ecological benefits as wetland, are the keys to IRSN plan. This paper presents four basic water cycle issues that should be concerned in the implementation process of IRSN plan. First is about water balance. As the structure and characteristics of the natural water system were changed by engineering measures ( such as water diversion project, construction of dams, reservoirs, etc. ), the original water balance must be broken. We need to re-examine the new relationship of water balance of the changed river water system. Second is energy balance. The connection of rivers and lakes should be done according to the conversion law of water, the potential energy and kinetic energy, and as far as possible using water bodies own energy to maintain water mobility. Third is about water resources renewability. Just improve river mobility to enhance water resources renewability in river water

  17. MX Hierarchical Networking System.

    Science.gov (United States)

    1982-02-01

    Information needed to analyze the deployment masterplan . This is the facili- ties level of detail. The third level (level 3) reflects the quantities of...Summary) 100 Level 1 SUBTOTAL 1 100 Level 2 (Deployment Masterplan ) DAA 350 OBTS 200 OPBASE 600 DDA/DTN 1,200 AUX OPBASE 550 LIFE SUPPORT 300...CEMXPA Program Summary -- 1 -- 100 Deployment Masterplan -- 2 -- 260 360 CEMXCO Deployment !asterplan 0 3 -- 900 900 AFRCE Deployment Masterplan 1 0

  18. Hierarchical organization of fluxes in Escherichia coli metabolic network: using flux coupling analysis for understanding the physiological properties of metabolic genes.

    Science.gov (United States)

    Hosseini, Zhaleh; Marashi, Sayed-Amir

    2015-05-01

    Flux coupling analysis is a method for investigating the connections between reactions of metabolic networks. Here, we construct the hierarchical flux coupling graph for the reactions of the Escherichia coli metabolic network model to determine the level of each reaction in the graph. This graph is constructed based on flux coupling analysis of metabolic network: if zero flux through reaction a results in zero flux through reaction b (and not vice versa), then reaction a is located at the top of reaction b in the flux coupling graph. We show that in general, more important, older and essential reactions are located at the top of the graph. Strikingly, genes corresponding to these reactions are found to be the genes which are most regulated.

  19. 基于混合储能的并网光伏电站有功分级控制策略%Active Power Hierarchical Control Strategy of Interconnected Photovoltaic Station Based on Hybrid Energy Storage

    Institute of Scientific and Technical Information of China (English)

    鲍雪娜; 张建成; 徐明; 刘汉民

    2013-01-01

    针对自然条件下光伏电源有功出力的波动性,以超级电容器和磷酸铁锂电池组成的混合储能系统为基础,制定了有功分级控制策略.首先分析了光伏电站整体结构及混合储能装置的接入方式,然后考虑电网需求利用指数平滑法来实时更新光伏电站整体出力参考值,实现第1级控制.根据储能元件能量存储与功率吞吐特性,提出了以超级电容器为充放电主体的混合储能系统能量管理策略,实现第2级控制,并设计了脉宽调制的控制原理电路.编程计算结果证实了所述方法的有效性.%In view of the active power fluctuation of large capacity photovoltaic (PV) power systems, based on a hybrid energy storage system consisting of supercapacitors and lithium-ion ferrous phosphate batteries, an active power hierarchical control strategy is formulated to optimize the output power of PV source. First, the overall structure of photovoltaic power station and the way of accessing the hybrid energy storage system are analyzed. Then, by considering the power grid needs, the exponential smoothing method is used to real-time update the reference values of output power to realize the first level control. The energy management strategy is put forward according to the storage characteristics of energy storage components and power throughput so as to realize the second level control of the hybrid energy storage system. In addition, an energy management strategy is put forward with supercapacitors as the principal part of charge and discharge. Finally, a control circuit of pulse width modulation (PWM) is designed. Programming results demonstrate the effectiveness of the proposed method.

  20. Systems theory of interconnected port contact systems

    NARCIS (Netherlands)

    Eberard, D.; Maschke, B.M.; Schaft, A.J. van der

    2005-01-01

    Port-based network modeling of a large class of complex physical systems leads to dynamical systems known as port-Hamiltonian systems. The key ingredient of any port-Hamiltonian system is a power-conserving interconnection structure (mathematically formalized by the geometric notion of a Dirac struc