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

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.

Hierarchical Learning of Tree Classifiers for Large-Scale Plant Species Identification.

Science.gov (United States)

Fan, Jianping; Zhou, Ning; Peng, Jinye; Gao, Ling

2015-11-01

In this paper, a hierarchical multi-task structural learning algorithm is developed to support large-scale plant species identification, where a visual tree is constructed for organizing large numbers of plant species in a coarse-to-fine fashion and determining the inter-related learning tasks automatically. For a given parent node on the visual tree, it contains a set of sibling coarse-grained categories of plant species or sibling fine-grained plant species, and a multi-task structural learning algorithm is developed to train their inter-related classifiers jointly for enhancing their discrimination power. The inter-level relationship constraint, e.g., a plant image must first be assigned to a parent node (high-level non-leaf node) correctly if it can further be assigned to the most relevant child node (low-level non-leaf node or leaf node) on the visual tree, is formally defined and leveraged to learn more discriminative tree classifiers over the visual tree. Our experimental results have demonstrated the effectiveness of our hierarchical multi-task structural learning algorithm on training more discriminative tree classifiers for large-scale plant species identification.

GOTHIC: Gravitational oct-tree code accelerated by hierarchical time step controlling

Science.gov (United States)

Miki, Yohei; Umemura, Masayuki

2017-04-01

The tree method is a widely implemented algorithm for collisionless N-body simulations in astrophysics well suited for GPU(s). Adopting hierarchical time stepping can accelerate N-body simulations; however, it is infrequently implemented and its potential remains untested in GPU implementations. We have developed a Gravitational Oct-Tree code accelerated by HIerarchical time step Controlling named GOTHIC, which adopts both the tree method and the hierarchical time step. The code adopts some adaptive optimizations by monitoring the execution time of each function on-the-fly and minimizes the time-to-solution by balancing the measured time of multiple functions. Results of performance measurements with realistic particle distribution performed on NVIDIA Tesla M2090, K20X, and GeForce GTX TITAN X, which are representative GPUs of the Fermi, Kepler, and Maxwell generation of GPUs, show that the hierarchical time step achieves a speedup by a factor of around 3-5 times compared to the shared time step. The measured elapsed time per step of GOTHIC is 0.30 s or 0.44 s on GTX TITAN X when the particle distribution represents the Andromeda galaxy or the NFW sphere, respectively, with 224 = 16,777,216 particles. The averaged performance of the code corresponds to 10-30% of the theoretical single precision peak performance of the GPU.

On Tree-Based Phylogenetic Networks.

Science.gov (United States)

Zhang, Louxin

2016-07-01

A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree-based networks. We present a simple necessary and sufficient condition for tree-based networks and prove that a universal tree-based network exists for any number of taxa that contains as its base every phylogenetic tree on the same set of taxa. This answers two problems posted by Francis and Steel recently. A byproduct is a computer program for generating random binary phylogenetic networks under the uniform distribution model.

Deep hierarchical attention network for video description

Science.gov (United States)

Li, Shuohao; Tang, Min; Zhang, Jun

2018-03-01

Pairing video to natural language description remains a challenge in computer vision and machine translation. Inspired by image description, which uses an encoder-decoder model for reducing visual scene into a single sentence, we propose a deep hierarchical attention network for video description. The proposed model uses convolutional neural network (CNN) and bidirectional LSTM network as encoders while a hierarchical attention network is used as the decoder. Compared to encoder-decoder models used in video description, the bidirectional LSTM network can capture the temporal structure among video frames. Moreover, the hierarchical attention network has an advantage over single-layer attention network on global context modeling. To make a fair comparison with other methods, we evaluate the proposed architecture with different types of CNN structures and decoders. Experimental results on the standard datasets show that our model has a more superior performance than the state-of-the-art techniques.

Organization of excitable dynamics in hierarchical biological networks.

Directory of Open Access Journals (Sweden)

Mark Müller-Linow

Full Text Available This study investigates the contributions of network topology features to the dynamic behavior of hierarchically organized excitable networks. Representatives of different types of hierarchical networks as well as two biological neural networks are explored with a three-state model of node activation for systematically varying levels of random background network stimulation. The results demonstrate that two principal topological aspects of hierarchical networks, node centrality and network modularity, correlate with the network activity patterns at different levels of spontaneous network activation. The approach also shows that the dynamic behavior of the cerebral cortical systems network in the cat is dominated by the network's modular organization, while the activation behavior of the cellular neuronal network of Caenorhabditis elegans is strongly influenced by hub nodes. These findings indicate the interaction of multiple topological features and dynamic states in the function of complex biological networks.

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.

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.

Nonbinary Tree-Based Phylogenetic Networks.

Science.gov (United States)

Jetten, Laura; van Iersel, Leo

2018-01-01

Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can, for example, represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and strictly-tree-based nonbinary phylogenetic networks. We give simple graph-theoretic characterizations of tree-based and strictly-tree-based nonbinary phylogenetic networks. Moreover, we show for each of these two classes that it can be decided in polynomial time whether a given network is contained in the class. Our approach also provides a new view on tree-based binary phylogenetic networks. Finally, we discuss two examples of nonbinary phylogenetic networks in biology and show how our results can be applied to them.

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.

Hierarchical modularity in human brain functional networks

Directory of Open Access Journals (Sweden)

David Meunier

2009-10-01

Full Text Available 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 the highest level of the hierarchy were medial occipital, lateral occipital, central, parieto-frontal and fronto-temporal systems; occipital modules demonstrated less sub-modular organization than modules comprising regions of multimodal association cortex. Connector nodes and hubs, with a key role in inter-modular connectivity, were also concentrated in association cortical areas. We conclude that methods are available for hierarchical modular decomposition of large numbers of high resolution brain functional networks using computationally expedient algorithms. This could enable future investigations of Simon's original hypothesis that hierarchy or near-decomposability of physical symbol systems is a critical design feature for their fast adaptivity to changing environmental conditions.

A Hierarchical Dispatch Structure for Distribution Network Pricing

OpenAIRE

Yuan, Zhao; Hesamzadeh, Mohammad Reza

2015-01-01

This paper presents a hierarchical dispatch structure for efficient distribution network pricing. The dispatch coordination problem in the context of hierarchical network operators are addressed. We formulate decentralized generation dispatch into a bilevel optimization problem in which main network operator and the connected distribution network operator optimize their costs in two levels. By using Karush-Kuhn-Tucker conditions and Fortuny-Amat McCarl linearization, the bilevel optimization ...

A hierarchical clustering scheme approach to assessment of IP-network traffic using detrended fluctuation analysis

Science.gov (United States)

Takuma, Takehisa; Masugi, Masao

2009-03-01

This paper presents an approach to the assessment of IP-network traffic in terms of the time variation of self-similarity. To get a comprehensive view in analyzing the degree of long-range dependence (LRD) of IP-network traffic, we use a hierarchical clustering scheme, which provides a way to classify high-dimensional data with a tree-like structure. Also, in the LRD-based analysis, we employ detrended fluctuation analysis (DFA), which is applicable to the analysis of long-range power-law correlations or LRD in non-stationary time-series signals. Based on sequential measurements of IP-network traffic at two locations, this paper derives corresponding values for the LRD-related parameter α that reflects the degree of LRD of measured data. In performing the hierarchical clustering scheme, we use three parameters: the α value, average throughput, and the proportion of network traffic that exceeds 80% of network bandwidth for each measured data set. We visually confirm that the traffic data can be classified in accordance with the network traffic properties, resulting in that the combined depiction of the LRD and other factors can give us an effective assessment of network conditions at different times.

Stability of glassy hierarchical networks

Science.gov (United States)

Zamani, M.; Camargo-Forero, L.; Vicsek, T.

2018-02-01

The structure of interactions in most animal and human societies can be best represented by complex hierarchical networks. In order to maintain close-to-optimal function both stability and adaptability are necessary. Here we investigate the stability of hierarchical networks that emerge from the simulations of an organization type with an efficiency function reminiscent of the Hamiltonian of spin glasses. Using this quantitative approach we find a number of expected (from everyday observations) and highly non-trivial results for the obtained locally optimal networks, including, for example: (i) stability increases with growing efficiency and level of hierarchy; (ii) the same perturbation results in a larger change for more efficient states; (iii) networks with a lower level of hierarchy become more efficient after perturbation; (iv) due to the huge number of possible optimal states only a small fraction of them exhibit resilience and, finally, (v) ‘attacks’ targeting the nodes selectively (regarding their position in the hierarchy) can result in paradoxical outcomes.

Modular networks with hierarchical organization

Indian Academy of Sciences (India)

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

Topology of foreign exchange markets using hierarchical structure methods

Science.gov (United States)

Naylor, Michael J.; Rose, Lawrence C.; Moyle, Brendan J.

2007-08-01

This paper uses two physics derived hierarchical techniques, a minimal spanning tree and an ultrametric hierarchical tree, to extract a topological influence map for major currencies from the ultrametric distance matrix for 1995-2001. We find that these two techniques generate a defined and robust scale free network with meaningful taxonomy. The topology is shown to be robust with respect to method, to time horizon and is stable during market crises. This topology, appropriately used, gives a useful guide to determining the underlying economic or regional causal relationships for individual currencies and to understanding the dynamics of exchange rate price determination as part of a complex network.

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

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...... components also forming labyrinthine domains whose geometry and topology changes systematically as a function of composition. These smaller labyrinths are well described by a family of patterns that tile the hyperbolic plane by regular degree-three trees mapped onto the gyroid. The labyrinths within......-ridden achiral patterns, containing domains of either hand, due to the achiral terpolymeric starting molecules. These mesostructures are among the most topologically complex morphologies identified to date and represent an example of hierarchical ordering within a hyperbolic pattern, a unique mode of soft...

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. Copyright © 2016 Elsevier Ltd. All rights reserved.

Border trees of complex networks

International Nuclear Information System (INIS)

Villas Boas, Paulino R; Rodrigues, Francisco A; Travieso, Gonzalo; Fontoura Costa, Luciano da

2008-01-01

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed

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

Science.gov (United States)

Nitta, Tohru

2017-10-01

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

Folding and unfolding phylogenetic trees and networks.

Science.gov (United States)

Huber, Katharina T; Moulton, Vincent; Steel, Mike; Wu, Taoyang

2016-12-01

Phylogenetic networks are rooted, labelled directed acyclic graphswhich are commonly used to represent reticulate evolution. There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees). Indeed, any phylogenetic network N can be "unfolded" to obtain a MUL-tree U(N) and, conversely, a MUL-tree T can in certain circumstances be "folded" to obtain aphylogenetic network F(T) that exhibits T. In this paper, we study properties of the operations U and F in more detail. In particular, we introduce the class of stable networks, phylogenetic networks N for which F(U(N)) is isomorphic to N, characterise such networks, and show that they are related to the well-known class of tree-sibling networks. We also explore how the concept of displaying a tree in a network N can be related to displaying the tree in the MUL-tree U(N). To do this, we develop aphylogenetic analogue of graph fibrations. This allows us to view U(N) as the analogue of the universal cover of a digraph, and to establish a close connection between displaying trees in U(N) and reconciling phylogenetic trees with networks.

On Determining if Tree-based Networks Contain Fixed Trees.

Science.gov (United States)

Anaya, Maria; Anipchenko-Ulaj, Olga; Ashfaq, Aisha; Chiu, Joyce; Kaiser, Mahedi; Ohsawa, Max Shoji; Owen, Megan; Pavlechko, Ella; St John, Katherine; Suleria, Shivam; Thompson, Keith; Yap, Corrine

2016-05-01

We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is N based on T? We show that it is [Formula: see text]-hard to decide, by reduction from 3-Dimensional Matching (3DM) and further that the problem is fixed-parameter tractable.

Tree-Based Unrooted Phylogenetic Networks.

Science.gov (United States)

Francis, A; Huber, K T; Moulton, V

2018-02-01

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is X. It is called a phylogenetic tree if the underlying graph is a tree. In this paper we consider properties of tree-based networks, that is, networks that can be constructed by adding edges into a phylogenetic tree. We show that although they have some properties in common with their rooted analogues which have recently drawn much attention in the literature, they have some striking differences in terms of both their structural and computational properties. We expect that our results could eventually have applications to, for example, detecting horizontal gene transfer or hybridization which are important factors in the evolution of many organisms.

Hierarchical spatial organization of geographical networks

International Nuclear Information System (INIS)

Travencolo, Bruno A N; Costa, Luciano da F

2008-01-01

In this work, we propose a hierarchical extension of the polygonality index as the means to characterize geographical planar networks. By considering successive neighborhoods around each node, it is possible to obtain more complete information about the spatial order of the network at progressive spatial scales. The potential of the methodology is illustrated with respect to synthetic and real geographical networks

Nonbinary tree-based phylogenetic networks

OpenAIRE

Jetten, Laura; van Iersel, Leo

2016-01-01

Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can for example represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and st...

Topology-based hierarchical scheduling using deficit round robin

DEFF Research Database (Denmark)

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

2009-01-01

according to the topology. The mapping process could be completed through the network management plane or by manual configuration. Based on the knowledge of the network, the scheduler can manage the traffic on behalf of other less advanced nodes, avoid potential traffic congestion, and provide flow...... protection and isolation. Comparisons between hierarchical scheduling, flow-based scheduling, and class-based scheduling schemes have been carried out under a symmetric tree topology. Results have shown that the hierarchical scheduling scheme provides better flow protection and isolation from attack...

A Weibull-based compositional approach for hierarchical dynamic fault trees

International Nuclear Information System (INIS)

Chiacchio, F.; Cacioppo, M.; D'Urso, D.; Manno, G.; Trapani, N.; Compagno, L.

2013-01-01

The solution of a dynamic fault tree (DFT) for the reliability assessment can be achieved using a wide variety of techniques. These techniques have a strong theoretical foundation as both the analytical and the simulation methods have been extensively developed. Nevertheless, they all present the same limits that appear with the increasing of the size of the fault trees (i.e., state space explosion, time-consuming simulations), compromising the resolution. We have tested the feasibility of a composition algorithm based on a Weibull distribution, addressed to the resolution of a general class of dynamic fault trees characterized by non-repairable basic events and generally distributed failure times. The proposed composition algorithm is used to generalize the traditional hierarchical technique that, as previous literature have extensively confirmed, is able to reduce the computational effort of a large DFT through the modularization of independent parts of the tree. The results of this study are achieved both through simulation and analytical techniques, thus confirming the capability to solve a quite general class of dynamic fault trees and overcome the limits of traditional techniques.

Multiple simultaneous fault diagnosis via hierarchical and single artificial neural networks

International Nuclear Information System (INIS)

Eslamloueyan, R.; Shahrokhi, M.; Bozorgmehri, R.

2003-01-01

Process fault diagnosis involves interpreting the current status of the plant given sensor reading and process knowledge. There has been considerable work done in this area with a variety of approaches being proposed for process fault diagnosis. Neural networks have been used to solve process fault diagnosis problems in chemical process, as they are well suited for recognizing multi-dimensional nonlinear patterns. In this work, the use of Hierarchical Artificial Neural Networks in diagnosing the multi-faults of a chemical process are discussed and compared with that of Single Artificial Neural Networks. The lower efficiency of Hierarchical Artificial Neural Networks , in comparison to Single Artificial Neural Networks, in process fault diagnosis is elaborated and analyzed. Also, the concept of a multi-level selection switch is presented and developed to improve the performance of hierarchical artificial neural networks. Simulation results indicate that application of multi-level selection switch increase the performance of the hierarchical artificial neural networks considerably

Risk and reliability assessment for telecommunications networks

Energy Technology Data Exchange (ETDEWEB)

Wyss, G.D.; Schriner, H.K.; Gaylor, T.R.

1996-08-01

Sandia National Laboratories has assembled an interdisciplinary team to explore the applicability of probabilistic logic modeling (PLM) techniques to model network reliability for a wide variety of communications network architectures. The authors have found that the reliability and failure modes of current generation network technologies can be effectively modeled using fault tree PLM techniques. They have developed a ``plug-and-play`` fault tree analysis methodology that can be used to model connectivity and the provision of network services in a wide variety of current generation network architectures. They have also developed an efficient search algorithm that can be used to determine the minimal cut sets of an arbitrarily-interconnected (non-hierarchical) network without the construction of a fault tree model. This paper provides an overview of these modeling techniques and describes how they are applied to networks that exhibit hybrid network structures (i.e., a network in which some areas are hierarchical and some areas are not hierarchical).

Hierarchical Trust Management of COI in Heterogeneous Mobile Networks

Science.gov (United States)

2017-08-01

Report: Hierarchical Trust Management of COI in Heterogeneous Mobile Networks The views, opinions and/or findings contained in this report are those of...Institute & State University Title: Hierarchical Trust Management of COI in Heterogeneous Mobile Networks Report Term: 0-Other Email: irchen@vt.edu...Reconfigurability, Survivability and Intrusion Tolerance for Community of Interest (COI) Applications – Our proposed COI trust management protocol will

Transforming phylogenetic networks: Moving beyond tree space.

Science.gov (United States)

Huber, Katharina T; Moulton, Vincent; Wu, Taoyang

2016-09-07

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transformed into any other such network using only these operations. This generalizes the well-known fact that any phylogenetic tree can be transformed into any other such tree using only NNI operations. It also allows us to define a generalization of tree space and to define some new metrics on unrooted phylogenetic networks. To prove our main results, we employ some fascinating new connections between phylogenetic networks and cubic graphs that we have recently discovered. Our results should be useful in developing new strategies to search for optimal phylogenetic networks, a topic that has recently generated some interest in the literature, as well as for providing new ways to compare networks. Copyright © 2016 Elsevier Ltd. All rights reserved.

Locating a tree in a phylogenetic network

OpenAIRE

van Iersel, Leo; Semple, Charles; Steel, Mike

2010-01-01

Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster Containment problem asks whether the given cluster is a cluster of some phylogenetic tree embedded in the network. Both problems are known to be NP-complete in general. In this article, we consider t...

IcyTree: rapid browser-based visualization for phylogenetic trees and networks.

Science.gov (United States)

Vaughan, Timothy G

2017-08-01

IcyTree is an easy-to-use application which can be used to visualize a wide variety of phylogenetic trees and networks. While numerous phylogenetic tree viewers exist already, IcyTree distinguishes itself by being a purely online tool, having a responsive user interface, supporting phylogenetic networks (ancestral recombination graphs in particular), and efficiently drawing trees that include information such as ancestral locations or trait values. IcyTree also provides intuitive panning and zooming utilities that make exploring large phylogenetic trees of many thousands of taxa feasible. IcyTree is a web application and can be accessed directly at http://tgvaughan.github.com/icytree . Currently supported web browsers include Mozilla Firefox and Google Chrome. IcyTree is written entirely in client-side JavaScript (no plugin required) and, once loaded, does not require network access to run. IcyTree is free software, and the source code is made available at http://github.com/tgvaughan/icytree under version 3 of the GNU General Public License. tgvaughan@gmail.com. © The Author(s) 2017. Published by Oxford University Press.

Locating a tree in a phylogenetic network

NARCIS (Netherlands)

Iersel, van L.J.J.; Semple, C.; Steel, M.A.

2010-01-01

Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster

Transforming phylogenetic networks: Moving beyond tree space

OpenAIRE

Huber, Katharina T.; Moulton, Vincent; Wu, Taoyang

2016-01-01

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transforme...

Detecting the overlapping and hierarchical community structure in complex networks

International Nuclear Information System (INIS)

Lancichinetti, Andrea; Fortunato, Santo; Kertesz, Janos

2009-01-01

Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that are only weakly linked to each other. Uncovering this community structure is one of the most important problems in the field of complex networks. Networks often show a hierarchical organization, with communities embedded within other communities; moreover, nodes can be shared between different communities. Here, we present the first algorithm that finds both overlapping communities and the hierarchical structure. The method is based on the local optimization of a fitness function. Community structure is revealed by peaks in the fitness histogram. The resolution can be tuned by a parameter enabling different hierarchical levels of organization to be investigated. Tests on real and artificial networks give excellent results.

Predicting gene function using hierarchical multi-label decision tree ensembles

Directory of Open Access Journals (Sweden)

Kocev Dragi

2010-01-01

Full Text Available Abstract Background S. cerevisiae, A. thaliana and M. musculus are well-studied organisms in biology and the sequencing of their genomes was completed many years ago. It is still a challenge, however, to develop methods that assign biological functions to the ORFs in these genomes automatically. Different machine learning methods have been proposed to this end, but it remains unclear which method is to be preferred in terms of predictive performance, efficiency and usability. Results We study the use of decision tree based models for predicting the multiple functions of ORFs. First, we describe an algorithm for learning hierarchical multi-label decision trees. These can simultaneously predict all the functions of an ORF, while respecting a given hierarchy of gene functions (such as FunCat or GO. We present new results obtained with this algorithm, showing that the trees found by it exhibit clearly better predictive performance than the trees found by previously described methods. Nevertheless, the predictive performance of individual trees is lower than that of some recently proposed statistical learning methods. We show that ensembles of such trees are more accurate than single trees and are competitive with state-of-the-art statistical learning and functional linkage methods. Moreover, the ensemble method is computationally efficient and easy to use. Conclusions Our results suggest that decision tree based methods are a state-of-the-art, efficient and easy-to-use approach to ORF function prediction.

Hierarchical organization of brain functional networks during visual tasks.

Science.gov (United States)

Zhuo, Zhao; Cai, Shi-Min; Fu, Zhong-Qian; Zhang, Jie

2011-09-01

The functional network of the brain is known to demonstrate modular structure over different hierarchical scales. In this paper, we systematically investigated the hierarchical modular organizations of the brain functional networks that are derived from the extent of phase synchronization among high-resolution EEG time series during a visual task. In particular, we compare the modular structure of the functional network from EEG channels with that of the anatomical parcellation of the brain cortex. Our results show that the modular architectures of brain functional networks correspond well to those from the anatomical structures over different levels of hierarchy. Most importantly, we find that the consistency between the modular structures of the functional network and the anatomical network becomes more pronounced in terms of vision, sensory, vision-temporal, motor cortices during the visual task, which implies that the strong modularity in these areas forms the functional basis for the visual task. The structure-function relationship further reveals that the phase synchronization of EEG time series in the same anatomical group is much stronger than that of EEG time series from different anatomical groups during the task and that the hierarchical organization of functional brain network may be a consequence of functional segmentation of the brain cortex.

Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks.

Science.gov (United States)

Oh, S June; Joung, Je-Gun; Chang, Jeong-Ho; Zhang, Byoung-Tak

2006-06-06

To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to calculate the distance between the resulting values of each measure. Conventional phylogenetic analysis based on genomic sequences provides information about the genetic relationships between different organisms. In contrast, comparative analysis of metabolic pathways in different organisms can yield insights into their functional relationships under different physiological conditions. However, evaluating the similarities or differences between metabolic networks is a computationally challenging problem, and systematic methods of doing this are desirable. Here we introduce a graph-kernel method for computing the similarity between metabolic networks in polynomial time, and use it to profile metabolic pathways and to construct phylogenetic trees. To compare the structures of metabolic networks in organisms, we adopted the exponential graph kernel, which is a kernel-based approach with a labeled graph that includes a label matrix and an adjacency matrix. To construct the phylogenetic trees, we used an unweighted pair-group method with arithmetic mean, i.e., a hierarchical clustering algorithm. We applied the kernel-based network profiling method in a comparative analysis of nine carbohydrate metabolic networks from 81 biological species encompassing Archaea, Eukaryota, and Eubacteria. The resulting phylogenetic hierarchies generally support the tripartite scheme of three domains rather than the two domains of prokaryotes and eukaryotes. By combining the kernel machines with metabolic information, the method infers the context of biosphere development that covers physiological events required for adaptation by genetic reconstruction. The results show that one may obtain a global view of the tree of life by comparing the metabolic pathway structures using meta-level information rather than sequence

Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks

Directory of Open Access Journals (Sweden)

Chang Jeong-Ho

2006-06-01

Full Text Available Abstract Background To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to calculate the distance between the resulting values of each measure. Conventional phylogenetic analysis based on genomic sequences provides information about the genetic relationships between different organisms. In contrast, comparative analysis of metabolic pathways in different organisms can yield insights into their functional relationships under different physiological conditions. However, evaluating the similarities or differences between metabolic networks is a computationally challenging problem, and systematic methods of doing this are desirable. Here we introduce a graph-kernel method for computing the similarity between metabolic networks in polynomial time, and use it to profile metabolic pathways and to construct phylogenetic trees. Results To compare the structures of metabolic networks in organisms, we adopted the exponential graph kernel, which is a kernel-based approach with a labeled graph that includes a label matrix and an adjacency matrix. To construct the phylogenetic trees, we used an unweighted pair-group method with arithmetic mean, i.e., a hierarchical clustering algorithm. We applied the kernel-based network profiling method in a comparative analysis of nine carbohydrate metabolic networks from 81 biological species encompassing Archaea, Eukaryota, and Eubacteria. The resulting phylogenetic hierarchies generally support the tripartite scheme of three domains rather than the two domains of prokaryotes and eukaryotes. Conclusion By combining the kernel machines with metabolic information, the method infers the context of biosphere development that covers physiological events required for adaptation by genetic reconstruction. The results show that one may obtain a global view of the tree of life by comparing the metabolic pathway

Hierarchical Network Design Using Simulated Annealing

DEFF Research Database (Denmark)

Thomadsen, Tommy; Clausen, Jens

2002-01-01

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

A Hierarchical Analysis of Tree Growth and Environmental Drivers Across Eastern US Temperate Forests

Science.gov (United States)

Mantooth, J.; Dietze, M.

2014-12-01

Improving predictions of how forests in the eastern United States will respond to future global change requires a better understanding of the drivers of variability in tree growth rates. Current inventory data lack the temporal resolution to characterize interannual variability, while existing growth records lack the extent required to assess spatial scales of variability. Therefore, we established a network of forest inventory plots across ten sites across the eastern US, and measured growth in adult trees using increment cores. Sites were chosen to maximize climate space explored, while within sites, plots were spread across primary environmental gradients to explore landscape-level variability in growth. Using the annual growth record available from tree cores, we explored the responses of trees to multiple environmental covariates over multiple spatial and temporal scales. We hypothesized that within and across sites growth rates vary among species, and that intraspecific growth rates increase with temperature along a species' range. We also hypothesized that trees show synchrony in growth responses to landscape-scale climatic changes. Initial analyses of growth increments indicate that across sites, trees with intermediate shade tolerance, e.g. Red Oak (Quercus rubra), tend to have the highest growth rates. At the site level, there is evidence for synchrony in response to large-scale climatic events (e.g. prolonged drought and above average temperatures). However, growth responses to climate at the landscape scale have yet to be detected. Our current analysis utilizes hierarchical Bayesian state-space modeling to focus on growth responses of adult trees to environmental covariates at multiple spatial and temporal scales. This predictive model of tree growth currently incorporates observed effects at the individual, plot, site, and landscape scale. Current analysis using this model shows a potential slowing of growth in the past decade for two sites in the

A local adaptive algorithm for emerging scale-free hierarchical networks

International Nuclear Information System (INIS)

Gomez Portillo, I J; Gleiser, P M

2010-01-01

In this work we study a growing network model with chaotic dynamical units that evolves using a local adaptive rewiring algorithm. Using numerical simulations we show that the model allows for the emergence of hierarchical networks. First, we show that the networks that emerge with the algorithm present a wide degree distribution that can be fitted by a power law function, and thus are scale-free networks. Using the LaNet-vi visualization tool we present a graphical representation that reveals a central core formed only by hubs, and also show the presence of a preferential attachment mechanism. In order to present a quantitative analysis of the hierarchical structure we analyze the clustering coefficient. In particular, we show that as the network grows the clustering becomes independent of system size, and also presents a power law decay as a function of the degree. Finally, we compare our results with a similar version of the model that has continuous non-linear phase oscillators as dynamical units. The results show that local interactions play a fundamental role in the emergence of hierarchical networks.

Cluster Based Hierarchical Routing Protocol for Wireless Sensor Network

OpenAIRE

Rashed, Md. Golam; Kabir, M. Hasnat; Rahim, Muhammad Sajjadur; Ullah, Shaikh Enayet

2012-01-01

The efficient use of energy source in a sensor node is most desirable criteria for prolong the life time of wireless sensor network. In this paper, we propose a two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP). We introduce a new concept called head-set, consists of one active cluster head and some other associate cluster heads within a cluster. The head-set members are responsible for control and management of the network. Results show that t...

Chimera states in networks of logistic maps with hierarchical connectivities

Science.gov (United States)

zur Bonsen, Alexander; Omelchenko, Iryna; Zakharova, Anna; Schöll, Eckehard

2018-04-01

Chimera states are complex spatiotemporal patterns consisting of coexisting domains of coherence and incoherence. We study networks of nonlocally coupled logistic maps and analyze systematically how the dilution of the network links influences the appearance of chimera patterns. The network connectivities are constructed using an iterative Cantor algorithm to generate fractal (hierarchical) connectivities. Increasing the hierarchical level of iteration, we compare the resulting spatiotemporal patterns. We demonstrate that a high clustering coefficient and symmetry of the base pattern promotes chimera states, and asymmetric connectivities result in complex nested chimera patterns.

A new hierarchical method to find community structure in networks

Science.gov (United States)

Saoud, Bilal; Moussaoui, Abdelouahab

2018-04-01

Community structure is very important to understand a network which represents a context. Many community detection methods have been proposed like hierarchical methods. In our study, we propose a new hierarchical method for community detection in networks based on genetic algorithm. In this method we use genetic algorithm to split a network into two networks which maximize the modularity. Each new network represents a cluster (community). Then we repeat the splitting process until we get one node at each cluster. We use the modularity function to measure the strength of the community structure found by our method, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our method are highly effective at discovering community structure in both computer-generated and real-world network data.

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

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

Wavelet compression of multichannel ECG data by enhanced set partitioning in hierarchical trees algorithm.

Science.gov (United States)

Sharifahmadian, Ershad

2006-01-01

The set partitioning in hierarchical trees (SPIHT) algorithm is very effective and computationally simple technique for image and signal compression. Here the author modified the algorithm which provides even better performance than the SPIHT algorithm. The enhanced set partitioning in hierarchical trees (ESPIHT) algorithm has performance faster than the SPIHT algorithm. In addition, the proposed algorithm reduces the number of bits in a bit stream which is stored or transmitted. I applied it to compression of multichannel ECG data. Also, I presented a specific procedure based on the modified algorithm for more efficient compression of multichannel ECG data. This method employed on selected records from the MIT-BIH arrhythmia database. According to experiments, the proposed method attained the significant results regarding compression of multichannel ECG data. Furthermore, in order to compress one signal which is stored for a long time, the proposed multichannel compression method can be utilized efficiently.

Hierarchical regular small-world networks

International Nuclear Information System (INIS)

Boettcher, Stefan; Goncalves, Bruno; Guclu, Hasan

2008-01-01

Two new networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They possess a unique one-dimensional lattice backbone overlaid by a hierarchical sequence of long-distance links, mixing real-space and small-world features. Both networks, one 3-regular and the other 4-regular, lead to distinct behaviors, as revealed by renormalization group studies. The 3-regular network is planar, has a diameter growing as √N with system size N, and leads to super-diffusion with an exact, anomalous exponent d w = 1.306..., but possesses only a trivial fixed point T c = 0 for the Ising ferromagnet. In turn, the 4-regular network is non-planar, has a diameter growing as ∼2 √(log 2 N 2 ) , exhibits 'ballistic' diffusion (d w = 1), and a non-trivial ferromagnetic transition, T c > 0. It suggests that the 3-regular network is still quite 'geometric', while the 4-regular network qualifies as a true small world with mean-field properties. As an engineering application we discuss synchronization of processors on these networks. (fast track communication)

Motion Tree Delineates Hierarchical Structure of Protein Dynamics Observed in Molecular Dynamics Simulation.

Directory of Open Access Journals (Sweden)

Kei Moritsugu

Full Text Available Molecular dynamics (MD simulations of proteins provide important information to understand their functional mechanisms, which are, however, likely to be hidden behind their complicated motions with a wide range of spatial and temporal scales. A straightforward and intuitive analysis of protein dynamics observed in MD simulation trajectories is therefore of growing significance with the large increase in both the simulation time and system size. In this study, we propose a novel description of protein motions based on the hierarchical clustering of fluctuations in the inter-atomic distances calculated from an MD trajectory, which constructs a single tree diagram, named a "Motion Tree", to determine a set of rigid-domain pairs hierarchically along with associated inter-domain fluctuations. The method was first applied to the MD trajectory of substrate-free adenylate kinase to clarify the usefulness of the Motion Tree, which illustrated a clear-cut dynamics picture of the inter-domain motions involving the ATP/AMP lid and the core domain together with the associated amplitudes and correlations. The comparison of two Motion Trees calculated from MD simulations of ligand-free and -bound glutamine binding proteins clarified changes in inherent dynamics upon ligand binding appeared in both large domains and a small loop that stabilized ligand molecule. Another application to a huge protein, a multidrug ATP binding cassette (ABC transporter, captured significant increases of fluctuations upon binding a drug molecule observed in both large scale inter-subunit motions and a motion localized at a transmembrane helix, which may be a trigger to the subsequent structural change from inward-open to outward-open states to transport the drug molecule. These applications demonstrated the capabilities of Motion Trees to provide an at-a-glance view of various sizes of functional motions inherent in the complicated MD trajectory.

Trees and networks before and after Darwin

Directory of Open Access Journals (Sweden)

Ragan Mark A

2009-11-01

Full Text Available Abstract It is well-known that Charles Darwin sketched abstract trees of relationship in his 1837 notebook, and depicted a tree in the Origin of Species (1859. Here I attempt to place Darwin's trees in historical context. By the mid-Eighteenth century the Great Chain of Being was increasingly seen to be an inadequate description of order in nature, and by about 1780 it had been largely abandoned without a satisfactory alternative having been agreed upon. In 1750 Donati described aquatic and terrestrial organisms as forming a network, and a few years later Buffon depicted a network of genealogical relationships among breeds of dogs. In 1764 Bonnet asked whether the Chain might actually branch at certain points, and in 1766 Pallas proposed that the gradations among organisms resemble a tree with a compound trunk, perhaps not unlike the tree of animal life later depicted by Eichwald. Other trees were presented by Augier in 1801 and by Lamarck in 1809 and 1815, the latter two assuming a transmutation of species over time. Elaborate networks of affinities among plants and among animals were depicted in the late Eighteenth and very early Nineteenth centuries. In the two decades immediately prior to 1837, so-called affinities and/or analogies among organisms were represented by diverse geometric figures. Series of plant and animal fossils in successive geological strata were represented as trees in a popular textbook from 1840, while in 1858 Bronn presented a system of animals, as evidenced by the fossil record, in a form of a tree. Darwin's 1859 tree and its subsequent elaborations by Haeckel came to be accepted in many but not all areas of biological sciences, while network diagrams were used in others. Beginning in the early 1960s trees were inferred from protein and nucleic acid sequences, but networks were re-introduced in the mid-1990s to represent lateral genetic transfer, increasingly regarded as a fundamental mode of evolution at least for

Diagnostic Classifiers: Revealing how Neural Networks Process Hierarchical Structure

NARCIS (Netherlands)

Veldhoen, S.; Hupkes, D.; Zuidema, W.

2016-01-01

We investigate how neural networks can be used for hierarchical, compositional semantics. To this end, we define the simple but nontrivial artificial task of processing nested arithmetic expressions and study whether different types of neural networks can learn to add and subtract. We find that

Multiple dynamical time-scales in networks with hierarchically

Indian Academy of Sciences (India)

Modular networks; hierarchical organization; synchronization. ... we show that such a topological structure gives rise to characteristic time-scale separation ... This suggests a possible functional role of such mesoscopic organization principle in ...

Epidemics and dimensionality in hierarchical networks

Science.gov (United States)

Zheng, Da-Fang; Hui, P. M.; Trimper, Steffen; Zheng, Bo

2005-07-01

Epidemiological processes are studied within a recently proposed hierarchical network model using the susceptible-infected-refractory dynamics of an epidemic. Within the network model, a population may be characterized by H independent hierarchies or dimensions, each of which consists of groupings of individuals into layers of subgroups. Detailed numerical simulations reveal that for H>1, global spreading results regardless of the degree of homophily of the individuals forming a social circle. For H=1, a transition from global to local spread occurs as the population becomes decomposed into increasingly homophilous groups. Multiple dimensions in classifying individuals (nodes) thus make a society (computer network) highly susceptible to large-scale outbreaks of infectious diseases (viruses).

A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters

Science.gov (United States)

Ma, Fei; Su, Jing; Hao, Yongxing; Yao, Bing; Yan, Guanghui

2018-02-01

The problem of uncovering the internal operating function of network models is intriguing, demanded and attractive in researches of complex networks. Notice that, in the past two decades, a great number of artificial models are built to try to answer the above mentioned task. Based on the different growth ways, these previous models can be divided into two categories, one type, possessing the preferential attachment, follows a power-law P(k) ∼k-γ, 2 motivated from a new attachment way, vertex-edge-growth network-operation, more precisely, the couple of both them. We report that this model is sparse, small world and hierarchical. And then, not only is scale-free feature in our model, but also lies the degree parameter γ(≈ 3 . 242) out the typical range. Note that, we suggest that the coexistence of multiple vertex growth ways will have a prominent effect on the power-law parameter γ, and the preferential attachment plays a dominate role on the development of networks over time. At the end of this paper, we obtain an exact analytical expression for the total number of spanning trees of models and also capture spanning trees entropy which we have compared with those of their corresponding component elements.

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.

Quantifying loopy network architectures.

Directory of Open Access Journals (Sweden)

Eleni Katifori

Full Text Available Biology presents many examples of planar distribution and structural networks having dense sets of closed loops. An archetype of this form of network organization is the vasculature of dicotyledonous leaves, which showcases a hierarchically-nested architecture containing closed loops at many different levels. Although a number of approaches have been proposed to measure aspects of the structure of such networks, a robust metric to quantify their hierarchical organization is still lacking. We present an algorithmic framework, the hierarchical loop decomposition, that allows mapping loopy networks to binary trees, preserving in the connectivity of the trees the architecture of the original graph. We apply this framework to investigate computer generated graphs, such as artificial models and optimal distribution networks, as well as natural graphs extracted from digitized images of dicotyledonous leaves and vasculature of rat cerebral neocortex. We calculate various metrics based on the asymmetry, the cumulative size distribution and the Strahler bifurcation ratios of the corresponding trees and discuss the relationship of these quantities to the architectural organization of the original graphs. This algorithmic framework decouples the geometric information (exact location of edges and nodes from the metric topology (connectivity and edge weight and it ultimately allows us to perform a quantitative statistical comparison between predictions of theoretical models and naturally occurring loopy graphs.

Extension of mixture-of-experts networks for binary classification of hierarchical data.

Science.gov (United States)

Ng, Shu-Kay; McLachlan, Geoffrey J

2007-09-01

For many applied problems in the context of medically relevant artificial intelligence, the data collected exhibit a hierarchical or clustered structure. Ignoring the interdependence between hierarchical data can result in misleading classification. In this paper, we extend the mechanism for mixture-of-experts (ME) networks for binary classification of hierarchical data. Another extension is to quantify cluster-specific information on data hierarchy by random effects via the generalized linear mixed-effects model (GLMM). The extension of ME networks is implemented by allowing for correlation in the hierarchical data in both the gating and expert networks via the GLMM. The proposed model is illustrated using a real thyroid disease data set. In our study, we consider 7652 thyroid diagnosis records from 1984 to early 1987 with complete information on 20 attribute values. We obtain 10 independent random splits of the data into a training set and a test set in the proportions 85% and 15%. The test sets are used to assess the generalization performance of the proposed model, based on the percentage of misclassifications. For comparison, the results obtained from the ME network with independence assumption are also included. With the thyroid disease data, the misclassification rate on test sets for the extended ME network is 8.9%, compared to 13.9% for the ME network. In addition, based on model selection methods described in Section 2, a network with two experts is selected. These two expert networks can be considered as modeling two groups of patients with high and low incidence rates. Significant variation among the predicted cluster-specific random effects is detected in the patient group with low incidence rate. It is shown that the extended ME network outperforms the ME network for binary classification of hierarchical data. With the thyroid disease data, useful information on the relative log odds of patients with diagnosed conditions at different periods can be

TiO2 nanowire-templated hierarchical nanowire network as water-repelling coating

Science.gov (United States)

Hang, Tian; Chen, Hui-Jiuan; Xiao, Shuai; Yang, Chengduan; Chen, Meiwan; Tao, Jun; Shieh, Han-ping; Yang, Bo-ru; Liu, Chuan; Xie, Xi

2017-12-01

Extraordinary water-repelling properties of superhydrophobic surfaces make them novel candidates for a great variety of potential applications. A general approach to achieve superhydrophobicity requires low-energy coating on the surface and roughness on nano- and micrometre scale. However, typical construction of superhydrophobic surfaces with micro-nano structure through top-down fabrication is restricted by sophisticated fabrication techniques and limited choices of substrate materials. Micro-nanoscale topographies templated by conventional microparticles through surface coating may produce large variations in roughness and uncontrollable defects, resulting in poorly controlled surface morphology and wettability. In this work, micro-nanoscale hierarchical nanowire network was fabricated to construct self-cleaning coating using one-dimensional TiO2 nanowires as microscale templates. Hierarchical structure with homogeneous morphology was achieved by branching ZnO nanowires on the TiO2 nanowire backbones through hydrothermal reaction. The hierarchical nanowire network displayed homogeneous micro/nano-topography, in contrast to hierarchical structure templated by traditional microparticles. This hierarchical nanowire network film exhibited high repellency to both water and cell culture medium after functionalization with fluorinated organic molecules. The hierarchical structure templated by TiO2 nanowire coating significantly increased the surface superhydrophobicity compared to vertical ZnO nanowires with nanotopography alone. Our results demonstrated a promising strategy of using nanowires as microscale templates for the rational design of hierarchical coatings with desired superhydrophobicity that can also be applied to various substrate materials.

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

Hierarchical modular structure enhances the robustness of self-organized criticality in neural networks

International Nuclear Information System (INIS)

Wang Shengjun; Zhou Changsong

2012-01-01

One of the most prominent architecture properties of neural networks in the brain is the hierarchical modular structure. How does the structure property constrain or improve brain function? It is thought that operating near criticality can be beneficial for brain function. Here, we find that networks with modular structure can extend the parameter region of coupling strength over which critical states are reached compared to non-modular networks. Moreover, we find that one aspect of network function—dynamical range—is highest for the same parameter region. Thus, hierarchical modularity enhances robustness of criticality as well as function. However, too much modularity constrains function by preventing the neural networks from reaching critical states, because the modular structure limits the spreading of avalanches. Our results suggest that the brain may take advantage of the hierarchical modular structure to attain criticality and enhanced function. (paper)

Metastable states in the hierarchical Dyson model drive parallel processing in the hierarchical Hopfield network

International Nuclear Information System (INIS)

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

2015-01-01

In this paper, we introduce and investigate the statistical mechanics of hierarchical neural networks. First, we approach these systems à la Mattis, by thinking of the Dyson model as a single-pattern hierarchical neural network. We also discuss the stability of different retrievable states as predicted by the related self-consistencies obtained both from a mean-field bound and from a bound that bypasses the mean-field limitation. The latter is worked out by properly reabsorbing the magnetization fluctuations related to higher levels of the hierarchy into effective fields for the lower levels. Remarkably, mixing Amit's ansatz technique for selecting candidate-retrievable states with the interpolation procedure for solving for the free energy of these states, we prove that, due to gauge symmetry, the Dyson model accomplishes both serial and parallel processing. We extend this scenario to multiple stored patterns by implementing the Hebb prescription for learning within the couplings. This results in Hopfield-like networks constrained on a hierarchical topology, for which, by restricting to the low-storage regime where the number of patterns grows at its most logarithmical with the amount of neurons, we prove the existence of the thermodynamic limit for the free energy, and we give an explicit expression of its mean-field bound and of its related improved bound. We studied the resulting self-consistencies for the Mattis magnetizations, which act as order parameters, are studied and the stability of solutions is analyzed to get a picture of the overall retrieval capabilities of the system according to both mean-field and non-mean-field scenarios. Our main finding is that embedding the Hebbian rule on a hierarchical topology allows the network to accomplish both serial and parallel processing. By tuning the level of fast noise affecting it or triggering the decay of the interactions with the distance among neurons, the system may switch from sequential retrieval to

On the design of a hierarchical SS7 network: A graph theoretical approach

Science.gov (United States)

Krauss, Lutz; Rufa, Gerhard

1994-04-01

This contribution is concerned with the design of Signaling System No. 7 networks based on graph theoretical methods. A hierarchical network topology is derived by combining the advantage of the hierarchical network structure with the realization of node disjoint routes between nodes of the network. By using specific features of this topology, we develop an algorithm to construct circle-free routing data and to assure bidirectionality also in case of failure situations. The methods described are based on the requirements that the network topology, as well as the routing data, may be easily changed.

Discriminative Hierarchical K-Means Tree for Large-Scale Image Classification.

Science.gov (United States)

Chen, Shizhi; Yang, Xiaodong; Tian, Yingli

2015-09-01

A key challenge in large-scale image classification is how to achieve efficiency in terms of both computation and memory without compromising classification accuracy. The learning-based classifiers achieve the state-of-the-art accuracies, but have been criticized for the computational complexity that grows linearly with the number of classes. The nonparametric nearest neighbor (NN)-based classifiers naturally handle large numbers of categories, but incur prohibitively expensive computation and memory costs. In this brief, we present a novel classification scheme, i.e., discriminative hierarchical K-means tree (D-HKTree), which combines the advantages of both learning-based and NN-based classifiers. The complexity of the D-HKTree only grows sublinearly with the number of categories, which is much better than the recent hierarchical support vector machines-based methods. The memory requirement is the order of magnitude less than the recent Naïve Bayesian NN-based approaches. The proposed D-HKTree classification scheme is evaluated on several challenging benchmark databases and achieves the state-of-the-art accuracies, while with significantly lower computation cost and memory requirement.

Reconstruction of certain phylogenetic networks from their tree-average distances.

Science.gov (United States)

Willson, Stephen J

2013-10-01

Trees are commonly utilized to describe the evolutionary history of a collection of biological species, in which case the trees are called phylogenetic trees. Often these are reconstructed from data by making use of distances between extant species corresponding to the leaves of the tree. Because of increased recognition of the possibility of hybridization events, more attention is being given to the use of phylogenetic networks that are not necessarily trees. This paper describes the reconstruction of certain such networks from the tree-average distances between the leaves. For a certain class of phylogenetic networks, a polynomial-time method is presented to reconstruct the network from the tree-average distances. The method is proved to work if there is a single reticulation cycle.

Dynamics in small worlds of tree topologies of wireless sensor networks

DEFF Research Database (Denmark)

Li, Qiao; Zhang, Baihai; Fan, Zhun

2012-01-01

Tree topologies, which construct spatial graphs with large characteristic path lengths and small clustering coefficients, are ubiquitous in deployments of wireless sensor networks. Small worlds are investigated in tree-based networks. Due to link additions, characteristic path lengths reduce...... rapidly and clustering coefficients increase greatly. A tree abstract, Cayley tree, is considered for the study of the navigation algorithm, which runs automatically in the small worlds of tree-based networks. In the further study, epidemics in the small worlds of tree-based wireless sensor networks...

Global tree network for computing structures enabling global processing operations

Science.gov (United States)

Blumrich; Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

2010-01-19

A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

OpenAIRE

Chih-Yu Wen; Ying-Chih Chen

2009-01-01

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

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.

Fluid Flow in a Porous Tree-Shaped Network

OpenAIRE

Miguel, A. F.

2014-01-01

Tree-shaped flow networks connect one point to an infinity of points and are everywhere in Nature. These networks often own minimal flow resistance and vessel sizes obey to scaling power-laws. In this paper presents a model for fluid flow through a tree-shaped network with porous tubes. Hagen–Poiseuille flow is assumed for tubes and Darcy flow for the porous wall.

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.

Dynamic hierarchical sleep scheduling for wireless ad-hoc sensor networks.

Science.gov (United States)

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

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.

Hierarchically porous MgCo2O4 nanochain networks: template-free synthesis and catalytic application

Science.gov (United States)

Guan, Xiangfeng; Yu, Yunlong; Li, Xiaoyan; Chen, Dagui; Luo, Peihui; Zhang, Yu; Guo, Shanxin

2018-01-01

In this work, hierarchically porous MgCo2O4 nanochain networks were successfully synthesized by a novel template-free method realized via a facile solvothermal synthesis followed by a heat treatment. The morphologies of MgCo2O4 precursor could be adjusted from nanosheets to nanobelts and finally to interwoven nanowires, depending on the volume ratio of diethylene glycol to deionized water in the solution. After calcination, the interwoven precursor nanowires were transformed to hierarchical MgCo2O4 nanochain networks with marco-/meso-porosity, which are composed of 10-20 nm nanoparticles connected one by one. Moreover, the relative formation mechanism of the MgCo2O4 nanochain networks was discussed. More importantly, when evaluated as catalytic additive for AP thermal decomposition, the MgCo2O4 nanochain networks show excellent accelerating effect. It is benefited from the unique hierarchically porous network structure and multicomponent effect, which effectively accelerates ammonia oxidation and {{{{ClO}}}4}- species dissociation. This approach opens the way to design other hierarchically porous multicomponent metal oxides.

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.

Categorizing ideas about trees: a tree of trees.

Science.gov (United States)

Fisler, Marie; Lecointre, Guillaume

2013-01-01

The aim of this study is to explore whether matrices and MP trees used to produce systematic categories of organisms could be useful to produce categories of ideas in history of science. We study the history of the use of trees in systematics to represent the diversity of life from 1766 to 1991. We apply to those ideas a method inspired from coding homologous parts of organisms. We discretize conceptual parts of ideas, writings and drawings about trees contained in 41 main writings; we detect shared parts among authors and code them into a 91-characters matrix and use a tree representation to show who shares what with whom. In other words, we propose a hierarchical representation of the shared ideas about trees among authors: this produces a "tree of trees." Then, we categorize schools of tree-representations. Classical schools like "cladists" and "pheneticists" are recovered but others are not: "gradists" are separated into two blocks, one of them being called here "grade theoreticians." We propose new interesting categories like the "buffonian school," the "metaphoricians," and those using "strictly genealogical classifications." We consider that networks are not useful to represent shared ideas at the present step of the study. A cladogram is made for showing who is sharing what with whom, but also heterobathmy and homoplasy of characters. The present cladogram is not modelling processes of transmission of ideas about trees, and here it is mostly used to test for proximity of ideas of the same age and for categorization.

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

Visual question answering using hierarchical dynamic memory networks

Science.gov (United States)

Shang, Jiayu; Li, Shiren; Duan, Zhikui; Huang, Junwei

2018-04-01

Visual Question Answering (VQA) is one of the most popular research fields in machine learning which aims to let the computer learn to answer natural language questions with images. In this paper, we propose a new method called hierarchical dynamic memory networks (HDMN), which takes both question attention and visual attention into consideration impressed by Co-Attention method, which is the best (or among the best) algorithm for now. Additionally, we use bi-directional LSTMs, which have a better capability to remain more information from the question and image, to replace the old unit so that we can capture information from both past and future sentences to be used. Then we rebuild the hierarchical architecture for not only question attention but also visual attention. What's more, we accelerate the algorithm via a new technic called Batch Normalization which helps the network converge more quickly than other algorithms. The experimental result shows that our model improves the state of the art on the large COCO-QA dataset, compared with other methods.

Transitions from Trees to Cycles in Adaptive Flow Networks

Directory of Open Access Journals (Sweden)

Erik A. Martens

2017-11-01

Full Text Available Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply. Theoretical and experimental studies have found that real-world transport networks exhibit both tree-like motifs and cycles. When the network is subject to load fluctuations, the presence of cyclic motifs may help to reduce flow fluctuations and, thus, render supply in the network more robust. While previous studies considered network topology via optimization principles, here, we take a dynamical systems approach and study a simple model of a flow network with dynamically adapting weights (conductances. We assume a spatially non-uniform distribution of rapidly fluctuating loads in the sinks and investigate what network configurations are dynamically stable. The network converges to a spatially non-uniform stable configuration composed of both cyclic and tree-like structures. Cyclic structures emerge locally in a transcritical bifurcation as the amplitude of the load fluctuations is increased. The resulting adaptive dynamics thus partitions the network into two distinct regions with cyclic and tree-like structures. The location of the boundary between these two regions is determined by the amplitude of the fluctuations. These findings may explain why natural transport networks display cyclic structures in the micro-vascular regions near terminal nodes, but tree-like features in the regions with larger veins.

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.

Finding Minimum-Power Broadcast Trees for Wireless Networks

Science.gov (United States)

Arabshahi, Payman; Gray, Andrew; Das, Arindam; El-Sharkawi, Mohamed; Marks, Robert, II

2004-01-01

Some algorithms have been devised for use in a method of constructing tree graphs that represent connections among the nodes of a wireless communication network. These algorithms provide for determining the viability of any given candidate connection tree and for generating an initial set of viable trees that can be used in any of a variety of search algorithms (e.g., a genetic algorithm) to find a tree that enables the network to broadcast from a source node to all other nodes while consuming the minimum amount of total power. The method yields solutions better than those of a prior algorithm known as the broadcast incremental power algorithm, albeit at a slightly greater computational cost.

Energy-efficient hierarchical processing in the network of wireless intelligent sensors (WISE)

Science.gov (United States)

Raskovic, Dejan

Sensor network nodes have benefited from technological advances in the field of wireless communication, processing, and power sources. However, the processing power of microcontrollers is often not sufficient to perform sophisticated processing, while the power requirements of digital signal processing boards or handheld computers are usually too demanding for prolonged system use. We are matching the intrinsic hierarchical nature of many digital signal-processing applications with the natural hierarchy in distributed wireless networks, and building the hierarchical system of wireless intelligent sensors. Our goal is to build a system that will exploit the hierarchical organization to optimize the power consumption and extend battery life for the given time and memory constraints, while providing real-time processing of sensor signals. In addition, we are designing our system to be able to adapt to the current state of the environment, by dynamically changing the algorithm through procedure replacement. This dissertation presents the analysis of hierarchical environment and methods for energy profiling used to evaluate different system design strategies, and to optimize time-effective and energy-efficient processing.

Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees.

Science.gov (United States)

Huson, Daniel H; Linz, Simone

2018-01-01

A minimum hybridization network is a rooted phylogenetic network that displays two given rooted phylogenetic trees using a minimum number of reticulations. Previous mathematical work on their calculation has usually assumed the input trees to be bifurcating, correctly rooted, or that they both contain the same taxa. These assumptions do not hold in biological studies and "realistic" trees have multifurcations, are difficult to root, and rarely contain the same taxa. We present a new algorithm for computing minimum hybridization networks for a given pair of "realistic" rooted phylogenetic trees. We also describe how the algorithm might be used to improve the rooting of the input trees. We introduce the concept of "autumn trees", a nice framework for the formulation of algorithms based on the mathematics of "maximum acyclic agreement forests". While the main computational problem is hard, the run-time depends mainly on how different the given input trees are. In biological studies, where the trees are reasonably similar, our parallel implementation performs well in practice. The algorithm is available in our open source program Dendroscope 3, providing a platform for biologists to explore rooted phylogenetic networks. We demonstrate the utility of the algorithm using several previously studied data sets.

Eigenspaces of networks reveal the overlapping and hierarchical community structure more precisely

International Nuclear Information System (INIS)

Ma, Xiaoke; Gao, Lin; Yong, Xuerong

2010-01-01

Identifying community structure is fundamental for revealing the structure–functionality relationship in complex networks, and spectral algorithms have been shown to be powerful for this purpose. In a traditional spectral algorithm, each vertex of a network is embedded into a spectral space by making use of the eigenvectors of the adjacency matrix or Laplacian matrix of the graph. In this paper, a novel spectral approach for revealing the overlapping and hierarchical community structure of complex networks is proposed by not only using the eigenvalues and eigenvectors but also the properties of eigenspaces of the networks involved. This gives us a better characterization of community. We first show that the communicability between a pair of vertices can be rewritten in term of eigenspaces of a network. An agglomerative clustering algorithm is then presented to discover the hierarchical communities using the communicability matrix. Finally, these overlapping vertices are discovered with the corresponding eigenspaces, based on the fact that the vertices more densely connected amongst one another are more likely to be linked through short cycles. Compared with the traditional spectral algorithms, our algorithm can identify both the overlapping and hierarchical community without increasing the time complexity O(n 3 ), where n is the size of the network. Furthermore, our algorithm can also distinguish the overlapping vertices from bridges. The method is tested by applying it to some computer-generated and real-world networks. The experimental results indicate that our algorithm can reveal community structure more precisely than the traditional spectral approaches

Convergent evidence for hierarchical prediction networks from human electrocorticography and magnetoencephalography.

Science.gov (United States)

Phillips, Holly N; Blenkmann, Alejandro; Hughes, Laura E; Kochen, Silvia; Bekinschtein, Tristan A; Cam-Can; Rowe, James B

2016-09-01

We propose that sensory inputs are processed in terms of optimised predictions and prediction error signals within hierarchical neurocognitive models. The combination of non-invasive brain imaging and generative network models has provided support for hierarchical frontotemporal interactions in oddball tasks, including recent identification of a temporal expectancy signal acting on prefrontal cortex. However, these studies are limited by the need to invert magnetoencephalographic or electroencephalographic sensor signals to localise activity from cortical 'nodes' in the network, or to infer neural responses from indirect measures such as the fMRI BOLD signal. To overcome this limitation, we examined frontotemporal interactions estimated from direct cortical recordings from two human participants with cortical electrode grids (electrocorticography - ECoG). Their frontotemporal network dynamics were compared to those identified by magnetoencephalography (MEG) in forty healthy adults. All participants performed the same auditory oddball task with standard tones interspersed with five deviant tone types. We normalised post-operative electrode locations to standardised anatomic space, to compare across modalities, and inverted the MEG to cortical sources using the estimated lead field from subject-specific head models. A mismatch negativity signal in frontal and temporal cortex was identified in all subjects. Generative models of the electrocorticographic and magnetoencephalographic data were separately compared using the free-energy estimate of the model evidence. Model comparison confirmed the same critical features of hierarchical frontotemporal networks in each patient as in the group-wise MEG analysis. These features included bilateral, feedforward and feedback frontotemporal modulated connectivity, in addition to an asymmetric expectancy driving input on left frontal cortex. The invasive ECoG provides an important step in construct validation of the use of neural

Numerical study of magneto-optical traps through a hierarchical tree method

International Nuclear Information System (INIS)

Oliveira, R.S. de; Raposo, E.P.; Vianna, S.S.

2004-01-01

We approach the problem of N atoms in a magneto-optical trap through a hierarchical tree method, using an algorithm originally developed by Barnes and Hut (BH) in the astrophysical context. Such an algorithm numerically takes care of the particle-particle interaction by controlling the approximation level in a way that offers more physical fidelity than the mean-field treatment and considerably less time consumption (τ∼N log 10 N in the hierarchical BH method, in contrast with the τ∼N 2 and τ∼N 3/2 dependences found in direct and mean-field approaches, respectively). Our results reproduce the experimentally reported single-ring orbital mode for N 6 atoms and also find indication of a double-ring structure for N∼10 7 , a situation mimicked by a N=10 6 system with enhanced radiative force, in agreement with experimental observations. We stress that this high-density regime is not accessed by direct integration of the equations of motion, due to the enormous computing times required, and is not suitably described through mean-field approaches, due to the rather unphysical enhancement of the particle-particle interactions and the presence of a spurious numerical grid dependence

Hierarchical modeling of molecular energies using a deep neural network

Science.gov (United States)

Lubbers, Nicholas; Smith, Justin S.; Barros, Kipton

2018-06-01

We introduce the Hierarchically Interacting Particle Neural Network (HIP-NN) to model molecular properties from datasets of quantum calculations. Inspired by a many-body expansion, HIP-NN decomposes properties, such as energy, as a sum over hierarchical terms. These terms are generated from a neural network—a composition of many nonlinear transformations—acting on a representation of the molecule. HIP-NN achieves the state-of-the-art performance on a dataset of 131k ground state organic molecules and predicts energies with 0.26 kcal/mol mean absolute error. With minimal tuning, our model is also competitive on a dataset of molecular dynamics trajectories. In addition to enabling accurate energy predictions, the hierarchical structure of HIP-NN helps to identify regions of model uncertainty.

P-Adic Analog of Navier–Stokes Equations: Dynamics of Fluid’s Flow in Percolation Networks (from Discrete Dynamics with Hierarchic Interactions to Continuous Universal Scaling Model

Directory of Open Access Journals (Sweden)

Klaudia Oleschko

2017-04-01

Full Text Available Recently p-adic (and, more generally, ultrametric spaces representing tree-like networks of percolation, and as a special case of capillary patterns in porous media, started to be used to model the propagation of fluids (e.g., oil, water, oil-in-water, and water-in-oil emulsion. The aim of this note is to derive p-adic dynamics described by fractional differential operators (Vladimirov operators starting with discrete dynamics based on hierarchically-structured interactions between the fluids’ volumes concentrated at different levels of the percolation tree and coming to the multiscale universal topology of the percolating nets. Similar systems of discrete hierarchic equations were widely applied to modeling of turbulence. However, in the present work this similarity is only formal since, in our model, the trees are real physical patterns with a tree-like topology of capillaries (or fractures in random porous media (not cascade trees, as in the case of turbulence, which we will be discussed elsewhere for the spinner flowmeter commonly used in the petroleum industry. By going to the “continuous limit” (with respect to the p-adic topology we represent the dynamics on the tree-like configuration space as an evolutionary nonlinear p-adic fractional (pseudo- differential equation, the tree-like analog of the Navier–Stokes equation. We hope that our work helps to come closer to a nonlinear equation solution, taking into account the scaling, hierarchies, and formal derivations, imprinted from the similar properties of the real physical world. Once this coupling is resolved, the more problematic question of information scaling in industrial applications will be achieved.

Bayesian Models for Streamflow and River Network Reconstruction using Tree Rings

Science.gov (United States)

Ravindranath, A.; Devineni, N.

2016-12-01

Water systems face non-stationary, dynamically shifting risks due to shifting societal conditions and systematic long-term variations in climate manifesting as quasi-periodic behavior on multi-decadal time scales. Water systems are thus vulnerable to long periods of wet or dry hydroclimatic conditions. Streamflow is a major component of water systems and a primary means by which water is transported to serve ecosystems' and human needs. Thus, our concern is in understanding streamflow variability. Climate variability and impacts on water resources are crucial factors affecting streamflow, and multi-scale variability increases risk to water sustainability and systems. Dam operations are necessary for collecting water brought by streamflow while maintaining downstream ecological health. Rules governing dam operations are based on streamflow records that are woefully short compared to periods of systematic variation present in the climatic factors driving streamflow variability and non-stationarity. We use hierarchical Bayesian regression methods in order to reconstruct paleo-streamflow records for dams within a basin using paleoclimate proxies (e.g. tree rings) to guide the reconstructions. The riverine flow network for the entire basin is subsequently modeled hierarchically using feeder stream and tributary flows. This is a starting point in analyzing streamflow variability and risks to water systems, and developing a scientifically-informed dynamic risk management framework for formulating dam operations and water policies to best hedge such risks. We will apply this work to the Missouri and Delaware River Basins (DRB). Preliminary results of streamflow reconstructions for eight dams in the upper DRB using standard Gaussian regression with regional tree ring chronologies give streamflow records that now span two to two and a half centuries, and modestly smoothed versions of these reconstructed flows indicate physically-justifiable trends in the time series.

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

DEFF Research Database (Denmark)

Ding, Tao; Li, Cheng; Huang, Can

2018-01-01

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

TreePlus: interactive exploration of networks with enhanced tree layouts.

Science.gov (United States)

Lee, Bongshin; Parr, Cynthia S; Plaisant, Catherine; Bederson, Benjamin B; Veksler, Vladislav D; Gray, Wayne D; Kotfila, Christopher

2006-01-01

Despite extensive research, it is still difficult to produce effective interactive layouts for large graphs. Dense layout and occlusion make food webs, ontologies, and social networks difficult to understand and interact with. We propose a new interactive Visual Analytics component called TreePlus that is based on a tree-style layout. TreePlus reveals the missing graph structure with visualization and interaction while maintaining good readability. To support exploration of the local structure of the graph and gathering of information from the extensive reading of labels, we use a guiding metaphor of "Plant a seed and watch it grow." It allows users to start with a node and expand the graph as needed, which complements the classic overview techniques that can be effective at (but often limited to) revealing clusters. We describe our design goals, describe the interface, and report on a controlled user study with 28 participants comparing TreePlus with a traditional graph interface for six tasks. In general, the advantage of TreePlus over the traditional interface increased as the density of the displayed data increased. Participants also reported higher levels of confidence in their answers with TreePlus and most of them preferred TreePlus.

Synchronization of Hierarchical Time-Varying Neural Networks Based on Asynchronous and Intermittent Sampled-Data Control.

Science.gov (United States)

Xiong, Wenjun; Patel, Ragini; Cao, Jinde; Zheng, Wei Xing

In this brief, our purpose is to apply asynchronous and intermittent sampled-data control methods to achieve the synchronization of hierarchical time-varying neural networks. The asynchronous and intermittent sampled-data controllers are proposed for two reasons: 1) the controllers may not transmit the control information simultaneously and 2) the controllers cannot always exist at any time . The synchronization is then discussed for a kind of hierarchical time-varying neural networks based on the asynchronous and intermittent sampled-data controllers. Finally, the simulation results are given to illustrate the usefulness of the developed criteria.In this brief, our purpose is to apply asynchronous and intermittent sampled-data control methods to achieve the synchronization of hierarchical time-varying neural networks. The asynchronous and intermittent sampled-data controllers are proposed for two reasons: 1) the controllers may not transmit the control information simultaneously and 2) the controllers cannot always exist at any time . The synchronization is then discussed for a kind of hierarchical time-varying neural networks based on the asynchronous and intermittent sampled-data controllers. Finally, the simulation results are given to illustrate the usefulness of the developed criteria.

Optimal Hierarchical Modular Topologies for Producing Limited Sustained Activation of Neural Networks

OpenAIRE

Kaiser, Marcus; Hilgetag, Claus C.

2010-01-01

An essential requirement for the representation of functional patterns in complex neural networks, such as the mammalian cerebral cortex, is the existence of stable regimes of network activation, typically arising from a limited parameter range. In this range of limited sustained activity (LSA), the activity of neural populations in the network persists between the extremes of either quickly dying out or activating the whole network. Hierarchical modular networks were previously found to show...

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.

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.

A bioscaffolding strategy for hierarchical zeolites with a nanotube-trimodal network.

Science.gov (United States)

Li, Guannan; Huang, Haibo; Yu, Bowen; Wang, Yun; Tao, Jiawei; Wei, Yingxu; Li, Shougui; Liu, Zhongmin; Xu, Yan; Xu, Ruren

2016-02-01

Hierarchical zeolite monoliths with multimodal porosity are of paramount importance as they open up new horizons for advanced applications. So far, hierarchical zeolites based on nanotube scaffolds have never been reported. Inspired by the organization of biominerals, we have developed a novel precursor scaffolding-solid phase crystallization strategy for hierarchical zeolites with a unique nanotube scaffolding architecture and nanotube-trimodal network, where biomolecular self-assembly (BSA) provides a scaffolding blueprint. By vapor-treating Sil-1 seeded precursor scaffolds, zeolite MFI nanotube scaffolds are self-generated, during which evolution phenomena such as segmented voids and solid bridges are observed, in agreement with the Kirkendall effect in a solid-phase crystallization system. The nanotube walls are made of intergrown single crystals rendering good mechanical stability. The inner diameter of the nanotube is tunable between 30 and 90 nm by varying the thickness of the precursor layers. Macropores enclosed by cross-linked nanotubes can be modulated by the choice of BSA. Narrow mesopores are formed by intergrown nanocrystals. Hierarchical ZSM-5 monoliths with nanotube (90 nm), micropore (0.55 nm), mesopore (2 nm) and macropore (700 nm) exhibit superior catalytic performance in the methanol-to-hydrocarbon (MTH) conversion compared to conventional ZSM-5. BSA remains intact after crystallization, allowing a higher level of organization and functionalization of the zeolite nanotube scaffolds. The current work may afford a versatile strategy for hierarchical zeolite monoliths with nanotube scaffolding architectures and a nanotube-multimodal network leading to self-supporting and active zeolite catalysts, and for applications beyond.

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

Tree-average distances on certain phylogenetic networks have their weights uniquely determined.

Science.gov (United States)

Willson, Stephen J

2012-01-01

A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head. Measurements of DNA are often made on species in the leaf set, and one seeks to infer properties of the network, possibly including the graph itself. In the case of phylogenetic trees, distances between extant species are frequently used to infer the phylogenetic trees by methods such as neighbor-joining. This paper proposes a tree-average distance for networks more general than trees. The notion requires a weight on each arc measuring the genetic change along the arc. For each displayed tree the distance between two leaves is the sum of the weights along the path joining them. At a hybrid vertex, each character is inherited from one of its parents. We will assume that for each hybrid there is a probability that the inheritance of a character is from a specified parent. Assume that the inheritance events at different hybrids are independent. Then for each displayed tree there will be a probability that the inheritance of a given character follows the tree; this probability may be interpreted as the probability of the tree. The tree-average distance between the leaves is defined to be the expected value of their distance in the displayed trees. For a class of rooted networks that includes rooted trees, it is shown that the weights and the probabilities at each hybrid vertex can be calculated given the network and the tree-average distances between the leaves. Hence these weights and probabilities are uniquely determined. The hypotheses on the networks include that hybrid vertices have indegree exactly 2 and that vertices that are not leaves have a tree-child.

An Alternative to Optimize the Indonesian’s Airport Network Design: An Application of Minimum Spanning Tree (MST Technique

Directory of Open Access Journals (Sweden)

Luluk Lusiantoro

2012-09-01

Full Text Available Using minimum spanning tree technique (MST, this exploratory research was done to optimize the interrelation and hierarchical network design of Indonesian’s airports. This research also identifies the position of the Indonesian’s airports regionally based on the ASEAN Open Sky Policy 2015. The secondary data containing distance between airports (both in Indonesia and in ASEAN, flight frequency, and correlation of Gross Domestic Regional Product (GDRP for each region in Indonesia are used as inputs to form MST networks. The result analysis is done by comparing the MST networks with the existing network in Indonesia. This research found that the existing airport network in Indonesia does not depict the optimal network connecting all airports with the shortest distance and maximizing the correlation of regional economic potential in the country. This research then suggests the optimal networks and identifies the airports and regions as hubs and spokes formed by the networks. Lastly, this research indicates that the Indonesian airports have no strategic position in the ASEAN Open Sky network, but they have an opportunity to get strategic positions if 33 airports in 33 regions in Indonesia are included in the network.

Nonbinary Tree-Based Phylogenetic Networks

NARCIS (Netherlands)

Jetten, L.; van Iersel, L.J.J.

2018-01-01

Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can for example

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.

Transitions from Trees to Cycles in Adaptive Flow Networks

DEFF Research Database (Denmark)

Martens, Erik Andreas; Klemm, Konstantin

2017-01-01

. The network converges to a spatially non-uniform stable configuration composed of both cyclic and tree-like structures. Cyclic structures emerge locally in a transcritical bifurcation as the amplitude of the load fluctuations is increased. The resulting adaptive dynamics thus partitions the network into two......Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply. Theoretical and experimental studies have found that real......-world transport networks exhibit both tree-like motifs and cycles. When the network is subject to load fluctuations, the presence of cyclic motifs may help to reduce flow fluctuations and, thus, render supply in the network more robust. While previous studies considered network topology via optimization...

Hierarchical analysis of dependency in metabolic networks.

Science.gov (United States)

Gagneur, Julien; Jackson, David B; Casari, Georg

2003-05-22

Elucidation of metabolic networks for an increasing number of organisms reveals that even small networks can contain thousands of reactions and chemical species. The intimate connectivity between components complicates their decomposition into biologically meaningful sub-networks. Moreover, traditional higher-order representations of metabolic networks as metabolic pathways, suffers from the lack of rigorous definition, yielding pathways of disparate content and size. We introduce a hierarchical representation that emphasizes the gross organization of metabolic networks in largely independent pathways and sub-systems at several levels of independence. The approach highlights the coupling of different pathways and the shared compounds responsible for those couplings. By assessing our results on Escherichia coli (E.coli metabolic reactions, Genetic Circuits Research Group, University of California, San Diego, http://gcrg.ucsd.edu/organisms/ecoli.html, 'model v 1.01. reactions') against accepted biochemical annotations, we provide the first systematic synopsis of an organism's metabolism. Comparison with operons of E.coli shows that low-level clusters are reflected in genome organization and gene regulation. Source code, data sets and supplementary information are available at http://www.mas.ecp.fr/labo/equipe/gagneur/hierarchy/hierarchy.html

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

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

Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.

Science.gov (United States)

Mirzaei, Sajad; Wu, Yufeng

2016-01-01

Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is "displayed" in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.

CAN Tree Routing for Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao LI

2014-01-01

Full Text Available We propose a novel topology to improve the routing performance of Content- Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree by means of equipping each node with a few long links towards some distant nodes. The long links enhance routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is O(log n, which is much better than a uniform greedy routing, while each node maintains two long links in average.

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

Inference of Transmission Network Structure from HIV Phylogenetic Trees.

Science.gov (United States)

Giardina, Federica; Romero-Severson, Ethan Obie; Albert, Jan; Britton, Tom; Leitner, Thomas

2017-01-01

Phylogenetic inference is an attractive means to reconstruct transmission histories and epidemics. However, there is not a perfect correspondence between transmission history and virus phylogeny. Both node height and topological differences may occur, depending on the interaction between within-host evolutionary dynamics and between-host transmission patterns. To investigate these interactions, we added a within-host evolutionary model in epidemiological simulations and examined if the resulting phylogeny could recover different types of contact networks. To further improve realism, we also introduced patient-specific differences in infectivity across disease stages, and on the epidemic level we considered incomplete sampling and the age of the epidemic. Second, we implemented an inference method based on approximate Bayesian computation (ABC) to discriminate among three well-studied network models and jointly estimate both network parameters and key epidemiological quantities such as the infection rate. Our ABC framework used both topological and distance-based tree statistics for comparison between simulated and observed trees. Overall, our simulations showed that a virus time-scaled phylogeny (genealogy) may be substantially different from the between-host transmission tree. This has important implications for the interpretation of what a phylogeny reveals about the underlying epidemic contact network. In particular, we found that while the within-host evolutionary process obscures the transmission tree, the diversification process and infectivity dynamics also add discriminatory power to differentiate between different types of contact networks. We also found that the possibility to differentiate contact networks depends on how far an epidemic has progressed, where distance-based tree statistics have more power early in an epidemic. Finally, we applied our ABC inference on two different outbreaks from the Swedish HIV-1 epidemic.

Exploring hierarchical and overlapping modular structure in the yeast protein interaction network

Directory of Open Access Journals (Sweden)

Zhao Yi

2010-12-01

Full Text Available Abstract Background Developing effective strategies to reveal modular structures in protein interaction networks is crucial for better understanding of molecular mechanisms of underlying biological processes. In this paper, we propose a new density-based algorithm (ADHOC for clustering vertices of a protein interaction network using a novel subgraph density measurement. Results By statistically evaluating several independent criteria, we found that ADHOC could significantly improve the outcome as compared with five previously reported density-dependent methods. We further applied ADHOC to investigate the hierarchical and overlapping modular structure in the yeast PPI network. Our method could effectively detect both protein modules and the overlaps between them, and thus greatly promote the precise prediction of protein functions. Moreover, by further assaying the intermodule layer of the yeast PPI network, we classified hubs into two types, module hubs and inter-module hubs. Each type presents distinct characteristics both in network topology and biological functions, which could conduce to the better understanding of relationship between network architecture and biological implications. Conclusions Our proposed algorithm based on the novel subgraph density measurement makes it possible to more precisely detect hierarchical and overlapping modular structures in protein interaction networks. In addition, our method also shows a strong robustness against the noise in network, which is quite critical for analyzing such a high noise network.

Energy Efficient Hierarchical Clustering Approaches in Wireless Sensor Networks: A Survey

Directory of Open Access Journals (Sweden)

Bilal Jan

2017-01-01

Full Text Available Wireless sensor networks (WSN are one of the significant technologies due to their diverse applications such as health care monitoring, smart phones, military, disaster management, and other surveillance systems. Sensor nodes are usually deployed in large number that work independently in unattended harsh environments. Due to constraint resources, typically the scarce battery power, these wireless nodes are grouped into clusters for energy efficient communication. In clustering hierarchical schemes have achieved great interest for minimizing energy consumption. Hierarchical schemes are generally categorized as cluster-based and grid-based approaches. In cluster-based approaches, nodes are grouped into clusters, where a resourceful sensor node is nominated as a cluster head (CH while in grid-based approach the network is divided into confined virtual grids usually performed by the base station. This paper highlights and discusses the design challenges for cluster-based schemes, the important cluster formation parameters, and classification of hierarchical clustering protocols. Moreover, existing cluster-based and grid-based techniques are evaluated by considering certain parameters to help users in selecting appropriate technique. Furthermore, a detailed summary of these protocols is presented with their advantages, disadvantages, and applicability in particular cases.

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.

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.

Macroscopic Models of Clique Tree Growth for Bayesian Networks

Data.gov (United States)

National Aeronautics and Space Administration — In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to...

Small Worlds in the Tree Topologies of Wireless Sensor Networks

DEFF Research Database (Denmark)

Qiao, Li; Lingguo, Cui; Baihai, Zhang

2010-01-01

In this study, the characteristics of small worlds are investigated in the context of the tree topologies of wireless sensor networks. Tree topologies, which construct spatial graphs with larger characteristic path lengths than random graphs and small clustering coefficients, are ubiquitous...... in wireless sensor networks. Suffering from the link rewiring or the link addition, the characteristic path length of the tree topology reduces rapidly and the clustering coefficient increases greatly. The variety of characteristic path length influences the time synchronization characteristics of wireless...... sensor networks greatly. With the increase of the link rewiring or the link addition probability, the time synchronization error decreases drastically. Two novel protocols named LEACH-SW and TREEPSI-SW are proposed to improve the performances of the sensor networks, in which the small world...

Accurate detection of hierarchical communities in complex networks based on nonlinear dynamical evolution

Science.gov (United States)

Zhuo, Zhao; Cai, Shi-Min; Tang, Ming; Lai, Ying-Cheng

2018-04-01

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would "come out" or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a "game-change" type of approach to addressing the problem of community

A new algorithm to construct phylogenetic networks from trees.

Science.gov (United States)

Wang, J

2014-03-06

Developing appropriate methods for constructing phylogenetic networks from tree sets is an important problem, and much research is currently being undertaken in this area. BIMLR is an algorithm that constructs phylogenetic networks from tree sets. The algorithm can construct a much simpler network than other available methods. Here, we introduce an improved version of the BIMLR algorithm, QuickCass. QuickCass changes the selection strategy of the labels of leaves below the reticulate nodes, i.e., the nodes with an indegree of at least 2 in BIMLR. We show that QuickCass can construct simpler phylogenetic networks than BIMLR. Furthermore, we show that QuickCass is a polynomial-time algorithm when the output network that is constructed by QuickCass is binary.

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.

Model-Based Design of Tree WSNs for Decentralized Detection

Directory of Open Access Journals (Sweden)

Ashraf Tantawy

2015-08-01

Full Text Available The classical decentralized detection problem of finding the optimal decision rules at the sensor and fusion center, as well as variants that introduce physical channel impairments have been studied extensively in the literature. The deployment of WSNs in decentralized detection applications brings new challenges to the field. Protocols for different communication layers have to be co-designed to optimize the detection performance. In this paper, we consider the communication network design problem for a tree WSN. We pursue a system-level approach where a complete model for the system is developed that captures the interactions between different layers, as well as different sensor quality measures. For network optimization, we propose a hierarchical optimization algorithm that lends itself to the tree structure, requiring only local network information. The proposed design approach shows superior performance over several contentionless and contention-based network design approaches.

Transport on river networks: A dynamical approach

OpenAIRE

Zaliapin, I; Foufoula-Georgiou, E; Ghil, M

2017-01-01

This study is motivated by problems related to environmental transport on river networks. We establish statistical properties of a flow along a directed branching network and suggest its compact parameterization. The downstream network transport is treated as a particular case of nearest-neighbor hierarchical aggregation with respect to the metric induced by the branching structure of the river network. We describe the static geometric structure of a drainage network by a tree, referred to as...

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.

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

Do Branch Lengths Help to Locate a Tree in a Phylogenetic Network?

Science.gov (United States)

Gambette, Philippe; van Iersel, Leo; Kelk, Steven; Pardi, Fabio; Scornavacca, Celine

2016-09-01

Phylogenetic networks are increasingly used in evolutionary biology to represent the history of species that have undergone reticulate events such as horizontal gene transfer, hybrid speciation and recombination. One of the most fundamental questions that arise in this context is whether the evolution of a gene with one copy in all species can be explained by a given network. In mathematical terms, this is often translated in the following way: is a given phylogenetic tree contained in a given phylogenetic network? Recently this tree containment problem has been widely investigated from a computational perspective, but most studies have only focused on the topology of the phylogenies, ignoring a piece of information that, in the case of phylogenetic trees, is routinely inferred by evolutionary analyses: branch lengths. These measure the amount of change (e.g., nucleotide substitutions) that has occurred along each branch of the phylogeny. Here, we study a number of versions of the tree containment problem that explicitly account for branch lengths. We show that, although length information has the potential to locate more precisely a tree within a network, the problem is computationally hard in its most general form. On a positive note, for a number of special cases of biological relevance, we provide algorithms that solve this problem efficiently. This includes the case of networks of limited complexity, for which it is possible to recover, among the trees contained by the network with the same topology as the input tree, the closest one in terms of branch lengths.

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

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

Vulnerability Analysis of Urban Drainage Systems: Tree vs. Loop Networks

Directory of Open Access Journals (Sweden)

Chi Zhang

2017-03-01

Full Text Available Vulnerability analysis of urban drainage networks plays an important role in urban flood management. This study analyzes and compares the vulnerability of tree and loop systems under various rainfall events to structural failure represented by pipe blockage. Different pipe blockage scenarios, in which one of the pipes in an urban drainage network is assumed to be blocked individually, are constructed and their impacts on the network are simulated under different storm events. Furthermore, a vulnerability index is defined to measure the vulnerability of the drainage systems before and after the implementation of adaptation measures. The results obtained indicate that the tree systems have a relatively larger proportion of critical hydraulic pipes than the loop systems, thus the vulnerability of tree systems is substantially greater than that of the loop systems. Furthermore, the vulnerability index of tree systems is reduced after they are converted into a loop system with the implementation of adaptation measures. This paper provides an insight into the differences in the vulnerability of tree and loop systems, and provides more evidence for development of adaptation measures (e.g., tanks to reduce urban flooding.

Multi-subject hierarchical inverse covariance modelling improves estimation of functional brain networks.

Science.gov (United States)

Colclough, Giles L; Woolrich, Mark W; Harrison, Samuel J; Rojas López, Pedro A; Valdes-Sosa, Pedro A; Smith, Stephen M

2018-05-07

A Bayesian model for sparse, hierarchical inverse covariance estimation is presented, and applied to multi-subject functional connectivity estimation in the human brain. It enables simultaneous inference of the strength of connectivity between brain regions at both subject and population level, and is applicable to fmri, meg and eeg data. Two versions of the model can encourage sparse connectivity, either using continuous priors to suppress irrelevant connections, or using an explicit description of the network structure to estimate the connection probability between each pair of regions. A large evaluation of this model, and thirteen methods that represent the state of the art of inverse covariance modelling, is conducted using both simulated and resting-state functional imaging datasets. Our novel Bayesian approach has similar performance to the best extant alternative, Ng et al.'s Sparse Group Gaussian Graphical Model algorithm, which also is based on a hierarchical structure. Using data from the Human Connectome Project, we show that these hierarchical models are able to reduce the measurement error in meg beta-band functional networks by 10%, producing concomitant increases in estimates of the genetic influence on functional connectivity. Copyright © 2018. Published by Elsevier Inc.

BIMLR: a method for constructing rooted phylogenetic networks from rooted phylogenetic trees.

Science.gov (United States)

Wang, Juan; Guo, Maozu; Xing, Linlin; Che, Kai; Liu, Xiaoyan; Wang, Chunyu

2013-09-15

Rooted phylogenetic trees constructed from different datasets (e.g. from different genes) are often conflicting with one another, i.e. they cannot be integrated into a single phylogenetic tree. Phylogenetic networks have become an important tool in molecular evolution, and rooted phylogenetic networks are able to represent conflicting rooted phylogenetic trees. Hence, the development of appropriate methods to compute rooted phylogenetic networks from rooted phylogenetic trees has attracted considerable research interest of late. The CASS algorithm proposed by van Iersel et al. is able to construct much simpler networks than other available methods, but it is extremely slow, and the networks it constructs are dependent on the order of the input data. Here, we introduce an improved CASS algorithm, BIMLR. We show that BIMLR is faster than CASS and less dependent on the input data order. Moreover, BIMLR is able to construct much simpler networks than almost all other methods. BIMLR is available at http://nclab.hit.edu.cn/wangjuan/BIMLR/. © 2013 Elsevier B.V. All rights reserved.

ESPRIT-Tree: hierarchical clustering analysis of millions of 16S rRNA pyrosequences in quasilinear computational time.

Science.gov (United States)

Cai, Yunpeng; Sun, Yijun

2011-08-01

Taxonomy-independent analysis plays an essential role in microbial community analysis. Hierarchical clustering is one of the most widely employed approaches to finding operational taxonomic units, the basis for many downstream analyses. Most existing algorithms have quadratic space and computational complexities, and thus can be used only for small or medium-scale problems. We propose a new online learning-based algorithm that simultaneously addresses the space and computational issues of prior work. The basic idea is to partition a sequence space into a set of subspaces using a partition tree constructed using a pseudometric, then recursively refine a clustering structure in these subspaces. The technique relies on new methods for fast closest-pair searching and efficient dynamic insertion and deletion of tree nodes. To avoid exhaustive computation of pairwise distances between clusters, we represent each cluster of sequences as a probabilistic sequence, and define a set of operations to align these probabilistic sequences and compute genetic distances between them. We present analyses of space and computational complexity, and demonstrate the effectiveness of our new algorithm using a human gut microbiota data set with over one million sequences. The new algorithm exhibits a quasilinear time and space complexity comparable to greedy heuristic clustering algorithms, while achieving a similar accuracy to the standard hierarchical clustering algorithm.

Growth and containment of a hierarchical criminal network

Science.gov (United States)

Marshak, Charles Z.; Rombach, M. Puck; Bertozzi, Andrea L.; D'Orsogna, Maria R.

2016-02-01

We model the hierarchical evolution of an organized criminal network via antagonistic recruitment and pursuit processes. Within the recruitment phase, a criminal kingpin enlists new members into the network, who in turn seek out other affiliates. New recruits are linked to established criminals according to a probability distribution that depends on the current network structure. At the same time, law enforcement agents attempt to dismantle the growing organization using pursuit strategies that initiate on the lower level nodes and that unfold as self-avoiding random walks. The global details of the organization are unknown to law enforcement, who must explore the hierarchy node by node. We halt the pursuit when certain local criteria of the network are uncovered, encoding if and when an arrest is made; the criminal network is assumed to be eradicated if the kingpin is arrested. We first analyze recruitment and study the large scale properties of the growing network; later we add pursuit and use numerical simulations to study the eradication probability in the case of three pursuit strategies, the time to first eradication, and related costs. Within the context of this model, we find that eradication becomes increasingly costly as the network increases in size and that the optimal way of arresting the kingpin is to intervene at the early stages of network formation. We discuss our results in the context of dark network disruption and their implications on possible law enforcement strategies.

Hierarchical ordering with partial pairwise hierarchical relationships on the macaque brain data sets.

Directory of Open Access Journals (Sweden)

Woosang Lim

Full Text Available Hierarchical organizations of information processing in the brain networks have been known to exist and widely studied. To find proper hierarchical structures in the macaque brain, the traditional methods need the entire pairwise hierarchical relationships between cortical areas. In this paper, we present a new method that discovers hierarchical structures of macaque brain networks by using partial information of pairwise hierarchical relationships. Our method uses a graph-based manifold learning to exploit inherent relationship, and computes pseudo distances of hierarchical levels for every pair of cortical areas. Then, we compute hierarchy levels of all cortical areas by minimizing the sum of squared hierarchical distance errors with the hierarchical information of few cortical areas. We evaluate our method on the macaque brain data sets whose true hierarchical levels are known as the FV91 model. The experimental results show that hierarchy levels computed by our method are similar to the FV91 model, and its errors are much smaller than the errors of hierarchical clustering approaches.

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.

Improving cloud network security using tree-rule firewall

NARCIS (Netherlands)

He, Xiangjian; Chomsiri, Thawatchai; Nanda, Priyadarsi; Tan, Zhiyuan

This study proposes a new model of firewall called the ‘Tree-Rule Firewall’, which offers various benefits and is applicable for large networks such as ‘cloud’ networks. The recently available firewalls (i.e., Listed-Rule firewalls) have their limitations in performing the tasks and are inapplicable

Hierarchical-control-based output synchronization of coexisting attractor networks

International Nuclear Information System (INIS)

Yun-Zhong, Song; Yi-Fa, Tang

2010-01-01

This paper introduces the concept of hierarchical-control-based output synchronization of coexisting attractor networks. Within the new framework, each dynamic node is made passive at first utilizing intra-control around its own arena. Then each dynamic node is viewed as one agent, and on account of that, the solution of output synchronization of coexisting attractor networks is transformed into a multi-agent consensus problem, which is made possible by virtue of local interaction between individual neighbours; this distributed working way of coordination is coined as inter-control, which is only specified by the topological structure of the network. Provided that the network is connected and balanced, the output synchronization would come true naturally via synergy between intra and inter-control actions, where the Tightness is proved theoretically via convex composite Lyapunov functions. For completeness, several illustrative examples are presented to further elucidate the novelty and efficacy of the proposed scheme. (general)

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.

LSTM-Based Hierarchical Denoising Network for Android Malware Detection

OpenAIRE

Yan, Jinpei; Qi, Yong; Rao, Qifan

2018-01-01

Mobile security is an important issue on Android platform. Most malware detection methods based on machine learning models heavily rely on expert knowledge for manual feature engineering, which are still difficult to fully describe malwares. In this paper, we present LSTM-based hierarchical denoise network (HDN), a novel static Android malware detection method which uses LSTM to directly learn from the raw opcode sequences extracted from decompiled Android files. However, most opcode sequence...

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

Computing all hybridization networks for multiple binary phylogenetic input trees.

Science.gov (United States)

Albrecht, Benjamin

2015-07-30

The computation of phylogenetic trees on the same set of species that are based on different orthologous genes can lead to incongruent trees. One possible explanation for this behavior are interspecific hybridization events recombining genes of different species. An important approach to analyze such events is the computation of hybridization networks. This work presents the first algorithm computing the hybridization number as well as a set of representative hybridization networks for multiple binary phylogenetic input trees on the same set of taxa. To improve its practical runtime, we show how this algorithm can be parallelized. Moreover, we demonstrate the efficiency of the software Hybroscale, containing an implementation of our algorithm, by comparing it to PIRNv2.0, which is so far the best available software computing the exact hybridization number for multiple binary phylogenetic trees on the same set of taxa. The algorithm is part of the software Hybroscale, which was developed specifically for the investigation of hybridization networks including their computation and visualization. Hybroscale is freely available(1) and runs on all three major operating systems. Our simulation study indicates that our approach is on average 100 times faster than PIRNv2.0. Moreover, we show how Hybroscale improves the interpretation of the reported hybridization networks by adding certain features to its graphical representation.

Statistical dynamics of ultradiffusion in hierarchical systems

International Nuclear Information System (INIS)

Gardner, S.

1987-01-01

In many types of disordered systems which exhibit frustration and competition, an ultrametric topology is found to exist in the space of allowable states. This ultrametric topology of states is associated with a hierarchical relaxation process called ultradiffusion. Ultradiffusion occurs in hierarchical non-linear (HNL) dynamical systems when constraints cause large scale, slow modes of motion to be subordinated to small scale, fast modes. Examples of ultradiffusion are found throughout condensed matter physics and critical phenomena (e.g. the states of spin glasses), in biophysics (e.g. the states of Hopfield networks) and in many other fields including layered computing based upon nonlinear dynamics. The statistical dynamics of ultradiffusion can be treated as a random walk on an ultrametric space. For reversible bifurcating ultrametric spaces the evolution equation governing the probability of a particle being found at site i at time t has a highly degenerate transition matrix. This transition matrix has a fractal geometry similar to the replica form proposed for spin glasses. The authors invert this fractal matrix using a recursive quad-tree (QT) method. Possible applications of hierarchical systems to communications and symbolic computing are discussed briefly

Correlation between hierarchical structure of crystal networks and macroscopic performance of mesoscopic soft materials and engineering principles.

Science.gov (United States)

Lin, Naibo; Liu, Xiang Yang

2015-11-07

This review examines how the concepts and ideas of crystallization can be extended further and applied to the field of mesoscopic soft materials. It concerns the structural characteristics vs. the macroscopic performance, and the formation mechanism of crystal networks. Although this subject can be discussed in a broad sense across the area of mesoscopic soft materials, our main focus is on supramolecular materials, spider and silkworm silks, and biominerals. First, the occurrence of a hierarchical structure, i.e. crystal network and domain network structures, will facilitate the formation kinetics of mesoscopic phases and boost up the macroscopic performance of materials in some cases (i.e. spider silk fibres). Second, the structure and performance of materials can be correlated in some way by the four factors: topology, correlation length, symmetry/ordering, and strength of association of crystal networks. Moreover, four different kinetic paths of crystal network formation are identified, namely, one-step process of assembly, two-step process of assembly, mixed mode of assembly and foreign molecule mediated assembly. Based on the basic mechanisms of crystal nucleation and growth, the formation of crystal networks, such as crystallographic mismatch (or noncrystallographic) branching (tip branching and fibre side branching) and fibre/polymeric side merging, are reviewed. This facilitates the rational design and construction of crystal networks in supramolecular materials. In this context, the (re-)construction of a hierarchical crystal network structure can be implemented by thermal, precipitate, chemical, and sonication stimuli. As another important class of soft materials, the unusual mechanical performance of spider and silkworm silk fibres are reviewed in comparison with the regenerated silk protein derivatives. It follows that the considerably larger breaking stress and unusual breaking strain of spider silk fibres vs. silkworm silk fibres can be interpreted

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.

Estimating tree bole volume using artificial neural network models for four species in Turkey.

Science.gov (United States)

Ozçelik, Ramazan; Diamantopoulou, Maria J; Brooks, John R; Wiant, Harry V

2010-01-01

Tree bole volumes of 89 Scots pine (Pinus sylvestris L.), 96 Brutian pine (Pinus brutia Ten.), 107 Cilicica fir (Abies cilicica Carr.) and 67 Cedar of Lebanon (Cedrus libani A. Rich.) trees were estimated using Artificial Neural Network (ANN) models. Neural networks offer a number of advantages including the ability to implicitly detect complex nonlinear relationships between input and output variables, which is very helpful in tree volume modeling. Two different neural network architectures were used and produced the Back propagation (BPANN) and the Cascade Correlation (CCANN) Artificial Neural Network models. In addition, tree bole volume estimates were compared to other established tree bole volume estimation techniques including the centroid method, taper equations, and existing standard volume tables. An overview of the features of ANNs and traditional methods is presented and the advantages and limitations of each one of them are discussed. For validation purposes, actual volumes were determined by aggregating the volumes of measured short sections (average 1 meter) of the tree bole using Smalian's formula. The results reported in this research suggest that the selected cascade correlation artificial neural network (CCANN) models are reliable for estimating the tree bole volume of the four examined tree species since they gave unbiased results and were superior to almost all methods in terms of error (%) expressed as the mean of the percentage errors. 2009 Elsevier Ltd. All rights reserved.

Toward combining thematic information with hierarchical multiscale segmentations using tree Markov random field model

Science.gov (United States)

Zhang, Xueliang; Xiao, Pengfeng; Feng, Xuezhi

2017-09-01

It has been a common idea to produce multiscale segmentations to represent the various geographic objects in high-spatial resolution remote sensing (HR) images. However, it remains a great challenge to automatically select the proper segmentation scale(s) just according to the image information. In this study, we propose a novel way of information fusion at object level by combining hierarchical multiscale segmentations with existed thematic information produced by classification or recognition. The tree Markov random field (T-MRF) model is designed for the multiscale combination framework, through which the object type is determined as close as the existed thematic information. At the same time, the object boundary is jointly determined by the thematic labels and the multiscale segments through the minimization of the energy function. The benefits of the proposed T-MRF combination model include: (1) reducing the dependence of segmentation scale selection when utilizing multiscale segmentations; (2) exploring the hierarchical context naturally imbedded in the multiscale segmentations. The HR images in both urban and rural areas are used in the experiments to show the effectiveness of the proposed combination framework on these two aspects.

An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Rosana Lachowski

2015-01-01

Full Text Available Monitoring and data collection are the two main functions in wireless sensor networks (WSNs. Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.

A multicast tree aggregation algorithm in wavelength-routed WDM networks

Science.gov (United States)

Cheng, Hsu-Chen; Kuo, Chin-Chun; Lin, Frank Y.

2005-02-01

Wavelength division multiplexing (WDM) has been considered a promising transmission technology in optical communication networks. With the continuous advance in optical technology, WDM network will play an important role in wide area backbone networks. Optical wavelength switching, compared with optical packet switching, is a more mature and more cost-effective choice for optical switching technologies. Besides, the technology of time division multiplexing in optical communication networks has been working smoothly for a long time. In the proposed research, the problem of multicast groups aggregation and multicast routing and wavelength assignment in wavelength-routed WDM network is studied. The optical cross connect switches in the problem are assumed to have limited optical multicast/splitting and TDM functionalities. Given the physical network topology and capacity, the objective is to maximize the total revenue by means of utmost merging multicast groups into larger macro-groups. The groups in the same macro-group will share a multicast tree to conduct data transmission. The problem is formulated as an optimization problem, where the objective function is to maximize the total revenue subject to capacity constraints of components in the optical network, wavelength continuity constraints, and tree topology constraints. The decision variables in the formulations include the merging results between groups, multicast tree routing assignment and wavelength assignment. The basic approach to the algorithm development for this model is Lagrangean relaxation in conjunction with a number of optimization techniques. In computational experiments, the proposed algorithms are evaluated on different network topologies and perform efficiently and effectively according to the experiment results.

HD-MTL: Hierarchical Deep Multi-Task Learning for Large-Scale Visual Recognition.

Science.gov (United States)

Fan, Jianping; Zhao, Tianyi; Kuang, Zhenzhong; Zheng, Yu; Zhang, Ji; Yu, Jun; Peng, Jinye

2017-02-09

In this paper, a hierarchical deep multi-task learning (HD-MTL) algorithm is developed to support large-scale visual recognition (e.g., recognizing thousands or even tens of thousands of atomic object classes automatically). First, multiple sets of multi-level deep features are extracted from different layers of deep convolutional neural networks (deep CNNs), and they are used to achieve more effective accomplishment of the coarseto- fine tasks for hierarchical visual recognition. A visual tree is then learned by assigning the visually-similar atomic object classes with similar learning complexities into the same group, which can provide a good environment for determining the interrelated learning tasks automatically. By leveraging the inter-task relatedness (inter-class similarities) to learn more discriminative group-specific deep representations, our deep multi-task learning algorithm can train more discriminative node classifiers for distinguishing the visually-similar atomic object classes effectively. Our hierarchical deep multi-task learning (HD-MTL) algorithm can integrate two discriminative regularization terms to control the inter-level error propagation effectively, and it can provide an end-to-end approach for jointly learning more representative deep CNNs (for image representation) and more discriminative tree classifier (for large-scale visual recognition) and updating them simultaneously. Our incremental deep learning algorithms can effectively adapt both the deep CNNs and the tree classifier to the new training images and the new object classes. Our experimental results have demonstrated that our HD-MTL algorithm can achieve very competitive results on improving the accuracy rates for large-scale visual recognition.

Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution.

Science.gov (United States)

Francis, Andrew; Moulton, Vincent

2018-06-07

Phylogenetic networks are an extension of phylogenetic trees which are used to represent evolutionary histories in which reticulation events (such as recombination and hybridization) have occurred. A central question for such networks is that of identifiability, which essentially asks under what circumstances can we reliably identify the phylogenetic network that gave rise to the observed data? Recently, identifiability results have appeared for networks relative to a model of sequence evolution that generalizes the standard Markov models used for phylogenetic trees. However, these results are quite limited in terms of the complexity of the networks that are considered. In this paper, by introducing an alternative probabilistic model for evolution along a network that is based on some ground-breaking work by Thatte for pedigrees, we are able to obtain an identifiability result for a much larger class of phylogenetic networks (essentially the class of so-called tree-child networks). To prove our main theorem, we derive some new results for identifying tree-child networks combinatorially, and then adapt some techniques developed by Thatte for pedigrees to show that our combinatorial results imply identifiability in the probabilistic setting. We hope that the introduction of our new model for networks could lead to new approaches to reliably construct phylogenetic networks. Copyright © 2018 Elsevier Ltd. All rights reserved.

An Efficient, Hierarchical Viewpoint Planning Strategy for Terrestrial Laser Scanner Networks

Science.gov (United States)

Jia, F.; Lichti, D. D.

2018-05-01

Terrestrial laser scanner (TLS) techniques have been widely adopted in a variety of applications. However, unlike in geodesy or photogrammetry, insufficient attention has been paid to the optimal TLS network design. It is valuable to develop a complete design system that can automatically provide an optimal plan, especially for high-accuracy, large-volume scanning networks. To achieve this goal, one should look at the "optimality" of the solution as well as the computational complexity in reaching it. In this paper, a hierarchical TLS viewpoint planning strategy is developed to solve the optimal scanner placement problems. If one targeted object to be scanned is simplified as discretized wall segments, any possible viewpoint can be evaluated by a score table representing its visible segments under certain scanning geometry constraints. Thus, the design goal is to find a minimum number of viewpoints that achieves complete coverage of all wall segments. The efficiency is improved by densifying viewpoints hierarchically, instead of a "brute force" search within the entire workspace. The experiment environments in this paper were simulated from two buildings located on University of Calgary campus. Compared with the "brute force" strategy in terms of the quality of the solutions and the runtime, it is shown that the proposed strategy can provide a scanning network with a compatible quality but with more than a 70 % time saving.

Discovering hierarchical structure in normal relational data

DEFF Research Database (Denmark)

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

2014-01-01

-parametric generative model for hierarchical clustering of similarity based on multifurcating Gibbs fragmentation trees. This allows us to infer and display the posterior distribution of hierarchical structures that comply with the data. We demonstrate the utility of our method on synthetic data and data of functional...

Hierarchical ZnO microspheres built by sheet-like network: Large-scale synthesis and structurally enhanced catalytic performances

International Nuclear Information System (INIS)

Zhu Guoxing; Liu Yuanjun; Ji Zhenyuan; Bai Song; Shen Xiaoping; Xu Zheng

2012-01-01

Highlights: ► Hierarchical ZnO microspheres were prepared through a facile precursor procedure in the absence of self-assembled templates, organic additives, or matrices. ► The building blocks of microspheres, sheet-like ZnO networks, are porous mesocrystal terminated with (0 1 −1 0) crystal planes. ► The hierarchical ZnO microsphere catalyst exhibits structure-induced enhancement of catalytic performance and a strong durability. - Abstract: Large-scale novel hierarchical ZnO microspheres were fabricated by a facile precursor procedure in the absence of self-assembled templates, organic additives, or matrices. A field emission scanning electron microscopy (FESEM) image reveals that the ZnO microspheres with diameter of 5–18 μm are built by sheet-like ZnO networks with average thickness of 40 nm and length of several microns. High resolution transmission electron microscopy (HRTEM) image indicates that the building blocks, sheet-like ZnO networks, are porous mesocrystal terminated with {0 1 −1 0} crystal planes. A potential application of the ZnO microspheres as a catalyst in the synthesis of 5-substituted 1H-tetrazoles was investigated. It was found that the hierarchical ZnO microsphere catalyst exhibits structure-induced enhancement of catalytic performance and a strong durability.

From Fractal Trees to Deltaic Networks

Science.gov (United States)

Cazanacli, D.; Wolinsky, M. A.; Sylvester, Z.; Cantelli, A.; Paola, C.

2013-12-01

Geometric networks that capture many aspects of natural deltas can be constructed from simple concepts from graph theory and normal probability distributions. Fractal trees with symmetrical geometries are the result of replicating two simple geometric elements, line segments whose lengths decrease and bifurcation angles that are commonly held constant. Branches could also have a thickness, which in the case of natural distributary systems is the equivalent of channel width. In river- or wave-dominated natural deltas, the channel width is a function of discharge. When normal variations around the mean values for length, bifurcating angles, and discharge are applied, along with either pruning of 'clashing' branches or merging (equivalent to channel confluence), fractal trees start resembling natural deltaic networks, except that the resulting channels are unnaturally straight. Introducing a bifurcation probability fewer, naturally curved channels are obtained. If there is no bifurcation, the direction of each new segment depends on the direction the previous segment upstream (correlated random walk) and, to a lesser extent, on a general direction of growth (directional bias). When bifurcation occurs, the resulting two directions also depend on the bifurcation angle and the discharge split proportions, with the dominant branch following the direction of the upstream parent channel closely. The bifurcation probability controls the channel density and, in conjunction with the variability of the directional angles, the overall curvature of the channels. The growth of the network in effect is associated with net delta progradation. The overall shape and shape evolution of the delta depend mainly on the bifurcation angle average size and angle variability coupled with the degree of dominant direction dependency (bias). The proposed algorithm demonstrates how, based on only a few simple rules, a wide variety of channel networks resembling natural deltas, can be replicated

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

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.

An exclusion process on a tree with constant aggregate hopping rate

International Nuclear Information System (INIS)

Mottishaw, Peter; Waclaw, Bartlomiej; Evans, Martin R

2013-01-01

We introduce a model of a totally asymmetric simple exclusion process (TASEP) on a tree network where the aggregate hopping rate is constant from level to level. With this choice for hopping rates the model shows the same phase diagram as the one-dimensional case. The potential applications of our model are in the area of distribution networks, where a single large source supplies material to a large number of small sinks via a hierarchical network. We show that mean-field theory (MFT) for our model is identical to that of the one-dimensional TASEP and that this MFT is exact for the TASEP on a tree in the limit of large branching ratio, b (or equivalently large coordination number). We then present an exact solution for the two level tree (or star network) that allows the computation of any correlation function and confirm how mean-field results are recovered as b → ∞. As an example we compute the steady-state current as a function of branching ratio. We present simulation results that confirm these results and indicate that the convergence to MFT with large branching ratio is quite rapid. (paper)

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

. This approach avoids unnecessary and frequent handoff between cells and reduces signaling overheads. An approximation model with guaranteed accuracy and low computational complexity is presented for the loss performance of multiservice traffic. The accuracy of numerical results is validated by comparing......A hierarchical overlay structure is an alternative solution that integrates existing and future heterogeneous wireless networks to provide subscribers with better mobile broadband services. Traffic loss performance in such integrated heterogeneous networks is necessary for an operator's network...

Using minimal spanning trees to compare the reliability of network topologies

Science.gov (United States)

Leister, Karen J.; White, Allan L.; Hayhurst, Kelly J.

1990-01-01

Graph theoretic methods are applied to compute the reliability for several types of networks of moderate size. The graph theory methods used are minimal spanning trees for networks with bi-directional links and the related concept of strongly connected directed graphs for networks with uni-directional links. A comparison is conducted of ring networks and braided networks. The case is covered where just the links fail and the case where both links and nodes fail. Two different failure modes for the links are considered. For one failure mode, the link no longer carries messages. For the other failure mode, the link delivers incorrect messages. There is a description and comparison of link-redundancy versus path-redundancy as methods to achieve reliability. All the computations are carried out by means of a fault tree program.

Virtual private network design: a proof of the tree routing conjecture on ring networks

NARCIS (Netherlands)

C.A.J. Hurkens (Cor); J.C.M. Keijsper; L. Stougie (Leen)

2005-01-01

htmlabstractA basic question in Virtual Private Network (VPN) design is if the symmetric version of the problem always has an optimal solution which is a tree network. An affirmative answer would imply that the symmetric VPN problem is solvable in polynomial time. We give an affirmative answer in

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.

Alternative Path Communication in Wide-Scale Cluster-Tree Wireless Sensor Networks Using Inactive Periods.

Science.gov (United States)

Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

2017-05-06

The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable technology to deploy wide-scale Wireless Sensor Networks (WSNs). These networks are usually designed to support convergecast traffic, where all communication paths go through the PAN (Personal Area Network) coordinator. Nevertheless, peer-to-peer communication relationships may be also required for different types of WSN applications. That is the typical case of sensor and actuator networks, where local control loops must be closed using a reduced number of communication hops. The use of communication schemes optimised just for the support of convergecast traffic may result in higher network congestion and in a potentially higher number of communication hops. Within this context, this paper proposes an Alternative-Route Definition (ARounD) communication scheme for WSNs. The underlying idea of ARounD is to setup alternative communication paths between specific source and destination nodes, avoiding congested cluster-tree paths. These alternative paths consider shorter inter-cluster paths, using a set of intermediate nodes to relay messages during their inactive periods in the cluster-tree network. Simulation results show that the ARounD communication scheme can significantly decrease the end-to-end communication delay, when compared to the use of standard cluster-tree communication schemes. Moreover, the ARounD communication scheme is able to reduce the network congestion around the PAN coordinator, enabling the reduction of the number of message drops due to queue overflows in the cluster-tree network.

Recapitulating phylogenies using k-mers: from trees to networks.

Science.gov (United States)

Bernard, Guillaume; Ragan, Mark A; Chan, Cheong Xin

2016-01-01

Ernst Haeckel based his landmark Tree of Life on the supposed ontogenic recapitulation of phylogeny, i.e. that successive embryonic stages during the development of an organism re-trace the morphological forms of its ancestors over the course of evolution. Much of this idea has since been discredited. Today, phylogenies are often based on families of molecular sequences. The standard approach starts with a multiple sequence alignment, in which the sequences are arranged relative to each other in a way that maximises a measure of similarity position-by-position along their entire length. A tree (or sometimes a network) is then inferred. Rigorous multiple sequence alignment is computationally demanding, and evolutionary processes that shape the genomes of many microbes (bacteria, archaea and some morphologically simple eukaryotes) can add further complications. In particular, recombination, genome rearrangement and lateral genetic transfer undermine the assumptions that underlie multiple sequence alignment, and imply that a tree-like structure may be too simplistic. Here, using genome sequences of 143 bacterial and archaeal genomes, we construct a network of phylogenetic relatedness based on the number of shared k -mers (subsequences at fixed length k ). Our findings suggest that the network captures not only key aspects of microbial genome evolution as inferred from a tree, but also features that are not treelike. The method is highly scalable, allowing for investigation of genome evolution across a large number of genomes. Instead of using specific regions or sequences from genome sequences, or indeed Haeckel's idea of ontogeny, we argue that genome phylogenies can be inferred using k -mers from whole-genome sequences. Representing these networks dynamically allows biological questions of interest to be formulated and addressed quickly and in a visually intuitive manner.

Virtual private network design : a proof of the tree routing conjecture on ring networks

NARCIS (Netherlands)

Hurkens, C.A.J.; Keijsper, J.C.M.; Stougie, L.

2007-01-01

A basic question in virtual private network (VPN) design is if the symmetric version of the problem always has an optimal solution which is a tree network. An affirmative answer would imply that the symmetric VPN problem is solvable in polynomial time. We give an affirmative answer in case the

Selective logging in tropical forests decreases the robustness of liana-tree interaction networks to the loss of host tree species.

Science.gov (United States)

Magrach, Ainhoa; Senior, Rebecca A; Rogers, Andrew; Nurdin, Deddy; Benedick, Suzan; Laurance, William F; Santamaria, Luis; Edwards, David P

2016-03-16

Selective logging is one of the major drivers of tropical forest degradation, causing important shifts in species composition. Whether such changes modify interactions between species and the networks in which they are embedded remain fundamental questions to assess the 'health' and ecosystem functionality of logged forests. We focus on interactions between lianas and their tree hosts within primary and selectively logged forests in the biodiversity hotspot of Malaysian Borneo. We found that lianas were more abundant, had higher species richness, and different species compositions in logged than in primary forests. Logged forests showed heavier liana loads disparately affecting slow-growing tree species, which could exacerbate the loss of timber value and carbon storage already associated with logging. Moreover, simulation scenarios of host tree local species loss indicated that logging might decrease the robustness of liana-tree interaction networks if heavily infested trees (i.e. the most connected ones) were more likely to disappear. This effect is partially mitigated in the short term by the colonization of host trees by a greater diversity of liana species within logged forests, yet this might not compensate for the loss of preferred tree hosts in the long term. As a consequence, species interaction networks may show a lagged response to disturbance, which may trigger sudden collapses in species richness and ecosystem function in response to additional disturbances, representing a new type of 'extinction debt'. © 2016 The Author(s).

Selective logging in tropical forests decreases the robustness of liana–tree interaction networks to the loss of host tree species

Science.gov (United States)

Magrach, Ainhoa; Senior, Rebecca A.; Rogers, Andrew; Nurdin, Deddy; Benedick, Suzan; Laurance, William F.; Santamaria, Luis; Edwards, David P.

2016-01-01

Selective logging is one of the major drivers of tropical forest degradation, causing important shifts in species composition. Whether such changes modify interactions between species and the networks in which they are embedded remain fundamental questions to assess the ‘health’ and ecosystem functionality of logged forests. We focus on interactions between lianas and their tree hosts within primary and selectively logged forests in the biodiversity hotspot of Malaysian Borneo. We found that lianas were more abundant, had higher species richness, and different species compositions in logged than in primary forests. Logged forests showed heavier liana loads disparately affecting slow-growing tree species, which could exacerbate the loss of timber value and carbon storage already associated with logging. Moreover, simulation scenarios of host tree local species loss indicated that logging might decrease the robustness of liana–tree interaction networks if heavily infested trees (i.e. the most connected ones) were more likely to disappear. This effect is partially mitigated in the short term by the colonization of host trees by a greater diversity of liana species within logged forests, yet this might not compensate for the loss of preferred tree hosts in the long term. As a consequence, species interaction networks may show a lagged response to disturbance, which may trigger sudden collapses in species richness and ecosystem function in response to additional disturbances, representing a new type of ‘extinction debt’. PMID:26936241

A tree routing protocol for cognitive radio network

Directory of Open Access Journals (Sweden)

Mohammed Hashem

2017-07-01

Full Text Available Cognitive Radio (CR technology is an agile solution for spectrum congestion and spectrum access utilization problems that result from the legacy fixed spectrum management policies. CR technology can exploit unused licensed band to meet the increasing demand for radio frequency. The routing process faces many challenges in CR Network (CRN such as the absence of centralized infrastructure, the coordination between the routing module and spectrum management module, in addition to the frequent link failure due to the sudden appearance of PUs. In this paper we propose a Tree routing protocol for cognitive radio network (C-TRP that jointly utilizes the tree routing algorithm with a spectrum management module in routing decisions, and also we proposed a new metric used in taking the best route decisions. In addition, we enhance the traditional tree routing algorithm by using a neighbor table technique that speeds up the forwarding data packets. Moreover, we add a robust recovery module to C-TRP to resume the network in case of the link failure. The main motivation in the design of C-TRP is quick data transmission and maximization of date rates. The performance evaluation is carried out in NS2 simulator. The simulation results proved that C-TRP protocol achieves better performance in terms of average “PDR”, “end-to-end delay” and “routing overhead ratio “compared to “CTBR” and “STOD-RP” routing protocols.

Forecasting building energy consumption with hybrid genetic algorithm-hierarchical adaptive network-based fuzzy inference system

Energy Technology Data Exchange (ETDEWEB)

Li, Kangji [Institute of Cyber-Systems and Control, Zhejiang University, Hangzhou 310027 (China); School of Electricity Information Engineering, Jiangsu University, Zhenjiang 212013 (China); Su, Hongye [Institute of Cyber-Systems and Control, Zhejiang University, Hangzhou 310027 (China)

2010-11-15

There are several ways to forecast building energy consumption, varying from simple regression to models based on physical principles. In this paper, a new method, namely, the hybrid genetic algorithm-hierarchical adaptive network-based fuzzy inference system (GA-HANFIS) model is developed. In this model, hierarchical structure decreases the rule base dimension. Both clustering and rule base parameters are optimized by GAs and neural networks (NNs). The model is applied to predict a hotel's daily air conditioning consumption for a period over 3 months. The results obtained by the proposed model are presented and compared with regular method of NNs, which indicates that GA-HANFIS model possesses better performance than NNs in terms of their forecasting accuracy. (author)

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

Directory of Open Access Journals (Sweden)

Eva González-Parada

2017-01-01

Full Text Available 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.

Multicasting in Wireless Communications (Ad-Hoc Networks): Comparison against a Tree-Based Approach

Science.gov (United States)

Rizos, G. E.; Vasiliadis, D. C.

2007-12-01

We examine on-demand multicasting in ad hoc networks. The Core Assisted Mesh Protocol (CAMP) is a well-known protocol for multicast routing in ad-hoc networks, generalizing the notion of core-based trees employed for internet multicasting into multicast meshes that have much richer connectivity than trees. On the other hand, wireless tree-based multicast routing protocols use much simpler structures for determining route paths, using only parent-child relationships. In this work, we compare the performance of the CAMP protocol against the performance of wireless tree-based multicast routing protocols, in terms of two important factors, namely packet delay and ratio of dropped packets.

Hierarchical screening for multiple mental disorders.

Science.gov (United States)

Batterham, Philip J; Calear, Alison L; Sunderland, Matthew; Carragher, Natacha; Christensen, Helen; Mackinnon, Andrew J

2013-10-01

There is a need for brief, accurate screening when assessing multiple mental disorders. Two-stage hierarchical screening, consisting of brief pre-screening followed by a battery of disorder-specific scales for those who meet diagnostic criteria, may increase the efficiency of screening without sacrificing precision. This study tested whether more efficient screening could be gained using two-stage hierarchical screening than by administering multiple separate tests. Two Australian adult samples (N=1990) with high rates of psychopathology were recruited using Facebook advertising to examine four methods of hierarchical screening for four mental disorders: major depressive disorder, generalised anxiety disorder, panic disorder and social phobia. Using K6 scores to determine whether full screening was required did not increase screening efficiency. However, pre-screening based on two decision tree approaches or item gating led to considerable reductions in the mean number of items presented per disorder screened, with estimated item reductions of up to 54%. The sensitivity of these hierarchical methods approached 100% relative to the full screening battery. Further testing of the hierarchical screening approach based on clinical criteria and in other samples is warranted. The results demonstrate that a two-phase hierarchical approach to screening multiple mental disorders leads to considerable increases efficiency gains without reducing accuracy. Screening programs should take advantage of prescreeners based on gating items or decision trees to reduce the burden on respondents. © 2013 Elsevier B.V. All rights reserved.

Tree Colors: Color Schemes for Tree-Structured Data.

Science.gov (United States)

Tennekes, Martijn; de Jonge, Edwin

2014-12-01

We present a method to map tree structures to colors from the Hue-Chroma-Luminance color model, which is known for its well balanced perceptual properties. The Tree Colors method can be tuned with several parameters, whose effect on the resulting color schemes is discussed in detail. We provide a free and open source implementation with sensible parameter defaults. Categorical data are very common in statistical graphics, and often these categories form a classification tree. We evaluate applying Tree Colors to tree structured data with a survey on a large group of users from a national statistical institute. Our user study suggests that Tree Colors are useful, not only for improving node-link diagrams, but also for unveiling tree structure in non-hierarchical visualizations.

Epidemic spreading in a hierarchical social network.

Science.gov (United States)

Grabowski, A; Kosiński, R A

2004-09-01

A model of epidemic spreading in a population with a hierarchical structure of interpersonal interactions is described and investigated numerically. The structure of interpersonal connections is based on a scale-free network. Spatial localization of individuals belonging to different social groups, and the mobility of a contemporary community, as well as the effectiveness of different interpersonal interactions, are taken into account. Typical relations characterizing the spreading process, like a range of epidemic and epidemic curves, are discussed. The influence of preventive vaccinations on the spreading process is investigated. The critical value of preventively vaccinated individuals that is sufficient for the suppression of an epidemic is calculated. Our results are compared with solutions of the master equation for the spreading process and good agreement of the character of this process is found.

Self-constructed tree-shape high thermal conductivity nanosilver networks in epoxy.

Science.gov (United States)

Pashayi, Kamyar; Fard, Hafez Raeisi; Lai, Fengyuan; Iruvanti, Sushumna; Plawsky, Joel; Borca-Tasciuc, Theodorian

2014-04-21

We report the formation of high aspect ratio nanoscale tree-shape silver networks in epoxy, at low temperatures (thermal conductivity (κ) of the nanocomposite compared to the polymer matrix. The networks form through a three-step process comprising of self-assembly by diffusion limited aggregation of polyvinylpyrrolidone (PVP) coated nanoparticles, removal of PVP coating from the surface, and sintering of silver nanoparticles in high aspect ratio networked structures. Controlling self-assembly and sintering by carefully designed multistep temperature and time processing leads to κ of our silver nanocomposites that are up to 300% of the present state of the art polymer nanocomposites at similar volume fractions. Our investigation of the κ enhancements enabled by tree-shaped network nanocomposites provides a basis for the development of new polymer nanocomposites for thermal transport and storage applications.

Automated morphological analysis of bone marrow cells in microscopic images for diagnosis of leukemia: nucleus-plasma separation and cell classification using a hierarchical tree model of hematopoesis

Science.gov (United States)

Krappe, Sebastian; Wittenberg, Thomas; Haferlach, Torsten; Münzenmayer, Christian

2016-03-01

The morphological differentiation of bone marrow is fundamental for the diagnosis of leukemia. Currently, the counting and classification of the different types of bone marrow cells is done manually under the use of bright field microscopy. This is a time-consuming, subjective, tedious and error-prone process. Furthermore, repeated examinations of a slide may yield intra- and inter-observer variances. For that reason a computer assisted diagnosis system for bone marrow differentiation is pursued. In this work we focus (a) on a new method for the separation of nucleus and plasma parts and (b) on a knowledge-based hierarchical tree classifier for the differentiation of bone marrow cells in 16 different classes. Classification trees are easily interpretable and understandable and provide a classification together with an explanation. Using classification trees, expert knowledge (i.e. knowledge about similar classes and cell lines in the tree model of hematopoiesis) is integrated in the structure of the tree. The proposed segmentation method is evaluated with more than 10,000 manually segmented cells. For the evaluation of the proposed hierarchical classifier more than 140,000 automatically segmented bone marrow cells are used. Future automated solutions for the morphological analysis of bone marrow smears could potentially apply such an approach for the pre-classification of bone marrow cells and thereby shortening the examination time.

Comparison of a species distribution model and a process model from a hierarchical perspective to quantify effects of projected climate change on tree species

Science.gov (United States)

Jeffrey E. Schneiderman; Hong S. He; Frank R. Thompson; William D. Dijak; Jacob S. Fraser

2015-01-01

Tree species distribution and abundance are affected by forces operating across a hierarchy of ecological scales. Process and species distribution models have been developed emphasizing forces at different scales. Understanding model agreement across hierarchical scales provides perspective on prediction uncertainty and ultimately enables policy makers and managers to...

An Energy Efficient Cooperative Hierarchical MIMO Clustering Scheme for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sungyoung Lee

2011-12-01

Full Text Available 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.

Comparison of the use of binary decision trees and neural networks in top-quark detection

International Nuclear Information System (INIS)

Bowser-Chao, D.; Dzialo, D.L.

1993-01-01

The use of neural networks for signal versus background discrimination in high-energy physics experiments has been investigated and has compared favorably with the efficiency of traditional kinematic cuts. Recent work in top-quark identification produced a neural network that, for a given top-quark mass, yielded a higher signal-to-background ratio in Monte Carlo simulation than a corresponding set of conventional cuts. In this article we discuss another pattern-recognition algorithm, the binary decision tree. We apply a binary decision tree to top-quark identification at the Fermilab Tevatron and find it to be comparable in performance to the neural network. Furthermore, reservations about the ''black box'' nature of neural network discriminators do not appy to binary decision trees; a binary decision tree may be reduced to a set of kinematic cuts subject to conventional error analysis

Complexity of major UK companies between 2006 and 2010: Hierarchical structure method approach

Science.gov (United States)

Ulusoy, Tolga; Keskin, Mustafa; Shirvani, Ayoub; Deviren, Bayram; Kantar, Ersin; Çaǧrı Dönmez, Cem

2012-11-01

This study reports on topology of the top 40 UK companies that have been analysed for predictive verification of markets for the period 2006-2010, applying the concept of minimal spanning tree and hierarchical tree (HT) analysis. Construction of the minimal spanning tree (MST) and the hierarchical tree (HT) is confined to a brief description of the methodology and a definition of the correlation function between a pair of companies based on the London Stock Exchange (LSE) index in order to quantify synchronization between the companies. A derivation of hierarchical organization and the construction of minimal-spanning and hierarchical trees for the 2006-2008 and 2008-2010 periods have been used and the results validate the predictive verification of applied semantics. The trees are known as useful tools to perceive and detect the global structure, taxonomy and hierarchy in financial data. From these trees, two different clusters of companies in 2006 were detected. They also show three clusters in 2008 and two between 2008 and 2010, according to their proximity. The clusters match each other as regards their common production activities or their strong interrelationship. The key companies are generally given by major economic activities as expected. This work gives a comparative approach between MST and HT methods from statistical physics and information theory with analysis of financial markets that may give new valuable and useful information of the financial market dynamics.

Process-based modelling of tree and stand growth: towards a hierarchical treatment of multiscale processes

International Nuclear Information System (INIS)

Makela, A.

2003-01-01

A generally accepted method has not emerged for managing the different temporal and spatial scales in a forest ecosystem. This paper reviews a hierarchical-modular modelling tradition, with the main focus on individual tree growth throughout the rotation. At this scale, model performance requires (i) realistic long-term dynamic properties, (ii) realistic responses of growth and mortality of competing individuals, and (iii) realistic responses to ecophysio-logical inputs. Model development and validation are illustrated through allocation patterns, height growth, and size-related feedbacks. Empirical work to test the approach is reviewed. In this approach, finer scale effects are embedded in parameters calculated using more detailed, interacting modules. This is exemplified by (i) the within-year effect of weather on annual photosynthesis, (ii) the effects of fast soil processes on carbon allocation and photosynthesis, and (iii) the utilization of detailed stem structure to predict wood quality. Prevailing management paradigms are reflected in growth modelling. A shift of emphasis has occurred from productivity in homogeneous canopies towards, e.g., wood quality versus total yield, spatially more explicit models, and growth decline in old-growth forests. The new problems emphasize the hierarchy of the system and interscale interactions, suggesting that the hierarchical-modular approach could prove constructive. (author)

Algorithm for protecting light-trees in survivable mesh wavelength-division-multiplexing networks

Science.gov (United States)

Luo, Hongbin; Li, Lemin; Yu, Hongfang

2006-12-01

Wavelength-division-multiplexing (WDM) technology is expected to facilitate bandwidth-intensive multicast applications such as high-definition television. A single fiber cut in a WDM mesh network, however, can disrupt the dissemination of information to several destinations on a light-tree based multicast session. Thus it is imperative to protect multicast sessions by reserving redundant resources. We propose a novel and efficient algorithm for protecting light-trees in survivable WDM mesh networks. The algorithm is called segment-based protection with sister node first (SSNF), whose basic idea is to protect a light-tree using a set of backup segments with a higher priority to protect the segments from a branch point to its children (sister nodes). The SSNF algorithm differs from the segment protection scheme proposed in the literature in how the segments are identified and protected. Our objective is to minimize the network resources used for protecting each primary light-tree such that the blocking probability can be minimized. To verify the effectiveness of the SSNF algorithm, we conduct extensive simulation experiments. The simulation results demonstrate that the SSNF algorithm outperforms existing algorithms for the same problem.

Transitions from Trees to Cycles in Adaptive Flow Networks

DEFF Research Database (Denmark)

Martens, Erik Andreas; Klemm, Konstantin

2017-01-01

-world transport networks exhibit both tree-like motifs and cycles. When the network is subject to load fluctuations, the presence of cyclic motifs may help to reduce flow fluctuations and, thus, render supply in the network more robust. While previous studies considered network topology via optimization...... principles, here, we take a dynamical systems approach and study a simple model of a flow network with dynamically adapting weights (conductances). We assume a spatially non-uniform distribution of rapidly fluctuating loads in the sinks and investigate what network configurations are dynamically stable......Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply. Theoretical and experimental studies have found that real...

A Multidimensional and Multimembership Clustering Method for Social Networks and Its Application in Customer Relationship Management

Directory of Open Access Journals (Sweden)

Peixin Zhao

2013-01-01

Full Text Available Community detection in social networks plays an important role in cluster analysis. Many traditional techniques for one-dimensional problems have been proven inadequate for high-dimensional or mixed type datasets due to the data sparseness and attribute redundancy. In this paper we propose a graph-based clustering method for multidimensional datasets. This novel method has two distinguished features: nonbinary hierarchical tree and the multi-membership clusters. The nonbinary hierarchical tree clearly highlights meaningful clusters, while the multimembership feature may provide more useful service strategies. Experimental results on the customer relationship management confirm the effectiveness of the new method.

Trees and Hierarchical Structures

CERN Document Server

Haeseler, Arndt

1990-01-01

The "raison d'etre" of hierarchical dustering theory stems from one basic phe­ nomenon: This is the notorious non-transitivity of similarity relations. In spite of the fact that very often two objects may be quite similar to a third without being that similar to each other, one still wants to dassify objects according to their similarity. This should be achieved by grouping them into a hierarchy of non-overlapping dusters such that any two objects in ~ne duster appear to be more related to each other than they are to objects outside this duster. In everyday life, as well as in essentially every field of scientific investigation, there is an urge to reduce complexity by recognizing and establishing reasonable das­ sification schemes. Unfortunately, this is counterbalanced by the experience of seemingly unavoidable deadlocks caused by the existence of sequences of objects, each comparatively similar to the next, but the last rather different from the first.

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.

Hierarchical feedback modules and reaction hubs in cell signaling networks.

Science.gov (United States)

Xu, Jianfeng; Lan, Yueheng

2015-01-01

Despite much effort, identification of modular structures and study of their organizing and functional roles remain a formidable challenge in molecular systems biology, which, however, is essential in reaching a systematic understanding of large-scale cell regulation networks and hence gaining capacity of exerting effective interference to cell activity. Combining graph theoretic methods with available dynamics information, we successfully retrieved multiple feedback modules of three important signaling networks. These feedbacks are structurally arranged in a hierarchical way and dynamically produce layered temporal profiles of output signals. We found that global and local feedbacks act in very different ways and on distinct features of the information flow conveyed by signal transduction but work highly coordinately to implement specific biological functions. The redundancy embodied with multiple signal-relaying channels and feedback controls bestow great robustness and the reaction hubs seated at junctions of different paths announce their paramount importance through exquisite parameter management. The current investigation reveals intriguing general features of the organization of cell signaling networks and their relevance to biological function, which may find interesting applications in analysis, design and control of bio-networks.

Hierarchical feedback modules and reaction hubs in cell signaling networks.

Directory of Open Access Journals (Sweden)

Jianfeng Xu

Full Text Available Despite much effort, identification of modular structures and study of their organizing and functional roles remain a formidable challenge in molecular systems biology, which, however, is essential in reaching a systematic understanding of large-scale cell regulation networks and hence gaining capacity of exerting effective interference to cell activity. Combining graph theoretic methods with available dynamics information, we successfully retrieved multiple feedback modules of three important signaling networks. These feedbacks are structurally arranged in a hierarchical way and dynamically produce layered temporal profiles of output signals. We found that global and local feedbacks act in very different ways and on distinct features of the information flow conveyed by signal transduction but work highly coordinately to implement specific biological functions. The redundancy embodied with multiple signal-relaying channels and feedback controls bestow great robustness and the reaction hubs seated at junctions of different paths announce their paramount importance through exquisite parameter management. The current investigation reveals intriguing general features of the organization of cell signaling networks and their relevance to biological function, which may find interesting applications in analysis, design and control of bio-networks.

Hierarchical Feedback Modules and Reaction Hubs in Cell Signaling Networks

Science.gov (United States)

Xu, Jianfeng; Lan, Yueheng

2015-01-01

Despite much effort, identification of modular structures and study of their organizing and functional roles remain a formidable challenge in molecular systems biology, which, however, is essential in reaching a systematic understanding of large-scale cell regulation networks and hence gaining capacity of exerting effective interference to cell activity. Combining graph theoretic methods with available dynamics information, we successfully retrieved multiple feedback modules of three important signaling networks. These feedbacks are structurally arranged in a hierarchical way and dynamically produce layered temporal profiles of output signals. We found that global and local feedbacks act in very different ways and on distinct features of the information flow conveyed by signal transduction but work highly coordinately to implement specific biological functions. The redundancy embodied with multiple signal-relaying channels and feedback controls bestow great robustness and the reaction hubs seated at junctions of different paths announce their paramount importance through exquisite parameter management. The current investigation reveals intriguing general features of the organization of cell signaling networks and their relevance to biological function, which may find interesting applications in analysis, design and control of bio-networks. PMID:25951347

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.

Minimum spanning trees and random resistor networks in d dimensions.

Science.gov (United States)

Read, N

2005-09-01

We consider minimum-cost spanning trees, both in lattice and Euclidean models, in d dimensions. For the cost of the optimum tree in a box of size L , we show that there is a correction of order L(theta) , where theta or =1 . The arguments all rely on the close relation of Kruskal's greedy algorithm for the minimum spanning tree, percolation, and (for some arguments) random resistor networks. The scaling of the entropy and free energy at small nonzero T , and hence of the number of near-optimal solutions, is also discussed. We suggest that the Steiner tree problem is in the same universality class as the minimum spanning tree in all dimensions, as is the traveling salesman problem in two dimensions. Hence all will have the same value of theta=-3/4 in two dimensions.

Structure-function relationship in complex brain networks expressed by hierarchical synchronization

International Nuclear Information System (INIS)

Zhou Changsong; Zemanova, Lucia; Zamora-Lopez, Gorka; Hilgetag, Claus C; Kurths, Juergen

2007-01-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

Structure-function relationship in complex brain networks expressed by hierarchical synchronization

Energy Technology Data Exchange (ETDEWEB)

Zhou Changsong [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Zemanova, Lucia [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Zamora-Lopez, Gorka [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Hilgetag, Claus C [Jacobs University Bremen, Campus Ring 6, Rm 116, D-28759 Bremen (Germany); Kurths, Juergen [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany)

2007-06-15

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.

Trinets encode tree-child and level-2 phylogenetic networks

NARCIS (Netherlands)

L.J.J. van Iersel (Leo); V. Moulton

2012-01-01

htmlabstractPhylogenetic networks generalize evolutionary trees, and are commonly used to represent evolutionary histories of species that undergo reticulate evolutionary processes such as hybridization, recombination and lateral gene transfer. Recently, there has been great interest in trying to

Diagnosis of Constant Faults in Read-Once Contact Networks over Finite Bases using Decision Trees

KAUST Repository

Busbait, Monther I.

2014-05-01

We study the depth of decision trees for diagnosis of constant faults in read-once contact networks over finite bases. This includes diagnosis of 0-1 faults, 0 faults and 1 faults. For any finite basis, we prove a linear upper bound on the minimum depth of decision tree for diagnosis of constant faults depending on the number of edges in a contact network over that basis. Also, we obtain asymptotic bounds on the depth of decision trees for diagnosis of each type of constant faults depending on the number of edges in contact networks in the worst case per basis. We study the set of indecomposable contact networks with up to 10 edges and obtain sharp coefficients for the linear upper bound for diagnosis of constant faults in contact networks over bases of these indecomposable contact networks. We use a set of algorithms, including one that we create, to obtain the sharp coefficients.

Inferring hierarchical clustering structures by deterministic annealing

International Nuclear Information System (INIS)

Hofmann, T.; Buhmann, J.M.

1996-01-01

The unsupervised detection of hierarchical structures is a major topic in unsupervised learning and one of the key questions in data analysis and representation. We propose a novel algorithm for the problem of learning decision trees for data clustering and related problems. In contrast to many other methods based on successive tree growing and pruning, we propose an objective function for tree evaluation and we derive a non-greedy technique for tree growing. Applying the principles of maximum entropy and minimum cross entropy, a deterministic annealing algorithm is derived in a meanfield approximation. This technique allows us to canonically superimpose tree structures and to fit parameters to averaged or open-quote fuzzified close-quote trees

Investigation of major international and Turkish companies via hierarchical methods and bootstrap approach

Science.gov (United States)

Kantar, E.; Deviren, B.; Keskin, M.

2011-11-01

We present a study, within the scope of econophysics, of the hierarchical structure of 98 among the largest international companies including 18 among the largest Turkish companies, namely Banks, Automobile, Software-hardware, Telecommunication Services, Energy and the Oil-Gas sectors, viewed as a network of interacting companies. We analyze the daily time series data of the Boerse-Frankfurt and Istanbul Stock Exchange. We examine the topological properties among the companies over the period 2006-2010 by using the concept of hierarchical structure methods (the minimal spanning tree (MST) and the hierarchical tree (HT)). The period is divided into three subperiods, namely 2006-2007, 2008 which was the year of global economic crisis, and 2009-2010, in order to test various time-windows and observe temporal evolution. We carry out bootstrap analyses to associate the value of statistical reliability to the links of the MSTs and HTs. We also use average linkage clustering analysis (ALCA) in order to better observe the cluster structure. From these studies, we find that the interactions among the Banks/Energy sectors and the other sectors were reduced after the global economic crisis; hence the effects of the Banks and Energy sectors on the correlations of all companies were decreased. Telecommunication Services were also greatly affected by the crisis. We also observed that the Automobile and Banks sectors, including Turkish companies as well as some companies from the USA, Japan and Germany were strongly correlated with each other in all periods.

Degree distribution of shortest path trees and bias of network sampling algorithms

NARCIS (Netherlands)

Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

2013-01-01

In this article, we explicitly derive the limiting distribution of the degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the power-law exponent of the degree distribution of this tree and compare it to the degree

Degree distribution of shortest path trees and bias of network sampling algorithms

NARCIS (Netherlands)

Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

2015-01-01

In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large degrees of this tree and compare it to the degree distribution

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

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.

LSTM-Based Hierarchical Denoising Network for Android Malware Detection

Directory of Open Access Journals (Sweden)

Jinpei Yan

2018-01-01

Full Text Available Mobile security is an important issue on Android platform. Most malware detection methods based on machine learning models heavily rely on expert knowledge for manual feature engineering, which are still difficult to fully describe malwares. In this paper, we present LSTM-based hierarchical denoise network (HDN, a novel static Android malware detection method which uses LSTM to directly learn from the raw opcode sequences extracted from decompiled Android files. However, most opcode sequences are too long for LSTM to train due to the gradient vanishing problem. Hence, HDN uses a hierarchical structure, whose first-level LSTM parallelly computes on opcode subsequences (we called them method blocks to learn the dense representations; then the second-level LSTM can learn and detect malware through method block sequences. Considering that malicious behavior only appears in partial sequence segments, HDN uses method block denoise module (MBDM for data denoising by adaptive gradient scaling strategy based on loss cache. We evaluate and compare HDN with the latest mainstream researches on three datasets. The results show that HDN outperforms these Android malware detection methods,and it is able to capture longer sequence features and has better detection efficiency than N-gram-based malware detection which is similar to our method.

Contributions of a global network of tree diversity experiments to sustainable forest plantations.

Science.gov (United States)

Verheyen, Kris; Vanhellemont, Margot; Auge, Harald; Baeten, Lander; Baraloto, Christopher; Barsoum, Nadia; Bilodeau-Gauthier, Simon; Bruelheide, Helge; Castagneyrol, Bastien; Godbold, Douglas; Haase, Josephine; Hector, Andy; Jactel, Hervé; Koricheva, Julia; Loreau, Michel; Mereu, Simone; Messier, Christian; Muys, Bart; Nolet, Philippe; Paquette, Alain; Parker, John; Perring, Mike; Ponette, Quentin; Potvin, Catherine; Reich, Peter; Smith, Andy; Weih, Martin; Scherer-Lorenzen, Michael

2016-02-01

The area of forest plantations is increasing worldwide helping to meet timber demand and protect natural forests. However, with global change, monospecific plantations are increasingly vulnerable to abiotic and biotic disturbances. As an adaption measure we need to move to plantations that are more diverse in genotypes, species, and structure, with a design underpinned by science. TreeDivNet, a global network of tree diversity experiments, responds to this need by assessing the advantages and disadvantages of mixed species plantations. The network currently consists of 18 experiments, distributed over 36 sites and five ecoregions. With plantations 1-15 years old, TreeDivNet can already provide relevant data for forest policy and management. In this paper, we highlight some early results on the carbon sequestration and pest resistance potential of more diverse plantations. Finally, suggestions are made for new, innovative experiments in understudied regions to complement the existing network.

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.

Enhanced fuzzy-connective-based hierarchical aggregation network using particle swarm optimization

Science.gov (United States)

Wang, Fang-Fang; Su, Chao-Ton

2014-11-01

The fuzzy-connective-based aggregation network is similar to the human decision-making process. It is capable of aggregating and propagating degrees of satisfaction of a set of criteria in a hierarchical manner. Its interpreting ability and transparency make it especially desirable. To enhance its effectiveness and further applicability, a learning approach is successfully developed based on particle swarm optimization to determine the weights and parameters of the connectives in the network. By experimenting on eight datasets with different characteristics and conducting further statistical tests, it has been found to outperform the gradient- and genetic algorithm-based learning approaches proposed in the literature; furthermore, it is capable of generating more accurate estimates. The present approach retains the original benefits of fuzzy-connective-based aggregation networks and is widely applicable. The characteristics of the learning approaches are also discussed and summarized, providing better understanding of the similarities and differences among these three approaches.

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.

Complex networks as an emerging property of hierarchical preferential attachment

Science.gov (United States)

Hébert-Dufresne, Laurent; Laurence, Edward; Allard, Antoine; Young, Jean-Gabriel; Dubé, Louis J.

2015-12-01

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of complex systems can be modeled as an organization of many embedded levels (potentially infinite in number), all of them following the same universal growth principle known as preferential attachment. We give examples of such hierarchy in real systems, for instance, in the pyramid of production entities of the film industry. More importantly, we show how real complex networks can be interpreted as a projection of our model, from which their scale independence, their clustering, their hierarchy, their fractality, and their navigability naturally emerge. Our results suggest that complex networks, viewed as growing systems, can be quite simple, and that the apparent complexity of their structure is largely a reflection of their unobserved hierarchical nature.

Networks and Spanning Trees: The Juxtaposition of Prüfer and Boruvka

Science.gov (United States)

Lodder, Jerry

2014-01-01

This paper outlines a method for teaching topics in undergraduate mathematics or computer science via historical curricular modules. The contents of one module, "Networks and Spanning Trees," are discussed from the original work of Arthur Cayley, Heinz Prüfer, and Otakar Boruvka that motivates the enumeration and application of trees in…

Immunizations on small worlds of tree-based wireless sensor networks

International Nuclear Information System (INIS)

Li Qiao; Zhang Bai-Hai; Cui Ling-Guo; Fan Zhun; Vasilakos Athanasios, V.

2012-01-01

The sensor virus is a serious threat, as an attacker can simply send a single packet to compromise the entire sensor network. Epidemics become drastic with link additions among sensors when the small world phenomena occur. Two immunization strategies, uniform immunization and temporary immunization, are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses. With the former strategy, the infection extends exponentially, although the immunization effectively reduces the contagion speed. With the latter strategy, recurrent contagion oscillations occur in the small world when the spatial-temporal dynamics of the epidemic are considered. The oscillations come from the small-world structure and the temporary immunization. Mathematical analyses on the small world of the Cayley tree are presented to reveal the epidemic dynamics with the two immunization strategies. (general)

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.

Hierarchical tree-structured control network for the Antares laser facility

International Nuclear Information System (INIS)

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

Efficient Dynamic Adaptation Strategies for Object Tracking Tree in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

CHEN, M.

2012-12-01

Full Text Available Most object tracking trees are established using the predefined mobility profile. However, when the real object's movement behaviors and query rates are different from the predefined mobility profile and query rates, the update cost and query cost of object tracking tree may increase. To upgrade the object tracking tree, the sink needs to send very large messages to collect the real movement information from the network, introducing a very large message overhead, which is referred to as adaptation cost. The Sub Root Message-Tree Adaptive procedure was proposed to dynamically collect the real movement information under the sub-tree and reconstruct the sub-tree to provide good performance based on the collected information. The simulation results indicates that the Sub Root Message-Tree Adaptive procedure is sufficient to achieve good total cost and lower adaptation cost.

Performance Analysis of Hierarchical Group Key Management Integrated with Adaptive Intrusion Detection in Mobile ad hoc Networks

Science.gov (United States)

2016-04-05

applications in wireless networks such as military battlefields, emergency response, mobile commerce , online gaming, and collaborative work are based on the...www.elsevier.com/locate/peva Performance analysis of hierarchical group key management integrated with adaptive intrusion detection in mobile ad hoc...Accepted 19 September 2010 Available online 26 September 2010 Keywords: Mobile ad hoc networks Intrusion detection Group communication systems Group

Mitigating Herding in Hierarchical Crowdsourcing Networks.

Science.gov (United States)

Yu, Han; Miao, Chunyan; Leung, Cyril; Chen, Yiqiang; Fauvel, Simon; Lesser, Victor R; Yang, Qiang

2016-12-05

Hierarchical crowdsourcing networks (HCNs) provide a useful mechanism for social mobilization. However, spontaneous evolution of the complex resource allocation dynamics can lead to undesirable herding behaviours in which a small group of reputable workers are overloaded while leaving other workers idle. Existing herding control mechanisms designed for typical crowdsourcing systems are not effective in HCNs. In order to bridge this gap, we investigate the herding dynamics in HCNs and propose a Lyapunov optimization based decision support approach - the Reputation-aware Task Sub-delegation approach with dynamic worker effort Pricing (RTS-P) - with objective functions aiming to achieve superlinear time-averaged collective productivity in an HCN. By considering the workers' current reputation, workload, eagerness to work, and trust relationships, RTS-P provides a systematic approach to mitigate herding by helping workers make joint decisions on task sub-delegation, task acceptance, and effort pricing in a distributed manner. It is an individual-level decision support approach which results in the emergence of productive and robust collective patterns in HCNs. High resolution simulations demonstrate that RTS-P mitigates herding more effectively than state-of-the-art approaches.

Delay-induced cluster patterns in coupled Cayley tree networks

Science.gov (United States)

Singh, A.; Jalan, S.

2013-07-01

We study effects of delay in diffusively coupled logistic maps on the Cayley tree networks. We find that smaller coupling values exhibit sensitiveness to value of delay, and lead to different cluster patterns of self-organized and driven types. Whereas larger coupling strengths exhibit robustness against change in delay values, and lead to stable driven clusters comprising nodes from last generation of the Cayley tree. Furthermore, introduction of delay exhibits suppression as well as enhancement of synchronization depending upon coupling strength values. To the end we discuss the importance of results to understand conflicts and cooperations observed in family business.

Network Signaling Channel for Improving ZigBee Performance in Dynamic Cluster-Tree Networks

Directory of Open Access Journals (Sweden)

D. Hämäläinen

2008-03-01

Full Text Available ZigBee is one of the most potential standardized technologies for wireless sensor networks (WSNs. Yet, sufficient energy-efficiency for the lowest power WSNs is achieved only in rather static networks. This severely limits the applicability of ZigBee in outdoor and mobile applications, where operation environment is harsh and link failures are common. This paper proposes a network channel beaconing (NCB algorithm for improving ZigBee performance in dynamic cluster-tree networks. NCB reduces the energy consumption of passive scans by dedicating one frequency channel for network beacon transmissions and by energy optimizing their transmission rate. According to an energy analysis, the power consumption of network maintenance operations reduces by 70%–76% in dynamic networks. In static networks, energy overhead is negligible. Moreover, the service time for data routing increases up to 37%. The performance of NCB is validated by ns-2 simulations. NCB can be implemented as an extension on MAC and NWK layers and it is fully compatible with ZigBee.

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

Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree

Energy Technology Data Exchange (ETDEWEB)

Chełminiak, Przemysław, E-mail: geronimo@amu.edu.pl

2013-11-29

An unexpected recognition of fractal topology in some real-world scale-free networks has evoked again an interest in the mechanisms stimulating their evolution. To explain this phenomenon a few models of a deterministic construction as well as a probabilistic growth controlled by a tunable parameter have been proposed so far. A quite different approach based on the fully stochastic evolution of the fractal scale-free networks presented in this Letter counterpoises these former ideas. It is argued that the diffusive evolution of the network on the Cayley tree shapes its fractality, self-similarity and the branching number criticality without any control parameter. The last attribute of the scale-free network is an intrinsic property of the skeleton, a special type of spanning tree which determines its fractality.

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.

Optimization of workflow scheduling in Utility Management System with hierarchical neural network

Directory of Open Access Journals (Sweden)

Srdjan Vukmirovic

2011-08-01

Full Text Available Grid computing could be the future computing paradigm for enterprise applications, one of its benefits being that it can be used for executing large scale applications. Utility Management Systems execute very large numbers of workflows with very high resource requirements. This paper proposes architecture for a new scheduling mechanism that dynamically executes a scheduling algorithm using feedback about the current status Grid nodes. Two Artificial Neural Networks were created in order to solve the scheduling problem. A case study is created for the Meter Data Management system with measurements from the Smart Metering system for the city of Novi Sad, Serbia. Performance tests show that significant improvement of overall execution time can be achieved by Hierarchical Artificial Neural Networks.

Identification of radon anomalies in soil gas using decision trees and neural networks

International Nuclear Information System (INIS)

Zmazek, B.; Dzeroski, S.; Torkar, D.; Vaupotic, J.; Kobal, I.

2010-01-01

The time series of radon ( 222 Rn) concentration in soil gas at a fault, together with the environmental parameters, have been analysed applying two machine learning techniques: (I) decision trees and (II) neural networks, with the aim at identifying radon anomalies caused by seismic events and not simply ascribed to the effect of the environmental parameters. By applying neural networks, 10 radon anomalies were observed for 12 earthquakes, while with decision trees, the anomaly was found for every earthquake, but, undesirably, some anomalies appeared also during periods without earthquakes. (authors)

Visualization and Hierarchical Analysis of Flow in Discrete Fracture Network Models

Science.gov (United States)

Aldrich, G. A.; Gable, C. W.; Painter, S. L.; Makedonska, N.; Hamann, B.; Woodring, J.

2013-12-01

Flow and transport in low permeability fractured rock is primary in interconnected fracture networks. Prediction and characterization of flow and transport in fractured rock has important implications in underground repositories for hazardous materials (eg. nuclear and chemical waste), contaminant migration and remediation, groundwater resource management, and hydrocarbon extraction. We have developed methods to explicitly model flow in discrete fracture networks and track flow paths using passive particle tracking algorithms. Visualization and analysis of particle trajectory through the fracture network is important to understanding fracture connectivity, flow patterns, potential contaminant pathways and fast paths through the network. However, occlusion due to the large number of highly tessellated and intersecting fracture polygons preclude the effective use of traditional visualization methods. We would also like quantitative analysis methods to characterize the trajectory of a large number of particle paths. We have solved these problems by defining a hierarchal flow network representing the topology of particle flow through the fracture network. This approach allows us to analyses the flow and the dynamics of the system as a whole. We are able to easily query the flow network, and use paint-and-link style framework to filter the fracture geometry and particle traces based on the flow analytics. This allows us to greatly reduce occlusion while emphasizing salient features such as the principal transport pathways. Examples are shown that demonstrate the methodology and highlight how use of this new method allows quantitative analysis and characterization of flow and transport in a number of representative fracture networks.

Inferring regulatory networks from expression data using tree-based methods.

Directory of Open Access Journals (Sweden)

Vân Anh Huynh-Thu

2010-09-01

Full Text Available One of the pressing open problems of computational systems biology is the elucidation of the topology of genetic regulatory networks (GRNs using high throughput genomic data, in particular microarray gene expression data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM challenge aims to evaluate the success of GRN inference algorithms on benchmarks of simulated data. In this article, we present GENIE3, a new algorithm for the inference of GRNs that was best performer in the DREAM4 In Silico Multifactorial challenge. GENIE3 decomposes the prediction of a regulatory network between p genes into p different regression problems. In each of the regression problems, the expression pattern of one of the genes (target gene is predicted from the expression patterns of all the other genes (input genes, using tree-based ensemble methods Random Forests or Extra-Trees. The importance of an input gene in the prediction of the target gene expression pattern is taken as an indication of a putative regulatory link. Putative regulatory links are then aggregated over all genes to provide a ranking of interactions from which the whole network is reconstructed. In addition to performing well on the DREAM4 In Silico Multifactorial challenge simulated data, we show that GENIE3 compares favorably with existing algorithms to decipher the genetic regulatory network of Escherichia coli. It doesn't make any assumption about the nature of gene regulation, can deal with combinatorial and non-linear interactions, produces directed GRNs, and is fast and scalable. In conclusion, we propose a new algorithm for GRN inference that performs well on both synthetic and real gene expression data. The algorithm, based on feature selection with tree-based ensemble methods, is simple and generic, making it adaptable to other types of genomic data and interactions.

Data acquisition in modeling using neural networks and decision trees

Directory of Open Access Journals (Sweden)

R. Sika

2011-04-01

Full Text Available The paper presents a comparison of selected models from area of artificial neural networks and decision trees in relation with actualconditions of foundry processes. The work contains short descriptions of used algorithms, their destination and method of data preparation,which is a domain of work of Data Mining systems. First part concerns data acquisition realized in selected iron foundry, indicating problems to solve in aspect of casting process modeling. Second part is a comparison of selected algorithms: a decision tree and artificial neural network, that is CART (Classification And Regression Trees and BP (Backpropagation in MLP (Multilayer Perceptron networks algorithms.Aim of the paper is to show an aspect of selecting data for modeling, cleaning it and reducing, for example due to too strong correlationbetween some of recorded process parameters. Also, it has been shown what results can be obtained using two different approaches:first when modeling using available commercial software, for example Statistica, second when modeling step by step using Excel spreadsheetbasing on the same algorithm, like BP-MLP. Discrepancy of results obtained from these two approaches originates from a priorimade assumptions. Mentioned earlier Statistica universal software package, when used without awareness of relations of technologicalparameters, i.e. without user having experience in foundry and without scheduling ranks of particular parameters basing on acquisition, can not give credible basis to predict the quality of the castings. Also, a decisive influence of data acquisition method has been clearly indicated, the acquisition should be conducted according to repetitive measurement and control procedures. This paper is based on about 250 records of actual data, for one assortment for 6 month period, where only 12 data sets were complete (including two that were used for validation of neural network and useful for creating a model. It is definitely too

Evaluation of geocast routing trees on random and actual networks

NARCIS (Netherlands)

Meijerink, Berend Jan; Baratchi, Mitra; Heijenk, Geert; Koucheryavy, Yevgeni; Mamatas, Lefteris; Matta, Ibrahim; Ometov, Aleksandr; Papadimitriou, Panagiotis

2017-01-01

Efficient geocast routing schemes are needed to transmit messages to mobile networked devices in geographically scoped areas. To design an efficient geocast routing algorithm a comprehensive evaluation of different routing tree approaches is needed. In this paper, we present an analytical study

Packets distribution in a tree-based topology wireless sensor networks

CSIR Research Space (South Africa)

Akpakwu, GA

2016-07-01

Full Text Available The concept of data distribution within cluster of sensor nodes to the source sink has resulted to intense research in Wireless Sensor Networks (WSNs). In this paper, in order to determine the scheduling length of packet distribution, a tree...

N-Doped carbon spheres with hierarchical micropore-nanosheet networks for high performance supercapacitors.

Science.gov (United States)

Wang, Shoupei; Zhang, Jianan; Shang, Pei; Li, Yuanyuan; Chen, Zhimin; Xu, Qun

2014-10-18

N-doped carbon spheres with hierarchical micropore-nanosheet networks (HPSCSs) were facilely fabricated by a one-step carbonization and activation process of N containing polymer spheres by KOH. With the synergy effect of the multiple structures, HPSCSs exhibit a very high specific capacitance of 407.9 F g(-1) at 1 mV s(-1) (1.2 times higher than that of porous carbon spheres) and a robust cycling stability for supercapacitors.

Hierarchical Leak Detection and Localization Method in Natural Gas Pipeline Monitoring Sensor Networks

OpenAIRE

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

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

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.

The use of hierarchical clustering for the design of optimized monitoring networks

Science.gov (United States)

Soares, Joana; Makar, Paul Andrew; Aklilu, Yayne; Akingunola, Ayodeji

2018-05-01

Associativity analysis is a powerful tool to deal with large-scale datasets by clustering the data on the basis of (dis)similarity and can be used to assess the efficacy and design of air quality monitoring networks. We describe here our use of Kolmogorov-Zurbenko filtering and hierarchical clustering of NO2 and SO2 passive and continuous monitoring data to analyse and optimize air quality networks for these species in the province of Alberta, Canada. The methodology applied in this study assesses dissimilarity between monitoring station time series based on two metrics: 1 - R, R being the Pearson correlation coefficient, and the Euclidean distance; we find that both should be used in evaluating monitoring site similarity. We have combined the analytic power of hierarchical clustering with the spatial information provided by deterministic air quality model results, using the gridded time series of model output as potential station locations, as a proxy for assessing monitoring network design and for network optimization. We demonstrate that clustering results depend on the air contaminant analysed, reflecting the difference in the respective emission sources of SO2 and NO2 in the region under study. Our work shows that much of the signal identifying the sources of NO2 and SO2 emissions resides in shorter timescales (hourly to daily) due to short-term variation of concentrations and that longer-term averages in data collection may lose the information needed to identify local sources. However, the methodology identifies stations mainly influenced by seasonality, if larger timescales (weekly to monthly) are considered. We have performed the first dissimilarity analysis based on gridded air quality model output and have shown that the methodology is capable of generating maps of subregions within which a single station will represent the entire subregion, to a given level of dissimilarity. We have also shown that our approach is capable of identifying different

An improved spatial contour tree constructed method

Science.gov (United States)

Zheng, Yi; Zhang, Ling; Guilbert, Eric; Long, Yi

2018-05-01

Contours are important data to delineate the landform on a map. A contour tree provides an object-oriented description of landforms and can be used to enrich the topological information. The traditional contour tree is used to store topological relationships between contours in a hierarchical structure and allows for the identification of eminences and depressions as sets of nested contours. This research proposes an improved contour tree so-called spatial contour tree that contains not only the topological but also the geometric information. It can be regarded as a terrain skeleton in 3-dimention, and it is established based on the spatial nodes of contours which have the latitude, longitude and elevation information. The spatial contour tree is built by connecting spatial nodes from low to high elevation for a positive landform, and from high to low elevation for a negative landform to form a hierarchical structure. The connection between two spatial nodes can provide the real distance and direction as a Euclidean vector in 3-dimention. In this paper, the construction method is tested in the experiment, and the results are discussed. The proposed hierarchical structure is in 3-demintion and can show the skeleton inside a terrain. The structure, where all nodes have geo-information, can be used to distinguish different landforms and applied for contour generalization with consideration of geographic characteristics.

Functional annotation of hierarchical modularity.

Directory of Open Access Journals (Sweden)

Kanchana Padmanabhan

Full Text Available In biological networks of molecular interactions in a cell, network motifs that are biologically relevant are also functionally coherent, or form functional modules. These functionally coherent modules combine in a hierarchical manner into larger, less cohesive subsystems, thus revealing one of the essential design principles of system-level cellular organization and function-hierarchical modularity. Arguably, hierarchical modularity has not been explicitly taken into consideration by most, if not all, functional annotation systems. As a result, the existing methods would often fail to assign a statistically significant functional coherence score to biologically relevant molecular machines. We developed a methodology for hierarchical functional annotation. Given the hierarchical taxonomy of functional concepts (e.g., Gene Ontology and the association of individual genes or proteins with these concepts (e.g., GO terms, our method will assign a Hierarchical Modularity Score (HMS to each node in the hierarchy of functional modules; the HMS score and its p-value measure functional coherence of each module in the hierarchy. While existing methods annotate each module with a set of "enriched" functional terms in a bag of genes, our complementary method provides the hierarchical functional annotation of the modules and their hierarchically organized components. A hierarchical organization of functional modules often comes as a bi-product of cluster analysis of gene expression data or protein interaction data. Otherwise, our method will automatically build such a hierarchy by directly incorporating the functional taxonomy information into the hierarchy search process and by allowing multi-functional genes to be part of more than one component in the hierarchy. In addition, its underlying HMS scoring metric ensures that functional specificity of the terms across different levels of the hierarchical taxonomy is properly treated. We have evaluated our

Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-viral Infection Patterns.

Science.gov (United States)

Smoly, Ilan; Carmel, Amir; Shemer-Avni, Yonat; Yeger-Lotem, Esti; Ziv-Ukelson, Michal

2016-03-01

Network querying is a powerful approach to mine molecular interaction networks. Most state-of-the-art network querying tools either confine the search to a prespecified topology in the form of some template subnetwork, or do not specify any topological constraints at all. Another approach is grammar-based queries, which are more flexible and expressive as they allow for expressing the topology of the sought pattern according to some grammar-based logic. Previous grammar-based network querying tools were confined to the identification of paths. In this article, we extend the patterns identified by grammar-based query approaches from paths to trees. For this, we adopt a higher order query descriptor in the form of a regular tree grammar (RTG). We introduce a novel problem and propose an algorithm to search a given graph for the k highest scoring subgraphs matching a tree accepted by an RTG. Our algorithm is based on the combination of dynamic programming with color coding, and includes an extension of previous k-best parsing optimization approaches to avoid isomorphic trees in the output. We implement the new algorithm and exemplify its application to mining viral infection patterns within molecular interaction networks. Our code is available online.

SDN‐Based Hierarchical Agglomerative Clustering Algorithm for Interference Mitigation in Ultra‐Dense Small Cell Networks

Directory of Open Access Journals (Sweden)

Guang Yang

2018-04-01

Full Text Available Ultra‐dense small cell networks (UD‐SCNs have been identified as a promising scheme for next‐generation wireless networks capable of meeting the ever‐increasing demand for higher transmission rates and better quality of service. However, UD‐SCNs will inevitably suffer from severe interference among the small cell base stations, which will lower their spectral efficiency. In this paper, we propose a software‐defined networking (SDN‐based hierarchical agglomerative clustering (SDN‐HAC framework, which leverages SDN to centrally control all sub‐channels in the network, and decides on cluster merging using a similarity criterion based on a suitability function. We evaluate the proposed algorithm through simulation. The obtained results show that the proposed algorithm performs well and improves system payoff by 18.19% and 436.34% when compared with the traditional network architecture algorithms and non‐cooperative scenarios, respectively.

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.

Effects of contact network structure on epidemic transmission trees: implications for data required to estimate network structure.

Science.gov (United States)

Carnegie, Nicole Bohme

2018-01-30

Understanding the dynamics of disease spread is key to developing effective interventions to control or prevent an epidemic. The structure of the network of contacts over which the disease spreads has been shown to have a strong influence on the outcome of the epidemic, but an open question remains as to whether it is possible to estimate contact network features from data collected in an epidemic. The approach taken in this paper is to examine the distributions of epidemic outcomes arising from epidemics on networks with particular structural features to assess whether that structure could be measured from epidemic data and what other constraints might be needed to make the problem identifiable. To this end, we vary the network size, mean degree, and transmissibility of the pathogen, as well as the network feature of interest: clustering, degree assortativity, or attribute-based preferential mixing. We record several standard measures of the size and spread of the epidemic, as well as measures that describe the shape of the transmission tree in order to ascertain whether there are detectable signals in the final data from the outbreak. The results suggest that there is potential to estimate contact network features from transmission trees or pure epidemic data, particularly for diseases with high transmissibility or for which the relevant contact network is of low mean degree. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

Can Network Linkage Effects Determine Return? Evidence from Chinese Stock Market.

Science.gov (United States)

Qiao, Haishu; Xia, Yue; Li, Ying

2016-01-01

This study used the dynamic conditional correlations (DCC) method to identify the linkage effects of Chinese stock market, and further detected the influence of network linkage effects on magnitude of security returns across different industries. Applying two physics-derived techniques, the minimum spanning tree and the hierarchical tree, we analyzed the stock interdependence within the network of the China Securities Index (CSI) industry index basket. We observed that that obvious linkage effects existed among stock networks. CII and CCE, CAG and ITH as well as COU, CHA and REI were confirmed as the core nodes in the three different networks respectively. We also investigated the stability of linkage effects by estimating the mean correlations and mean distances, as well as the normalized tree length of these indices. In addition, using the GMM model approach, we found inter-node influence within the stock network had a pronounced effect on stock returns. Our results generally suggested that there appeared to be greater clustering effect among the indexes belonging to related industrial sectors than those of diverse sectors, and network comovement was significantly affected by impactive financial events in the reality. Besides, stocks that were more central within the network of stock market usually had higher returns for compensation because they endured greater exposure to correlation risk.

Prediction of tissue-specific cis-regulatory modules using Bayesian networks and regression trees

Directory of Open Access Journals (Sweden)

Chen Xiaoyu

2007-12-01

Full Text Available Abstract Background In vertebrates, a large part of gene transcriptional regulation is operated by cis-regulatory modules. These modules are believed to be regulating much of the tissue-specificity of gene expression. Results We develop a Bayesian network approach for identifying cis-regulatory modules likely to regulate tissue-specific expression. The network integrates predicted transcription factor binding site information, transcription factor expression data, and target gene expression data. At its core is a regression tree modeling the effect of combinations of transcription factors bound to a module. A new unsupervised EM-like algorithm is developed to learn the parameters of the network, including the regression tree structure. Conclusion Our approach is shown to accurately identify known human liver and erythroid-specific modules. When applied to the prediction of tissue-specific modules in 10 different tissues, the network predicts a number of important transcription factor combinations whose concerted binding is associated to specific expression.

A Persistent Structured Hierarchical Overlay Network to Counter Intentional Churn Attack

Directory of Open Access Journals (Sweden)

Ramanpreet Kaur

2016-01-01

Full Text Available The increased use of structured overlay network for a variety of applications has attracted a lot of attention from both research community and attackers. However, the structural constraints, open nature (anybody can join and anybody may leave, and unreliability of its participant nodes significantly affect the performance of these applications and make it vulnerable to a variety of attacks such as eclipse, Sybil, and churn. One attack to compromise the service availability in overlay network is intentional churn (join/leave attack, where a large number of malicious users will join and leave the overlay network so frequently that the entire structure collapses and becomes unavailable. The focus of this paper is to provide a new robust, efficient, and scalable hierarchical overlay architecture that will counter these attacks by providing a structure that can accommodate the fleeting behaviour of nodes without causing much structural inconsistencies. The performance evaluation showed that the proposed architecture has more failure resilience and self-organization as compared to chord based architecture. Experimental results have demonstrated that the effect of failures on an overlay is proportional to the size of failure.

A P2P Botnet detection scheme based on decision tree and adaptive multilayer neural networks.

Science.gov (United States)

Alauthaman, Mohammad; Aslam, Nauman; Zhang, Li; Alasem, Rafe; Hossain, M A

2018-01-01

In recent years, Botnets have been adopted as a popular method to carry and spread many malicious codes on the Internet. These malicious codes pave the way to execute many fraudulent activities including spam mail, distributed denial-of-service attacks and click fraud. While many Botnets are set up using centralized communication architecture, the peer-to-peer (P2P) Botnets can adopt a decentralized architecture using an overlay network for exchanging command and control data making their detection even more difficult. This work presents a method of P2P Bot detection based on an adaptive multilayer feed-forward neural network in cooperation with decision trees. A classification and regression tree is applied as a feature selection technique to select relevant features. With these features, a multilayer feed-forward neural network training model is created using a resilient back-propagation learning algorithm. A comparison of feature set selection based on the decision tree, principal component analysis and the ReliefF algorithm indicated that the neural network model with features selection based on decision tree has a better identification accuracy along with lower rates of false positives. The usefulness of the proposed approach is demonstrated by conducting experiments on real network traffic datasets. In these experiments, an average detection rate of 99.08 % with false positive rate of 0.75 % was observed.

Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Yanfei Zheng

2010-01-01

Full Text Available Data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks (WSNs. A compromised node may forge an aggregation result and mislead base station into trusting a false reading. Efficient and secure aggregation scheme is critical in WSN applications due to the stringent resource constraints. In this paper, we propose a method to build up the representative-based aggregation tree in the WSNs such that the sensing data are aggregated along the route from the leaf cell to the root of the tree. In the cinema of large-scale and high-density sensor nodes, representative-based aggregation tree can reduce the data transmission overhead greatly by directed aggregation and cell-by-cell communications. It also provides security services including the integrity, freshness, and authentication, via detection mechanism in the cells.

Unified framework for triaxial accelerometer-based fall event detection and classification using cumulants and hierarchical decision tree classifier.

Science.gov (United States)

Kambhampati, Satya Samyukta; Singh, Vishal; Manikandan, M Sabarimalai; Ramkumar, Barathram

2015-08-01

In this Letter, the authors present a unified framework for fall event detection and classification using the cumulants extracted from the acceleration (ACC) signals acquired using a single waist-mounted triaxial accelerometer. The main objective of this Letter is to find suitable representative cumulants and classifiers in effectively detecting and classifying different types of fall and non-fall events. It was discovered that the first level of the proposed hierarchical decision tree algorithm implements fall detection using fifth-order cumulants and support vector machine (SVM) classifier. In the second level, the fall event classification algorithm uses the fifth-order cumulants and SVM. Finally, human activity classification is performed using the second-order cumulants and SVM. The detection and classification results are compared with those of the decision tree, naive Bayes, multilayer perceptron and SVM classifiers with different types of time-domain features including the second-, third-, fourth- and fifth-order cumulants and the signal magnitude vector and signal magnitude area. The experimental results demonstrate that the second- and fifth-order cumulant features and SVM classifier can achieve optimal detection and classification rates of above 95%, as well as the lowest false alarm rate of 1.03%.

A Hierarchical Poisson Log-Normal Model for Network Inference from RNA Sequencing Data

Science.gov (United States)

Gallopin, Mélina; Rau, Andrea; Jaffrézic, Florence

2013-01-01

Gene network inference from transcriptomic data is an important methodological challenge and a key aspect of systems biology. Although several methods have been proposed to infer networks from microarray data, there is a need for inference methods able to model RNA-seq data, which are count-based and highly variable. In this work we propose a hierarchical Poisson log-normal model with a Lasso penalty to infer gene networks from RNA-seq data; this model has the advantage of directly modelling discrete data and accounting for inter-sample variance larger than the sample mean. Using real microRNA-seq data from breast cancer tumors and simulations, we compare this method to a regularized Gaussian graphical model on log-transformed data, and a Poisson log-linear graphical model with a Lasso penalty on power-transformed data. For data simulated with large inter-sample dispersion, the proposed model performs better than the other methods in terms of sensitivity, specificity and area under the ROC curve. These results show the necessity of methods specifically designed for gene network inference from RNA-seq data. PMID:24147011

Analysis hierarchical model for discrete event systems

Science.gov (United States)

Ciortea, E. M.

2015-11-01

The This paper presents the hierarchical model based on discrete event network for robotic systems. Based on the hierarchical approach, Petri network is analysed as a network of the highest conceptual level and the lowest level of local control. For modelling and control of complex robotic systems using extended Petri nets. Such a system is structured, controlled and analysed in this paper by using Visual Object Net ++ package that is relatively simple and easy to use, and the results are shown as representations easy to interpret. The hierarchical structure of the robotic system is implemented on computers analysed using specialized programs. Implementation of hierarchical model discrete event systems, as a real-time operating system on a computer network connected via a serial bus is possible, where each computer is dedicated to local and Petri model of a subsystem global robotic system. Since Petri models are simplified to apply general computers, analysis, modelling, complex manufacturing systems control can be achieved using Petri nets. Discrete event systems is a pragmatic tool for modelling industrial systems. For system modelling using Petri nets because we have our system where discrete event. To highlight the auxiliary time Petri model using transport stream divided into hierarchical levels and sections are analysed successively. Proposed robotic system simulation using timed Petri, offers the opportunity to view the robotic time. Application of goods or robotic and transmission times obtained by measuring spot is obtained graphics showing the average time for transport activity, using the parameters sets of finished products. individually.

Diagnostics for generalized linear hierarchical models in network meta-analysis.

Science.gov (United States)

Zhao, Hong; Hodges, James S; Carlin, Bradley P

2017-09-01

Network meta-analysis (NMA) combines direct and indirect evidence comparing more than 2 treatments. Inconsistency arises when these 2 information sources differ. Previous work focuses on inconsistency detection, but little has been done on how to proceed after identifying inconsistency. The key issue is whether inconsistency changes an NMA's substantive conclusions. In this paper, we examine such discrepancies from a diagnostic point of view. Our methods seek to detect influential and outlying observations in NMA at a trial-by-arm level. These observations may have a large effect on the parameter estimates in NMA, or they may deviate markedly from other observations. We develop formal diagnostics for a Bayesian hierarchical model to check the effect of deleting any observation. Diagnostics are specified for generalized linear hierarchical NMA models and investigated for both published and simulated datasets. Results from our example dataset using either contrast- or arm-based models and from the simulated datasets indicate that the sources of inconsistency in NMA tend not to be influential, though results from the example dataset suggest that they are likely to be outliers. This mimics a familiar result from linear model theory, in which outliers with low leverage are not influential. Future extensions include incorporating baseline covariates and individual-level patient data. Copyright © 2017 John Wiley & Sons, Ltd.

Hierarchical Data Distribution Scheme for Peer-to-Peer Networks

Science.gov (United States)

Bhushan, Shashi; Dave, M.; Patel, R. B.

2010-11-01

In the past few years, peer-to-peer (P2P) networks have become an extremely popular mechanism for large-scale content sharing. P2P systems have focused on specific application domains (e.g. music files, video files) or on providing file system like capabilities. P2P is a powerful paradigm, which provides a large-scale and cost-effective mechanism for data sharing. P2P system may be used for storing data globally. Can we implement a conventional database on P2P system? But successful implementation of conventional databases on the P2P systems is yet to be reported. In this paper we have presented the mathematical model for the replication of the partitions and presented a hierarchical based data distribution scheme for the P2P networks. We have also analyzed the resource utilization and throughput of the P2P system with respect to the availability, when a conventional database is implemented over the P2P system with variable query rate. Simulation results show that database partitions placed on the peers with higher availability factor perform better. Degradation index, throughput, resource utilization are the parameters evaluated with respect to the availability factor.

Hierarchical Recurrent Neural Hashing for Image Retrieval With Hierarchical Convolutional Features.

Science.gov (United States)

Lu, Xiaoqiang; Chen, Yaxiong; Li, Xuelong

Hashing has been an important and effective technology in image retrieval due to its computational efficiency and fast search speed. The traditional hashing methods usually learn hash functions to obtain binary codes by exploiting hand-crafted features, which cannot optimally represent the information of the sample. Recently, deep learning methods can achieve better performance, since deep learning architectures can learn more effective image representation features. However, these methods only use semantic features to generate hash codes by shallow projection but ignore texture details. In this paper, we proposed a novel hashing method, namely hierarchical recurrent neural hashing (HRNH), to exploit hierarchical recurrent neural network to generate effective hash codes. There are three contributions of this paper. First, a deep hashing method is proposed to extensively exploit both spatial details and semantic information, in which, we leverage hierarchical convolutional features to construct image pyramid representation. Second, our proposed deep network can exploit directly convolutional feature maps as input to preserve the spatial structure of convolutional feature maps. Finally, we propose a new loss function that considers the quantization error of binarizing the continuous embeddings into the discrete binary codes, and simultaneously maintains the semantic similarity and balanceable property of hash codes. Experimental results on four widely used data sets demonstrate that the proposed HRNH can achieve superior performance over other state-of-the-art hashing methods.Hashing has been an important and effective technology in image retrieval due to its computational efficiency and fast search speed. The traditional hashing methods usually learn hash functions to obtain binary codes by exploiting hand-crafted features, which cannot optimally represent the information of the sample. Recently, deep learning methods can achieve better performance, since deep

Functional model of biological neural networks.

Science.gov (United States)

Lo, James Ting-Ho

2010-12-01

A functional model of biological neural networks, called temporal hierarchical probabilistic associative memory (THPAM), is proposed in this paper. THPAM comprises functional models of dendritic trees for encoding inputs to neurons, a first type of neuron for generating spike trains, a second type of neuron for generating graded signals to modulate neurons of the first type, supervised and unsupervised Hebbian learning mechanisms for easy learning and retrieving, an arrangement of dendritic trees for maximizing generalization, hardwiring for rotation-translation-scaling invariance, and feedback connections with different delay durations for neurons to make full use of present and past informations generated by neurons in the same and higher layers. These functional models and their processing operations have many functions of biological neural networks that have not been achieved by other models in the open literature and provide logically coherent answers to many long-standing neuroscientific questions. However, biological justifications of these functional models and their processing operations are required for THPAM to qualify as a macroscopic model (or low-order approximate) of biological neural networks.

Tank waste remediation system architecture tree

International Nuclear Information System (INIS)

PECK, L.G.

1999-01-01

The TWRS Architecture Tree presented in this document is a hierarchical breakdown to support the TWRS systems engineering analysis of the TWRS physical system, including facilities, hardware and software. The purpose for this systems engineering architecture tree is to describe and communicate the system's selected and existing architecture, to provide a common structure to improve the integration of work and resulting products, and to provide a framework as a basis for TWRS Specification Tree development

Lidar-based individual tree species classification using convolutional neural network

Science.gov (United States)

Mizoguchi, Tomohiro; Ishii, Akira; Nakamura, Hiroyuki; Inoue, Tsuyoshi; Takamatsu, Hisashi

2017-06-01

Terrestrial lidar is commonly used for detailed documentation in the field of forest inventory investigation. Recent improvements of point cloud processing techniques enabled efficient and precise computation of an individual tree shape parameters, such as breast-height diameter, height, and volume. However, tree species are manually specified by skilled workers to date. Previous works for automatic tree species classification mainly focused on aerial or satellite images, and few works have been reported for classification techniques using ground-based sensor data. Several candidate sensors can be considered for classification, such as RGB or multi/hyper spectral cameras. Above all candidates, we use terrestrial lidar because it can obtain high resolution point cloud in the dark forest. We selected bark texture for the classification criteria, since they clearly represent unique characteristics of each tree and do not change their appearance under seasonable variation and aged deterioration. In this paper, we propose a new method for automatic individual tree species classification based on terrestrial lidar using Convolutional Neural Network (CNN). The key component is the creation step of a depth image which well describe the characteristics of each species from a point cloud. We focus on Japanese cedar and cypress which cover the large part of domestic forest. Our experimental results demonstrate the effectiveness of our proposed method.

Immunizations on small worlds of tree-based wireless sensor networks

DEFF Research Database (Denmark)

Li, Qiao; Zhang, Bai-Hai; Cui, Ling-Guo

2012-01-01

, are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses. With the former strategy, the infection extends exponentially, although the immunization effectively reduces the contagion speed. With the latter strategy, recurrent contagion oscillations occur in the small world......The sensor virus is a serious threat, as an attacker can simply send a single packet to compromise the entire sensor network. Epidemics become drastic with link additions among sensors when the small world phenomena occur. Two immunization strategies, uniform immunization and temporary immunization...

Optimal Parameter for the Training of Multilayer Perceptron Neural Networks by Using Hierarchical Genetic Algorithm

International Nuclear Information System (INIS)

Orozco-Monteagudo, Maykel; Taboada-Crispi, Alberto; Gutierrez-Hernandez, Liliana

2008-01-01

This paper deals with the controversial topic of the selection of the parameters of a genetic algorithm, in this case hierarchical, used for training of multilayer perceptron neural networks for the binary classification. The parameters to select are the crossover and mutation probabilities of the control and parametric genes and the permanency percent. The results can be considered as a guide for using this kind of algorithm.

Phylogenetic classification and the universal tree.

Science.gov (United States)

Doolittle, W F

1999-06-25

From comparative analyses of the nucleotide sequences of genes encoding ribosomal RNAs and several proteins, molecular phylogeneticists have constructed a "universal tree of life," taking it as the basis for a "natural" hierarchical classification of all living things. Although confidence in some of the tree's early branches has recently been shaken, new approaches could still resolve many methodological uncertainties. More challenging is evidence that most archaeal and bacterial genomes (and the inferred ancestral eukaryotic nuclear genome) contain genes from multiple sources. If "chimerism" or "lateral gene transfer" cannot be dismissed as trivial in extent or limited to special categories of genes, then no hierarchical universal classification can be taken as natural. Molecular phylogeneticists will have failed to find the "true tree," not because their methods are inadequate or because they have chosen the wrong genes, but because the history of life cannot properly be represented as a tree. However, taxonomies based on molecular sequences will remain indispensable, and understanding of the evolutionary process will ultimately be enriched, not impoverished.

Impact of hierarchical modular structure on ranking of individual nodes in directed networks

Energy Technology Data Exchange (ETDEWEB)

Masuda, Naoki [Graduate School of Information Science and Technology, University of Tokyo, 7-3-1 Hongo, Bunkyo, Tokyo 113-8656 (Japan); Kawamura, Yoji [Institute for Research on Earth Evolution, Japan Agency for Marine-Earth Science and Technology, 3173-25 Showa-machi, Kanazawa-ku, Yokohama, Kanagawa 236-0001 (Japan); Kori, Hiroshi [PRESTO, Japan Science and Technology Agency, 4-1-8 Honcho, Kawaguchi, Saitama 332-0012 (Japan)], E-mail: masuda@mist.i.u-tokyo.ac.jp

2009-11-15

Many systems, ranging from biological and engineering systems to social systems, can be modeled as directed networks, with links representing directed interaction between two nodes. To assess the importance of a node in a directed network, various centrality measures based on different criteria have been proposed. However, calculating the centrality of a node is often difficult because of the overwhelming size of the network or because the information held about the network is incomplete. Thus, developing an approximation method for estimating centrality measures is needed. In this study, we focus on modular networks; many real-world networks are composed of modules, where connection is dense within a module and sparse across different modules. We show that ranking-type centrality measures, including the PageRank, can be efficiently estimated once the modular structure of a network is extracted. We develop an analytical method to evaluate the centrality of nodes by combining the local property (i.e. indegree and outdegree of nodes) and the global property (i.e. centrality of modules). The proposed method is corroborated by real data. Our results provide a linkage between the ranking-type centrality values of modules and those of individual nodes. They also reveal the hierarchical structure of networks in the sense of subordination (not nestedness) laid out by connectivity among modules of different relative importance. The present study raises a novel motive for identifying modules in networks.

Impact of hierarchical modular structure on ranking of individual nodes in directed networks

International Nuclear Information System (INIS)

Masuda, Naoki; Kawamura, Yoji; Kori, Hiroshi

2009-01-01

Many systems, ranging from biological and engineering systems to social systems, can be modeled as directed networks, with links representing directed interaction between two nodes. To assess the importance of a node in a directed network, various centrality measures based on different criteria have been proposed. However, calculating the centrality of a node is often difficult because of the overwhelming size of the network or because the information held about the network is incomplete. Thus, developing an approximation method for estimating centrality measures is needed. In this study, we focus on modular networks; many real-world networks are composed of modules, where connection is dense within a module and sparse across different modules. We show that ranking-type centrality measures, including the PageRank, can be efficiently estimated once the modular structure of a network is extracted. We develop an analytical method to evaluate the centrality of nodes by combining the local property (i.e. indegree and outdegree of nodes) and the global property (i.e. centrality of modules). The proposed method is corroborated by real data. Our results provide a linkage between the ranking-type centrality values of modules and those of individual nodes. They also reveal the hierarchical structure of networks in the sense of subordination (not nestedness) laid out by connectivity among modules of different relative importance. The present study raises a novel motive for identifying modules in networks.

RADYBAN: A tool for reliability analysis of dynamic fault trees through conversion into dynamic Bayesian networks

International Nuclear Information System (INIS)

Montani, S.; Portinale, L.; Bobbio, A.; Codetta-Raiteri, D.

2008-01-01

In this paper, we present RADYBAN (Reliability Analysis with DYnamic BAyesian Networks), a software tool which allows to analyze a dynamic fault tree relying on its conversion into a dynamic Bayesian network. The tool implements a modular algorithm for automatically translating a dynamic fault tree into the corresponding dynamic Bayesian network and exploits classical algorithms for the inference on dynamic Bayesian networks, in order to compute reliability measures. After having described the basic features of the tool, we show how it operates on a real world example and we compare the unreliability results it generates with those returned by other methodologies, in order to verify the correctness and the consistency of the results obtained

Using ROC curves to compare neural networks and logistic regression for modeling individual noncatastrophic tree mortality

Science.gov (United States)

Susan L. King

2003-01-01

The performance of two classifiers, logistic regression and neural networks, are compared for modeling noncatastrophic individual tree mortality for 21 species of trees in West Virginia. The output of the classifier is usually a continuous number between 0 and 1. A threshold is selected between 0 and 1 and all of the trees below the threshold are classified as...

D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure

Science.gov (United States)

Suhaibah, A.; Uznir, U.; Anton, F.; Mioc, D.; Rahman, A. A.

2016-06-01

Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D) method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.

Study on the correlation between the hierarchical urban system and high-speed railway network planning in China

Directory of Open Access Journals (Sweden)

Hong Sun

2016-09-01

Full Text Available This study examines the interrelatedness between the hierarchical structure of China׳s urban system and high-speed railway (HSR network planning at the national level. As a multi-layered system, the Chinese HSR can be categorized into three sub-networks, namely, the national HSR trunk network, the national HSR extensional network, and the intercity HSR network. By examining the direct HSR network connection, HSR nodal connection, and HSR operational frequency of 287 prefecture-level cities, this study demonstrates that the hierarchies of China׳s administrative, demographic, and economic urban systems strongly influence HSR network planning. The national HSR trunk network prioritizes the connection of top-level central cities, whereas the extensional network prioritizes cities at the lower level of the urban system. Moreover, the national HSR system forms the backbone of the HSR network structure based on a national scale, whereas the intercity HSR system satisfies the travel needs within urban agglomerations based on the regional level.

Traveling and Pinned Fronts in Bistable Reaction-Diffusion Systems on Networks

Science.gov (United States)

Kouvaris, Nikos E.; Kori, Hiroshi; Mikhailov, Alexander S.

2012-01-01

Traveling fronts and stationary localized patterns in bistable reaction-diffusion systems have been broadly studied for classical continuous media and regular lattices. Analogs of such non-equilibrium patterns are also possible in networks. Here, we consider traveling and stationary patterns in bistable one-component systems on random Erdös-Rényi, scale-free and hierarchical tree networks. As revealed through numerical simulations, traveling fronts exist in network-organized systems. They represent waves of transition from one stable state into another, spreading over the entire network. The fronts can furthermore be pinned, thus forming stationary structures. While pinning of fronts has previously been considered for chains of diffusively coupled bistable elements, the network architecture brings about significant differences. An important role is played by the degree (the number of connections) of a node. For regular trees with a fixed branching factor, the pinning conditions are analytically determined. For large Erdös-Rényi and scale-free networks, the mean-field theory for stationary patterns is constructed. PMID:23028746

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.

On Energy-Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Cristina Comaniciu

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

Hierarchical graphical-based human pose estimation via local multi-resolution convolutional neural network

Science.gov (United States)

Zhu, Aichun; Wang, Tian; Snoussi, Hichem

2018-03-01

This paper addresses the problems of the graphical-based human pose estimation in still images, including the diversity of appearances and confounding background clutter. We present a new architecture for estimating human pose using a Convolutional Neural Network (CNN). Firstly, a Relative Mixture Deformable Model (RMDM) is defined by each pair of connected parts to compute the relative spatial information in the graphical model. Secondly, a Local Multi-Resolution Convolutional Neural Network (LMR-CNN) is proposed to train and learn the multi-scale representation of each body parts by combining different levels of part context. Thirdly, a LMR-CNN based hierarchical model is defined to explore the context information of limb parts. Finally, the experimental results demonstrate the effectiveness of the proposed deep learning approach for human pose estimation.

Hierarchical graphical-based human pose estimation via local multi-resolution convolutional neural network

Directory of Open Access Journals (Sweden)

Aichun Zhu

2018-03-01

Full Text Available This paper addresses the problems of the graphical-based human pose estimation in still images, including the diversity of appearances and confounding background clutter. We present a new architecture for estimating human pose using a Convolutional Neural Network (CNN. Firstly, a Relative Mixture Deformable Model (RMDM is defined by each pair of connected parts to compute the relative spatial information in the graphical model. Secondly, a Local Multi-Resolution Convolutional Neural Network (LMR-CNN is proposed to train and learn the multi-scale representation of each body parts by combining different levels of part context. Thirdly, a LMR-CNN based hierarchical model is defined to explore the context information of limb parts. Finally, the experimental results demonstrate the effectiveness of the proposed deep learning approach for human pose estimation.

PERFORMANCE ANALYSIS OF SET PARTITIONING IN HIERARCHICAL TREES (SPIHT ALGORITHM FOR A FAMILY OF WAVELETS USED IN COLOR IMAGE COMPRESSION

Directory of Open Access Journals (Sweden)

A. Sreenivasa Murthy

2014-11-01

Full Text Available With the spurt in the amount of data (Image, video, audio, speech, & text available on the net, there is a huge demand for memory & bandwidth savings. One has to achieve this, by maintaining the quality & fidelity of the data acceptable to the end user. Wavelet transform is an important and practical tool for data compression. Set partitioning in hierarchal trees (SPIHT is a widely used compression algorithm for wavelet transformed images. Among all wavelet transform and zero-tree quantization based image compression algorithms SPIHT has become the benchmark state-of-the-art algorithm because it is simple to implement & yields good results. In this paper we present a comparative study of various wavelet families for image compression with SPIHT algorithm. We have conducted experiments with Daubechies, Coiflet, Symlet, Bi-orthogonal, Reverse Bi-orthogonal and Demeyer wavelet types. The resulting image quality is measured objectively, using peak signal-to-noise ratio (PSNR, and subjectively, using perceived image quality (human visual perception, HVP for short. The resulting reduction in the image size is quantified by compression ratio (CR.

Tree growth-climate relationships in a forest-plot network on Mediterranean mountains.

Science.gov (United States)

Fyllas, Nikolaos M; Christopoulou, Anastasia; Galanidis, Alexandros; Michelaki, Chrysanthi Z; Dimitrakopoulos, Panayiotis G; Fulé, Peter Z; Arianoutsou, Margarita

2017-11-15

In this study we analysed a novel tree-growth dataset, inferred from annual ring-width measurements, of 7 forest tree species from 12 mountain regions in Greece, in order to identify tree growth - climate relationships. The tree species of interest were: Abies cephalonica, Abies borisii-regis, Picea abies, Pinus nigra, Pinus sylvestris, Fagus sylvatica and Quercus frainetto growing across a gradient of climate conditions with mean annual temperature ranging from 5.7 to 12.6°C and total annual precipitation from 500 to 950mm. In total, 344 tree cores (one per tree) were analysed across a network of 20 study sites. We found that water availability during the summer period (May-August) was a strong predictor of interannual variation in tree growth for all study species. Across species and sites, annual tree growth was positively related to summer season precipitation (P SP ). The responsiveness of annual growth to P SP was tightly related to species and site specific measurements of instantaneous photosynthetic water use efficiency (WUE), suggesting that the growth of species with efficient water use is more responsive to variations in precipitation during the dry months of the year. Our findings support the importance of water availability for the growth of mountainous Mediterranean tree species and highlight that future reductions in precipitation are likely to lead to reduced tree-growth under climate change conditions. Copyright © 2017 Elsevier B.V. All rights reserved.

Can Network Linkage Effects Determine Return? Evidence from Chinese Stock Market

Science.gov (United States)

Qiao, Haishu; Xia, Yue; Li, Ying

2016-01-01

This study used the dynamic conditional correlations (DCC) method to identify the linkage effects of Chinese stock market, and further detected the influence of network linkage effects on magnitude of security returns across different industries. Applying two physics-derived techniques, the minimum spanning tree and the hierarchical tree, we analyzed the stock interdependence within the network of the China Securities Index (CSI) industry index basket. We observed that that obvious linkage effects existed among stock networks. CII and CCE, CAG and ITH as well as COU, CHA and REI were confirmed as the core nodes in the three different networks respectively. We also investigated the stability of linkage effects by estimating the mean correlations and mean distances, as well as the normalized tree length of these indices. In addition, using the GMM model approach, we found inter-node influence within the stock network had a pronounced effect on stock returns. Our results generally suggested that there appeared to be greater clustering effect among the indexes belonging to related industrial sectors than those of diverse sectors, and network comovement was significantly affected by impactive financial events in the reality. Besides, stocks that were more central within the network of stock market usually had higher returns for compensation because they endured greater exposure to correlation risk. PMID:27257816

ETE: a python Environment for Tree Exploration.

Science.gov (United States)

Huerta-Cepas, Jaime; Dopazo, Joaquín; Gabaldón, Toni

2010-01-13

Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relationships among different biological entities, thus facilitating their analysis and interpretation. A number of standalone programs are available that focus on tree visualization or that perform specific analyses on them. However, such applications are rarely suitable for large-scale surveys, in which a higher level of automation is required. Currently, many genome-wide analyses rely on tree-like data representation and hence there is a growing need for scalable tools to handle tree structures at large scale. Here we present the Environment for Tree Exploration (ETE), a python programming toolkit that assists in the automated manipulation, analysis and visualization of hierarchical trees. ETE libraries provide a broad set of tree handling options as well as specific methods to analyze phylogenetic and clustering trees. Among other features, ETE allows for the independent analysis of tree partitions, has support for the extended newick format, provides an integrated node annotation system and permits to link trees to external data such as multiple sequence alignments or numerical arrays. In addition, ETE implements a number of built-in analytical tools, including phylogeny-based orthology prediction and cluster validation techniques. Finally, ETE's programmable tree drawing engine can be used to automate the graphical rendering of trees with customized node-specific visualizations. ETE provides a complete set of methods to manipulate tree data structures that extends current functionality in other bioinformatic toolkits of a more general purpose. ETE is free software and can be downloaded from http://ete.cgenomics.org.

ETE: a python Environment for Tree Exploration

Directory of Open Access Journals (Sweden)

Gabaldón Toni

2010-01-01

Full Text Available Abstract Background Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relationships among different biological entities, thus facilitating their analysis and interpretation. A number of standalone programs are available that focus on tree visualization or that perform specific analyses on them. However, such applications are rarely suitable for large-scale surveys, in which a higher level of automation is required. Currently, many genome-wide analyses rely on tree-like data representation and hence there is a growing need for scalable tools to handle tree structures at large scale. Results Here we present the Environment for Tree Exploration (ETE, a python programming toolkit that assists in the automated manipulation, analysis and visualization of hierarchical trees. ETE libraries provide a broad set of tree handling options as well as specific methods to analyze phylogenetic and clustering trees. Among other features, ETE allows for the independent analysis of tree partitions, has support for the extended newick format, provides an integrated node annotation system and permits to link trees to external data such as multiple sequence alignments or numerical arrays. In addition, ETE implements a number of built-in analytical tools, including phylogeny-based orthology prediction and cluster validation techniques. Finally, ETE's programmable tree drawing engine can be used to automate the graphical rendering of trees with customized node-specific visualizations. Conclusions ETE provides a complete set of methods to manipulate tree data structures that extends current functionality in other bioinformatic toolkits of a more general purpose. ETE is free software and can be downloaded from http://ete.cgenomics.org.

FTUC: A Flooding Tree Uneven Clustering Protocol for a Wireless Sensor Network.

Science.gov (United States)

He, Wei; Pillement, Sebastien; Xu, Du

2017-11-23

Clustering is an efficient approach in a wireless sensor network (WSN) to reduce the energy consumption of nodes and to extend the lifetime of the network. Unfortunately, this approach requires that all cluster heads (CHs) transmit their data to the base station (BS), which gives rise to the long distance communications problem, and in multi-hop routing, the CHs near the BS have to forward data from other nodes that lead those CHs to die prematurely, creating the hot zones problem. Unequal clustering has been proposed to solve these problems. Most of the current algorithms elect CH only by considering their competition radius, leading to unevenly distributed cluster heads. Furthermore, global distances values are needed when calculating the competition radius, which is a tedious task in large networks. To face these problems, we propose a flooding tree uneven clustering protocol (FTUC) suited for large networks. Based on the construction of a tree type sub-network to calculate the minimum and maximum distances values of the network, we then apply the unequal cluster theory. We also introduce referenced position circles to evenly elect cluster heads. Therefore, cluster heads are elected depending on the node's residual energy and their distance to a referenced circle. FTUC builds the best inter-cluster communications route by evaluating a cluster head cost function to find the best next hop to the BS. The simulation results show that the FTUC algorithm decreases the energy consumption of the nodes and balances the global energy consumption effectively, thus extending the lifetime of the network.

Automatic Hierarchical Color Image Classification

Directory of Open Access Journals (Sweden)

Jing Huang

2003-02-01

Full Text Available Organizing images into semantic categories can be extremely useful for content-based image retrieval and image annotation. Grouping images into semantic classes is a difficult problem, however. Image classification attempts to solve this hard problem by using low-level image features. In this paper, we propose a method for hierarchical classification of images via supervised learning. This scheme relies on using a good low-level feature and subsequently performing feature-space reconfiguration using singular value decomposition to reduce noise and dimensionality. We use the training data to obtain a hierarchical classification tree that can be used to categorize new images. Our experimental results suggest that this scheme not only performs better than standard nearest-neighbor techniques, but also has both storage and computational advantages.

The SIS Model of Epidemic Spreading in a Hierarchical Social Network

International Nuclear Information System (INIS)

Grabowski, A.; Kosinski, R.A.

2005-01-01

The phenomenon of epidemic spreading in a population with a hierarchical structure of interpersonal interactions is described and investigated numerically. The SIS model with temporal immunity to a disease and a time of incubation is used. In our model spatial localization of individuals belonging to different social groups, effectiveness of different interpersonal interactions and the mobility of a contemporary community are taken into account. The structure of interpersonal connections is based on a scale-free network. The influence of the structure of the social network on typical relations characterizing the spreading process, like a range of epidemic and epidemic curves, is discussed. The probability that endemic state occurs is also calculated. Surprisingly it occurs, that less contagious diseases has greater chance to survive. The influence of preventive vaccinations on the spreading process is investigated and critical range of vaccinations that is sufficient for the suppression of an epidemic is calculated. Our results of numerical calculations are compared with the solutions of the master equation for the spreading process, and good agreement is found. (author)

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. PMID:22368464

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.

Hierarchical Leak Detection and Localization Method in Natural Gas Pipeline Monitoring Sensor Networks

Directory of Open Access Journals (Sweden)

Ning Yu

2011-12-01

Full Text Available 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.

Tree-based server-middleman-client architecture: improving scalability and reliability for voting-based network games in ad hoc wireless networks

Science.gov (United States)

Guo, Y.; Fujinoki, H.

2006-10-01

The concept of a new tree-based architecture for networked multi-player games was proposed by Matuszek to improve scalability in network traffic at the same time to improve reliability. The architecture (we refer it as "Tree-Based Server- Middlemen-Client architecture") will solve the two major problems in ad-hoc wireless networks: frequent link failures and significance in battery power consumption at wireless transceivers by using two new techniques, recursive aggregation of client messages and subscription-based propagation of game state. However, the performance of the TBSMC architecture has never been quantitatively studied. In this paper, the TB-SMC architecture is compared with the client-server architecture using simulation experiments. We developed an event driven simulator to evaluate the performance of the TB-SMC architecture. In the network traffic scalability experiments, the TB-SMC architecture resulted in less than 1/14 of the network traffic load for 200 end users. In the reliability experiments, the TB-SMC architecture improved the number of successfully delivered players' votes by 31.6, 19.0, and 12.4% from the clientserver architecture at high (failure probability of 90%), moderate (50%) and low (10%) failure probability.

Hierarchical structure of the European countries based on debts as a percentage of GDP during the 2000-2011 period

Science.gov (United States)

Kantar, Ersin; Deviren, Bayram; Keskin, Mustafa

2014-11-01

We investigate hierarchical structures of the European countries by using debt as a percentage of Gross Domestic Product (GDP) of the countries as they change over a certain period of time. We obtain the topological properties among the countries based on debt as a percentage of GDP of European countries over the period 2000-2011 by using the concept of hierarchical structure methods (minimal spanning tree, (MST) and hierarchical tree, (HT)). This period is also divided into two sub-periods related to 2004 enlargement of the European Union, namely 2000-2004 and 2005-2011, in order to test various time-window and observe the temporal evolution. The bootstrap techniques is applied to see a value of statistical reliability of the links of the MSTs and HTs. The clustering linkage procedure is also used to observe the cluster structure more clearly. From the structural topologies of these trees, we identify different clusters of countries according to their level of debts. Our results show that by the debt crisis, the less and most affected Eurozone’s economies are formed as a cluster with each other in the MSTs and hierarchical trees.

Nonparametric Tree-Based Predictive Modeling of Storm Outages on an Electric Distribution Network.

Science.gov (United States)

He, Jichao; Wanik, David W; Hartman, Brian M; Anagnostou, Emmanouil N; Astitha, Marina; Frediani, Maria E B

2017-03-01

This article compares two nonparametric tree-based models, quantile regression forests (QRF) and Bayesian additive regression trees (BART), for predicting storm outages on an electric distribution network in Connecticut, USA. We evaluated point estimates and prediction intervals of outage predictions for both models using high-resolution weather, infrastructure, and land use data for 89 storm events (including hurricanes, blizzards, and thunderstorms). We found that spatially BART predicted more accurate point estimates than QRF. However, QRF produced better prediction intervals for high spatial resolutions (2-km grid cells and towns), while BART predictions aggregated to coarser resolutions (divisions and service territory) more effectively. We also found that the predictive accuracy was dependent on the season (e.g., tree-leaf condition, storm characteristics), and that the predictions were most accurate for winter storms. Given the merits of each individual model, we suggest that BART and QRF be implemented together to show the complete picture of a storm's potential impact on the electric distribution network, which would allow for a utility to make better decisions about allocating prestorm resources. © 2016 Society for Risk Analysis.

Tank waste remediation system architecture tree; TOPICAL

International Nuclear Information System (INIS)

PECK, L.G.

1999-01-01

The TWRS Architecture Tree presented in this document is a hierarchical breakdown to support the TWRS systems engineering analysis of the TWRS physical system, including facilities, hardware and software. The purpose for this systems engineering architecture tree is to describe and communicate the system's selected and existing architecture, to provide a common structure to improve the integration of work and resulting products, and to provide a framework as a basis for TWRS Specification Tree development

The algebra of the general Markov model on phylogenetic trees and networks.

Science.gov (United States)

Sumner, J G; Holland, B R; Jarvis, P D

2012-04-01

It is known that the Kimura 3ST model of sequence evolution on phylogenetic trees can be extended quite naturally to arbitrary split systems. However, this extension relies heavily on mathematical peculiarities of the associated Hadamard transformation, and providing an analogous augmentation of the general Markov model has thus far been elusive. In this paper, we rectify this shortcoming by showing how to extend the general Markov model on trees to include incompatible edges; and even further to more general network models. This is achieved by exploring the algebra of the generators of the continuous-time Markov chain together with the “splitting” operator that generates the branching process on phylogenetic trees. For simplicity, we proceed by discussing the two state case and then show that our results are easily extended to more states with little complication. Intriguingly, upon restriction of the two state general Markov model to the parameter space of the binary symmetric model, our extension is indistinguishable from the Hadamard approach only on trees; as soon as any incompatible splits are introduced the two approaches give rise to differing probability distributions with disparate structure. Through exploration of a simple example, we give an argument that our extension to more general networks has desirable properties that the previous approaches do not share. In particular, our construction allows for convergent evolution of previously divergent lineages; a property that is of significant interest for biological applications.

Optimization of matrix tablets controlled drug release using Elman dynamic neural networks and decision trees.

Science.gov (United States)

Petrović, Jelena; Ibrić, Svetlana; Betz, Gabriele; Đurić, Zorica

2012-05-30

The main objective of the study was to develop artificial intelligence methods for optimization of drug release from matrix tablets regardless of the matrix type. Static and dynamic artificial neural networks of the same topology were developed to model dissolution profiles of different matrix tablets types (hydrophilic/lipid) using formulation composition, compression force used for tableting and tablets porosity and tensile strength as input data. Potential application of decision trees in discovering knowledge from experimental data was also investigated. Polyethylene oxide polymer and glyceryl palmitostearate were used as matrix forming materials for hydrophilic and lipid matrix tablets, respectively whereas selected model drugs were diclofenac sodium and caffeine. Matrix tablets were prepared by direct compression method and tested for in vitro dissolution profiles. Optimization of static and dynamic neural networks used for modeling of drug release was performed using Monte Carlo simulations or genetic algorithms optimizer. Decision trees were constructed following discretization of data. Calculated difference (f(1)) and similarity (f(2)) factors for predicted and experimentally obtained dissolution profiles of test matrix tablets formulations indicate that Elman dynamic neural networks as well as decision trees are capable of accurate predictions of both hydrophilic and lipid matrix tablets dissolution profiles. Elman neural networks were compared to most frequently used static network, Multi-layered perceptron, and superiority of Elman networks have been demonstrated. Developed methods allow simple, yet very precise way of drug release predictions for both hydrophilic and lipid matrix tablets having controlled drug release. Copyright © 2012 Elsevier B.V. All rights reserved.

MCBT: Multi-Hop Cluster Based Stable Backbone Trees for Data Collection and Dissemination in WSNs

Directory of Open Access Journals (Sweden)

Tae-Jin Lee

2009-07-01

Full Text Available We propose a stable backbone tree construction algorithm using multi-hop clusters for wireless sensor networks (WSNs. The hierarchical cluster structure has advantages in data fusion and aggregation. Energy consumption can be decreased by managing nodes with cluster heads. Backbone nodes, which are responsible for performing and managing multi-hop communication, can reduce the communication overhead such as control traffic and minimize the number of active nodes. Previous backbone construction algorithms, such as Hierarchical Cluster-based Data Dissemination (HCDD and Multicluster, Mobile, Multimedia radio network (MMM, consume energy quickly. They are designed without regard to appropriate factors such as residual energy and degree (the number of connections or edges to other nodes of a node for WSNs. Thus, the network is quickly disconnected or has to reconstruct a backbone. We propose a distributed algorithm to create a stable backbone by selecting the nodes with higher energy or degree as the cluster heads. This increases the overall network lifetime. Moreover, the proposed method balances energy consumption by distributing the traffic load among nodes around the cluster head. In the simulation, the proposed scheme outperforms previous clustering schemes in terms of the average and the standard deviation of residual energy or degree of backbone nodes, the average residual energy of backbone nodes after disseminating the sensed data, and the network lifetime.

An effective fractal-tree closure model for simulating blood flow in large arterial networks.

Science.gov (United States)

Perdikaris, Paris; Grinberg, Leopold; Karniadakis, George Em

2015-06-01

The aim of the present work is to address the closure problem for hemodynamic simulations by developing a flexible and effective model that accurately distributes flow in the downstream vasculature and can stably provide a physiological pressure outflow boundary condition. To achieve this goal, we model blood flow in the sub-pixel vasculature by using a non-linear 1D model in self-similar networks of compliant arteries that mimic the structure and hierarchy of vessels in the meso-vascular regime (radii [Formula: see text]). We introduce a variable vessel length-to-radius ratio for small arteries and arterioles, while also addressing non-Newtonian blood rheology and arterial wall viscoelasticity effects in small arteries and arterioles. This methodology aims to overcome substantial cut-off radius sensitivities, typically arising in structured tree and linearized impedance models. The proposed model is not sensitive to outflow boundary conditions applied at the end points of the fractal network, and thus does not require calibration of resistance/capacitance parameters typically required for outflow conditions. The proposed model convergences to a periodic state in two cardiac cycles even when started from zero-flow initial conditions. The resulting fractal-trees typically consist of thousands to millions of arteries, posing the need for efficient parallel algorithms. To this end, we have scaled up a Discontinuous Galerkin solver that utilizes the MPI/OpenMP hybrid programming paradigm to thousands of computer cores, and can simulate blood flow in networks of millions of arterial segments at the rate of one cycle per 5 min. The proposed model has been extensively tested on a large and complex cranial network with 50 parent, patient-specific arteries and 21 outlets to which fractal trees where attached, resulting to a network of up to 4,392,484 vessels in total, and a detailed network of the arm with 276 parent arteries and 103 outlets (a total of 702,188 vessels

A Novel CAN Tree Coordinate Routing in Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao Li

2014-09-01

Full Text Available In this paper, we propose a novel approach to improve coordination routing while minimizing the maintenance overhead during nodes churn. It bases on “CAN Tree Routing for Content- Addressable Network” 1 which is a solution for peer-to-peer routing. We concentrated on coordinate routing in this paper. The key idea of our approach is a recursion process to calculate target zone code and search in CAN tree 1. Because the hops are via long links in CAN, it enhances routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is , which is much better than a uniform greedy routing, while each node maintains two long links in average.

Statistical Significance for Hierarchical Clustering

Science.gov (United States)

Kimes, Patrick K.; Liu, Yufeng; Hayes, D. Neil; Marron, J. S.

2017-01-01

Summary Cluster analysis has proved to be an invaluable tool for the exploratory and unsupervised analysis of high dimensional datasets. Among methods for clustering, hierarchical approaches have enjoyed substantial popularity in genomics and other fields for their ability to simultaneously uncover multiple layers of clustering structure. A critical and challenging question in cluster analysis is whether the identified clusters represent important underlying structure or are artifacts of natural sampling variation. Few approaches have been proposed for addressing this problem in the context of hierarchical clustering, for which the problem is further complicated by the natural tree structure of the partition, and the multiplicity of tests required to parse the layers of nested clusters. In this paper, we propose a Monte Carlo based approach for testing statistical significance in hierarchical clustering which addresses these issues. The approach is implemented as a sequential testing procedure guaranteeing control of the family-wise error rate. Theoretical justification is provided for our approach, and its power to detect true clustering structure is illustrated through several simulation studies and applications to two cancer gene expression datasets. PMID:28099990

Reasoning about Evolution's Grand Patterns: College Students' Understanding of the Tree of Life

Science.gov (United States)

Novick, Laura R.; Catley, Kefyn M.

2013-01-01

Tree thinking involves using cladograms, hierarchical diagrams depicting the evolutionary history of a set of taxa, to reason about evolutionary relationships and support inferences. Tree thinking is indispensable in modern science. College students' tree-thinking skills were investigated using tree (much more common in professional biology) and…

Hierarchically organized layout for visualization of biochemical pathways.

Science.gov (United States)

Tsay, Jyh-Jong; Wu, Bo-Liang; Jeng, Yu-Sen

2010-01-01

Many complex pathways are described as hierarchical structures in which a pathway is recursively partitioned into several sub-pathways, and organized hierarchically as a tree. The hierarchical structure provides a natural way to visualize the global structure of a complex pathway. However, none of the previous research on pathway visualization explores the hierarchical structures provided by many complex pathways. In this paper, we aim to develop algorithms that can take advantages of hierarchical structures, and give layouts that explore the global structures as well as local structures of pathways. We present a new hierarchically organized layout algorithm to produce layouts for hierarchically organized pathways. Our algorithm first decomposes a complex pathway into sub-pathway groups along the hierarchical organization, and then partition each sub-pathway group into basic components. It then applies conventional layout algorithms, such as hierarchical layout and force-directed layout, to compute the layout of each basic component. Finally, component layouts are joined to form a final layout of the pathway. Our main contribution is the development of algorithms for decomposing pathways and joining layouts. Experiment shows that our algorithm is able to give comprehensible visualization for pathways with hierarchies, cycles as well as complex structures. It clearly renders the global component structures as well as the local structure in each component. In addition, it runs very fast, and gives better visualization for many examples from previous related research. 2009 Elsevier B.V. All rights reserved.

Identifying failure in a tree network of a parallel computer

Science.gov (United States)

Archer, Charles J.; Pinnow, Kurt W.; Wallenfelt, Brian P.

2010-08-24

Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

Virtual Network Embedding via Monte Carlo Tree Search.

Science.gov (United States)

Haeri, Soroush; Trajkovic, Ljiljana

2018-02-01

Network virtualization helps overcome shortcomings of the current Internet architecture. The virtualized network architecture enables coexistence of multiple virtual networks (VNs) on an existing physical infrastructure. VN embedding (VNE) problem, which deals with the embedding of VN components onto a physical network, is known to be -hard. In this paper, we propose two VNE algorithms: MaVEn-M and MaVEn-S. MaVEn-M employs the multicommodity flow algorithm for virtual link mapping while MaVEn-S uses the shortest-path algorithm. They formalize the virtual node mapping problem by using the Markov decision process (MDP) framework and devise action policies (node mappings) for the proposed MDP using the Monte Carlo tree search algorithm. Service providers may adjust the execution time of the MaVEn algorithms based on the traffic load of VN requests. The objective of the algorithms is to maximize the profit of infrastructure providers. We develop a discrete event VNE simulator to implement and evaluate performance of MaVEn-M, MaVEn-S, and several recently proposed VNE algorithms. We introduce profitability as a new performance metric that captures both acceptance and revenue to cost ratios. Simulation results show that the proposed algorithms find more profitable solutions than the existing algorithms. Given additional computation time, they further improve embedding solutions.

Fault-Tree Modeling of Safety-Critical Network Communication in a Digitalized Nuclear Power Plant

Energy Technology Data Exchange (ETDEWEB)

Lee, Sang Hun; Kang, Hyun Gook [KAIST, Daejeon (Korea, Republic of)

2015-10-15

To achieve technical self-reliance for nuclear I and C systems in Korea, the Advanced Power Reactor 1400 (APR-1400) man-machine interface system (MMIS) architecture was developed by the Korea Atomic Energy Research Institute (KAERI). As one of the systems in the developed MMIS architecture, the Engineered Safety Feature-Component Control System (ESF-CCS) employs a network communication system for the transmission of safety-critical information from group controllers (GCs) to loop controllers (LCs) to effectively accommodate the vast number of field controllers. The developed fault-tree model was then applied to several case studies. As an example of the development of a fault-tree model for ESF-CCS signal failure, the fault-tree model of ESF-CCS signal failure for CS pump PP01A in the CSAS condition was designed by considering the identified hazardous states of network failure that would result in a failure to provide input signals to the corresponding LC. The quantitative results for four case studies demonstrated that the probability of overall network communication failure, which was calculated as the sum of the failure probability associated with each failure cause, contributes up to 1.88% of the probability of ESF-CCS signal failure for the CS pump considered in the case studies.

On Directed Edge-Disjoint Spanning Trees in Product Networks, An Algorithmic Approach

Directory of Open Access Journals (Sweden)

A.R. Touzene

2014-12-01

Full Text Available In (Ku et al. 2003, the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n1+n2-1 of EDSTs in product network of two graphs, where factor graphs have respectively n1 and n2 EDSTs. In this paper, we propose a new systematic and algorithmic approach to construct (n1+n2 directed routed EDST in the product networks. The direction of an edge is added to support bidirectional links in interconnection networks. Our EDSTs can be used straightforward to develop efficient collective communication algorithms for both models store-and-forward and wormhole.

Reconstructing missing daily precipitation data using regression trees and artificial neural networks

Science.gov (United States)

Incomplete meteorological data has been a problem in environmental modeling studies. The objective of this work was to develop a technique to reconstruct missing daily precipitation data in the central part of Chesapeake Bay Watershed using regression trees (RT) and artificial neural networks (ANN)....

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.

Mobility-aware Hybrid Synchronization for Wireless Sensor Network

DEFF Research Database (Denmark)

Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

2015-01-01

Random mobility of node causes the frequent changes in the network dynamics causing the increased cost in terms of energy and bandwidth. It needs the additional efforts to synchronize the activities of nodes during data collection and transmission in Wireless Sensor Networks (WSNs). A key challenge...... in maintaining the effective data collection and transmission is to schedule and synchronize the activities of the nodes with the global clock. This paper proposes the Mobility-aware Hybrid Synchronization Algorithm (MHS) which works on the formation of cluster based on spanning tree mechanism (SPT). Nodes used...... for formation of the network have random mobility and heterogeneous in terms of energy with static sink. The nodes in the cluster and cluster heads in the network are synchronized with the notion of global time scale. In the initial stage, the algorithm establishes the hierarchical structure of the network...

Hierarchical architecture of active knits

International Nuclear Information System (INIS)

Abel, Julianna; Luntz, Jonathan; Brei, Diann

2013-01-01

Nature eloquently utilizes hierarchical structures to form the world around us. Applying the hierarchical architecture paradigm to smart materials can provide a basis for a new genre of actuators which produce complex actuation motions. One promising example of cellular architecture—active knits—provides complex three-dimensional distributed actuation motions with expanded operational performance through a hierarchically organized structure. The hierarchical structure arranges a single fiber of active material, such as shape memory alloys (SMAs), into a cellular network of interlacing adjacent loops according to a knitting grid. This paper defines a four-level hierarchical classification of knit structures: the basic knit loop, knit patterns, grid patterns, and restructured grids. Each level of the hierarchy provides increased architectural complexity, resulting in expanded kinematic actuation motions of active knits. The range of kinematic actuation motions are displayed through experimental examples of different SMA active knits. The results from this paper illustrate and classify the ways in which each level of the hierarchical knit architecture leverages the performance of the base smart material to generate unique actuation motions, providing necessary insight to best exploit this new actuation paradigm. (paper)

Hierarchical Broadcasting in the Future Mobile Internet

NARCIS (Netherlands)

Hesselman, C.E.W.; Eertink, E.H.; Fernandez, Milagros; Crnkovic, Ivica; Fohler, Gerhard; Griwodz, Carsten; Plagemann, Thomas; Gruenbacher, Paul

2002-01-01

We describe an architecture for the hierarchical distribution of multimedia broadcasts in the future mobile Internet. The architecture supports network as well as application-layer mobility solutions, and uses stream control functions that are influenced by available network resources, user-defined

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.

3D NEAREST NEIGHBOUR SEARCH USING A CLUSTERED HIERARCHICAL TREE STRUCTURE

Directory of Open Access Journals (Sweden)

A. Suhaibah

2016-06-01

Full Text Available Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.

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.

Stochastic lumping analysis for linear kinetics and its application to the fluctuation relations between hierarchical kinetic networks

Energy Technology Data Exchange (ETDEWEB)

Deng, De-Ming; Chang, Cheng-Hung [Institute of Physics, National Chiao Tung University, Hsinchu 300, Taiwan (China)

2015-05-14

Conventional studies of biomolecular behaviors rely largely on the construction of kinetic schemes. Since the selection of these networks is not unique, a concern is raised whether and under which conditions hierarchical schemes can reveal the same experimentally measured fluctuating behaviors and unique fluctuation related physical properties. To clarify these questions, we introduce stochasticity into the traditional lumping analysis, generalize it from rate equations to chemical master equations and stochastic differential equations, and extract the fluctuation relations between kinetically and thermodynamically equivalent networks under intrinsic and extrinsic noises. The results provide a theoretical basis for the legitimate use of low-dimensional models in the studies of macromolecular fluctuations and, more generally, for exploring stochastic features in different levels of contracted networks in chemical and biological kinetic systems.

Stochastic lumping analysis for linear kinetics and its application to the fluctuation relations between hierarchical kinetic networks.

Science.gov (United States)

Deng, De-Ming; Chang, Cheng-Hung

2015-05-14

Conventional studies of biomolecular behaviors rely largely on the construction of kinetic schemes. Since the selection of these networks is not unique, a concern is raised whether and under which conditions hierarchical schemes can reveal the same experimentally measured fluctuating behaviors and unique fluctuation related physical properties. To clarify these questions, we introduce stochasticity into the traditional lumping analysis, generalize it from rate equations to chemical master equations and stochastic differential equations, and extract the fluctuation relations between kinetically and thermodynamically equivalent networks under intrinsic and extrinsic noises. The results provide a theoretical basis for the legitimate use of low-dimensional models in the studies of macromolecular fluctuations and, more generally, for exploring stochastic features in different levels of contracted networks in chemical and biological kinetic systems.

System Analysis by Mapping a Fault-tree into a Bayesian-network

Science.gov (United States)

Sheng, B.; Deng, C.; Wang, Y. H.; Tang, L. H.

2018-05-01

In view of the limitations of fault tree analysis in reliability assessment, Bayesian Network (BN) has been studied as an alternative technology. After a brief introduction to the method for mapping a Fault Tree (FT) into an equivalent BN, equations used to calculate the structure importance degree, the probability importance degree and the critical importance degree are presented. Furthermore, the correctness of these equations is proved mathematically. Combining with an aircraft landing gear’s FT, an equivalent BN is developed and analysed. The results show that richer and more accurate information have been achieved through the BN method than the FT, which demonstrates that the BN is a superior technique in both reliability assessment and fault diagnosis.

Function-centered modeling of engineering systems using the goal tree-success tree technique and functional primitives

International Nuclear Information System (INIS)

Modarres, Mohammad; Cheon, Se Woo

1999-01-01

Most of the complex systems are formed through some hierarchical evolution. Therefore, those systems can be best described through hierarchical frameworks. This paper describes some fundamental attributes of complex physical systems and several hierarchies such as functional, behavioral, goal/condition, and event hierarchies, then presents a function-centered approach to system modeling. Based on the function-centered concept, this paper describes the joint goal tree-success tree (GTST) and the master logic diagram (MLD) as a framework for developing models of complex physical systems. A function-based lexicon for classifying the most common elements of engineering systems for use in the GTST-MLD framework has been proposed. The classification is based on the physical conservation laws that govern the engineering systems. Functional descriptions based on conservation laws provide a simple and rich vocabulary for modeling complex engineering systems

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.

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

KAUST Repository

Ringk, Andreas; Lignie, Adrien; Hou, Yuanfang; Alshareef, Husam N.; Beaujuge, Pierre

2016-01-01

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.

Scale free effects in world currency exchange network

Science.gov (United States)

Górski, A. Z.; Drożdż, S.; Kwapień, J.

2008-11-01

A large collection of daily time series for 60 world currencies' exchange rates is considered. The correlation matrices are calculated and the corresponding Minimal Spanning Tree (MST) graphs are constructed for each of those currencies used as reference for the remaining ones. It is shown that multiplicity of the MST graphs' nodes to a good approximation develops a power like, scale free distribution with the scaling exponent similar as for several other complex systems studied so far. Furthermore, quantitative arguments in favor of the hierarchical organization of the world currency exchange network are provided by relating the structure of the above MST graphs and their scaling exponents to those that are derived from an exactly solvable hierarchical network model. A special status of the USD during the period considered can be attributed to some departures of the MST features, when this currency (or some other tied to it) is used as reference, from characteristics typical to such a hierarchical clustering of nodes towards those that correspond to the random graphs. Even though in general the basic structure of the MST is robust with respect to changing the reference currency some trace of a systematic transition from somewhat dispersed - like the USD case - towards more compact MST topology can be observed when correlations increase.

The Tree of Industrial Life

DEFF Research Database (Denmark)

Andersen, Esben Sloth

2002-01-01

The purpose of this paper is to bring forth an interaction between evolutionary economics and industrial systematics. The suggested solution is to reconstruct the "family tree" of the industries. Such a tree is based on similarities, but it may also reflect the evolutionary history in industries....... For this purpose the paper shows how matrices of input-output coefficients can be transformed into binary characteristics matrices and to distance matrices, and it also discusses the possible evolutionary meaning of this translation. Then these derived matrices are used as inputs to algorithms for the heuristic...... finding of optimal industrial trees. The results are presented as taxonomic trees that can easily be compared with the hierarchical structure of existing systems of industrial classification....

A Hybrid Shared-Memory Parallel Max-Tree Algorithm for Extreme Dynamic-Range Images

NARCIS (Netherlands)

Moschini, Ugo; Meijster, Arnold; Wilkinson, Michael

Max-trees, or component trees, are graph structures that represent the connected components of an image in a hierarchical way. Nowadays, many application fields rely on images with high-dynamic range or floating point values. Efficient sequential algorithms exist to build trees and compute

From Gene Trees to a Dated Allopolyploid Network: Insights from the Angiosperm Genus Viola (Violaceae)

Science.gov (United States)

Marcussen, Thomas; Heier, Lise; Brysting, Anne K.; Oxelman, Bengt; Jakobsen, Kjetill S.

2015-01-01

Allopolyploidization accounts for a significant fraction of speciation events in many eukaryotic lineages. However, existing phylogenetic and dating methods require tree-like topologies and are unable to handle the network-like phylogenetic relationships of lineages containing allopolyploids. No explicit framework has so far been established for evaluating competing network topologies, and few attempts have been made to date phylogenetic networks. We used a four-step approach to generate a dated polyploid species network for the cosmopolitan angiosperm genus Viola L. (Violaceae Batch.). The genus contains ca 600 species and both recent (neo-) and more ancient (meso-) polyploid lineages distributed over 16 sections. First, we obtained DNA sequences of three low-copy nuclear genes and one chloroplast region, from 42 species representing all 16 sections. Second, we obtained fossil-calibrated chronograms for each nuclear gene marker. Third, we determined the most parsimonious multilabeled genome tree and its corresponding network, resolved at the section (not the species) level. Reconstructing the “correct” network for a set of polyploids depends on recovering all homoeologs, i.e., all subgenomes, in these polyploids. Assuming the presence of Viola subgenome lineages that were not detected by the nuclear gene phylogenies (“ghost subgenome lineages”) significantly reduced the number of inferred polyploidization events. We identified the most parsimonious network topology from a set of five competing scenarios differing in the interpretation of homoeolog extinctions and lineage sorting, based on (i) fewest possible ghost subgenome lineages, (ii) fewest possible polyploidization events, and (iii) least possible deviation from expected ploidy as inferred from available chromosome counts of the involved polyploid taxa. Finally, we estimated the homoploid and polyploid speciation times of the most parsimonious network. Homoploid speciation times were estimated by

Value tree analysis

International Nuclear Information System (INIS)

Keeney, R.; Renn, O.; Winterfeldt, D. von; Kotte, U.

1985-01-01

What are the targets and criteria on which national energy policy should be based. What priorities should be set, and how can different social interests be matched. To answer these questions, a new instrument of decision theory is presented which has been applied with good results to controversial political issues in the USA. The new technique is known under the name of value tree analysis. Members of important West German organisations (BDI, VDI, RWE, the Catholic and Protestant Church, Deutscher Naturschutzring, and ecological research institutions) were asked about the goals of their organisations. These goals were then ordered systematically and arranged in a hierarchical tree structure. The value trees of different groups can be combined into a catalogue of social criteria of acceptability and policy assessment. The authors describe the philosophy and methodology of value tree analysis and give an outline of its application in the development of a socially acceptable energy policy. (orig.) [de

Forward modeling of tree-ring data: a case study with a global network

Science.gov (United States)

Breitenmoser, P. D.; Frank, D.; Brönnimann, S.

2012-04-01

Information derived from tree-rings is one of the most powerful tools presently available for studying past climatic variability as well as identifying fundamental relationships between tree-growth and climate. Climate reconstructions are typically performed by extending linear relationships, established during the overlapping period of instrumental and climate proxy archives into the past. Such analyses, however, are limited by methodological assumptions, including stationarity and linearity of the climate-proxy relationship. We investigate climate and tree-ring data using the Vaganov-Shashkin-Lite (VS-Lite) forward model of tree-ring width formation to examine the relations among actual tree growth and climate (as inferred from the simulated chronologies) to reconstruct past climate variability. The VS-lite model has been shown to produce skill comparable to that achieved using classical dendrochronological statistical modeling techniques when applied on simulations of a network of North American tree-ring chronologies. Although the detailed mechanistic processes such as photosynthesis, storage, or cell processes are not modeled directly, the net effect of the dominating nonlinear climatic controls on tree-growth are implemented into the model by the principle of limiting factors and threshold growth response functions. The VS-lite model requires as inputs only latitude, monthly mean temperature and monthly accumulated precipitation. Hence, this simple, process-based model enables ring-width simulation at any location where monthly climate records exist. In this study, we analyse the growth response of simulated tree-rings to monthly climate conditions obtained from the 20th century reanalysis project back to 1871. These simulated tree-ring chronologies are compared to the climate-driven variability in worldwide observed tree-ring chronologies from the International Tree Ring Database. Results point toward the suitability of the relationship among actual tree

Constructing phylogenetic trees using interacting pathways.

Science.gov (United States)

Wan, Peng; Che, Dongsheng

2013-01-01

Phylogenetic trees are used to represent evolutionary relationships among biological species or organisms. The construction of phylogenetic trees is based on the similarities or differences of their physical or genetic features. Traditional approaches of constructing phylogenetic trees mainly focus on physical features. The recent advancement of high-throughput technologies has led to accumulation of huge amounts of biological data, which in turn changed the way of biological studies in various aspects. In this paper, we report our approach of building phylogenetic trees using the information of interacting pathways. We have applied hierarchical clustering on two domains of organisms-eukaryotes and prokaryotes. Our preliminary results have shown the effectiveness of using the interacting pathways in revealing evolutionary relationships.

Automated method for identification and artery-venous classification of vessel trees in retinal vessel networks.

Science.gov (United States)

Joshi, Vinayak S; Reinhardt, Joseph M; Garvin, Mona K; Abramoff, Michael D

2014-01-01

The separation of the retinal vessel network into distinct arterial and venous vessel trees is of high interest. We propose an automated method for identification and separation of retinal vessel trees in a retinal color image by converting a vessel segmentation image into a vessel segment map and identifying the individual vessel trees by graph search. Orientation, width, and intensity of each vessel segment are utilized to find the optimal graph of vessel segments. The separated vessel trees are labeled as primary vessel or branches. We utilize the separated vessel trees for arterial-venous (AV) classification, based on the color properties of the vessels in each tree graph. We applied our approach to a dataset of 50 fundus images from 50 subjects. The proposed method resulted in an accuracy of 91.44% correctly classified vessel pixels as either artery or vein. The accuracy of correctly classified major vessel segments was 96.42%.

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

Transparent conducting films of hierarchically nanostructured polyaniline networks on flexible substrates for high-performance gas sensors.

Science.gov (United States)

Bai, Shouli; Sun, Chaozheng; Wan, Pengbo; Wang, Cheng; Luo, Ruixian; Li, Yaping; Liu, Junfeng; Sun, Xiaoming

2015-01-21

Transparent chemical gas sensors are assembled from a transparent conducting film of hierarchically nanostructured polyaniline (PANI) networks fabricated on a flexible PET substrate, by coating silver nanowires (Ag NWs) followed by the in situ polymerization of aniline near the sacrificial Ag NW template. The sensor exhibits enhanced gas sensing performance at room temperature in both sensitivity and selectivity to NH3 compared to pure PANI film. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Distribution of cavity trees in midwestern old-growth and second-growth forests

Science.gov (United States)

Zhaofei Fan; Stephen R. Shifley; Martin A. Spetich; Frank R. Thompson; David R. Larsen

2003-01-01

We used classification and regression tree analysis to determine the primary variables associated with the occurrence of cavity trees and the hierarchical structure among those variables. We applied that information to develop logistic models predicting cavity tree probability as a function of diameter, species group, and decay class. Inventories of cavity abundance in...

Repeated measures from FIA data facilitates analysis across spatial scales of tree growth responses to nitrogen deposition from individual trees to whole ecoregions

Science.gov (United States)

Charles H. (Hobie) Perry; Kevin J. Horn; R. Quinn Thomas; Linda H. Pardo; Erica A.H. Smithwick; Doug Baldwin; Gregory B. Lawrence; Scott W. Bailey; Sabine Braun; Christopher M. Clark; Mark Fenn; Annika Nordin; Jennifer N. Phelan; Paul G. Schaberg; Sam St. Clair; Richard Warby; Shaun Watmough; Steven S. Perakis

2015-01-01

The abundance of temporally and spatially consistent Forest Inventory and Analysis data facilitates hierarchical/multilevel analysis to investigate factors affecting tree growth, scaling from plot-level to continental scales. Herein we use FIA tree and soil inventories in conjunction with various spatial climate and soils data to estimate species-specific responses of...

Ensuring Data Storage Security in Tree cast Routing Architecture for Sensor Networks

Science.gov (United States)

Kumar, K. E. Naresh; Sagar, U. Vidya; Waheed, Mohd. Abdul

2010-10-01

In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, this routing architecture moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this paper, we focus on data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in this architecture, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server

Hierarchical self-organization of non-cooperating individuals.

Directory of Open Access Journals (Sweden)

Tamás Nepusz

Full Text Available Hierarchy is one of the most conspicuous features of numerous natural, technological and social systems. The underlying structures are typically complex and their most relevant organizational principle is the ordering of the ties among the units they are made of according to a network displaying hierarchical features. In spite of the abundant presence of hierarchy no quantitative theoretical interpretation of the origins of a multi-level, knowledge-based social network exists. Here we introduce an approach which is capable of reproducing the emergence of a multi-levelled network structure based on the plausible assumption that the individuals (representing the nodes of the network can make the right estimate about the state of their changing environment to a varying degree. Our model accounts for a fundamental feature of knowledge-based organizations: the less capable individuals tend to follow those who are better at solving the problems they all face. We find that relatively simple rules lead to hierarchical self-organization and the specific structures we obtain possess the two, perhaps most important features of complex systems: a simultaneous presence of adaptability and stability. In addition, the performance (success score of the emerging networks is significantly higher than the average expected score of the individuals without letting them copy the decisions of the others. The results of our calculations are in agreement with a related experiment and can be useful from the point of designing the optimal conditions for constructing a given complex social structure as well as understanding the hierarchical organization of such biological structures of major importance as the regulatory pathways or the dynamics of neural networks.

Visual exploration of parameter influence on phylogenetic trees.

Science.gov (United States)

Hess, Martin; Bremm, Sebastian; Weissgraeber, Stephanie; Hamacher, Kay; Goesele, Michael; Wiemeyer, Josef; von Landesberger, Tatiana

2014-01-01

Evolutionary relationships between organisms are frequently derived as phylogenetic trees inferred from multiple sequence alignments (MSAs). The MSA parameter space is exponentially large, so tens of thousands of potential trees can emerge for each dataset. A proposed visual-analytics approach can reveal the parameters' impact on the trees. Given input trees created with different parameter settings, it hierarchically clusters the trees according to their structural similarity. The most important clusters of similar trees are shown together with their parameters. This view offers interactive parameter exploration and automatic identification of relevant parameters. Biologists applied this approach to real data of 16S ribosomal RNA and protein sequences of ion channels. It revealed which parameters affected the tree structures. This led to a more reliable selection of the best trees.

Hierarchical anatomical brain networks for MCI prediction: revisiting volumetric measures.

Directory of Open Access Journals (Sweden)

Luping Zhou

results. Without requiring new sources of information, our proposed approach improves the accuracy of MCI prediction from 80.83% (of conventional volumetric features to 84.35% (of hierarchical network features, evaluated using data sets randomly drawn from the ADNI (Alzheimer's Disease Neuroimaging Initiative dataset.

Phylogenetic Trees and Networks Reduce to Phylogenies on Binary States: Does It Furnish an Explanation to the Robustness of Phylogenetic Trees against Lateral Transfers.

Science.gov (United States)

Thuillard, Marc; Fraix-Burnet, Didier

2015-01-01

This article presents an innovative approach to phylogenies based on the reduction of multistate characters to binary-state characters. We show that the reduction to binary characters' approach can be applied to both character- and distance-based phylogenies and provides a unifying framework to explain simply and intuitively the similarities and differences between distance- and character-based phylogenies. Building on these results, this article gives a possible explanation on why phylogenetic trees obtained from a distance matrix or a set of characters are often quite reasonable despite lateral transfers of genetic material between taxa. In the presence of lateral transfers, outer planar networks furnish a better description of evolution than phylogenetic trees. We present a polynomial-time reconstruction algorithm for perfect outer planar networks with a fixed number of states, characters, and lateral transfers.

TreeMAC: Localized TDMA MAC protocol for real-time high-data-rate sensor networks

Science.gov (United States)

Song, W.-Z.; Huang, R.; Shirazi, B.; Husent, R.L.

2009-01-01

Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals. This motivates us to design an innovative localized TDMA MAC protocol to achieve high throughput and low congestion in data collection sensor networks, besides energy conservation. TreeMAC divides a time cycle into frames and frame into slots. Parent determines children's frame assigmnent based on their relative bandwidth demand, and each node calculates its own slot assignment based on its hop-count to the sink. This innovative 2-dimensional frame-slot assignment algorithm has the following nice theory properties. Firstly, given any node, at any time slot, there is at most one active sender in its neighborhood (includ ing itself). Secondly, the packet scheduling with TreelMAC is bufferless, which therefore minimizes the probability of network congestion. Thirdly, the data throughput to gateway is at least 1/3 of the optimum assuming reliable links. Our experiments on a 24 node test bed demonstrate that TreeMAC protocol significantly improves network throughput and energy efficiency, by comparing to the TinyOS's default CSMA MAC protocol and a recent TDMA MAC protocol Funneling-MAC[8]. ?? 2009 IEEE.

Bayesian neural network modeling of tree-ring temperature variability record from the Western Himalayas

Directory of Open Access Journals (Sweden)

R. K. Tiwari

2011-08-01

Full Text Available A novel technique based on the Bayesian neural network (BNN theory is developed and employed to model the temperature variation record from the Western Himalayas. In order to estimate an a posteriori probability function, the BNN is trained with the Hybrid Monte Carlo (HMC/Markov Chain Monte Carlo (MCMC simulations algorithm. The efficacy of the new algorithm is tested on the well known chaotic, first order autoregressive (AR and random models and then applied to model the temperature variation record decoded from the tree-ring widths of the Western Himalayas for the period spanning over 1226–2000 AD. For modeling the actual tree-ring temperature data, optimum network parameters are chosen appropriately and then cross-validation test is performed to ensure the generalization skill of the network on the new data set. Finally, prediction result based on the BNN model is compared with the conventional artificial neural network (ANN and the AR linear models results. The comparative results show that the BNN based analysis makes better prediction than the ANN and the AR models. The new BNN modeling approach provides a viable tool for climate studies and could also be exploited for modeling other kinds of environmental data.

Steiner trees in industry

CERN Document Server

Du, Ding-Zhu

2001-01-01

This book is a collection of articles studying various Steiner tree prob­ lems with applications in industries, such as the design of electronic cir­ cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect­ ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Sch...

Energy-efficient multicast traffic grooming strategy based on light-tree splitting for elastic optical networks

Science.gov (United States)

Liu, Huanlin; Yin, Yarui; Chen, Yong

2017-07-01

In order to address the problem of optimizing the spectrum resources and power consumption in elastic optical networks (EONs), we investigate the potential gains by jointly employing the light-tree splitting and traffic grooming for multicast requests. An energy-efficient multicast traffic grooming strategy based on light-tree splitting (EED-MTGS-LS) is proposed in this paper. Firstly, we design a traffic pre-processing mechanism to decide the multicast requests' routing order, which considers the request's bandwidth requirement and physical hops synthetically. Then, by dividing a light-tree to some sub-light-trees and grooming the request to these sub-light-trees, the light-tree sharing ratios of multicast requests can be improved. What's more, a priority scheduling vector is constructed, which aims to improve the success rate of spectrum assignment for grooming requests. Finally, a grooming strategy is designed to optimize the total power consumption by reducing the use of transponders and IP routers during routing. Simulation results show that the proposed strategy can significantly improve the spectrum utilization and save the power consumption.

Boosted decision trees as an alternative to artificial neural networks for particle identification

International Nuclear Information System (INIS)

Roe, Byron P.; Yang Haijun; Zhu Ji; Liu Yong; Stancu, Ion; McGregor, Gordon

2005-01-01

The efficacy of particle identification is compared using artificial neutral networks and boosted decision trees. The comparison is performed in the context of the MiniBooNE, an experiment at Fermilab searching for neutrino oscillations. Based on studies of Monte Carlo samples of simulated data, particle identification with boosting algorithms has better performance than that with artificial neural networks for the MiniBooNE experiment. Although the tests in this paper were for one experiment, it is expected that boosting algorithms will find wide application in physics

Performance Analysis of Embedded Zero Tree and Set Partitioning in Hierarchical Tree

OpenAIRE

Pardeep Singh; Nivedita; Dinesh Gupta; Sugandha Sharma

2012-01-01

Compressing an image is significantly different than compressing raw binary data. For this different compression algorithm are used to compress images. Discrete wavelet transform has been widely used to compress the image. Wavelet transform are very powerful compared to other transform because its ability to describe any type of signals both in time and frequency domain simultaneously. The proposed schemes investigate the performance evaluation of embedded zero tree and wavelet based compress...

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

Phylogenetic Trees and Networks Reduce to Phylogenies on Binary States: Does It Furnish an Explanation to the Robustness of Phylogenetic Trees against Lateral Transfers

Science.gov (United States)

Thuillard, Marc; Fraix-Burnet, Didier

2015-01-01

This article presents an innovative approach to phylogenies based on the reduction of multistate characters to binary-state characters. We show that the reduction to binary characters’ approach can be applied to both character- and distance-based phylogenies and provides a unifying framework to explain simply and intuitively the similarities and differences between distance- and character-based phylogenies. Building on these results, this article gives a possible explanation on why phylogenetic trees obtained from a distance matrix or a set of characters are often quite reasonable despite lateral transfers of genetic material between taxa. In the presence of lateral transfers, outer planar networks furnish a better description of evolution than phylogenetic trees. We present a polynomial-time reconstruction algorithm for perfect outer planar networks with a fixed number of states, characters, and lateral transfers. PMID:26508826

The network organisation of consumer complaints

Science.gov (United States)

Rocha, L. E. C.; Holme, P.

2010-07-01

Interaction between consumers and companies can create conflict. When a consensus is unreachable there are legal authorities to resolve the case. This letter is a study of data from the Brazilian Department of Justice from which we build a bipartite network of categories of complaints linked to the companies receiving those complaints. We find the complaint categories organised in an hierarchical way where companies only get complaints of lower degree if they already got complaints of higher degree. The fraction of resolved complaints for a company appears to be nearly independent of the equity of the company but is positively correlated with the total number of complaints received. We construct feature vectors based on the edge-weight —the weight of an edge represents the times complaints of a category have been filed against that company— and use these vectors to study the similarity between the categories of complaints. From this analysis, we obtain trees mapping the hierarchical organisation of the complaints. We also apply principal component analysis to the set of feature vectors concluding that a reduction of the dimensionality of these from 8827 to 27 gives an optimal hierarchical representation.

Development of hybrid genetic-algorithm-based neural networks using regression trees for modeling air quality inside a public transportation bus.

Science.gov (United States)

Kadiyala, Akhil; Kaur, Devinder; Kumar, Ashok

2013-02-01

The present study developed a novel approach to modeling indoor air quality (IAQ) of a public transportation bus by the development of hybrid genetic-algorithm-based neural networks (also known as evolutionary neural networks) with input variables optimized from using the regression trees, referred as the GART approach. This study validated the applicability of the GART modeling approach in solving complex nonlinear systems by accurately predicting the monitored contaminants of carbon dioxide (CO2), carbon monoxide (CO), nitric oxide (NO), sulfur dioxide (SO2), 0.3-0.4 microm sized particle numbers, 0.4-0.5 microm sized particle numbers, particulate matter (PM) concentrations less than 1.0 microm (PM10), and PM concentrations less than 2.5 microm (PM2.5) inside a public transportation bus operating on 20% grade biodiesel in Toledo, OH. First, the important variables affecting each monitored in-bus contaminant were determined using regression trees. Second, the analysis of variance was used as a complimentary sensitivity analysis to the regression tree results to determine a subset of statistically significant variables affecting each monitored in-bus contaminant. Finally, the identified subsets of statistically significant variables were used as inputs to develop three artificial neural network (ANN) models. The models developed were regression tree-based back-propagation network (BPN-RT), regression tree-based radial basis function network (RBFN-RT), and GART models. Performance measures were used to validate the predictive capacity of the developed IAQ models. The results from this approach were compared with the results obtained from using a theoretical approach and a generalized practicable approach to modeling IAQ that included the consideration of additional independent variables when developing the aforementioned ANN models. The hybrid GART models were able to capture majority of the variance in the monitored in-bus contaminants. The genetic

Myocardial Perfusion: Characteristics of Distal Intramyocardial Arteriolar Trees.

Science.gov (United States)

Zamir, Mair; Vercnocke, Andrew J; Edwards, Phillip K; Anderson, Jill L; Jorgensen, Steven M; Ritman, Erik L

2015-11-01

A combination of experimental, theoretical, and imaging methodologies is used to examine the hierarchical structure and function of intramyocardial arteriolar trees in porcine hearts to provide a window onto a region of myocardial microvasculature which has been difficult to fully explore so far. A total of 66 microvascular trees from 6 isolated myocardial specimens were analyzed, with a cumulative number of 2438 arteriolar branches greater than or equal to 40 μm lumen diameter. The distribution of flow rates within each tree was derived from an assumed power law relationship for that tree between the diameter of vessel segments and flow rates that are consistent with that power law and subject to conservation of mass along hierarchical structure of the tree. The results indicate that the power law index increases at levels of arteriolar vasculature closer to the capillary level, consistent with a concomitant decrease in shear stress acting on endothelial tissue. These results resolve a long standing predicament which could not be resolved previously because of lack of data about the 3D, interconnected, arterioles. In the context of myocardial perfusion, the results indicate that the coefficient of variation of flow rate in pre-capillary distal arterioles is high, suggesting that heterogeneity of flow rate in these arterioles is not entirely random but may be due at least in part to active control.

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.

Hierarchical artificial bee colony algorithm for RFID network planning optimization.

Science.gov (United States)

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

2014-01-01

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

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

dependencies between the number of nodes and the distances in the structures. The perfect square mesh is introduced for hierarchies, and it is shown that applying ordered hierarchies in this way results in logarithmic dependencies between the number of nodes and the distances, resulting in better scaling...... structures. For example, in a mesh of 391876 nodes the average distance is reduced from 417.33 to 17.32 by adding hierarchical lines. This is gained by increasing the number of lines by 4.20% compared to the non-hierarchical structure. A similar hierarchical extension of the torus structure also results...

A Dynamic Construction Algorithm for the Compact Patricia Trie Using the Hierarchical Structure.

Science.gov (United States)

Jung, Minsoo; Shishibori, Masami; Tanaka, Yasuhiro; Aoe, Jun-ichi

2002-01-01

Discussion of information retrieval focuses on the use of binary trees and how to compact it to use less memory and take less time. Explains retrieval algorithms and describes data structure and hierarchical structure. (LRW)

A study of hierarchical structure on South China industrial electricity-consumption correlation

Science.gov (United States)

Yao, Can-Zhong; Lin, Ji-Nan; Liu, Xiao-Feng

2016-02-01

Based on industrial electricity-consumption data of five southern provinces of China from 2005 to 2013, we study the industrial correlation mechanism with MST (minimal spanning tree) and HT (hierarchical tree) models. First, we comparatively analyze the industrial electricity-consumption correlation structure in pre-crisis and after-crisis period using MST model and Bootstrap technique of statistical reliability test of links. Results exhibit that all industrial electricity-consumption trees of five southern provinces of China in pre-crisis and after-crisis time are in formation of chain, and the "center-periphery structure" of those chain-like trees is consistent with industrial specialization in classical industrial chain theory. Additionally, the industrial structure of some provinces is reorganized and transferred in pre-crisis and after-crisis time. Further, the comparative analysis with hierarchical tree and Bootstrap technique demonstrates that as for both observations of GD and overall NF, the industrial electricity-consumption correlation is non-significant clustered in pre-crisis period, whereas it turns significant clustered in after-crisis time. Therefore we propose that in perspective of electricity-consumption, their industrial structures are directed to optimized organization and global correlation. Finally, the analysis of distance of HTs verifies that industrial reorganization and development may strengthen market integration, coordination and correlation of industrial production. Except GZ, other four provinces have a shorter distance of industrial electricity-consumption correlation in after-crisis period, revealing a better performance of regional specialization and integration.

Learning Hierarchical User Interest Models from Web Pages

Institute of Scientific and Technical Information of China (English)

无

2006-01-01

We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user's interests. This expression represents a user's specific and general interests as a continuum. In some sense, specific interests correspond to short-term interests, while general interests correspond to long-term interests. So this representation more really reflects the users' interests. The algorithm can automatically model a user's multiple interest domains, dynamically generate the interest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.

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. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A Tree Based Broadcast Scheme for (m, k)-firm Real-Time Stream in Wireless Sensor Networks.

Science.gov (United States)

Park, HoSung; Kim, Beom-Su; Kim, Kyong Hoon; Shah, Babar; Kim, Ki-Il

2017-11-09

Recently, various unicast routing protocols have been proposed to deliver measured data from the sensor node to the sink node within the predetermined deadline in wireless sensor networks. In parallel with their approaches, some applications demand the specific service, which is based on broadcast to all nodes within the deadline, the feasible real-time traffic model and improvements in energy efficiency. However, current protocols based on either flooding or one-to-one unicast cannot meet the above requirements entirely. Moreover, as far as the authors know, there is no study for the real-time broadcast protocol to support the application-specific traffic model in WSN yet. Based on the above analysis, in this paper, we propose a new ( m , k )-firm-based Real-time Broadcast Protocol (FRBP) by constructing a broadcast tree to satisfy the ( m , k )-firm, which is applicable to the real-time model in resource-constrained WSNs. The broadcast tree in FRBP is constructed by the distance-based priority scheme, whereas energy efficiency is improved by selecting as few as nodes on a tree possible. To overcome the unstable network environment, the recovery scheme invokes rapid partial tree reconstruction in order to designate another node as the parent on a tree according to the measured ( m , k )-firm real-time condition and local states monitoring. Finally, simulation results are given to demonstrate the superiority of FRBP compared to the existing schemes in terms of average deadline missing ratio, average throughput and energy consumption.

Systolic trees and systolic language recognition by tree automata

Energy Technology Data Exchange (ETDEWEB)

Steinby, M

1983-01-01

K. Culik II, J. Gruska, A. Salomaa and D. Wood have studied the language recognition capabilities of certain types of systolically operating networks of processors (see research reports Cs-81-32, Cs-81-36 and Cs-82-01, Univ. of Waterloo, Ontario, Canada). In this paper, their model for systolic VLSI trees is formalised in terms of standard tree automaton theory, and the way in which some known facts about recognisable forests and tree transductions can be applied in VLSI tree theory is demonstrated. 13 references.

A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Matheswaran Saravanan

2014-01-01

Full Text Available Wireless sensor network (WSN consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources. WSN routing protocols should enable reliable multihop communication with energy constraints. Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption. In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route. The former gathers data from sensors belonging to the cluster, forwarding them to the sink. The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST. The proposed algorithm computes the distance-based Minimum Spanning Tree (MST of the weighted graph for the multihop network. The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.

Communication Reducing Algorithms for Distributed Hierarchical N-Body Problems with Boundary Distributions

KAUST Repository

AbdulJabbar, Mustafa Abdulmajeed; Markomanolis, George S.; Ibeid, Huda; Yokota, Rio; Keyes, David E.

2017-01-01

-synchronous collective communication of the local essential tree and an RDMA per task per cell. Finally, we take the dynamic sparse data exchange proposed by Hoefler et al. [1] and extend it to a hierarchical sparse data exchange, which is demonstrated at scale

A Depth-Adjustment Deployment Algorithm Based on Two-Dimensional Convex Hull and Spanning Tree for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Peng Jiang

2016-07-01

Full Text Available Most of the existing node depth-adjustment deployment algorithms for underwater wireless sensor networks (UWSNs just consider how to optimize network coverage and connectivity rate. However, these literatures don’t discuss full network connectivity, while optimization of network energy efficiency and network reliability are vital topics for UWSN deployment. Therefore, in this study, a depth-adjustment deployment algorithm based on two-dimensional (2D convex hull and spanning tree (NDACS for UWSNs is proposed. First, the proposed algorithm uses the geometric characteristics of a 2D convex hull and empty circle to find the optimal location of a sleep node and activate it, minimizes the network coverage overlaps of the 2D plane, and then increases the coverage rate until the first layer coverage threshold is reached. Second, the sink node acts as a root node of all active nodes on the 2D convex hull and then forms a small spanning tree gradually. Finally, the depth-adjustment strategy based on time marker is used to achieve the three-dimensional overall network deployment. Compared with existing depth-adjustment deployment algorithms, the simulation results show that the NDACS algorithm can maintain full network connectivity with high network coverage rate, as well as improved network average node degree, thus increasing network reliability.

Energy Analysis of Contention Tree-Based Access Protocols in Dense Machine-to-Machine Area Networks

Directory of Open Access Journals (Sweden)

Francisco Vázquez-Gallego

2015-01-01

Full Text Available Machine-to-Machine (M2M area networks aim at connecting an M2M gateway with a large number of energy-constrained devices that must operate autonomously for years. Therefore, attaining high energy efficiency is essential in the deployment of M2M networks. In this paper, we consider a dense M2M area network composed of hundreds or thousands of devices that periodically transmit data upon request from a gateway or coordinator. We theoretically analyse the devices’ energy consumption using two Medium Access Control (MAC protocols which are based on a tree-splitting algorithm to resolve collisions among devices: the Contention Tree Algorithm (CTA and the Distributed Queuing (DQ access. We have carried out computer-based simulations to validate the accuracy of the theoretical models and to compare the energy performance using DQ, CTA, and Frame Slotted-ALOHA (FSA in M2M area networks with devices in compliance with the IEEE 802.15.4 physical layer. Results show that the performance of DQ is totally independent of the number of contending devices, and it can reduce the energy consumed per device in more than 35% with respect to CTA and in more than 80% with respect to FSA.

Research on Fault Diagnosis for Pumping Station Based on T-S Fuzzy Fault Tree and Bayesian Network

Directory of Open Access Journals (Sweden)

Zhuqing Bi

2017-01-01

Full Text Available According to the characteristics of fault diagnosis for pumping station, such as the complex structure, multiple mappings, and numerous uncertainties, a new approach combining T-S fuzzy gate fault tree and Bayesian network (BN is proposed. On the one hand, traditional fault tree method needs the logical relationship between events and probability value of events and can only represent the events with two states. T-S fuzzy gate fault tree method can solve these disadvantages but still has weaknesses in complex reasoning and only one-way reasoning. On the other hand, the BN is suitable for fault diagnosis of pumping station because of its powerful ability to deal with uncertain information. However, it is difficult to determine the structure and conditional probability tables of the BN. Therefore, the proposed method integrates the advantages of the two methods. Finally, the feasibility of the method is verified through a fault diagnosis model of the rotor in the pumping unit, the accuracy of the method is verified by comparing with the methods based on traditional Bayesian network and BP neural network, respectively, when the historical data is sufficient, and the results are more superior to the above two when the historical data is insufficient.

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.

A Tree Based Broadcast Scheme for (m, k-firm Real-Time Stream in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

HoSung Park

2017-11-01

Full Text Available Recently, various unicast routing protocols have been proposed to deliver measured data from the sensor node to the sink node within the predetermined deadline in wireless sensor networks. In parallel with their approaches, some applications demand the specific service, which is based on broadcast to all nodes within the deadline, the feasible real-time traffic model and improvements in energy efficiency. However, current protocols based on either flooding or one-to-one unicast cannot meet the above requirements entirely. Moreover, as far as the authors know, there is no study for the real-time broadcast protocol to support the application-specific traffic model in WSN yet. Based on the above analysis, in this paper, we propose a new (m, k-firm-based Real-time Broadcast Protocol (FRBP by constructing a broadcast tree to satisfy the (m, k-firm, which is applicable to the real-time model in resource-constrained WSNs. The broadcast tree in FRBP is constructed by the distance-based priority scheme, whereas energy efficiency is improved by selecting as few as nodes on a tree possible. To overcome the unstable network environment, the recovery scheme invokes rapid partial tree reconstruction in order to designate another node as the parent on a tree according to the measured (m, k-firm real-time condition and local states monitoring. Finally, simulation results are given to demonstrate the superiority of FRBP compared to the existing schemes in terms of average deadline missing ratio, average throughput and energy consumption.

Modelling dependable systems using hybrid Bayesian networks

International Nuclear Information System (INIS)

Neil, Martin; Tailor, Manesh; Marquez, David; Fenton, Norman; Hearty, Peter

2008-01-01

A hybrid Bayesian network (BN) is one that incorporates both discrete and continuous nodes. In our extensive applications of BNs for system dependability assessment, the models are invariably hybrid and the need for efficient and accurate computation is paramount. We apply a new iterative algorithm that efficiently combines dynamic discretisation with robust propagation algorithms on junction tree structures to perform inference in hybrid BNs. We illustrate its use in the field of dependability with two example of reliability estimation. Firstly we estimate the reliability of a simple single system and next we implement a hierarchical Bayesian model. In the hierarchical model we compute the reliability of two unknown subsystems from data collected on historically similar subsystems and then input the result into a reliability block model to compute system level reliability. We conclude that dynamic discretisation can be used as an alternative to analytical or Monte Carlo methods with high precision and can be applied to a wide range of dependability problems

Similarity measure and topology evolution of foreign exchange markets using dynamic time warping method: Evidence from minimal spanning tree

Science.gov (United States)

Wang, Gang-Jin; Xie, Chi; Han, Feng; Sun, Bo

2012-08-01

In this study, we employ a dynamic time warping method to study the topology of similarity networks among 35 major currencies in international foreign exchange (FX) markets, measured by the minimal spanning tree (MST) approach, which is expected to overcome the synchronous restriction of the Pearson correlation coefficient. In the empirical process, firstly, we subdivide the analysis period from June 2005 to May 2011 into three sub-periods: before, during, and after the US sub-prime crisis. Secondly, we choose NZD (New Zealand dollar) as the numeraire and then, analyze the topology evolution of FX markets in terms of the structure changes of MSTs during the above periods. We also present the hierarchical tree associated with the MST to study the currency clusters in each sub-period. Our results confirm that USD and EUR are the predominant world currencies. But USD gradually loses the most central position while EUR acts as a stable center in the MST passing through the crisis. Furthermore, an interesting finding is that, after the crisis, SGD (Singapore dollar) becomes a new center currency for the network.

Predictive brain networks for major depression in a semi-multimodal fusion hierarchical feature reduction framework.

Science.gov (United States)

Yang, Jie; Yin, Yingying; Zhang, Zuping; Long, Jun; Dong, Jian; Zhang, Yuqun; Xu, Zhi; Li, Lei; Liu, Jie; Yuan, Yonggui

2018-02-05

Major depressive disorder (MDD) is characterized by dysregulation of distributed structural and functional networks. It is now recognized that structural and functional networks are related at multiple temporal scales. The recent emergence of multimodal fusion methods has made it possible to comprehensively and systematically investigate brain networks and thereby provide essential information for influencing disease diagnosis and prognosis. However, such investigations are hampered by the inconsistent dimensionality features between structural and functional networks. Thus, a semi-multimodal fusion hierarchical feature reduction framework is proposed. Feature reduction is a vital procedure in classification that can be used to eliminate irrelevant and redundant information and thereby improve the accuracy of disease diagnosis. Our proposed framework primarily consists of two steps. The first step considers the connection distances in both structural and functional networks between MDD and healthy control (HC) groups. By adding a constraint based on sparsity regularization, the second step fully utilizes the inter-relationship between the two modalities. However, in contrast to conventional multi-modality multi-task methods, the structural networks were considered to play only a subsidiary role in feature reduction and were not included in the following classification. The proposed method achieved a classification accuracy, specificity, sensitivity, and area under the curve of 84.91%, 88.6%, 81.29%, and 0.91, respectively. Moreover, the frontal-limbic system contributed the most to disease diagnosis. Importantly, by taking full advantage of the complementary information from multimodal neuroimaging data, the selected consensus connections may be highly reliable biomarkers of MDD. Copyright © 2017 Elsevier B.V. All rights reserved.

Hierarchical fiber-optic-based sensing system: impact damage monitoring of large-scale CFRP structures

International Nuclear Information System (INIS)

Minakuchi, Shu; Banshoya, Hidehiko; Takeda, Nobuo; Tsukamoto, Haruka

2011-01-01

This study proposes a novel fiber-optic-based hierarchical sensing concept for monitoring randomly induced damage in large-scale composite structures. In a hierarchical system, several kinds of specialized devices are hierarchically combined to form a sensing network. Specifically, numerous three-dimensionally structured sensor devices are distributed throughout the whole structural area and connected with an optical fiber network through transducing mechanisms. The distributed devices detect damage, and the fiber-optic network gathers the damage signals and transmits the information to a measuring instrument. This study began by discussing the basic concept of a hierarchical sensing system through comparison with existing fiber-optic-based systems, and an impact damage detection system was then proposed to validate the new concept. The sensor devices were developed based on comparative vacuum monitoring (CVM), and Brillouin-based distributed strain measurement was utilized to identify damaged areas. Verification tests were conducted step-by-step, beginning with a basic test using a single sensor unit, and, finally, the proposed monitoring system was successfully verified using a carbon fiber reinforced plastic (CFRP) fuselage demonstrator. It was clearly confirmed that the hierarchical system has better repairability, higher robustness, and a wider monitorable area compared to existing systems

Early Yield Prediction Using Image Analysis of Apple Fruit and Tree Canopy Features with Neural Networks

Directory of Open Access Journals (Sweden)

Hong Cheng

2017-01-01

Full Text Available (1 Background: Since early yield prediction is relevant for resource requirements of harvesting and marketing in the whole fruit industry, this paper presents a new approach of using image analysis and tree canopy features to predict early yield with artificial neural networks (ANN; (2 Methods: Two back propagation neural network (BPNN models were developed for the early period after natural fruit drop in June and the ripening period, respectively. Within the same periods, images of apple cv. “Gala” trees were captured from an orchard near Bonn, Germany. Two sample sets were developed to train and test models; each set included 150 samples from the 2009 and 2010 growing season. For each sample (each canopy image, pixels were segmented into fruit, foliage, and background using image segmentation. The four features extracted from the data set for the canopy were: total cross-sectional area of fruits, fruit number, total cross-section area of small fruits, and cross-sectional area of foliage, and were used as inputs. With the actual weighted yield per tree as a target, BPNN was employed to learn their mutual relationship as a prerequisite to develop the prediction; (3 Results: For the developed BPNN model of the early period after June drop, correlation coefficients (R2 between the estimated and the actual weighted yield, mean forecast error (MFE, mean absolute percentage error (MAPE, and root mean square error (RMSE were 0.81, −0.05, 10.7%, 2.34 kg/tree, respectively. For the model of the ripening period, these measures were 0.83, −0.03, 8.9%, 2.3 kg/tree, respectively. In 2011, the two previously developed models were used to predict apple yield. The RMSE and R2 values between the estimated and harvested apple yield were 2.6 kg/tree and 0.62 for the early period (small, green fruit and improved near harvest (red, large fruit to 2.5 kg/tree and 0.75 for a tree with ca. 18 kg yield per tree. For further method verification, the cv. �

A Hierarchical Convolutional Neural Network for vesicle fusion event classification.

Science.gov (United States)

Li, Haohan; Mao, Yunxiang; Yin, Zhaozheng; Xu, Yingke

2017-09-01

Quantitative analysis of vesicle exocytosis and classification of different modes of vesicle fusion from the fluorescence microscopy are of primary importance for biomedical researches. In this paper, we propose a novel Hierarchical Convolutional Neural Network (HCNN) method to automatically identify vesicle fusion events in time-lapse Total Internal Reflection Fluorescence Microscopy (TIRFM) image sequences. Firstly, a detection and tracking method is developed to extract image patch sequences containing potential fusion events. Then, a Gaussian Mixture Model (GMM) is applied on each image patch of the patch sequence with outliers rejected for robust Gaussian fitting. By utilizing the high-level time-series intensity change features introduced by GMM and the visual appearance features embedded in some key moments of the fusion process, the proposed HCNN architecture is able to classify each candidate patch sequence into three classes: full fusion event, partial fusion event and non-fusion event. Finally, we validate the performance of our method on 9 challenging datasets that have been annotated by cell biologists, and our method achieves better performances when comparing with three previous methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

Hierarchically structured identification and classification method for vibrational monitoring of reactor components

International Nuclear Information System (INIS)

Saedtler, E.

1981-01-01

The dissertation discusses: 1. Approximative filter algorithms for identification of systems and hierarchical structures. 2. Adaptive statistical pattern recognition and classification. 3. Parameter selection, extraction, and modelling for an automatic control system. 4. Design of a decision tree and an adaptive diagnostic system. (orig./RW) [de

Diagnosis of Constant Faults in Read-Once Contact Networks over Finite Bases using Decision Trees

KAUST Repository

Busbait, Monther I.

2014-01-01

We study the depth of decision trees for diagnosis of constant faults in read-once contact networks over finite bases. This includes diagnosis of 0-1 faults, 0 faults and 1 faults. For any finite basis, we prove a linear upper bound on the minimum

Hierarchically structured distributed microprocessor network for control

International Nuclear Information System (INIS)

Greenwood, J.R.; Holloway, F.W.; Rupert, P.R.; Ozarski, R.G.; Suski, G.J.

1979-01-01

To satisfy a broad range of control-analysis and data-acquisition requirements for Shiva, a hierarchical, computer-based, modular-distributed control system was designed. This system handles the more than 3000 control elements and 1000 data acquisition units in a severe high-voltage, high-current environment. The control system design gives one a flexible and reliable configuration to meet the development milestones for Shiva within critical time limits

Integrating UniTree with the data migration API

Science.gov (United States)

Schrodel, David G.

1994-01-01

The Data Migration Application Programming Interface (DMAPI) has the potential to allow developers of open systems Hierarchical Storage Management (HSM) products to virtualize native file systems without the requirement to make changes to the underlying operating system. This paper describes advantages of virtualizing native file systems in hierarchical storage management systems, the DMAPI at a high level, what the goals are for the interface, and the integration of the Convex UniTree+HSM with DMAPI along with some of the benefits derived in the resulting product.

The index-based subgraph matching algorithm (ISMA: fast subgraph enumeration in large networks using optimized search trees.

Directory of Open Access Journals (Sweden)

Sofie Demeyer

Full Text Available Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA, a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/.

The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

Science.gov (United States)

Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

2013-01-01

Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/. PMID:23620730

Phylogeny and evolutionary histories of Pyrus L. revealed by phylogenetic trees and networks based on data from multiple DNA sequences.

Science.gov (United States)

Zheng, Xiaoyan; Cai, Danying; Potter, Daniel; Postman, Joseph; Liu, Jing; Teng, Yuanwen

2014-11-01

Reconstructing the phylogeny of Pyrus has been difficult due to the wide distribution of the genus and lack of informative data. In this study, we collected 110 accessions representing 25 Pyrus species and constructed both phylogenetic trees and phylogenetic networks based on multiple DNA sequence datasets. Phylogenetic trees based on both cpDNA and nuclear LFY2int2-N (LN) data resulted in poor resolution, especially, only five primary species were monophyletic in the LN tree. A phylogenetic network of LN suggested that reticulation caused by hybridization is one of the major evolutionary processes for Pyrus species. Polytomies of the gene trees and star-like structure of cpDNA networks suggested rapid radiation is another major evolutionary process, especially for the occidental species. Pyrus calleryana and P. regelii were the earliest diverged Pyrus species. Two North African species, P. cordata, P. spinosa and P. betulaefolia were descendent of primitive stock Pyrus species and still share some common molecular characters. Southwestern China, where a large number of P. pashia populations are found, is probably the most important diversification center of Pyrus. More accessions and nuclear genes are needed for further understanding the evolutionary histories of Pyrus. Copyright © 2014 Elsevier Inc. All rights reserved.

Finding Hierarchical and Overlapping Dense Subgraphs using Nucleus Decompositions

Energy Technology Data Exchange (ETDEWEB)

Seshadhri, Comandur [The Ohio State Univ., Columbus, OH (United States); Pinar, Ali [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sariyuce, Ahmet Erdem [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Catalyurek, Umit [The Ohio State Univ., Columbus, OH (United States)

2014-11-01

Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique, k-densest subgraph) are NP-hard. Furthermore, the goal is rarely to nd the \\true optimum", but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine a hierarchical structure among them. Current dense subgraph nding algorithms usually optimize some objective, and only nd a few such subgraphs without providing any hierarchy. It is also not clear how to account for overlaps in dense substructures. We de ne the nucleus decomposition of a graph, which represents the graph as a forest of nuclei. Each nucleus is a subgraph where smaller cliques are present in many larger cliques. The forest of nuclei is a hierarchy by containment, where the edge density increases as we proceed towards leaf nuclei. Sibling nuclei can have limited intersections, which allows for discovery of overlapping dense subgraphs. With the right parameters, the nuclear decomposition generalizes the classic notions of k-cores and k-trusses. We give provable e cient algorithms for nuclear decompositions, and empirically evaluate their behavior in a variety of real graphs. The tree of nuclei consistently gives a global, hierarchical snapshot of dense substructures, and outputs dense subgraphs of higher quality than other state-of-theart solutions. Our algorithm can process graphs with tens of millions of edges in less than an hour.

Application of Goal Tree-Success Tree model as the knowledge-base of operator advisory systems

International Nuclear Information System (INIS)

Kim, I.S.; Modarres, M.

1987-01-01

The most important portion of an expert system development is the articulation of knowledge by the expert and its satisfactory formulation in a suitable knowledge representation scheme for mechanization by a computer. A 'deep knowledge' approach called Goal Tree-Success Tree model is devised to represent complex dynamic domain knowledge. This approach can hierarchically model the underlying principles of a given process domain (for example nuclear power plant operations domain). The Goal Tree-Success Tree can then be used to represent the knowledge-base and provide means of selecting an efficient search routine in the inference engine of an expert system. A prototype expert system has been developed to demonstrate the method. This expert system models the operation of a typical system used in the pressurized water reactors. The expert system is modeled for real-time operations if an interface between plant parameters and the expert system is established. The real-time operation provides an ability to quickly remedy minor disturbances that can quickly lead to a system malfunction or trip. A description of both the Goal Tree-Success Tree model and the prototype expert system is presented. (orig.)

Fibre-tree network for water-surface ranging using an optical time-domain reflectometry technique

Directory of Open Access Journals (Sweden)

Yoshiaki Yamabayashi

2014-10-01

Full Text Available To monitor water level at long distance, a fibre-based time-domain reflectometry network is proposed. A collimator at each fibre end of a tree-type network retrieves 1.55 μm wavelength pulses that are reflected back from remote surfaces. Since this enables a power-supply-free sensor network with non-metal media, this system is expected to be less susceptible to lightning strikes and power cuts than conventional systems that use electrically powered sensors and metal cables. In the present Letter, a successful simultaneous monitoring experiment of two water levels in the laboratory, as well as a trial for detecting a disturbed surface by beam-expanding is reported.

IPv6-Based Smart Metering Network for Monitoring Building Electricity

Directory of Open Access Journals (Sweden)

Dong Xu

2013-01-01

Full Text Available A smart electricity monitoring system of building is presented using ZigBee and internet to establish the network. This system consists of three hardware layers: the host PC, the router, and the sensor nodes. A hierarchical ant colony algorithm is developed for data transmission among the wireless sensor nodes. The wireless communication protocol is also designed based on IPv6 protocol on IEEE 802.15.4 wireless network. All-IP approach and peer-to-peer mode are integrated to optimize the network building. Each node measures the power, current, and voltage and transmits them to the host PC through the router. The host software is designed for building test characteristics, having a tree hierarchy and a friendly interface for the user. The reliability and accuracy of this monitoring system are verified in the experiment and application.

APLIKASI KORELASI PEARSON DALAM MEMBANGUN MODEL TREE-AUGMENTED NETWORK (TAN (Studi Kasus Pengenalan Karakter Tulisan Tangan

Directory of Open Access Journals (Sweden)

Irwan Budi Santoso

2013-10-01

Full Text Available Langkah pertama dalam membangun model pengenalan Tree-Augmented Network (TAN  dengan  mengukur  besarnya  hubungan  diantara  pasangan  fitur  objek.  Salah  satu metode yang dapat digunakan mengukur besarnya keeratan hubungan secara linier diantara pasangan fitur adalah   Korelasi Pearson. Aplikasi Korelasi Pearson  dalam membangun model Tree-Augmented Network (TAN dalam penelitian ini, akan diujicobakan pada kasus membangun  model pengenalan karakter tulisan tangan. Data fitur karakter tulisan tangan untuk kasus ini, diasumsikan mengikuti distribusi gaussian karena estimasi parameter model pengenalannya menggunakan estimator Maximum Likelihood (ML. Hasil eksperimen dengan menggunakan data training yang terdiri dari 5 jenis karakter tulisan tangan, menunjukkan untuk dimensi fitur karakter tulisan tangan 10x30 (30 fitur, akurasi sistem Korelasi Pearson dalam membangun model TAN untuk mengenali karakter tulisan tangan  sebesar 88 %.

Orthology prediction at scalable resolution by phylogenetic tree analysis

Directory of Open Access Journals (Sweden)

Huynen Martijn A

2007-03-01

Full Text Available Abstract Background Orthology is one of the cornerstones of gene function prediction. Dividing the phylogenetic relations between genes into either orthologs or paralogs is however an oversimplification. Already in two-species gene-phylogenies, the complicated, non-transitive nature of phylogenetic relations results in inparalogs and outparalogs. For situations with more than two species we lack semantics to specifically describe the phylogenetic relations, let alone to exploit them. Published procedures to extract orthologous groups from phylogenetic trees do not allow identification of orthology at various levels of resolution, nor do they document the relations between the orthologous groups. Results We introduce "levels of orthology" to describe the multi-level nature of gene relations. This is implemented in a program LOFT (Levels of Orthology From Trees that assigns hierarchical orthology numbers to genes based on a phylogenetic tree. To decide upon speciation and gene duplication events in a tree LOFT can be instructed either to perform classical species-tree reconciliation or to use the species overlap between partitions in the tree. The hierarchical orthology numbers assigned by LOFT effectively summarize the phylogenetic relations between genes. The resulting high-resolution orthologous groups are depicted in colour, facilitating visual inspection of (large trees. A benchmark for orthology prediction, that takes into account the varying levels of orthology between genes, shows that the phylogeny-based high-resolution orthology assignments made by LOFT are reliable. Conclusion The "levels of orthology" concept offers high resolution, reliable orthology, while preserving the relations between orthologous groups. A Windows as well as a preliminary Java version of LOFT is available from the LOFT website http://www.cmbi.ru.nl/LOFT.

Forest Monitoring and Wildland Early Fire Detection by a Hierarchical Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Antonio Molina-Pico

2016-01-01

Full Text Available A wildland fire is an uncontrolled fire that occurs mainly in forest areas, although it can also invade urban or agricultural areas. Among the main causes of wildfires, human factors, either intentional or accidental, are the most usual ones. The number and impact of forest fires are expected to grow as a consequence of the global warming. In order to fight against these disasters, it is necessary to adopt a comprehensive, multifaceted approach that enables a continuous situational awareness and instant responsiveness. This paper describes a hierarchical wireless sensor network aimed at early fire detection in risky areas, integrated with the fire fighting command centres, geographical information systems, and fire simulators. This configuration has been successfully tested in two fire simulations involving all the key players in fire fighting operations: fire brigades, communication systems, and aerial, coordination, and land means.

A note on hierarchical hubbing for a generalization of the VPN problem

NARCIS (Netherlands)

N.K. Olver (Neil)

2014-01-01

htmlabstractRobust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. The notion of "hierarchical hubbing" was introduced (in the narrow context of a specific robust network design question), by Olver and Shepherd

A note on hierarchical hubbing for a generalization of the VPN problem

NARCIS (Netherlands)

Olver, N.K.

2014-01-01

Robust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. The notion of "hierarchical hubbing" was introduced (in the narrow context of a specific robust network design question), by Olver and Shepherd [2010].

Analysis of the Spatial Variation of Network-Constrained Phenomena Represented by a Link Attribute Using a Hierarchical Bayesian Model

Directory of Open Access Journals (Sweden)

Zhensheng Wang

2017-02-01

Full Text Available The spatial variation of geographical phenomena is a classical problem in spatial data analysis and can provide insight into underlying processes. Traditional exploratory methods mostly depend on the planar distance assumption, but many spatial phenomena are constrained to a subset of Euclidean space. In this study, we apply a method based on a hierarchical Bayesian model to analyse the spatial variation of network-constrained phenomena represented by a link attribute in conjunction with two experiments based on a simplified hypothetical network and a complex road network in Shenzhen that includes 4212 urban facility points of interest (POIs for leisure activities. Then, the methods named local indicators of network-constrained clusters (LINCS are applied to explore local spatial patterns in the given network space. The proposed method is designed for phenomena that are represented by attribute values of network links and is capable of removing part of random variability resulting from small-sample estimation. The effects of spatial dependence and the base distribution are also considered in the proposed method, which could be applied in the fields of urban planning and safety research.

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. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Do Policy Networks lead to Network Governing?

DEFF Research Database (Denmark)

Damgaard, Bodil

This paper challenges the notion that creation of local policy networks necessarily leads to network governing. Through actor-centred case studies in the area of municipally implemented employment policy in Denmark it was found that the local governing mode is determined mainly by the municipality......’s approach to local co-governing as well as by the capacity and interest of key private actors. It is argued that national legislation requesting the creation of local policy networks was not enough to assure network governing and the case studies show that local policy networks may subsist also under...... hierarchical governing modes. Reasons why hierarchical governing modes prevail over network governing in some settings are identified pointing to both actor borne and structural factors. Output indicators of the four cases do not show that a particular governing mode is more efficient in its employment policy...

Conceptual hierarchical modeling to describe wetland plant community organization

Science.gov (United States)

Little, A.M.; Guntenspergen, G.R.; Allen, T.F.H.

2010-01-01

Using multivariate analysis, we created a hierarchical modeling process that describes how differently-scaled environmental factors interact to affect wetland-scale plant community organization in a system of small, isolated wetlands on Mount Desert Island, Maine. We followed the procedure: 1) delineate wetland groups using cluster analysis, 2) identify differently scaled environmental gradients using non-metric multidimensional scaling, 3) order gradient hierarchical levels according to spatiotem-poral scale of fluctuation, and 4) assemble hierarchical model using group relationships with ordination axes and post-hoc tests of environmental differences. Using this process, we determined 1) large wetland size and poor surface water chemistry led to the development of shrub fen wetland vegetation, 2) Sphagnum and water chemistry differences affected fen vs. marsh / sedge meadows status within small wetlands, and 3) small-scale hydrologic differences explained transitions between forested vs. non-forested and marsh vs. sedge meadow vegetation. This hierarchical modeling process can help explain how upper level contextual processes constrain biotic community response to lower-level environmental changes. It creates models with more nuanced spatiotemporal complexity than classification and regression tree procedures. Using this process, wetland scientists will be able to generate more generalizable theories of plant community organization, and useful management models. ?? Society of Wetland Scientists 2009.

Merging K-means with hierarchical clustering for identifying general-shaped groups.

Science.gov (United States)

Peterson, Anna D; Ghosh, Arka P; Maitra, Ranjan

2018-01-01

Clustering partitions a dataset such that observations placed together in a group are similar but different from those in other groups. Hierarchical and K -means clustering are two approaches but have different strengths and weaknesses. For instance, hierarchical clustering identifies groups in a tree-like structure but suffers from computational complexity in large datasets while K -means clustering is efficient but designed to identify homogeneous spherically-shaped clusters. We present a hybrid non-parametric clustering approach that amalgamates the two methods to identify general-shaped clusters and that can be applied to larger datasets. Specifically, we first partition the dataset into spherical groups using K -means. We next merge these groups using hierarchical methods with a data-driven distance measure as a stopping criterion. Our proposal has the potential to reveal groups with general shapes and structure in a dataset. We demonstrate good performance on several simulated and real datasets.

A Case for Open Network Health Systems: Systems as Networks in Public Mental Health.

Science.gov (United States)

Rhodes, Michael Grant; de Vries, Marten W

2017-01-08

Increases in incidents involving so-called confused persons have brought attention to the potential costs of recent changes to public mental health (PMH) services in the Netherlands. Decentralized under the (Community) Participation Act (2014), local governments must find resources to compensate for reduced central funding to such services or "innovate." But innovation, even when pressure for change is intense, is difficult. This perspective paper describes experience during and after an investigation into a particularly violent incident and murder. The aim was to provide recommendations to improve the functioning of local PMH services. The investigation concluded that no specific failure by an individual professional or service provider facility led to the murder. Instead, also as a result of the Participation Act that severed communication lines between individuals and organizations, information sharing failures were likely to have reduced system level capacity to identify risks. The methods and analytical frameworks employed to reach this conclusion, also lead to discussion as to the plausibility of an unconventional solution. If improving communication is the primary problem, non-hierarchical information, and organizational networks arise as possible and innovative system solutions. The proposal for debate is that traditional "health system" definitions, literature and narratives, and operating assumptions in public (mental) health are 'locked in' constraining technical and organization innovations. If we view a "health system" as an adaptive system of economic and social "networks," it becomes clear that the current orthodox solution, the so-called integrated health system, typically results in a "centralized hierarchical" or "tree" network. An overlooked alternative that breaks out of the established policy narratives is the view of a 'health systems' as a non-hierarchical organizational structure or 'Open Network.' In turn, this opens new technological and

Construction and application of hierarchical decision tree for classification of ultrasonographic prostate images

NARCIS (Netherlands)

Giesen, R. J.; Huynen, A. L.; Aarnink, R. G.; de la Rosette, J. J.; Debruyne, F. M.; Wijkstra, H.

1996-01-01

A non-parametric algorithm is described for the construction of a binary decision tree classifier. This tree is used to correlate textural features, computed from ultrasonographic prostate images, with the histopathology of the imaged tissue. The algorithm consists of two parts; growing and pruning.

Very High Resolution Tree Cover Mapping for Continental United States using Deep Convolutional Neural Networks

Science.gov (United States)

Ganguly, Sangram; Kalia, Subodh; Li, Shuang; Michaelis, Andrew; Nemani, Ramakrishna R.; Saatchi, Sassan A

2017-01-01

Uncertainties in input land cover estimates contribute to a significant bias in modeled above ground biomass (AGB) and carbon estimates from satellite-derived data. The resolution of most currently used passive remote sensing products is not sufficient to capture tree canopy cover of less than ca. 10-20 percent, limiting their utility to estimate canopy cover and AGB for trees outside of forest land. In our study, we created a first of its kind Continental United States (CONUS) tree cover map at a spatial resolution of 1-m for the 2010-2012 epoch using the USDA NAIP imagery to address the present uncertainties in AGB estimates. The process involves different tasks including data acquisition ingestion to pre-processing and running a state-of-art encoder-decoder based deep convolutional neural network (CNN) algorithm for automatically generating a tree non-tree map for almost a quarter million scenes. The entire processing chain including generation of the largest open source existing aerial satellite image training database was performed at the NEX supercomputing and storage facility. We believe the resulting forest cover product will substantially contribute to filling the gaps in ongoing carbon and ecological monitoring research and help quantifying the errors and uncertainties in derived products.

Very High Resolution Tree Cover Mapping for Continental United States using Deep Convolutional Neural Networks

Science.gov (United States)

Ganguly, S.; Kalia, S.; Li, S.; Michaelis, A.; Nemani, R. R.; Saatchi, S.

2017-12-01

Uncertainties in input land cover estimates contribute to a significant bias in modeled above gound biomass (AGB) and carbon estimates from satellite-derived data. The resolution of most currently used passive remote sensing products is not sufficient to capture tree canopy cover of less than ca. 10-20 percent, limiting their utility to estimate canopy cover and AGB for trees outside of forest land. In our study, we created a first of its kind Continental United States (CONUS) tree cover map at a spatial resolution of 1-m for the 2010-2012 epoch using the USDA NAIP imagery to address the present uncertainties in AGB estimates. The process involves different tasks including data acquisition/ingestion to pre-processing and running a state-of-art encoder-decoder based deep convolutional neural network (CNN) algorithm for automatically generating a tree/non-tree map for almost a quarter million scenes. The entire processing chain including generation of the largest open source existing aerial/satellite image training database was performed at the NEX supercomputing and storage facility. We believe the resulting forest cover product will substantially contribute to filling the gaps in ongoing carbon and ecological monitoring research and help quantifying the errors and uncertainties in derived products.

Constructive Epistemic Modeling: A Hierarchical Bayesian Model Averaging Method

Science.gov (United States)

Tsai, F. T. C.; Elshall, A. S.

2014-12-01

Constructive epistemic modeling is the idea that our understanding of a natural system through a scientific model is a mental construct that continually develops through learning about and from the model. Using the hierarchical Bayesian model averaging (HBMA) method [1], this study shows that segregating different uncertain model components through a BMA tree of posterior model probabilities, model prediction, within-model variance, between-model variance and total model variance serves as a learning tool [2]. First, the BMA tree of posterior model probabilities permits the comparative evaluation of the candidate propositions of each uncertain model component. Second, systemic model dissection is imperative for understanding the individual contribution of each uncertain model component to the model prediction and variance. Third, the hierarchical representation of the between-model variance facilitates the prioritization of the contribution of each uncertain model component to the overall model uncertainty. We illustrate these concepts using the groundwater modeling of a siliciclastic aquifer-fault system. The sources of uncertainty considered are from geological architecture, formation dip, boundary conditions and model parameters. The study shows that the HBMA analysis helps in advancing knowledge about the model rather than forcing the model to fit a particularly understanding or merely averaging several candidate models. [1] Tsai, F. T.-C., and A. S. Elshall (2013), Hierarchical Bayesian model averaging for hydrostratigraphic modeling: Uncertainty segregation and comparative evaluation. Water Resources Research, 49, 5520-5536, doi:10.1002/wrcr.20428. [2] Elshall, A.S., and F. T.-C. Tsai (2014). Constructive epistemic modeling of groundwater flow with geological architecture and boundary condition uncertainty under Bayesian paradigm, Journal of Hydrology, 517, 105-119, doi: 10.1016/j.jhydrol.2014.05.027.

Semi-automated tabulation of the 3D topology and morphology of branching networks using CT: application to the airway tree

International Nuclear Information System (INIS)

Sauret, V.; Bailey, A.G.

1999-01-01

Detailed information on biological branching networks (optical nerves, airways or blood vessels) is often required to improve the analysis of 3D medical imaging data. A semi-automated algorithm has been developed to obtain the full 3D topology and dimensions (direction cosine, length, diameter, branching and gravity angles) of branching networks using their CT images. It has been tested using CT images of a simple Perspex branching network and applied to the CT images of a human cast of the airway tree. The morphology and topology of the computer derived network were compared with the manually measured dimensions. Good agreement was found. The airways dimensions also compared well with previous values quoted in literature. This algorithm can provide complete data set analysis much more quickly than manual measurements. Its use is limited by the CT resolution which means that very small branches are not visible. New data are presented on the branching angles of the airway tree. (author)

A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network

Science.gov (United States)

Han, Zhao; Wu, Jie; Zhang, Jie; Liu, Liefeng; Tian, Kaiyun

2014-04-01

Wireless sensor network (WSN) is a system composed of a large number of low-cost micro-sensors. This network is used to collect and send various kinds of messages to a base station (BS). WSN consists of low-cost nodes with limited battery power, and the battery replacement is not easy for WSN with thousands of physically embedded nodes, which means energy efficient routing protocol should be employed to offer a long-life work time. To achieve the aim, we need not only to minimize total energy consumption but also to balance WSN load. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. In this paper, we propose a General Self-Organized Tree-Based Energy-Balance routing protocol (GSTEB) which builds a routing tree using a process where, for each round, BS assigns a root node and broadcasts this selection to all sensor nodes. Subsequently, each node selects its parent by considering only itself and its neighbors' information, thus making GSTEB a dynamic protocol. Simulation results show that GSTEB has a better performance than other protocols in balancing energy consumption, thus prolonging the lifetime of WSN.

QoS Supported IPTV Service Architecture over Hybrid-Tree-Based Explicit Routed Multicast Network

Directory of Open Access Journals (Sweden)

Chih-Chao Wen

2012-01-01

Full Text Available With the rapid advance in multimedia streaming and multicast transport technology, current IP multicast protocols, especially PIM-SM, become the major channel delivery mechanism for IPTV system over Internet. The goals for IPTV service are to provide two-way interactive services for viewers to select popular program channel with high quality for watching during fast channel surfing period. However, existing IP multicast protocol cannot meet above QoS requirements for IPTV applications between media server and subscribers. Therefore, we propose a cooperative scheme of hybrid-tree based on explicit routed multicast, called as HT-ERM to combine the advantages of shared tree and source tree for QoS-supported IPTV service. To increase network utilization, the constrained shortest path first (CSPF routing algorithm is designed for construction of hybrid tree to deliver the high-quality video stream over watching channel and standard quality over surfing channel. Furthermore, the Resource Reservation Protocol- Traffic Engineering (RSVP-TE is used as signaling mechanism to set up QoS path for multicast channel admission control. Our simulation results demonstrated that the proposed HT-ERM scheme outperforms other multicast QoS-based delivery scheme in terms of channel switching delay, resource utilization, and blocking ratio for IPTV service.

Metapopulation modelling of riparian tree species persistence in river networks under climate change.

Science.gov (United States)

Van Looy, Kris; Piffady, Jérémy

2017-11-01

Floodplain landscapes are highly fragmented by river regulation resulting in habitat degradation and flood regime perturbation, posing risks to population persistence. Climate change is expected to pose supplementary risks in this context of fragmented landscapes, and especially for river systems adaptation management programs are developed. The association of habitat quality and quantity with the landscape dynamics and resilience to human-induced disturbances is still poorly understood in the context of species survival and colonization processes, but essential to prioritize conservation and restoration actions. We present a modelling approach that elucidates network connectivity and landscape dynamics in spatial and temporal context to identify vital corridors and conservation priorities in the Loire river and its tributaries. Alteration of flooding and flow regimes is believed to be critical to population dynamics in river ecosystems. Still, little is known of critical levels of alteration both spatially and temporally. We applied metapopulation modelling approaches for a dispersal-limited tree species, white elm; and a recruitment-limited tree species, black poplar. In different model steps the connectivity and natural dynamics of the river landscape are confronted with physical alterations (dams/dykes) to species survival and then future scenarios for climatic changes and potential adaptation measures are entered in the model and translated in population persistence over the river basin. For the two tree species we highlighted crucial network zones in relation to habitat quality and connectivity. Where the human impact model already shows currently restricted metapopulation development, climate change is projected to aggravate this persistence perspective substantially. For both species a significant drawback to the basin population is observed, with 1/3 for elm and ¼ for poplar after 25 years already. But proposed adaptation measures prove effective to even

Detecting tree-like multicellular life on extrasolar planets.

Science.gov (United States)

Doughty, Christopher E; Wolf, Adam

2010-11-01

Over the next two decades, NASA and ESA are planning a series of space-based observatories to find Earth-like planets and determine whether life exists on these planets. Previous studies have assessed the likelihood of detecting life through signs of biogenic gases in the atmosphere or a red edge. Biogenic gases and the red edge could be signs of either single-celled or multicellular life. In this study, we propose a technique with which to determine whether tree-like multicellular life exists on extrasolar planets. For multicellular photosynthetic organisms on Earth, competition for light and the need to transport water and nutrients has led to a tree-like body plan characterized by hierarchical branching networks. This design results in a distinct bidirectional reflectance distribution function (BRDF) that causes differing reflectance at different sun/view geometries. BRDF arises from the changing visibility of the shadows cast by objects, and the presence of tree-like structures is clearly distinguishable from flat ground with the same reflectance spectrum. We examined whether the BRDF could detect the existence of tree-like structures on an extrasolar planet by using changes in planetary albedo as a planet orbits its star. We used a semi-empirical BRDF model to simulate vegetation reflectance at different planetary phase angles and both simulated and real cloud cover to calculate disk and rotation-averaged planetary albedo for a vegetated and non-vegetated planet with abundant liquid water. We found that even if the entire planetary albedo were rendered to a single pixel, the rate of increase of albedo as a planet approaches full illumination would be comparatively greater on a vegetated planet than on a non-vegetated planet. Depending on how accurately planetary cloud cover can be resolved and the capabilities of the coronagraph to resolve exoplanets, this technique could theoretically detect tree-like multicellular life on exoplanets in 50 stellar systems.

Functional traits help predict post-disturbance demography of tropical trees.

Science.gov (United States)

Flores, Olivier; Hérault, Bruno; Delcamp, Matthieu; Garnier, Éric; Gourlet-Fleury, Sylvie

2014-01-01

How tropical tree species respond to disturbance is a central issue of forest ecology, conservation and resource management. We define a hierarchical model to investigate how functional traits measured in control plots relate to the population change rate and to demographic rates for recruitment and mortality after disturbance by logging operations. Population change and demographic rates were quantified on a 12-year period after disturbance and related to seven functional traits measured in control plots. The model was calibrated using a Bayesian Network approach on 53 species surveyed in permanent forest plots (37.5 ha) at Paracou in French Guiana. The network analysis allowed us to highlight both direct and indirect relationships among predictive variables. Overall, 89% of interspecific variability in the population change rate after disturbance were explained by the two demographic rates, the recruitment rate being the most explicative variable. Three direct drivers explained 45% of the variability in recruitment rates, including leaf phosphorus concentration, with a positive effect, and seed size and wood density with negative effects. Mortality rates were explained by interspecific variability in maximum diameter only (25%). Wood density, leaf nitrogen concentration, maximum diameter and seed size were not explained by variables in the analysis and thus appear as independent drivers of post-disturbance demography. Relationships between functional traits and demographic parameters were consistent with results found in undisturbed forests. Functional traits measured in control conditions can thus help predict the fate of tropical tree species after disturbance. Indirect relationships also suggest how different processes interact to mediate species demographic response.

Recognizing Chinese characters in digital ink from non-native language writers using hierarchical models

Science.gov (United States)

Bai, Hao; Zhang, Xi-wen

2017-06-01

While Chinese is learned as a second language, its characters are taught step by step from their strokes to components, radicals to components, and their complex relations. Chinese Characters in digital ink from non-native language writers are deformed seriously, thus the global recognition approaches are poorer. So a progressive approach from bottom to top is presented based on hierarchical models. Hierarchical information includes strokes and hierarchical components. Each Chinese character is modeled as a hierarchical tree. Strokes in one Chinese characters in digital ink are classified with Hidden Markov Models and concatenated to the stroke symbol sequence. And then the structure of components in one ink character is extracted. According to the extraction result and the stroke symbol sequence, candidate characters are traversed and scored. Finally, the recognition candidate results are listed by descending. The method of this paper is validated by testing 19815 copies of the handwriting Chinese characters written by foreign students.

Using medical history embedded in biometrics medical card for user identity authentication: data representation by AVT hierarchical data tree.

Science.gov (United States)

Fong, Simon; Zhuang, Yan

2012-01-01

User authentication has been widely used by biometric applications that work on unique bodily features, such as fingerprints, retina scan, and palm vessels recognition. This paper proposes a novel concept of biometric authentication by exploiting a user's medical history. Although medical history may not be absolutely unique to every individual person, the chances of having two persons who share an exactly identical trail of medical and prognosis history are slim. Therefore, in addition to common biometric identification methods, medical history can be used as ingredients for generating Q&A challenges upon user authentication. This concept is motivated by a recent advancement on smart-card technology that future identity cards are able to carry patents' medical history like a mobile database. Privacy, however, may be a concern when medical history is used for authentication. Therefore in this paper, a new method is proposed for abstracting the medical data by using attribute value taxonomies, into a hierarchical data tree (h-Data). Questions can be abstracted to various level of resolution (hence sensitivity of private data) for use in the authentication process. The method is described and a case study is given in this paper.

Using Medical History Embedded in Biometrics Medical Card for User Identity Authentication: Data Representation by AVT Hierarchical Data Tree

Directory of Open Access Journals (Sweden)

Simon Fong

2012-01-01

Full Text Available User authentication has been widely used by biometric applications that work on unique bodily features, such as fingerprints, retina scan, and palm vessels recognition. This paper proposes a novel concept of biometric authentication by exploiting a user’s medical history. Although medical history may not be absolutely unique to every individual person, the chances of having two persons who share an exactly identical trail of medical and prognosis history are slim. Therefore, in addition to common biometric identification methods, medical history can be used as ingredients for generating Q&A challenges upon user authentication. This concept is motivated by a recent advancement on smart-card technology that future identity cards are able to carry patents’ medical history like a mobile database. Privacy, however, may be a concern when medical history is used for authentication. Therefore in this paper, a new method is proposed for abstracting the medical data by using attribute value taxonomies, into a hierarchical data tree (h-Data. Questions can be abstracted to various level of resolution (hence sensitivity of private data for use in the authentication process. The method is described and a case study is given in this paper.

Hierarchical Neural Regression Models for Customer Churn Prediction

Directory of Open Access Journals (Sweden)

Golshan Mohammadi

2013-01-01

Full Text Available As customers are the main assets of each industry, customer churn prediction is becoming a major task for companies to remain in competition with competitors. In the literature, the better applicability and efficiency of hierarchical data mining techniques has been reported. This paper considers three hierarchical models by combining four different data mining techniques for churn prediction, which are backpropagation artificial neural networks (ANN, self-organizing maps (SOM, alpha-cut fuzzy c-means (α-FCM, and Cox proportional hazards regression model. The hierarchical models are ANN + ANN + Cox, SOM + ANN + Cox, and α-FCM + ANN + Cox. In particular, the first component of the models aims to cluster data in two churner and nonchurner groups and also filter out unrepresentative data or outliers. Then, the clustered data as the outputs are used to assign customers to churner and nonchurner groups by the second technique. Finally, the correctly classified data are used to create Cox proportional hazards model. To evaluate the performance of the hierarchical models, an Iranian mobile dataset is considered. The experimental results show that the hierarchical models outperform the single Cox regression baseline model in terms of prediction accuracy, Types I and II errors, RMSE, and MAD metrics. In addition, the α-FCM + ANN + Cox model significantly performs better than the two other hierarchical models.

A Wireless Sensor Network for Growth Environment Measurement and Multi-Band Optical Sensing to Diagnose Tree Vigor.

Science.gov (United States)

Kameoka, Shinichi; Isoda, Shuhei; Hashimoto, Atsushi; Ito, Ryoei; Miyamoto, Satoru; Wada, Genki; Watanabe, Naoki; Yamakami, Takashi; Suzuki, Ken; Kameoka, Takaharu

2017-04-27

We have tried to develop the guidance system for farmers to cultivate using various phenological indices. As the sensing part of this system, we deployed a new Wireless Sensor Network (WSN). This system uses the 920 MHz radio wave based on the Wireless Smart Utility Network that enables long-range wireless communication. In addition, the data acquired by the WSN were standardized for the advanced web service interoperability. By using these standardized data, we can create a web service that offers various kinds of phenological indices as secondary information to the farmers in the field. We have also established the field management system using thermal image, fluorescent and X-ray fluorescent methods, which enable the nondestructive, chemical-free, simple, and rapid measurement of fruits or trees. We can get the information about the transpiration of plants through a thermal image. The fluorescence sensor gives us information, such as nitrate balance index (NBI), that shows the nitrate balance inside the leaf, chlorophyll content, flavonol content and anthocyanin content. These methods allow one to quickly check the health of trees and find ways to improve the tree vigor of weak ones. Furthermore, the fluorescent x-ray sensor has the possibility to quantify the loss of minerals necessary for fruit growth.

A Wireless Sensor Network for Growth Environment Measurement and Multi-Band Optical Sensing to Diagnose Tree Vigor

Directory of Open Access Journals (Sweden)

Shinichi Kameoka

2017-04-01

Full Text Available We have tried to develop the guidance system for farmers to cultivate using various phenological indices. As the sensing part of this system, we deployed a new Wireless Sensor Network (WSN. This system uses the 920 MHz radio wave based on the Wireless Smart Utility Network that enables long-range wireless communication. In addition, the data acquired by the WSN were standardized for the advanced web service interoperability. By using these standardized data, we can create a web service that offers various kinds of phenological indices as secondary information to the farmers in the field. We have also established the field management system using thermal image, fluorescent and X-ray fluorescent methods, which enable the nondestructive, chemical-free, simple, and rapid measurement of fruits or trees. We can get the information about the transpiration of plants through a thermal image. The fluorescence sensor gives us information, such as nitrate balance index (NBI, that shows the nitrate balance inside the leaf, chlorophyll content, flavonol content and anthocyanin content. These methods allow one to quickly check the health of trees and find ways to improve the tree vigor of weak ones. Furthermore, the fluorescent x-ray sensor has the possibility to quantify the loss of minerals necessary for fruit growth.

Self-assembly of nano/micro-structured Fe3O4 microspheres among 3D rGO/CNTs hierarchical networks with superior lithium storage performances

International Nuclear Information System (INIS)

Liu, Jinlong; Feng, Haibo; Wang, Xipeng; Qian, Dong; Jiang, Jianbo; Li, Junhua; Peng, Sanjun; Deng, Miao; Liu, Youcai

2014-01-01

Nano/micro-structured Fe 3 O 4 microspheres among three-dimensional (3D) reduced graphene oxide (rGO)/carbon nanotubes (CNTs) hierarchical networks (the ternary composite is denoted as rGCFs) have been synthesized using a facile, self-assembled and one-pot hydrothermal approach. The rGCFs composite exhibits superior lithium storage performances: initial discharge and charge capacities of 1452 and 1036 mAh g −1 , respectively, remarkable rate capability at current densities from 100 mA g −1 to 10 A g −1 and outstanding cycling performance up to 200 cycles. The highly enhanced electrochemical performances of rGCFs depend heavily on the robust 3D rGO/CNTs hierarchical networks, the stable nano/microstructures of active Fe 3 O 4 microspheres and the positive synergistic effects of building components. The systematic structure characterizations and electrochemical investigations provide insightful understanding towards the relationship between structure/morphology and lithium storage performances, which may pave the way for the rational design of composite materials with desirable goals. (papers)

Tree agency and urban forest governance

DEFF Research Database (Denmark)

Konijnendijk, Cecil Cornelis

2016-01-01

governance also involving businesses and civic society. However, governance theory usually does not consider the role of non-human agency, which can be considered problematic due to, for example, the important role of urban trees in place making. The purpose of this paper is to provide further insight...... into the importance of considering tree agency in governance. Design/methodology/approach – Taking an environmental governance and actor network theory perspective, the paper presents a critical view of current urban forest governance, extending the perspective to include not only a wide range of human actors......, but also trees as important non-human actors. Findings – Urban forest governance has become more complex and involves a greater range of actors and actor networks. However, the agency of trees in urban forest governance is seldom well developed. Trees, in close association with local residents, create...

Introduction to parallel algorithms and architectures arrays, trees, hypercubes

CERN Document Server

Leighton, F Thomson

1991-01-01

Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes provides an introduction to the expanding field of parallel algorithms and architectures. This book focuses on parallel computation involving the most popular network architectures, namely, arrays, trees, hypercubes, and some closely related networks.Organized into three chapters, this book begins with an overview of the simplest architectures of arrays and trees. This text then presents the structures and relationships between the dominant network architectures, as well as the most efficient parallel algorithms for

Querying on Federated Sensor Networks

Directory of Open Access Journals (Sweden)

Zuhal Can

2016-09-01

Full Text Available A Federated Sensor Network (FSN is a network of geographically distributed Wireless Sensor Networks (WSNs called islands. For querying on an FSN, we introduce the Layered Federated Sensor Network (L-FSN Protocol. For layered management, L-FSN provides communication among islands by its inter-island querying protocol by which a query packet routing path is determined according to some path selection policies. L-FSN allows autonomous management of each island by island-specific intra-island querying protocols that can be selected according to island properties. We evaluate the applicability of L-FSN and compare the L-FSN protocol with various querying protocols running on the flat federation model. Flat federation is a method to federate islands by running a single querying protocol on an entire FSN without distinguishing communication among and within islands. For flat federation, we select a querying protocol from geometrical, hierarchical cluster-based, hash-based, and tree-based WSN querying protocol categories. We found that a layered federation of islands by L-FSN increases the querying performance with respect to energy-efficiency, query resolving distance, and query resolving latency. Moreover, L-FSN’s flexibility of choosing intra-island querying protocols regarding the island size brings advantages on energy-efficiency and query resolving latency.

Urban pattern: Layout design by hierarchical domain splitting

KAUST Repository

Yang, Yongliang; Wang, Jun; Vouga, Etienne; Wonka, Peter

2013-01-01

We present a framework for generating street networks and parcel layouts. Our goal is the generation of high-quality layouts that can be used for urban planning and virtual environments. We propose a solution based on hierarchical domain splitting using two splitting types: streamline-based splitting, which splits a region along one or multiple streamlines of a cross field, and template-based splitting, which warps pre-designed templates to a region and uses the interior geometry of the template as the splitting lines. We combine these two splitting approaches into a hierarchical framework, providing automatic and interactive tools to explore the design space.

Urban pattern: Layout design by hierarchical domain splitting

KAUST Repository

Yang, Yongliang