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.

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.

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

Loops in hierarchical channel networks

Science.gov (United States)

Katifori, Eleni; Magnasco, Marcelo

2012-02-01

Nature provides us with 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. Although a number of methods 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 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 and natural graphs extracted from digitized images of dicotyledonous leaves and animal vasculature. We calculate various metrics on 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 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.

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.

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

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

Noise enhances information transfer in hierarchical networks.

Science.gov (United States)

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

2013-01-01

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

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.

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

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.

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

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.

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

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)

Modular networks with hierarchical organization: The dynamical ...

Indian Academy of Sciences (India)

Most of the complex systems seen in real life also have associated dynamics [10], and the ... another example, this time a hierarchical structure, viz., the Cayley tree with b ..... natural constraints operating on networks in real life, such as the ...

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

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.

A Hardware-Supported Algorithm for Self-Managed and Choreographed Task Execution in Sensor Networks

Directory of Open Access Journals (Sweden)

Borja Bordel

2018-03-01

Full Text Available Nowadays, sensor networks are composed of a great number of tiny resource-constraint nodes, whose management is increasingly more complex. In fact, although collaborative or choreographic task execution schemes are which fit in the most perfect way with the nature of sensor networks, they are rarely implemented because of the high resource consumption of these algorithms (especially if networks include many resource-constrained devices. On the contrary, hierarchical networks are usually designed, in whose cusp it is included a heavy orchestrator with a remarkable processing power, being able to implement any necessary management solution. However, although this orchestration approach solves most practical management problems of sensor networks, a great amount of the operation time is wasted while nodes request the orchestrator to address a conflict and they obtain the required instructions to operate. Therefore, in this paper it is proposed a new mechanism for self-managed and choreographed task execution in sensor networks. The proposed solution considers only a lightweight gateway instead of traditional heavy orchestrators and a hardware-supported algorithm, which consume a negligible amount of resources in sensor nodes. The gateway avoids the congestion of the entire sensor network and the hardware-supported algorithm enables a choreographed task execution scheme, so no particular node is overloaded. The performance of the proposed solution is evaluated through numerical and electronic ModelSim-based simulations.

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.

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.

Changes of hierarchical network in local and world stock market

Science.gov (United States)

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

2017-10-01

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

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.

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

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.

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.

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.

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.

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

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.

Default network connectivity during a working memory task.

Science.gov (United States)

Bluhm, Robyn L; Clark, C Richard; McFarlane, Alexander C; Moores, Kathryn A; Shaw, Marnie E; Lanius, Ruth A

2011-07-01

The default network exhibits correlated activity at rest and has shown decreased activation during performance of cognitive tasks. There has been little investigation of changes in connectivity of this network during task performance. In this study, we examined task-related modulation of connectivity between two seed regions from the default network posterior cingulated cortex (PCC) and medial prefrontal cortex (mPFC) and the rest of the brain in 12 healthy adults. The purpose was to determine (1) whether connectivity within the default network differs between a resting state and performance of a cognitive (working memory) task and (2) whether connectivity differs between these nodes of the default network and other brain regions, particularly those implicated in cognitive tasks. There was little change in connectivity with the other main areas of the default network for either seed region, but moderate task-related changes in connectivity occurred between seed regions and regions outside the default network. For example, connectivity of the mPFC with the right insula and the right superior frontal gyrus decreased during task performance. Increased connectivity during the working memory task occurred between the PCC and bilateral inferior frontal gyri, and between the mPFC and the left inferior frontal gyrus, cuneus, superior parietal lobule, middle temporal gyrus and cerebellum. Overall, the areas showing greater correlation with the default network seed regions during task than at rest have been previously implicated in working memory tasks. These changes may reflect a decrease in the negative correlations occurring between the default and task-positive networks at rest. Copyright © 2010 Wiley-Liss, Inc.

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

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.

Dynamically Allocated Hub in Task-Evoked Network Predicts the Vulnerable Prefrontal Locus for Contextual Memory Retrieval in Macaques.

Directory of Open Access Journals (Sweden)

Takahiro Osada

2015-06-01

Full Text Available Neuroimaging and neurophysiology have revealed that multiple areas in the prefrontal cortex (PFC are activated in a specific memory task, but severity of impairment after PFC lesions is largely different depending on which activated area is damaged. The critical relationship between lesion sites and impairments has not yet been given a clear mechanistic explanation. Although recent works proposed that a whole-brain network contains hubs that play integrative roles in cortical information processing, this framework relying on an anatomy-based structural network cannot account for the vulnerable locus for a specific task, lesioning of which would bring impairment. Here, we hypothesized that (i activated PFC areas dynamically form an ordered network centered at a task-specific "functional hub" and (ii the lesion-effective site corresponds to the "functional hub," but not to a task-invariant "structural hub." To test these hypotheses, we conducted functional magnetic resonance imaging experiments in macaques performing a temporal contextual memory task. We found that the activated areas formed a hierarchical hub-centric network based on task-evoked directed connectivity, differently from the anatomical network reflecting axonal projection patterns. Using a novel simulated-lesion method based on support vector machine, we estimated severity of impairment after lesioning of each area, which accorded well with a known dissociation in contextual memory impairment in macaques (impairment after lesioning in area 9/46d, but not in area 8Ad. The predicted severity of impairment was proportional to the network "hubness" of the virtually lesioned area in the task-evoked directed connectivity network, rather than in the anatomical network known from tracer studies. Our results suggest that PFC areas dynamically and cooperatively shape a functional hub-centric network to reallocate the lesion-effective site depending on the cognitive processes, apart from

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

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.

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

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.

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

Intrinsic and task-evoked network architectures of the human brain

Science.gov (United States)

Cole, Michael W.; Bassett, Danielle S.; Power, Jonathan D.; Braver, Todd S.; Petersen, Steven E.

2014-01-01

Summary Many functional network properties of the human brain have been identified during rest and task states, yet it remains unclear how the two relate. We identified a whole-brain network architecture present across dozens of task states that was highly similar to the resting-state network architecture. The most frequent functional connectivity strengths across tasks closely matched the strengths observed at rest, suggesting this is an “intrinsic”, standard architecture of functional brain organization. Further, a set of small but consistent changes common across tasks suggests the existence of a task-general network architecture distinguishing task states from rest. These results indicate the brain’s functional network architecture during task performance is shaped primarily by an intrinsic network architecture that is also present during rest, and secondarily by evoked task-general and task-specific network changes. This establishes a strong relationship between resting-state functional connectivity and task-evoked functional connectivity – areas of neuroscientific inquiry typically considered separately. PMID:24991964

Default mode network connectivity during task execution.

Science.gov (United States)

Vatansever, D; Menon, D K; Manktelow, A E; Sahakian, B J; Stamatakis, E A

2015-11-15

Initially described as task-induced deactivations during goal-directed paradigms of high attentional load, the unresolved functionality of default mode regions has long been assumed to interfere with task performance. However, recent evidence suggests a potential default mode network involvement in fulfilling cognitive demands. We tested this hypothesis in a finger opposition paradigm with task and fixation periods which we compared with an independent resting state scan using functional magnetic resonance imaging and a comprehensive analysis pipeline including activation, functional connectivity, behavioural and graph theoretical assessments. The results indicate task specific changes in the default mode network topography. Behaviourally, we show that increased connectivity of the posterior cingulate cortex with the left superior frontal gyrus predicts faster reaction times. Moreover, interactive and dynamic reconfiguration of the default mode network regions' functional connections illustrates their involvement with the task at hand with higher-level global parallel processing power, yet preserved small-world architecture in comparison with rest. These findings demonstrate that the default mode network does not disengage during this paradigm, but instead may be involved in task relevant processing. Copyright © 2015 Elsevier Inc. All rights reserved.

From "rest" to language task: Task activation selects and prunes from broader resting-state network.

Science.gov (United States)

Doucet, Gaelle E; He, Xiaosong; Sperling, Michael R; Sharan, Ashwini; Tracy, Joseph I

2017-05-01

Resting-state networks (RSNs) show spatial patterns generally consistent with networks revealed during cognitive tasks. However, the exact degree of overlap between these networks has not been clearly quantified. Such an investigation shows promise for decoding altered functional connectivity (FC) related to abnormal language functioning in clinical populations such as temporal lobe epilepsy (TLE). In this context, we investigated the network configurations during a language task and during resting state using FC. Twenty-four healthy controls, 24 right and 24 left TLE patients completed a verb generation (VG) task and a resting-state fMRI scan. We compared the language network revealed by the VG task with three FC-based networks (seeding the left inferior frontal cortex (IFC)/Broca): two from the task (ON, OFF blocks) and one from the resting state. We found that, for both left TLE patients and controls, the RSN recruited regions bilaterally, whereas both VG-on and VG-off conditions produced more left-lateralized FC networks, matching more closely with the activated language network. TLE brings with it variability in both task-dependent and task-independent networks, reflective of atypical language organization. Overall, our findings suggest that our RSN captured bilateral activity, reflecting a set of prepotent language regions. We propose that this relationship can be best understood by the notion of pruning or winnowing down of the larger language-ready RSN to carry out specific task demands. Our data suggest that multiple types of network analyses may be needed to decode the association between language deficits and the underlying functional mechanisms altered by disease. Hum Brain Mapp 38:2540-2552, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

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

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

Optimization of Hierarchical System for Data Acquisition

Directory of Open Access Journals (Sweden)

V. Novotny

2011-04-01

Full Text Available Television broadcasting over IP networks (IPTV is one of a number of network applications that are except of media distribution also interested in data acquisition from group of information resources of variable size. IP-TV uses Real-time Transport Protocol (RTP protocol for media streaming and RTP Control Protocol (RTCP protocol for session quality feedback. Other applications, for example sensor networks, have data acquisition as the main task. Current solutions have mostly problem with scalability - how to collect and process information from large amount of end nodes quickly and effectively? The article deals with optimization of hierarchical system of data acquisition. Problem is mathematically described, delay minima are searched and results are proved by simulations.

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.

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.

Activity flow over resting-state networks shapes cognitive task activations.

Science.gov (United States)

Cole, Michael W; Ito, Takuya; Bassett, Danielle S; Schultz, Douglas H

2016-12-01

Resting-state functional connectivity (FC) has helped reveal the intrinsic network organization of the human brain, yet its relevance to cognitive task activations has been unclear. Uncertainty remains despite evidence that resting-state FC patterns are highly similar to cognitive task activation patterns. Identifying the distributed processes that shape localized cognitive task activations may help reveal why resting-state FC is so strongly related to cognitive task activations. We found that estimating task-evoked activity flow (the spread of activation amplitudes) over resting-state FC networks allowed prediction of cognitive task activations in a large-scale neural network model. Applying this insight to empirical functional MRI data, we found that cognitive task activations can be predicted in held-out brain regions (and held-out individuals) via estimated activity flow over resting-state FC networks. This suggests that task-evoked activity flow over intrinsic networks is a large-scale mechanism explaining the relevance of resting-state FC to cognitive task activations.

Clustering of resting state networks.

Directory of Open Access Journals (Sweden)

Megan H Lee

Full Text Available The goal of the study was to demonstrate a hierarchical structure of resting state activity in the healthy brain using a data-driven clustering algorithm.The fuzzy-c-means clustering algorithm was applied to resting state fMRI data in cortical and subcortical gray matter from two groups acquired separately, one of 17 healthy individuals and the second of 21 healthy individuals. Different numbers of clusters and different starting conditions were used. A cluster dispersion measure determined the optimal numbers of clusters. An inner product metric provided a measure of similarity between different clusters. The two cluster result found the task-negative and task-positive systems. The cluster dispersion measure was minimized with seven and eleven clusters. Each of the clusters in the seven and eleven cluster result was associated with either the task-negative or task-positive system. Applying the algorithm to find seven clusters recovered previously described resting state networks, including the default mode network, frontoparietal control network, ventral and dorsal attention networks, somatomotor, visual, and language networks. The language and ventral attention networks had significant subcortical involvement. This parcellation was consistently found in a large majority of algorithm runs under different conditions and was robust to different methods of initialization.The clustering of resting state activity using different optimal numbers of clusters identified resting state networks comparable to previously obtained results. This work reinforces the observation that resting state networks are hierarchically organized.

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)

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

COMPOSITE METHOD OF RELIABILITY RESEARCH FOR HIERARCHICAL MULTILAYER ROUTING SYSTEMS

Directory of Open Access Journals (Sweden)

R. B. Tregubov

2016-09-01

Full Text Available The paper deals with the idea of a research method for hierarchical multilayer routing systems. The method represents a composition of methods of graph theories, reliability, probabilities, etc. These methods are applied to the solution of different private analysis and optimization tasks and are systemically connected and coordinated with each other through uniform set-theoretic representation of the object of research. The hierarchical multilayer routing systems are considered as infrastructure facilities (gas and oil pipelines, automobile and railway networks, systems of power supply and communication with distribution of material resources, energy or information with the use of hierarchically nested functions of routing. For descriptive reasons theoretical constructions are considered on the example of task solution of probability determination for up state of specific infocommunication system. The author showed the possibility of constructive combination of graph representation of structure of the object of research and a logic probable analysis method of its reliability indices through uniform set-theoretic representation of its elements and processes proceeding in them.

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

Classifying dysmorphic syndromes by using artificial neural network based hierarchical decision tree.

Science.gov (United States)

Özdemir, Merve Erkınay; Telatar, Ziya; Eroğul, Osman; Tunca, Yusuf

2018-05-01

Dysmorphic syndromes have different facial malformations. These malformations are significant to an early diagnosis of dysmorphic syndromes and contain distinctive information for face recognition. In this study we define the certain features of each syndrome by considering facial malformations and classify Fragile X, Hurler, Prader Willi, Down, Wolf Hirschhorn syndromes and healthy groups automatically. The reference points are marked on the face images and ratios between the points' distances are taken into consideration as features. We suggest a neural network based hierarchical decision tree structure in order to classify the syndrome types. We also implement k-nearest neighbor (k-NN) and artificial neural network (ANN) classifiers to compare classification accuracy with our hierarchical decision tree. The classification accuracy is 50, 73 and 86.7% with k-NN, ANN and hierarchical decision tree methods, respectively. Then, the same images are shown to a clinical expert who achieve a recognition rate of 46.7%. We develop an efficient system to recognize different syndrome types automatically in a simple, non-invasive imaging data, which is independent from the patient's age, sex and race at high accuracy. The promising results indicate that our method can be used for pre-diagnosis of the dysmorphic syndromes by clinical experts.

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.

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

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.

Evidence for a Functional Hierarchy of Association Networks.

Science.gov (United States)

Choi, Eun Young; Drayna, Garrett K; Badre, David

2018-05-01

Patient lesion and neuroimaging studies have identified a rostral-to-caudal functional gradient in the lateral frontal cortex (LFC) corresponding to higher-order (complex or abstract) to lower-order (simple or concrete) cognitive control. At the same time, monkey anatomical and human functional connectivity studies show that frontal regions are reciprocally connected with parietal and temporal regions, forming parallel and distributed association networks. Here, we investigated the link between the functional gradient of LFC regions observed during control tasks and the parallel, distributed organization of association networks. Whole-brain fMRI task activity corresponding to four orders of hierarchical control [Badre, D., & D'Esposito, M. Functional magnetic resonance imaging evidence for a hierarchical organization of the prefrontal cortex. Journal of Cognitive Neuroscience, 19, 2082-2099, 2007] was compared with a resting-state functional connectivity MRI estimate of cortical networks [Yeo, B. T., Krienen, F. M., Sepulcre, J., Sabuncu, M. R., Lashkari, D., Hollinshead, M., et al. The organization of the human cerebral cortex estimated by intrinsic functional connectivity. Journal of Neurophysiology, 106, 1125-1165, 2011]. Critically, at each order of control, activity in the LFC and parietal cortex overlapped onto a common association network that differed between orders. These results are consistent with a functional organization based on separable association networks that are recruited during hierarchical control. Furthermore, corticostriatal functional connectivity MRI showed that, consistent with their participation in functional networks, rostral-to-caudal LFC and caudal-to-rostral parietal regions had similar, order-specific corticostriatal connectivity that agreed with a striatal gating model of hierarchical rule use. Our results indicate that hierarchical cognitive control is subserved by parallel and distributed association networks, together forming

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.

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.

Task vs. rest-different network configurations between the coactivation and the resting-state brain networks.

Science.gov (United States)

Di, Xin; Gohel, Suril; Kim, Eun H; Biswal, Bharat B

2013-01-01

There is a growing interest in studies of human brain networks using resting-state functional magnetic resonance imaging (fMRI). However, it is unclear whether and how brain networks measured during the resting-state exhibit comparable properties to brain networks during task performance. In the present study, we investigated meta-analytic coactivation patterns among brain regions based upon published neuroimaging studies, and compared the coactivation network configurations with those in the resting-state network. The strength of resting-state functional connectivity between two regions were strongly correlated with the coactivation strength. However, the coactivation network showed greater global efficiency, smaller mean clustering coefficient, and lower modularity compared with the resting-state network, which suggest a more efficient global information transmission and between system integrations during task performing. Hub shifts were also observed within the thalamus and the left inferior temporal cortex. The thalamus and the left inferior temporal cortex exhibited higher and lower degrees, respectively in the coactivation network compared with the resting-state network. These results shed light regarding the reconfiguration of the brain networks between task and resting-state conditions, and highlight the role of the thalamus in change of network configurations in task vs. rest.

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.

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

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.

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.

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.

Task vs. rest—different network configurations between the coactivation and the resting-state brain networks

Science.gov (United States)

Di, Xin; Gohel, Suril; Kim, Eun H.; Biswal, Bharat B.

2013-01-01

There is a growing interest in studies of human brain networks using resting-state functional magnetic resonance imaging (fMRI). However, it is unclear whether and how brain networks measured during the resting-state exhibit comparable properties to brain networks during task performance. In the present study, we investigated meta-analytic coactivation patterns among brain regions based upon published neuroimaging studies, and compared the coactivation network configurations with those in the resting-state network. The strength of resting-state functional connectivity between two regions were strongly correlated with the coactivation strength. However, the coactivation network showed greater global efficiency, smaller mean clustering coefficient, and lower modularity compared with the resting-state network, which suggest a more efficient global information transmission and between system integrations during task performing. Hub shifts were also observed within the thalamus and the left inferior temporal cortex. The thalamus and the left inferior temporal cortex exhibited higher and lower degrees, respectively in the coactivation network compared with the resting-state network. These results shed light regarding the reconfiguration of the brain networks between task and resting-state conditions, and highlight the role of the thalamus in change of network configurations in task vs. rest. PMID:24062654

Probabilistic Inference: Task Dependency and Individual Differences of Probability Weighting Revealed by Hierarchical Bayesian Modeling.

Science.gov (United States)

Boos, Moritz; Seer, Caroline; Lange, Florian; Kopp, Bruno

2016-01-01

Cognitive determinants of probabilistic inference were examined using hierarchical Bayesian modeling techniques. A classic urn-ball paradigm served as experimental strategy, involving a factorial two (prior probabilities) by two (likelihoods) design. Five computational models of cognitive processes were compared with the observed behavior. Parameter-free Bayesian posterior probabilities and parameter-free base rate neglect provided inadequate models of probabilistic inference. The introduction of distorted subjective probabilities yielded more robust and generalizable results. A general class of (inverted) S-shaped probability weighting functions had been proposed; however, the possibility of large differences in probability distortions not only across experimental conditions, but also across individuals, seems critical for the model's success. It also seems advantageous to consider individual differences in parameters of probability weighting as being sampled from weakly informative prior distributions of individual parameter values. Thus, the results from hierarchical Bayesian modeling converge with previous results in revealing that probability weighting parameters show considerable task dependency and individual differences. Methodologically, this work exemplifies the usefulness of hierarchical Bayesian modeling techniques for cognitive psychology. Theoretically, human probabilistic inference might be best described as the application of individualized strategic policies for Bayesian belief revision.

Probabilistic inference: Task dependency and individual differences of probability weighting revealed by hierarchical Bayesian modelling

Directory of Open Access Journals (Sweden)

Moritz eBoos

2016-05-01

Full Text Available Cognitive determinants of probabilistic inference were examined using hierarchical Bayesian modelling techniques. A classic urn-ball paradigm served as experimental strategy, involving a factorial two (prior probabilities by two (likelihoods design. Five computational models of cognitive processes were compared with the observed behaviour. Parameter-free Bayesian posterior probabilities and parameter-free base rate neglect provided inadequate models of probabilistic inference. The introduction of distorted subjective probabilities yielded more robust and generalizable results. A general class of (inverted S-shaped probability weighting functions had been proposed; however, the possibility of large differences in probability distortions not only across experimental conditions, but also across individuals, seems critical for the model’s success. It also seems advantageous to consider individual differences in parameters of probability weighting as being sampled from weakly informative prior distributions of individual parameter values. Thus, the results from hierarchical Bayesian modelling converge with previous results in revealing that probability weighting parameters show considerable task dependency and individual differences. Methodologically, this work exemplifies the usefulness of hierarchical Bayesian modelling techniques for cognitive psychology. Theoretically, human probabilistic inference might be best described as the application of individualized strategic policies for Bayesian belief revision.

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.

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.

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

Science.gov (United States)

Keskin, Mustafa; Deviren, Bayram; Kocakaplan, Yusuf

2011-02-01

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

Construction of mammographic examination process ontology using bottom-up hierarchical task analysis.

Science.gov (United States)

Yagahara, Ayako; Yokooka, Yuki; Jiang, Guoqian; Tsuji, Shintarou; Fukuda, Akihisa; Nishimoto, Naoki; Kurowarabi, Kunio; Ogasawara, Katsuhiko

2018-03-01

Describing complex mammography examination processes is important for improving the quality of mammograms. It is often difficult for experienced radiologic technologists to explain the process because their techniques depend on their experience and intuition. In our previous study, we analyzed the process using a new bottom-up hierarchical task analysis and identified key components of the process. Leveraging the results of the previous study, the purpose of this study was to construct a mammographic examination process ontology to formally describe the relationships between the process and image evaluation criteria to improve the quality of mammograms. First, we identified and created root classes: task, plan, and clinical image evaluation (CIE). Second, we described an "is-a" relation referring to the result of the previous study and the structure of the CIE. Third, the procedural steps in the ontology were described using the new properties: "isPerformedBefore," "isPerformedAfter," and "isPerformedAfterIfNecessary." Finally, the relationships between tasks and CIEs were described using the "isAffectedBy" property to represent the influence of the process on image quality. In total, there were 219 classes in the ontology. By introducing new properties related to the process flow, a sophisticated mammography examination process could be visualized. In relationships between tasks and CIEs, it became clear that the tasks affecting the evaluation criteria related to positioning were greater in number than those for image quality. We developed a mammographic examination process ontology that makes knowledge explicit for a comprehensive mammography process. Our research will support education and help promote knowledge sharing about mammography examination expertise.

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.

Hierarchical classification with a competitive evolutionary neural tree.

Science.gov (United States)

Adams, R G.; Butchart, K; Davey, N

1999-04-01

A new, dynamic, tree structured network, the Competitive Evolutionary Neural Tree (CENT) is introduced. The network is able to provide a hierarchical classification of unlabelled data sets. The main advantage that the CENT offers over other hierarchical competitive networks is its ability to self determine the number, and structure, of the competitive nodes in the network, without the need for externally set parameters. The network produces stable classificatory structures by halting its growth using locally calculated heuristics. The results of network simulations are presented over a range of data sets, including Anderson's IRIS data set. The CENT network demonstrates its ability to produce a representative hierarchical structure to classify a broad range of data sets.

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.

Classifying Secondary Task Driving Safety Using Method of F-ANP

Directory of Open Access Journals (Sweden)

Lisheng Jin

2015-02-01

Full Text Available This study was designed to build an evaluation system for secondary task driving safety by using method of Fuzzy Analytic Network Process (F-ANP. Forty drivers completed driving on driving simulator while interacting with or without a secondary task. Measures of fixations, saccades, and vehicle running status were analyzed. According to five experts' opinions, a hierarchical model for secondary task driving safety evaluation was built. The hierarchical model was divided into three levels: goal, assessment dimension, and criteria. Seven indexes make up the level of criteria, and the assessment dimension includes two clusters: vehicle control risk and driver eye movement risk. By method of F-ANP, the priorities of the criteria and the subcriteria were determined. Furthermore, to rank the driving safety, an approach based on the principle of maximum membership degree was adopted. At last, a case study of secondary task driving safety evaluation by forty drivers using the proposed method was done. The results indicated that the application of the proposed method is practically feasible and adoptable for secondary task driving safety evaluation.

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.

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.

Hierarchical structure of moral stages assessed by a sorting task

NARCIS (Netherlands)

Boom, J.; Brugman, D.; Van der Heijden, P.G.M.

2001-01-01

Following criticism of Kohlberg’s theory of moral judgment, an empirical re-examination of hierarchical stage structure was desirable. Utilizing Piaget’s concept of reflective abstraction as a basis, the hierarchical stage structure was investigated using a new method. Study participants (553 Dutch

Real-time Human Activity Recognition using a Body Sensor Network

DEFF Research Database (Denmark)

Wang, Liang; Gu, Tao; Chen, Hanhua

2010-01-01

Real-time activity recognition using body sensor networks is an important and challenging task and it has many potential applications. In this paper, we propose a realtime, hierarchical model to recognize both simple gestures and complex activities using a wireless body sensor network. In this mo...

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.

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

Science.gov (United States)

Kocakaplan, Yusuf; Deviren, Bayram; Keskin, Mustafa

2012-12-01

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

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.

Crowdsourcing sensor tasks to a socio-geographic network

NARCIS (Netherlands)

Lasnia, Damian; Broering, Arne; Jirka, Simon; Remke, Albert; Pianho, M.; Santos, M.Y.; Pundt, H.

2010-01-01

This work describes an approach of a socio-geographic network for crowdsourcing sensor tasks to a human sensor web. Users can register as human sensors at the system by defining their skills and impact area. Based on that information, submitted sensor tasks are forwarded to the most suitable human

Integration and segregation of large-scale brain networks during short-term task automatization.

Science.gov (United States)

Mohr, Holger; Wolfensteller, Uta; Betzel, Richard F; Mišić, Bratislav; Sporns, Olaf; Richiardi, Jonas; Ruge, Hannes

2016-11-03

The human brain is organized into large-scale functional networks that can flexibly reconfigure their connectivity patterns, supporting both rapid adaptive control and long-term learning processes. However, it has remained unclear how short-term network dynamics support the rapid transformation of instructions into fluent behaviour. Comparing fMRI data of a learning sample (N=70) with a control sample (N=67), we find that increasingly efficient task processing during short-term practice is associated with a reorganization of large-scale network interactions. Practice-related efficiency gains are facilitated by enhanced coupling between the cingulo-opercular network and the dorsal attention network. Simultaneously, short-term task automatization is accompanied by decreasing activation of the fronto-parietal network, indicating a release of high-level cognitive control, and a segregation of the default mode network from task-related networks. These findings suggest that short-term task automatization is enabled by the brain's ability to rapidly reconfigure its large-scale network organization involving complementary integration and segregation processes.

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

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

Intelligence is differentially related to neural effort in the task-positive and the task-negative brain network

NARCIS (Netherlands)

Basten, U.; Stelzel, C.; Fiebach, C.J.

2013-01-01

Previous studies on individual differences in intelligence and brain activation during cognitive processing focused on brain regions where activation increases with task demands (task-positive network, TPN). Our study additionally considers brain regions where activation decreases with task demands

Resting-State Network Topology Differentiates Task Signals across the Adult Life Span.

Science.gov (United States)

Chan, Micaela Y; Alhazmi, Fahd H; Park, Denise C; Savalia, Neil K; Wig, Gagan S

2017-03-08

Brain network connectivity differs across individuals. For example, older adults exhibit less segregated resting-state subnetworks relative to younger adults (Chan et al., 2014). It has been hypothesized that individual differences in network connectivity impact the recruitment of brain areas during task execution. While recent studies have described the spatial overlap between resting-state functional correlation (RSFC) subnetworks and task-evoked activity, it is unclear whether individual variations in the connectivity pattern of a brain area (topology) relates to its activity during task execution. We report data from 238 cognitively normal participants (humans), sampled across the adult life span (20-89 years), to reveal that RSFC-based network organization systematically relates to the recruitment of brain areas across two functionally distinct tasks (visual and semantic). The functional activity of brain areas (network nodes) were characterized according to their patterns of RSFC: nodes with relatively greater connections to nodes in their own functional system ("non-connector" nodes) exhibited greater activity than nodes with relatively greater connections to nodes in other systems ("connector" nodes). This "activation selectivity" was specific to those brain systems that were central to each of the tasks. Increasing age was accompanied by less differentiated network topology and a corresponding reduction in activation selectivity (or differentiation) across relevant network nodes. The results provide evidence that connectional topology of brain areas quantified at rest relates to the functional activity of those areas during task. Based on these findings, we propose a novel network-based theory for previous reports of the "dedifferentiation" in brain activity observed in aging. SIGNIFICANCE STATEMENT Similar to other real-world networks, the organization of brain networks impacts their function. As brain network connectivity patterns differ across

Task-Related Modulations of BOLD Low-Frequency Fluctuations within the Default Mode Network

Science.gov (United States)

Tommasin, Silvia; Mascali, Daniele; Gili, Tommaso; Assan, Ibrahim Eid; Moraschi, Marta; Fratini, Michela; Wise, Richard G.; Macaluso, Emiliano; Mangia, Silvia; Giove, Federico

2017-01-01

Spontaneous low-frequency Blood-Oxygenation Level-Dependent (BOLD) signals acquired during resting state are characterized by spatial patterns of synchronous fluctuations, ultimately leading to the identification of robust brain networks. The resting-state brain networks, including the Default Mode Network (DMN), are demonstrated to persist during sustained task execution, but the exact features of task-related changes of network properties are still not well characterized. In this work we sought to examine in a group of 20 healthy volunteers (age 33 ± 6 years, 8 F/12 M) the relationship between changes of spectral and spatiotemporal features of one prominent resting-state network, namely the DMN, during the continuous execution of a working memory n-back task. We found that task execution impacted on both functional connectivity and amplitude of BOLD fluctuations within large parts of the DMN, but these changes correlated between each other only in a small area of the posterior cingulate. We conclude that combined analysis of multiple parameters related to connectivity, and their changes during the transition from resting state to continuous task execution, can contribute to a better understanding of how brain networks rearrange themselves in response to a task. PMID:28845420

Task-Related Modulations of BOLD Low-Frequency Fluctuations within the Default Mode Network

Directory of Open Access Journals (Sweden)

Silvia Tommasin

2017-07-01

Full Text Available Spontaneous low-frequency Blood-Oxygenation Level-Dependent (BOLD signals acquired during resting state are characterized by spatial patterns of synchronous fluctuations, ultimately leading to the identification of robust brain networks. The resting-state brain networks, including the Default Mode Network (DMN, are demonstrated to persist during sustained task execution, but the exact features of task-related changes of network properties are still not well characterized. In this work we sought to examine in a group of 20 healthy volunteers (age 33 ± 6 years, 8 F/12 M the relationship between changes of spectral and spatiotemporal features of one prominent resting-state network, namely the DMN, during the continuous execution of a working memory n-back task. We found that task execution impacted on both functional connectivity and amplitude of BOLD fluctuations within large parts of the DMN, but these changes correlated between each other only in a small area of the posterior cingulate. We conclude that combined analysis of multiple parameters related to connectivity, and their changes during the transition from resting state to continuous task execution, can contribute to a better understanding of how brain networks rearrange themselves in response to a task.

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.

Function approximation of tasks by neural networks

International Nuclear Information System (INIS)

Gougam, L.A.; Chikhi, A.; Mekideche-Chafa, F.

2008-01-01

For several years now, neural network models have enjoyed wide popularity, being applied to problems of regression, classification and time series analysis. Neural networks have been recently seen as attractive tools for developing efficient solutions for many real world problems in function approximation. The latter is a very important task in environments where computation has to be based on extracting information from data samples in real world processes. In a previous contribution, we have used a well known simplified architecture to show that it provides a reasonably efficient, practical and robust, multi-frequency analysis. We have investigated the universal approximation theory of neural networks whose transfer functions are: sigmoid (because of biological relevance), Gaussian and two specified families of wavelets. The latter have been found to be more appropriate to use. The aim of the present contribution is therefore to use a m exican hat wavelet a s transfer function to approximate different tasks relevant and inherent to various applications in physics. The results complement and provide new insights into previously published results on this problem

Analysis of genetic association using hierarchical clustering and cluster validation indices.

Science.gov (United States)

Pagnuco, Inti A; Pastore, Juan I; Abras, Guillermo; Brun, Marcel; Ballarin, Virginia L

2017-10-01

It is usually assumed that co-expressed genes suggest co-regulation in the underlying regulatory network. Determining sets of co-expressed genes is an important task, based on some criteria of similarity. This task is usually performed by clustering algorithms, where the genes are clustered into meaningful groups based on their expression values in a set of experiment. In this work, we propose a method to find sets of co-expressed genes, based on cluster validation indices as a measure of similarity for individual gene groups, and a combination of variants of hierarchical clustering to generate the candidate groups. We evaluated its ability to retrieve significant sets on simulated correlated and real genomics data, where the performance is measured based on its detection ability of co-regulated sets against a full search. Additionally, we analyzed the quality of the best ranked groups using an online bioinformatics tool that provides network information for the selected genes. Copyright © 2017 Elsevier Inc. All rights reserved.

Task and task-free fMRI reproducibility comparison for motor network identification

NARCIS (Netherlands)

Kristo, G.; Rutten, G.J.; Raemaekers, M.; de Gelder, B.; Rombouts, S.A.R.B.; Ramsey, N.F.

2014-01-01

Test-retest reliability of individual functional magnetic resonance imaging (fMRI) results is of importance in clinical practice and longitudinal experiments. While several studies have investigated reliability of task-induced motor network activation, less is known about the reliability of the

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.

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

Convolutional neural networks and face recognition task

Science.gov (United States)

Sochenkova, A.; Sochenkov, I.; Makovetskii, A.; Vokhmintsev, A.; Melnikov, A.

2017-09-01

Computer vision tasks are remaining very important for the last couple of years. One of the most complicated problems in computer vision is face recognition that could be used in security systems to provide safety and to identify person among the others. There is a variety of different approaches to solve this task, but there is still no universal solution that would give adequate results in some cases. Current paper presents following approach. Firstly, we extract an area containing face, then we use Canny edge detector. On the next stage we use convolutional neural networks (CNN) to finally solve face recognition and person identification task.

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.

Task-related modulations of BOLD low-frequency fluctuations within the default mode network

Science.gov (United States)

Tommasin, Silvia; Mascali, Daniele; Gili, Tommaso; Eid Assan, Ibrahim; Moraschi, Marta; Fratini, Michela; Wise, Richard G.; Macaluso, Emiliano; Mangia, Silvia; Giove, Federico

2017-07-01

Spontaneous low-frequency Blood-Oxygenation Level-Dependent (BOLD) signals acquired during resting state are characterized by spatial patterns of synchronous fluctuations, ultimately leading to the identification of robust brain networks. The resting-state brain networks, including the Default Mode Network (DMN), are demonstrated to persist during sustained task execution, but the exact features of task-related changes of network properties are still not well characterized. In this work we sought to examine in a group of 20 healthy volunteers (age 33±6 years, 8F/12M) the relationship between changes of spectral and spatiotemporal features of one prominent resting-state network, namely the DMN, during the steady-state execution of a sustained working memory n-back task. We found that the steady state execution of such a task impacted on both functional connectivity and amplitude of BOLD fluctuations within large parts of the DMN, but these changes correlated between each other only in a small area of the posterior cingulate. We conclude that combined analysis of multiple parameters related to connectivity, and their changes during the transition from resting state to steady-state task execution, can contribute to a better understanding of how brain networks rearrange themselves in response of a task.

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

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

Applying Hierarchical Task Analysis Method to Discovery Layer Evaluation

Directory of Open Access Journals (Sweden)

Marlen Promann

2015-03-01

Full Text Available Libraries are implementing discovery layers to offer better user experiences. While usability tests have been helpful in evaluating the success or failure of implementing discovery layers in the library context, the focus has remained on its relative interface benefits over the traditional federated search. The informal site- and context specific usability tests have offered little to test the rigor of the discovery layers against the user goals, motivations and workflow they have been designed to support. This study proposes hierarchical task analysis (HTA as an important complementary evaluation method to usability testing of discovery layers. Relevant literature is reviewed for the discovery layers and the HTA method. As no previous application of HTA to the evaluation of discovery layers was found, this paper presents the application of HTA as an expert based and workflow centered (e.g. retrieving a relevant book or a journal article method to evaluating discovery layers. Purdue University’s Primo by Ex Libris was used to map eleven use cases as HTA charts. Nielsen’s Goal Composition theory was used as an analytical framework to evaluate the goal carts from two perspectives: a users’ physical interactions (i.e. clicks, and b user’s cognitive steps (i.e. decision points for what to do next. A brief comparison of HTA and usability test findings is offered as a way of conclusion.

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.

Identifying beneficial task relations for multi-task learning in deep neural networks

DEFF Research Database (Denmark)

Bingel, Joachim; Søgaard, Anders

2017-01-01

Multi-task learning (MTL) in deep neural networks for NLP has recently received increasing interest due to some compelling benefits, including its potential to efficiently regularize models and to reduce the need for labeled data. While it has brought significant improvements in a number of NLP...

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 nonlinear dynamics of human attention.

Science.gov (United States)

Rabinovich, Mikhail I; Tristan, Irma; Varona, Pablo

2015-08-01

Attention is the process of focusing mental resources on a specific cognitive/behavioral task. Such brain dynamics involves different partially overlapping brain functional networks whose interconnections change in time according to the performance stage, and can be stimulus-driven or induced by an intrinsically generated goal. The corresponding activity can be described by different families of spatiotemporal discrete patterns or sequential dynamic modes. Since mental resources are finite, attention modalities compete with each other at all levels of the hierarchy, from perception to decision making and behavior. Cognitive activity is a dynamical process and attention possesses some universal dynamical characteristics. Thus, it is time to apply nonlinear dynamical theory for the description and prediction of hierarchical attentional tasks. Such theory has to include the analyses of attentional control stability, the time cost of attention switching, the finite capacity of informational resources in the brain, and the normal and pathological bifurcations of attention sequential dynamics. In this paper we have integrated today's knowledge, models and results in these directions. Copyright © 2015 Elsevier Ltd. All rights reserved.

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.

The default mode network and the working memory network are not anti-correlated during all phases of a working memory task.

Science.gov (United States)

Piccoli, Tommaso; Valente, Giancarlo; Linden, David E J; Re, Marta; Esposito, Fabrizio; Sack, Alexander T; Di Salle, Francesco

2015-01-01

The default mode network and the working memory network are known to be anti-correlated during sustained cognitive processing, in a load-dependent manner. We hypothesized that functional connectivity among nodes of the two networks could be dynamically modulated by task phases across time. To address the dynamic links between default mode network and the working memory network, we used a delayed visuo-spatial working memory paradigm, which allowed us to separate three different phases of working memory (encoding, maintenance, and retrieval), and analyzed the functional connectivity during each phase within and between the default mode network and the working memory network networks. We found that the two networks are anti-correlated only during the maintenance phase of working memory, i.e. when attention is focused on a memorized stimulus in the absence of external input. Conversely, during the encoding and retrieval phases, when the external stimulation is present, the default mode network is positively coupled with the working memory network, suggesting the existence of a dynamically switching of functional connectivity between "task-positive" and "task-negative" brain networks. Our results demonstrate that the well-established dichotomy of the human brain (anti-correlated networks during rest and balanced activation-deactivation during cognition) has a more nuanced organization than previously thought and engages in different patterns of correlation and anti-correlation during specific sub-phases of a cognitive task. This nuanced organization reinforces the hypothesis of a direct involvement of the default mode network in cognitive functions, as represented by a dynamic rather than static interaction with specific task-positive networks, such as the working memory network.

Implementation of Hierarchical Task Analysis for User Interface Design in Drawing Application for Early Childhood Education

Directory of Open Access Journals (Sweden)

Mira Kania Sabariah

2016-05-01

Full Text Available Draw learning in early childhood is an important lesson and full of stimulation of the process of growth and development of children which could help to train the fine motor skills. We have had a lot of applications that can be used to perform learning, including interactive learning applications. Referring to the observations that have been conducted showed that the experiences given by the applications that exist today are very diverse and have not been able to represent the model of learning and characteristics of early childhood (4-6 years. Based on the results, Hierarchical Task Analysis method generated a list of tasks that must be done in designing an user interface that represents the user experience in draw learning. Then by using the Heuristic Evaluation method the usability of the model has fulfilled a very good level of understanding and also it can be enhanced and produce a better model.

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

Is a Responsive Default Mode Network Required for Successful Working Memory Task Performance?

Science.gov (United States)

Čeko, Marta; Gracely, John L; Fitzcharles, Mary-Ann; Seminowicz, David A; Schweinhardt, Petra; Bushnell, M Catherine

2015-08-19

In studies of cognitive processing using tasks with externally directed attention, regions showing increased (external-task-positive) and decreased or "negative" [default-mode network (DMN)] fMRI responses during task performance are dynamically responsive to increasing task difficulty. Responsiveness (modulation of fMRI signal by increasing load) has been linked directly to successful cognitive task performance in external-task-positive regions but not in DMN regions. To investigate whether a responsive DMN is required for successful cognitive performance, we compared healthy human subjects (n = 23) with individuals shown to have decreased DMN engagement (chronic pain patients, n = 28). Subjects performed a multilevel working-memory task (N-back) during fMRI. If a responsive DMN is required for successful performance, patients having reduced DMN responsiveness should show worsened performance; if performance is not reduced, their brains should show compensatory activation in external-task-positive regions or elsewhere. All subjects showed decreased accuracy and increased reaction times with increasing task level, with no significant group differences on either measure at any level. Patients had significantly reduced negative fMRI response (deactivation) of DMN regions (posterior cingulate/precuneus, medial prefrontal cortex). Controls showed expected modulation of DMN deactivation with increasing task difficulty. Patients showed significantly reduced modulation of DMN deactivation by task difficulty, despite their successful task performance. We found no evidence of compensatory neural recruitment in external-task-positive regions or elsewhere. Individual responsiveness of the external-task-positive ventrolateral prefrontal cortex, but not of DMN regions, correlated with task accuracy. These findings suggest that a responsive DMN may not be required for successful cognitive performance; a responsive external-task-positive network may be sufficient. We studied the

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.

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.

Privacy-Preserving Task Assignment in Spatial Crowdsourcing

KAUST Repository

Liu, An

2017-09-20

With the progress of mobile devices and wireless networks, spatial crowdsourcing (SC) is emerging as a promising approach for problem solving. In SC, spatial tasks are assigned to and performed by a set of human workers. To enable effective task assignment, however, both workers and task requesters are required to disclose their locations to untrusted SC systems. In this paper, we study the problem of assigning workers to tasks in a way that location privacy for both workers and task requesters is preserved. We first combine the Paillier cryptosystem with Yao’s garbled circuits to construct a secure protocol that assigns the nearest worker to a task. Considering that this protocol cannot scale to a large number of workers, we then make use of Geohash, a hierarchical spatial index to design a more efficient protocol that can securely find approximate nearest workers. We theoretically show that these two protocols are secure against semi-honest adversaries. Through extensive experiments on two real-world datasets, we demonstrate the efficiency and effectiveness of our protocols.

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.

Meditation leads to reduced default mode network activity beyond an active task.

Science.gov (United States)

Garrison, Kathleen A; Zeffiro, Thomas A; Scheinost, Dustin; Constable, R Todd; Brewer, Judson A

2015-09-01

Meditation has been associated with relatively reduced activity in the default mode network, a brain network implicated in self-related thinking and mind wandering. However, previous imaging studies have typically compared meditation to rest, despite other studies having reported differences in brain activation patterns between meditators and controls at rest. Moreover, rest is associated with a range of brain activation patterns across individuals that has only recently begun to be better characterized. Therefore, in this study we compared meditation to another active cognitive task, both to replicate the findings that meditation is associated with relatively reduced default mode network activity and to extend these findings by testing whether default mode activity was reduced during meditation, beyond the typical reductions observed during effortful tasks. In addition, prior studies had used small groups, whereas in the present study we tested these hypotheses in a larger group. The results indicated that meditation is associated with reduced activations in the default mode network, relative to an active task, for meditators as compared to controls. Regions of the default mode network showing a Group × Task interaction included the posterior cingulate/precuneus and anterior cingulate cortex. These findings replicate and extend prior work indicating that the suppression of default mode processing may represent a central neural process in long-term meditation, and they suggest that meditation leads to relatively reduced default mode processing beyond that observed during another active cognitive task.

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.

Optimal task scheduling policy in energy harvesting wireless sensor networks

NARCIS (Netherlands)

Rao, Vijay S.; Prasad, R. Venkatesha; Niemegeers, Ignas G M M

2015-01-01

Ambient energy harvesting for Wireless Sensor Networks (WSNs) is being pitched as a promising solution for long-lasting deployments in various WSN applications. However, the sensor nodes most often do not have enough energy to handle application, network and house-keeping tasks because amount of

Differential recruitment of theory of mind brain network across three tasks: An independent component analysis.

Science.gov (United States)

Thye, Melissa D; Ammons, Carla J; Murdaugh, Donna L; Kana, Rajesh K

2018-07-16

Social neuroscience research has focused on an identified network of brain regions primarily associated with processing Theory of Mind (ToM). However, ToM is a broad cognitive process, which encompasses several sub-processes, such as mental state detection and intentional attribution, and the connectivity of brain regions underlying the broader ToM network in response to paradigms assessing these sub-processes requires further characterization. Standard fMRI analyses which focus only on brain activity cannot capture information about ToM processing at a network level. An alternative method, independent component analysis (ICA), is a data-driven technique used to isolate intrinsic connectivity networks, and this approach provides insight into network-level regional recruitment. In this fMRI study, three complementary, but distinct ToM tasks assessing mental state detection (e.g. RMIE: Reading the Mind in the Eyes; RMIV: Reading the Mind in the Voice) and intentional attribution (Causality task) were each analyzed using ICA in order to separately characterize the recruitment and functional connectivity of core nodes in the ToM network in response to the sub-processes of ToM. Based on visual comparison of the derived networks for each task, the spatiotemporal network patterns were similar between the RMIE and RMIV tasks, which elicited mentalizing about the mental states of others, and these networks differed from the network derived for the Causality task, which elicited mentalizing about goal-directed actions. The medial prefrontal cortex, precuneus, and right inferior frontal gyrus were seen in the components with the highest correlation with the task condition for each of the tasks highlighting the role of these regions in general ToM processing. Using a data-driven approach, the current study captured the differences in task-related brain response to ToM in three distinct ToM paradigms. The findings of this study further elucidate the neural mechanisms associated

A study on optimal task decomposition of networked parallel computing using PVM

International Nuclear Information System (INIS)

Seong, Kwan Jae; Kim, Han Gyoo

1998-01-01

A numerical study is performed to investigate the effect of task decomposition on networked parallel processes using Parallel Virtual Machine (PVM). In our study, a PVM program distributed over a network of workstations is used in solving a finite difference version of a one dimensional heat equation, where natural choice of PVM programming structure would be the master-slave paradigm, with the aim of finding an optimal configuration resulting in least computing time including communication overhead among machines. Given a set of PVM tasks comprised of one master and five slave programs, it is found that there exists a pseudo-optimal number of machines, which does not necessarily coincide with the number of tasks, that yields the best performance when the network is under a light usage. Increasing the number of machines beyond this optimal one does not improve computing performance since increase in communication overhead among the excess number of machines offsets the decrease in CPU time obtained by distributing the PVM tasks among these machines. However, when the network traffic is heavy, the results exhibit a more random characteristic that is explained by the random nature of data transfer time

Is a Responsive Default Mode Network Required for Successful Working Memory Task Performance?

Science.gov (United States)

Čeko, Marta; Gracely, John L.; Fitzcharles, Mary-Ann; Seminowicz, David A.; Schweinhardt, Petra

2015-01-01

In studies of cognitive processing using tasks with externally directed attention, regions showing increased (external-task-positive) and decreased or “negative” [default-mode network (DMN)] fMRI responses during task performance are dynamically responsive to increasing task difficulty. Responsiveness (modulation of fMRI signal by increasing load) has been linked directly to successful cognitive task performance in external-task-positive regions but not in DMN regions. To investigate whether a responsive DMN is required for successful cognitive performance, we compared healthy human subjects (n = 23) with individuals shown to have decreased DMN engagement (chronic pain patients, n = 28). Subjects performed a multilevel working-memory task (N-back) during fMRI. If a responsive DMN is required for successful performance, patients having reduced DMN responsiveness should show worsened performance; if performance is not reduced, their brains should show compensatory activation in external-task-positive regions or elsewhere. All subjects showed decreased accuracy and increased reaction times with increasing task level, with no significant group differences on either measure at any level. Patients had significantly reduced negative fMRI response (deactivation) of DMN regions (posterior cingulate/precuneus, medial prefrontal cortex). Controls showed expected modulation of DMN deactivation with increasing task difficulty. Patients showed significantly reduced modulation of DMN deactivation by task difficulty, despite their successful task performance. We found no evidence of compensatory neural recruitment in external-task-positive regions or elsewhere. Individual responsiveness of the external-task-positive ventrolateral prefrontal cortex, but not of DMN regions, correlated with task accuracy. These findings suggest that a responsive DMN may not be required for successful cognitive performance; a responsive external-task-positive network may be sufficient

Analysis of Time-Dependent Brain Network on Active and MI Tasks for Chronic Stroke Patients.

Directory of Open Access Journals (Sweden)

Da-Hye Kim

Full Text Available Several researchers have analyzed brain activities by investigating brain networks. However, there is a lack of the research on the temporal characteristics of the brain network during a stroke by EEG and the comparative studies between motor execution and imagery, which became known to have similar motor functions and pathways. In this study, we proposed the possibility of temporal characteristics on the brain networks of a stroke. We analyzed the temporal properties of the brain networks for nine chronic stroke patients by the active and motor imagery tasks by EEG. High beta band has a specific role in the brain network during motor tasks. In the high beta band, for the active task, there were significant characteristics of centrality and small-worldness on bilateral primary motor cortices at the initial motor execution. The degree centrality significantly increased on the contralateral primary motor cortex, and local efficiency increased on the ipsilateral primary motor cortex. These results indicate that the ipsilateral primary motor cortex constructed a powerful subnetwork by influencing the linked channels as compensatory effect, although the contralateral primary motor cortex organized an inefficient network by using the connected channels due to lesions. For the MI task, degree centrality and local efficiency significantly decreased on the somatosensory area at the initial motor imagery. Then, there were significant correlations between the properties of brain networks and motor function on the contralateral primary motor cortex and somatosensory area for each motor execution/imagery task. Our results represented that the active and MI tasks have different mechanisms of motor acts. Based on these results, we indicated the possibility of customized rehabilitation according to different motor tasks. We expect these results to help in the construction of the customized rehabilitation system depending on motor tasks by understanding temporal

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)

Persistency and flexibility of complex brain networks underlie dual-task interference.

Science.gov (United States)

Alavash, Mohsen; Hilgetag, Claus C; Thiel, Christiane M; Gießing, Carsten

2015-09-01

Previous studies on multitasking suggest that performance decline during concurrent task processing arises from interfering brain modules. Here, we used graph-theoretical network analysis to define functional brain modules and relate the modular organization of complex brain networks to behavioral dual-task costs. Based on resting-state and task fMRI we explored two organizational aspects potentially associated with behavioral interference when human subjects performed a visuospatial and speech task simultaneously: the topological overlap between persistent single-task modules, and the flexibility of single-task modules in adaptation to the dual-task condition. Participants showed a significant decline in visuospatial accuracy in the dual-task compared with single visuospatial task. Global analysis of topological similarity between modules revealed that the overlap between single-task modules significantly correlated with the decline in visuospatial accuracy. Subjects with larger overlap between single-task modules showed higher behavioral interference. Furthermore, lower flexible reconfiguration of single-task modules in adaptation to the dual-task condition significantly correlated with larger decline in visuospatial accuracy. Subjects with lower modular flexibility showed higher behavioral interference. At the regional level, higher overlap between single-task modules and less modular flexibility in the somatomotor cortex positively correlated with the decline in visuospatial accuracy. Additionally, higher modular flexibility in cingulate and frontal control areas and lower flexibility in right-lateralized nodes comprising the middle occipital and superior temporal gyri supported dual-tasking. Our results suggest that persistency and flexibility of brain modules are important determinants of dual-task costs. We conclude that efficient dual-tasking benefits from a specific balance between flexibility and rigidity of functional brain modules. © 2015 Wiley

A Novel Connectionist Network for Solving Long Time-Lag Prediction Tasks

Science.gov (United States)

Johnson, Keith; MacNish, Cara

Traditional Recurrent Neural Networks (RNNs) perform poorly on learning tasks involving long time-lag dependencies. More recent approaches such as LSTM and its variants significantly improve on RNNs ability to learn this type of problem. We present an alternative approach to encoding temporal dependencies that associates temporal features with nodes rather than state values, where the nodes explicitly encode dependencies over variable time delays. We show promising results comparing the network's performance to LSTM variants on an extended Reber grammar task.

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.

Dynamic Task Allocation in Multi-Hop Multimedia Wireless Sensor Networks with Low Mobility

Directory of Open Access Journals (Sweden)

Klaus Moessner

2013-10-01

Full Text Available This paper presents a task allocation-oriented framework to enable efficient in-network processing and cost-effective multi-hop resource sharing for dynamic multi-hop multimedia wireless sensor networks with low node mobility, e.g., pedestrian speeds. The proposed system incorporates a fast task reallocation algorithm to quickly recover from possible network service disruptions, such as node or link failures. An evolutional self-learning mechanism based on a genetic algorithm continuously adapts the system parameters in order to meet the desired application delay requirements, while also achieving a sufficiently long network lifetime. Since the algorithm runtime incurs considerable time delay while updating task assignments, we introduce an adaptive window size to limit the delay periods and ensure an up-to-date solution based on node mobility patterns and device processing capabilities. To the best of our knowledge, this is the first study that yields multi-objective task allocation in a mobile multi-hop wireless environment under dynamic conditions. Simulations are performed in various settings, and the results show considerable performance improvement in extending network lifetime compared to heuristic mechanisms. Furthermore, the proposed framework provides noticeable reduction in the frequency of missing application deadlines.

Shared "core" areas between the pain and other task-related networks.

Directory of Open Access Journals (Sweden)

Franco Cauda

Full Text Available The idea of a 'pain matrix' specifically devoted to the processing of nociceptive inputs has been challenged. Alternative views now propose that the activity of the primary and secondary somatosensory cortices (SI, SII, the insula and cingulate cortex may be related to a basic defensive system through which significant potentially dangerous events for the body's integrity are detected. By reviewing the role of the SI, SII, the cingulate and the insular cortices in the perception of nociceptive and tactile stimuli, in attentional, emotional and reward tasks, and in interoception and memory, we found that all these task-related networks overlap in the dorsal anterior cingulate cortex, the anterior insula and the dorsal medial thalamus. A thorough analysis revealed that the 'pain-related' network shares important functional similarities with both somatomotor-somatosensory networks and emotional-interoceptive ones. We suggest that these shared areas constitute the central part of an adaptive control system involved in the processing and integration of salient information coming both from external and internal sources. These areas are activated in almost all fMRI tasks and have been indicated to play a pivotal role in switching between externally directed and internally directed brain networks.

Hierarchical control system of advanced robot manipulator

International Nuclear Information System (INIS)

Oomichi, Takeo; Okino, Akihisa; Nishihara, Masatoshi; Sakamoto, Taizou; Matsuda, Koichi; Ohnishi, Ken

1990-01-01

We introduce a double arm with 4-finger's manipulator system which process the large volume of information at high speed. This is under research/development many type of works in the harsh condition. Namely, hierarchization of instruction unit in which motion control system as real time processing unit, and task planning unit as non-real time processing unit, interface with operation through the task planning unit has been made. Also, high speed processing of large volume information has been realized by decentralizing the motion control unit by function, hierarchizing the high speed processing unit, and developing high speed transmission, IC which does not depend on computer OS to avoid the delay in transmission. (author)

Graphs for information security control in software defined networks

Science.gov (United States)

Grusho, Alexander A.; Abaev, Pavel O.; Shorgin, Sergey Ya.; Timonina, Elena E.

2017-07-01

Information security control in software defined networks (SDN) is connected with execution of the security policy rules regulating information accesses and protection against distribution of the malicious code and harmful influences. The paper offers a representation of a security policy in the form of hierarchical structure which in case of distribution of resources for the solution of tasks defines graphs of admissible interactions in a networks. These graphs define commutation tables of switches via the SDN controller.

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 Rhetorical Sentence Categorization for Scientific Papers

Science.gov (United States)

Rachman, G. H.; Khodra, M. L.; Widyantoro, D. H.

2018-03-01

Important information in scientific papers can be composed of rhetorical sentences that is structured from certain categories. To get this information, text categorization should be conducted. Actually, some works in this task have been completed by employing word frequency, semantic similarity words, hierarchical classification, and the others. Therefore, this paper aims to present the rhetorical sentence categorization from scientific paper by employing TF-IDF and Word2Vec to capture word frequency and semantic similarity words and employing hierarchical classification. Every experiment is tested in two classifiers, namely Naïve Bayes and SVM Linear. This paper shows that hierarchical classifier is better than flat classifier employing either TF-IDF or Word2Vec, although it increases only almost 2% from 27.82% when using flat classifier until 29.61% when using hierarchical classifier. It shows also different learning model for child-category can be built by hierarchical classifier.

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

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.

Dual Arm Work Package performance estimates and telerobot task network simulation

International Nuclear Information System (INIS)

Draper, J.V.

1997-01-01

This paper describes the methodology and results of a network simulation study of the Dual Arm Work Package (DAWP), to be employed for dismantling the Argonne National Laboratory CP-5 reactor. The development of the simulation model was based upon the results of a task analysis for the same system. This study was performed by the Oak Ridge National Laboratory (ORNL), in the Robotics and Process Systems Division. Funding was provided the US Department of Energy's Office of Technology Development, Robotics Technology Development Program (RTDP). The RTDP is developing methods of computer simulation to estimate telerobotic system performance. Data were collected to provide point estimates to be used in a task network simulation model. Three skilled operators performed six repetitions of a pipe cutting task representative of typical teleoperation cutting operations

Inverse Reliability Task: Artificial Neural Networks and Reliability-Based Optimization Approaches

OpenAIRE

Lehký , David; Slowik , Ondřej; Novák , Drahomír

2014-01-01

Part 7: Genetic Algorithms; International audience; The paper presents two alternative approaches to solve inverse reliability task – to determine the design parameters to achieve desired target reliabilities. The first approach is based on utilization of artificial neural networks and small-sample simulation Latin hypercube sampling. The second approach considers inverse reliability task as reliability-based optimization task using double-loop method and also small-sample simulation. Efficie...

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.

Bayesian network analysis revealed the connectivity difference of the default mode network from the resting-state to task-state

Science.gov (United States)

Wu, Xia; Yu, Xinyu; Yao, Li; Li, Rui

2014-01-01

Functional magnetic resonance imaging (fMRI) studies have converged to reveal the default mode network (DMN), a constellation of regions that display co-activation during resting-state but co-deactivation during attention-demanding tasks in the brain. Here, we employed a Bayesian network (BN) analysis method to construct a directed effective connectivity model of the DMN and compared the organizational architecture and interregional directed connections under both resting-state and task-state. The analysis results indicated that the DMN was consistently organized into two closely interacting subsystems in both resting-state and task-state. The directed connections between DMN regions, however, changed significantly from the resting-state to task-state condition. The results suggest that the DMN intrinsically maintains a relatively stable structure whether at rest or performing tasks but has different information processing mechanisms under varied states. PMID:25309414

Hierarchical Scheduling Framework Based on Compositional Analysis Using Uppaal

DEFF Research Database (Denmark)

Boudjadar, Jalil; David, Alexandre; Kim, Jin Hyun

2014-01-01

This paper introduces a reconfigurable compositional scheduling framework, in which the hierarchical structure, the scheduling policies, the concrete task behavior and the shared resources can all be reconfigured. The behavior of each periodic preemptive task is given as a list of timed actions, ...

Proposal of Constraints Analysis Method Based on Network Model for Task Planning

Science.gov (United States)

Tomiyama, Tomoe; Sato, Tatsuhiro; Morita, Toyohisa; Sasaki, Toshiro

Deregulation has been accelerating several activities toward reengineering business processes, such as railway through service and modal shift in logistics. Making those activities successful, business entities have to regulate new business rules or know-how (we call them ‘constraints’). According to the new constraints, they need to manage business resources such as instruments, materials, workers and so on. In this paper, we propose a constraint analysis method to define constraints for task planning of the new business processes. To visualize each constraint's influence on planning, we propose a network model which represents allocation relations between tasks and resources. The network can also represent task ordering relations and resource grouping relations. The proposed method formalizes the way of defining constraints manually as repeatedly checking the network structure and finding conflicts between constraints. Being applied to crew scheduling problems shows that the method can adequately represent and define constraints of some task planning problems with the following fundamental features, (1) specifying work pattern to some resources, (2) restricting the number of resources for some works, (3) requiring multiple resources for some works, (4) prior allocation of some resources to some works and (5) considering the workload balance between resources.

An approach to separating the levels of hierarchical structure building in language and mathematics.

Science.gov (United States)

Makuuchi, Michiru; Bahlmann, Jörg; Friederici, Angela D

2012-07-19

We aimed to dissociate two levels of hierarchical structure building in language and mathematics, namely 'first-level' (the build-up of hierarchical structure with externally given elements) and 'second-level' (the build-up of hierarchical structure with internally represented elements produced by first-level processes). Using functional magnetic resonance imaging, we investigated these processes in three domains: sentence comprehension, arithmetic calculation (using Reverse Polish notation, which gives two operands followed by an operator) and a working memory control task. All tasks required the build-up of hierarchical structures at the first- and second-level, resulting in a similar computational hierarchy across language and mathematics, as well as in a working memory control task. Using a novel method that estimates the difference in the integration cost for conditions of different trial durations, we found an anterior-to-posterior functional organization in the prefrontal cortex, according to the level of hierarchy. Common to all domains, the ventral premotor cortex (PMv) supports first-level hierarchy building, while the dorsal pars opercularis (POd) subserves second-level hierarchy building, with lower activation for language compared with the other two tasks. These results suggest that the POd and the PMv support domain-general mechanisms for hierarchical structure building, with the POd being uniquely efficient for language.

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.

Task-specific feature extraction and classification of fMRI volumes using a deep neural network initialized with a deep belief network: Evaluation using sensorimotor tasks.

Science.gov (United States)

Jang, Hojin; Plis, Sergey M; Calhoun, Vince D; Lee, Jong-Hwan

2017-01-15

Feedforward deep neural networks (DNNs), artificial neural networks with multiple hidden layers, have recently demonstrated a record-breaking performance in multiple areas of applications in computer vision and speech processing. Following the success, DNNs have been applied to neuroimaging modalities including functional/structural magnetic resonance imaging (MRI) and positron-emission tomography data. However, no study has explicitly applied DNNs to 3D whole-brain fMRI volumes and thereby extracted hidden volumetric representations of fMRI that are discriminative for a task performed as the fMRI volume was acquired. Our study applied fully connected feedforward DNN to fMRI volumes collected in four sensorimotor tasks (i.e., left-hand clenching, right-hand clenching, auditory attention, and visual stimulus) undertaken by 12 healthy participants. Using a leave-one-subject-out cross-validation scheme, a restricted Boltzmann machine-based deep belief network was pretrained and used to initialize weights of the DNN. The pretrained DNN was fine-tuned while systematically controlling weight-sparsity levels across hidden layers. Optimal weight-sparsity levels were determined from a minimum validation error rate of fMRI volume classification. Minimum error rates (mean±standard deviation; %) of 6.9 (±3.8) were obtained from the three-layer DNN with the sparsest condition of weights across the three hidden layers. These error rates were even lower than the error rates from the single-layer network (9.4±4.6) and the two-layer network (7.4±4.1). The estimated DNN weights showed spatial patterns that are remarkably task-specific, particularly in the higher layers. The output values of the third hidden layer represented distinct patterns/codes of the 3D whole-brain fMRI volume and encoded the information of the tasks as evaluated from representational similarity analysis. Our reported findings show the ability of the DNN to classify a single fMRI volume based on the

The academic library network

Directory of Open Access Journals (Sweden)

Jacek Wojciechowski

2012-01-01

Full Text Available The efficiency of libraries, academic libraries in particular, necessitates organizational changes facilitating or even imposing co-operation. Any structure of any university has to have an integrated network of libraries, with an appropriate division of work, and one that is consolidated as much as it is possible into medium-size or large libraries. Within thus created network, a chance arises to centralize the main library processes based on appropriate procedures in the main library, highly specialized, more effective and therefore cheaper in operation, including a co-ordination of all more important endeavours and tasks. Hierarchically subordinated libraries can be thus more focused on performing their routine service, more and more frequently providing for the whole of the university, and being able to adjust to changeable requirements and demands of patrons and of new tasks resulting from the new model of the university operation. Another necessary change seems to be a universal implementation of an ov rall programme framework that would include all services in the university’s library networks.

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.

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.

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.

Distracted in a Demanding Task : A Classification Study with Artificial Neural Networks

NARCIS (Netherlands)

Huijser, Stefan; Taatgen, Niels; van Vugt, Marieke; Verheij, Bart; Wiering, Marco

An important issue in cognitive science research is to know what your subjects are thinking about. In this paper, we trained multiple artificial Neural Network (ANN) classifiers to predict whether subjects’ thoughts were focused on the task (i.e., on-task) or if they were distracted (i.e.,

Reversal Learning in Humans and Gerbils: Dynamic Control Network Facilitates Learning.

Science.gov (United States)

Jarvers, Christian; Brosch, Tobias; Brechmann, André; Woldeit, Marie L; Schulz, Andreas L; Ohl, Frank W; Lommerzheim, Marcel; Neumann, Heiko

2016-01-01

Biologically plausible modeling of behavioral reinforcement learning tasks has seen great improvements over the past decades. Less work has been dedicated to tasks involving contingency reversals, i.e., tasks in which the original behavioral goal is reversed one or multiple times. The ability to adjust to such reversals is a key element of behavioral flexibility. Here, we investigate the neural mechanisms underlying contingency-reversal tasks. We first conduct experiments with humans and gerbils to demonstrate memory effects, including multiple reversals in which subjects (humans and animals) show a faster learning rate when a previously learned contingency re-appears. Motivated by recurrent mechanisms of learning and memory for object categories, we propose a network architecture which involves reinforcement learning to steer an orienting system that monitors the success in reward acquisition. We suggest that a model sensory system provides feature representations which are further processed by category-related subnetworks which constitute a neural analog of expert networks. Categories are selected dynamically in a competitive field and predict the expected reward. Learning occurs in sequentialized phases to selectively focus the weight adaptation to synapses in the hierarchical network and modulate their weight changes by a global modulator signal. The orienting subsystem itself learns to bias the competition in the presence of continuous monotonic reward accumulation. In case of sudden changes in the discrepancy of predicted and acquired reward the activated motor category can be switched. We suggest that this subsystem is composed of a hierarchically organized network of dis-inhibitory mechanisms, dubbed a dynamic control network (DCN), which resembles components of the basal ganglia. The DCN selectively activates an expert network, corresponding to the current behavioral strategy. The trace of the accumulated reward is monitored such that large sudden

Enhancement of Adaptive Cluster Hierarchical Routing Protocol using Distance and Energy for Wireless Sensor Networks

International Nuclear Information System (INIS)

Nawar, N.M.; Soliman, S.E.; Kelash, H.M.; Ayad, N.M.

2014-01-01

The application of wireless networking is widely used in nuclear applications. This includes reactor control and fire dedication system. This paper is devoted to the application of this concept in the intrusion system of the Radioisotope Production Facility (RPF) of the Egyptian Atomic Energy Authority. This includes the tracking, monitoring and control components of this system. The design and implementation of wireless sensor networks has become a hot area of research due to the extensive use of sensor networks to enable applications that connect the physical world to the virtual world [1-2]. The original LEACH is named a communication protocol (clustering-based); the extended LEACH’s stochastic cluster head selection algorithm by a deterministic component. Depending on the network configuration an increase of network lifetime can be accomplished [3]. The proposed routing mechanisms after enhancement divide the nodes into clusters. A cluster head performs its task which is considerably more energy-intensive than the rest of the nodes inside sensor network. So, nodes rotate tasks at different rounds between a cluster head and other sensors throughout the lifetime of the network to balance the energy dissipation [4-5].The performance improvement when using routing protocol after enhancement of the algorithm which takes into consideration the distance and the remaining energy for choosing the cluster head by obtains from the advertise message. Network Simulator (Ns2 simulator) is used to prove that LEACH after enhancement performs better than the original LEACH protocol in terms of Average Energy, Network Life Time, Delay, Throughput and Overhead.

Brain functional network connectivity based on a visual task: visual information processing-related brain regions are significantly activated in the task state

Directory of Open Access Journals (Sweden)

Yan-li Yang

2015-01-01

Full Text Available It is not clear whether the method used in functional brain-network related research can be applied to explore the feature binding mechanism of visual perception. In this study, we investigated feature binding of color and shape in visual perception. Functional magnetic resonance imaging data were collected from 38 healthy volunteers at rest and while performing a visual perception task to construct brain networks active during resting and task states. Results showed that brain regions involved in visual information processing were obviously activated during the task. The components were partitioned using a greedy algorithm, indicating the visual network existed during the resting state. Z-values in the vision-related brain regions were calculated, confirming the dynamic balance of the brain network. Connectivity between brain regions was determined, and the result showed that occipital and lingual gyri were stable brain regions in the visual system network, the parietal lobe played a very important role in the binding process of color features and shape features, and the fusiform and inferior temporal gyri were crucial for processing color and shape information. Experimental findings indicate that understanding visual feature binding and cognitive processes will help establish computational models of vision, improve image recognition technology, and provide a new theoretical mechanism for feature binding in visual perception.

Hierarchical learning induces two simultaneous, but separable, prediction errors in human basal ganglia.

Science.gov (United States)

Diuk, Carlos; Tsai, Karin; Wallis, Jonathan; Botvinick, Matthew; Niv, Yael

2013-03-27

Studies suggest that dopaminergic neurons report a unitary, global reward prediction error signal. However, learning in complex real-life tasks, in particular tasks that show hierarchical structure, requires multiple prediction errors that may coincide in time. We used functional neuroimaging to measure prediction error signals in humans performing such a hierarchical task involving simultaneous, uncorrelated prediction errors. Analysis of signals in a priori anatomical regions of interest in the ventral striatum and the ventral tegmental area indeed evidenced two simultaneous, but separable, prediction error signals corresponding to the two levels of hierarchy in the task. This result suggests that suitably designed tasks may reveal a more intricate pattern of firing in dopaminergic neurons. Moreover, the need for downstream separation of these signals implies possible limitations on the number of different task levels that we can learn about simultaneously.

Hierarchically Organized Behavior and Its Neural Foundations: A Reinforcement Learning Perspective

Science.gov (United States)

Botvinick, Matthew M.; Niv, Yael; Barto, Andrew C.

2009-01-01

Research on human and animal behavior has long emphasized its hierarchical structure--the divisibility of ongoing behavior into discrete tasks, which are comprised of subtask sequences, which in turn are built of simple actions. The hierarchical structure of behavior has also been of enduring interest within neuroscience, where it has been widely…

Sensor Network Disposition Facing the Task of Multisensor Cross Cueing

Directory of Open Access Journals (Sweden)

Ce Pang

2017-01-01

Full Text Available In order to build the sensor network facing the task of multisensor crossing cueing, the requirements of initiating cueing and being cued are analyzed. Probability theory is used when building models, then probability of sensor cueing in the case of target moving is given, and, after that, the best distance between two sensors is calculated. The operational environment is described by normal distribution function. In the process of distributing sensor network, their elements, operational environment demand of cueing, and the probability of sensor network coverage are considered; then the optimization algorithm of sensor network based on hypothesis testing theory is made. The simulation result indicates that the algorithm can make sensor network which is required. On the basis of that, the two cases, including targets that make linear motion and orbit motion, are used to test the performance of the sensor network, which show that the sensor network can make uninterrupted detection on targets through multisensor cross cuing.

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

A hierarchical fuzzy rule-based approach to aphasia diagnosis.

Science.gov (United States)

Akbarzadeh-T, Mohammad-R; Moshtagh-Khorasani, Majid

2007-10-01

Aphasia diagnosis is a particularly challenging medical diagnostic task due to the linguistic uncertainty and vagueness, inconsistencies in the definition of aphasic syndromes, large number of measurements with imprecision, natural diversity and subjectivity in test objects as well as in opinions of experts who diagnose the disease. To efficiently address this diagnostic process, a hierarchical fuzzy rule-based structure is proposed here that considers the effect of different features of aphasia by statistical analysis in its construction. This approach can be efficient for diagnosis of aphasia and possibly other medical diagnostic applications due to its fuzzy and hierarchical reasoning construction. Initially, the symptoms of the disease which each consists of different features are analyzed statistically. The measured statistical parameters from the training set are then used to define membership functions and the fuzzy rules. The resulting two-layered fuzzy rule-based system is then compared with a back propagating feed-forward neural network for diagnosis of four Aphasia types: Anomic, Broca, Global and Wernicke. In order to reduce the number of required inputs, the technique is applied and compared on both comprehensive and spontaneous speech tests. Statistical t-test analysis confirms that the proposed approach uses fewer Aphasia features while also presenting a significant improvement in terms of accuracy.

Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network

Directory of Open Access Journals (Sweden)

Yueyue Deng

2013-01-01

Full Text Available Dynamic and unstructured multiple cooperative autonomous underwater vehicle (AUV missions are highly complex operations, and task allocation and path planning are made significantly more challenging under realistic underwater acoustic communication constraints. This paper presents a solution for the task allocation and path planning for multiple AUVs under marginal acoustic communication conditions: a location-aided task allocation framework (LAAF algorithm for multitarget task assignment and the grid-based multiobjective optimal programming (GMOOP mathematical model for finding an optimal vehicle command decision given a set of objectives and constraints. Both the LAAF and GMOOP algorithms are well suited in poor acoustic network condition and dynamic environment. Our research is based on an existing mobile ad hoc network underwater acoustic simulator and blind flooding routing protocol. Simulation results demonstrate that the location-aided auction strategy performs significantly better than the well-accepted auction algorithm developed by Bertsekas in terms of task-allocation time and network bandwidth consumption. We also demonstrate that the GMOOP path-planning technique provides an efficient method for executing multiobjective tasks by cooperative agents with limited communication capabilities. This is in contrast to existing multiobjective action selection methods that are limited to networks where constant, reliable communication is assumed to be available.

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

The Reference Ability Neural Network Study: Life-time stability of reference-ability neural networks derived from task maps of young adults.

Science.gov (United States)

Habeck, C; Gazes, Y; Razlighi, Q; Steffener, J; Brickman, A; Barulli, D; Salthouse, T; Stern, Y

2016-01-15

Analyses of large test batteries administered to individuals ranging from young to old have consistently yielded a set of latent variables representing reference abilities (RAs) that capture the majority of the variance in age-related cognitive change: Episodic Memory, Fluid Reasoning, Perceptual Processing Speed, and Vocabulary. In a previous paper (Stern et al., 2014), we introduced the Reference Ability Neural Network Study, which administers 12 cognitive neuroimaging tasks (3 for each RA) to healthy adults age 20-80 in order to derive unique neural networks underlying these 4 RAs and investigate how these networks may be affected by aging. We used a multivariate approach, linear indicator regression, to derive a unique covariance pattern or Reference Ability Neural Network (RANN) for each of the 4 RAs. The RANNs were derived from the neural task data of 64 younger adults of age 30 and below. We then prospectively applied the RANNs to fMRI data from the remaining sample of 227 adults of age 31 and above in order to classify each subject-task map into one of the 4 possible reference domains. Overall classification accuracy across subjects in the sample age 31 and above was 0.80±0.18. Classification accuracy by RA domain was also good, but variable; memory: 0.72±0.32; reasoning: 0.75±0.35; speed: 0.79±0.31; vocabulary: 0.94±0.16. Classification accuracy was not associated with cross-sectional age, suggesting that these networks, and their specificity to the respective reference domain, might remain intact throughout the age range. Higher mean brain volume was correlated with increased overall classification accuracy; better overall performance on the tasks in the scanner was also associated with classification accuracy. For the RANN network scores, we observed for each RANN that a higher score was associated with a higher corresponding classification accuracy for that reference ability. Despite the absence of behavioral performance information in the

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.

The Global Invasive Species Information Network: contributing to GEO Task BI-07-01b

Science.gov (United States)

Graham, J.; Morisette, J. T.; Simpson, A.

2009-12-01

Invasive alien species (IAS) threaten biodiversity and exert a tremendous cost on society for IAS prevention and eradication. They endanger natural ecosystem functioning and seriously impact biodiversity and agricultural production. The task definition for the GEO task BI-07-01b: Invasive Species Monitoring System is to characterize, monitor, and predict changes in the distribution of invasive species. This includes characterizing the current requirements and capacity for invasive species monitoring and developing strategies for implementing cross-search functionality among existing online invasive species information systems from around the globe. The Task is being coordinated by members of the Global Invasive Species Information Network (GISIN) and their partners. Information on GISIN and a prototype of the network is available at www.gisin.org. This talk will report on the current status of GISIN and review how researchers can either contribute to or utilize data from this network.

Multi-layer network utilizing rewarded spike time dependent plasticity to learn a foraging task.

Directory of Open Access Journals (Sweden)

Pavel Sanda

2017-09-01

Full Text Available Neural networks with a single plastic layer employing reward modulated spike time dependent plasticity (STDP are capable of learning simple foraging tasks. Here we demonstrate advanced pattern discrimination and continuous learning in a network of spiking neurons with multiple plastic layers. The network utilized both reward modulated and non-reward modulated STDP and implemented multiple mechanisms for homeostatic regulation of synaptic efficacy, including heterosynaptic plasticity, gain control, output balancing, activity normalization of rewarded STDP and hard limits on synaptic strength. We found that addition of a hidden layer of neurons employing non-rewarded STDP created neurons that responded to the specific combinations of inputs and thus performed basic classification of the input patterns. When combined with a following layer of neurons implementing rewarded STDP, the network was able to learn, despite the absence of labeled training data, discrimination between rewarding patterns and the patterns designated as punishing. Synaptic noise allowed for trial-and-error learning that helped to identify the goal-oriented strategies which were effective in task solving. The study predicts a critical set of properties of the spiking neuronal network with STDP that was sufficient to solve a complex foraging task involving pattern classification and decision making.

TopoGen: A Network Topology Generation Architecture with application to automating simulations of Software Defined Networks

CERN Document Server

Laurito, Andres; The ATLAS collaboration

2017-01-01

Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...

TopoGen: A Network Topology Generation Architecture with application to automating simulations of Software Defined Networks

CERN Document Server

Laurito, Andres; The ATLAS collaboration

2018-01-01

Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...

A proposal for a global task planning architecture using the RoboEarth cloud based framework

OpenAIRE

Janssen, R.J.M.; Molengraft, van de, M.J.G.; Steinbuch, M.; Di Marco, D.; Zweigle, O.; Levi, P.; Py, F.; Musliner, D.

2012-01-01

As robotic systems become more and more capable of assisting in human domains, methods are sought to compose robot executable plans from abstract human instructions. To cope with the semantically rich and highly expressive nature of human instructions, Hierarchical Task Network planning is often being employed along with domain knowledge to solve planning problems in a pragmatic way. Commonly, the domain knowledge is specific to the planning problem at hand, impeding re-use. Therefore this pa...

Functional neural networks underlying response inhibition in adolescents and adults.

Science.gov (United States)

Stevens, Michael C; Kiehl, Kent A; Pearlson, Godfrey D; Calhoun, Vince D

2007-07-19

This study provides the first description of neural network dynamics associated with response inhibition in healthy adolescents and adults. Functional and effective connectivity analyses of whole brain hemodynamic activity elicited during performance of a Go/No-Go task were used to identify functionally integrated neural networks and characterize their causal interactions. Three response inhibition circuits formed a hierarchical, inter-dependent system wherein thalamic modulation of input to premotor cortex by fronto-striatal regions led to response suppression. Adolescents differed from adults in the degree of network engagement, regional fronto-striatal-thalamic connectivity, and network dynamics. We identify and characterize several age-related differences in the function of neural circuits that are associated with behavioral performance changes across adolescent development.

Distributed Schemes for Crowdsourcing-Based Sensing Task Assignment in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Linbo Zhai

2017-01-01

Full Text Available Spectrum sensing is an important issue in cognitive radio networks. The unlicensed users can access the licensed wireless spectrum only when the licensed wireless spectrum is sensed to be idle. Since mobile terminals such as smartphones and tablets are popular among people, spectrum sensing can be assigned to these mobile intelligent terminals, which is called crowdsourcing method. Based on the crowdsourcing method, this paper studies the distributed scheme to assign spectrum sensing task to mobile terminals such as smartphones and tablets. Considering the fact that mobile terminals’ positions may influence the sensing results, a precise sensing effect function is designed for the crowdsourcing-based sensing task assignment. We aim to maximize the sensing effect function and cast this optimization problem to address crowdsensing task assignment in cognitive radio networks. This problem is difficult to be solved because the complexity of this problem increases exponentially with the growth in mobile terminals. To assign crowdsensing task, we propose four distributed algorithms with different transition probabilities and use a Markov chain to analyze the approximation gap of our proposed schemes. Simulation results evaluate the average performance of our proposed algorithms and validate the algorithm’s convergence.

Structural changes in the minimal spanning tree and the hierarchical network in the Korean stock market around the global financial crisis

Science.gov (United States)

Nobi, Ashadun; Maeng, Seong Eun; Ha, Gyeong Gyun; Lee, Jae Woo

2015-04-01

This paper considers stock prices in the Korean stock market during the 2008 global financial crisis by focusing on three time periods: before, during, and after the crisis. Complex networks are extracted from cross-correlation coefficients between the normalized logarithmic return of the stock price time series of firms. The minimal spanning trees (MSTs) and the hierarchical network (HN) are generated from cross-correlation coefficients. Before and after the crisis, securities firms are located at the center of the MST. During the crisis, however, the center of the MST changes to a firm in heavy industry and construction. During the crisis, the MST shrinks in comparison to that before and that after the crisis. This topological change in the MST during the crisis reflects a distinct effect of the global financial crisis. The cophenetic correlation coefficient increases during the crisis, indicating an increase in the hierarchical structure during in this period. When crisis hits the market, firms behave synchronously, and their correlations are higher than those during a normal period.

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.

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.

Same task, different strategies: How brain networks can be influenced by memory strategy

OpenAIRE

Sanfratello, Lori; Caprihan, Arvind; Stephen, Julia M.; Knoefel, Janice E.; Adair, John C.; Qualls, Clifford; Lundy, S. Laura; Aine, Cheryl J.

2014-01-01

Previous functional neuroimaging studies demonstrated that different neural networks underlie different types of cognitive processing by engaging participants in particular tasks, such as verbal or spatial working memory (WM) tasks. However, we report here that even when a working memory task is defined as verbal or spatial, different types of memory strategies may be employed to complete it, with concomitant variations in brain activity. We developed a questionnaire to characterize the type ...

Multi-Task Convolutional Neural Network for Pose-Invariant Face Recognition

Science.gov (United States)

Yin, Xi; Liu, Xiaoming

2018-02-01

This paper explores multi-task learning (MTL) for face recognition. We answer the questions of how and why MTL can improve the face recognition performance. First, we propose a multi-task Convolutional Neural Network (CNN) for face recognition where identity classification is the main task and pose, illumination, and expression estimations are the side tasks. Second, we develop a dynamic-weighting scheme to automatically assign the loss weight to each side task, which is a crucial problem in MTL. Third, we propose a pose-directed multi-task CNN by grouping different poses to learn pose-specific identity features, simultaneously across all poses. Last but not least, we propose an energy-based weight analysis method to explore how CNN-based MTL works. We observe that the side tasks serve as regularizations to disentangle the variations from the learnt identity features. Extensive experiments on the entire Multi-PIE dataset demonstrate the effectiveness of the proposed approach. To the best of our knowledge, this is the first work using all data in Multi-PIE for face recognition. Our approach is also applicable to in-the-wild datasets for pose-invariant face recognition and achieves comparable or better performance than state of the art on LFW, CFP, and IJB-A datasets.

The Time Course of Task-Specific Memory Consolidation Effects in Resting State Networks

Science.gov (United States)

Sami, Saber; Robertson, Edwin M.

2014-01-01

Previous studies have reported functionally localized changes in resting-state brain activity following a short period of motor learning, but their relationship with memory consolidation and their dependence on the form of learning is unclear. We investigate these questions with implicit or explicit variants of the serial reaction time task (SRTT). fMRI resting-state functional connectivity was measured in human subjects before the tasks, and 0.1, 0.5, and 6 h after learning. There was significant improvement in procedural skill in both groups, with the group learning under explicit conditions showing stronger initial acquisition, and greater improvement at the 6 h retest. Immediately following acquisition, this group showed enhanced functional connectivity in networks including frontal and cerebellar areas and in the visual cortex. Thirty minutes later, enhanced connectivity was observed between cerebellar nuclei, thalamus, and basal ganglia, whereas at 6 h there was enhanced connectivity in a sensory-motor cortical network. In contrast, immediately after acquisition under implicit conditions, there was increased connectivity in a network including precentral and sensory-motor areas, whereas after 30 min a similar cerebello-thalamo-basal ganglionic network was seen as in explicit learning. Finally, 6 h after implicit learning, we found increased connectivity in medial temporal cortex, but reduction in precentral and sensory-motor areas. Our findings are consistent with predictions that two variants of the SRTT task engage dissociable functional networks, although there are also networks in common. We also show a converging and diverging pattern of flux between prefrontal, sensory-motor, and parietal areas, and subcortical circuits across a 6 h consolidation period. PMID:24623776

Socio-contextual Network Mining for User Assistance in Web-based Knowledge Gathering Tasks

Science.gov (United States)

Rajendran, Balaji; Kombiah, Iyakutti

Web-based Knowledge Gathering (WKG) is a specialized and complex information seeking task carried out by many users on the web, for their various learning, and decision-making requirements. We construct a contextual semantic structure by observing the actions of the users involved in WKG task, in order to gain an understanding of their task and requirement. We also build a knowledge warehouse in the form of a master Semantic Link Network (SLX) that accommodates and assimilates all the contextual semantic structures. This master SLX, which is a socio-contextual network, is then mined to provide contextual inputs to the current users through their agents. We validated our approach through experiments and analyzed the benefits to the users in terms of resource explorations and the time saved. The results are positive enough to motivate us to implement in a larger scale.

Hierarchical effects on target detection and conflict monitoring

Science.gov (United States)

Cao, Bihua; Gao, Feng; Ren, Maofang; Li, Fuhong

2016-01-01

Previous neuroimaging studies have demonstrated a hierarchical functional structure of the frontal cortices of the human brain, but the temporal course and the electrophysiological signature of the hierarchical representation remains unaddressed. In the present study, twenty-one volunteers were asked to perform a nested cue-target task, while their scalp potentials were recorded. The results showed that: (1) in comparison with the lower-level hierarchical targets, the higher-level targets elicited a larger N2 component (220–350 ms) at the frontal sites, and a smaller P3 component (350–500 ms) across the frontal and parietal sites; (2) conflict-related negativity (non-target minus target) was greater for the lower-level hierarchy than the higher-level, reflecting a more intensive process of conflict monitoring at the final step of target detection. These results imply that decision making, context updating, and conflict monitoring differ among different hierarchical levels of abstraction. PMID:27561989

Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2008-01-01

We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource......, they are organised in a hierarchy. In this paper, we first develop a holistic scheduling and schedulability analysis that determines the timing properties of a hierarchically scheduled system. Second, we address design problems that are characteristic to such hierarchically scheduled systems: assignment...... of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We also present several algorithms for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilisation of the system...

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

Differences between child and adult large-scale functional brain networks for reading tasks.

Science.gov (United States)

Liu, Xin; Gao, Yue; Di, Qiqi; Hu, Jiali; Lu, Chunming; Nan, Yun; Booth, James R; Liu, Li

2018-02-01

Reading is an important high-level cognitive function of the human brain, requiring interaction among multiple brain regions. Revealing differences between children's large-scale functional brain networks for reading tasks and those of adults helps us to understand how the functional network changes over reading development. Here we used functional magnetic resonance imaging data of 17 adults (19-28 years old) and 16 children (11-13 years old), and graph theoretical analyses to investigate age-related changes in large-scale functional networks during rhyming and meaning judgment tasks on pairs of visually presented Chinese characters. We found that: (1) adults had stronger inter-regional connectivity and nodal degree in occipital regions, while children had stronger inter-regional connectivity in temporal regions, suggesting that adults rely more on visual orthographic processing whereas children rely more on auditory phonological processing during reading. (2) Only adults showed between-task differences in inter-regional connectivity and nodal degree, whereas children showed no task differences, suggesting the topological organization of adults' reading network is more specialized. (3) Children showed greater inter-regional connectivity and nodal degree than adults in multiple subcortical regions; the hubs in children were more distributed in subcortical regions while the hubs in adults were more distributed in cortical regions. These findings suggest that reading development is manifested by a shift from reliance on subcortical to cortical regions. Taken together, our study suggests that Chinese reading development is supported by developmental changes in brain connectivity properties, and some of these changes may be domain-general while others may be specific to the reading domain. © 2017 Wiley Periodicals, Inc.

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

Temporal motifs reveal collaboration patterns in online task-oriented networks

Science.gov (United States)

Xuan, Qi; Fang, Huiting; Fu, Chenbo; Filkov, Vladimir

2015-05-01

Real networks feature layers of interactions and complexity. In them, different types of nodes can interact with each other via a variety of events. Examples of this complexity are task-oriented social networks (TOSNs), where teams of people share tasks towards creating a quality artifact, such as academic research papers or software development in commercial or open source environments. Accomplishing those tasks involves both work, e.g., writing the papers or code, and communication, to discuss and coordinate. Taking into account the different types of activities and how they alternate over time can result in much more precise understanding of the TOSNs behaviors and outcomes. That calls for modeling techniques that can accommodate both node and link heterogeneity as well as temporal change. In this paper, we report on methodology for finding temporal motifs in TOSNs, limited to a system of two people and an artifact. We apply the methods to publicly available data of TOSNs from 31 Open Source Software projects. We find that these temporal motifs are enriched in the observed data. When applied to software development outcome, temporal motifs reveal a distinct dependency between collaboration and communication in the code writing process. Moreover, we show that models based on temporal motifs can be used to more precisely relate both individual developer centrality and team cohesion to programmer productivity than models based on aggregated TOSNs.

A Study of Recurrent and Convolutional Neural Networks in the Native Language Identification Task

KAUST Repository

Werfelmann, Robert

2018-05-24

Native Language Identification (NLI) is the task of predicting the native language of an author from their text written in a second language. The idea is to find writing habits that transfer from an author’s native language to their second language. Many approaches to this task have been studied, from simple word frequency analysis, to analyzing grammatical and spelling mistakes to find patterns and traits that are common between different authors of the same native language. This can be a very complex task, depending on the native language and the proficiency of the author’s second language. The most common approach that has seen very good results is based on the usage of n-gram features of words and characters. In this thesis, we attempt to extract lexical, grammatical, and semantic features from the sentences of non-native English essays using neural networks. The training and testing data was obtained from a large corpus of publicly available essays written by authors of several countries around the world. The neural network models consisted of Long Short-Term Memory and Convolutional networks using the sentences of each document as the input. Additional statistical features were generated from the text to complement the predictions of the neural networks, which were then used as feature inputs to a Support Vector Machine, making the final prediction. Results show that Long Short-Term Memory neural network can improve performance over a naive bag of words approach, but with a much smaller feature set. With more fine-tuning of neural network hyperparameters, these results will likely improve significantly.

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

Optimization of Hierarchical Modulation for Use of Scalable Media

Directory of Open Access Journals (Sweden)

Heneghan Conor

2010-01-01

Full Text Available This paper studies the Hierarchical Modulation, a transmission strategy of the approaching scalable multimedia over frequency-selective fading channel for improving the perceptible quality. An optimization strategy for Hierarchical Modulation and convolutional encoding, which can achieve the target bit error rates with minimum global signal-to-noise ratio in a single-user scenario, is suggested. This strategy allows applications to make a free choice of relationship between Higher Priority (HP and Lower Priority (LP stream delivery. The similar optimization can be used in multiuser scenario. An image transport task and a transport task of an H.264/MPEG4 AVC video embedding both QVGA and VGA resolutions are simulated as the implementation example of this optimization strategy, and demonstrate savings in SNR and improvement in Peak Signal-to-Noise Ratio (PSNR for the particular examples shown.

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.

A Framework for Joint Optical-Wireless Resource Management in Multi-RAT, Heterogeneous Mobile Networks

DEFF Research Database (Denmark)

Zakrzewska, Anna; Popovska Avramova, Andrijana; Christiansen, Henrik Lehrmann

2013-01-01

Mobile networks are constantly evolving: new Radio Access Technologies (RATs) are being introduced, and backhaul architectures like Cloud-RAN (C-RAN) and distributed base stations are being proposed. Furthermore, small cells are being deployed to enhance network capacity. The end-users wish...... to be always connected to a high-quality service (high bit rates, low latency), thus causing a very complex network control task from an operator’s point of view. We thus propose a framework allowing joint overall network resource management. This scheme covers different types of network heterogeneity (multi......-RAT, multi-layer, multi-architecture) by introducing a novel, hierarchical approach to network resource management. Self-Organizing Networks (SON) and cognitive network behaviors are covered as well as more traditional mobile network features. The framework is applicable to all phases of network operation...

Alternating Dynamics of Segregation and Integration in Human EEG Functional Networks During Working-memory Task.

Science.gov (United States)

Zippo, Antonio G; Della Rosa, Pasquale A; Castiglioni, Isabella; Biella, Gabriele E M

2018-02-10

Brain functional networks show high variability in short time windows but mechanisms governing these transient dynamics remain unknown. In this work, we studied the temporal evolution of functional brain networks involved in a working memory (WM) task while recording high-density electroencephalography (EEG) in human normal subjects. We found that functional brain networks showed an initial phase characterized by an increase of the functional segregation index followed by a second phase where the functional segregation faded after the prevailing the functional integration. Notably, wrong trials were associated with different or disrupted sequences of the segregation-integration profiles and measures of network centrality and modularity were able to identify crucial aspects of the oscillatory network dynamics. Additionally, computational investigations further supported the experimental results. The brain functional organization may respond to the information processing demand of a WM task following a 2-step atomic scheme wherein segregation and integration alternately dominate the functional configurations. Copyright © 2017 The Author(s). Published by Elsevier Ltd.. All rights reserved.

A Hierarchical multi-input and output Bi-GRU Model for Sentiment Analysis on Customer Reviews

Science.gov (United States)

Zhang, Liujie; Zhou, Yanquan; Duan, Xiuyu; Chen, Ruiqi

2018-03-01

Multi-label sentiment classification on customer reviews is a practical challenging task in Natural Language Processing. In this paper, we propose a hierarchical multi-input and output model based bi-directional recurrent neural network, which both considers the semantic and lexical information of emotional expression. Our model applies two independent Bi-GRU layer to generate part of speech and sentence representation. Then the lexical information is considered via attention over output of softmax activation on part of speech representation. In addition, we combine probability of auxiliary labels as feature with hidden layer to capturing crucial correlation between output labels. The experimental result shows that our model is computationally efficient and achieves breakthrough improvements on customer reviews dataset.

Mobility management techniques for the next-generation wireless networks

Science.gov (United States)

Sun, Junzhao; Howie, Douglas P.; Sauvola, Jaakko J.

2001-10-01

The tremendous demands from social market are pushing the booming development of mobile communications faster than ever before, leading to plenty of new advanced techniques emerging. With the converging of mobile and wireless communications with Internet services, the boundary between mobile personal telecommunications and wireless computer networks is disappearing. Wireless networks of the next generation need the support of all the advances on new architectures, standards, and protocols. Mobility management is an important issue in the area of mobile communications, which can be best solved at the network layer. One of the key features of the next generation wireless networks is all-IP infrastructure. This paper discusses the mobility management schemes for the next generation mobile networks through extending IP's functions with mobility support. A global hierarchical framework model for the mobility management of wireless networks is presented, in which the mobility management is divided into two complementary tasks: macro mobility and micro mobility. As the macro mobility solution, a basic principle of Mobile IP is introduced, together with the optimal schemes and the advances in IPv6. The disadvantages of the Mobile IP on solving the micro mobility problem are analyzed, on the basis of which three main proposals are discussed as the micro mobility solutions for mobile communications, including Hierarchical Mobile IP (HMIP), Cellular IP, and Handoff-Aware Wireless Access Internet Infrastructure (HAWAII). A unified model is also described in which the different micro mobility solutions can coexist simultaneously in mobile networks.

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

When global rule reversal meets local task switching: The neural mechanisms of coordinated behavioral adaptation to instructed multi-level demand changes.

Science.gov (United States)

Shi, Yiquan; Wolfensteller, Uta; Schubert, Torsten; Ruge, Hannes

2018-02-01

Cognitive flexibility is essential to cope with changing task demands and often it is necessary to adapt to combined changes in a coordinated manner. The present fMRI study examined how the brain implements such multi-level adaptation processes. Specifically, on a "local," hierarchically lower level, switching between two tasks was required across trials while the rules of each task remained unchanged for blocks of trials. On a "global" level regarding blocks of twelve trials, the task rules could reverse or remain the same. The current task was cued at the start of each trial while the current task rules were instructed before the start of a new block. We found that partly overlapping and partly segregated neural networks play different roles when coping with the combination of global rule reversal and local task switching. The fronto-parietal control network (FPN) supported the encoding of reversed rules at the time of explicit rule instruction. The same regions subsequently supported local task switching processes during actual implementation trials, irrespective of rule reversal condition. By contrast, a cortico-striatal network (CSN) including supplementary motor area and putamen was increasingly engaged across implementation trials and more so for rule reversal than for nonreversal blocks, irrespective of task switching condition. Together, these findings suggest that the brain accomplishes the coordinated adaptation to multi-level demand changes by distributing processing resources either across time (FPN for reversed rule encoding and later for task switching) or across regions (CSN for reversed rule implementation and FPN for concurrent task switching). © 2017 Wiley Periodicals, Inc.

Using hierarchical Bayesian methods to examine the tools of decision-making

OpenAIRE

Michael D. Lee; Benjamin R. Newell

2011-01-01

Hierarchical Bayesian methods offer a principled and comprehensive way to relate psychological models to data. Here we use them to model the patterns of information search, stopping and deciding in a simulated binary comparison judgment task. The simulation involves 20 subjects making 100 forced choice comparisons about the relative magnitudes of two objects (which of two German cities has more inhabitants). Two worked-examples show how hierarchical models can be developed to account for and ...

Development of advanced MCR task analysis methods

International Nuclear Information System (INIS)

Na, J. C.; Park, J. H.; Lee, S. K.; Kim, J. K.; Kim, E. S.; Cho, S. B.; Kang, J. S.

2008-07-01

This report describes task analysis methodology for advanced HSI designs. Task analyses was performed by using procedure-based hierarchical task analysis and task decomposition methods. The results from the task analysis were recorded in a database. Using the TA results, we developed static prototype of advanced HSI and human factors engineering verification and validation methods for an evaluation of the prototype. In addition to the procedure-based task analysis methods, workload estimation based on the analysis of task performance time and analyses for the design of information structure and interaction structures will be necessary

An Efficient Supervised Training Algorithm for Multilayer Spiking Neural Networks.

Science.gov (United States)

Xie, Xiurui; Qu, Hong; Liu, Guisong; Zhang, Malu; Kurths, Jürgen

2016-01-01

The spiking neural networks (SNNs) are the third generation of neural networks and perform remarkably well in cognitive tasks such as pattern recognition. The spike emitting and information processing mechanisms found in biological cognitive systems motivate the application of the hierarchical structure and temporal encoding mechanism in spiking neural networks, which have exhibited strong computational capability. However, the hierarchical structure and temporal encoding approach require neurons to process information serially in space and time respectively, which reduce the training efficiency significantly. For training the hierarchical SNNs, most existing methods are based on the traditional back-propagation algorithm, inheriting its drawbacks of the gradient diffusion and the sensitivity on parameters. To keep the powerful computation capability of the hierarchical structure and temporal encoding mechanism, but to overcome the low efficiency of the existing algorithms, a new training algorithm, the Normalized Spiking Error Back Propagation (NSEBP) is proposed in this paper. In the feedforward calculation, the output spike times are calculated by solving the quadratic function in the spike response model instead of detecting postsynaptic voltage states at all time points in traditional algorithms. Besides, in the feedback weight modification, the computational error is propagated to previous layers by the presynaptic spike jitter instead of the gradient decent rule, which realizes the layer-wised training. Furthermore, our algorithm investigates the mathematical relation between the weight variation and voltage error change, which makes the normalization in the weight modification applicable. Adopting these strategies, our algorithm outperforms the traditional SNN multi-layer algorithms in terms of learning efficiency and parameter sensitivity, that are also demonstrated by the comprehensive experimental results in this paper.

Immune networks: multi-tasking capabilities at medium load

Science.gov (United States)

Agliari, E.; Annibale, A.; Barra, A.; Coolen, A. C. C.; Tantari, D.

2013-08-01

Associative network models featuring multi-tasking properties have been introduced recently and studied in the low-load regime, where the number P of simultaneously retrievable patterns scales with the number N of nodes as P ˜ log N. In addition to their relevance in artificial intelligence, these models are increasingly important in immunology, where stored patterns represent strategies to fight pathogens and nodes represent lymphocyte clones. They allow us to understand the crucial ability of the immune system to respond simultaneously to multiple distinct antigen invasions. Here we develop further the statistical mechanical analysis of such systems, by studying the medium-load regime, P ˜ Nδ with δ ∈ (0, 1]. We derive three main results. First, we reveal the nontrivial architecture of these networks: they exhibit a high degree of modularity and clustering, which is linked to their retrieval abilities. Second, by solving the model we demonstrate for δ frameworks are required to achieve effective retrieval.

Working memory activation of neural networks in the elderly as a function of information processing phase and task complexity.

Science.gov (United States)

Charroud, Céline; Steffener, Jason; Le Bars, Emmanuelle; Deverdun, Jérémy; Bonafe, Alain; Abdennour, Meriem; Portet, Florence; Molino, François; Stern, Yaakov; Ritchie, Karen; Menjot de Champfleur, Nicolas; Akbaraly, Tasnime N

2015-11-01

Changes in working memory are sensitive indicators of both normal and pathological brain aging and associated disability. The present study aims to further understanding of working memory in normal aging using a large cohort of healthy elderly in order to examine three separate phases of information processing in relation to changes in task load activation. Using covariance analysis, increasing and decreasing neural activation was observed on fMRI in response to a delayed item recognition task in 337 cognitively healthy elderly persons as part of the CRESCENDO (Cognitive REServe and Clinical ENDOphenotypes) study. During three phases of the task (stimulation, retention, probe), increased activation was observed with increasing task load in bilateral regions of the prefrontal cortex, parietal lobule, cingulate gyrus, insula and in deep gray matter nuclei, suggesting an involvement of central executive and salience networks. Decreased activation associated with increasing task load was observed during the stimulation phase, in bilateral temporal cortex, parietal lobule, cingulate gyrus and prefrontal cortex. This spatial distribution of decreased activation is suggestive of the default mode network. These findings support the hypothesis of an increased activation in salience and central executive networks and a decreased activation in default mode network concomitant to increasing task load. Copyright © 2015 Elsevier Inc. All rights reserved.

Same task, different strategies: how brain networks can be influenced by memory strategy.

Science.gov (United States)

Sanfratello, Lori; Caprihan, Arvind; Stephen, Julia M; Knoefel, Janice E; Adair, John C; Qualls, Clifford; Lundy, S Laura; Aine, Cheryl J

2014-10-01

Previous functional neuroimaging studies demonstrated that different neural networks underlie different types of cognitive processing by engaging participants in particular tasks, such as verbal or spatial working memory (WM) tasks. However, we report here that even when a WM task is defined as verbal or spatial, different types of memory strategies may be used to complete it, with concomitant variations in brain activity. We developed a questionnaire to characterize the type of strategy used by individual members in a group of 28 young healthy participants (18-25 years) during a spatial WM task. A cluster analysis was performed to differentiate groups. We acquired functional magnetoencephalography and structural diffusion tensor imaging measures to characterize the brain networks associated with the use of different strategies. We found two types of strategies were used during the spatial WM task, a visuospatial and a verbal strategy, and brain regions and time courses of activation differed between participants who used each. Task performance also varied by type of strategy used with verbal strategies showing an advantage. In addition, performance on neuropsychological tests (indices from Wechsler Adult Intelligence Scale-IV, Rey Complex Figure Test) correlated significantly with fractional anisotropy measures for the visuospatial strategy group in white matter tracts implicated in other WM and attention studies. We conclude that differences in memory strategy can have a pronounced effect on the locations and timing of brain activation and that these differences need further investigation as a possible confounding factor for studies using group averaging as a means for summarizing results. Copyright © 2014 Wiley Periodicals, Inc.

Self-powered information measuring wireless networks using the distribution of tasks within multicore processors

Science.gov (United States)

Zhuravska, Iryna M.; Koretska, Oleksandra O.; Musiyenko, Maksym P.; Surtel, Wojciech; Assembay, Azat; Kovalev, Vladimir; Tleshova, Akmaral

2017-08-01

The article contains basic approaches to develop the self-powered information measuring wireless networks (SPIM-WN) using the distribution of tasks within multicore processors critical applying based on the interaction of movable components - as in the direction of data transmission as wireless transfer of energy coming from polymetric sensors. Base mathematic model of scheduling tasks within multiprocessor systems was modernized to schedule and allocate tasks between cores of one-crystal computer (SoC) to increase energy efficiency SPIM-WN objects.

Visualization of hierarchically structured information for human-computer interaction

Energy Technology Data Exchange (ETDEWEB)

Cheon, Suh Hyun; Lee, J. K.; Choi, I. K.; Kye, S. C.; Lee, N. K. [Dongguk University, Seoul (Korea)

2001-11-01

Visualization techniques can be used to support operator's information navigation tasks on the system especially consisting of an enormous volume of information, such as operating information display system and computerized operating procedure system in advanced control room of nuclear power plants. By offering an easy understanding environment of hierarchically structured information, these techniques can reduce the operator's supplementary navigation task load. As a result of that, operators can pay more attention on the primary tasks and ultimately improve the cognitive task performance. In this report, an interface was designed and implemented using hyperbolic visualization technique, which is expected to be applied as a means of optimizing operator's information navigation tasks. 15 refs., 19 figs., 32 tabs. (Author)

The ames network and the task group on WWER's

International Nuclear Information System (INIS)

Davies, L.M.; Duysen, J.C. van; Estorff, U. von; Sycamore, D.

1997-01-01

The European Network on 'Ageing Materials Evaluation and Studies' (AMES) was created in 1993. Its main objectives are (a) to provide information and understanding on neutron irradiation effects in reactor materials in support of designers, operators, regulators and researchers and (b) to establish and discharge projects in the above areas. The Steering Committee is composed of at least one participant from each nuclear European Union country. The JRC's Institute for Advanced Materials of the European Commission plays the role of Operating Agent and Manager of the AMES Network. This paper describes the structure, objectives, and major projects of the AMES network. Particular emphasis is placed upon the work it is intended to perform within the Task Group on 'WWER's of the first AMES project (AMES1) on 'Validation of surveillance practice and mitigation methods'. EC DGXVII is addressing the question of how to facilitate contacts between EU and Russian industries in the framework of nuclear Industrial co-operation, and this project may provide a suitable starting point upon which to develop a basis for further work of mutual interest. (author)

Psychopathic traits associated with abnormal hemodynamic activity in salience and default mode networks during auditory oddball task.

Science.gov (United States)

Anderson, Nathaniel E; Maurer, J Michael; Steele, Vaughn R; Kiehl, Kent A

2018-06-01

Psychopathy is a personality disorder accompanied by abnormalities in emotional processing and attention. Recent theoretical applications of network-based models of cognition have been used to explain the diverse range of abnormalities apparent in psychopathy. Still, the physiological basis for these abnormalities is not well understood. A significant body of work has examined psychopathy-related abnormalities in simple attention-based tasks, but these studies have largely been performed using electrocortical measures, such as event-related potentials (ERPs), and they often have been carried out among individuals with low levels of psychopathic traits. In this study, we examined neural activity during an auditory oddball task using functional magnetic resonance imaging (fMRI) during a simple auditory target detection (oddball) task among 168 incarcerated adult males, with psychopathic traits assessed via the Hare Psychopathy Checklist-Revised (PCL-R). Event-related contrasts demonstrated that the largest psychopathy-related effects were apparent between the frequent standard stimulus condition and a task-off, implicit baseline. Negative correlations with interpersonal-affective dimensions (Factor 1) of the PCL-R were apparent in regions comprising default mode and salience networks. These findings support models of psychopathy describing impaired integration across functional networks. They additionally corroborate reports which have implicated failures of efficient transition between default mode and task-positive networks. Finally, they demonstrate a neurophysiological basis for abnormal mobilization of attention and reduced engagement with stimuli that have little motivational significance among those with high psychopathic traits.

Immune networks: multi-tasking capabilities at medium load

International Nuclear Information System (INIS)

Agliari, E; Annibale, A; Barra, A; Coolen, A C C; Tantari, D

2013-01-01

Associative network models featuring multi-tasking properties have been introduced recently and studied in the low-load regime, where the number P of simultaneously retrievable patterns scales with the number N of nodes as P ∼ log N. In addition to their relevance in artificial intelligence, these models are increasingly important in immunology, where stored patterns represent strategies to fight pathogens and nodes represent lymphocyte clones. They allow us to understand the crucial ability of the immune system to respond simultaneously to multiple distinct antigen invasions. Here we develop further the statistical mechanical analysis of such systems, by studying the medium-load regime, P ∼ N δ with δ ∈ (0, 1]. We derive three main results. First, we reveal the nontrivial architecture of these networks: they exhibit a high degree of modularity and clustering, which is linked to their retrieval abilities. Second, by solving the model we demonstrate for δ < 1 the existence of large regions in the phase diagram where the network can retrieve all stored patterns simultaneously. Finally, in the high-load regime δ = 1 we find that the system behaves as a spin-glass, suggesting that finite-connectivity frameworks are required to achieve effective retrieval. (paper)

Integration of metabolome data with metabolic networks reveals reporter reactions

DEFF Research Database (Denmark)

Çakir, Tunahan; Patil, Kiran Raosaheb; Önsan, Zeynep Ilsen

2006-01-01

Interpreting quantitative metabolome data is a difficult task owing to the high connectivity in metabolic networks and inherent interdependency between enzymatic regulation, metabolite levels and fluxes. Here we present a hypothesis-driven algorithm for the integration of such data with metabolic...... network topology. The algorithm thus enables identification of reporter reactions, which are reactions where there are significant coordinated changes in the level of surrounding metabolites following environmental/genetic perturbations. Applicability of the algorithm is demonstrated by using data from...... is measured. By combining the results with transcriptome data, we further show that it is possible to infer whether the reactions are hierarchically or metabolically regulated. Hereby, the reported approach represents an attempt to map different layers of regulation within metabolic networks through...

Intrinsic properties of channel network structure and the hierarchical classification approach for stream-limits delineation

Energy Technology Data Exchange (ETDEWEB)

Afana, A.; Barrio, G. del

2009-07-01

Delineation of drainage networks is an essential task in hydrological and geomorphologic analysis. Manual channel definition depends on topographic contrast and is highly subjective, leading to important errors at high resolutions. different automatic methods have proposed the use of a constant threshold of up sole contributing are to define channel initiation. Actually, these are the most commonly used for the automatic-channel network extraction from Digital Models (DEMs). However, these methods fall to detect and appropriate threshold when the basin is made up to heterogeneous sub-zones, as they only work either lumped or locally. In this study, the critical threshold area for channel delineation has been defined through the analysis of dominant geometric and topologic properties of stream network formation. (Author) 5 refs.

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.

Florida Model Task Force on Diabetic Retinopathy: Development of an Interagency Network.

Science.gov (United States)

Groff, G.; And Others

1990-01-01

This article describes the development of a mechanism to organize a network in Florida for individuals who are at risk for diabetic retinopathy. The task force comprised representatives from governmental, academic, professional, and voluntary organizations. It worked to educate professionals, patients, and the public through brochures, resource…

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)

Hierarchical Task Network Prototyping In Unity3d

Science.gov (United States)

2016-06-01

provided during run-time, or only have limited high level command input. This puts more of an impetus on the fidelity and realism of the agent...development. Cinematic effects were only added where necessary for debugging. Game Loop Pattern At its core, Unity is a game development engine, and

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

2013-11-06

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.

Modeling Network Interdiction Tasks

Science.gov (United States)

2015-09-17

118 xiii Table Page 36 Computation times for weighted, 100-node random networks for GAND Approach testing in Python ...in Python . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 38 Accuracy measures for weighted, 100-node random networks for GAND...networks [15:p. 1]. A common approach to modeling network interdiction is to formulate the problem in terms of a two-stage strategic game between two

Large-Scale Cooperative Task Distribution on Peer-to-Peer Networks

Science.gov (United States)

2012-01-01

SUBTITLE Large-scale cooperative task distribution on peer-to-peer networks 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6...disadvantages of ML- Chord are its fixed size (two layers), and limited scala - bility for large-scale systems. RC-Chord extends ML- D. Karrels et al...configurable before runtime. This can be improved by incorporating a distributed learning algorithm to tune the number and range of the DLoE tracking

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

NARCIS (Netherlands)

N.K. Olver (Neil)

2016-01-01

textabstractRobust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. In this context, Fréchette et al. (2013) recently explored hierarchical hubbing: a routing strategy involving a multiplicity of "hubs" connected to

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

NARCIS (Netherlands)

Olver, Neil

2016-01-01

Robust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. In this context, Fréchette et al. (2013) recently explored hierarchical hubbing: a routing strategy involving a multiplicity of "hubs" connected to terminals

Cerebrocerebellar networks during articulatory rehearsal and verbal working memory tasks.

Science.gov (United States)

Chen, S H Annabel; Desmond, John E

2005-01-15

Converging evidence has implicated the cerebellum in verbal working memory. The current fMRI study sought to further characterize cerebrocerebellar participation in this cognitive process by revealing regions of activation common to a verbal working task and an articulatory control task, as well as regions that are uniquely activated by working memory. Consistent with our model's predictions, load-dependent activations were observed in Broca's area (BA 44/6) and the superior cerebellar hemisphere (VI/CrusI) for both working memory and motoric rehearsal. In contrast, activations unique to verbal working memory were found in the inferior parietal lobule (BA 40) and the right inferior cerebellum hemisphere (VIIB). These findings provide evidence for two cerebrocerebellar networks for verbal working memory: a frontal/superior cerebellar articulatory control system and a parietal/inferior cerebellar phonological storage system.

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

Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

Science.gov (United States)

Li, Lian-Hui; Mo, Rong

2015-01-01

The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC) is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS) improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

Robust Real-Time Music Transcription with a Compositional Hierarchical Model.

Science.gov (United States)

Pesek, Matevž; Leonardis, Aleš; Marolt, Matija

2017-01-01

The paper presents a new compositional hierarchical model for robust music transcription. Its main features are unsupervised learning of a hierarchical representation of input data, transparency, which enables insights into the learned representation, as well as robustness and speed which make it suitable for real-world and real-time use. The model consists of multiple layers, each composed of a number of parts. The hierarchical nature of the model corresponds well to hierarchical structures in music. The parts in lower layers correspond to low-level concepts (e.g. tone partials), while the parts in higher layers combine lower-level representations into more complex concepts (tones, chords). The layers are learned in an unsupervised manner from music signals. Parts in each layer are compositions of parts from previous layers based on statistical co-occurrences as the driving force of the learning process. In the paper, we present the model's structure and compare it to other hierarchical approaches in the field of music information retrieval. We evaluate the model's performance for the multiple fundamental frequency estimation. Finally, we elaborate on extensions of the model towards other music information retrieval tasks.

Hierarchical Neural Representation of Dreamed Objects Revealed by Brain Decoding with Deep Neural Network Features.

Science.gov (United States)

Horikawa, Tomoyasu; Kamitani, Yukiyasu

2017-01-01

Dreaming is generally thought to be generated by spontaneous brain activity during sleep with patterns common to waking experience. This view is supported by a recent study demonstrating that dreamed objects can be predicted from brain activity during sleep using statistical decoders trained with stimulus-induced brain activity. However, it remains unclear whether and how visual image features associated with dreamed objects are represented in the brain. In this study, we used a deep neural network (DNN) model for object recognition as a proxy for hierarchical visual feature representation, and DNN features for dreamed objects were analyzed with brain decoding of fMRI data collected during dreaming. The decoders were first trained with stimulus-induced brain activity labeled with the feature values of the stimulus image from multiple DNN layers. The decoders were then used to decode DNN features from the dream fMRI data, and the decoded features were compared with the averaged features of each object category calculated from a large-scale image database. We found that the feature values decoded from the dream fMRI data positively correlated with those associated with dreamed object categories at mid- to high-level DNN layers. Using the decoded features, the dreamed object category could be identified at above-chance levels by matching them to the averaged features for candidate categories. The results suggest that dreaming recruits hierarchical visual feature representations associated with objects, which may support phenomenal aspects of dream experience.

The impact of task demand on visual word recognition.

Science.gov (United States)

Yang, J; Zevin, J

2014-07-11

The left occipitotemporal cortex has been found sensitive to the hierarchy of increasingly complex features in visually presented words, from individual letters to bigrams and morphemes. However, whether this sensitivity is a stable property of the brain regions engaged by word recognition is still unclear. To address the issue, the current study investigated whether different task demands modify this sensitivity. Participants viewed real English words and stimuli with hierarchical word-likeness while performing a lexical decision task (i.e., to decide whether each presented stimulus is a real word) and a symbol detection task. General linear model and independent component analysis indicated strong activation in the fronto-parietal and temporal regions during the two tasks. Furthermore, the bilateral inferior frontal gyrus and insula showed significant interaction effects between task demand and stimulus type in the pseudoword condition. The occipitotemporal cortex showed strong main effects for task demand and stimulus type, but no sensitivity to the hierarchical word-likeness was found. These results suggest that different task demands on semantic, phonological and orthographic processes can influence the involvement of the relevant regions during visual word recognition. Copyright © 2014 IBRO. Published by Elsevier Ltd. All rights reserved.

Ways of looking ahead: hierarchical planning in language production.

Science.gov (United States)

Lee, Eun-Kyung; Brown-Schmidt, Sarah; Watson, Duane G

2013-12-01

It is generally assumed that language production proceeds incrementally, with chunks of linguistic structure planned ahead of speech. Extensive research has examined the scope of language production and suggests that the size of planned chunks varies across contexts (Ferreira & Swets, 2002; Wagner & Jescheniak, 2010). By contrast, relatively little is known about the structure of advance planning, specifically whether planning proceeds incrementally according to the surface structure of the utterance, or whether speakers plan according to the hierarchical relationships between utterance elements. In two experiments, we examine the structure and scope of lexical planning in language production using a picture description task. Analyses of speech onset times and word durations show that speakers engage in hierarchical planning such that structurally dependent lexical items are planned together and that hierarchical planning occurs for both direct and indirect dependencies. Copyright © 2013 Elsevier B.V. All rights reserved.

Agent Based Modeling on Organizational Dynamics of Terrorist Network

Directory of Open Access Journals (Sweden)

Bo Li

2015-01-01

Full Text Available Modeling organizational dynamics of terrorist network is a critical issue in computational analysis of terrorism research. The first step for effective counterterrorism and strategic intervention is to investigate how the terrorists operate with the relational network and what affects the performance. In this paper, we investigate the organizational dynamics by employing a computational experimentation methodology. The hierarchical cellular network model and the organizational dynamics model are developed for modeling the hybrid relational structure and complex operational processes, respectively. To intuitively elucidate this method, the agent based modeling is used to simulate the terrorist network and test the performance in diverse scenarios. Based on the experimental results, we show how the changes of operational environments affect the development of terrorist organization in terms of its recovery and capacity to perform future tasks. The potential strategies are also discussed, which can be used to restrain the activities of terrorists.

Artificial Epigenetic Networks: Automatic Decomposition of Dynamical Control Tasks Using Topological Self-Modification.

Science.gov (United States)

Turner, Alexander P; Caves, Leo S D; Stepney, Susan; Tyrrell, Andy M; Lones, Michael A

2017-01-01

This paper describes the artificial epigenetic network, a recurrent connectionist architecture that is able to dynamically modify its topology in order to automatically decompose and solve dynamical problems. The approach is motivated by the behavior of gene regulatory networks, particularly the epigenetic process of chromatin remodeling that leads to topological change and which underlies the differentiation of cells within complex biological organisms. We expected this approach to be useful in situations where there is a need to switch between different dynamical behaviors, and do so in a sensitive and robust manner in the absence of a priori information about problem structure. This hypothesis was tested using a series of dynamical control tasks, each requiring solutions that could express different dynamical behaviors at different stages within the task. In each case, the addition of topological self-modification was shown to improve the performance and robustness of controllers. We believe this is due to the ability of topological changes to stabilize attractors, promoting stability within a dynamical regime while allowing rapid switching between different regimes. Post hoc analysis of the controllers also demonstrated how the partitioning of the networks could provide new insights into problem structure.

Hierarchical thinking in network biology: the unbiased modularization of biochemical networks.

Science.gov (United States)

Papin, Jason A; Reed, Jennifer L; Palsson, Bernhard O

2004-12-01

As reconstructed biochemical reaction networks continue to grow in size and scope, there is a growing need to describe the functional modules within them. Such modules facilitate the study of biological processes by deconstructing complex biological networks into conceptually simple entities. The definition of network modules is often based on intuitive reasoning. As an alternative, methods are being developed for defining biochemical network modules in an unbiased fashion. These unbiased network modules are mathematically derived from the structure of the whole network under consideration.

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

Extending an open-source real-time operating system with hierarchical scheduling

NARCIS (Netherlands)

Holenderski, M.J.; Cools, W.A.; Bril, R.J.; Lukkien, J.J.

2010-01-01

Hierarchical scheduling frameworks (HSFs) have been devised to support the integration of independently developed and analyzed subsystems. This paper presents an efficient, modular and extendible design for enhancing a real-time operating system with periodic tasks, two-level fixed-priority HSF

Hierarchical Velocity Control Based on Differential Flatness for a DC/DC Buck Converter-DC Motor System

Directory of Open Access Journals (Sweden)

R. Silva-Ortigoza

2014-01-01

Full Text Available This paper presents a hierarchical controller that carries out the angular velocity trajectory tracking task for a DC motor driven by a DC/DC Buck converter. The high level control is related to the DC motor and the low level control is dedicated to the DC/DC Buck converter; both controls are designed via differential flatness. The high level control provides a desired voltage profile for the DC motor to achieve the tracking of a desired angular velocity trajectory. Then, a low level control is designed to ensure that the output voltage of the DC/DC Buck converter tracks the voltage profile imposed by the high level control. In order to experimentally verify the hierarchical controller performance, a DS1104 electronic board from dSPACE and Matlab-Simulink are used. The switched implementation of the hierarchical average controller is accomplished by means of pulse width modulation. Experimental results of the hierarchical controller for the velocity trajectory tracking task show good performance and robustness against the uncertainties associated with different system parameters.

Hierarchical document categorization using associative networks

NARCIS (Netherlands)

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

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

Sustained oscillations, irregular firing and chaotic dynamics in hierarchical modular networks with mixtures of electrophysiological cell types

Directory of Open Access Journals (Sweden)

Petar eTomov

2014-09-01

Full Text Available The cerebral cortex exhibits neural activity even in the absence of externalstimuli. This self-sustained activity is characterized by irregular firing ofindividual neurons and population oscillations with a broad frequency range.Questions that arise in this context, are: What are the mechanismsresponsible for the existence of neuronal spiking activity in the cortexwithout external input? Do these mechanisms depend on the structural organization of the cortical connections? Do they depend onintrinsic characteristics of the cortical neurons? To approach the answers to these questions, we have used computer simulations of cortical network models. Our networks have hierarchical modular architecture and are composedof combinations of neuron models that reproduce the firing behavior of the five main cortical electrophysiological cell classes: regular spiking (RS, chattering (CH, intrinsically bursting (IB, low threshold spiking (LTS and fast spiking (FS. The population of excitatory neurons is built of RS cells(always present and either CH or IB cells. Inhibitoryneurons belong to the same class, either LTS or FS. Long-lived self-sustained activity states in our networksimulations display irregular single neuron firing and oscillatoryactivity similar to experimentally measured ones. The duration of self-sustained activity strongly depends on the initial conditions,suggesting a transient chaotic regime. Extensive analysis of the self-sustainedactivity states showed that their lifetime expectancy increases with the numberof network modules and is favored when the network is composed of excitatory neurons of the RS and CH classes combined with inhibitory neurons of the LTS class. These results indicate that the existence and properties of the self-sustained cortical activity states depend on both the topology of the network and the neuronal mixture that comprises the network.

The neural network involved in a bimanual tactile-tactile matching discrimination task: a functional imaging study at 3 T

Energy Technology Data Exchange (ETDEWEB)

Habas, Christophe; Cabanis, Emmanuel A. [UPMC Paris 6, Service de NeuroImagerie, Hopital des Quinze-Vingts, Paris (France)

2007-08-15

The cerebral and cerebellar network involved in a bimanual object recognition was studied in blood oxygenation dependent level functional magnetic resonance imaging (fMRI). Nine healthy right-handed volunteers were scanned (1) while performing bilateral finger movements (nondiscrimination motor task), and (2) while performing a bimanual tactile-tactile matching discrimination task using small chess pieces (tactile discrimination task). Extensive activations were specifically observed in the parietal (SII, superior lateral lobule), insular, prefrontal, cingulate and neocerebellar cortices (HVIII), with a left predominance in motor areas, during the tactile discrimination task in contrast to the findings during the nondiscrimination motor task. Bimanual tactile-tactile matching discrimination recruits multiple sensorimotor and associative cerebral and neocerebellar networks (including the cerebellar second homunculus, HVIII), comparable to the neural circuits involved in unimanual tactile object recognition. (orig.)

Identifying Hierarchical and Overlapping Protein Complexes Based on Essential Protein-Protein Interactions and “Seed-Expanding” Method

Directory of Open Access Journals (Sweden)

Jun Ren

2014-01-01

Full Text Available Many evidences have demonstrated that protein complexes are overlapping and hierarchically organized in PPI networks. Meanwhile, the large size of PPI network wants complex detection methods have low time complexity. Up to now, few methods can identify overlapping and hierarchical protein complexes in a PPI network quickly. In this paper, a novel method, called MCSE, is proposed based on λ-module and “seed-expanding.” First, it chooses seeds as essential PPIs or edges with high edge clustering values. Then, it identifies protein complexes by expanding each seed to a λ-module. MCSE is suitable for large PPI networks because of its low time complexity. MCSE can identify overlapping protein complexes naturally because a protein can be visited by different seeds. MCSE uses the parameter λ_th to control the range of seed expanding and can detect a hierarchical organization of protein complexes by tuning the value of λ_th. Experimental results of S. cerevisiae show that this hierarchical organization is similar to that of known complexes in MIPS database. The experimental results also show that MCSE outperforms other previous competing algorithms, such as CPM, CMC, Core-Attachment, Dpclus, HC-PIN, MCL, and NFC, in terms of the functional enrichment and matching with known protein complexes.

Reward-based training of recurrent neural networks for cognitive and value-based tasks.

Science.gov (United States)

Song, H Francis; Yang, Guangyu R; Wang, Xiao-Jing

2017-01-13

Trained neural network models, which exhibit features of neural activity recorded from behaving animals, may provide insights into the circuit mechanisms of cognitive functions through systematic analysis of network activity and connectivity. However, in contrast to the graded error signals commonly used to train networks through supervised learning, animals learn from reward feedback on definite actions through reinforcement learning. Reward maximization is particularly relevant when optimal behavior depends on an animal's internal judgment of confidence or subjective preferences. Here, we implement reward-based training of recurrent neural networks in which a value network guides learning by using the activity of the decision network to predict future reward. We show that such models capture behavioral and electrophysiological findings from well-known experimental paradigms. Our work provides a unified framework for investigating diverse cognitive and value-based computations, and predicts a role for value representation that is essential for learning, but not executing, a task.

Exploring Neural Network Models with Hierarchical Memories and Their Use in Modeling Biological Systems

Science.gov (United States)

Pusuluri, Sai Teja

Energy landscapes are often used as metaphors for phenomena in biology, social sciences and finance. Different methods have been implemented in the past for the construction of energy landscapes. Neural network models based on spin glass physics provide an excellent mathematical framework for the construction of energy landscapes. This framework uses a minimal number of parameters and constructs the landscape using data from the actual phenomena. In the past neural network models were used to mimic the storage and retrieval process of memories (patterns) in the brain. With advances in the field now, these models are being used in machine learning, deep learning and modeling of complex phenomena. Most of the past literature focuses on increasing the storage capacity and stability of stored patterns in the network but does not study these models from a modeling perspective or an energy landscape perspective. This dissertation focuses on neural network models both from a modeling perspective and from an energy landscape perspective. I firstly show how the cellular interconversion phenomenon can be modeled as a transition between attractor states on an epigenetic landscape constructed using neural network models. The model allows the identification of a reaction coordinate of cellular interconversion by analyzing experimental and simulation time course data. Monte Carlo simulations of the model show that the initial phase of cellular interconversion is a Poisson process and the later phase of cellular interconversion is a deterministic process. Secondly, I explore the static features of landscapes generated using neural network models, such as sizes of basins of attraction and densities of metastable states. The simulation results show that the static landscape features are strongly dependent on the correlation strength and correlation structure between patterns. Using different hierarchical structures of the correlation between patterns affects the landscape features

Functional connectivity in task-negative network of the Deaf: effects of sign language experience

Directory of Open Access Journals (Sweden)

Evie Malaia

2014-06-01

Full Text Available Prior studies investigating cortical processing in Deaf signers suggest that life-long experience with sign language and/or auditory deprivation may alter the brain’s anatomical structure and the function of brain regions typically recruited for auditory processing (Emmorey et al., 2010; Pénicaud et al., 2013 inter alia. We report the first investigation of the task-negative network in Deaf signers and its functional connectivity—the temporal correlations among spatially remote neurophysiological events. We show that Deaf signers manifest increased functional connectivity between posterior cingulate/precuneus and left medial temporal gyrus (MTG, but also inferior parietal lobe and medial temporal gyrus in the right hemisphere- areas that have been found to show functional recruitment specifically during sign language processing. These findings suggest that the organization of the brain at the level of inter-network connectivity is likely affected by experience with processing visual language, although sensory deprivation could be another source of the difference. We hypothesize that connectivity alterations in the task negative network reflect predictive/automatized processing of the visual signal.

Network structure of subway passenger flows

Science.gov (United States)

Xu, Q.; Mao, B. H.; Bai, Y.

2016-03-01

The results of transportation infrastructure network analyses have been used to analyze complex networks in a topological context. However, most modeling approaches, including those based on complex network theory, do not fully account for real-life traffic patterns and may provide an incomplete view of network functions. This study utilizes trip data obtained from the Beijing Subway System to characterize individual passenger movement patterns. A directed weighted passenger flow network was constructed from the subway infrastructure network topology by incorporating trip data. The passenger flow networks exhibit several properties that can be characterized by power-law distributions based on flow size, and log-logistic distributions based on the fraction of boarding and departing passengers. The study also characterizes the temporal patterns of in-transit and waiting passengers and provides a hierarchical clustering structure for passenger flows. This hierarchical flow organization varies in the spatial domain. Ten cluster groups were identified, indicating a hierarchical urban polycentric structure composed of large concentrated flows at urban activity centers. These empirical findings provide insights regarding urban human mobility patterns within a large subway network.

Research of user access control for networked manufacturing system

Institute of Scientific and Technical Information of China (English)

ZHENG Xiao-lin; LEI Yu; CHEN De-ren

2006-01-01

An integrated user access control method was proposed to address the issues of security and management in networked manufacturing systems (NMS).Based on the analysis of the security issues in networked manufacturing system,an integrated user access control method composed of role-based access control (RBAC),task-based access control (TBAC),relationship-driven access control (RDAC)and coalition-based access control (CBAC) was proposed,including the hierarchical user relationship model,the reference model and the process model.The elements and their relationships were defined,and the expressions of constraints authorization were given.The extensible access control markup language (XACML) was used to implement this method.This method was used in the networked manufacturing system in the Shaoxing spinning region of China.The results show that the integrated user access control method can reduce the costs of system security maintenance and management.

Effects of Stress and Task Difficulty on Working Memory and Cortical Networking.

Science.gov (United States)

Kim, Yujin; Woo, Jihwan; Woo, Minjung

2017-12-01

This study investigated interactive effects of stress and task difficulty on working memory and cortico-cortical communication during memory encoding. Thirty-eight adolescent participants (mean age of 15.7 ± 1.5 years) completed easy and hard working memory tasks under low- and high-stress conditions. We analyzed the accuracy and reaction time (RT) of working memory performance and inter- and intrahemispheric electroencephalogram coherences during memory encoding. Working memory accuracy was higher, and RT shorter, in the easy versus the hard task. RT was shorter under the high-stress (TENS) versus low-stress (no-TENS) condition, while there was no difference in memory accuracy between the two stress conditions. For electroencephalogram coherence, we found higher interhemispheric coherence in all bands but only at frontal electrode sites in the easy versus the hard task. On the other hand, intrahemispheric coherence was higher in the left hemisphere in the easy (versus hard task) and higher in the right hemisphere (with one exception) in the hard (versus easy task). Inter- and intracoherences were higher in the low- versus high-stress condition. Significant interactions between task difficulty and stress condition were observed in coherences of the beta frequency band. The difference in coherence between low- and high-stress conditions was greater in the hard compared with the easy task, with lower coherence under the high-stress condition relative to the low-stress condition. Stress seemed to cause a decrease in cortical network communications between memory-relevant cortical areas as task difficulty increased.

Resting State Default Mode Network Connectivity, Dual Task Performance, Gait Speed, and Postural Sway in Older Adults with Mild Cognitive Impairment.

Science.gov (United States)

Crockett, Rachel A; Hsu, Chun Liang; Best, John R; Liu-Ambrose, Teresa

2017-01-01

Aging is associated with an increased risk of falling. In particular, older adults with mild cognitive impairment (MCI) are more vulnerable to falling compared with their healthy counterparts. Major contributors to this increased falls risk include a decline in dual task performance, gait speed, and postural sway. Recent evidence highlights the potential influence of the default mode network (DMN), the frontoparietal network (FPN), and the supplementary motor area (SMA) on dual task performance, gait speed, and postural sway. The DMN is active during rest and deactivates during task-oriented processes, to maintain attention and stay on task. The FPN and SMA are involved in top-down attentional control, motor planning, and motor execution. The DMN shows less deactivation during task in older adults with MCI. This lack of deactivation is theorized to increase competition for resources between the DMN and task-related brain regions (e.g., the FPN and SMA), increasing distraction from the task and reducing task performance. However, no study has yet investigated the relationship between the between-network connectivity of the DMN with these regions and dual task walking, gait speed or postural sway. We hypothesized that greater functional connectivity both within the DMN and between DMN-FPN and DMN-SMA, will be associated with poorer performance during dual task walking, slower gait speed, and greater postural sway in older adults with MCI. Forty older adults with MCI were measured on a dual task-walking paradigm, gait speed over a 4-m walk, and postural sway using a sway-meter. Greater within-DMN connectivity was significantly correlated with poorer dual task performance. Furthermore, greater inter-network connectivity between the DMN and SMA was significantly correlated with slower gait speed and greater postural sway on the eyes open floor sway task. Thus, greater resting state DMN functional connectivity may be an underlying neural mechanism for reduced dual task

Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

DEFF Research Database (Denmark)

Pop, Traian; Pop, Paul; Eles, Petru

2005-01-01

We present an approach to the analysis and optimization of heterogeneous distributed embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource......, they are organized in a hierarchy. In this paper, we address design problems that are characteristic to such hierarchically scheduled systems: assignment of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We present algorithms for solving these problems....... Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilization of the system. The developed algorithms are evaluated using extensive experiments and a real-life example....

A language for data-parallel and task parallel programming dedicated to multi-SIMD computers. Contributions to hydrodynamic simulation with lattice gases

International Nuclear Information System (INIS)

Pic, Marc Michel

1995-01-01

Parallel programming covers task-parallelism and data-parallelism. Many problems need both parallelisms. Multi-SIMD computers allow hierarchical approach of these parallelisms. The T++ language, based on C++, is dedicated to exploit Multi-SIMD computers using a programming paradigm which is an extension of array-programming to tasks managing. Our language introduced array of independent tasks to achieve separately (MIMD), on subsets of processors of identical behaviour (SIMD), in order to translate the hierarchical inclusion of data-parallelism in task-parallelism. To manipulate in a symmetrical way tasks and data we propose meta-operations which have the same behaviour on tasks arrays and on data arrays. We explain how to implement this language on our parallel computer SYMPHONIE in order to profit by the locally-shared memory, by the hardware virtualization, and by the multiplicity of communications networks. We analyse simultaneously a typical application of such architecture. Finite elements scheme for Fluid mechanic needs powerful parallel computers and requires large floating points abilities. Lattice gases is an alternative to such simulations. Boolean lattice bases are simple, stable, modular, need to floating point computation, but include numerical noise. Boltzmann lattice gases present large precision of computation, but needs floating points and are only locally stable. We propose a new scheme, called multi-bit, who keeps the advantages of each boolean model to which it is applied, with large numerical precision and reduced noise. Experiments on viscosity, physical behaviour, noise reduction and spurious invariants are shown and implementation techniques for parallel Multi-SIMD computers detailed. (author) [fr

Constructing Long Short-Term Memory based Deep Recurrent Neural Networks for Large Vocabulary Speech Recognition

OpenAIRE

Li, Xiangang; Wu, Xihong

2014-01-01

Long short-term memory (LSTM) based acoustic modeling methods have recently been shown to give state-of-the-art performance on some speech recognition tasks. To achieve a further performance improvement, in this research, deep extensions on LSTM are investigated considering that deep hierarchical model has turned out to be more efficient than a shallow one. Motivated by previous research on constructing deep recurrent neural networks (RNNs), alternative deep LSTM architectures are proposed an...

Improved SIRAP analysis for synchronization in hierarchical scheduled real-time systems

NARCIS (Netherlands)

Behnam, M.; Bril, R.J.; Nolte, T.

2009-01-01

We present our ongoing work on synchronization in hierarchical scheduled real-time systems, where tasks are scheduled using fixed-priority pre-emptive scheduling. In this paper, we show that the original local schedulability analysis of the synchronization protocol SIRAP [4] is very pessimistic when

Dynamics of the central bottleneck: dual-task and task uncertainty.

Directory of Open Access Journals (Sweden)

Mariano Sigman

2006-07-01

Full Text Available Why is the human brain fundamentally limited when attempting to execute two tasks at the same time or in close succession? Two classical paradigms, psychological refractory period (PRP and task switching, have independently approached this issue, making significant advances in our understanding of the architecture of cognition. Yet, there is an apparent contradiction between the conclusions derived from these two paradigms. The PRP paradigm, on the one hand, suggests that the simultaneous execution of two tasks is limited solely by a passive structural bottleneck in which the tasks are executed on a first-come, first-served basis. The task-switching paradigm, on the other hand, argues that switching back and forth between task configurations must be actively controlled by a central executive system (the system controlling voluntary, planned, and flexible action. Here we have explicitly designed an experiment mixing the essential ingredients of both paradigms: task uncertainty and task simultaneity. In addition to a central bottleneck, we obtain evidence for active processes of task setting (planning of the appropriate sequence of actions and task disengaging (suppression of the plan set for the first task in order to proceed with the next one. Our results clarify the chronometric relations between these central components of dual-task processing, and in particular whether they operate serially or in parallel. On this basis, we propose a hierarchical model of cognitive architecture that provides a synthesis of task-switching and PRP paradigms.

Heterogeneity within the frontoparietal control network and its relationship to the default and dorsal attention networks.

Science.gov (United States)

Dixon, Matthew L; De La Vega, Alejandro; Mills, Caitlin; Andrews-Hanna, Jessica; Spreng, R Nathan; Cole, Michael W; Christoff, Kalina

2018-02-13

The frontoparietal control network (FPCN) plays a central role in executive control. It has been predominantly viewed as a unitary domain general system. Here, we examined patterns of FPCN functional connectivity (FC) across multiple conditions of varying cognitive demands, to test for FPCN heterogeneity. We identified two distinct subsystems within the FPCN based on hierarchical clustering and machine learning classification analyses of within-FPCN FC patterns. These two FPCN subsystems exhibited distinct patterns of FC with the default network (DN) and the dorsal attention network (DAN). FPCN A exhibited stronger connectivity with the DN than the DAN, whereas FPCN B exhibited the opposite pattern. This twofold FPCN differentiation was observed across four independent datasets, across nine different conditions (rest and eight tasks), at the level of individual-participant data, as well as in meta-analytic coactivation patterns. Notably, the extent of FPCN differentiation varied across conditions, suggesting flexible adaptation to task demands. Finally, we used meta-analytic tools to identify several functional domains associated with the DN and DAN that differentially predict activation in the FPCN subsystems. These findings reveal a flexible and heterogeneous FPCN organization that may in part emerge from separable DN and DAN processing streams. We propose that FPCN A may be preferentially involved in the regulation of introspective processes, whereas FPCN B may be preferentially involved in the regulation of visuospatial perceptual attention.

Multiperiod Hierarchical Location Problem of Transit Hub in Urban Agglomeration Area

Directory of Open Access Journals (Sweden)

Ting-ting Li

2017-01-01

Full Text Available With the rapid urbanization in developing countries, urban agglomeration area (UAA forms. Also, transportation demand in UAA grows rapidly and presents hierarchical feature. Therefore, it is imperative to develop models for transit hubs to guide the development of UAA and better meet the time-varying and hierarchical transportation demand. In this paper, the multiperiod hierarchical location problem of transit hub in urban agglomeration area (THUAA is studied. A hierarchical service network of THUAA with a multiflow, nested, and noncoherent structure is described. Then a multiperiod hierarchical mathematical programming model is proposed, aiming at minimizing the total demand weighted travel time. Moreover, an improved adaptive clonal selection algorithm is presented to solve the model. Both the model and algorithm are verified by the application to a real-life problem of Beijing-Tianjin-Hebei Region in China. The results of different scenarios in the case show that urban population migration has a great impact on the THUAA location scheme. Sustained and appropriate urban population migration helps to reduce travel time for urban residents.

Distributed hierarchical radiation monitoring system

International Nuclear Information System (INIS)

Barak, D.

1985-01-01

A solution to the problem of monitoring the radiation levels in and around a nuclear facility is presented in this paper. This is a private case of a large scale general purpose data acqisition system with high reliability, availability and short maintenance time. The physical layout of the detectors in the plant, and the strict control demands dictated a distributed and hierarchical system. The system is comprised of three levels, each level contains modules. Level one contains the Control modules which collects data from groups of detectors and executes emergency local control tasks. In level two are the Group controllers which concentrate data from the Control modules, and enable local display and communication. The system computer is in level three, enabling the plant operator to receive information from the detectors and execute control tasks. The described system was built and is operating successfully for about two years. (author)

Hierarchical structure of biological systems: a bioengineering approach.

Science.gov (United States)

Alcocer-Cuarón, Carlos; Rivera, Ana L; Castaño, Victor M

2014-01-01

A general theory of biological systems, based on few fundamental propositions, allows a generalization of both Wierner and Berthalanffy approaches to theoretical biology. Here, a biological system is defined as a set of self-organized, differentiated elements that interact pair-wise through various networks and media, isolated from other sets by boundaries. Their relation to other systems can be described as a closed loop in a steady-state, which leads to a hierarchical structure and functioning of the biological system. Our thermodynamical approach of hierarchical character can be applied to biological systems of varying sizes through some general principles, based on the exchange of energy information and/or mass from and within the systems.

Obstacle Avoidance of a Mobile Robot with Hierarchical Structure

Energy Technology Data Exchange (ETDEWEB)

Park, Chan Gyu [Yeungnam College of Science and Technolgy, Taegu (Korea)

2001-06-01

This paper proposed a new hierarchical fuzzy-neural network algorithm for navigation of a mobile robot within unknown dynamic environment. Proposed navigation algorithm used the learning ability of the neural network and the feasibility of control highly nonlinear system of fuzzy theory. The proposed navigation algorithm used fuzzy algorithm for goal approach and fuzzy-network for effective collision avoidance. Some computer simulation results for a mobile robot equipped with ultrasonic range sensors show that the suggested navigation algorithm is very effective to escape in stationary and moving obstacles environment. (author). 11 refs., 14 figs., 2 tabs.

AUTOMATION PROGRAM FOR RECOGNITION OF ALGORITHM SOLUTION OF MATHEMATIC TASK

Directory of Open Access Journals (Sweden)

Denis N. Butorin

2014-01-01

Full Text Available In the article are been describing technology for manage of testing task in computer program. It was found for recognition of algorithm solution of mathematic task. There are been justifi ed the using hierarchical structure for a special set of testing questions. Also, there has been presented the release of the described tasks in the computer program openSEE. 

AUTOMATION PROGRAM FOR RECOGNITION OF ALGORITHM SOLUTION OF MATHEMATIC TASK

OpenAIRE

Denis N. Butorin

2014-01-01

In the article are been describing technology for manage of testing task in computer program. It was found for recognition of algorithm solution of mathematic task. There are been justifi ed the using hierarchical structure for a special set of testing questions. Also, there has been presented the release of the described tasks in the computer program openSEE. 

Visualization of Social Networks

NARCIS (Netherlands)

Boertjes, E.M.; Kotterink, B.; Jager, E.J.

2011-01-01

Current visualizations of social networks are mostly some form of node-link diagram. Depending on the type of social network, this can be some treevisualization with a strict hierarchical structure or a more generic network visualization.

Assembling nitrogen and oxygen co-doped graphene quantum dots onto hierarchical carbon networks for all-solid-state flexible supercapacitors

International Nuclear Information System (INIS)

Li, Zhen; Li, Yanfeng; Wang, Liang; Cao, Ling; Liu, Xiang; Chen, Zhiwen; Pan, Dengyu; Wu, Minghong

2017-01-01

Highlights: • The all-carbon ternary flexible electrodes have been fabricated by the electrode deposition of nitrogen and oxygen co-doped single-crystalline GQDs. • The flexible electrodes deliver ultrahigh specific capacitance (461 mF cm"−"2) by inducing a high concentration of active nitrogen and oxygen at edge. • Symmetrical N-O-GQD/CNT/CC all-solid-state flexible supercapacitors offer energy density up to 32 μWh cm"−"2 and demonstrate the good stability, high flexibility, and folding ability under different deformations. • Nitrogen and oxygen co-doped GQDs can function as a highly active, solution-processable pseudocapacitive materials applicable to high-performance supercapacitors. - Abstract: We present a novel approach for hierarchical fabrication of high-performance, all-solid-state, flexible supercapacitors from environmentally friendly all-carbon materials. Three-dimensional carbon nanotube/carbon cloth network (CNT/CC) is used as a conductive, flexible and free-standing scaffold for the electro-deposition of highly N/O co-doped graphene quantum dots to form the high-activity, all-carbon electrodes. The hierarchical structure of the CNT/CC network with high electrical conductivity and high surface area provides improved conductive pathways for the efficient activation of GQDs with high pseudocapacitance and electrical double layer capacitance. The obtained N-O-GQD/CNT/CC electrodes for all-solid-state flexible supercapacitors exhibit an ultrahigh areal capacitance of up to 461 mF cm"−"2 at a current density of 0.5 mA cm"−"2, while keeping high rate and cyclic performances. This work highlights the great potential of highly active GQDs in the construction of high-performance flexible energy-storage devices.

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

Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

Directory of Open Access Journals (Sweden)

Lian-Hui Li

Full Text Available The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

Nanoscale Analysis of a Hierarchical Hybrid Solar Cell in 3D.

Science.gov (United States)

Divitini, Giorgio; Stenzel, Ole; Ghadirzadeh, Ali; Guarnera, Simone; Russo, Valeria; Casari, Carlo S; Bassi, Andrea Li; Petrozza, Annamaria; Di Fonzo, Fabio; Schmidt, Volker; Ducati, Caterina

2014-05-01

A quantitative method for the characterization of nanoscale 3D morphology is applied to the investigation of a hybrid solar cell based on a novel hierarchical nanostructured photoanode. A cross section of the solar cell device is prepared by focused ion beam milling in a micropillar geometry, which allows a detailed 3D reconstruction of the titania photoanode by electron tomography. It is found that the hierarchical titania nanostructure facilitates polymer infiltration, thus favoring intermixing of the two semiconducting phases, essential for charge separation. The 3D nanoparticle network is analyzed with tools from stochastic geometry to extract information related to the charge transport in the hierarchical solar cell. In particular, the experimental dataset allows direct visualization of the percolation pathways that contribute to the photocurrent.

Optimizing the Number of Cooperating Terminals for Energy Aware Task Computing in Wireless Networks

DEFF Research Database (Denmark)

Olsen, Anders Brødløs; Fitzek, Frank H. P.; Koch, Peter

2005-01-01

It is generally accepted that energy consumption is a significant design constraint for mobile handheld systems, therefore motivations for methods optimizing the energy consumption making better use of the restricted battery resources are evident. A novel concept of distributed task computing...... is previously proposed (D2VS), where the overall idea of selective distribution of tasks among terminals is made. In this paper the optimal number of terminals for cooperative task computing in a wireless network will be investigated. The paper presents an energy model for the proposed scheme. Energy...... consumption of the terminals with respect to their workload and the overhead of distributing tasks among terminals are taken into account. The paper shows, that the number of cooperating terminals is in general limited to a few, though alternating with respect to the various system parameters....

Hierarchical processing in the prefrontal cortex in a variety of cognitive domains

Directory of Open Access Journals (Sweden)

Hyeon-Ae eJeon

2014-11-01

Full Text Available This review scrutinizes several findings on human hierarchical processing within the prefrontal cortex (PFC in diverse cognitive domains. Converging evidence from previous studies has shown that the PFC, specifically Brodmann area (BA 44, may function as the essential region for hierarchical processing across the domains. In language fMRI studies, BA 44 was significantly activated for the hierarchical processing of center-embedded sentences and this pattern of activations was also observed in artificial grammar. The same pattern was observed in the visuo-spatial domain where BA44 was actively involved in the processing of hierarchy for the visual symbol. Musical syntax, which is the rule-based arrangement of musical sets, has also been construed as hierarchical processing as in the language domain such that the activation in BA44 was observed in a chord sequence paradigm. P600 ERP was also engendered during the processing of musical hierarchy. Along with a longstanding idea that a human’s number faculty is developed as a by-product of language faculty, BA44 was closely involved in hierarchical processing in mental arithmetic. This review extended its discussion of hierarchical processing to hierarchical behavior, that is, human action which has been referred to as being hierarchically composed. Several lesion and TMS studies supported the involvement of BA44 for hierarchical processing in the action domain. Lastly, the hierarchical organization of cognitive controls was discussed within the PFC, forming a cascade of top-down hierarchical processes operating along a posterior-to-anterior axis of the lateral PFC including BA44 within the network. It is proposed that PFC is actively involved in different forms of hierarchical processing and specifically BA44 may play an integral role in the process. Taking levels of proficiency and subcortical areas into consideration may provide further insight into the functional role of BA44 for hierarchical

Rapid Authoring of Task Knowledge for Training and Performance Support

National Research Council Canada - National Science Library

Mohammed, John L; Sorensen, Barbara; Ong, James C; Li, Jian

2005-01-01

.... These systems use hierarchical, object-oriented task representations that enable rapid authoring by non-programmers while supporting sophisticated job aiding and student performance evaluation...

Brain functional network changes following Prelimbic area inactivation in a spatial memory extinction task.

Science.gov (United States)

Méndez-Couz, Marta; Conejo, Nélida M; Vallejo, Guillermo; Arias, Jorge L

2015-01-01

Several studies suggest a prefrontal cortex involvement during the acquisition and consolidation of spatial memory, suggesting an active modulating role at late stages of acquisition processes. Recently, we have reported that the prelimbic and infralimbic areas of the prefrontal cortex, among other structures, are also specifically involved in the late phases of spatial memory extinction. This study aimed to evaluate whether the inactivation of the prelimbic area of the prefrontal cortex impaired spatial memory extinction. For this purpose, male Wistar rats were implanted bilaterally with cannulae into the prelimbic region of the prefrontal cortex. Animals were trained during 5 consecutive days in a hidden platform task and tested for reference spatial memory immediately after the last training session. One day after completing the training task, bilateral infusion of the GABAA receptor agonist Muscimol was performed before the extinction protocol was carried out. Additionally, cytochrome c oxidase histochemistry was applied to map the metabolic brain activity related to the spatial memory extinction under prelimbic cortex inactivation. Results show that animals acquired the reference memory task in the water maze, and the extinction task was successfully completed without significant impairment. However, analysis of the functional brain networks involved by cytochrome oxidase activity interregional correlations showed changes in brain networks between the group treated with Muscimol as compared to the saline-treated group, supporting the involvement of the mammillary bodies at a the late stage in the memory extinction process. Copyright © 2015 Elsevier B.V. All rights reserved.

Task-Related Edge Density (TED)-A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain.

Science.gov (United States)

Lohmann, Gabriele; Stelzer, Johannes; Zuber, Verena; Buschmann, Tilo; Margulies, Daniel; Bartels, Andreas; Scheffler, Klaus

2016-01-01

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach "Task-related Edge Density" (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function.

Task-Related Edge Density (TED-A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain.

Directory of Open Access Journals (Sweden)

Gabriele Lohmann

Full Text Available The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach "Task-related Edge Density" (TED. TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function.

Hallucination- and speech-specific hypercoupling in frontotemporal auditory and language networks in schizophrenia using combined task-based fMRI data: An fBIRN study.

Science.gov (United States)

Lavigne, Katie M; Woodward, Todd S

2018-04-01

Hypercoupling of activity in speech-perception-specific brain networks has been proposed to play a role in the generation of auditory-verbal hallucinations (AVHs) in schizophrenia; however, it is unclear whether this hypercoupling extends to nonverbal auditory perception. We investigated this by comparing schizophrenia patients with and without AVHs, and healthy controls, on task-based functional magnetic resonance imaging (fMRI) data combining verbal speech perception (SP), inner verbal thought generation (VTG), and nonverbal auditory oddball detection (AO). Data from two previously published fMRI studies were simultaneously analyzed using group constrained principal component analysis for fMRI (group fMRI-CPCA), which allowed for comparison of task-related functional brain networks across groups and tasks while holding the brain networks under study constant, leading to determination of the degree to which networks are common to verbal and nonverbal perception conditions, and which show coordinated hyperactivity in hallucinations. Three functional brain networks emerged: (a) auditory-motor, (b) language processing, and (c) default-mode (DMN) networks. Combining the AO and sentence tasks allowed the auditory-motor and language networks to separately emerge, whereas they were aggregated when individual tasks were analyzed. AVH patients showed greater coordinated activity (deactivity for DMN regions) than non-AVH patients during SP in all networks, but this did not extend to VTG or AO. This suggests that the hypercoupling in AVH patients in speech-perception-related brain networks is specific to perceived speech, and does not extend to perceived nonspeech or inner verbal thought generation. © 2017 Wiley Periodicals, Inc.

A Clustering Routing Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jinke Huang

2016-01-01

Full Text Available The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both. And as an essential technique of hierarchical routing protocol, clustering of nodes provides an efficient method of establishing a hierarchical structure in mobile ad hoc networks. In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks. Each cluster is composed of a cluster head, several cluster gateway nodes, several cluster guest nodes, and other cluster members. The proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. Simulation results show that the proposed clustering algorithm and hierarchical routing protocol provide superior performance with several advantages over existing clustering algorithm and routing protocol, respectively.

A Hierarchical Auction-Based Mechanism for Real-Time Resource Allocation in Cloud Robotic Systems.

Science.gov (United States)

Wang, Lujia; Liu, Ming; Meng, Max Q-H

2017-02-01

Cloud computing enables users to share computing resources on-demand. The cloud computing framework cannot be directly mapped to cloud robotic systems with ad hoc networks since cloud robotic systems have additional constraints such as limited bandwidth and dynamic structure. However, most multirobotic applications with cooperative control adopt this decentralized approach to avoid a single point of failure. Robots need to continuously update intensive data to execute tasks in a coordinated manner, which implies real-time requirements. Thus, a resource allocation strategy is required, especially in such resource-constrained environments. This paper proposes a hierarchical auction-based mechanism, namely link quality matrix (LQM) auction, which is suitable for ad hoc networks by introducing a link quality indicator. The proposed algorithm produces a fast and robust method that is accurate and scalable. It reduces both global communication and unnecessary repeated computation. The proposed method is designed for firm real-time resource retrieval for physical multirobot systems. A joint surveillance scenario empirically validates the proposed mechanism by assessing several practical metrics. The results show that the proposed LQM auction outperforms state-of-the-art algorithms for resource allocation.

gTBS: A green Task-Based Sensing for energy efficient Wireless Sensor Networks

KAUST Repository

Al-Halafi, Abdullah

2016-09-08

Wireless sensor networks (WSN) are widely used to sense and measure physical conditions for different purposes and within different regions. However due to the limited lifetime of the sensor\\'s energy source, many efforts are made to design energy efficient WSN. As a result, many techniques were presented in the literature such as power adaptation, sleep and wake-up, and scheduling in order to enhance WSN lifetime. These techniques where presented separately and shown to achieve some gain in terms of energy efficiency. In this paper, we present an energy efficient cross layer design for WSN that we named \\'green Task-Based Sensing\\' (gTBS) scheme. The gTBS design is a task based sensing scheme that not only prevents wasting power in unnecessary signaling, but also utilizes several techniques for achieving reliable and energy efficient WSN. The proposed gTBS combines the power adaptation with a sleep and wake-up technique that allows inactive nodes to sleep. Also, it adopts a gradient-oriented unicast approach to overcome the synchronization problem, minimize network traffic hurdles, and significantly reduce the overall power consumption of the network. We implement the gTBS on a testbed and we show that it reduces the power consumption by a factor of 20%-55% compared to traditional TBS. It also reduces the delay by 54%-145% and improves the delivery ratio by 24%-73%. © 2016 IEEE.

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

Algorithm of parallel: hierarchical transformation and its implementation on FPGA

Science.gov (United States)

Timchenko, Leonid I.; Petrovskiy, Mykola S.; Kokryatskay, Natalia I.; Barylo, Alexander S.; Dembitska, Sofia V.; Stepanikuk, Dmytro S.; Suleimenov, Batyrbek; Zyska, Tomasz; Uvaysova, Svetlana; Shedreyeva, Indira

2017-08-01

In this paper considers the algorithm of laser beam spots image classification in atmospheric-optical transmission systems. It discusses the need for images filtering using adaptive methods, using, for example, parallel-hierarchical networks. The article also highlights the need to create high-speed memory devices for such networks. Implementation and simulation results of the developed method based on the PLD are demonstrated, which shows that the presented method gives 15-20% better prediction results than similar methods.

Managing the systems approach to training using a flexible Hierarchical data base

International Nuclear Information System (INIS)

Housman, E.; Bush, E.R.

1993-01-01

Task analysis/curriculum design for a nuclear power station results in a massive amount of data, which must be sequenced and ordered to create an effective program design. This is an almost impossible task without the use of computerized data base. Beginning in 1989, San Onofre nuclear generating station (SONGS) undertook a task analysis/program design project to verify the structure and sequence (design) of all accredited training program. A flex hierarchical data-base management system was designed to store and manage the data collected during the project. For the Operations Training Programm alone ∼8000 tasks, 90,000 knowledges and abilities, and 10,000 learning objectives were entered into this data base

Means-end chains as associative networks: Do they exhibit automatic spreading activation

DEFF Research Database (Denmark)

Scholderer, Joachim; Grunert, Klaus G.

Despite its popularity in consumer research, means-end chain theory suffers from problems of unconfirmed validity. In particular, it is unknown if its central construct, the means-end chain (MEC), is an identifiable memory structure or not. Theoretically, means-end chains can be cast as associative...... networks with a three-layered structure, consisting of attributes (A), consequences (C) and values (V) that are hierarchically linked. This yields two predictions when operationalized in a lexical decision task: means-end chains should display spreading activation (direct as well as mediated priming...

Hierarchical Self Organizing Map for Novelty Detection using Mobile Robot with Robust Sensor

International Nuclear Information System (INIS)

Sha'abani, M N A H; Miskon, M F; Sakidin, H

2013-01-01

This paper presents a novelty detection method based on Self Organizing Map neural network using a mobile robot. Based on hierarchical neural network, the network is divided into three networks; position, orientation and sensor measurement network. A simulation was done to demonstrate and validate the proposed method using MobileSim. Three cases of abnormal events; new, missing and shifted objects are employed for performance evaluation. The result of detection was then filtered for false positive detection. The result shows that the inspection produced less than 2% false positive detection at high sensitivity settings

Modulations of the executive control network by stimulus onset asynchrony in a Stroop task

Science.gov (United States)

2013-01-01

Background Manipulating task difficulty is a useful way of elucidating the functional recruitment of the brain’s executive control network. In a Stroop task, pre-exposing the irrelevant word using varying stimulus onset asynchronies (‘negative’ SOAs) modulates the amount of behavioural interference and facilitation, suggesting disparate mechanisms of cognitive processing in each SOA. The current study employed a Stroop task with three SOAs (−400, -200, 0 ms), using functional magnetic resonance imaging to investigate for the first time the neural effects of SOA manipulation. Of specific interest were 1) how SOA affects the neural representation of interference and facilitation; 2) response priming effects in negative SOAs; and 3) attentional effects of blocked SOA presentation. Results The results revealed three regions of the executive control network that were sensitive to SOA during Stroop interference; the 0 ms SOA elicited the greatest activation of these areas but experienced relatively smaller behavioural interference, suggesting that the enhanced recruitment led to more efficient conflict processing. Response priming effects were localized to the right inferior frontal gyrus, which is consistent with the idea that this region performed response inhibition in incongruent conditions to overcome the incorrectly-primed response, as well as more general action updating and response preparation. Finally, the right superior parietal lobe was sensitive to blocked SOA presentation and was most active for the 0 ms SOA, suggesting that this region is involved in attentional control. Conclusions SOA exerted both trial-specific and block-wide effects on executive processing, providing a unique paradigm for functional investigations of the cognitive control network. PMID:23902451

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.

Unsupervised Learning in an Ensemble of Spiking Neural Networks Mediated by ITDP.

Directory of Open Access Journals (Sweden)

Yoonsik Shim

2016-10-01

Full Text Available We propose a biologically plausible architecture for unsupervised ensemble learning in a population of spiking neural network classifiers. A mixture of experts type organisation is shown to be effective, with the individual classifier outputs combined via a gating network whose operation is driven by input timing dependent plasticity (ITDP. The ITDP gating mechanism is based on recent experimental findings. An abstract, analytically tractable model of the ITDP driven ensemble architecture is derived from a logical model based on the probabilities of neural firing events. A detailed analysis of this model provides insights that allow it to be extended into a full, biologically plausible, computational implementation of the architecture which is demonstrated on a visual classification task. The extended model makes use of a style of spiking network, first introduced as a model of cortical microcircuits, that is capable of Bayesian inference, effectively performing expectation maximization. The unsupervised ensemble learning mechanism, based around such spiking expectation maximization (SEM networks whose combined outputs are mediated by ITDP, is shown to perform the visual classification task well and to generalize to unseen data. The combined ensemble performance is significantly better than that of the individual classifiers, validating the ensemble architecture and learning mechanisms. The properties of the full model are analysed in the light of extensive experiments with the classification task, including an investigation into the influence of different input feature selection schemes and a comparison with a hierarchical STDP based ensemble architecture.

Unsupervised Learning in an Ensemble of Spiking Neural Networks Mediated by ITDP.

Science.gov (United States)

Shim, Yoonsik; Philippides, Andrew; Staras, Kevin; Husbands, Phil

2016-10-01

We propose a biologically plausible architecture for unsupervised ensemble learning in a population of spiking neural network classifiers. A mixture of experts type organisation is shown to be effective, with the individual classifier outputs combined via a gating network whose operation is driven by input timing dependent plasticity (ITDP). The ITDP gating mechanism is based on recent experimental findings. An abstract, analytically tractable model of the ITDP driven ensemble architecture is derived from a logical model based on the probabilities of neural firing events. A detailed analysis of this model provides insights that allow it to be extended into a full, biologically plausible, computational implementation of the architecture which is demonstrated on a visual classification task. The extended model makes use of a style of spiking network, first introduced as a model of cortical microcircuits, that is capable of Bayesian inference, effectively performing expectation maximization. The unsupervised ensemble learning mechanism, based around such spiking expectation maximization (SEM) networks whose combined outputs are mediated by ITDP, is shown to perform the visual classification task well and to generalize to unseen data. The combined ensemble performance is significantly better than that of the individual classifiers, validating the ensemble architecture and learning mechanisms. The properties of the full model are analysed in the light of extensive experiments with the classification task, including an investigation into the influence of different input feature selection schemes and a comparison with a hierarchical STDP based ensemble architecture.

Revisiting the variation of clustering coefficient of biological networks suggests new modular structure.

Science.gov (United States)

Hao, Dapeng; Ren, Cong; Li, Chuanxing

2012-05-01

A central idea in biology is the hierarchical organization of cellular processes. A commonly used method to identify the hierarchical modular organization of network relies on detecting a global signature known as variation of clustering coefficient (so-called modularity scaling). Although several studies have suggested other possible origins of this signature, it is still widely used nowadays to identify hierarchical modularity, especially in the analysis of biological networks. Therefore, a further and systematical investigation of this signature for different types of biological networks is necessary. We analyzed a variety of biological networks and found that the commonly used signature of hierarchical modularity is actually the reflection of spoke-like topology, suggesting a different view of network architecture. We proved that the existence of super-hubs is the origin that the clustering coefficient of a node follows a particular scaling law with degree k in metabolic networks. To study the modularity of biological networks, we systematically investigated the relationship between repulsion of hubs and variation of clustering coefficient. We provided direct evidences for repulsion between hubs being the underlying origin of the variation of clustering coefficient, and found that for biological networks having no anti-correlation between hubs, such as gene co-expression network, the clustering coefficient doesn't show dependence of degree. Here we have shown that the variation of clustering coefficient is neither sufficient nor exclusive for a network to be hierarchical. Our results suggest the existence of spoke-like modules as opposed to "deterministic model" of hierarchical modularity, and suggest the need to reconsider the organizational principle of biological hierarchy.

Task-Related Edge Density (TED)—A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain

Science.gov (United States)

Lohmann, Gabriele; Stelzer, Johannes; Zuber, Verena; Buschmann, Tilo; Margulies, Daniel; Bartels, Andreas; Scheffler, Klaus

2016-01-01

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach “Task-related Edge Density” (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function. PMID:27341204

Application of hierarchical dissociated neural network in closed-loop hybrid system integrating biological and mechanical intelligence.

Directory of Open Access Journals (Sweden)

Yongcheng Li

Full Text Available Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including 'random' and '4Q' (cultured neurons artificially divided into four interconnected parts neural network. Compared to the random cultures, the '4Q' cultures presented absolutely different activities, and the robot controlled by the '4Q' network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems.

Application of Hierarchical Dissociated Neural Network in Closed-Loop Hybrid System Integrating Biological and Mechanical Intelligence

Science.gov (United States)

Zhang, Bin; Wang, Yuechao; Li, Hongyi

2015-01-01

Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including ‘random’ and ‘4Q’ (cultured neurons artificially divided into four interconnected parts) neural network. Compared to the random cultures, the ‘4Q’ cultures presented absolutely different activities, and the robot controlled by the ‘4Q’ network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems. PMID:25992579

Application of hierarchical dissociated neural network in closed-loop hybrid system integrating biological and mechanical intelligence.

Science.gov (United States)

Li, Yongcheng; Sun, Rong; Zhang, Bin; Wang, Yuechao; Li, Hongyi

2015-01-01

Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including 'random' and '4Q' (cultured neurons artificially divided into four interconnected parts) neural network. Compared to the random cultures, the '4Q' cultures presented absolutely different activities, and the robot controlled by the '4Q' network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems.

Evolution of Hierarchical Structure and Spatial Pattern of Coastal Cities in China – Based on the Data of Distribution of Marine-Related Enterprises

Directory of Open Access Journals (Sweden)

Wang Lili

2017-11-01

Full Text Available In this paper, a comprehensive research of the evolution of the hierarchical structure and spatial pattern of coastal cities in China was conducted based on the data of distribution of the headquarters and subsidiaries of marine-related enterprises in 1995, 2005 and 2015 using the city network research method proposed by Taylor. The results of the empirical research showed: China’s coastal city network had an obvious hierarchical characteristics of “national coastal cityregional coastal city-sub-regional coastal city-local coastal city”, in the 20 years of development process, the hierarchies of coastal cities in China showed a hierarchical progressive evolution; in past 20 years, the spatial pattern and network structure of coastal cities in China tended to be complete, and the city network was more uniform, forming a “three tiers and three urban agglomerations” network structure; the strength of connection among the cities was obviously strengthened, and the efficiency of urban spatial connection was improved overall.

Hierarchical Compliance Control of a Soft Ankle Rehabilitation Robot Actuated by Pneumatic Muscles.

Science.gov (United States)

Liu, Quan; Liu, Aiming; Meng, Wei; Ai, Qingsong; Xie, Sheng Q

2017-01-01

Traditional compliance control of a rehabilitation robot is implemented in task space by using impedance or admittance control algorithms. The soft robot actuated by pneumatic muscle actuators (PMAs) is becoming prominent for patients as it enables the compliance being adjusted in each active link, which, however, has not been reported in the literature. This paper proposes a new compliance control method of a soft ankle rehabilitation robot that is driven by four PMAs configured in parallel to enable three degrees of freedom movement of the ankle joint. A new hierarchical compliance control structure, including a low-level compliance adjustment controller in joint space and a high-level admittance controller in task space, is designed. An adaptive compliance control paradigm is further developed by taking into account patient's active contribution and movement ability during a previous period of time, in order to provide robot assistance only when it is necessarily required. Experiments on healthy and impaired human subjects were conducted to verify the adaptive hierarchical compliance control scheme. The results show that the robot hierarchical compliance can be online adjusted according to the participant's assessment. The robot reduces its assistance output when participants contribute more and vice versa , thus providing a potentially feasible solution to the patient-in-loop cooperative training strategy.

Mathematics anxiety reduces default mode network deactivation in response to numerical tasks

Directory of Open Access Journals (Sweden)

Belinda ePletzer

2015-04-01

Full Text Available Mathematics anxiety is negatively related to mathematics performance, thereby threatening the professional success. Preoccupation with the emotional content of the stimuli may consume working memory resources, which may be reflected in decreased deactivation of areas associated with the default mode network (DMN activated during self-referential and emotional processing. The common problem is that math anxiety is usually associated with poor math performance, so that any group differences are difficult to interpret.Here we compared the BOLD-response of 18 participants with high (HMAs and 18 participants with low mathematics anxiety (LMAs matched for their mathematical performance to two numerical tasks (number comparison, number bisection. During both tasks, we found stronger deactivation within the DMN in LMAs compared to HMAs, while BOLD-response in task-related activation areas did not differ between HMAs and LMAs. The difference in DMN deactivation between the HMA and LMA group was more pronounced in stimuli with additional requirement on inhibitory functions, but did not differ between number magnitude processing and arithmetic fact retrieval.

Mathematics anxiety reduces default mode network deactivation in response to numerical tasks.

Science.gov (United States)

Pletzer, Belinda; Kronbichler, Martin; Nuerk, Hans-Christoph; Kerschbaum, Hubert H

2015-01-01

Mathematics anxiety is negatively related to mathematics performance, thereby threatening the professional success. Preoccupation with the emotional content of the stimuli may consume working memory resources, which may be reflected in decreased deactivation of areas associated with the default mode network (DMN) activated during self-referential and emotional processing. The common problem is that math anxiety is usually associated with poor math performance, so that any group differences are difficult to interpret. Here we compared the BOLD-response of 18 participants with high (HMAs) and 18 participants with low mathematics anxiety (LMAs) matched for their mathematical performance to two numerical tasks (number comparison, number bisection). During both tasks, we found stronger deactivation within the DMN in LMAs compared to HMAs, while BOLD-response in task-related activation areas did not differ between HMAs and LMAs. The difference in DMN deactivation between the HMA and LMA group was more pronounced in stimuli with additional requirement on inhibitory functions, but did not differ between number magnitude processing and arithmetic fact retrieval.

Easy synthesis of hierarchical carbon spheres with superior capacitive performance in supercapacitors.

Science.gov (United States)

Huang, Xinhua; Kim, Seok; Heo, Min Seon; Kim, Ji Eun; Suh, Hongsuk; Kim, Il

2013-10-01

An easy template-free approach to the fabrication of pure carbon microspheres has been achieved via direct pyrolysis of as-prepared polyaromatic hydrocarbons including polynaphthalene and polypyrene. The polyaromatics were synthesized from aromatic hydrocarbons (AHCs) using anhydrous zinc chloride as the Friedel-Crafts catalyst and chloromethyl methyl ether as a cross-linker. The experimental results show that the methylene bridges between phenyl rings generate a hierarchical porous polyaromatic precursor to form three-dimensionally (3D) interconnected micro-, meso-, and macroporous networks during carbonization. These hierarchical porous carbon aggregates of spherical carbon spheres exhibit faster ion transport/diffusion behavior and increased surface area usage in electric double-layer capacitors. Furthermore, micropores are present in the 3D interconnected network inside the cross-linked AHC-based carbon microspheres, thus imparting an exceptionally large, electrochemically accessible surface area for charge accumulation.

A Shell Multi-dimensional Hierarchical Cubing Approach for High-Dimensional Cube

Science.gov (United States)

Zou, Shuzhi; Zhao, Li; Hu, Kongfa

The pre-computation of data cubes is critical for improving the response time of OLAP systems and accelerating data mining tasks in large data warehouses. However, as the sizes of data warehouses grow, the time it takes to perform this pre-computation becomes a significant performance bottleneck. In a high dimensional data warehouse, it might not be practical to build all these cuboids and their indices. In this paper, we propose a shell multi-dimensional hierarchical cubing algorithm, based on an extension of the previous minimal cubing approach. This method partitions the high dimensional data cube into low multi-dimensional hierarchical cube. Experimental results show that the proposed method is significantly more efficient than other existing cubing methods.

Numerical analysis of a neural network with hierarchically organized patterns

International Nuclear Information System (INIS)

Bacci, Silvia; Wiecko, Cristina; Parga, Nestor

1988-01-01

A numerical analysis of the retrieval behaviour of an associative memory model where the memorized patterns are stored hierarchically is performed. It is found that the model is able to categorize errors. For a finite number of categories, these are retrieved correctly even when the stored patterns are not. Instead, when they are allowed to increase with the number of neurons, their retrieval quality deteriorates above a critical category capacity. (Author)

Hierarchical unilamellar vesicles of controlled compositional heterogeneity.

Directory of Open Access Journals (Sweden)

Maik Hadorn

Full Text Available Eukaryotic life contains hierarchical vesicular architectures (i.e. organelles that are crucial for material production and trafficking, information storage and access, as well as energy production. In order to perform specific tasks, these compartments differ among each other in their membrane composition and their internal cargo and also differ from the cell membrane and the cytosol. Man-made structures that reproduce this nested architecture not only offer a deeper understanding of the functionalities and evolution of organelle-bearing eukaryotic life but also allow the engineering of novel biomimetic technologies. Here, we show the newly developed vesicle-in-water-in-oil emulsion transfer preparation technique to result in giant unilamellar vesicles internally compartmentalized by unilamellar vesicles of different membrane composition and internal cargo, i.e. hierarchical unilamellar vesicles of controlled compositional heterogeneity. The compartmentalized giant unilamellar vesicles were subsequently isolated by a separation step exploiting the heterogeneity of the membrane composition and the encapsulated cargo. Due to the controlled, efficient, and technically straightforward character of the new preparation technique, this study allows the hierarchical fabrication of compartmentalized giant unilamellar vesicles of controlled compositional heterogeneity and will ease the development of eukaryotic cell mimics that resemble their natural templates as well as the fabrication of novel multi-agent drug delivery systems for combination therapies and complex artificial microreactors.

A Neural Network Model to Learn Multiple Tasks under Dynamic Environments

Science.gov (United States)

Tsumori, Kenji; Ozawa, Seiichi

When environments are dynamically changed for agents, the knowledge acquired in an environment might be useless in future. In such dynamic environments, agents should be able to not only acquire new knowledge but also modify old knowledge in learning. However, modifying all knowledge acquired before is not efficient because the knowledge once acquired may be useful again when similar environment reappears and some knowledge can be shared among different environments. To learn efficiently in such environments, we propose a neural network model that consists of the following modules: resource allocating network, long-term & short-term memory, and environment change detector. We evaluate the model under a class of dynamic environments where multiple function approximation tasks are sequentially given. The experimental results demonstrate that the proposed model possesses stable incremental learning, accurate environmental change detection, proper association and recall of old knowledge, and efficient knowledge transfer.

Revisiting the variation of clustering coefficient of biological networks suggests new modular structure

Directory of Open Access Journals (Sweden)

Hao Dapeng

2012-05-01

Full Text Available Abstract Background A central idea in biology is the hierarchical organization of cellular processes. A commonly used method to identify the hierarchical modular organization of network relies on detecting a global signature known as variation of clustering coefficient (so-called modularity scaling. Although several studies have suggested other possible origins of this signature, it is still widely used nowadays to identify hierarchical modularity, especially in the analysis of biological networks. Therefore, a further and systematical investigation of this signature for different types of biological networks is necessary. Results We analyzed a variety of biological networks and found that the commonly used signature of hierarchical modularity is actually the reflection of spoke-like topology, suggesting a different view of network architecture. We proved that the existence of super-hubs is the origin that the clustering coefficient of a node follows a particular scaling law with degree k in metabolic networks. To study the modularity of biological networks, we systematically investigated the relationship between repulsion of hubs and variation of clustering coefficient. We provided direct evidences for repulsion between hubs being the underlying origin of the variation of clustering coefficient, and found that for biological networks having no anti-correlation between hubs, such as gene co-expression network, the clustering coefficient doesn’t show dependence of degree. Conclusions Here we have shown that the variation of clustering coefficient is neither sufficient nor exclusive for a network to be hierarchical. Our results suggest the existence of spoke-like modules as opposed to “deterministic model” of hierarchical modularity, and suggest the need to reconsider the organizational principle of biological hierarchy.

Integrated analysis of multiple data sources reveals modular structure of biological networks

International Nuclear Information System (INIS)

Lu Hongchao; Shi Baochen; Wu Gaowei; Zhang Yong; Zhu Xiaopeng; Zhang Zhihua; Liu Changning; Zhao, Yi; Wu Tao; Wang Jie; Chen Runsheng

2006-01-01

It has been a challenging task to integrate high-throughput data into investigations of the systematic and dynamic organization of biological networks. Here, we presented a simple hierarchical clustering algorithm that goes a long way to achieve this aim. Our method effectively reveals the modular structure of the yeast protein-protein interaction network and distinguishes protein complexes from functional modules by integrating high-throughput protein-protein interaction data with the added subcellular localization and expression profile data. Furthermore, we take advantage of the detected modules to provide a reliably functional context for the uncharacterized components within modules. On the other hand, the integration of various protein-protein association information makes our method robust to false-positives, especially for derived protein complexes. More importantly, this simple method can be extended naturally to other types of data fusion and provides a framework for the study of more comprehensive properties of the biological network and other forms of complex networks

The functional neuroanatomy of multitasking: combining dual tasking with a short term memory task.

Science.gov (United States)

Deprez, Sabine; Vandenbulcke, Mathieu; Peeters, Ron; Emsell, Louise; Amant, Frederic; Sunaert, Stefan

2013-09-01

Insight into the neural architecture of multitasking is crucial when investigating the pathophysiology of multitasking deficits in clinical populations. Presently, little is known about how the brain combines dual-tasking with a concurrent short-term memory task, despite the relevance of this mental operation in daily life and the frequency of complaints related to this process, in disease. In this study we aimed to examine how the brain responds when a memory task is added to dual-tasking. Thirty-three right-handed healthy volunteers (20 females, mean age 39.9 ± 5.8) were examined with functional brain imaging (fMRI). The paradigm consisted of two cross-modal single tasks (a visual and auditory temporal same-different task with short delay), a dual-task combining both single tasks simultaneously and a multi-task condition, combining the dual-task with an additional short-term memory task (temporal same-different visual task with long delay). Dual-tasking compared to both individual visual and auditory single tasks activated a predominantly right-sided fronto-parietal network and the cerebellum. When adding the additional short-term memory task, a larger and more bilateral frontoparietal network was recruited. We found enhanced activity during multitasking in components of the network that were already involved in dual-tasking, suggesting increased working memory demands, as well as recruitment of multitask-specific components including areas that are likely to be involved in online holding of visual stimuli in short-term memory such as occipito-temporal cortex. These results confirm concurrent neural processing of a visual short-term memory task during dual-tasking and provide evidence for an effective fMRI multitasking paradigm. © 2013 Elsevier Ltd. All rights reserved.

A Hierarchical Feature Extraction Model for Multi-Label Mechanical Patent Classification

Directory of Open Access Journals (Sweden)

Jie Hu

2018-01-01

Full Text Available Various studies have focused on feature extraction methods for automatic patent classification in recent years. However, most of these approaches are based on the knowledge from experts in related domains. Here we propose a hierarchical feature extraction model (HFEM for multi-label mechanical patent classification, which is able to capture both local features of phrases as well as global and temporal semantics. First, a n-gram feature extractor based on convolutional neural networks (CNNs is designed to extract salient local lexical-level features. Next, a long dependency feature extraction model based on the bidirectional long–short-term memory (BiLSTM neural network model is proposed to capture sequential correlations from higher-level sequence representations. Then the HFEM algorithm and its hierarchical feature extraction architecture are detailed. We establish the training, validation and test datasets, containing 72,532, 18,133, and 2679 mechanical patent documents, respectively, and then check the performance of HFEMs. Finally, we compared the results of the proposed HFEM and three other single neural network models, namely CNN, long–short-term memory (LSTM, and BiLSTM. The experimental results indicate that our proposed HFEM outperforms the other compared models in both precision and recall.

Topics in Computational Bayesian Statistics With Applications to Hierarchical Models in Astronomy and Sociology

Science.gov (United States)

Sahai, Swupnil

This thesis includes three parts. The overarching theme is how to analyze structured hierarchical data, with applications to astronomy and sociology. The first part discusses how expectation propagation can be used to parallelize the computation when fitting big hierarchical bayesian models. This methodology is then used to fit a novel, nonlinear mixture model to ultraviolet radiation from various regions of the observable universe. The second part discusses how the Stan probabilistic programming language can be used to numerically integrate terms in a hierarchical bayesian model. This technique is demonstrated on supernovae data to significantly speed up convergence to the posterior distribution compared to a previous study that used a Gibbs-type sampler. The third part builds a formal latent kernel representation for aggregate relational data as a way to more robustly estimate the mixing characteristics of agents in a network. In particular, the framework is applied to sociology surveys to estimate, as a function of ego age, the age and sex composition of the personal networks of individuals in the United States.

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

Directory of Open Access Journals (Sweden)

H.H. Soliman

2012-11-01

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

Analytical reasoning task reveals limits of social learning in networks.

Science.gov (United States)

Rahwan, Iyad; Krasnoshtan, Dmytro; Shariff, Azim; Bonnefon, Jean-François

2014-04-06

Social learning-by observing and copying others-is a highly successful cultural mechanism for adaptation, outperforming individual information acquisition and experience. Here, we investigate social learning in the context of the uniquely human capacity for reflective, analytical reasoning. A hallmark of the human mind is its ability to engage analytical reasoning, and suppress false associative intuitions. Through a set of laboratory-based network experiments, we find that social learning fails to propagate this cognitive strategy. When people make false intuitive conclusions and are exposed to the analytic output of their peers, they recognize and adopt this correct output. But they fail to engage analytical reasoning in similar subsequent tasks. Thus, humans exhibit an 'unreflective copying bias', which limits their social learning to the output, rather than the process, of their peers' reasoning-even when doing so requires minimal effort and no technical skill. In contrast to much recent work on observation-based social learning, which emphasizes the propagation of successful behaviour through copying, our findings identify a limit on the power of social networks in situations that require analytical reasoning.

Cross-domain and multi-task transfer learning of deep convolutional neural network for breast cancer diagnosis in digital breast tomosynthesis

Science.gov (United States)

Samala, Ravi K.; Chan, Heang-Ping; Hadjiiski, Lubomir; Helvie, Mark A.; Richter, Caleb; Cha, Kenny

2018-02-01

We propose a cross-domain, multi-task transfer learning framework to transfer knowledge learned from non-medical images by a deep convolutional neural network (DCNN) to medical image recognition task while improving the generalization by multi-task learning of auxiliary tasks. A first stage cross-domain transfer learning was initiated from ImageNet trained DCNN to mammography trained DCNN. 19,632 regions-of-interest (ROI) from 2,454 mass lesions were collected from two imaging modalities: digitized-screen film mammography (SFM) and full-field digital mammography (DM), and split into training and test sets. In the multi-task transfer learning, the DCNN learned the mass classification task simultaneously from the training set of SFM and DM. The best transfer network for mammography was selected from three transfer networks with different number of convolutional layers frozen. The performance of single-task and multitask transfer learning on an independent SFM test set in terms of the area under the receiver operating characteristic curve (AUC) was 0.78+/-0.02 and 0.82+/-0.02, respectively. In the second stage cross-domain transfer learning, a set of 12,680 ROIs from 317 mass lesions on DBT were split into validation and independent test sets. We first studied the data requirements for the first stage mammography trained DCNN by varying the mammography training data from 1% to 100% and evaluated its learning on the DBT validation set in inference mode. We found that the entire available mammography set provided the best generalization. The DBT validation set was then used to train only the last four fully connected layers, resulting in an AUC of 0.90+/-0.04 on the independent DBT test set.

A Multi-layer, Hierarchical Information Management System for the Smart Grid

Energy Technology Data Exchange (ETDEWEB)

Lu, Ning; Du, Pengwei; Paulson, Patrick R.; Greitzer, Frank L.; Guo, Xinxin; Hadley, Mark D.

2011-10-10

This paper presents the modeling approach, methodologies, and initial results of setting up a multi-layer, hierarchical information management system (IMS) for the smart grid. The IMS allows its users to analyze the data collected by multiple control and communication networks to characterize the states of the smart grid. Abnormal, corrupted, or erroneous measurement data and outliers are detected and analyzed to identify whether they are caused by random equipment failures, unintentional human errors, or deliberate tempering attempts. Data collected from different information networks are crosschecked for data integrity based on redundancy, dependency, correlation, or cross-correlations, which reveal the interdependency between data sets. A hierarchically structured reasoning mechanism is used to rank possible causes of an event to aid the system operators to proactively respond or provide mitigation recommendations to remove or neutralize the threats. The model provides satisfactory performance on identifying the cause of an event and significantly reduces the need of processing myriads of data collected.

Interoperable Communications for Hierarchical Heterogeneous Wireless Networks

Science.gov (United States)

2016-04-01

International Conference on Advanced Networks and Telecommuncations Systems (ANTS). 14-DEC-13, Kattankulathur, India. : , Husheng Li, Qi Zeng , Lijun Qian. GPS...correlation in space is too large, which implies that the correlation is overestimated. Other methods may be more accurate, faster or less memory ...limited, an intelligent mechanism is needed for the information selection and signaling design of the cross-network communication for collaborative

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.

SETH: A Hierarchical, Agent-based Architecture for Smart Spaces

OpenAIRE

Marsá Maestre, Iván

2008-01-01

The ultimate goal of any smart environment is to release users from the tasks they usually perform to achieve comfort, efficiency, and service personalization. To achieve this goal, we propose to use multiagent systems. In this report we describe the SETH architectur: a hierarchical, agent-based solution intended to be applicable to different smart space scenarios, ranging from small environments, like smart homes or smart offices, to large smart spaces like cities.

Hierarchical Spatial Concept Formation Based on Multimodal Information for Human Support Robots.

Science.gov (United States)

Hagiwara, Yoshinobu; Inoue, Masakazu; Kobayashi, Hiroyoshi; Taniguchi, Tadahiro

2018-01-01

In this paper, we propose a hierarchical spatial concept formation method based on the Bayesian generative model with multimodal information e.g., vision, position and word information. Since humans have the ability to select an appropriate level of abstraction according to the situation and describe their position linguistically, e.g., "I am in my home" and "I am in front of the table," a hierarchical structure of spatial concepts is necessary in order for human support robots to communicate smoothly with users. The proposed method enables a robot to form hierarchical spatial concepts by categorizing multimodal information using hierarchical multimodal latent Dirichlet allocation (hMLDA). Object recognition results using convolutional neural network (CNN), hierarchical k-means clustering result of self-position estimated by Monte Carlo localization (MCL), and a set of location names are used, respectively, as features in vision, position, and word information. Experiments in forming hierarchical spatial concepts and evaluating how the proposed method can predict unobserved location names and position categories are performed using a robot in the real world. Results verify that, relative to comparable baseline methods, the proposed method enables a robot to predict location names and position categories closer to predictions made by humans. As an application example of the proposed method in a home environment, a demonstration in which a human support robot moves to an instructed place based on human speech instructions is achieved based on the formed hierarchical spatial concept.

Hierarchical Spatial Concept Formation Based on Multimodal Information for Human Support Robots

Directory of Open Access Journals (Sweden)

Yoshinobu Hagiwara

2018-03-01

Full Text Available In this paper, we propose a hierarchical spatial concept formation method based on the Bayesian generative model with multimodal information e.g., vision, position and word information. Since humans have the ability to select an appropriate level of abstraction according to the situation and describe their position linguistically, e.g., “I am in my home” and “I am in front of the table,” a hierarchical structure of spatial concepts is necessary in order for human support robots to communicate smoothly with users. The proposed method enables a robot to form hierarchical spatial concepts by categorizing multimodal information using hierarchical multimodal latent Dirichlet allocation (hMLDA. Object recognition results using convolutional neural network (CNN, hierarchical k-means clustering result of self-position estimated by Monte Carlo localization (MCL, and a set of location names are used, respectively, as features in vision, position, and word information. Experiments in forming hierarchical spatial concepts and evaluating how the proposed method can predict unobserved location names and position categories are performed using a robot in the real world. Results verify that, relative to comparable baseline methods, the proposed method enables a robot to predict location names and position categories closer to predictions made by humans. As an application example of the proposed method in a home environment, a demonstration in which a human support robot moves to an instructed place based on human speech instructions is achieved based on the formed hierarchical spatial concept.

Risk Assessment for Mobile Systems Through a Multilayered Hierarchical Bayesian Network.

Science.gov (United States)

Li, Shancang; Tryfonas, Theo; Russell, Gordon; Andriotis, Panagiotis

2016-08-01

Mobile systems are facing a number of application vulnerabilities that can be combined together and utilized to penetrate systems with devastating impact. When assessing the overall security of a mobile system, it is important to assess the security risks posed by each mobile applications (apps), thus gaining a stronger understanding of any vulnerabilities present. This paper aims at developing a three-layer framework that assesses the potential risks which apps introduce within the Android mobile systems. A Bayesian risk graphical model is proposed to evaluate risk propagation in a layered risk architecture. By integrating static analysis, dynamic analysis, and behavior analysis in a hierarchical framework, the risks and their propagation through each layer are well modeled by the Bayesian risk graph, which can quantitatively analyze risks faced to both apps and mobile systems. The proposed hierarchical Bayesian risk graph model offers a novel way to investigate the security risks in mobile environment and enables users and administrators to evaluate the potential risks. This strategy allows to strengthen both app security as well as the security of the entire system.

Hierarchical organisation of causal graphs

International Nuclear Information System (INIS)

Dziopa, P.

1993-01-01

This paper deals with the design of a supervision system using a hierarchy of models formed by graphs, in which the variables are the nodes and the causal relations between the variables of the arcs. To obtain a representation of the variables evolutions which contains only the relevant features of their real evolutions, the causal relations are completed with qualitative transfer functions (QTFs) which produce roughly the behaviour of the classical transfer functions. Major improvements have been made in the building of the hierarchical organization. First, the basic variables of the uppermost level and the causal relations between them are chosen. The next graph is built by adding intermediary variables to the upper graph. When the undermost graph has been built, the transfer functions parameters corresponding to its causal relations are identified. The second task consists in the upwelling of the information from the undermost graph to the uppermost one. A fusion procedure of the causal relations has been designed to compute the QFTs relevant for each level. This procedure aims to reduce the number of parameters needed to represent an evolution at a high level of abstraction. These techniques have been applied to the hierarchical modelling of nuclear process. (authors). 8 refs., 12 figs

The effects of CPAP treatment on task positive and default mode networks in obstructive sleep apnea patients: an fMRI study.

Directory of Open Access Journals (Sweden)

Olga Prilipko

Full Text Available INTRODUCTION: Functional magnetic resonance imaging studies enable the investigation of neural correlates underlying behavioral performance. We investigate the effect of active and sham Continuous Positive Airway Pressure (CPAP treatment on working memory function of patients with Obstructive Sleep Apnea Syndrome (OSAS considering Task Positive and Default Mode networks (TPN and DMN. METHODS: An experiment with 4 levels of visuospatial n-back task was used to investigate the pattern of cortical activation in 17 men with moderate or severe OSAS before and after 2 months of therapeutic (active or sub-therapeutic (sham CPAP treatment. RESULTS: Patients with untreated OSAS had significantly less deactivation in the temporal regions of the DMN as compared to healthy controls, but activation within TPN regions was comparatively relatively preserved. After 2 months of treatment, active and sham CPAP groups exhibited opposite trends of cerebral activation and deactivation. After treatment, the active CPAP group demonstrated an increase of cerebral activation in the TPN at all task levels and of task-related cerebral deactivation in the anterior midline and medial temporal regions of the DMN at the 3-back level, associated with a significant improvement of behavioral performance, whereas the sham CPAP group exhibited less deactivation in the temporal regions of Default Mode Network and less Task Positive Network activation associated to longer response times at the 3-back. CONCLUSION: OSAS has a significant negative impact primarily on task-related DMN deactivation, particularly in the medial temporal regions, possibly due to nocturnal hypoxemia, as well as TPN activation, particularly in the right ventral fronto-parietal network. After 2 months of active nasal CPAP treatment a positive response was noted in both TPN and DMN but without compete recovery of existing behavioral and neuronal deficits. Initiation of CPAP treatment early in the course of the

Task Decomposition Module For Telerobot Trajectory Generation

Science.gov (United States)

Wavering, Albert J.; Lumia, Ron

1988-10-01

A major consideration in the design of trajectory generation software for a Flight Telerobotic Servicer (FTS) is that the FTS will be called upon to perform tasks which require a diverse range of manipulator behaviors and capabilities. In a hierarchical control system where tasks are decomposed into simpler and simpler subtasks, the task decomposition module which performs trajectory planning and execution should therefore be able to accommodate a wide range of algorithms. In some cases, it will be desirable to plan a trajectory for an entire motion before manipulator motion commences, as when optimizing over the entire trajectory. Many FTS motions, however, will be highly sensory-interactive, such as moving to attain a desired position relative to a non-stationary object whose position is periodically updated by a vision system. In this case, the time-varying nature of the trajectory may be handled either by frequent replanning using updated sensor information, or by using an algorithm which creates a less specific state-dependent plan that determines the manipulator path as the trajectory is executed (rather than a priori). This paper discusses a number of trajectory generation techniques from these categories and how they may be implemented in a task decompo-sition module of a hierarchical control system. The structure, function, and interfaces of the proposed trajectory gener-ation module are briefly described, followed by several examples of how different algorithms may be performed by the module. The proposed task decomposition module provides a logical structure for trajectory planning and execution, and supports a large number of published trajectory generation techniques.

Altered Distant Synchronization of Background Network in Mild Cognitive Impairment during an Executive Function Task

Directory of Open Access Journals (Sweden)

Pengyun Wang

2017-09-01

Full Text Available Few studies to date have investigated the background network in the cognitive state relying on executive function in mild cognitive impairment (MCI patients. Using the index of degree of centrality (DC, we explored distant synchronization of background network in MCI during a hybrid delayed-match-to-sample task (DMST, which mainly relies on the working memory component of executive function. We observed significant interactions between group and cognitive state in the bilateral posterior cingulate cortex (PCC and the ventral subregion of precuneus. For normal control (NC group, the long distance functional connectivity (FC of the PCC/precuneus with the other regions of the brain was higher in rest state than that working memory state. For MCI patients, however, this pattern altered. There was no significant difference between rest and working memory state. The similar pattern was observed in the other cluster located in the right angular gyrus. To examine whether abnormal DC in PCC/precuneus and angular gyrus partially resulted from the deficit of FC between these regions and the other parts in the whole brain, we conducted a seed-based correlation analysis with these regions as seeds. The results indicated that the FC between bilateral PCC/precuneus and the right inferior parietal lobule (IPL increased from rest to working memory state for NC participants. For MCI patients, however, there was no significant change between rest and working memory state. The similar pattern was observed for the FC between right angular gyrus and right anterior insula. However, there was no difference between MCI and NC groups in global efficiency and modularity. It may indicate a lack of efficient reorganization from rest state to a working memory state in the brain network of MCI patients. The present study demonstrates the altered distant synchronization of background network in MCI during a task relying on executive function. The results provide a new

Cities and regions in Britain through hierarchical percolation

Science.gov (United States)

Arcaute, Elsa; Molinero, Carlos; Hatna, Erez; Murcio, Roberto; Vargas-Ruiz, Camilo; Masucci, A. Paolo; Batty, Michael

2016-04-01

Urban systems present hierarchical structures at many different scales. These are observed as administrative regional delimitations which are the outcome of complex geographical, political and historical processes which leave almost indelible footprints on infrastructure such as the street network. In this work, we uncover a set of hierarchies in Britain at different scales using percolation theory on the street network and on its intersections which are the primary points of interaction and urban agglomeration. At the larger scales, the observed hierarchical structures can be interpreted as regional fractures of Britain, observed in various forms, from natural boundaries, such as National Parks, to regional divisions based on social class and wealth such as the well-known North-South divide. At smaller scales, cities are generated through recursive percolations on each of the emerging regional clusters. We examine the evolution of the morphology of the system as a whole, by measuring the fractal dimension of the clusters at each distance threshold in the percolation. We observe that this reaches a maximum plateau at a specific distance. The clusters defined at this distance threshold are in excellent correspondence with the boundaries of cities recovered from satellite images, and from previous methods using population density.

Competitive cluster growth in complex networks.

Science.gov (United States)

Moreira, André A; Paula, Demétrius R; Costa Filho, Raimundo N; Andrade, José S

2006-06-01

In this work we propose an idealized model for competitive cluster growth in complex networks. Each cluster can be thought of as a fraction of a community that shares some common opinion. Our results show that the cluster size distribution depends on the particular choice for the topology of the network of contacts among the agents. As an application, we show that the cluster size distributions obtained when the growth process is performed on hierarchical networks, e.g., the Apollonian network, have a scaling form similar to what has been observed for the distribution of a number of votes in an electoral process. We suggest that this similarity may be due to the fact that social networks involved in the electoral process may also possess an underlining hierarchical structure.

Managing Interorganizational Networks

DEFF Research Database (Denmark)

Gustafsson, Jeppe

bold enough to predict that networks will become the dominant organisation form in future. Several authors maintain that the shift from traditional hierarchical structures to networks involves dramatic changes for managers and employees (Champy 2002, Rohlin 1994, Kanter 2002). This article seeks...... organisation theories and theories about strategic management....

Hierarchical Compliance Control of a Soft Ankle Rehabilitation Robot Actuated by Pneumatic Muscles

Directory of Open Access Journals (Sweden)

Quan Liu

2017-12-01

Full Text Available Traditional compliance control of a rehabilitation robot is implemented in task space by using impedance or admittance control algorithms. The soft robot actuated by pneumatic muscle actuators (PMAs is becoming prominent for patients as it enables the compliance being adjusted in each active link, which, however, has not been reported in the literature. This paper proposes a new compliance control method of a soft ankle rehabilitation robot that is driven by four PMAs configured in parallel to enable three degrees of freedom movement of the ankle joint. A new hierarchical compliance control structure, including a low-level compliance adjustment controller in joint space and a high-level admittance controller in task space, is designed. An adaptive compliance control paradigm is further developed by taking into account patient’s active contribution and movement ability during a previous period of time, in order to provide robot assistance only when it is necessarily required. Experiments on healthy and impaired human subjects were conducted to verify the adaptive hierarchical compliance control scheme. The results show that the robot hierarchical compliance can be online adjusted according to the participant’s assessment. The robot reduces its assistance output when participants contribute more and vice versa, thus providing a potentially feasible solution to the patient-in-loop cooperative training strategy.

Software Defined Networking to support IP address mobility in future LTE network

NARCIS (Netherlands)

Karimzadeh Motallebi Azar, Morteza; Valtulina, Luca; van den Berg, Hans Leo; Pras, Aiko; Liebsch, Marco; Taleb, Tarik

2017-01-01

The existing LTE network architecture dose not scale well to increasing demands due to its highly centralized and hierarchical composition. In this paper we discuss the major modifications required in the current LTE network to realize a decentralized LTE architecture. Next, we develop two IP

Hierarchical Data Replication and Service Monitoring Methods in a Scientific Data Grid

Directory of Open Access Journals (Sweden)

Weizhong Lu

2009-04-01

Full Text Available In a grid and distributed computing environment, data replication is an effective way to improve data accessibility and data accessing efficiency. It is also significant in developing a real-time service monitoring system for a Chinese Scientific Data Grid to guarantee the system stability and data availability. Hierarchical data replication and service monitoring methods are proposed in this paper. The hierarchical data replication method divides the network into different domains and replicates data in local domains. The nodes in a local domain are classified into hierarchies to improve data accessibility according to bandwidth and storage memory space. An extensible agent-based prototype of a hierarchical service monitoring system is presented. The status information of services in the Chinese Scientific Data Grid is collected from the grid nodes based on agent technology and then is transformed into real-time operational pictures for management needs. This paper presents frameworks of the hierarchical data replication and service monitoring methods and gives detailed resolutions. Simulation analyses have demonstrated improved data accessing efficiency and verified the effectiveness of the methods at the same time.

Traffic Management for Next Generation Transport Networks

DEFF Research Database (Denmark)

Yu, Hao

required by the next generation transport network to provide Quality-of-Service (QoS) guaranteed video services. Augmenting network capacity and upgrading network nodes indicate long deployment period, replacement of equipment and thus significant cost to the network service providers. This challenge may...... slacken the steps of some network operators towards providing IPTV services. In this dissertation, the topology-based hierarchical scheduling scheme is proposed to tackle the problem addressed. The scheme simplifies the deployment process by placing an intelligent switch with centralized traffic...... management functions at the edge of the network, scheduling traffic on behalf of the other nodes. The topology-based hierarchical scheduling scheme is able to provide outstanding flow isolation due to its centralized scheduling ability, which is essential for providing IPTV services. In order to reduce...

Expert hierarchical selection of oil and gas distribution systems

International Nuclear Information System (INIS)

Frankel, E.G.

1991-01-01

Selection and design of oil and gas distribution systems involves a large number of decision makers and interest groups, as well as many alternative technical, financial, network, operating, management and regulatory options. Their objectives and measures of performance are different. Decision models can be effectively represented by hierarchical structures. A simple deterministic analytic hierarchy process is presented with application to oil and gas distribution systems

Interneuronal Mechanism for Tinbergen’s Hierarchical Model of Behavioral Choice

Science.gov (United States)

Pirger, Zsolt; Crossley, Michael; László, Zita; Naskar, Souvik; Kemenes, György; O’Shea, Michael; Benjamin, Paul R.; Kemenes, Ildikó

2014-01-01

Summary Recent studies of behavioral choice support the notion that the decision to carry out one behavior rather than another depends on the reconfiguration of shared interneuronal networks [1]. We investigated another decision-making strategy, derived from the classical ethological literature [2, 3], which proposes that behavioral choice depends on competition between autonomous networks. According to this model, behavioral choice depends on inhibitory interactions between incompatible hierarchically organized behaviors. We provide evidence for this by investigating the interneuronal mechanisms mediating behavioral choice between two autonomous circuits that underlie whole-body withdrawal [4, 5] and feeding [6] in the pond snail Lymnaea. Whole-body withdrawal is a defensive reflex that is initiated by tactile contact with predators. As predicted by the hierarchical model, tactile stimuli that evoke whole-body withdrawal responses also inhibit ongoing feeding in the presence of feeding stimuli. By recording neurons from the feeding and withdrawal networks, we found no direct synaptic connections between the interneuronal and motoneuronal elements that generate the two behaviors. Instead, we discovered that behavioral choice depends on the interaction between two unique types of interneurons with asymmetrical synaptic connectivity that allows withdrawal to override feeding. One type of interneuron, the Pleuro-Buccal (PlB), is an extrinsic modulatory neuron of the feeding network that completely inhibits feeding when excited by touch-induced monosynaptic input from the second type of interneuron, Pedal-Dorsal12 (PeD12). PeD12 plays a critical role in behavioral choice by providing a synaptic pathway joining the two behavioral networks that underlies the competitive dominance of whole-body withdrawal over feeding. PMID:25155505

Detecting Hidden Hierarchy of Non Hierarchical Terrorist Networks

DEFF Research Database (Denmark)

Memon, Nasrullah

measures (and combinations of them) to identify key players (important nodes) in terrorist networks. Our recently introduced techniques and algorithms (which are also implemented in the investigative data mining toolkit known as iMiner) will be particularly useful for law enforcement agencies that need...... to analyze terrorist networks and prioritize their targets. Applying recently introduced mathematical methods for constructing the hidden hierarchy of "nonhierarchical" terrorist networks; we present case studies of the terrorist attacks occurred / planned in the past, in order to identify hidden hierarchy...

Multiple dynamical time-scales in networks with hierarchically ...

Indian Academy of Sciences (India)

cists from resistor networks to polymer contact structure to spin interactions in disordered ... the intracellular signalling system to neuronal networks to ecological food ... tion of the key players can be used to develop drugs targeted specifically ...

An Improved 6LoWPAN Hierarchical Routing Protocol

Directory of Open Access Journals (Sweden)

Xue Li

2015-10-01

Full Text Available IETF 6LoWPAN working group is engaged in the IPv6 protocol stack research work based on IEEE802.15.4 standard. In this working group, the routing protocol is one of the important research contents. In the 6LoWPAN, HiLow is a well-known layered routing protocol. This paper puts forward an improved hierarchical routing protocol GHiLow by improving HiLow parent node selection and path restoration strategy. GHiLow improves the parent node selection by increasing the choice of parameters. Simutaneously, it also improves path recovery by analysing different situations to recovery path. Therefore, GHiLow contributes to the ehancement of network performance and the decrease of network energy consumption.

Dysfunctional default mode network and executive control network in people with Internet gaming disorder: Independent component analysis under a probability discounting task.

Science.gov (United States)

Wang, L; Wu, L; Lin, X; Zhang, Y; Zhou, H; Du, X; Dong, G

2016-04-01

The present study identified the neural mechanism of risky decision-making in Internet gaming disorder (IGD) under a probability discounting task. Independent component analysis was used on the functional magnetic resonance imaging data from 19 IGD subjects (22.2 ± 3.08 years) and 21 healthy controls (HC, 22.8 ± 3.5 years). For the behavioral results, IGD subjects prefer the risky to the fixed options and showed shorter reaction time compared to HC. For the imaging results, the IGD subjects showed higher task-related activity in default mode network (DMN) and less engagement in the executive control network (ECN) than HC when making the risky decisions. Also, we found the activities of DMN correlate negatively with the reaction time and the ECN correlate positively with the probability discounting rates. The results suggest that people with IGD show altered modulation in DMN and deficit in executive control function, which might be the reason for why the IGD subjects continue to play online games despite the potential negative consequences. Copyright © 2016 Elsevier Masson SAS. All rights reserved.

Task-dependent activity and connectivity predict episodic memory network-based responses to brain stimulation in healthy aging.

Science.gov (United States)

Vidal-Piñeiro, Dídac; Martin-Trias, Pablo; Arenaza-Urquijo, Eider M; Sala-Llonch, Roser; Clemente, Imma C; Mena-Sánchez, Isaias; Bargalló, Núria; Falcón, Carles; Pascual-Leone, Álvaro; Bartrés-Faz, David

2014-01-01

Transcranial magnetic stimulation (TMS) can affect episodic memory, one of the main cognitive hallmarks of aging, but the mechanisms of action remain unclear. To evaluate the behavioral and functional impact of excitatory TMS in a group of healthy elders. We applied a paradigm of repetitive TMS - intermittent theta-burst stimulation - over left inferior frontal gyrus in healthy elders (n = 24) and evaluated its impact on the performance of an episodic memory task with two levels of processing and the associated brain activity as captured by a pre and post fMRI scans. In the post-TMS fMRI we found TMS-related activity increases in left prefrontal and cerebellum-occipital areas specifically during deep encoding but not during shallow encoding or at rest. Furthermore, we found a task-dependent change in connectivity during the encoding task between cerebellum-occipital areas and the TMS-targeted left inferior frontal region. This connectivity change correlated with the TMS effects over brain networks. The results suggest that the aged brain responds to brain stimulation in a state-dependent manner as engaged by different tasks components and that TMS effect is related to inter-individual connectivity changes measures. These findings reveal fundamental insights into brain network dynamics in aging and the capacity to probe them with combined behavioral and stimulation approaches. Copyright © 2014 Elsevier Inc. All rights reserved.

Enhancement of the Monet/Atonet Washington DC Network

National Research Council Canada - National Science Library

Jackel, Janet

2003-01-01

... Internet research networks. The report also describes research in the use of hierarchical multiplexing approaches for more efficient use of multi-wavelength networks and enhancements to the MONET Network Control & Management System...

Virtual optical network provisioning with unified service logic processing model for software-defined multidomain optical networks

Science.gov (United States)

Zhao, Yongli; Li, Shikun; Song, Yinan; Sun, Ji; Zhang, Jie

2015-12-01

Hierarchical control architecture is designed for software-defined multidomain optical networks (SD-MDONs), and a unified service logic processing model (USLPM) is first proposed for various applications. USLPM-based virtual optical network (VON) provisioning process is designed, and two VON mapping algorithms are proposed: random node selection and per controller computation (RNS&PCC) and balanced node selection and hierarchical controller computation (BNS&HCC). Then an SD-MDON testbed is built with OpenFlow extension in order to support optical transport equipment. Finally, VON provisioning service is experimentally demonstrated on the testbed along with performance verification.

Functional mapping of language networks in the normal brain using a word-association task

International Nuclear Information System (INIS)

Ghosh, Shantanu; Basu, Amrita; Kumaran, Senthil S; Khushu, Subash

2010-01-01

Language functions are known to be affected in diverse neurological conditions, including ischemic stroke, traumatic brain injury, and brain tumors. Because language networks are extensive, interpretation of functional data depends on the task completed during evaluation. The aim was to map the hemodynamic consequences of word association using functional magnetic resonance imaging (fMRI) in normal human subjects. Ten healthy subjects underwent fMRI scanning with a postlexical access semantic association task vs lexical processing task. The fMRI protocol involved a T2*-weighted gradient-echo echo-planar imaging (GE-EPI) sequence (TR 4523 ms, TE 64 ms, flip angle 90°) with alternate baseline and activation blocks. A total of 78 scans were taken (interscan interval = 3 s) with a total imaging time of 587 s. Functional data were processed in Statistical Parametric Mapping software (SPM2) with 8-mm Gaussian kernel by convolving the blood oxygenation level-dependent (BOLD) signal with an hemodynamic response function estimated by general linear method to generate SPM{t} and SPM{F} maps. Single subject analysis of the functional data (FWE-corrected, P≤0.001) revealed extensive activation in the frontal lobes, with overlaps among middle frontal gyrus (MFG), superior, and inferior frontal gyri. BOLD activity was also found in the medial frontal gyrus, middle occipital gyrus (MOG), anterior fusiform gyrus, superior and inferior parietal lobules, and to a smaller extent, the thalamus and right anterior cerebellum. Group analysis (FWE-corrected, P≤0.001) revealed neural recruitment of bilateral lingual gyri, left MFG, bilateral MOG, left superior occipital gyrus, left fusiform gyrus, bilateral thalami, and right cerebellar areas. Group data analysis revealed a cerebellar–occipital–fusiform–thalamic network centered around bilateral lingual gyri for word association, thereby indicating how these areas facilitate language comprehension by activating a semantic

Functional mapping of language networks in the normal brain using a word-association task

Directory of Open Access Journals (Sweden)

Ghosh Shantanu

2010-01-01

Full Text Available Background: Language functions are known to be affected in diverse neurological conditions, including ischemic stroke, traumatic brain injury, and brain tumors. Because language networks are extensive, interpretation of functional data depends on the task completed during evaluation. Aim: The aim was to map the hemodynamic consequences of word association using functional magnetic resonance imaging (fMRI in normal human subjects. Materials and Methods: Ten healthy subjects underwent fMRI scanning with a postlexical access semantic association task vs lexical processing task. The fMRI protocol involved a T2FNx01-weighted gradient-echo echo-planar imaging (GE-EPI sequence (TR 4523 ms, TE 64 ms, flip angle 90º with alternate baseline and activation blocks. A total of 78 scans were taken (interscan interval = 3 s with a total imaging time of 587 s. Functional data were processed in Statistical Parametric Mapping software (SPM2 with 8-mm Gaussian kernel by convolving the blood oxygenation level-dependent (BOLD signal with an hemodynamic response function estimated by general linear method to generate SPM{t} and SPM{F} maps. Results: Single subject analysis of the functional data (FWE-corrected, P≤0.001 revealed extensive activation in the frontal lobes, with overlaps among middle frontal gyrus (MFG, superior, and inferior frontal gyri. BOLD activity was also found in the medial frontal gyrus, middle occipital gyrus (MOG, anterior fusiform gyrus, superior and inferior parietal lobules, and to a smaller extent, the thalamus and right anterior cerebellum. Group analysis (FWE-corrected, P≤0.001 revealed neural recruitment of bilateral lingual gyri, left MFG, bilateral MOG, left superior occipital gyrus, left fusiform gyrus, bilateral thalami, and right cerebellar areas. Conclusions: Group data analysis revealed a cerebellar-occipital-fusiform-thalamic network centered around bilateral lingual gyri for word association, thereby indicating how these

Internet protocol network mapper

Science.gov (United States)

Youd, David W.; Colon III, Domingo R.; Seidl, Edward T.

2016-02-23

A network mapper for performing tasks on targets is provided. The mapper generates a map of a network that specifies the overall configuration of the network. The mapper inputs a procedure that defines how the network is to be mapped. The procedure specifies what, when, and in what order the tasks are to be performed. Each task specifies processing that is to be performed for a target to produce results. The procedure may also specify input parameters for a task. The mapper inputs initial targets that specify a range of network addresses to be mapped. The mapper maps the network by, for each target, executing the procedure to perform the tasks on the target. The results of the tasks represent the mapping of the network defined by the initial targets.

Presurgical brain mapping of the language network in patients with brain tumors using resting-state fMRI: Comparison with task fMRI.

Science.gov (United States)

Sair, Haris I; Yahyavi-Firouz-Abadi, Noushin; Calhoun, Vince D; Airan, Raag D; Agarwal, Shruti; Intrapiromkul, Jarunee; Choe, Ann S; Gujar, Sachin K; Caffo, Brian; Lindquist, Martin A; Pillai, Jay J

2016-03-01

To compare language networks derived from resting-state fMRI (rs-fMRI) with task-fMRI in patients with brain tumors and investigate variables that affect rs-fMRI vs task-fMRI concordance. Independent component analysis (ICA) of rs-fMRI was performed with 20, 30, 40, and 50 target components (ICA20 to ICA50) and language networks identified for patients presenting for presurgical fMRI mapping between 1/1/2009 and 7/1/2015. 49 patients were analyzed fulfilling criteria for presence of brain tumors, no prior brain surgery, and adequate task-fMRI performance. Rs-vs-task-fMRI concordance was measured using Dice coefficients across varying fMRI thresholds before and after noise removal. Multi-thresholded Dice coefficient volume under the surface (DiceVUS) and maximum Dice coefficient (MaxDice) were calculated. One-way Analysis of Variance (ANOVA) was performed to determine significance of DiceVUS and MaxDice between the four ICA order groups. Age, Sex, Handedness, Tumor Side, Tumor Size, WHO Grade, number of scrubbed volumes, image intensity root mean square (iRMS), and mean framewise displacement (FD) were used as predictors for VUS in a linear regression. Artificial elevation of rs-fMRI vs task-fMRI concordance is seen at low thresholds due to noise. Noise-removed group-mean DiceVUS and MaxDice improved as ICA order increased, however ANOVA demonstrated no statistically significant difference between the four groups. Linear regression demonstrated an association between iRMS and DiceVUS for ICA30-50, and iRMS and MaxDice for ICA50. Overall there is moderate group level rs-vs-task fMRI language network concordance, however substantial subject-level variability exists; iRMS may be used to determine reliability of rs-fMRI derived language networks. © 2015 Wiley Periodicals, Inc.

Privacy-Preserving Task Assignment in Spatial Crowdsourcing

KAUST Repository

Liu, An; Li, Zhi-Xu; Liu, Guan-Feng; Zheng, Kai; Zhang, Min; Li, Qing; Zhang, Xiangliang

2017-01-01

untrusted SC systems. In this paper, we study the problem of assigning workers to tasks in a way that location privacy for both workers and task requesters is preserved. We first combine the Paillier cryptosystem with Yao’s garbled circuits to construct a secure protocol that assigns the nearest worker to a task. Considering that this protocol cannot scale to a large number of workers, we then make use of Geohash, a hierarchical spatial index to design a more efficient protocol that can securely find approximate nearest workers. We theoretically show that these two protocols are secure against semi-honest adversaries. Through extensive experiments on two real-world datasets, we demonstrate the efficiency and effectiveness of our protocols.

Drive reinforcement neural networks for reactor control. Final report

International Nuclear Information System (INIS)

Williams, J.G.; Jouse, W.C.

1995-01-01

In view of the loss of the third year funding, the scope of the project goals has been revised. The revision in project scope no longer allows for the detailed modeling of the EBR-11 start-up task that was originally envisaged. The authors are continuing, however, to model the control of the rapid power ascent of the University of Arizona TRIGA reactor using a model-based controller and using a drive reinforcement neural network. These will be combined during the concluding period of the project into a hierarchical control architecture. In addition, the modeling of a PWR feedwater heater has continued, and an autonomous fault-tolerant software architecture for its control has been proposed

SampleCNN: End-to-End Deep Convolutional Neural Networks Using Very Small Filters for Music Classification

Directory of Open Access Journals (Sweden)

Jongpil Lee

2018-01-01

Full Text Available Convolutional Neural Networks (CNN have been applied to diverse machine learning tasks for different modalities of raw data in an end-to-end fashion. In the audio domain, a raw waveform-based approach has been explored to directly learn hierarchical characteristics of audio. However, the majority of previous studies have limited their model capacity by taking a frame-level structure similar to short-time Fourier transforms. We previously proposed a CNN architecture which learns representations using sample-level filters beyond typical frame-level input representations. The architecture showed comparable performance to the spectrogram-based CNN model in music auto-tagging. In this paper, we extend the previous work in three ways. First, considering the sample-level model requires much longer training time, we progressively downsample the input signals and examine how it affects the performance. Second, we extend the model using multi-level and multi-scale feature aggregation technique and subsequently conduct transfer learning for several music classification tasks. Finally, we visualize filters learned by the sample-level CNN in each layer to identify hierarchically learned features and show that they are sensitive to log-scaled frequency.

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

KAUST Repository

Yang, Yuli

2014-10-01

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

Autonomous management of a recursive area hierarchy for large scale wireless sensor networks using multiple parents

Energy Technology Data Exchange (ETDEWEB)

Cree, Johnathan Vee [Washington State Univ., Pullman, WA (United States); Delgado-Frias, Jose [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

2016-03-01

Large scale wireless sensor networks have been proposed for applications ranging from anomaly detection in an environment to vehicle tracking. Many of these applications require the networks to be distributed across a large geographic area while supporting three to five year network lifetimes. In order to support these requirements large scale wireless sensor networks of duty-cycled devices need a method of efficient and effective autonomous configuration/maintenance. This method should gracefully handle the synchronization tasks duty-cycled networks. Further, an effective configuration solution needs to recognize that in-network data aggregation and analysis presents significant benefits to wireless sensor network and should configure the network in a way such that said higher level functions benefit from the logically imposed structure. NOA, the proposed configuration and maintenance protocol, provides a multi-parent hierarchical logical structure for the network that reduces the synchronization workload. It also provides higher level functions with significant inherent benefits such as but not limited to: removing network divisions that are created by single-parent hierarchies, guarantees for when data will be compared in the hierarchy, and redundancies for communication as well as in-network data aggregation/analysis/storage.

A hierarchical approach to reducing communication in parallel graph algorithms

KAUST Repository

Harshvardhan,

2015-01-01

Large-scale graph computing has become critical due to the ever-increasing size of data. However, distributed graph computations are limited in their scalability and performance due to the heavy communication inherent in such computations. This is exacerbated in scale-free networks, such as social and web graphs, which contain hub vertices that have large degrees and therefore send a large number of messages over the network. Furthermore, many graph algorithms and computations send the same data to each of the neighbors of a vertex. Our proposed approach recognizes this, and reduces communication performed by the algorithm without change to user-code, through a hierarchical machine model imposed upon the input graph. The hierarchical model takes advantage of locale information of the neighboring vertices to reduce communication, both in message volume and total number of bytes sent. It is also able to better exploit the machine hierarchy to further reduce the communication costs, by aggregating traffic between different levels of the machine hierarchy. Results of an implementation in the STAPL GL shows improved scalability and performance over the traditional level-synchronous approach, with 2.5 × - 8× improvement for a variety of graph algorithms at 12, 000+ cores.

The hierarchical nature of the spin alignment of dark matter haloes in filaments

Science.gov (United States)

Aragon-Calvo, M. A.; Yang, Lin Forrest

2014-05-01

Dark matter haloes in cosmological filaments and walls have (in average) their spin vector aligned with their host structure. While haloes in walls are aligned with the plane of the wall independently of their mass, haloes in filaments present a mass-dependent two-regime orientation. Here, we show that the transition mass determining the change in the alignment regime (from parallel to perpendicular) depends on the hierarchical level in which the halo is located, reflecting the hierarchical nature of the Cosmic Web. By explicitly exposing the hierarchical structure of the Cosmic Web, we are able to identify the contributions of different components of the filament network to the alignment signal. We propose a unifying picture of angular momentum acquisition that is based on the results presented here and previous results found by other authors. In order to do a hierarchical characterization of the Cosmic Web, we introduce a new implementation of the multiscale morphology filter, the MMF-2, that significantly improves the identification of structures and explicitly describes their hierarchy. L36

Hierarchy Measure for Complex Networks

Science.gov (United States)

Mones, Enys; Vicsek, Lilla; Vicsek, Tamás

2012-01-01

Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure. PMID:22470477

Task-dependent changes in cross-level coupling between single neurons and oscillatory activity in multiscale networks.

Directory of Open Access Journals (Sweden)

Ryan T Canolty

Full Text Available Understanding the principles governing the dynamic coordination of functional brain networks remains an important unmet goal within neuroscience. How do distributed ensembles of neurons transiently coordinate their activity across a variety of spatial and temporal scales? While a complete mechanistic account of this process remains elusive, evidence suggests that neuronal oscillations may play a key role in this process, with different rhythms influencing both local computation and long-range communication. To investigate this question, we recorded multiple single unit and local field potential (LFP activity from microelectrode arrays implanted bilaterally in macaque motor areas. Monkeys performed a delayed center-out reach task either manually using their natural arm (Manual Control, MC or under direct neural control through a brain-machine interface (Brain Control, BC. In accord with prior work, we found that the spiking activity of individual neurons is coupled to multiple aspects of the ongoing motor beta rhythm (10-45 Hz during both MC and BC, with neurons exhibiting a diversity of coupling preferences. However, here we show that for identified single neurons, this beta-to-rate mapping can change in a reversible and task-dependent way. For example, as beta power increases, a given neuron may increase spiking during MC but decrease spiking during BC, or exhibit a reversible shift in the preferred phase of firing. The within-task stability of coupling, combined with the reversible cross-task changes in coupling, suggest that task-dependent changes in the beta-to-rate mapping play a role in the transient functional reorganization of neural ensembles. We characterize the range of task-dependent changes in the mapping from beta amplitude, phase, and inter-hemispheric phase differences to the spike rates of an ensemble of simultaneously-recorded neurons, and discuss the potential implications that dynamic remapping from oscillatory activity to

The role of supramolecular chemistry in stimuli responsive and hierarchically structured functional organic materials

NARCIS (Netherlands)

Schenning, A.P.H.J.; Bastiaansen, C.W.M.; Broer, D.J.; Debije, M.G.

2014-01-01

ABSTRACT: In this review, we show the important role of supramolecular chemistry in the fabrication of stimuli responsive and hierarchically structured liquid crystalline polymer networks. Supramolecular interactions can be used to create three dimensional order or as molecular triggers in materials