Human initiated cascading failures in societal infrastructures.

PubMed

Barrett, Chris; Channakeshava, Karthik; Huang, Fei; Kim, Junwhan; Marathe, Achla; Marathe, Madhav V; Pei, Guanhong; Saha, Sudip; Subbiah, Balaaji S P; Vullikanti, Anil Kumar S

2012-01-01

In this paper, we conduct a systematic study of human-initiated cascading failures in three critical inter-dependent societal infrastructures due to behavioral adaptations in response to a crisis. We focus on three closely coupled socio-technical networks here: (i) cellular and mesh networks, (ii) transportation networks and (iii) mobile call networks. In crises, changes in individual behaviors lead to altered travel, activity and calling patterns, which influence the transport network and the loads on wireless networks. The interaction between these systems and their co-evolution poses significant technical challenges for representing and reasoning about these systems. In contrast to system dynamics models for studying these interacting infrastructures, we develop interaction-based models in which individuals and infrastructure elements are represented in detail and are placed in a common geographic coordinate system. Using the detailed representation, we study the impact of a chemical plume that has been released in a densely populated urban region. Authorities order evacuation of the affected area, and this leads to individual behavioral adaptation wherein individuals drop their scheduled activities and drive to home or pre-specified evacuation shelters as appropriate. They also revise their calling behavior to communicate and coordinate among family members. These two behavioral adaptations cause flash-congestion in the urban transport network and the wireless network. The problem is exacerbated with a few, already occurring, road closures. We analyze how extended periods of unanticipated road congestion can result in failure of infrastructures, starting with the servicing base stations in the congested area. A sensitivity analysis on the compliance rate of evacuees shows non-intuitive effect on the spatial distribution of people and on the loading of the base stations. For example, an evacuation compliance rate of 70% results in higher number of overloaded base stations than the evacuation compliance rate of 90%.

Human Initiated Cascading Failures in Societal Infrastructures

PubMed Central

Barrett, Chris; Channakeshava, Karthik; Huang, Fei; Kim, Junwhan; Marathe, Achla; Marathe, Madhav V.; Pei, Guanhong; Saha, Sudip; Subbiah, Balaaji S. P.; Vullikanti, Anil Kumar S.

2012-01-01

In this paper, we conduct a systematic study of human-initiated cascading failures in three critical inter-dependent societal infrastructures due to behavioral adaptations in response to a crisis. We focus on three closely coupled socio-technical networks here: (i) cellular and mesh networks, (ii) transportation networks and (iii) mobile call networks. In crises, changes in individual behaviors lead to altered travel, activity and calling patterns, which influence the transport network and the loads on wireless networks. The interaction between these systems and their co-evolution poses significant technical challenges for representing and reasoning about these systems. In contrast to system dynamics models for studying these interacting infrastructures, we develop interaction-based models in which individuals and infrastructure elements are represented in detail and are placed in a common geographic coordinate system. Using the detailed representation, we study the impact of a chemical plume that has been released in a densely populated urban region. Authorities order evacuation of the affected area, and this leads to individual behavioral adaptation wherein individuals drop their scheduled activities and drive to home or pre-specified evacuation shelters as appropriate. They also revise their calling behavior to communicate and coordinate among family members. These two behavioral adaptations cause flash-congestion in the urban transport network and the wireless network. The problem is exacerbated with a few, already occurring, road closures. We analyze how extended periods of unanticipated road congestion can result in failure of infrastructures, starting with the servicing base stations in the congested area. A sensitivity analysis on the compliance rate of evacuees shows non-intuitive effect on the spatial distribution of people and on the loading of the base stations. For example, an evacuation compliance rate of 70% results in higher number of overloaded base stations than the evacuation compliance rate of 90%. PMID:23118847

Exploring the evolution of London's street network in the information space: A dual approach

NASA Astrophysics Data System (ADS)

Masucci, A. Paolo; Stanilov, Kiril; Batty, Michael

2014-01-01

We study the growth of London's street network in its dual representation, as the city has evolved over the past 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the planar graph and represents a transportation unit in the so-called information space, i.e., the space where information is handled in order to navigate through the city. First, we discuss a novel hybrid technique to extract dual graphs from planar graphs, called the hierarchical intersection continuity negotiation principle. Then we show that the growth of the network can be analytically described by logistic laws and that the topological properties of the network are governed by robust log-normal distributions characterizing the network's connectivity and small-world properties that are consistent over time. Moreover, we find that the double-Pareto-like distributions for the connectivity emerge for major roads and can be modeled via a stochastic content-based network model using simple space-filling principles.

47 CFR 20.18 - 911 Service.

Code of Federal Regulations, 2014 CFR

2014-10-01

... data from both network-based solutions and handset-based solutions may be blended to measure compliance... shall be applied to the accuracy data from each solution and measured against the network-based accuracy... the 911 operator will not be able to call the user back, and that the user should convey the exact...

Reinforcement learning for resource allocation in LEO satellite networks.

PubMed

Usaha, Wipawee; Barria, Javier A

2007-06-01

In this paper, we develop and assess online decision-making algorithms for call admission and routing for low Earth orbit (LEO) satellite networks. It has been shown in a recent paper that, in a LEO satellite system, a semi-Markov decision process formulation of the call admission and routing problem can achieve better performance in terms of an average revenue function than existing routing methods. However, the conventional dynamic programming (DP) numerical solution becomes prohibited as the problem size increases. In this paper, two solution methods based on reinforcement learning (RL) are proposed in order to circumvent the computational burden of DP. The first method is based on an actor-critic method with temporal-difference (TD) learning. The second method is based on a critic-only method, called optimistic TD learning. The algorithms enhance performance in terms of requirements in storage, computational complexity and computational time, and in terms of an overall long-term average revenue function that penalizes blocked calls. Numerical studies are carried out, and the results obtained show that the RL framework can achieve up to 56% higher average revenue over existing routing methods used in LEO satellite networks with reasonable storage and computational requirements.

77 FR 60680 - Development of the Nationwide Interoperable Public Safety Broadband Network

Federal Register 2010, 2011, 2012, 2013, 2014

2012-10-04

... public comment on the conceptual network architecture presentation made at the FirstNet Board of... business plan considerations. NTIA also seeks comment on the general concept of how to develop applications... network based on a single, nationwide network architecture called for under the Middle Class Tax Relief...

Dynamic Multiple-Threshold Call Admission Control Based on Optimized Genetic Algorithm in Wireless/Mobile Networks

NASA Astrophysics Data System (ADS)

Wang, Shengling; Cui, Yong; Koodli, Rajeev; Hou, Yibin; Huang, Zhangqin

Due to the dynamics of topology and resources, Call Admission Control (CAC) plays a significant role for increasing resource utilization ratio and guaranteeing users' QoS requirements in wireless/mobile networks. In this paper, a dynamic multi-threshold CAC scheme is proposed to serve multi-class service in a wireless/mobile network. The thresholds are renewed at the beginning of each time interval to react to the changing mobility rate and network load. To find suitable thresholds, a reward-penalty model is designed, which provides different priorities between different service classes and call types through different reward/penalty policies according to network load and average call arrival rate. To speed up the running time of CAC, an Optimized Genetic Algorithm (OGA) is presented, whose components such as encoding, population initialization, fitness function and mutation etc., are all optimized in terms of the traits of the CAC problem. The simulation demonstrates that the proposed CAC scheme outperforms the similar schemes, which means the optimization is realized. Finally, the simulation shows the efficiency of OGA.

A comparative analysis of the statistical properties of large mobile phone calling networks.

PubMed

Li, Ming-Xia; Jiang, Zhi-Qiang; Xie, Wen-Jie; Miccichè, Salvatore; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N

2014-05-30

Mobile phone calling is one of the most widely used communication methods in modern society. The records of calls among mobile phone users provide us a valuable proxy for the understanding of human communication patterns embedded in social networks. Mobile phone users call each other forming a directed calling network. If only reciprocal calls are considered, we obtain an undirected mutual calling network. The preferential communication behavior between two connected users can be statistically tested and it results in two Bonferroni networks with statistically validated edges. We perform a comparative analysis of the statistical properties of these four networks, which are constructed from the calling records of more than nine million individuals in Shanghai over a period of 110 days. We find that these networks share many common structural properties and also exhibit idiosyncratic features when compared with previously studied large mobile calling networks. The empirical findings provide us an intriguing picture of a representative large social network that might shed new lights on the modelling of large social networks.

Modeling and Analysis of Hybrid Cellular/WLAN Systems with Integrated Service-Based Vertical Handoff Schemes

NASA Astrophysics Data System (ADS)

Xia, Weiwei; Shen, Lianfeng

We propose two vertical handoff schemes for cellular network and wireless local area network (WLAN) integration: integrated service-based handoff (ISH) and integrated service-based handoff with queue capabilities (ISHQ). Compared with existing handoff schemes in integrated cellular/WLAN networks, the proposed schemes consider a more comprehensive set of system characteristics such as different features of voice and data services, dynamic information about the admitted calls, user mobility and vertical handoffs in two directions. The code division multiple access (CDMA) cellular network and IEEE 802.11e WLAN are taken into account in the proposed schemes. We model the integrated networks by using multi-dimensional Markov chains and the major performance measures are derived for voice and data services. The important system parameters such as thresholds to prioritize handoff voice calls and queue sizes are optimized. Numerical results demonstrate that the proposed ISHQ scheme can maximize the utilization of overall bandwidth resources with the best quality of service (QoS) provisioning for voice and data services.

Random and Directed Walk-Based Top-k Queries in Wireless Sensor Networks

PubMed Central

Fu, Jun-Song; Liu, Yun

2015-01-01

In wireless sensor networks, filter-based top-k query approaches are the state-of-the-art solutions and have been extensively researched in the literature, however, they are very sensitive to the network parameters, including the size of the network, dynamics of the sensors’ readings and declines in the overall range of all the readings. In this work, a random walk-based top-k query approach called RWTQ and a directed walk-based top-k query approach called DWTQ are proposed. At the beginning of a top-k query, one or several tokens are sent to the specific node(s) in the network by the base station. Then, each token walks in the network independently to record and process the readings in a random or directed way. A strategy of choosing the “right” way in DWTQ is carefully designed for the token(s) to arrive at the high-value regions as soon as possible. When designing the walking strategy for DWTQ, the spatial correlations of the readings are also considered. Theoretical analysis and simulation results indicate that RWTQ and DWTQ both are very robust against these parameters discussed previously. In addition, DWTQ outperforms TAG, FILA and EXTOK in transmission cost, energy consumption and network lifetime. PMID:26016914

Cloud-Based Virtual Laboratory for Network Security Education

ERIC Educational Resources Information Center

Xu, Le; Huang, Dijiang; Tsai, Wei-Tek

2014-01-01

Hands-on experiments are essential for computer network security education. Existing laboratory solutions usually require significant effort to build, configure, and maintain and often do not support reconfigurability, flexibility, and scalability. This paper presents a cloud-based virtual laboratory education platform called V-Lab that provides a…

High performance network and channel-based storage

NASA Technical Reports Server (NTRS)

Katz, Randy H.

1991-01-01

In the traditional mainframe-centered view of a computer system, storage devices are coupled to the system through complex hardware subsystems called input/output (I/O) channels. With the dramatic shift towards workstation-based computing, and its associated client/server model of computation, storage facilities are now found attached to file servers and distributed throughout the network. We discuss the underlying technology trends that are leading to high performance network-based storage, namely advances in networks, storage devices, and I/O controller and server architectures. We review several commercial systems and research prototypes that are leading to a new approach to high performance computing based on network-attached storage.

Principal Component Analysis Based Measure of Structural Holes

NASA Astrophysics Data System (ADS)

Deng, Shiguo; Zhang, Wenqing; Yang, Huijie

2013-02-01

Based upon principal component analysis, a new measure called compressibility coefficient is proposed to evaluate structural holes in networks. This measure incorporates a new effect from identical patterns in networks. It is found that compressibility coefficient for Watts-Strogatz small-world networks increases monotonically with the rewiring probability and saturates to that for the corresponding shuffled networks. While compressibility coefficient for extended Barabasi-Albert scale-free networks decreases monotonically with the preferential effect and is significantly large compared with that for corresponding shuffled networks. This measure is helpful in diverse research fields to evaluate global efficiency of networks.

Classification of 2-dimensional array patterns: assembling many small neural networks is better than using a large one.

PubMed

Chen, Liang; Xue, Wei; Tokuda, Naoyuki

2010-08-01

In many pattern classification/recognition applications of artificial neural networks, an object to be classified is represented by a fixed sized 2-dimensional array of uniform type, which corresponds to the cells of a 2-dimensional grid of the same size. A general neural network structure, called an undistricted neural network, which takes all the elements in the array as inputs could be used for problems such as these. However, a districted neural network can be used to reduce the training complexity. A districted neural network usually consists of two levels of sub-neural networks. Each of the lower level neural networks, called a regional sub-neural network, takes the elements in a region of the array as its inputs and is expected to output a temporary class label, called an individual opinion, based on the partial information of the entire array. The higher level neural network, called an assembling sub-neural network, uses the outputs (opinions) of regional sub-neural networks as inputs, and by consensus derives the label decision for the object. Each of the sub-neural networks can be trained separately and thus the training is less expensive. The regional sub-neural networks can be trained and performed in parallel and independently, therefore a high speed can be achieved. We prove theoretically in this paper, using a simple model, that a districted neural network is actually more stable than an undistricted neural network in noisy environments. We conjecture that the result is valid for all neural networks. This theory is verified by experiments involving gender classification and human face recognition. We conclude that a districted neural network is highly recommended for neural network applications in recognition or classification of 2-dimensional array patterns in highly noisy environments. Copyright (c) 2010 Elsevier Ltd. All rights reserved.

A Self-Organizing Incremental Neural Network based on local distribution learning.

PubMed

Xing, Youlu; Shi, Xiaofeng; Shen, Furao; Zhou, Ke; Zhao, Jinxi

2016-12-01

In this paper, we propose an unsupervised incremental learning neural network based on local distribution learning, which is called Local Distribution Self-Organizing Incremental Neural Network (LD-SOINN). The LD-SOINN combines the advantages of incremental learning and matrix learning. It can automatically discover suitable nodes to fit the learning data in an incremental way without a priori knowledge such as the structure of the network. The nodes of the network store rich local information regarding the learning data. The adaptive vigilance parameter guarantees that LD-SOINN is able to add new nodes for new knowledge automatically and the number of nodes will not grow unlimitedly. While the learning process continues, nodes that are close to each other and have similar principal components are merged to obtain a concise local representation, which we call a relaxation data representation. A denoising process based on density is designed to reduce the influence of noise. Experiments show that the LD-SOINN performs well on both artificial and real-word data. Copyright © 2016 Elsevier Ltd. All rights reserved.

Virtual shelves in a digital library: a framework for access to networked information sources.

PubMed

Patrick, T B; Springer, G K; Mitchell, J A; Sievert, M E

1995-01-01

Develop a framework for collections-based access to networked information sources that addresses the problem of location-dependent access to information sources. This framework uses a metaphor of a virtual shelf. A virtual shelf is a general-purpose server that is dedicated to a particular information subject class. The identifier of one of these servers identifies its subject class. Location-independent call numbers are assigned to information sources. Call numbers are based on standard vocabulary codes. The call numbers are first mapped to the location-independent identifiers of virtual shelves. When access to an information resource is required, a location directory provides a second mapping of these location-independent server identifiers to actual network locations. The framework has been implemented in two different systems. One system is based on the Open System Foundation/Distributed Computing Environment and the other is based on the World Wide Web. This framework applies in new ways traditional methods of library classification and cataloging. It is compatible with two traditional styles of selecting information searching and browsing. Traditional methods may be combined with new paradigms of information searching that will be able to take advantage of the special properties of digital information. Cooperation between the library-informational science community and the informatics community can provide a means for a continuing application of the knowledge and techniques of library science to the new problems of networked information sources.

Aging-related changes in the default mode network and its anti-correlated networks: a resting-state fMRI study.

PubMed

Wu, Jing-Tao; Wu, Hui-Zhen; Yan, Chao-Gan; Chen, Wen-Xin; Zhang, Hong-Ying; He, Yong; Yang, Hai-Shan

2011-10-17

Intrinsic brain activity in a resting state incorporates components of the task negative network called default mode network (DMN) and task-positive networks called attentional networks. In the present study, the reciprocal neuronal networks in the elder group were compared with the young group to investigate the differences of the intrinsic brain activity using a method of temporal correlation analysis based on seed regions of posterior cingulate cortex (PCC) and ventromedial prefrontal cortex (vmPFC). We found significant decreased positive correlations and negative correlations with the seeds of PCC and vmPFC in the old group. The decreased coactivations in the DMN network components and their negative networks in the old group may reflect age-related alterations in various brain functions such as attention, motor control and inhibition modulation in cognitive processing. These alterations in the resting state anti-correlative networks could provide neuronal substrates for the aging brain. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

A consensual neural network

NASA Technical Reports Server (NTRS)

Benediktsson, J. A.; Ersoy, O. K.; Swain, P. H.

1991-01-01

A neural network architecture called a consensual neural network (CNN) is proposed for the classification of data from multiple sources. Its relation to hierarchical and ensemble neural networks is discussed. CNN is based on the statistical consensus theory and uses nonlinearly transformed input data. The input data are transformed several times, and the different transformed data are applied as if they were independent inputs. The independent inputs are classified using stage neural networks and outputs from the stage networks are then weighted and combined to make a decision. Experimental results based on remote-sensing data and geographic data are given.

RIDES: Robust Intrusion Detection System for IP-Based Ubiquitous Sensor Networks

PubMed Central

Amin, Syed Obaid; Siddiqui, Muhammad Shoaib; Hong, Choong Seon; Lee, Sungwon

2009-01-01

The IP-based Ubiquitous Sensor Network (IP-USN) is an effort to build the “Internet of things”. By utilizing IP for low power networks, we can benefit from existing well established tools and technologies of IP networks. Along with many other unresolved issues, securing IP-USN is of great concern for researchers so that future market satisfaction and demands can be met. Without proper security measures, both reactive and proactive, it is hard to envisage an IP-USN realm. In this paper we present a design of an IDS (Intrusion Detection System) called RIDES (Robust Intrusion DEtection System) for IP-USN. RIDES is a hybrid intrusion detection system, which incorporates both Signature and Anomaly based intrusion detection components. For signature based intrusion detection this paper only discusses the implementation of distributed pattern matching algorithm with the help of signature-code, a dynamically created attack-signature identifier. Other aspects, such as creation of rules are not discussed. On the other hand, for anomaly based detection we propose a scoring classifier based on the SPC (Statistical Process Control) technique called CUSUM charts. We also investigate the settings and their effects on the performance of related parameters for both of the components. PMID:22412321

RIDES: Robust Intrusion Detection System for IP-Based Ubiquitous Sensor Networks.

PubMed

Amin, Syed Obaid; Siddiqui, Muhammad Shoaib; Hong, Choong Seon; Lee, Sungwon

2009-01-01

The IP-based Ubiquitous Sensor Network (IP-USN) is an effort to build the "Internet of things". By utilizing IP for low power networks, we can benefit from existing well established tools and technologies of IP networks. Along with many other unresolved issues, securing IP-USN is of great concern for researchers so that future market satisfaction and demands can be met. Without proper security measures, both reactive and proactive, it is hard to envisage an IP-USN realm. In this paper we present a design of an IDS (Intrusion Detection System) called RIDES (Robust Intrusion DEtection System) for IP-USN. RIDES is a hybrid intrusion detection system, which incorporates both Signature and Anomaly based intrusion detection components. For signature based intrusion detection this paper only discusses the implementation of distributed pattern matching algorithm with the help of signature-code, a dynamically created attack-signature identifier. Other aspects, such as creation of rules are not discussed. On the other hand, for anomaly based detection we propose a scoring classifier based on the SPC (Statistical Process Control) technique called CUSUM charts. We also investigate the settings and their effects on the performance of related parameters for both of the components.

SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking

NASA Astrophysics Data System (ADS)

Shams, Bita; Haratizadeh, Saman

2016-09-01

Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking methods. SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks.

Toward edge minability for role mining in bipartite networks

NASA Astrophysics Data System (ADS)

Dong, Lijun; Wang, Yi; Liu, Ran; Pi, Benjie; Wu, Liuyi

2016-11-01

Bipartite network models have been extensively used in information security to automatically generate role-based access control (RBAC) from dataset. This process is called role mining. However, not all the topologies of bipartite networks are suitable for role mining; some edges may even reduce the quality of role mining. This causes unnecessary time consumption as role mining is NP-hard. Therefore, to promote the quality of role mining results, the capability that an edge composes roles with other edges, called the minability of edge, needs to be identified. We tackle the problem from an angle of edge importance in complex networks; that is an edge easily covered by roles is considered to be more important. Based on this idea, the k-shell decomposition of complex networks is extended to reveal the different minability of edges. By this way, a bipartite network can be quickly purified by excluding the low-minability edges from role mining, and thus the quality of role mining can be effectively improved. Extensive experiments via the real-world datasets are conducted to confirm the above claims.

Fieldservers and Sensor Service Grid as Real-time Monitoring Infrastructure for Ubiquitous Sensor Networks

PubMed Central

Honda, Kiyoshi; Shrestha, Aadit; Witayangkurn, Apichon; Chinnachodteeranun, Rassarin; Shimamura, Hiroshi

2009-01-01

The fieldserver is an Internet based observation robot that can provide an outdoor solution for monitoring environmental parameters in real-time. The data from its sensors can be collected to a central server infrastructure and published on the Internet. The information from the sensor network will contribute to monitoring and modeling on various environmental issues in Asia, including agriculture, food, pollution, disaster, climate change etc. An initiative called Sensor Asia is developing an infrastructure called Sensor Service Grid (SSG), which integrates fieldservers and Web GIS to realize easy and low cost installation and operation of ubiquitous field sensor networks. PMID:22574018

Social Networks-Based Adaptive Pairing Strategy for Cooperative Learning

ERIC Educational Resources Information Center

Chuang, Po-Jen; Chiang, Ming-Chao; Yang, Chu-Sing; Tsai, Chun-Wei

2012-01-01

In this paper, we propose a grouping strategy to enhance the learning and testing results of students, called Pairing Strategy (PS). The proposed method stems from the need of interactivity and the desire of cooperation in cooperative learning. Based on the social networks of students, PS provides members of the groups to learn from or mimic…

A Set of Free Cross-Platform Authoring Programs for Flexible Web-Based CALL Exercises

ERIC Educational Resources Information Center

O'Brien, Myles

2012-01-01

The Mango Suite is a set of three freely downloadable cross-platform authoring programs for flexible network-based CALL exercises. They are Adobe Air applications, so they can be used on Windows, Macintosh, or Linux computers, provided the freely-available Adobe Air has been installed on the computer. The exercises which the programs generate are…

Virtual shelves in a digital library: a framework for access to networked information sources.

PubMed Central

Patrick, T B; Springer, G K; Mitchell, J A; Sievert, M E

1995-01-01

OBJECTIVE: Develop a framework for collections-based access to networked information sources that addresses the problem of location-dependent access to information sources. DESIGN: This framework uses a metaphor of a virtual shelf. A virtual shelf is a general-purpose server that is dedicated to a particular information subject class. The identifier of one of these servers identifies its subject class. Location-independent call numbers are assigned to information sources. Call numbers are based on standard vocabulary codes. The call numbers are first mapped to the location-independent identifiers of virtual shelves. When access to an information resource is required, a location directory provides a second mapping of these location-independent server identifiers to actual network locations. RESULTS: The framework has been implemented in two different systems. One system is based on the Open System Foundation/Distributed Computing Environment and the other is based on the World Wide Web. CONCLUSIONS: This framework applies in new ways traditional methods of library classification and cataloging. It is compatible with two traditional styles of selecting information searching and browsing. Traditional methods may be combined with new paradigms of information searching that will be able to take advantage of the special properties of digital information. Cooperation between the library-informational science community and the informatics community can provide a means for a continuing application of the knowledge and techniques of library science to the new problems of networked information sources. PMID:8581554

On effectiveness of network sensor-based defense framework

NASA Astrophysics Data System (ADS)

Zhang, Difan; Zhang, Hanlin; Ge, Linqiang; Yu, Wei; Lu, Chao; Chen, Genshe; Pham, Khanh

2012-06-01

Cyber attacks are increasing in frequency, impact, and complexity, which demonstrate extensive network vulnerabilities with the potential for serious damage. Defending against cyber attacks calls for the distributed collaborative monitoring, detection, and mitigation. To this end, we develop a network sensor-based defense framework, with the aim of handling network security awareness, mitigation, and prediction. We implement the prototypical system and show its effectiveness on detecting known attacks, such as port-scanning and distributed denial-of-service (DDoS). Based on this framework, we also implement the statistical-based detection and sequential testing-based detection techniques and compare their respective detection performance. The future implementation of defensive algorithms can be provisioned in our proposed framework for combating cyber attacks.

A cryptographic hash function based on chaotic network automata

NASA Astrophysics Data System (ADS)

Machicao, Jeaneth; Bruno, Odemir M.

2017-12-01

Chaos theory has been used to develop several cryptographic methods relying on the pseudo-random properties extracted from simple nonlinear systems such as cellular automata (CA). Cryptographic hash functions (CHF) are commonly used to check data integrity. CHF “compress” arbitrary long messages (input) into much smaller representations called hash values or message digest (output), designed to prevent the ability to reverse the hash values into the original message. This paper proposes a chaos-based CHF inspired on an encryption method based on chaotic CA rule B1357-S2468. Here, we propose an hybrid model that combines CA and networks, called network automata (CNA), whose chaotic spatio-temporal outputs are used to compute a hash value. Following the Merkle and Damgård model of construction, a portion of the message is entered as the initial condition of the network automata, so that the rest parts of messages are iteratively entered to perturb the system. The chaotic network automata shuffles the message using flexible control parameters, so that the generated hash value is highly sensitive to the message. As demonstrated in our experiments, the proposed model has excellent pseudo-randomness and sensitivity properties with acceptable performance when compared to conventional hash functions.

On the Inference of Functional Circadian Networks Using Granger Causality

PubMed Central

Pourzanjani, Arya; Herzog, Erik D.; Petzold, Linda R.

2015-01-01

Being able to infer one way direct connections in an oscillatory network such as the suprachiastmatic nucleus (SCN) of the mammalian brain using time series data is difficult but crucial to understanding network dynamics. Although techniques have been developed for inferring networks from time series data, there have been no attempts to adapt these techniques to infer directional connections in oscillatory time series, while accurately distinguishing between direct and indirect connections. In this paper an adaptation of Granger Causality is proposed that allows for inference of circadian networks and oscillatory networks in general called Adaptive Frequency Granger Causality (AFGC). Additionally, an extension of this method is proposed to infer networks with large numbers of cells called LASSO AFGC. The method was validated using simulated data from several different networks. For the smaller networks the method was able to identify all one way direct connections without identifying connections that were not present. For larger networks of up to twenty cells the method shows excellent performance in identifying true and false connections; this is quantified by an area-under-the-curve (AUC) 96.88%. We note that this method like other Granger Causality-based methods, is based on the detection of high frequency signals propagating between cell traces. Thus it requires a relatively high sampling rate and a network that can propagate high frequency signals. PMID:26413748

Multiplex visibility graphs to investigate recurrent neural network dynamics

NASA Astrophysics Data System (ADS)

Bianchi, Filippo Maria; Livi, Lorenzo; Alippi, Cesare; Jenssen, Robert

2017-03-01

A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning them properly may be difficult and, typically, based on a trial-and-error approach. In this work, we adopt a graph-based framework to interpret and characterize internal dynamics of a class of RNNs called echo state networks (ESNs). We design principled unsupervised methods to derive hyperparameters configurations yielding maximal ESN performance, expressed in terms of prediction error and memory capacity. In particular, we propose to model time series generated by each neuron activations with a horizontal visibility graph, whose topological properties have been shown to be related to the underlying system dynamics. Successively, horizontal visibility graphs associated with all neurons become layers of a larger structure called a multiplex. We show that topological properties of such a multiplex reflect important features of ESN dynamics that can be used to guide the tuning of its hyperparamers. Results obtained on several benchmarks and a real-world dataset of telephone call data records show the effectiveness of the proposed methods.

Multiplex visibility graphs to investigate recurrent neural network dynamics

PubMed Central

Bianchi, Filippo Maria; Livi, Lorenzo; Alippi, Cesare; Jenssen, Robert

2017-01-01

A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning them properly may be difficult and, typically, based on a trial-and-error approach. In this work, we adopt a graph-based framework to interpret and characterize internal dynamics of a class of RNNs called echo state networks (ESNs). We design principled unsupervised methods to derive hyperparameters configurations yielding maximal ESN performance, expressed in terms of prediction error and memory capacity. In particular, we propose to model time series generated by each neuron activations with a horizontal visibility graph, whose topological properties have been shown to be related to the underlying system dynamics. Successively, horizontal visibility graphs associated with all neurons become layers of a larger structure called a multiplex. We show that topological properties of such a multiplex reflect important features of ESN dynamics that can be used to guide the tuning of its hyperparamers. Results obtained on several benchmarks and a real-world dataset of telephone call data records show the effectiveness of the proposed methods. PMID:28281563

Group Centric Networking: A New Approach for Wireless Multi-Hop Networking to Enable the Internet of Things

DTIC Science & Technology

2016-01-22

basic mechanism of link-based routing schemes is the broadcasting of a control message (called a “ hello ”) to all of its neighbors. If a response is...to a destination by using the set of ex- changed hello messages between users of the network. With suciently high frequency, hello messages are suc

Characterizing Crowd Participation and Productivity of Foldit Through Web Scraping

DTIC Science & Technology

2016-03-01

Berkeley Open Infrastructure for Network Computing CDF Cumulative Distribution Function CPU Central Processing Unit CSSG Crowdsourced Serious Game...computers at once can create a similar capacity. According to Anderson [6], principal investigator for the Berkeley Open Infrastructure for Network...extraterrestrial life. From this project, a software-based distributed computing platform called the Berkeley Open Infrastructure for Network Computing

Advances in SCA and RF-DNA Fingerprinting Through Enhanced Linear Regression Attacks and Application of Random Forest Classifiers

DTIC Science & Technology

2014-09-18

Converter AES Advance Encryption Standard ANN Artificial Neural Network APS Application Support AUC Area Under the Curve CPA Correlation Power Analysis ...Importance WGN White Gaussian Noise WPAN Wireless Personal Area Networks XEnv Cross-Environment XRx Cross-Receiver xxi ADVANCES IN SCA AND RF-DNA...based tool called KillerBee was released in 2009 that increases the exposure of ZigBee and other IEEE 802.15.4-based Wireless Personal Area Networks

Modeling Dynamic Evolution of Online Friendship Network

NASA Astrophysics Data System (ADS)

Wu, Lian-Ren; Yan, Qiang

2012-10-01

In this paper, we study the dynamic evolution of friendship network in SNS (Social Networking Site). Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community, but also on the friendship network generated by those friends. In addition, we propose a model which is based on two processes: first, connecting nearest neighbors; second, strength driven attachment mechanism. The model reflects two facts: first, in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor; second, new nodes connect more likely to nodes which have larger weights and interactions, a phenomenon called strength driven attachment (also called weight driven attachment). From the simulation results, we find that degree distribution P(k), strength distribution P(s), and degree-strength correlation are all consistent with empirical data.

Stabilization of model-based networked control systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miranda, Francisco; Instituto Politécnico de Viana do Castelo, Viana do Castelo; Abreu, Carlos

2016-06-08

A class of networked control systems called Model-Based Networked Control Systems (MB-NCSs) is considered. Stabilization of MB-NCSs is studied using feedback controls and simulation of stabilization for different feedbacks is made with the purpose to reduce the network trafic. The feedback control input is applied in a compensated model of the plant that approximates the plant dynamics and stabilizes the plant even under slow network conditions. Conditions for global exponential stabilizability and for the choosing of a feedback control input for a given constant time between the information moments of the network are derived. An optimal control problem to obtainmore » an optimal feedback control is also presented.« less

PISA: Federated Search in P2P Networks with Uncooperative Peers

NASA Astrophysics Data System (ADS)

Ren, Zujie; Shou, Lidan; Chen, Gang; Chen, Chun; Bei, Yijun

Recently, federated search in P2P networks has received much attention. Most of the previous work assumed a cooperative environment where each peer can actively participate in information publishing and distributed document indexing. However, little work has addressed the problem of incorporating uncooperative peers, which do not publish their own corpus statistics, into a network. This paper presents a P2P-based federated search framework called PISA which incorporates uncooperative peers as well as the normal ones. In order to address the indexing needs for uncooperative peers, we propose a novel heuristic query-based sampling approach which can obtain high-quality resource descriptions from uncooperative peers at relatively low communication cost. We also propose an effective method called RISE to merge the results returned by uncooperative peers. Our experimental results indicate that PISA can provide quality search results, while utilizing the uncooperative peers at a low cost.

Toward of a highly integrated probe for improving wireless network quality

NASA Astrophysics Data System (ADS)

Ding, Fei; Song, Aiguo; Wu, Zhenyang; Pan, Zhiwen; You, Xiaohu

2016-10-01

Quality of service and customer perception is the focus of the telecommunications industry. This paper proposes a low-cost approach to the acquisition of terminal data, collected from LTE networks with the application of a soft probe, based on the Java language. The soft probe includes support for fast call in the form of a referenced library, and can be integrated into various Android-based applications to automatically monitor any exception event in the network. Soft probe-based acquisition of terminal data has the advantages of low cost and can be applied on large scale. Experiment shows that a soft probe can efficiently obtain terminal network data. With this method, the quality of service of LTE networks can be determined from acquired wireless data. This work contributes to efficient network optimization, and the analysis of abnormal network events.

Expert networks in CLIPS

NASA Technical Reports Server (NTRS)

Hruska, S. I.; Dalke, A.; Ferguson, J. J.; Lacher, R. C.

1991-01-01

Rule-based expert systems may be structurally and functionally mapped onto a special class of neural networks called expert networks. This mapping lends itself to adaptation of connectionist learning strategies for the expert networks. A parsing algorithm to translate C Language Integrated Production System (CLIPS) rules into a network of interconnected assertion and operation nodes has been developed. The translation of CLIPS rules to an expert network and back again is illustrated. Measures of uncertainty similar to those rules in MYCIN-like systems are introduced into the CLIPS system and techniques for combining and hiring nodes in the network based on rule-firing with these certainty factors in the expert system are presented. Several learning algorithms are under study which automate the process of attaching certainty factors to rules.

Visibility Graph Based Time Series Analysis.

PubMed

Stephen, Mutua; Gu, Changgui; Yang, Huijie

2015-01-01

Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq) and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.

Exploratory Visualization of Graphs Based on Community Structure

ERIC Educational Resources Information Center

Liu, Yujie

2013-01-01

Communities, also called clusters or modules, are groups of nodes which probably share common properties and/or play similar roles within a graph. They widely exist in real networks such as biological, social, and information networks. Allowing users to interactively browse and explore the community structure, which is essential for understanding…

A Development System for Augmented Transition Network Grammars and a Large Grammar for Technical Prose. Technical Report No. 25.

ERIC Educational Resources Information Center

Mayer, John; Kieras, David E.

Using a system based on standard augmented transition network (ATN) parsing approach, this report describes a technique for the rapid development of natural language parsing, called High-Level Grammar Specification Language (HGSL). The first part of the report describes the syntax and semantics of HGSL and the network implementation of each of its…

The Design of NetSecLab: A Small Competition-Based Network Security Lab

ERIC Educational Resources Information Center

Lee, C. P.; Uluagac, A. S.; Fairbanks, K. D.; Copeland, J. A.

2011-01-01

This paper describes a competition-style of exercise to teach system and network security and to reinforce themes taught in class. The exercise, called NetSecLab, is conducted on a closed network with student-formed teams, each with their own Linux system to defend and from which to launch attacks. Students are expected to learn how to: 1) install…

A Very Large Area Network (VLAN) knowledge-base applied to space communication problems

NASA Technical Reports Server (NTRS)

Zander, Carol S.

1988-01-01

This paper first describes a hierarchical model for very large area networks (VLAN). Space communication problems whose solution could profit by the model are discussed and then an enhanced version of this model incorporating the knowledge needed for the missile detection-destruction problem is presented. A satellite network or VLAN is a network which includes at least one satellite. Due to the complexity, a compromise between fully centralized and fully distributed network management has been adopted. Network nodes are assigned to a physically localized group, called a partition. Partitions consist of groups of cell nodes with one cell node acting as the organizer or master, called the Group Master (GM). Coordinating the group masters is a Partition Master (PM). Knowledge is also distributed hierarchically existing in at least two nodes. Each satellite node has a back-up earth node. Knowledge must be distributed in such a way so as to minimize information loss when a node fails. Thus the model is hierarchical both physically and informationally.

Dynamic Call Admission Control Scheme Based on Predictive User Mobility Behavior for Cellular Networks

NASA Astrophysics Data System (ADS)

Intarasothonchun, Silada; Thipchaksurat, Sakchai; Varakulsiripunth, Ruttikorn; Onozato, Yoshikuni

In this paper, we propose a modified scheme of MSODB and PMS, called Predictive User Mobility Behavior (PUMB) to improve performance of resource reservation and call admission control for cellular networks. This algorithm is proposed in which bandwidth is allocated more efficiently to neighboring cells by key mobility parameters in order to provide QoS guarantees for transferring traffic. The probability is used to form a cluster of cells and the shadow cluster, where a mobile unit is likely to visit. When a mobile unit may change the direction and migrate to the cell that does not belong to its shadow cluster, we can support it by making efficient use of predicted nonconforming call. Concomitantly, to ensure continuity of on-going calls with better utilization of resources, bandwidth is borrowed from predicted nonconforming calls and existing adaptive calls without affecting the minimum QoS guarantees. The performance of the PUMB is demonstrated by simulation results in terms of new call blocking probability, handoff call dropping probability, bandwidth utilization, call successful probability, and overhead message transmission when arrival rate and speed of mobile units are varied. Our results show that PUMB provides the better performances comparing with those of MSODB and PMS under different traffic conditions.

Spatial-Temporal Reasoning Applications of Computational Intelligence in the Game of Go and Computer Networks

DTIC Science & Technology

2012-01-01

dimensionality, Tesauro used a backpropagation- based , three-layer neural network and implemented the outcome from a self-play game as the reinforcement signal...a school of fish, flock of birds, and colony of ants. Our literature review reveals that no one has used PSO to train the neural network ...trained with a variant of PSO called cellular PSO (CPSO). CSRN is a supervised learning neural network (SLNN). The proposed algorithm for the

Robust and Cost-Efficient Communication Based on SNMP in Mobile Networks

NASA Astrophysics Data System (ADS)

Ryu, Sang-Hoon; Baik, Doo-Kwon

A main challenge in the design of this mobile network is the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. Multimedia streaming services are receiving considerable interest in the mobile network business. An entire mobile network may change its point of attachment to the Internet. The mobile network is operated by a basic specification to support network mobility called Network Mobility (NEMO) Basic Support. However, NEMO basic Support mechanism has some problem in continuous communication. In this paper, we propose robust and cost-efficient algorithm. And we simulate proposed method and conclude some remarks.

An Improved Call Admission Control Mechanism with Prioritized Handoff Queuing Scheme for BWA Networks

NASA Astrophysics Data System (ADS)

Chowdhury, Prasun; Saha Misra, Iti

2014-10-01

Nowadays, due to increased demand for using the Broadband Wireless Access (BWA) networks in a satisfactory manner a promised Quality of Service (QoS) is required to manage the seamless transmission of the heterogeneous handoff calls. To this end, this paper proposes an improved Call Admission Control (CAC) mechanism with prioritized handoff queuing scheme that aims to reduce dropping probability of handoff calls. Handoff calls are queued when no bandwidth is available even after the allowable bandwidth degradation of the ongoing calls and get admitted into the network when an ongoing call is terminated with a higher priority than the newly originated call. An analytical Markov model for the proposed CAC mechanism is developed to analyze various performance parameters. Analytical results show that our proposed CAC with handoff queuing scheme prioritizes the handoff calls effectively and reduces dropping probability of the system by 78.57% for real-time traffic without degrading the number of failed new call attempts. This results in the increased bandwidth utilization of the network.

47 CFR 51.5 - Terms and definitions.

Code of Federal Regulations, 2014 CFR

2014-10-01

.... The Communications Act of 1934, as amended. Advanced intelligent network. Advanced intelligent network is a telecommunications network architecture in which call processing, call routing, and network... carrier's network. Advanced services. The term “advanced services” is defined as high speed, switched...

QuateXelero: An Accelerated Exact Network Motif Detection Algorithm

PubMed Central

Khakabimamaghani, Sahand; Sharafuddin, Iman; Dichter, Norbert; Koch, Ina; Masoudi-Nejad, Ali

2013-01-01

Finding motifs in biological, social, technological, and other types of networks has become a widespread method to gain more knowledge about these networks’ structure and function. However, this task is very computationally demanding, because it is highly associated with the graph isomorphism which is an NP problem (not known to belong to P or NP-complete subsets yet). Accordingly, this research is endeavoring to decrease the need to call NAUTY isomorphism detection method, which is the most time-consuming step in many existing algorithms. The work provides an extremely fast motif detection algorithm called QuateXelero, which has a Quaternary Tree data structure in the heart. The proposed algorithm is based on the well-known ESU (FANMOD) motif detection algorithm. The results of experiments on some standard model networks approve the overal superiority of the proposed algorithm, namely QuateXelero, compared with two of the fastest existing algorithms, G-Tries and Kavosh. QuateXelero is especially fastest in constructing the central data structure of the algorithm from scratch based on the input network. PMID:23874498

47 CFR 64.5110 - Safeguards on the disclosure of customer proprietary network information.

Code of Federal Regulations, 2013 CFR

2013-10-01

... disclosing CPNI based on a customer-initiated telephone contact, TRS call, point-to-point call, online...) of this section. (c) Online access to CPNI. A TRS provider shall authenticate a customer without the... customer online access to CPNI related to his or her TRS account. Once authenticated, the customer may only...

47 CFR 64.5110 - Safeguards on the disclosure of customer proprietary network information.

Code of Federal Regulations, 2014 CFR

2014-10-01

... disclosing CPNI based on a customer-initiated telephone contact, TRS call, point-to-point call, online...) of this section. (c) Online access to CPNI. A TRS provider shall authenticate a customer without the... customer online access to CPNI related to his or her TRS account. Once authenticated, the customer may only...

Agent-based traffic management and reinforcement learning in congested intersection network.

DOT National Transportation Integrated Search

2012-08-01

This study evaluates the performance of traffic control systems based on reinforcement learning (RL), also called approximate dynamic programming (ADP). Two algorithms have been selected for testing: 1) Q-learning and 2) approximate dynamic programmi...

Reducing weight precision of convolutional neural networks towards large-scale on-chip image recognition

NASA Astrophysics Data System (ADS)

Ji, Zhengping; Ovsiannikov, Ilia; Wang, Yibing; Shi, Lilong; Zhang, Qiang

2015-05-01

In this paper, we develop a server-client quantization scheme to reduce bit resolution of deep learning architecture, i.e., Convolutional Neural Networks, for image recognition tasks. Low bit resolution is an important factor in bringing the deep learning neural network into hardware implementation, which directly determines the cost and power consumption. We aim to reduce the bit resolution of the network without sacrificing its performance. To this end, we design a new quantization algorithm called supervised iterative quantization to reduce the bit resolution of learned network weights. In the training stage, the supervised iterative quantization is conducted via two steps on server - apply k-means based adaptive quantization on learned network weights and retrain the network based on quantized weights. These two steps are alternated until the convergence criterion is met. In this testing stage, the network configuration and low-bit weights are loaded to the client hardware device to recognize coming input in real time, where optimized but expensive quantization becomes infeasible. Considering this, we adopt a uniform quantization for the inputs and internal network responses (called feature maps) to maintain low on-chip expenses. The Convolutional Neural Network with reduced weight and input/response precision is demonstrated in recognizing two types of images: one is hand-written digit images and the other is real-life images in office scenarios. Both results show that the new network is able to achieve the performance of the neural network with full bit resolution, even though in the new network the bit resolution of both weight and input are significantly reduced, e.g., from 64 bits to 4-5 bits.

Confabulation Based Real-time Anomaly Detection for Wide-area Surveillance Using Heterogeneous High Performance Computing Architecture

DTIC Science & Technology

2015-06-01

system accuracy. The AnRAD system was also generalized for the additional application of network intrusion detection . A self-structuring technique...to Host- based Intrusion Detection Systems using Contiguous and Discontiguous System Call Patterns,” IEEE Transactions on Computer, 63(4), pp. 807...square kilometer areas. The anomaly recognition and detection (AnRAD) system was built as a cogent confabulation network . It represented road

Secure Networks for First Responders and Special Forces

NASA Technical Reports Server (NTRS)

2005-01-01

When NASA needed help better securing its communications with orbiting satellites, the Agency called on Western DataCom Co., Inc., to help develop a prototype Internet Protocol (IP) router. Westlake, Ohio-based Western DataCom designs, develops, and manufactures hardware that secures voice, video, and data transmissions over any IP-based network. The technology that it jointly developed with NASA is now serving as a communications solution in military and first-response situations.

An evidential link prediction method and link predictability based on Shannon entropy

NASA Astrophysics Data System (ADS)

Yin, Likang; Zheng, Haoyang; Bian, Tian; Deng, Yong

2017-09-01

Predicting missing links is of both theoretical value and practical interest in network science. In this paper, we empirically investigate a new link prediction method base on similarity and compare nine well-known local similarity measures on nine real networks. Most of the previous studies focus on the accuracy, however, it is crucial to consider the link predictability as an initial property of networks itself. Hence, this paper has proposed a new link prediction approach called evidential measure (EM) based on Dempster-Shafer theory. Moreover, this paper proposed a new method to measure link predictability via local information and Shannon entropy.

Capacity-Delay Trade-Off in Collaborative Hybrid Ad-Hoc Networks with Coverage Sensing.

PubMed

Chen, Lingyu; Luo, Wenbin; Liu, Chen; Hong, Xuemin; Shi, Jianghong

2017-01-26

The integration of ad hoc device-to-device (D2D) communications and open-access small cells can result in a networking paradigm called hybrid the ad hoc network, which is particularly promising in delivering delay-tolerant data. The capacity-delay performance of hybrid ad hoc networks has been studied extensively under a popular framework called scaling law analysis. These studies, however, do not take into account aspects of interference accumulation and queueing delay and, therefore, may lead to over-optimistic results. Moreover, focusing on the average measures, existing works fail to give finer-grained insights into the distribution of delays. This paper proposes an alternative analytical framework based on queueing theoretic models and physical interference models. We apply this framework to study the capacity-delay performance of a collaborative cellular D2D network with coverage sensing and two-hop relay. The new framework allows us to fully characterize the delay distribution in the transform domain and pinpoint the impacts of coverage sensing, user and base station densities, transmit power, user mobility and packet size on the capacity-delay trade-off. We show that under the condition of queueing equilibrium, the maximum throughput capacity per device saturates to an upper bound of 0.7239 λ b / λ u bits/s/Hz, where λ b and λ u are the densities of base stations and mobile users, respectively.

Capacity-Delay Trade-Off in Collaborative Hybrid Ad-Hoc Networks with Coverage Sensing

PubMed Central

Chen, Lingyu; Luo, Wenbin; Liu, Chen; Hong, Xuemin; Shi, Jianghong

2017-01-01

The integration of ad hoc device-to-device (D2D) communications and open-access small cells can result in a networking paradigm called hybrid the ad hoc network, which is particularly promising in delivering delay-tolerant data. The capacity-delay performance of hybrid ad hoc networks has been studied extensively under a popular framework called scaling law analysis. These studies, however, do not take into account aspects of interference accumulation and queueing delay and, therefore, may lead to over-optimistic results. Moreover, focusing on the average measures, existing works fail to give finer-grained insights into the distribution of delays. This paper proposes an alternative analytical framework based on queueing theoretic models and physical interference models. We apply this framework to study the capacity-delay performance of a collaborative cellular D2D network with coverage sensing and two-hop relay. The new framework allows us to fully characterize the delay distribution in the transform domain and pinpoint the impacts of coverage sensing, user and base station densities, transmit power, user mobility and packet size on the capacity-delay trade-off. We show that under the condition of queueing equilibrium, the maximum throughput capacity per device saturates to an upper bound of 0.7239 λb/λu bits/s/Hz, where λb and λu are the densities of base stations and mobile users, respectively. PMID:28134769

Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks

PubMed Central

Yan, Koon-Kiu; Fang, Gang; Bhardwaj, Nitin; Alexander, Roger P.; Gerstein, Mark

2010-01-01

The genome has often been called the operating system (OS) for a living organism. A computer OS is described by a regulatory control network termed the call graph, which is analogous to the transcriptional regulatory network in a cell. To apply our firsthand knowledge of the architecture of software systems to understand cellular design principles, we present a comparison between the transcriptional regulatory network of a well-studied bacterium (Escherichia coli) and the call graph of a canonical OS (Linux) in terms of topology and evolution. We show that both networks have a fundamentally hierarchical layout, but there is a key difference: The transcriptional regulatory network possesses a few global regulators at the top and many targets at the bottom; conversely, the call graph has many regulators controlling a small set of generic functions. This top-heavy organization leads to highly overlapping functional modules in the call graph, in contrast to the relatively independent modules in the regulatory network. We further develop a way to measure evolutionary rates comparably between the two networks and explain this difference in terms of network evolution. The process of biological evolution via random mutation and subsequent selection tightly constrains the evolution of regulatory network hubs. The call graph, however, exhibits rapid evolution of its highly connected generic components, made possible by designers’ continual fine-tuning. These findings stem from the design principles of the two systems: robustness for biological systems and cost effectiveness (reuse) for software systems. PMID:20439753

Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks.

PubMed

Yan, Koon-Kiu; Fang, Gang; Bhardwaj, Nitin; Alexander, Roger P; Gerstein, Mark

2010-05-18

The genome has often been called the operating system (OS) for a living organism. A computer OS is described by a regulatory control network termed the call graph, which is analogous to the transcriptional regulatory network in a cell. To apply our firsthand knowledge of the architecture of software systems to understand cellular design principles, we present a comparison between the transcriptional regulatory network of a well-studied bacterium (Escherichia coli) and the call graph of a canonical OS (Linux) in terms of topology and evolution. We show that both networks have a fundamentally hierarchical layout, but there is a key difference: The transcriptional regulatory network possesses a few global regulators at the top and many targets at the bottom; conversely, the call graph has many regulators controlling a small set of generic functions. This top-heavy organization leads to highly overlapping functional modules in the call graph, in contrast to the relatively independent modules in the regulatory network. We further develop a way to measure evolutionary rates comparably between the two networks and explain this difference in terms of network evolution. The process of biological evolution via random mutation and subsequent selection tightly constrains the evolution of regulatory network hubs. The call graph, however, exhibits rapid evolution of its highly connected generic components, made possible by designers' continual fine-tuning. These findings stem from the design principles of the two systems: robustness for biological systems and cost effectiveness (reuse) for software systems.

LMSS communication network design

NASA Technical Reports Server (NTRS)

1982-01-01

The architecture of the telecommunication network as the first step in the design of the LMSS system is described. A set of functional requirements including the total number of users to be served by the LMSS are hypothesized. The design parameters are then defined at length and are systematically selected such that the resultant system is capable of serving the hypothesized number of users. The design of the backhaul link is presented. The number of multiple backhaul beams required for communication to the base stations is determined. A conceptual procedure for call-routing and locating a mobile subscriber within the LMSS network is presented. The various steps in placing a call are explained, and the relationship between the two sets of UHF and S-band multiple beams is developed. A summary of the design parameters is presented.

Hierarchy Bayesian model based services awareness of high-speed optical access networks

NASA Astrophysics Data System (ADS)

Bai, Hui-feng

2018-03-01

As the speed of optical access networks soars with ever increasing multiple services, the service-supporting ability of optical access networks suffers greatly from the shortage of service awareness. Aiming to solve this problem, a hierarchy Bayesian model based services awareness mechanism is proposed for high-speed optical access networks. This approach builds a so-called hierarchy Bayesian model, according to the structure of typical optical access networks. Moreover, the proposed scheme is able to conduct simple services awareness operation in each optical network unit (ONU) and to perform complex services awareness from the whole view of system in optical line terminal (OLT). Simulation results show that the proposed scheme is able to achieve better quality of services (QoS), in terms of packet loss rate and time delay.

Pattern Analysis in Social Networks with Dynamic Connections

NASA Astrophysics Data System (ADS)

Wu, Yu; Zhang, Yu

In this paper, we explore how decentralized local interactions of autonomous agents in a network relate to collective behaviors. Most existing work in this area models social network in which agent relations are fixed; instead, we focus on dynamic social networks where agents can rationally adjust their neighborhoods based on their individual interests. We propose a new connection evaluation rule called the Highest Weighted Reward (HWR) rule, with which agents dynamically choose their neighbors in order to maximize their own utilities based on the rewards from previous interactions. Our experiments show that in the 2-action pure coordination game, our system will stabilize to a clustering state where all relationships in the network are rewarded with the optimal payoff. Our experiments also reveal additional interesting patterns in the network.

Visibility Graph Based Time Series Analysis

PubMed Central

Stephen, Mutua; Gu, Changgui; Yang, Huijie

2015-01-01

Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it’s microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq) and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks. PMID:26571115

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

PubMed

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

Zone-Based Routing Protocol for Wireless Sensor Networks

PubMed Central

Venkateswarlu Kumaramangalam, Muni; Adiyapatham, Kandasamy; Kandasamy, Chandrasekaran

2014-01-01

Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads. PMID:27437455

Zone-Based Routing Protocol for Wireless Sensor Networks.

PubMed

Venkateswarlu Kumaramangalam, Muni; Adiyapatham, Kandasamy; Kandasamy, Chandrasekaran

2014-01-01

Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads.

Challenges of CAC in Heterogeneous Wireless Cognitive Networks

NASA Astrophysics Data System (ADS)

Wang, Jiazheng; Fu, Xiuhua

Call admission control (CAC) is known as an effective functionality in ensuring the QoS of wireless networks. The vision of next generation wireless networks has led to the development of new call admission control (CAC) algorithms specifically designed for heterogeneous wireless Cognitive networks. However, there will be a number of challenges created by dynamic spectrum access and scheduling techniques associated with the cognitive systems. In this paper for the first time, we recommend that the CAC policies should be distinguished between primary users and secondary users. The classification of different methods of cac policies in cognitive networks contexts is proposed. Although there have been some researches within the umbrella of Joint CAC and cross-layer optimization for wireless networks, the advent of the cognitive networks adds some additional problems. We present the conceptual models for joint CAC and cross-layer optimization respectively. Also, the benefit of Cognition can only be realized fully if application requirements and traffic flow contexts are determined or inferred in order to know what modes of operation and spectrum bands to use at each point in time. The process model of Cognition involved per-flow-based CAC is presented. Because there may be a number of parameters on different levels affecting a CAC decision and the conditions for accepting or rejecting a call must be computed quickly and frequently, simplicity and practicability are particularly important for designing a feasible CAC algorithm. In a word, a more thorough understanding of CAC in heterogeneous wireless cognitive networks may help one to design better CAC algorithms.

Flexible embedding of networks

NASA Astrophysics Data System (ADS)

Fernandez-Gracia, Juan; Buckee, Caroline; Onnela, Jukka-Pekka

We introduce a model for embedding one network into another, focusing on the case where network A is much bigger than network B. Nodes from network A are assigned to the nodes in network B using an algorithm where we control the extent of localization of node placement in network B using a single parameter. Starting from an unassigned node in network A, called the source node, we first map this node to a randomly chosen node in network B, called the target node. We then assign the neighbors of the source node to the neighborhood of the target node using a random walk based approach. To assign each neighbor of the source node to one of the nodes in network B, we perform a random walk starting from the target node with stopping probability α. We repeat this process until all nodes in network A have been mapped to the nodes of network B. The simplicity of the model allows us to calculate key quantities of interest in closed form. By varying the parameter α, we are able to produce embeddings from very local (α = 1) to very global (α --> 0). We show how our calculations fit the simulated results, and we apply the model to study how social networks are embedded in geography and how the neurons of C. Elegans are embedded in the surrounding volume.

Effective Prediction of Errors by Non-native Speakers Using Decision Tree for Speech Recognition-Based CALL System

NASA Astrophysics Data System (ADS)

Wang, Hongcui; Kawahara, Tatsuya

CALL (Computer Assisted Language Learning) systems using ASR (Automatic Speech Recognition) for second language learning have received increasing interest recently. However, it still remains a challenge to achieve high speech recognition performance, including accurate detection of erroneous utterances by non-native speakers. Conventionally, possible error patterns, based on linguistic knowledge, are added to the lexicon and language model, or the ASR grammar network. However, this approach easily falls in the trade-off of coverage of errors and the increase of perplexity. To solve the problem, we propose a method based on a decision tree to learn effective prediction of errors made by non-native speakers. An experimental evaluation with a number of foreign students learning Japanese shows that the proposed method can effectively generate an ASR grammar network, given a target sentence, to achieve both better coverage of errors and smaller perplexity, resulting in significant improvement in ASR accuracy.

Predicting links based on knowledge dissemination in complex network

NASA Astrophysics Data System (ADS)

Zhou, Wen; Jia, Yifan

2017-04-01

Link prediction is the task of mining the missing links in networks or predicting the next vertex pair to be connected by a link. A lot of link prediction methods were inspired by evolutionary processes of networks. In this paper, a new mechanism for the formation of complex networks called knowledge dissemination (KD) is proposed with the assumption of knowledge disseminating through the paths of a network. Accordingly, a new link prediction method-knowledge dissemination based link prediction (KDLP)-is proposed to test KD. KDLP characterizes vertex similarity based on knowledge quantity (KQ) which measures the importance of a vertex through H-index. Extensive numerical simulations on six real-world networks demonstrate that KDLP is a strong link prediction method which performs at a higher prediction accuracy than four well-known similarity measures including common neighbors, local path index, average commute time and matrix forest index. Furthermore, based on the common conclusion that an excellent link prediction method reveals a good evolving mechanism, the experiment results suggest that KD is a considerable network evolving mechanism for the formation of complex networks.

The National Public Health Leadership Institute: evaluation of a team-based approach to developing collaborative public health leaders.

PubMed

Umble, Karl; Steffen, David; Porter, Janet; Miller, Delesha; Hummer-McLaughlin, Kelley; Lowman, Amy; Zelt, Susan

2005-04-01

Recent public health literature contains calls for collaborative public health interventions and for leaders capable of guiding them. The National Public Health Leadership Institute aims to develop collaborative leaders and to strengthen networks of leaders who share knowledge and jointly address public health problems. Evaluation results show that completing the institute training increases collaborative leadership and builds knowledge-sharing and problem-solving networks. These practices and networks strengthen interorganizational relationships, coalitions, services, programs, and policies. Intensive team-and project-based learning are key to the program's impact.

The National Public Health Leadership Institute: Evaluation of a Team-Based Approach to Developing Collaborative Public Health Leaders

PubMed Central

Umble, Karl; Steffen, David; Porter, Janet; Miller, Delesha; Hummer-McLaughlin, Kelley; Lowman, Amy; Zelt, Susan

2005-01-01

Recent public health literature contains calls for collaborative public health interventions and for leaders capable of guiding them. The National Public Health Leadership Institute aims to develop collaborative leaders and to strengthen networks of leaders who share knowledge and jointly address public health problems. Evaluation results show that completing the institute training increases collaborative leadership and builds knowledge-sharing and problem-solving networks. These practices and networks strengthen interorganizational relationships, coalitions, services, programs, and policies. Intensive team-and project-based learning are key to the program’s impact. PMID:15798124

Distributed Generation Planning using Peer Enhanced Multi-objective Teaching-Learning based Optimization in Distribution Networks

NASA Astrophysics Data System (ADS)

Selvam, Kayalvizhi; Vinod Kumar, D. M.; Siripuram, Ramakanth

2017-04-01

In this paper, an optimization technique called peer enhanced teaching learning based optimization (PeTLBO) algorithm is used in multi-objective problem domain. The PeTLBO algorithm is parameter less so it reduced the computational burden. The proposed peer enhanced multi-objective based TLBO (PeMOTLBO) algorithm has been utilized to find a set of non-dominated optimal solutions [distributed generation (DG) location and sizing in distribution network]. The objectives considered are: real power loss and the voltage deviation subjected to voltage limits and maximum penetration level of DG in distribution network. Since the DG considered is capable of injecting real and reactive power to the distribution network the power factor is considered as 0.85 lead. The proposed peer enhanced multi-objective optimization technique provides different trade-off solutions in order to find the best compromise solution a fuzzy set theory approach has been used. The effectiveness of this proposed PeMOTLBO is tested on IEEE 33-bus and Indian 85-bus distribution system. The performance is validated with Pareto fronts and two performance metrics (C-metric and S-metric) by comparing with robust multi-objective technique called non-dominated sorting genetic algorithm-II and also with the basic TLBO.

Layered Location-Based Security Mechanism for Mobile Sensor Networks: Moving Security Areas.

PubMed

Wang, Ze; Zhang, Haijuan; Wu, Luqiang; Zhou, Chang

2015-09-25

Network security is one of the most important issues in mobile sensor networks (MSNs). Networks are particularly vulnerable in hostile environments because of many factors, such as uncertain mobility, limitations on computation, and the need for storage in mobile nodes. Though some location-based security mechanisms can resist some malicious attacks, they are only suitable for static networks and may sometimes require large amounts of storage. To solve these problems, using location information, which is one of the most important properties in outdoor wireless networks, a security mechanism called a moving security area (MSA) is proposed to resist malicious attacks by using mobile nodes' dynamic location-based keys. The security mechanism is layered by performing different detection schemes inside or outside the MSA. The location-based private keys will be updated only at the appropriate moments, considering the balance of cost and security performance. By transferring parts of the detection tasks from ordinary nodes to the sink node, the memory requirements are distributed to different entities to save limited energy.

Method and system for conserving power in a telecommunications network during emergency situations

DOEpatents

Conrad, Stephen H [Algodones, NM; O'Reilly, Gerard P [Manalapan, NJ

2011-10-11

Disclosed is a method and apparatus for conserving power in a telecommunications network during emergency situations. A permissible number list of emergency and/or priority numbers is stored in the telecommunications network. In the event of an emergency or power failure, input digits of a call to the telecommunications network are compared to the permissible number list. The call is processed in the telecommunications network and routed to its destination if the input digits match an entry in the permissible number list. The call is dropped without any further processing if the input digits do not match an entry in the permissible number list. Thus, power can be conserved in emergency situations by only allowing emergency and/or priority calls.

An Analogy-Based Computer Tutor for Remediating Physics Misconceptions.

ERIC Educational Resources Information Center

Murray, Tom; And Others

1990-01-01

Describes an intelligent tutoring system designed to help students remedy misconceptions of physics concepts based on a teaching strategy called bridging analogies. Highlights include tutoring strategies; misconceptions in science education; the example situation network; confidence checking; formative evaluation with college students, including…

Social Networking and the Affective Domain of Learning

ERIC Educational Resources Information Center

Carrigan, Robert L.

2013-01-01

In 2006, the U.S. Department of Education commissioned a report called, "Charting the Future of U.S. Higher Education", asking educators to, "...test new teaching methods, content deliveries, and innovative pedagogies using technology-based collaborative applications" (p. 6). Fittingly, technology-based collaborative…

Brain network dynamics characterization in epileptic seizures. Joint directed graph and pairwise synchronization measures

NASA Astrophysics Data System (ADS)

Rodrigues, A. C.; Machado, B. S.; Florence, G.; Hamad, A. P.; Sakamoto, A. C.; Fujita, A.; Baccalá, L. A.; Amaro, E.; Sameshima, K.

2014-12-01

Here we propose and evaluate a new approach to analyse multichannel mesial temporal lobe epilepsy EEG data from eight patients through complex network and synchronization theories. The method employs a Granger causality test to infer the directed connectivity graphs and a wavelet transform based phase synchronization measure whose characteristics allow studying dynamical transitions during epileptic seizures. We present a new combined graph measure that quantifies the level of network hub formation, called network hub out-degree, which closely reflects the level of synchronization observed during the ictus.

The DSFPN, a new neural network for optical character recognition.

PubMed

Morns, L P; Dlay, S S

1999-01-01

A new type of neural network for recognition tasks is presented in this paper. The network, called the dynamic supervised forward-propagation network (DSFPN), is based on the forward only version of the counterpropagation network (CPN). The DSFPN, trains using a supervised algorithm and can grow dynamically during training, allowing subclasses in the training data to be learnt in an unsupervised manner. It is shown to train in times comparable to the CPN while giving better classification accuracies than the popular backpropagation network. Both Fourier descriptors and wavelet descriptors are used for image preprocessing and the wavelets are proven to give a far better performance.

Resting State fMRI Functional Connectivity-Based Classification Using a Convolutional Neural Network Architecture

PubMed Central

Meszlényi, Regina J.; Buza, Krisztian; Vidnyánszky, Zoltán

2017-01-01

Machine learning techniques have become increasingly popular in the field of resting state fMRI (functional magnetic resonance imaging) network based classification. However, the application of convolutional networks has been proposed only very recently and has remained largely unexplored. In this paper we describe a convolutional neural network architecture for functional connectome classification called connectome-convolutional neural network (CCNN). Our results on simulated datasets and a publicly available dataset for amnestic mild cognitive impairment classification demonstrate that our CCNN model can efficiently distinguish between subject groups. We also show that the connectome-convolutional network is capable to combine information from diverse functional connectivity metrics and that models using a combination of different connectivity descriptors are able to outperform classifiers using only one metric. From this flexibility follows that our proposed CCNN model can be easily adapted to a wide range of connectome based classification or regression tasks, by varying which connectivity descriptor combinations are used to train the network. PMID:29089883

Resting State fMRI Functional Connectivity-Based Classification Using a Convolutional Neural Network Architecture.

PubMed

Meszlényi, Regina J; Buza, Krisztian; Vidnyánszky, Zoltán

2017-01-01

Machine learning techniques have become increasingly popular in the field of resting state fMRI (functional magnetic resonance imaging) network based classification. However, the application of convolutional networks has been proposed only very recently and has remained largely unexplored. In this paper we describe a convolutional neural network architecture for functional connectome classification called connectome-convolutional neural network (CCNN). Our results on simulated datasets and a publicly available dataset for amnestic mild cognitive impairment classification demonstrate that our CCNN model can efficiently distinguish between subject groups. We also show that the connectome-convolutional network is capable to combine information from diverse functional connectivity metrics and that models using a combination of different connectivity descriptors are able to outperform classifiers using only one metric. From this flexibility follows that our proposed CCNN model can be easily adapted to a wide range of connectome based classification or regression tasks, by varying which connectivity descriptor combinations are used to train the network.

Entropy of dynamical social networks

NASA Astrophysics Data System (ADS)

Zhao, Kun; Karsai, Marton; Bianconi, Ginestra

2012-02-01

Dynamical social networks are evolving rapidly and are highly adaptive. Characterizing the information encoded in social networks is essential to gain insight into the structure, evolution, adaptability and dynamics. Recently entropy measures have been used to quantify the information in email correspondence, static networks and mobility patterns. Nevertheless, we still lack methods to quantify the information encoded in time-varying dynamical social networks. In this talk we present a model to quantify the entropy of dynamical social networks and use this model to analyze the data of phone-call communication. We show evidence that the entropy of the phone-call interaction network changes according to circadian rhythms. Moreover we show that social networks are extremely adaptive and are modified by the use of technologies such as mobile phone communication. Indeed the statistics of duration of phone-call is described by a Weibull distribution and is significantly different from the distribution of duration of face-to-face interactions in a conference. Finally we investigate how much the entropy of dynamical social networks changes in realistic models of phone-call or face-to face interactions characterizing in this way different type human social behavior.

Using telephony data to facilitate discovery of clinical workflows.

PubMed

Rucker, Donald W

2017-04-19

Discovery of clinical workflows to target for redesign using methods such as Lean and Six Sigma is difficult. VoIP telephone call pattern analysis may complement direct observation and EMR-based tools in understanding clinical workflows at the enterprise level by allowing visualization of institutional telecommunications activity. To build an analytic framework mapping repetitive and high-volume telephone call patterns in a large medical center to their associated clinical units using an enterprise unified communications server log file and to support visualization of specific call patterns using graphical networks. Consecutive call detail records from the medical center's unified communications server were parsed to cross-correlate telephone call patterns and map associated phone numbers to a cost center dictionary. Hashed data structures were built to allow construction of edge and node files representing high volume call patterns for display with an open source graph network tool. Summary statistics for an analysis of exactly one week's call detail records at a large academic medical center showed that 912,386 calls were placed with a total duration of 23,186 hours. Approximately half of all calling called number pairs had an average call duration under 60 seconds and of these the average call duration was 27 seconds. Cross-correlation of phone calls identified by clinical cost center can be used to generate graphical displays of clinical enterprise communications. Many calls are short. The compact data transfers within short calls may serve as automation or re-design targets. The large absolute amount of time medical center employees were engaged in VoIP telecommunications suggests that analysis of telephone call patterns may offer additional insights into core clinical workflows.

Network Upgrade for the SLC: PEP II Network

DOE Office of Scientific and Technical Information (OSTI.GOV)

Crane, M.; Call, M.; Clark, S.

2011-09-09

The PEP-II control system required a new network to support the system functions. This network, called CTLnet, is an FDDI/Ethernet based network using only TCP/IP protocols. An upgrade of the SLC Control System micro communications to use TCP/IP and SLCNET would allow all PEP-II control system nodes to use TCP/IP. CTLnet is private and separate from the SLAC public network. Access to nodes and control system functions is provided by multi-homed application servers with connections to both the private CTLnet and the SLAC public network. Monitoring and diagnostics are provided using a dedicated system. Future plans and current status informationmore » is included.« less

Have Your Computer Call My Computer.

ERIC Educational Resources Information Center

Carabi, Peter

1992-01-01

As more school systems adopt site-based management, local decision makers need greater access to all kinds of information. Microcomputer-based networks can help with classroom management, scheduling, student program design, counselor recommendations, and financial reporting operations. Administrators are provided with planning tips and a sample…

Towards a flexible middleware for context-aware pervasive and wearable systems.

PubMed

Muro, Marco; Amoretti, Michele; Zanichelli, Francesco; Conte, Gianni

2012-11-01

Ambient intelligence and wearable computing call for innovative hardware and software technologies, including a highly capable, flexible and efficient middleware, allowing for the reuse of existing pervasive applications when developing new ones. In the considered application domain, middleware should also support self-management, interoperability among different platforms, efficient communications, and context awareness. In the on-going "everything is networked" scenario scalability appears as a very important issue, for which the peer-to-peer (P2P) paradigm emerges as an appealing solution for connecting software components in an overlay network, allowing for efficient and balanced data distribution mechanisms. In this paper, we illustrate how all these concepts can be placed into a theoretical tool, called networked autonomic machine (NAM), implemented into a NAM-based middleware, and evaluated against practical problems of pervasive computing.

Communication is the key to success in pragmatic clinical trials in Practice-based Research Networks (PBRNs).

PubMed

Bertram, Susan; Graham, Deborah; Kurland, Marge; Pace, Wilson; Madison, Suzanne; Yawn, Barbara P

2013-01-01

Effective communication is the foundation of feasibility and fidelity in practice-based pragmatic research studies. Doing a study with practices spread over several states requires long-distance communication strategies, including E-mails, faxes, telephone calls, conference calls, and texting. Compared with face-to-face communication, distance communication strategies are less familiar to most study coordinators and research teams. Developing and ensuring comfort with distance communications requires additional time and use of different talents and expertise than those required for face-to-face communication. It is necessary to make sure that messages are appropriate for the medium, clearly crafted, and presented in a manner that facilitates practices receiving and understanding the information. This discussion is based on extensive experience of 2 groups who have worked collaboratively on several large, federally funded, pragmatic trials in a practice-based research network. The goal of this article is to summarize lessons learned to facilitate the work of other research teams.

A link prediction method for heterogeneous networks based on BP neural network

NASA Astrophysics Data System (ADS)

Li, Ji-chao; Zhao, Dan-ling; Ge, Bing-Feng; Yang, Ke-Wei; Chen, Ying-Wu

2018-04-01

Most real-world systems, composed of different types of objects connected via many interconnections, can be abstracted as various complex heterogeneous networks. Link prediction for heterogeneous networks is of great significance for mining missing links and reconfiguring networks according to observed information, with considerable applications in, for example, friend and location recommendations and disease-gene candidate detection. In this paper, we put forward a novel integrated framework, called MPBP (Meta-Path feature-based BP neural network model), to predict multiple types of links for heterogeneous networks. More specifically, the concept of meta-path is introduced, followed by the extraction of meta-path features for heterogeneous networks. Next, based on the extracted meta-path features, a supervised link prediction model is built with a three-layer BP neural network. Then, the solution algorithm of the proposed link prediction model is put forward to obtain predicted results by iteratively training the network. Last, numerical experiments on the dataset of examples of a gene-disease network and a combat network are conducted to verify the effectiveness and feasibility of the proposed MPBP. It shows that the MPBP with very good performance is superior to the baseline methods.

Talking and learning physics: Predicting future grades from network measures and Force Concept Inventory pretest scores

NASA Astrophysics Data System (ADS)

Bruun, Jesper; Brewe, Eric

2013-12-01

The role of student interactions in learning situations is a foundation of sociocultural learning theory, and social network analysis can be used to quantify student relations. We discuss how self-reported student interactions can be viewed as processes of meaning making and use this to understand how quantitative measures that describe the position in a network, called centrality measures, can be understood in terms of interactions that happen in the context of a university physics course. We apply this discussion to an empirical data set of self-reported student interactions. In a weekly administered survey, first year university students enrolled in an introductory physics course at a Danish university indicated with whom they remembered having communicated within different interaction categories. For three categories pertaining to (1) communication about how to solve physics problems in the course (called the PS category), (2) communications about the nature of physics concepts (called the CD category), and (3) social interactions that are not strictly related to the content of the physics classes (called the ICS category) in the introductory mechanics course, we use the survey data to create networks of student interaction. For each of these networks, we calculate centrality measures for each student and correlate these measures with grades from the introductory course, grades from two subsequent courses, and the pretest Force Concept Inventory (FCI) scores. We find highly significant correlations (p<0.001) between network centrality measures and grades in all networks. We find the highest correlations between network centrality measures and future grades. In the network composed of interactions regarding problem solving (the PS network), the centrality measures hide and PageRank show the highest correlations (r=-0.32 and r=0.33, respectively) with future grades. In the CD network, the network measure target entropy shows the highest correlation (r=0.45) with future grades. In the network composed solely of noncontent related social interactions, these patterns of correlation are maintained in the sense that these network measures show the highest correlations and maintain their internal ranking. Using hierarchical linear regression, we find that a linear model that adds the network measures hide and target entropy, calculated on the ICS network, significantly improves a base model that uses only the FCI pretest scores from the beginning of the semester. Though one should not infer causality from these results, they do point to how social interactions in class are intertwined with academic interactions. We interpret this as an integral part of learning, and suggest that physics is a robust example.

The equipment access software for a distributed UNIX-based accelerator control system

NASA Astrophysics Data System (ADS)

Trofimov, Nikolai; Zelepoukine, Serguei; Zharkov, Eugeny; Charrue, Pierre; Gareyte, Claire; Poirier, Hervé

1994-12-01

This paper presents a generic equipment access software package for a distributed control system using computers with UNIX or UNIX-like operating systems. The package consists of three main components, an application Equipment Access Library, Message Handler and Equipment Data Base. An application task, which may run in any computer in the network, sends requests to access equipment through Equipment Library calls. The basic request is in the form Equipment-Action-Data and is routed via a remote procedure call to the computer to which the given equipment is connected. In this computer the request is received by the Message Handler. According to the type of the equipment connection, the Message Handler either passes the request to the specific process software in the same computer or forwards it to a lower level network of equipment controllers using MIL1553B, GPIB, RS232 or BITBUS communication. The answer is then returned to the calling application. Descriptive information required for request routing and processing is stored in the real-time Equipment Data Base. The package has been written to be portable and is currently available on DEC Ultrix, LynxOS, HPUX, XENIX, OS-9 and Apollo domain.

CNNdel: Calling Structural Variations on Low Coverage Data Based on Convolutional Neural Networks

PubMed Central

2017-01-01

Many structural variations (SVs) detection methods have been proposed due to the popularization of next-generation sequencing (NGS). These SV calling methods use different SV-property-dependent features; however, they all suffer from poor accuracy when running on low coverage sequences. The union of results from these tools achieves fairly high sensitivity but still produces low accuracy on low coverage sequence data. That is, these methods contain many false positives. In this paper, we present CNNdel, an approach for calling deletions from paired-end reads. CNNdel gathers SV candidates reported by multiple tools and then extracts features from aligned BAM files at the positions of candidates. With labeled feature-expressed candidates as a training set, CNNdel trains convolutional neural networks (CNNs) to distinguish true unlabeled candidates from false ones. Results show that CNNdel works well with NGS reads from 26 low coverage genomes of the 1000 Genomes Project. The paper demonstrates that convolutional neural networks can automatically assign the priority of SV features and reduce the false positives efficaciously. PMID:28630866

Topology control algorithm for wireless sensor networks based on Link forwarding

NASA Astrophysics Data System (ADS)

Pucuo, Cairen; Qi, Ai-qin

2018-03-01

The research of topology control could effectively save energy and increase the service life of network based on wireless sensor. In this paper, a arithmetic called LTHC (link transmit hybrid clustering) based on link transmit is proposed. It decreases expenditure of energy by changing the way of cluster-node’s communication. The idea is to establish a link between cluster and SINK node when the cluster is formed, and link-node must be non-cluster. Through the link, cluster sends information to SINK nodes. For the sake of achieving the uniform distribution of energy on the network, prolongate the network survival time, and improve the purpose of communication, the communication will cut down much more expenditure of energy for cluster which away from SINK node. In the two aspects of improving the traffic and network survival time, we find that the LTCH is far superior to the traditional LEACH by experiments.

Machine Learning–Based Differential Network Analysis: A Study of Stress-Responsive Transcriptomes in Arabidopsis[W

PubMed Central

Ma, Chuang; Xin, Mingming; Feldmann, Kenneth A.; Wang, Xiangfeng

2014-01-01

Machine learning (ML) is an intelligent data mining technique that builds a prediction model based on the learning of prior knowledge to recognize patterns in large-scale data sets. We present an ML-based methodology for transcriptome analysis via comparison of gene coexpression networks, implemented as an R package called machine learning–based differential network analysis (mlDNA) and apply this method to reanalyze a set of abiotic stress expression data in Arabidopsis thaliana. The mlDNA first used a ML-based filtering process to remove nonexpressed, constitutively expressed, or non-stress-responsive “noninformative” genes prior to network construction, through learning the patterns of 32 expression characteristics of known stress-related genes. The retained “informative” genes were subsequently analyzed by ML-based network comparison to predict candidate stress-related genes showing expression and network differences between control and stress networks, based on 33 network topological characteristics. Comparative evaluation of the network-centric and gene-centric analytic methods showed that mlDNA substantially outperformed traditional statistical testing–based differential expression analysis at identifying stress-related genes, with markedly improved prediction accuracy. To experimentally validate the mlDNA predictions, we selected 89 candidates out of the 1784 predicted salt stress–related genes with available SALK T-DNA mutagenesis lines for phenotypic screening and identified two previously unreported genes, mutants of which showed salt-sensitive phenotypes. PMID:24520154

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks.

PubMed

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-Hoon

2017-05-22

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads.

Reaching the end of the line: Operational issues with implementing phone-based unannounced pill counts in resource-limited settings.

PubMed

Hirsch-Moverman, Yael; Burkot, Camilla; Saito, Suzue; Frederix, Koen; Pitt, Blanche; Melaku, Zenebe; Gadisa, Tsigereda; Howard, Andrea A

2017-01-01

Accurate measurement of adherence is necessary to ensure that therapeutic outcomes can be attributed to the recommended treatment. Phone-based unannounced pill counts were shown to be feasible and reliable measures of adherence in developed settings; and have been further used as part of medication adherence interventions. However, it is not clear whether this method can be implemented successfully in resource-limited settings, where cellular network and mobile phone coverage may be low. Our objective is to describe operational issues surrounding the use of phone-based unannounced pill counts in Lesotho and Ethiopia. Phone-based monthly unannounced pill counts, using an adaptation of a standardized protocol from previous US-based studies, were utilized to measure anti-TB and antiretroviral medication adherence in two implementation science studies in resource-limited settings, START (Lesotho) and ENRICH (Ethiopia). In START, 19.6% of calls were completed, with 71.9% of participants reached at least once; majority of failed call attempts were due to phones not being available (54.8%) or because participants were away from the pills (32.7%). In ENRICH, 33.5% of calls were completed, with 86.7% of participants reached at least once; the main reasons for failed call attempts were phones being switched off (31.5%), participants not answering (27.3%), participants' discomfort speaking on the phone (15.4%), and network problems (13.2%). Structural, facility-level, participant-level, and data collection challenges were encountered in these settings. Phone-based unannounced pill counts were found to be challenging, and response rates suboptimal. While some of these challenges were specific to local contexts, most of them are generalizable to resource-limited settings. In a research study context, a possible solution to ease operational challenges may be to focus phone-based unannounced pill count efforts on a randomly selected sample from participants who are provided with study phones and rigorously ensure that call attempts are made for these participants.

Fiber-channel audio video standard for military and commercial aircraft product lines

NASA Astrophysics Data System (ADS)

Keller, Jack E.

2002-08-01

Fibre channel is an emerging high-speed digital network technology that combines to make inroads into the avionics arena. The suitability of fibre channel for such applications is largely due to its flexibility in these key areas: Network topologies can be configured in point-to-point, arbitrated loop or switched fabric connections. The physical layer supports either copper or fiber optic implementations with a Bit Error Rate of less than 10-12. Multiple Classes of Service are available. Multiple Upper Level Protocols are supported. Multiple high speed data rates offer open ended growth paths providing speed negotiation within a single network. Current speeds supported by commercially available hardware are 1 and 2 Gbps providing effective data rates of 100 and 200 MBps respectively. Such networks lend themselves well to the transport of digital video and audio data. This paper summarizes an ANSI standard currently in the final approval cycle of the InterNational Committee for Information Technology Standardization (INCITS). This standard defines a flexible mechanism whereby digital video, audio and ancillary data are systematically packaged for transport over a fibre channel network. The basic mechanism, called a container, houses audio and video content functionally grouped as elements of the container called objects. Featured in this paper is a specific container mapping called Simple Parametric Digital Video (SPDV) developed particularly to address digital video in avionics systems. SPDV provides pixel-based video with associated ancillary data typically sourced by various sensors to be processed and/or distributed in the cockpit for presentation via high-resolution displays. Also highlighted in this paper is a streamlined Upper Level Protocol (ULP) called Frame Header Control Procedure (FHCP) targeted for avionics systems where the functionality of a more complex ULP is not required.

A new method for solving routing and wavelength assignment problems under inaccurate routing information in optical networks with conversion capability

NASA Astrophysics Data System (ADS)

Luo, Yanting; Zhang, Yongjun; Gu, Wanyi

2009-11-01

In large dynamic networks it is extremely difficult to maintain accurate routing information on all network nodes. The existing studies have illustrated the impact of imprecise state information on the performance of dynamic routing and wavelength assignment (RWA) algorithms. An algorithm called Bypass Based Optical Routing (BBOR) proposed by Xavier Masip-Bruin et al can reduce the effects of having inaccurate routing information in networks operating under the wavelength-continuity constraint. Then they extended the BBOR mechanism (for convenience it's called EBBOR mechanism below) to be applied to the networks with sparse and limited wavelength conversion. But it only considers the characteristic of wavelength conversion in the step of computing the bypass-paths so that its performance may decline with increasing the degree of wavelength translation (this concept will be explained in the section of introduction again). We will demonstrate the issue through theoretical analysis and introduce a novel algorithm which modifies both the lightpath selection and the bypass-paths computation in comparison to EBBOR algorithm. Simulations show that the Modified EBBOR (MEBBOR) algorithm improves the blocking performance significantly in optical networks with Conversion Capability.

Skeleton of weighted social network

NASA Astrophysics Data System (ADS)

Zhang, X.; Zhu, J.

2013-03-01

In the literature of social networks, understanding topological structure is an important scientific issue. In this paper, we construct a network from mobile phone call records and use the cumulative number of calls as a measure of the weight of a social tie. We extract skeletons from the weighted social network on the basis of the weights of ties, and we study their properties. We find that strong ties can support the skeleton in the network by studying the percolation characters. We explore the centrality of w-skeletons based on the correlation between some centrality measures and the skeleton index w of a vertex, and we find that the average centrality of a w-skeleton increases as w increases. We also study the cumulative degree distribution of the successive w-skeletons and find that as w increases, the w-skeleton tends to become more self-similar. Furthermore, fractal characteristics appear in higher w-skeletons. We also explore the global information diffusion efficiency of w-skeletons using simulations, from which we can see that the ties in the high w-skeletons play important roles in information diffusion. Identifying such a simple structure of a w-skeleton is a step forward toward understanding and representing the topological structure of weighted social networks.

Dynamic Tasking of Networked Sensors Using Covariance Information

DTIC Science & Technology

2010-09-01

has been created under an effort called TASMAN (Tasking Autonomous Sensors in a Multiple Application Network). One of the first studies utilizing this...environment was focused on a novel resource management approach, namely covariance-based tasking. Under this scheme, the state error covariance of...resident space objects (RSO), sensor characteristics, and sensor- target geometry were used to determine the effectiveness of future observations in

An evolutionary algorithm that constructs recurrent neural networks.

PubMed

Angeline, P J; Saunders, G M; Pollack, J B

1994-01-01

Standard methods for simultaneously inducing the structure and weights of recurrent neural networks limit every task to an assumed class of architectures. Such a simplification is necessary since the interactions between network structure and function are not well understood. Evolutionary computations, which include genetic algorithms and evolutionary programming, are population-based search methods that have shown promise in many similarly complex tasks. This paper argues that genetic algorithms are inappropriate for network acquisition and describes an evolutionary program, called GNARL, that simultaneously acquires both the structure and weights for recurrent networks. GNARL's empirical acquisition method allows for the emergence of complex behaviors and topologies that are potentially excluded by the artificial architectural constraints imposed in standard network induction methods.

A complex network-based importance measure for mechatronics systems

NASA Astrophysics Data System (ADS)

Wang, Yanhui; Bi, Lifeng; Lin, Shuai; Li, Man; Shi, Hao

2017-01-01

In view of the negative impact of functional dependency, this paper attempts to provide an alternative importance measure called Improved-PageRank (IPR) for measuring the importance of components in mechatronics systems. IPR is a meaningful extension of the centrality measures in complex network, which considers usage reliability of components and functional dependency between components to increase importance measures usefulness. Our work makes two important contributions. First, this paper integrates the literature of mechatronic architecture and complex networks theory to define component network. Second, based on the notion of component network, a meaningful IPR is brought into the identifying of important components. In addition, the IPR component importance measures, and an algorithm to perform stochastic ordering of components due to the time-varying nature of usage reliability of components and functional dependency between components, are illustrated with a component network of bogie system that consists of 27 components.

Method for Constructing Composite Response Surfaces by Combining Neural Networks with other Interpolation or Estimation Techniques

NASA Technical Reports Server (NTRS)

Rai, Man Mohan (Inventor); Madavan, Nateri K. (Inventor)

2003-01-01

A method and system for design optimization that incorporates the advantages of both traditional response surface methodology (RSM) and neural networks is disclosed. The present invention employs a unique strategy called parameter-based partitioning of the given design space. In the design procedure, a sequence of composite response surfaces based on both neural networks and polynomial fits is used to traverse the design space to identify an optimal solution. The composite response surface has both the power of neural networks and the economy of low-order polynomials (in terms of the number of simulations needed and the network training requirements). The present invention handles design problems with many more parameters than would be possible using neural networks alone and permits a designer to rapidly perform a variety of trade-off studies before arriving at the final design.

ABS-SmartComAgri: An Agent-Based Simulator of Smart Communication Protocols in Wireless Sensor Networks for Debugging in Precision Agriculture.

PubMed

García-Magariño, Iván; Lacuesta, Raquel; Lloret, Jaime

2018-03-27

Smart communication protocols are becoming a key mechanism for improving communication performance in networks such as wireless sensor networks. However, the literature lacks mechanisms for simulating smart communication protocols in precision agriculture for decreasing production costs. In this context, the current work presents an agent-based simulator of smart communication protocols for efficiently managing pesticides. The simulator considers the needs of electric power, crop health, percentage of alive bugs and pesticide consumption. The current approach is illustrated with three different communication protocols respectively called (a) broadcast, (b) neighbor and (c) low-cost neighbor. The low-cost neighbor protocol obtained a statistically-significant reduction in the need of electric power over the neighbor protocol, with a very large difference according to the common interpretations about the Cohen's d effect size. The presented simulator is called ABS-SmartComAgri and is freely distributed as open-source from a public research data repository. It ensures the reproducibility of experiments and allows other researchers to extend the current approach.

ABS-SmartComAgri: An Agent-Based Simulator of Smart Communication Protocols in Wireless Sensor Networks for Debugging in Precision Agriculture

PubMed Central

2018-01-01

Smart communication protocols are becoming a key mechanism for improving communication performance in networks such as wireless sensor networks. However, the literature lacks mechanisms for simulating smart communication protocols in precision agriculture for decreasing production costs. In this context, the current work presents an agent-based simulator of smart communication protocols for efficiently managing pesticides. The simulator considers the needs of electric power, crop health, percentage of alive bugs and pesticide consumption. The current approach is illustrated with three different communication protocols respectively called (a) broadcast, (b) neighbor and (c) low-cost neighbor. The low-cost neighbor protocol obtained a statistically-significant reduction in the need of electric power over the neighbor protocol, with a very large difference according to the common interpretations about the Cohen’s d effect size. The presented simulator is called ABS-SmartComAgri and is freely distributed as open-source from a public research data repository. It ensures the reproducibility of experiments and allows other researchers to extend the current approach. PMID:29584703

Wireless cellular networks with Pareto-distributed call holding times

NASA Astrophysics Data System (ADS)

Rodriguez-Dagnino, Ramon M.; Takagi, Hideaki

2001-07-01

Nowadays, there is a growing interest in providing internet to mobile users. For instance, NTT DoCoMo in Japan deploys an important mobile phone network with that offers the Internet service, named 'i-mode', to more than 17 million subscribers. Internet traffic measurements show that the session duration of Call Holding Time (CHT) has probability distributions with heavy-tails, which tells us that they depart significantly from the traffic statistics of traditional voice services. In this environment, it is particularly important to know the number of handovers during a call for a network designer to make an appropriate dimensioning of virtual circuits for a wireless cell. The handover traffic has a direct impact on the Quality of Service (QoS); e.g. the service disruption due to the handover failure may significantly degrade the specified QoS of time-constrained services. In this paper, we first study the random behavior of the number of handovers during a call, where we assume that the CHT are Pareto distributed (heavy-tail distribution), and the Cell Residence Times (CRT) are exponentially distributed. Our approach is based on renewal theory arguments. We present closed-form formulae for the probability mass function (pmf) of the number of handovers during a Pareto distributed CHT, and obtain the probability of call completion as well as handover rates. Most of the formulae are expressed in terms of the Whittaker's function. We compare the Pareto case with cases of $k(subscript Erlang and hyperexponential distributions for the CHT.

Characterization of essential proteins based on network topology in proteins interaction networks

NASA Astrophysics Data System (ADS)

Bakar, Sakhinah Abu; Taheri, Javid; Zomaya, Albert Y.

2014-06-01

The identification of essential proteins is theoretically and practically important as (1) it is essential to understand the minimal surviving requirements for cellular lives, and (2) it provides fundamental for development of drug. As conducting experimental studies to identify essential proteins are both time and resource consuming, here we present a computational approach in predicting them based on network topology properties from protein-protein interaction networks of Saccharomyces cerevisiae. The proposed method, namely EP3NN (Essential Proteins Prediction using Probabilistic Neural Network) employed a machine learning algorithm called Probabilistic Neural Network as a classifier to identify essential proteins of the organism of interest; it uses degree centrality, closeness centrality, local assortativity and local clustering coefficient of each protein in the network for such predictions. Results show that EP3NN managed to successfully predict essential proteins with an accuracy of 95% for our studied organism. Results also show that most of the essential proteins are close to other proteins, have assortativity behavior and form clusters/sub-graph in the network.

Similarity-based Regularized Latent Feature Model for Link Prediction in Bipartite Networks.

PubMed

Wang, Wenjun; Chen, Xue; Jiao, Pengfei; Jin, Di

2017-12-05

Link prediction is an attractive research topic in the field of data mining and has significant applications in improving performance of recommendation system and exploring evolving mechanisms of the complex networks. A variety of complex systems in real world should be abstractly represented as bipartite networks, in which there are two types of nodes and no links connect nodes of the same type. In this paper, we propose a framework for link prediction in bipartite networks by combining the similarity based structure and the latent feature model from a new perspective. The framework is called Similarity Regularized Nonnegative Matrix Factorization (SRNMF), which explicitly takes the local characteristics into consideration and encodes the geometrical information of the networks by constructing a similarity based matrix. We also develop an iterative scheme to solve the objective function based on gradient descent. Extensive experiments on a variety of real world bipartite networks show that the proposed framework of link prediction has a more competitive, preferable and stable performance in comparison with the state-of-art methods.

A Novel Distributed Privacy Paradigm for Visual Sensor Networks Based on Sharing Dynamical Systems

NASA Astrophysics Data System (ADS)

Luh, William; Kundur, Deepa; Zourntos, Takis

2006-12-01

Visual sensor networks (VSNs) provide surveillance images/video which must be protected from eavesdropping and tampering en route to the base station. In the spirit of sensor networks, we propose a novel paradigm for securing privacy and confidentiality in a distributed manner. Our paradigm is based on the control of dynamical systems, which we show is well suited for VSNs due to its low complexity in terms of processing and communication, while achieving robustness to both unintentional noise and intentional attacks as long as a small subset of nodes are affected. We also present a low complexity algorithm called TANGRAM to demonstrate the feasibility of applying our novel paradigm to VSNs. We present and discuss simulation results of TANGRAM.

Autonomous Congestion Control in Delay-Tolerant Networks

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.; Jennings, Esther H.

2005-01-01

Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively in the Internet, the solutions for Internet congestion control do not apply readily to challenged network environments such as Delay Tolerant Networks (DTN) where end-to-end connectivity may not exist continuously and latency can be high. In DTN, end-to-end rate control is not feasible. This calls for congestion control mechanisms where the decisions can be made autonomously with local information only. We use an economic pricing model and propose a rule-based congestion control mechanism where each router can autonomously decide on whether to accept a bundle (data) based on local information such as available storage and the value and risk of accepting the bundle (derived from historical statistics).

Where-Fi: a dynamic energy-efficient multimedia distribution framework for MANETs

NASA Astrophysics Data System (ADS)

Mohapatra, Shivajit; Carbunar, Bogdan; Pearce, Michael; Chaudhri, Rohit; Vasudevan, Venu

2008-01-01

Next generation mobile ad-hoc applications will revolve around users' need for sharing content/presence information with co-located devices. However, keeping such information fresh requires frequent meta-data exchanges, which could result in significant energy overheads. To address this issue, we propose distributed algorithms for energy efficient dissemination of presence and content usage information between nodes in mobile ad-hoc networks. First, we introduce a content dissemination protocol (called CPMP) for effectively distributing frequent small meta-data updates between co-located devices using multicast. We then develop two distributed algorithms that use the CPMP protocol to achieve "phase locked" wake up cycles for all the participating nodes in the network. The first algorithm is designed for fully-connected networks and then extended in the second to handle hidden terminals. The "phase locked" schedules are then exploited to adaptively transition the network interface to a deep sleep state for energy savings. We have implemented a prototype system (called "Where-Fi") on several Motorola Linux-based cell phone models. Our experimental results show that for all network topologies our algorithms were able to achieve "phase locking" between nodes even in the presence of hidden terminals. Moreover, we achieved battery lifetime extensions of as much as 28% for fully connected networks and about 20% for partially connected networks.

Exploration of cellular reaction systems.

PubMed

Kirkilionis, Markus

2010-01-01

We discuss and review different ways to map cellular components and their temporal interaction with other such components to different non-spatially explicit mathematical models. The essential choices made in the literature are between discrete and continuous state spaces, between rule and event-based state updates and between deterministic and stochastic series of such updates. The temporal modelling of cellular regulatory networks (dynamic network theory) is compared with static network approaches in two first introductory sections on general network modelling. We concentrate next on deterministic rate-based dynamic regulatory networks and their derivation. In the derivation, we include methods from multiscale analysis and also look at structured large particles, here called macromolecular machines. It is clear that mass-action systems and their derivatives, i.e. networks based on enzyme kinetics, play the most dominant role in the literature. The tools to analyse cellular reaction networks are without doubt most complete for mass-action systems. We devote a long section at the end of the review to make a comprehensive review of related tools and mathematical methods. The emphasis is to show how cellular reaction networks can be analysed with the help of different associated graphs and the dissection into modules, i.e. sub-networks.

Link predication based on matrix factorization by fusion of multi class organizations of the network.

PubMed

Jiao, Pengfei; Cai, Fei; Feng, Yiding; Wang, Wenjun

2017-08-21

Link predication aims at forecasting the latent or unobserved edges in the complex networks and has a wide range of applications in reality. Almost existing methods and models only take advantage of one class organization of the networks, which always lose important information hidden in other organizations of the network. In this paper, we propose a link predication framework which makes the best of the structure of networks in different level of organizations based on nonnegative matrix factorization, which is called NMF 3 here. We first map the observed network into another space by kernel functions, which could get the different order organizations. Then we combine the adjacency matrix of the network with one of other organizations, which makes us obtain the objective function of our framework for link predication based on the nonnegative matrix factorization. Third, we derive an iterative algorithm to optimize the objective function, which converges to a local optimum, and we propose a fast optimization strategy for large networks. Lastly, we test the proposed framework based on two kernel functions on a series of real world networks under different sizes of training set, and the experimental results show the feasibility, effectiveness, and competitiveness of the proposed framework.

Cascaded neural networks for sequenced propagation estimation, multiuser detection, and adaptive radio resource control of third-generation wireless networks for multimedia services

NASA Astrophysics Data System (ADS)

Hortos, William S.

1999-03-01

A hybrid neural network approach is presented to estimate radio propagation characteristics and multiuser interference and to evaluate their combined impact on throughput, latency and information loss in third-generation (3G) wireless networks. The latter three performance parameters influence the quality of service (QoS) for multimedia services under consideration for 3G networks. These networks, based on a hierarchical architecture of overlaying macrocells on top of micro- and picocells, are planned to operate in mobile urban and indoor environments with service demands emanating from circuit-switched, packet-switched and satellite-based traffic sources. Candidate radio interfaces for these networks employ a form of wideband CDMA in 5-MHz and wider-bandwidth channels, with possible asynchronous operation of the mobile subscribers. The proposed neural network (NN) architecture allocates network resources to optimize QoS metrics. Parameters of the radio propagation channel are estimated, followed by control of an adaptive antenna array at the base station to minimize interference, and then joint multiuser detection is performed at the base station receiver. These adaptive processing stages are implemented as a sequence of NN techniques that provide their estimates as inputs to a final- stage Kohonen self-organizing feature map (SOFM). The SOFM optimizes the allocation of available network resources to satisfy QoS requirements for variable-rate voice, data and video services. As the first stage of the sequence, a modified feed-forward multilayer perceptron NN is trained on the pilot signals of the mobile subscribers to estimate the parameters of shadowing, multipath fading and delays on the uplinks. A recurrent NN (RNN) forms the second stage to control base stations' adaptive antenna arrays to minimize intra-cell interference. The third stage is based on a Hopfield NN (HNN), modified to detect multiple users on the uplink radio channels to mitigate multiaccess interference, control carrier-sense multiple-access (CSMA) protocols, and refine call handoff procedures. In the final stage, the Kohonen SOFM, operating in a hybrid continuous and discrete space, adaptively allocates the resources of antenna-based cell sectorization, activity monitoring, variable-rate coding, power control, handoff and caller admission to meet user demands for various multimedia services at minimum QoS levels. The performance of the NN cascade is evaluated through simulation of a candidate 3G wireless network using W-CDMA parameters in a small-cell environment. The simulated network consists of a representative number of cells. Mobile users with typical movement patterns are assumed. QoS requirements for different classes of multimedia services are considered. The proposed method is shown to provide relatively low probability of new call blocking and handoff dropping, while maintaining efficient use of the network's radio resources.

A Hybrid Spectral Clustering and Deep Neural Network Ensemble Algorithm for Intrusion Detection in Sensor Networks

PubMed Central

Ma, Tao; Wang, Fen; Cheng, Jianjun; Yu, Yang; Chen, Xiaoyun

2016-01-01

The development of intrusion detection systems (IDS) that are adapted to allow routers and network defence systems to detect malicious network traffic disguised as network protocols or normal access is a critical challenge. This paper proposes a novel approach called SCDNN, which combines spectral clustering (SC) and deep neural network (DNN) algorithms. First, the dataset is divided into k subsets based on sample similarity using cluster centres, as in SC. Next, the distance between data points in a testing set and the training set is measured based on similarity features and is fed into the deep neural network algorithm for intrusion detection. Six KDD-Cup99 and NSL-KDD datasets and a sensor network dataset were employed to test the performance of the model. These experimental results indicate that the SCDNN classifier not only performs better than backpropagation neural network (BPNN), support vector machine (SVM), random forest (RF) and Bayes tree models in detection accuracy and the types of abnormal attacks found. It also provides an effective tool of study and analysis of intrusion detection in large networks. PMID:27754380

A Hybrid Spectral Clustering and Deep Neural Network Ensemble Algorithm for Intrusion Detection in Sensor Networks.

PubMed

Ma, Tao; Wang, Fen; Cheng, Jianjun; Yu, Yang; Chen, Xiaoyun

2016-10-13

The development of intrusion detection systems (IDS) that are adapted to allow routers and network defence systems to detect malicious network traffic disguised as network protocols or normal access is a critical challenge. This paper proposes a novel approach called SCDNN, which combines spectral clustering (SC) and deep neural network (DNN) algorithms. First, the dataset is divided into k subsets based on sample similarity using cluster centres, as in SC. Next, the distance between data points in a testing set and the training set is measured based on similarity features and is fed into the deep neural network algorithm for intrusion detection. Six KDD-Cup99 and NSL-KDD datasets and a sensor network dataset were employed to test the performance of the model. These experimental results indicate that the SCDNN classifier not only performs better than backpropagation neural network (BPNN), support vector machine (SVM), random forest (RF) and Bayes tree models in detection accuracy and the types of abnormal attacks found. It also provides an effective tool of study and analysis of intrusion detection in large networks.

Functionality, Complexity, and Approaches to Assessment of Resilience Under Constrained Energy and Information

DTIC Science & Technology

2015-03-26

albeit powerful , method available for exploring CAS. As discussed above, there are many useful mathematical tools appropriate for CAS modeling. Agent-based...cells, tele- phone calls, and sexual contacts approach power -law distributions. [48] Networks in general are robust against random failures, but...targeted failures can have powerful effects – provided the targeter has a good understanding of the network structure. Some argue (convincingly) that all

Growing toward the Sun: How the Good-Food Movement Catapulted a Small New York City Third-Sector Organization into Rapid Growth, Success, and Many Challenges

ERIC Educational Resources Information Center

Hutchinson, Carole L.

2013-01-01

This dissertation is an ethnographic study of a New York City-based third-sector organization focused on what it calls "food justice." This study concentrates on how this organization, that I call Food Rights, has built a broad multi-sector network made up of a varied set of constituents and collaborators aiming to develop and promote an…

Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm

NASA Astrophysics Data System (ADS)

Dutta, S.; Patra, D.; Shankar, H.; Alok Verma, P.

2014-11-01

minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim's algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it's minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several cities optimally or connecting all cities with minimum total road length.

Using Virtual Social Networks for Case Finding in Clinical Studies: An Experiment from Adolescence, Brain, Cognition, and Diabetes Study.

PubMed

Pourabbasi, Ata; Farzami, Jalal; Shirvani, Mahbubeh-Sadat Ebrahimnegad; Shams, Amir Hossein; Larijani, Bagher

2017-01-01

One of the main usages of social networks in clinical studies is facilitating the process of sampling and case finding for scientists. The main focus of this study is on comparing two different methods of sampling through phone calls and using social network, for study purposes. One of the researchers started calling 214 families of children with diabetes during 90 days. After this period, phone calls stopped, and the team started communicating with families through telegram, a virtual social network for 30 days. The number of children who participated in the study was evaluated. Although the telegram method was 60 days shorter than the phone call method, researchers found that the number of participants from telegram (17.6%) did not have any significant differences compared with the ones being phone called (12.9%). Using social networks can be suggested as a beneficial method for local researchers who look for easier sampling methods, winning their samples' trust, following up with the procedure, and an easy-access database.

Network security system for health and medical information using smart IC card

NASA Astrophysics Data System (ADS)

Kanai, Yoichi; Yachida, Masuyoshi; Yoshikawa, Hiroharu; Yamaguchi, Masahiro; Ohyama, Nagaaki

1998-07-01

A new network security protocol that uses smart IC cards has been designed to assure the integrity and privacy of medical information in communication over a non-secure network. Secure communication software has been implemented as a library based on this protocol, which is called the Integrated Secure Communication Layer (ISCL), and has been incorporated into information systems of the National Cancer Center Hospitals and the Health Service Center of the Tokyo Institute of Technology. Both systems have succeeded in communicating digital medical information securely.

Group Centric Networking: A new Approach for Wireless Multi-Hop Networking to Enable the Internet of Things

DTIC Science & Technology

2015-11-11

reliable data message delivery. The basic mechanism of link-based routing schemes is the broadcasting of a control message (called a “ hello ”) to all of its...short- est path route to a destination by using the set of ex- changed hello messages between users of the network. With sufficiently high frequency... hello messages are suc- cessfully exchanged across a high error link, and since this link is of longer distance, it gets used to build a shortest path

Group Centric Networking: A new Approach for Wireless Multi-Hop Networking to Enable the Internet of Things

DTIC Science & Technology

2015-09-07

reliable data message delivery. The basic mechanism of link-based routing schemes is the broadcasting of a control message (called a “ hello ”) to all of its...short- est path route to a destination by using the set of ex- changed hello messages between users of the network. With sufficiently high frequency... hello messages are suc- cessfully exchanged across a high error link, and since this link is of longer distance, it gets used to build a shortest path

Location and Size Planning of Distributed Photovoltaic Generation in Distribution network System Based on K-means Clustering Analysis

NASA Astrophysics Data System (ADS)

Lu, Siqi; Wang, Xiaorong; Wu, Junyong

2018-01-01

The paper presents a method to generate the planning scenarios, which is based on K-means clustering analysis algorithm driven by data, for the location and size planning of distributed photovoltaic (PV) units in the network. Taken the power losses of the network, the installation and maintenance costs of distributed PV, the profit of distributed PV and the voltage offset as objectives and the locations and sizes of distributed PV as decision variables, Pareto optimal front is obtained through the self-adaptive genetic algorithm (GA) and solutions are ranked by a method called technique for order preference by similarity to an ideal solution (TOPSIS). Finally, select the planning schemes at the top of the ranking list based on different planning emphasis after the analysis in detail. The proposed method is applied to a 10-kV distribution network in Gansu Province, China and the results are discussed.

An inter-networking mechanism with stepwise synchronization for wireless sensor networks.

PubMed

Yamamoto, Hiroshi; Wakamiya, Naoki; Murata, Masayuki

2011-01-01

To realize the ambient information society, multiple wireless networks deployed in the region and devices carried by users are required to cooperate with each other. Since duty cycles and operational frequencies are different among networks, we need a mechanism to allow networks to efficiently exchange messages. For this purpose, we propose a novel inter-networking mechanism where two networks are synchronized with each other in a moderate manner, which we call stepwise synchronization. With our proposal, to bridge the gap between intrinsic operational frequencies, nodes near the border of networks adjust their operational frequencies in a stepwise fashion based on the pulse-coupled oscillator model as a fundamental theory of synchronization. Through simulation experiments, we show that the communication delay and the energy consumption of border nodes are reduced, which enables wireless sensor networks to communicate longer with each other.

Why KIPP Is Not Corporate: KIPP and Social Justice

ERIC Educational Resources Information Center

Maranto, Robert; Ritter, Gary

2014-01-01

Critics see the Knowledge Is Power Program (KIPP), a network of 141 charter schools, as part of the corporate based school reform movement (e.g., Horn, 2011; Grey, 2011), a view shared by many traditional public school educators. So-called corporate based school reform strategies allegedly exploit students and teachers, employ very narrow metrics…

Performance Evaluation of Hyperbolic Position Location Technique in Cellular Wireless Networks

DTIC Science & Technology

2002-03-13

number of applications called location - based services which can be defined as value added services that utilize the knowledge of the mobile user’s... Location based services “4-1-1”, location specific information such as local weather, mobile yellow pages, etc. and • Mobile e-commerce, wireless

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

PubMed Central

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-hoon

2017-01-01

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads. PMID:28531159

A study of structural properties of gene network graphs for mathematical modeling of integrated mosaic gene networks.

PubMed

Petrovskaya, Olga V; Petrovskiy, Evgeny D; Lavrik, Inna N; Ivanisenko, Vladimir A

2017-04-01

Gene network modeling is one of the widely used approaches in systems biology. It allows for the study of complex genetic systems function, including so-called mosaic gene networks, which consist of functionally interacting subnetworks. We conducted a study of a mosaic gene networks modeling method based on integration of models of gene subnetworks by linear control functionals. An automatic modeling of 10,000 synthetic mosaic gene regulatory networks was carried out using computer experiments on gene knockdowns/knockouts. Structural analysis of graphs of generated mosaic gene regulatory networks has revealed that the most important factor for building accurate integrated mathematical models, among those analyzed in the study, is data on expression of genes corresponding to the vertices with high properties of centrality.

Enhanced Communication Network Solution for Positive Train Control Implementation

NASA Technical Reports Server (NTRS)

Fatehi, M. T.; Simon, J.; Chang, W.; Chow, E. T.; Burleigh, S. C.

2011-01-01

The commuter and freight railroad industry is required to implement Positive Train Control (PTC) by 2015 (2012 for Metrolink), a challenging network communications problem. This paper will discuss present technologies developed by the National Aeronautics and Space Administration (NASA) to overcome comparable communication challenges encountered in deep space mission operations. PTC will be based on a new cellular wireless packet Internet Protocol (IP) network. However, ensuring reliability in such a network is difficult due to the "dead zones" and transient disruptions we commonly experience when we lose calls in commercial cellular networks. These disruptions make it difficult to meet PTC s stringent reliability (99.999%) and safety requirements, deployment deadlines, and budget. This paper proposes innovative solutions based on space-proven technologies that would help meet these challenges: (1) Delay Tolerant Networking (DTN) technology, designed for use in resource-constrained, embedded systems and currently in use on the International Space Station, enables reliable communication over networks in which timely data acknowledgments might not be possible due to transient link outages. (2) Policy-Based Management (PBM) provides dynamic management capabilities, allowing vital data to be exchanged selectively (with priority) by utilizing alternative communication resources. The resulting network may help railroads implement PTC faster, cheaper, and more reliably.

Advances in the mechanical modeling of filamentous actin and its cross-linked networks on multiple scales.

PubMed

Unterberger, Michael J; Holzapfel, Gerhard A

2014-11-01

The protein actin is a part of the cytoskeleton and, therefore, responsible for the mechanical properties of the cells. Starting with the single molecule up to the final structure, actin creates a hierarchical structure of several levels exhibiting a remarkable behavior. The hierarchy spans several length scales and limitations in computational power; therefore, there is a call for different mechanical modeling approaches for the different scales. On the molecular level, we may consider each atom in molecular dynamics simulations. Actin forms filaments by combining the molecules into a double helix. In a model, we replace molecular subdomains using coarse-graining methods, allowing the investigation of larger systems of several atoms. These models on the nanoscale inform continuum mechanical models of large filaments, which are based on worm-like chain models for polymers. Assemblies of actin filaments are connected with cross-linker proteins. Models with discrete filaments, so-called Mikado models, allow us to investigate the dependence of the properties of networks on the parameters of the constituents. Microstructurally motivated continuum models of the networks provide insights into larger systems containing cross-linked actin networks. Modeling of such systems helps to gain insight into the processes on such small scales. On the other hand, they call for verification and hence trigger the improvement of established experiments and the development of new methods.

Autonomous Congestion Control in Delay-Tolerant Networks

NASA Technical Reports Server (NTRS)

Burleigh, Scott; Jennings, Esther; Schoolcraft, Joshua

2006-01-01

Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively in the Internet, the solutions for Internet congestion control do not apply readily to challenged network environments such as Delay Tolerant Networks (DTN) where end-to-end connectivity may not exist continuously and latency can be high. In DTN, end-to-end rate control is not feasible. This calls for congestion control mechanisms where the decisions can be made autonomously with local information only. We use an economic pricing model and propose a rule-based congestion control mechanism where each router can autonomously decide on whether to accept a bundle (data) based on local information such as available storage and the value and risk of accepting the bundle (derived from historical statistics). Preliminary experimental results show that this congestion control mechanism can protect routers from resource depletion without loss of data.

Predicting neural network firing pattern from phase resetting curve

NASA Astrophysics Data System (ADS)

Oprisan, Sorinel; Oprisan, Ana

2007-04-01

Autonomous neural networks called central pattern generators (CPG) are composed of endogenously bursting neurons and produce rhythmic activities, such as flying, swimming, walking, chewing, etc. Simplified CPGs for quadrupedal locomotion and swimming are modeled by a ring of neural oscillators such that the output of one oscillator constitutes the input for the subsequent neural oscillator. The phase response curve (PRC) theory discards the detailed conductance-based description of the component neurons of a network and reduces them to ``black boxes'' characterized by a transfer function, which tabulates the transient change in the intrinsic period of a neural oscillator subject to external stimuli. Based on open-loop PRC, we were able to successfully predict the phase-locked period and relative phase between neurons in a half-center network. We derived existence and stability criteria for heterogeneous ring neural networks that are in good agreement with experimental data.

Impulse Noise Cancellation of Medical Images Using Wavelet Networks and Median Filters

PubMed Central

Sadri, Amir Reza; Zekri, Maryam; Sadri, Saeid; Gheissari, Niloofar

2012-01-01

This paper presents a new two-stage approach to impulse noise removal for medical images based on wavelet network (WN). The first step is noise detection, in which the so-called gray-level difference and average background difference are considered as the inputs of a WN. Wavelet Network is used as a preprocessing for the second stage. The second step is removing impulse noise with a median filter. The wavelet network presented here is a fixed one without learning. Experimental results show that our method acts on impulse noise effectively, and at the same time preserves chromaticity and image details very well. PMID:23493998

Dynamic Hop Service Differentiation Model for End-to-End QoS Provisioning in Multi-Hop Wireless Networks

NASA Astrophysics Data System (ADS)

Youn, Joo-Sang; Seok, Seung-Joon; Kang, Chul-Hee

This paper presents a new QoS model for end-to-end service provisioning in multi-hop wireless networks. In legacy IEEE 802.11e based multi-hop wireless networks, the fixed assignment of service classes according to flow's priority at every node causes priority inversion problem when performing end-to-end service differentiation. Thus, this paper proposes a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD) to alleviate the problem and support effective service differentiation between end-to-end nodes. Many previous works for QoS model through the 802.11e based service differentiation focus on packet scheduling on several service queues with different service rate and service priority. Our model, however, concentrates on a dynamic class selection scheme, called Per Hop Class Assignment (PHCA), in the node's MAC layer, which selects a proper service class for each packet, in accordance with queue states and service requirement, in every node along the end-to-end route of the packet. The proposed QoS solution is evaluated using the OPNET simulator. The simulation results show that the proposed model outperforms both best-effort and 802.11e based strict priority service models in mobile ad hoc environments.

Complex Rotation Quantum Dynamic Neural Networks (CRQDNN) using Complex Quantum Neuron (CQN): Applications to time series prediction.

PubMed

Cui, Yiqian; Shi, Junyou; Wang, Zili

2015-11-01

Quantum Neural Networks (QNN) models have attracted great attention since it innovates a new neural computing manner based on quantum entanglement. However, the existing QNN models are mainly based on the real quantum operations, and the potential of quantum entanglement is not fully exploited. In this paper, we proposes a novel quantum neuron model called Complex Quantum Neuron (CQN) that realizes a deep quantum entanglement. Also, a novel hybrid networks model Complex Rotation Quantum Dynamic Neural Networks (CRQDNN) is proposed based on Complex Quantum Neuron (CQN). CRQDNN is a three layer model with both CQN and classical neurons. An infinite impulse response (IIR) filter is embedded in the Networks model to enable the memory function to process time series inputs. The Levenberg-Marquardt (LM) algorithm is used for fast parameter learning. The networks model is developed to conduct time series predictions. Two application studies are done in this paper, including the chaotic time series prediction and electronic remaining useful life (RUL) prediction. Copyright © 2015 Elsevier Ltd. All rights reserved.

Autoblocker: a system for detecting and blocking of network scanning based on analysis of netflow data

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bobyshev, A.; Lamore, D.; Demar, P.

2004-12-01

In a large campus network, such at Fermilab, with tens of thousands of nodes, scanning initiated from either outside of or within the campus network raises security concerns. This scanning may have very serious impact on network performance, and even disrupt normal operation of many services. In this paper we introduce a system for detecting and automatic blocking excessive traffic of different kinds of scanning, DoS attacks, virus infected computers. The system, called AutoBlocker, is a distributed computing system based on quasi-real time analysis of network flow data collected from the border router and core switches. AutoBlocker also has anmore » interface to accept alerts from IDS systems (e.g. BRO, SNORT) that are based on other technologies. The system has multiple configurable alert levels for the detection of anomalous behavior and configurable trigger criteria for automated blocking of scans at the core or border routers. It has been in use at Fermilab for about 2 years, and has become a very valuable tool to curtail scan activity within the Fermilab campus network.« less

Machine-Learning Based Channel Quality and Stability Estimation for Stream-Based Multichannel Wireless Sensor Networks.

PubMed

Rehan, Waqas; Fischer, Stefan; Rehan, Maaz

2016-09-12

Wireless sensor networks (WSNs) have become more and more diversified and are today able to also support high data rate applications, such as multimedia. In this case, per-packet channel handshaking/switching may result in inducing additional overheads, such as energy consumption, delays and, therefore, data loss. One of the solutions is to perform stream-based channel allocation where channel handshaking is performed once before transmitting the whole data stream. Deciding stream-based channel allocation is more critical in case of multichannel WSNs where channels of different quality/stability are available and the wish for high performance requires sensor nodes to switch to the best among the available channels. In this work, we will focus on devising mechanisms that perform channel quality/stability estimation in order to improve the accommodation of stream-based communication in multichannel wireless sensor networks. For performing channel quality assessment, we have formulated a composite metric, which we call channel rank measurement (CRM), that can demarcate channels into good, intermediate and bad quality on the basis of the standard deviation of the received signal strength indicator (RSSI) and the average of the link quality indicator (LQI) of the received packets. CRM is then used to generate a data set for training a supervised machine learning-based algorithm (which we call Normal Equation based Channel quality prediction (NEC) algorithm) in such a way that it may perform instantaneous channel rank estimation of any channel. Subsequently, two robust extensions of the NEC algorithm are proposed (which we call Normal Equation based Weighted Moving Average Channel quality prediction (NEWMAC) algorithm and Normal Equation based Aggregate Maturity Criteria with Beta Tracking based Channel weight prediction (NEAMCBTC) algorithm), that can perform channel quality estimation on the basis of both current and past values of channel rank estimation. In the end, simulations are made using MATLAB, and the results show that the Extended version of NEAMCBTC algorithm (Ext-NEAMCBTC) outperforms the compared techniques in terms of channel quality and stability assessment. It also minimizes channel switching overheads (in terms of switching delays and energy consumption) for accommodating stream-based communication in multichannel WSNs.

Machine-Learning Based Channel Quality and Stability Estimation for Stream-Based Multichannel Wireless Sensor Networks

PubMed Central

Rehan, Waqas; Fischer, Stefan; Rehan, Maaz

2016-01-01

Wireless sensor networks (WSNs) have become more and more diversified and are today able to also support high data rate applications, such as multimedia. In this case, per-packet channel handshaking/switching may result in inducing additional overheads, such as energy consumption, delays and, therefore, data loss. One of the solutions is to perform stream-based channel allocation where channel handshaking is performed once before transmitting the whole data stream. Deciding stream-based channel allocation is more critical in case of multichannel WSNs where channels of different quality/stability are available and the wish for high performance requires sensor nodes to switch to the best among the available channels. In this work, we will focus on devising mechanisms that perform channel quality/stability estimation in order to improve the accommodation of stream-based communication in multichannel wireless sensor networks. For performing channel quality assessment, we have formulated a composite metric, which we call channel rank measurement (CRM), that can demarcate channels into good, intermediate and bad quality on the basis of the standard deviation of the received signal strength indicator (RSSI) and the average of the link quality indicator (LQI) of the received packets. CRM is then used to generate a data set for training a supervised machine learning-based algorithm (which we call Normal Equation based Channel quality prediction (NEC) algorithm) in such a way that it may perform instantaneous channel rank estimation of any channel. Subsequently, two robust extensions of the NEC algorithm are proposed (which we call Normal Equation based Weighted Moving Average Channel quality prediction (NEWMAC) algorithm and Normal Equation based Aggregate Maturity Criteria with Beta Tracking based Channel weight prediction (NEAMCBTC) algorithm), that can perform channel quality estimation on the basis of both current and past values of channel rank estimation. In the end, simulations are made using MATLAB, and the results show that the Extended version of NEAMCBTC algorithm (Ext-NEAMCBTC) outperforms the compared techniques in terms of channel quality and stability assessment. It also minimizes channel switching overheads (in terms of switching delays and energy consumption) for accommodating stream-based communication in multichannel WSNs. PMID:27626429

optGpSampler: an improved tool for uniformly sampling the solution-space of genome-scale metabolic networks.

PubMed

Megchelenbrink, Wout; Huynen, Martijn; Marchiori, Elena

2014-01-01

Constraint-based models of metabolic networks are typically underdetermined, because they contain more reactions than metabolites. Therefore the solutions to this system do not consist of unique flux rates for each reaction, but rather a space of possible flux rates. By uniformly sampling this space, an estimated probability distribution for each reaction's flux in the network can be obtained. However, sampling a high dimensional network is time-consuming. Furthermore, the constraints imposed on the network give rise to an irregularly shaped solution space. Therefore more tailored, efficient sampling methods are needed. We propose an efficient sampling algorithm (called optGpSampler), which implements the Artificial Centering Hit-and-Run algorithm in a different manner than the sampling algorithm implemented in the COBRA Toolbox for metabolic network analysis, here called gpSampler. Results of extensive experiments on different genome-scale metabolic networks show that optGpSampler is up to 40 times faster than gpSampler. Application of existing convergence diagnostics on small network reconstructions indicate that optGpSampler converges roughly ten times faster than gpSampler towards similar sampling distributions. For networks of higher dimension (i.e. containing more than 500 reactions), we observed significantly better convergence of optGpSampler and a large deviation between the samples generated by the two algorithms. optGpSampler for Matlab and Python is available for non-commercial use at: http://cs.ru.nl/~wmegchel/optGpSampler/.

Inferring nonlinear gene regulatory networks from gene expression data based on distance correlation.

PubMed

Guo, Xiaobo; Zhang, Ye; Hu, Wenhao; Tan, Haizhu; Wang, Xueqin

2014-01-01

Nonlinear dependence is general in regulation mechanism of gene regulatory networks (GRNs). It is vital to properly measure or test nonlinear dependence from real data for reconstructing GRNs and understanding the complex regulatory mechanisms within the cellular system. A recently developed measurement called the distance correlation (DC) has been shown powerful and computationally effective in nonlinear dependence for many situations. In this work, we incorporate the DC into inferring GRNs from the gene expression data without any underling distribution assumptions. We propose three DC-based GRNs inference algorithms: CLR-DC, MRNET-DC and REL-DC, and then compare them with the mutual information (MI)-based algorithms by analyzing two simulated data: benchmark GRNs from the DREAM challenge and GRNs generated by SynTReN network generator, and an experimentally determined SOS DNA repair network in Escherichia coli. According to both the receiver operator characteristic (ROC) curve and the precision-recall (PR) curve, our proposed algorithms significantly outperform the MI-based algorithms in GRNs inference.

Inferring Nonlinear Gene Regulatory Networks from Gene Expression Data Based on Distance Correlation

PubMed Central

Guo, Xiaobo; Zhang, Ye; Hu, Wenhao; Tan, Haizhu; Wang, Xueqin

2014-01-01

Nonlinear dependence is general in regulation mechanism of gene regulatory networks (GRNs). It is vital to properly measure or test nonlinear dependence from real data for reconstructing GRNs and understanding the complex regulatory mechanisms within the cellular system. A recently developed measurement called the distance correlation (DC) has been shown powerful and computationally effective in nonlinear dependence for many situations. In this work, we incorporate the DC into inferring GRNs from the gene expression data without any underling distribution assumptions. We propose three DC-based GRNs inference algorithms: CLR-DC, MRNET-DC and REL-DC, and then compare them with the mutual information (MI)-based algorithms by analyzing two simulated data: benchmark GRNs from the DREAM challenge and GRNs generated by SynTReN network generator, and an experimentally determined SOS DNA repair network in Escherichia coli. According to both the receiver operator characteristic (ROC) curve and the precision-recall (PR) curve, our proposed algorithms significantly outperform the MI-based algorithms in GRNs inference. PMID:24551058

Federated software defined network operations for LHC experiments

NASA Astrophysics Data System (ADS)

Kim, Dongkyun; Byeon, Okhwan; Cho, Kihyeon

2013-09-01

The most well-known high-energy physics collaboration, the Large Hadron Collider (LHC), which is based on e-Science, has been facing several challenges presented by its extraordinary instruments in terms of the generation, distribution, and analysis of large amounts of scientific data. Currently, data distribution issues are being resolved by adopting an advanced Internet technology called software defined networking (SDN). Stability of the SDN operations and management is demanded to keep the federated LHC data distribution networks reliable. Therefore, in this paper, an SDN operation architecture based on the distributed virtual network operations center (DvNOC) is proposed to enable LHC researchers to assume full control of their own global end-to-end data dissemination. This may achieve an enhanced data delivery performance based on data traffic offloading with delay variation. The evaluation results indicate that the overall end-to-end data delivery performance can be improved over multi-domain SDN environments based on the proposed federated SDN/DvNOC operation framework.

Resonance Energy Transfer-Based Molecular Switch Designed Using a Systematic Design Process Based on Monte Carlo Methods and Markov Chains

NASA Astrophysics Data System (ADS)

Rallapalli, Arjun

A RET network consists of a network of photo-active molecules called chromophores that can participate in inter-molecular energy transfer called resonance energy transfer (RET). RET networks are used in a variety of applications including cryptographic devices, storage systems, light harvesting complexes, biological sensors, and molecular rulers. In this dissertation, we focus on creating a RET device called closed-diffusive exciton valve (C-DEV) in which the input to output transfer function is controlled by an external energy source, similar to a semiconductor transistor like the MOSFET. Due to their biocompatibility, molecular devices like the C-DEVs can be used to introduce computing power in biological, organic, and aqueous environments such as living cells. Furthermore, the underlying physics in RET devices are stochastic in nature, making them suitable for stochastic computing in which true random distribution generation is critical. In order to determine a valid configuration of chromophores for the C-DEV, we developed a systematic process based on user-guided design space pruning techniques and built-in simulation tools. We show that our C-DEV is 15x better than C-DEVs designed using ad hoc methods that rely on limited data from prior experiments. We also show ways in which the C-DEV can be improved further and how different varieties of C-DEVs can be combined to form more complex logic circuits. Moreover, the systematic design process can be used to search for valid chromophore network configurations for a variety of RET applications. We also describe a feasibility study for a technique used to control the orientation of chromophores attached to DNA. Being able to control the orientation can expand the design space for RET networks because it provides another parameter to tune their collective behavior. While results showed limited control over orientation, the analysis required the development of a mathematical model that can be used to determine the distribution of dipoles in a given sample of chromophore constructs. The model can be used to evaluate the feasibility of other potential orientation control techniques.

PANATIKI: A Network Access Control Implementation Based on PANA for IoT Devices

PubMed Central

Sanchez, Pedro Moreno; Lopez, Rafa Marin; Gomez Skarmeta, Antonio F.

2013-01-01

Internet of Things (IoT) networks are the pillar of recent novel scenarios, such as smart cities or e-healthcare applications. Among other challenges, these networks cover the deployment and interaction of small devices with constrained capabilities and Internet protocol (IP)-based networking connectivity. These constrained devices usually require connection to the Internet to exchange information (e.g., management or sensing data) or access network services. However, only authenticated and authorized devices can, in general, establish this connection. The so-called authentication, authorization and accounting (AAA) services are in charge of performing these tasks on the Internet. Thus, it is necessary to deploy protocols that allow constrained devices to verify their credentials against AAA infrastructures. The Protocol for Carrying Authentication for Network Access (PANA) has been standardized by the Internet engineering task force (IETF) to carry the Extensible Authentication Protocol (EAP), which provides flexible authentication upon the presence of AAA. To the best of our knowledge, this paper is the first deep study of the feasibility of EAP/PANA for network access control in constrained devices. We provide light-weight versions and implementations of these protocols to fit them into constrained devices. These versions have been designed to reduce the impact in standard specifications. The goal of this work is two-fold: (1) to demonstrate the feasibility of EAP/PANA in IoT devices; (2) to provide the scientific community with the first light-weight interoperable implementation of EAP/PANA for constrained devices in the Contiki operating system (Contiki OS), called PANATIKI. The paper also shows a testbed, simulations and experimental results obtained from real and simulated constrained devices. PMID:24189332

PANATIKI: a network access control implementation based on PANA for IoT devices.

PubMed

Moreno Sanchez, Pedro; Marin Lopez, Rafa; Gomez Skarmeta, Antonio F

2013-11-01

Internet of Things (IoT) networks are the pillar of recent novel scenarios, such as smart cities or e-healthcare applications. Among other challenges, these networks cover the deployment and interaction of small devices with constrained capabilities and Internet protocol (IP)-based networking connectivity. These constrained devices usually require connection to the Internet to exchange information (e.g., management or sensing data) or access network services. However, only authenticated and authorized devices can, in general, establish this connection. The so-called authentication, authorization and accounting (AAA) services are in charge of performing these tasks on the Internet. Thus, it is necessary to deploy protocols that allow constrained devices to verify their credentials against AAA infrastructures. The Protocol for Carrying Authentication for Network Access (PANA) has been standardized by the Internet engineering task force (IETF) to carry the Extensible Authentication Protocol (EAP), which provides flexible authentication upon the presence of AAA. To the best of our knowledge, this paper is the first deep study of the feasibility of EAP/PANA for network access control in constrained devices. We provide light-weight versions and implementations of these protocols to fit them into constrained devices. These versions have been designed to reduce the impact in standard specifications. The goal of this work is two-fold: (1) to demonstrate the feasibility of EAP/PANA in IoT devices; (2) to provide the scientific community with the first light-weight interoperable implementation of EAP/PANA for constrained devices in the Contiki operating system (Contiki OS), called PANATIKI. The paper also shows a testbed, simulations and experimental results obtained from real and simulated constrained devices.

UMDR: Multi-Path Routing Protocol for Underwater Ad Hoc Networks with Directional Antenna

NASA Astrophysics Data System (ADS)

Yang, Jianmin; Liu, Songzuo; Liu, Qipei; Qiao, Gang

2018-01-01

This paper presents a new routing scheme for underwater ad hoc networks based on directional antennas. Ad hoc networks with directional antennas have become a hot research topic because of space reuse may increase networks capacity. At present, researchers have applied traditional self-organizing routing protocols (such as DSR, AODV) [1] [2] on this type of networks, and the routing scheme is based on the shortest path metric. However, such routing schemes often suffer from long transmission delays and frequent link fragmentation along the intermediate nodes of the selected route. This is caused by a unique feature of directional transmission, often called as “deafness”. In this paper, we take a different approach to explore the advantages of space reuse through multipath routing. This paper introduces the validity of the conventional routing scheme in underwater ad hoc networks with directional antennas, and presents a special design of multipath routing algorithm for directional transmission. The experimental results show a significant performance improvement in throughput and latency.

Tree-Based Unrooted Phylogenetic Networks.

PubMed

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

2018-02-01

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

TinyOS-based quality of service management in wireless sensor networks

USGS Publications Warehouse

Peterson, N.; Anusuya-Rangappa, L.; Shirazi, B.A.; Huang, R.; Song, W.-Z.; Miceli, M.; McBride, D.; Hurson, A.; LaHusen, R.

2009-01-01

Previously the cost and extremely limited capabilities of sensors prohibited Quality of Service (QoS) implementations in wireless sensor networks. With advances in technology, sensors are becoming significantly less expensive and the increases in computational and storage capabilities are opening the door for new, sophisticated algorithms to be implemented. Newer sensor network applications require higher data rates with more stringent priority requirements. We introduce a dynamic scheduling algorithm to improve bandwidth for high priority data in sensor networks, called Tiny-DWFQ. Our Tiny-Dynamic Weighted Fair Queuing scheduling algorithm allows for dynamic QoS for prioritized communications by continually adjusting the treatment of communication packages according to their priorities and the current level of network congestion. For performance evaluation, we tested Tiny-DWFQ, Tiny-WFQ (traditional WFQ algorithm implemented in TinyOS), and FIFO queues on an Imote2-based wireless sensor network and report their throughput and packet loss. Our results show that Tiny-DWFQ performs better in all test cases. ?? 2009 IEEE.

An Inter-Networking Mechanism with Stepwise Synchronization for Wireless Sensor Networks

PubMed Central

Yamamoto, Hiroshi; Wakamiya, Naoki; Murata, Masayuki

2011-01-01

To realize the ambient information society, multiple wireless networks deployed in the region and devices carried by users are required to cooperate with each other. Since duty cycles and operational frequencies are different among networks, we need a mechanism to allow networks to efficiently exchange messages. For this purpose, we propose a novel inter-networking mechanism where two networks are synchronized with each other in a moderate manner, which we call stepwise synchronization. With our proposal, to bridge the gap between intrinsic operational frequencies, nodes near the border of networks adjust their operational frequencies in a stepwise fashion based on the pulse-coupled oscillator model as a fundamental theory of synchronization. Through simulation experiments, we show that the communication delay and the energy consumption of border nodes are reduced, which enables wireless sensor networks to communicate longer with each other. PMID:22164073

Fin whale tracks recorded by a seismic network on the Juan de Fuca Ridge, Northeast Pacific Ocean.

PubMed

Soule, Dax C; Wilcock, William S D

2013-03-01

Fin whale calls recorded from 2003 to 2004 by a seafloor seismic network on the Endeavour segment of the Juan de Fuca Ridge were analyzed to determine tracks and calling patterns. Over 150 tracks were obtained with a total duration of ~800 h and swimming speeds from 1 to 12 km/h. The dominant inter-pulse interval (IPI) is 24 s and the IPI patterns define 4 categories: a 25 s single IPI and 24/30 s dual IPI produced by single calling whales, a 24/13 s dual IPI interpreted as two calling whales, and an irregular IPI interpreted as groups of calling whales. There are also tracks in which the IPI switches between categories. Call rates vary seasonally with all the tracks between August and April. From August to October tracks are dominated by the irregular IPI and are predominantly headed to the northwest, suggesting that a portion of the fin whale population does not migrate south in the fall. The other IPI categories occur primarily from November to March. These tracks have slower swimming speeds, tend to meander, and are predominantly to the south. The distribution of fin whales around the network is non-random with more calls near the network and to the east and north.

75 FR 69671 - Agency Information Collection Activities: Proposed Collection; Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-15

... behavior. All 147 networked crisis centers will complete the Web-based Crisis Center Survey annually. The Survey requests information about organizational structure, staffing, scope of services, call center operations, quality assurance, community outreach/marketing, telephone equipment, data collection, and...

Effect of Bayesian Student Modeling on Academic Achievement in Foreign Language Teaching (University Level English Preparatory School Example)

ERIC Educational Resources Information Center

Aslan, Burak Galip; Öztürk, Özlem; Inceoglu, Mustafa Murat

2014-01-01

Considering the increasing importance of adaptive approaches in CALL systems, this study implemented a machine learning based student modeling middleware with Bayesian networks. The profiling approach of the student modeling system is based on Felder and Silverman's Learning Styles Model and Felder and Soloman's Index of Learning Styles…

A Fair Contention Access Scheme for Low-Priority Traffic in Wireless Body Area Networks

PubMed Central

Sajeel, Muhammad; Bashir, Faisal; Asfand-e-yar, Muhammad; Tauqir, Muhammad

2017-01-01

Recently, wireless body area networks (WBANs) have attracted significant consideration in ubiquitous healthcare. A number of medium access control (MAC) protocols, primarily derived from the superframe structure of the IEEE 802.15.4, have been proposed in literature. These MAC protocols aim to provide quality of service (QoS) by prioritizing different traffic types in WBANs. A contention access period (CAP)with high contention in priority-based MAC protocols can result in higher number of collisions and retransmissions. During CAP, traffic classes with higher priority are dominant over low-priority traffic; this has led to starvation of low-priority traffic, thus adversely affecting WBAN throughput, delay, and energy consumption. Hence, this paper proposes a traffic-adaptive priority-based superframe structure that is able to reduce contention in the CAP period, and provides a fair chance for low-priority traffic. Simulation results in ns-3 demonstrate that the proposed MAC protocol, called traffic- adaptive priority-based MAC (TAP-MAC), achieves low energy consumption, high throughput, and low latency compared to the IEEE 802.15.4 standard, and the most recent priority-based MAC protocol, called priority-based MAC protocol (PA-MAC). PMID:28832495

P-Finder: Reconstruction of Signaling Networks from Protein-Protein Interactions and GO Annotations.

PubMed

Young-Rae Cho; Yanan Xin; Speegle, Greg

2015-01-01

Because most complex genetic diseases are caused by defects of cell signaling, illuminating a signaling cascade is essential for understanding their mechanisms. We present three novel computational algorithms to reconstruct signaling networks between a starting protein and an ending protein using genome-wide protein-protein interaction (PPI) networks and gene ontology (GO) annotation data. A signaling network is represented as a directed acyclic graph in a merged form of multiple linear pathways. An advanced semantic similarity metric is applied for weighting PPIs as the preprocessing of all three methods. The first algorithm repeatedly extends the list of nodes based on path frequency towards an ending protein. The second algorithm repeatedly appends edges based on the occurrence of network motifs which indicate the link patterns more frequently appearing in a PPI network than in a random graph. The last algorithm uses the information propagation technique which iteratively updates edge orientations based on the path strength and merges the selected directed edges. Our experimental results demonstrate that the proposed algorithms achieve higher accuracy than previous methods when they are tested on well-studied pathways of S. cerevisiae. Furthermore, we introduce an interactive web application tool, called P-Finder, to visualize reconstructed signaling networks.

A fiber optic tactical voice/data network based on FDDI

NASA Technical Reports Server (NTRS)

Bergman, L. A.; Hartmayer, R.; Marelid, S.; Wu, W. H.; Edgar, G.; Cassell, P.; Mancini, R.; Kiernicki, J.; Paul, L. J.; Jeng, J.

1988-01-01

An asynchronous high-speed fiber optic local area network is described that supports ordinary data packet traffic simultaneously with synchronous Tl voice traffic over a common FDDI token ring channel. A voice interface module was developed that parses, buffers, and resynchronizes the voice data to the packet network. The technique is general, however, and can be applied to any deterministic class of networks, including multi-tier backbones. A conventional single token access protocol was employed at the lowest layer, with fixed packet sizes for voice and variable for data. In addition, the higher layer packet data protocols are allowed to operate independently of those for the voice thereby permitting great flexibility in reconfiguring the network. Voice call setup and switching functions were performed external to the network with PABX equipment.

Wave-variable framework for networked robotic systems with time delays and packet losses

NASA Astrophysics Data System (ADS)

Puah, Seng-Ming; Liu, Yen-Chen

2017-05-01

This paper investigates the problem of networked control system for nonlinear robotic manipulators under time delays and packet loss by using passivity technique. With the utilisation of wave variables and a passive remote controller, the networked robotic system is demonstrated to be stable with guaranteed position regulation. For the input/output signals of robotic systems, a discretisation block is exploited to convert continuous-time signals to discrete-time signals, and vice versa. Subsequently, we propose a packet management, called wave-variable modulation, to cope with the proposed networked robotic system under time delays and packet losses. Numerical examples and experimental results are presented to demonstrate the performance of the proposed wave-variable-based networked robotic systems.

Auction-based bandwidth allocation in the Internet

NASA Astrophysics Data System (ADS)

Wei, Jiaolong; Zhang, Chi

2002-07-01

It has been widely accepted that auctioning which is the pricing approach with minimal information requirement is a proper tool to manage scare network resources. Previous works focus on Vickrey auction which is incentive compatible in classic auction theory. In the beginning of this paper, the faults of the most representative auction-based mechanisms are discussed. And then a new method called uniform-price auction (UPA), which has the simplest auction rule is proposed and it's incentive compatibility in the network environment is also proved. Finally, the basic mode is extended to support applications which require minimum bandwidth guarantees for a given time period by introducing derivative market, and a market mechanism for network resource allocation which is predictable, riskless, and simple for end-users is completed.

Impact of a Regional Pharmacy Call Center on Telephone Access Metrics Within the Veterans Health Administration.

PubMed

White, Christina A; Jones, Marshall R; Kuester, Melanie K; Myers, Kelly L; Schnarr, Barbara A

2015-05-01

To establish a cost-effective centralized pharmacy call center to serve the patients of Veterans Integrated Service Network (VISN) 11 that would meet established performance metrics. A pilot project began in August 2011 with the Indianapolis VA Medical Center (VAMC) and the Health Resource Center (HRC) in Topeka, Kansas. The Indianapolis VAMC used a first-call resolution business model consisting of pharmacy technicians receiving tier 1 phone calls that could be escalated to a tier 2 line that consisted of lead technicians and pharmacists, while the HRC utilized general telephone agents that would transfer unresolved calls to the primary facility. Pre- and post-VISN 11 Pharmacy Call Center performance metrics were compared for each of the 7 facilities in the network with the goals being monthly average abandoned call rate less than 5% and average speed to answer less than 30 seconds. Cost per call was also compared. The average abandoned call rate for the network during the year prior to VISN 11 Pharmacy Call Center implementation (August 2010-July 2011) was 15.66% and decreased to 3% in July 2014. The average abandoned call rate decreased for each individual facility. In fiscal year 2014, the VISN 11 Pharmacy Call Center was operating at a cost of $4.35 per call while providing more services than the HRC, resulting in less workload being transferred back to the individual facilities. A centralized VISN pharmacy call center is a reasonable alternative to individual facility call centers or the HRC.

Identifying key nodes in multilayer networks based on tensor decomposition.

PubMed

Wang, Dingjie; Wang, Haitao; Zou, Xiufen

2017-06-01

The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.

Identifying key nodes in multilayer networks based on tensor decomposition

NASA Astrophysics Data System (ADS)

Wang, Dingjie; Wang, Haitao; Zou, Xiufen

2017-06-01

The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.

Impact of Information based Classification on Network Epidemics

PubMed Central

Mishra, Bimal Kumar; Haldar, Kaushik; Sinha, Durgesh Nandini

2016-01-01

Formulating mathematical models for accurate approximation of malicious propagation in a network is a difficult process because of our inherent lack of understanding of several underlying physical processes that intrinsically characterize the broader picture. The aim of this paper is to understand the impact of available information in the control of malicious network epidemics. A 1-n-n-1 type differential epidemic model is proposed, where the differentiality allows a symptom based classification. This is the first such attempt to add such a classification into the existing epidemic framework. The model is incorporated into a five class system called the DifEpGoss architecture. Analysis reveals an epidemic threshold, based on which the long-term behavior of the system is analyzed. In this work three real network datasets with 22002, 22469 and 22607 undirected edges respectively, are used. The datasets show that classification based prevention given in the model can have a good role in containing network epidemics. Further simulation based experiments are used with a three category classification of attack and defense strengths, which allows us to consider 27 different possibilities. These experiments further corroborate the utility of the proposed model. The paper concludes with several interesting results. PMID:27329348

Topological Characterization of Carbon Graphite and Crystal Cubic Carbon Structures.

PubMed

Siddiqui, Wei Gao Muhammad Kamran; Naeem, Muhammad; Rehman, Najma Abdul

2017-09-07

Graph theory is used for modeling, designing, analysis and understanding chemical structures or chemical networks and their properties. The molecular graph is a graph consisting of atoms called vertices and the chemical bond between atoms called edges. In this article, we study the chemical graphs of carbon graphite and crystal structure of cubic carbon. Moreover, we compute and give closed formulas of degree based additive topological indices, namely hyper-Zagreb index, first multiple and second multiple Zagreb indices, and first and second Zagreb polynomials.

WITS - A Coaxial Cable Bus Network for Medical Applications

PubMed Central

LaSonde, Clarence J.

1980-01-01

Walter Reed ARMY Medical Center has been serving as a Army test bed for coaxial cable-based local area networks since early 1978. This particular network, called the WRAMC Information Transfer System (WITS), carries commercial television, FM radio, closed-circuit TV and maintenance intercom audio, as well as digital data. The technology has proven successful. Broadband coaxial cable systems provide an opportunity to realize communications architectures that are flexible, highly reliable, and inexpensive. They are particularly appropriate for use in medical facilities where applications change over time and when many and varied systems are required to interact together.

Particle identification with neural networks using a rotational invariant moment representation

NASA Astrophysics Data System (ADS)

Sinkus, R.; Voss, T.

1997-02-01

A feed-forward neural network is used to identify electromagnetic particles based upon their showering properties within a segmented calorimeter. The novel feature is the expansion of the energy distribution in terms of moments of the so-called Zernike functions which are invariant under rotation. The multidimensional input distribution for the neural network is transformed via a principle component analysis and rescaled by its respective variances to ensure input values of the order of one. This results is a better performance in identifying and separating electromagnetic from hadronic particles, especially at low energies.

Eigentime identities for on weighted polymer networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Tang, Hualong; Zou, Jiahui; He, Di; Sun, Yu; Su, Weiyi

2018-01-01

In this paper, we first analytically calculate the eigenvalues of the transition matrix of a structure with very complex architecture and their multiplicities. We call this structure polymer network. Based on the eigenvalues obtained in the iterative manner, we then calculate the eigentime identity. We highlight two scaling behaviors (logarithmic and linear) for this quantity, strongly depending on the value of the weight factor. Finally, by making use of the obtained eigenvalues, we determine the weighted counting of spanning trees.

Networking the Global Maritime Partnership

DTIC Science & Technology

2016-04-13

Strike, and Sea Basing) as “old wine in new bottles,” but with them Admiral Clark introduced a new term, “FORCEnet,” which referred to “an initiative...the primary reasons for the overwhelming combat power demonstrated in recent operations.18 C4ISR advances not only benefit so-called high-end...of the benefits of the adoption by coalition naval forces of a networked force structure. The report of AG-1 prompted leaders of the MAR in 2005 to

A fuzzy call admission control scheme in wireless networks

NASA Astrophysics Data System (ADS)

Ma, Yufeng; Gong, Shenguang; Hu, Xiulin; Zhang, Yunyu

2007-11-01

Scarcity of the spectrum resource and mobility of users make quality of service (QoS) provision a critical issue in wireless networks. This paper presents a fuzzy call admission control scheme to meet the requirement of the QoS. A performance measure is formed as a weighted linear function of new call and handoff call blocking probabilities. Simulation compares the proposed fuzzy scheme with an adaptive channel reservation scheme. Simulation results show that fuzzy scheme has a better robust performance in terms of average blocking criterion.

Output power distributions of terminals in a 3G mobile communication network.

PubMed

Persson, Tomas; Törnevik, Christer; Larsson, Lars-Eric; Lovén, Jan

2012-05-01

The objective of this study was to examine the distribution of the output power of mobile phones and other terminals connected to a 3G network in Sweden. It is well known that 3G terminals can operate with very low output power, particularly for voice calls. Measurements of terminal output power were conducted in the Swedish TeliaSonera 3G network in November 2008 by recording network statistics. In the analysis, discrimination was made between rural, suburban, urban, and dedicated indoor networks. In addition, information about terminal output power was possible to collect separately for voice and data traffic. Information from six different Radio Network Controllers (RNCs) was collected during at least 1 week. In total, more than 800000 h of voice calls were collected and in addition to that a substantial amount of data traffic. The average terminal output power for 3G voice calls was below 1 mW for any environment including rural, urban, and dedicated indoor networks. This is <1% of the maximum available output power. For data applications the average output power was about 6-8 dB higher than for voice calls. For rural areas the output power was about 2 dB higher, on average, than in urban areas. Copyright © 2011 Wiley Periodicals, Inc.

The Audacity of Fiber-Wireless (FiWi) Networks

NASA Astrophysics Data System (ADS)

Maier, Martin; Ghazisaidi, Navid; Reisslein, Martin

A plethora of enabling optical and wireless technologies have been emerging that can be used to build future-proof bimodal fiber-wireless (FiWi) broadband access networks. After overviewing key enabling radio-over-fiber (RoF) and radio-and-fiber (R&F) technologies and briefly surveying the state of the art of FiWi networks, we introduce an Ethernet-based access-metro FiWi network, called SuperMAN, that integrates next-generation WiFi and WiMAX networks with WDM-enhanced EPON and RPR networks. Throughout the paper we pay close attention to the technical challenges and opportunities of FiWi networks, but also elaborate on their societal benefits and potential to shift the current research focus from optical-wireless networking to the exploitation of personal and in-home computing facilities to create new unforeseen services and applications as we are about to enter the Petabyte age.

76 FR 12126 - Agency Information Collection Activities: Submission for OMB Review; Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-04

... behavior. All 147 networked crisis centers will complete the Web-based Crisis Center Survey annually. The Survey requests information about organizational structure, staffing, scope of services, call center operations, quality assurance, community outreach/marketing, telephone equipment, data collection, and...

A new method for enhancer prediction based on deep belief network.

PubMed

Bu, Hongda; Gan, Yanglan; Wang, Yang; Zhou, Shuigeng; Guan, Jihong

2017-10-16

Studies have shown that enhancers are significant regulatory elements to play crucial roles in gene expression regulation. Since enhancers are unrelated to the orientation and distance to their target genes, it is a challenging mission for scholars and researchers to accurately predicting distal enhancers. In the past years, with the high-throughout ChiP-seq technologies development, several computational techniques emerge to predict enhancers using epigenetic or genomic features. Nevertheless, the inconsistency of computational models across different cell-lines and the unsatisfactory prediction performance call for further research in this area. Here, we propose a new Deep Belief Network (DBN) based computational method for enhancer prediction, which is called EnhancerDBN. This method combines diverse features, composed of DNA sequence compositional features, DNA methylation and histone modifications. Our computational results indicate that 1) EnhancerDBN outperforms 13 existing methods in prediction, and 2) GC content and DNA methylation can serve as relevant features for enhancer prediction. Deep learning is effective in boosting the performance of enhancer prediction.

Multi Sensor Fusion Using Fitness Adaptive Differential Evolution

NASA Astrophysics Data System (ADS)

Giri, Ritwik; Ghosh, Arnob; Chowdhury, Aritra; Das, Swagatam

The rising popularity of multi-source, multi-sensor networks supports real-life applications calls for an efficient and intelligent approach to information fusion. Traditional optimization techniques often fail to meet the demands. The evolutionary approach provides a valuable alternative due to its inherent parallel nature and its ability to deal with difficult problems. We present a new evolutionary approach based on a modified version of Differential Evolution (DE), called Fitness Adaptive Differential Evolution (FiADE). FiADE treats sensors in the network as distributed intelligent agents with various degrees of autonomy. Existing approaches based on intelligent agents cannot completely answer the question of how their agents could coordinate their decisions in a complex environment. The proposed approach is formulated to produce good result for the problems that are high-dimensional, highly nonlinear, and random. The proposed approach gives better result in case of optimal allocation of sensors. The performance of the proposed approach is compared with an evolutionary algorithm coordination generalized particle model (C-GPM).

Automated detection and localization of bowhead whale sounds in the presence of seismic airgun surveys.

PubMed

Thode, Aaron M; Kim, Katherine H; Blackwell, Susanna B; Greene, Charles R; Nations, Christopher S; McDonald, Trent L; Macrander, A Michael

2012-05-01

An automated procedure has been developed for detecting and localizing frequency-modulated bowhead whale sounds in the presence of seismic airgun surveys. The procedure was applied to four years of data, collected from over 30 directional autonomous recording packages deployed over a 280 km span of continental shelf in the Alaskan Beaufort Sea. The procedure has six sequential stages that begin by extracting 25-element feature vectors from spectrograms of potential call candidates. Two cascaded neural networks then classify some feature vectors as bowhead calls, and the procedure then matches calls between recorders to triangulate locations. To train the networks, manual analysts flagged 219 471 bowhead call examples from 2008 and 2009. Manual analyses were also used to identify 1.17 million transient signals that were not whale calls. The network output thresholds were adjusted to reject 20% of whale calls in the training data. Validation runs using 2007 and 2010 data found that the procedure missed 30%-40% of manually detected calls. Furthermore, 20%-40% of the sounds flagged as calls are not present in the manual analyses; however, these extra detections incorporate legitimate whale calls overlooked by human analysts. Both manual and automated methods produce similar spatial and temporal call distributions.

A novel wavelet sequence based on deep bidirectional LSTM network model for ECG signal classification.

PubMed

Yildirim, Özal

2018-05-01

Long-short term memory networks (LSTMs), which have recently emerged in sequential data analysis, are the most widely used type of recurrent neural networks (RNNs) architecture. Progress on the topic of deep learning includes successful adaptations of deep versions of these architectures. In this study, a new model for deep bidirectional LSTM network-based wavelet sequences called DBLSTM-WS was proposed for classifying electrocardiogram (ECG) signals. For this purpose, a new wavelet-based layer is implemented to generate ECG signal sequences. The ECG signals were decomposed into frequency sub-bands at different scales in this layer. These sub-bands are used as sequences for the input of LSTM networks. New network models that include unidirectional (ULSTM) and bidirectional (BLSTM) structures are designed for performance comparisons. Experimental studies have been performed for five different types of heartbeats obtained from the MIT-BIH arrhythmia database. These five types are Normal Sinus Rhythm (NSR), Ventricular Premature Contraction (VPC), Paced Beat (PB), Left Bundle Branch Block (LBBB), and Right Bundle Branch Block (RBBB). The results show that the DBLSTM-WS model gives a high recognition performance of 99.39%. It has been observed that the wavelet-based layer proposed in the study significantly improves the recognition performance of conventional networks. This proposed network structure is an important approach that can be applied to similar signal processing problems. Copyright © 2018 Elsevier Ltd. All rights reserved.

Digital watermarking for secure and adaptive teleconferencing

NASA Astrophysics Data System (ADS)

Vorbrueggen, Jan C.; Thorwirth, Niels

2002-04-01

The EC-sponsored project ANDROID aims to develop a management system for secure active networks. Active network means allowing the network's customers to execute code (Java-based so-called proxylets) on parts of the network infrastructure. Secure means that the network operator nonetheless retains full control over the network and its resources, and that proxylets use ANDROID-developed facilities to provide secure applications. Management is based on policies and allows autonomous, distributed decisions and actions to be taken. Proxylets interface with the system via policies; among actions they can take is controlling execution of other proxylets or redirection of network traffic. Secure teleconferencing is used as the application to demonstrate the approach's advantages. A way to control a teleconference's data streams is to use digital watermarking of the video, audio and/or shared-whiteboard streams, providing an imperceptible and inseparable side channel that delivers information from originating or intermediate stations to downstream stations. Depending on the information carried by the watermark, these stations can take many different actions. Examples are forwarding decisions based on security classifications (possibly time-varying) at security boundaries, set-up and tear-down of virtual private networks, intelligent and adaptive transcoding, recorder or playback control (e.g., speaking off the record), copyright protection, and sender authentication.

Gene Regulatory Network Inferences Using a Maximum-Relevance and Maximum-Significance Strategy

PubMed Central

Liu, Wei; Zhu, Wen; Liao, Bo; Chen, Xiangtao

2016-01-01

Recovering gene regulatory networks from expression data is a challenging problem in systems biology that provides valuable information on the regulatory mechanisms of cells. A number of algorithms based on computational models are currently used to recover network topology. However, most of these algorithms have limitations. For example, many models tend to be complicated because of the “large p, small n” problem. In this paper, we propose a novel regulatory network inference method called the maximum-relevance and maximum-significance network (MRMSn) method, which converts the problem of recovering networks into a problem of how to select the regulator genes for each gene. To solve the latter problem, we present an algorithm that is based on information theory and selects the regulator genes for a specific gene by maximizing the relevance and significance. A first-order incremental search algorithm is used to search for regulator genes. Eventually, a strict constraint is adopted to adjust all of the regulatory relationships according to the obtained regulator genes and thus obtain the complete network structure. We performed our method on five different datasets and compared our method to five state-of-the-art methods for network inference based on information theory. The results confirm the effectiveness of our method. PMID:27829000

Differentiated optical services: a quality of optical service model for WDM networks

NASA Astrophysics Data System (ADS)

Ndousse, Thomas D.; Golmie, Nada

1999-08-01

This paper addresses the issues of guaranteed and scalable end-to-end QoS in Metropolitan DWDM networks serving as transit networks for IP access networks. DWDM offering few wavelengths have in the past been deployed in backbone networks to upgrade point-to-point transmission where sharing is based on coarse granularity. This type of DWDM backbone networks, offering few lightpaths, provides no support for QoS services traversing the network. As DWDM networks with larger numbers of wavelengths penetrate the data-centric Metro environment, specific IP service requirements such as priority restoration, scalability, dynamic provisioning of capacity and routes, and support for coarse-grain QoS capabilities will have to be addressed in the optical domain in order to support end-to-end Service- Level Agreements. In this paper, we focus on the support of QoS in the optical domain in order to achieve end-to-end QoS over a DWDM network. We propose a QoS service model in the optical domain called Differentiated Optical Services (DOS). Service classification in DOS is based on a set of optical parameters that captures the quality and reliability of the optical lightpath.

Asymmetries in commitment in an avian communication network.

PubMed

Randler, Christoph; Vollmer, Christian

2013-02-01

Mobbing of predators occurs within a conspecific and heterospecific context but has not been quantified within the framework of a communication network and analysed with respect to heterospecific reciprocity. Here, we used playbacks of mobbing calls to show that mobbing is unequally distributed within a community of deciduous forest birds. Five species (great tit Parus major, blue tit Cyanistes caeruleus, marsh tit Poecile palustris, nuthatch Sitta europaea and chaffinch Fringilla coelebs) responded to each other's playbacks of mobbing calls. Commitment to mob was measured by minimum distance, response latency and uttering of calls. Commitment was higher when conspecific calls were broadcast. Yet, responses to heterospecific calls were significantly different between the five species. Chaffinches had the lowest commitment, and blue tits tended to have the highest. The communication network is asymmetric. Some species invest more than they receive from other species. As mobbing might incur costs, these are unequally distributed across the community.

Asymmetries in commitment in an avian communication network

NASA Astrophysics Data System (ADS)

Randler, Christoph; Vollmer, Christian

2013-02-01

Mobbing of predators occurs within a conspecific and heterospecific context but has not been quantified within the framework of a communication network and analysed with respect to heterospecific reciprocity. Here, we used playbacks of mobbing calls to show that mobbing is unequally distributed within a community of deciduous forest birds. Five species (great tit Parus major, blue tit Cyanistes caeruleus, marsh tit Poecile palustris, nuthatch Sitta europaea and chaffinch Fringilla coelebs) responded to each other's playbacks of mobbing calls. Commitment to mob was measured by minimum distance, response latency and uttering of calls. Commitment was higher when conspecific calls were broadcast. Yet, responses to heterospecific calls were significantly different between the five species. Chaffinches had the lowest commitment, and blue tits tended to have the highest. The communication network is asymmetric. Some species invest more than they receive from other species. As mobbing might incur costs, these are unequally distributed across the community.

Building a sense of virtual community: the role of the features of social networking sites.

PubMed

Chen, Chi-Wen; Lin, Chiun-Sin

2014-07-01

In recent years, social networking sites have received increased attention because of the potential of this medium to transform business by building virtual communities. However, theoretical and empirical studies investigating how specific features of social networking sites contribute to building a sense of virtual community (SOVC)-an important dimension of a successful virtual community-are rare. Furthermore, SOVC scales have been developed, and research on this issue has been called for, but few studies have heeded this call. On the basis of prior literature, this study proposes that perceptions of the three most salient features of social networking sites-system quality (SQ), information quality (IQ), and social information exchange (SIE)-play a key role in fostering SOVC. In particular, SQ is proposed to increase IQ and SIE, and SIE is proposed to enhance IQ, both of which thereafter build SOVC. The research model was examined in the context of Facebook, one of the most popular social networking sites in the world. We adopted Blanchard's scales to measure SOVC. Data gathered using a Web-based questionnaire, and analyzed with partial least squares, were utilized to test the model. The results demonstrate that SIE, SQ, and IQ are the factors that form SOVC. The findings also suggest that SQ plays a fundamental role in supporting SIE and IQ in social networking sites. Implications for theory, practice, and future research directions are discussed.

Metamodeling and the Critic-based approach to multi-level optimization.

PubMed

Werbos, Ludmilla; Kozma, Robert; Silva-Lugo, Rodrigo; Pazienza, Giovanni E; Werbos, Paul J

2012-08-01

Large-scale networks with hundreds of thousands of variables and constraints are becoming more and more common in logistics, communications, and distribution domains. Traditionally, the utility functions defined on such networks are optimized using some variation of Linear Programming, such as Mixed Integer Programming (MIP). Despite enormous progress both in hardware (multiprocessor systems and specialized processors) and software (Gurobi) we are reaching the limits of what these tools can handle in real time. Modern logistic problems, for example, call for expanding the problem both vertically (from one day up to several days) and horizontally (combining separate solution stages into an integrated model). The complexity of such integrated models calls for alternative methods of solution, such as Approximate Dynamic Programming (ADP), which provide a further increase in the performance necessary for the daily operation. In this paper, we present the theoretical basis and related experiments for solving the multistage decision problems based on the results obtained for shorter periods, as building blocks for the models and the solution, via Critic-Model-Action cycles, where various types of neural networks are combined with traditional MIP models in a unified optimization system. In this system architecture, fast and simple feed-forward networks are trained to reasonably initialize more complicated recurrent networks, which serve as approximators of the value function (Critic). The combination of interrelated neural networks and optimization modules allows for multiple queries for the same system, providing flexibility and optimizing performance for large-scale real-life problems. A MATLAB implementation of our solution procedure for a realistic set of data and constraints shows promising results, compared to the iterative MIP approach. Copyright © 2012 Elsevier Ltd. All rights reserved.

Improving deep convolutional neural networks with mixed maxout units.

PubMed

Zhao, Hui-Zhen; Liu, Fu-Xian; Li, Long-Yue

2017-01-01

Motivated by insights from the maxout-units-based deep Convolutional Neural Network (CNN) that "non-maximal features are unable to deliver" and "feature mapping subspace pooling is insufficient," we present a novel mixed variant of the recently introduced maxout unit called a mixout unit. Specifically, we do so by calculating the exponential probabilities of feature mappings gained by applying different convolutional transformations over the same input and then calculating the expected values according to their exponential probabilities. Moreover, we introduce the Bernoulli distribution to balance the maximum values with the expected values of the feature mappings subspace. Finally, we design a simple model to verify the pooling ability of mixout units and a Mixout-units-based Network-in-Network (NiN) model to analyze the feature learning ability of the mixout models. We argue that our proposed units improve the pooling ability and that mixout models can achieve better feature learning and classification performance.

Distributed dynamic simulations of networked control and building performance applications.

PubMed

Yahiaoui, Azzedine

2018-02-01

The use of computer-based automation and control systems for smart sustainable buildings, often so-called Automated Buildings (ABs), has become an effective way to automatically control, optimize, and supervise a wide range of building performance applications over a network while achieving the minimum energy consumption possible, and in doing so generally refers to Building Automation and Control Systems (BACS) architecture. Instead of costly and time-consuming experiments, this paper focuses on using distributed dynamic simulations to analyze the real-time performance of network-based building control systems in ABs and improve the functions of the BACS technology. The paper also presents the development and design of a distributed dynamic simulation environment with the capability of representing the BACS architecture in simulation by run-time coupling two or more different software tools over a network. The application and capability of this new dynamic simulation environment are demonstrated by an experimental design in this paper.

Study of Allocation Guaranteed Time Slot Wireless Body Area Networks Based on IEEE 802.15.4

NASA Astrophysics Data System (ADS)

Yundra, E.; Harsono, G. D.

2018-04-01

This paper aims to determine the size of the Guaranteed Time Slot (GTS) on the super frame structure required for each sensor as well as to know the performance of the GTS resized system compared to the GTS standard on IEEE 802.15.4. This article proposes a scheme to improve IEEE 802.15.4 medium access control, called allocation Guaranteed Time Slot (ALGATIS). ALGATIS is expected to effectively allocate guaranteed time slot to the requested sensors, it adjusts the length of the slot in super frame duration based on the length of the packet data. This article presents a simulation experiment of IEEE 802.15.4, especially for star network, to predict the throughput of networks and average energy consumption. The simulation experiments show that the performance of ALGATIS is better than that of IEEE 802.15.4 standard in term of the throughput of networks and average energy consumption

Distributed dynamic simulations of networked control and building performance applications

PubMed Central

Yahiaoui, Azzedine

2017-01-01

The use of computer-based automation and control systems for smart sustainable buildings, often so-called Automated Buildings (ABs), has become an effective way to automatically control, optimize, and supervise a wide range of building performance applications over a network while achieving the minimum energy consumption possible, and in doing so generally refers to Building Automation and Control Systems (BACS) architecture. Instead of costly and time-consuming experiments, this paper focuses on using distributed dynamic simulations to analyze the real-time performance of network-based building control systems in ABs and improve the functions of the BACS technology. The paper also presents the development and design of a distributed dynamic simulation environment with the capability of representing the BACS architecture in simulation by run-time coupling two or more different software tools over a network. The application and capability of this new dynamic simulation environment are demonstrated by an experimental design in this paper. PMID:29568135

Impact of a Regional Pharmacy Call Center on Telephone Access Metrics Within the Veterans Health Administration

PubMed Central

Jones, Marshall R.; Kuester, Melanie K.; Myers, Kelly L.; Schnarr, Barbara A.

2015-01-01

Purpose: To establish a cost-effective centralized pharmacy call center to serve the patients of Veterans Integrated Service Network (VISN) 11 that would meet established performance metrics. Methods: A pilot project began in August 2011 with the Indianapolis VA Medical Center (VAMC) and the Health Resource Center (HRC) in Topeka, Kansas. The Indianapolis VAMC used a first-call resolution business model consisting of pharmacy technicians receiving tier 1 phone calls that could be escalated to a tier 2 line that consisted of lead technicians and pharmacists, while the HRC utilized general telephone agents that would transfer unresolved calls to the primary facility. Pre- and post-VISN 11 Pharmacy Call Center performance metrics were compared for each of the 7 facilities in the network with the goals being monthly average abandoned call rate less than 5% and average speed to answer less than 30 seconds. Cost per call was also compared. Results: The average abandoned call rate for the network during the year prior to VISN 11 Pharmacy Call Center implementation (August 2010-July 2011) was 15.66% and decreased to 3% in July 2014. The average abandoned call rate decreased for each individual facility. In fiscal year 2014, the VISN 11 Pharmacy Call Center was operating at a cost of $4.35 per call while providing more services than the HRC, resulting in less workload being transferred back to the individual facilities. Conclusion: A centralized VISN pharmacy call center is a reasonable alternative to individual facility call centers or the HRC. PMID:26405322

Modified neural networks for rapid recovery of tokamak plasma parameters for real time control

NASA Astrophysics Data System (ADS)

Sengupta, A.; Ranjan, P.

2002-07-01

Two modified neural network techniques are used for the identification of the equilibrium plasma parameters of the Superconducting Steady State Tokamak I from external magnetic measurements. This is expected to ultimately assist in a real time plasma control. As different from the conventional network structure where a single network with the optimum number of processing elements calculates the outputs, a multinetwork system connected in parallel does the calculations here in one of the methods. This network is called the double neural network. The accuracy of the recovered parameters is clearly more than the conventional network. The other type of neural network used here is based on the statistical function parametrization combined with a neural network. The principal component transformation removes linear dependences from the measurements and a dimensional reduction process reduces the dimensionality of the input space. This reduced and transformed input set, rather than the entire set, is fed into the neural network input. This is known as the principal component transformation-based neural network. The accuracy of the recovered parameters in the latter type of modified network is found to be a further improvement over the accuracy of the double neural network. This result differs from that obtained in an earlier work where the double neural network showed better performance. The conventional network and the function parametrization methods have also been used for comparison. The conventional network has been used for an optimization of the set of magnetic diagnostics. The effective set of sensors, as assessed by this network, are compared with the principal component based network. Fault tolerance of the neural networks has been tested. The double neural network showed the maximum resistance to faults in the diagnostics, while the principal component based network performed poorly. Finally the processing times of the methods have been compared. The double network and the principal component network involve the minimum computation time, although the conventional network also performs well enough to be used in real time.

Assessing Metacognitive Knowledge in Web-Based Call: A Neural Network Approach

ERIC Educational Resources Information Center

Yeh, Siou-Wen; Lo, Jia-Jiunn

2005-01-01

The assessment of learners' metacognitive knowledge level is crucial when developing computer-assisted language learning systems. Currently, many systems assess learners' metacognitive knowledge level with pre-instructional questionnaires or metacognitive interviews. However, learners with limited language proficiency may be at a disadvantage in…

Ford Takes the Fast Lane to Dealer Communication and Training.

ERIC Educational Resources Information Center

Thurman, Laura

1995-01-01

Describes the Ford Motor Company's satellite-based communications network called FORDSTAR that links the home office to all dealers in the United States and Canada in order to offer training that will improve customer satisfaction. Equipment, interactivity, data transmission, and future possibilities are discussed. (LRW)

Saving energy for the data collection point in WBAN network

NASA Astrophysics Data System (ADS)

Nguyen-Duc, Toan; Kamioka, Eiji

2017-11-01

Wireless sensor networking (WSN) has been rapidly developed and become essential in various domains including health care systems. Such systems use WSN to collect real-time medical sensed data, aiming at improving the patient safety. For instance, patients suffered from adverse events, i.e., cardiac or respiratory arrests, are monitored so as to prevent them from getting harm. Sensors are placed on, in or near the patients' body to continuously collect sensing data such as the electrocardiograms, blood oxygenation, breathing, and heart rate. In this case, the sensors form a subcategory of WSN called wireless body area network (WBAN). In WBAN, sensing data are sent to one or more data collection points called personal server (PS). The role of PS is important since it forwards sensed data, to a medical server via a Bluetooth/WLAN connection in real time to support storage of information and real-time diagnosis, the device can also issue a notification of an emergency status. Since PS is a battery-based device, when its battery is empty, it will disconnect the sensed medical data with the rest network. To best of our knowledge, very few studies that focus on saving energy for the PS. To this end, this work investigates the trade-off between energy consumption for wireless communication and the amount of sensing data. An energy consumption model for wireless communication has been proposed based on direct measurement using real testbed. According to our findings, it is possible to save energy for the PS by selecting suitable wireless technology to be used based on the amount of data to be transmitted.

LEAP: constructing gene co-expression networks for single-cell RNA-sequencing data using pseudotime ordering.

PubMed

Specht, Alicia T; Li, Jun

2017-03-01

To construct gene co-expression networks based on single-cell RNA-Sequencing data, we present an algorithm called LEAP, which utilizes the estimated pseudotime of the cells to find gene co-expression that involves time delay. R package LEAP available on CRAN. jun.li@nd.edu. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Developing brain networks of attention.

PubMed

Posner, Michael I; Rothbart, Mary K; Voelker, Pascale

2016-12-01

Attention is a primary cognitive function critical for perception, language, and memory. We provide an update on brain networks related to attention, their development, training, and pathologies. An executive attention network, also called the cingulo-opercular network, allows voluntary control of behavior in accordance with goals. Individual differences among children in self-regulation have been measured by a higher order factor called effortful control, which is related to the executive network and to the size of the anterior cingulate cortex. Brain networks of attention arise in infancy and are related to individual differences, including pathology during childhood. Methods of training attention may improve performance and ameliorate pathology.

Neural network for control of rearrangeable Clos networks.

PubMed

Park, Y K; Cherkassky, V

1994-09-01

Rapid evolution in the field of communication networks requires high speed switching technologies. This involves a high degree of parallelism in switching control and routing performed at the hardware level. The multistage crossbar networks have always been attractive to switch designers. In this paper a neural network approach to controlling a three-stage Clos network in real time is proposed. This controller provides optimal routing of communication traffic requests on a call-by-call basis by rearranging existing connections, with a minimum length of rearrangement sequence so that a new blocked call request can be accommodated. The proposed neural network controller uses Paull's rearrangement algorithm, along with the special (least used) switch selection rule in order to minimize the length of rearrangement sequences. The functional behavior of our model is verified by simulations and it is shown that the convergence time required for finding an optimal solution is constant, regardless of the switching network size. The performance is evaluated for random traffic with various traffic loads. Simulation results show that applying the least used switch selection rule increases the efficiency in switch rearrangements, reducing the network convergence time. The implementation aspects are also discussed to show the feasibility of the proposed approach.

Improving the Unsteady Aerodynamic Performance of Transonic Turbines using Neural Networks

NASA Technical Reports Server (NTRS)

Rai, Man Mohan; Madavan, Nateri K.; Huber, Frank W.

1999-01-01

A recently developed neural net-based aerodynamic design procedure is used in the redesign of a transonic turbine stage to improve its unsteady aerodynamic performance. The redesign procedure used incorporates the advantages of both traditional response surface methodology and neural networks by employing a strategy called parameter-based partitioning of the design space. Starting from the reference design, a sequence of response surfaces based on both neural networks and polynomial fits are constructed to traverse the design space in search of an optimal solution that exhibits improved unsteady performance. The procedure combines the power of neural networks and the economy of low-order polynomials (in terms of number of simulations required and network training requirements). A time-accurate, two-dimensional, Navier-Stokes solver is used to evaluate the various intermediate designs and provide inputs to the optimization procedure. The procedure yielded a modified design that improves the aerodynamic performance through small changes to the reference design geometry. These results demonstrate the capabilities of the neural net-based design procedure, and also show the advantages of including high-fidelity unsteady simulations that capture the relevant flow physics in the design optimization process.

Network Approach to Disease Diagnosis

NASA Astrophysics Data System (ADS)

Sharma, Amitabh; Bashan, Amir; Barabasi, Alber-Laszlo

2014-03-01

Human diseases could be viewed as perturbations of the underlying biological system. A thorough understanding of the topological and dynamical properties of the biological system is crucial to explain the mechanisms of many complex diseases. Recently network-based approaches have provided a framework for integrating multi-dimensional biological data that results in a better understanding of the pathophysiological state of complex diseases. Here we provide a network-based framework to improve the diagnosis of complex diseases. This framework is based on the integration of transcriptomics and the interactome. We analyze the overlap between the differentially expressed (DE) genes and disease genes (DGs) based on their locations in the molecular interaction network (''interactome''). Disease genes and their protein products tend to be much more highly connected than random, hence defining a disease sub-graph (called disease module) in the interactome. DE genes, even though different from the known set of DGs, may be significantly associated with the disease when considering their closeness to the disease module in the interactome. This new network approach holds the promise to improve the diagnosis of patients who cannot be diagnosed using conventional tools. Support was provided by HL066289 and HL105339 grants from the U.S. National Institutes of Health.

Assessing the Liquidity of Firms: Robust Neural Network Regression as an Alternative to the Current Ratio

NASA Astrophysics Data System (ADS)

de Andrés, Javier; Landajo, Manuel; Lorca, Pedro; Labra, Jose; Ordóñez, Patricia

Artificial neural networks have proven to be useful tools for solving financial analysis problems such as financial distress prediction and audit risk assessment. In this paper we focus on the performance of robust (least absolute deviation-based) neural networks on measuring liquidity of firms. The problem of learning the bivariate relationship between the components (namely, current liabilities and current assets) of the so-called current ratio is analyzed, and the predictive performance of several modelling paradigms (namely, linear and log-linear regressions, classical ratios and neural networks) is compared. An empirical analysis is conducted on a representative data base from the Spanish economy. Results indicate that classical ratio models are largely inadequate as a realistic description of the studied relationship, especially when used for predictive purposes. In a number of cases, especially when the analyzed firms are microenterprises, the linear specification is improved by considering the flexible non-linear structures provided by neural networks.

Noise-Assisted Concurrent Multipath Traffic Distribution in Ad Hoc Networks

PubMed Central

Murata, Masayuki

2013-01-01

The concept of biologically inspired networking has been introduced to tackle unpredictable and unstable situations in computer networks, especially in wireless ad hoc networks where network conditions are continuously changing, resulting in the need of robustness and adaptability of control methods. Unfortunately, existing methods often rely heavily on the detailed knowledge of each network component and the preconfigured, that is, fine-tuned, parameters. In this paper, we utilize a new concept, called attractor perturbation (AP), which enables controlling the network performance using only end-to-end information. Based on AP, we propose a concurrent multipath traffic distribution method, which aims at lowering the average end-to-end delay by only adjusting the transmission rate on each path. We demonstrate through simulations that, by utilizing the attractor perturbation relationship, the proposed method achieves a lower average end-to-end delay compared to other methods which do not take fluctuations into account. PMID:24319375

Evaluating System Parameters on a Dragonfly using Simulation and Visualization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bhatele, Abhinav; Jain, Nikhil; Livnat, Yarden

The dragon y topology is becoming a popular choice for build- ing high-radix, low-diameter networks with high-bandwidth links. Even with a powerful network, preliminary experi- ments on Edison at NERSC have shown that for communica- tion heavy applications, job interference and thus presumably job placement remains an important factor. In this paper, we explore the e ects of job placement, job sizes, parallel workloads and network con gurations on network through- put to better understand inter-job interference. We use a simulation tool called Damsel y to model the network be- havior of Edison and study the impact of various systemmore » parameters on network throughput. Parallel workloads based on ve representative communication patters are used and the simulation studies on up to 131,072 cores are aided by a new visualization of the dragon y network.« less

Computing the shape of brain networks using graph filtration and Gromov-Hausdorff metric.

PubMed

Lee, Hyekyoung; Chung, Moo K; Kang, Hyejin; Kim, Boong-Nyun; Lee, Dong Soo

2011-01-01

The difference between networks has been often assessed by the difference of global topological measures such as the clustering coefficient, degree distribution and modularity. In this paper, we introduce a new framework for measuring the network difference using the Gromov-Hausdorff (GH) distance, which is often used in shape analysis. In order to apply the GH distance, we define the shape of the brain network by piecing together the patches of locally connected nearest neighbors using the graph filtration. The shape of the network is then transformed to an algebraic form called the single linkage matrix. The single linkage matrix is subsequently used in measuring network differences using the GH distance. As an illustration, we apply the proposed framework to compare the FDG-PET based functional brain networks out of 24 attention deficit hyperactivity disorder (ADHD) children, 26 autism spectrum disorder (ASD) children and 11 pediatric control subjects.

Data on the key performance indicators for quality of service of GSM networks in Nigeria.

PubMed

Popoola, Segun I; Atayero, Aderemi A; Faruk, Nasir; Badejo, Joke A

2018-02-01

In this data article, the Key Performance Indicators (KPIs) for Quality of Service (QoS) of Global System for Mobile Communications (GSM) networks in Nigeria are provided and analyzed. The data provided in this paper contain the Call Setup Success Rate (CSSR), Drop Call Rate (DCR), Stand-alone Dedicated Channel (SDCCH) congestion, and Traffic Channel (TCH) congestion for the four GSM network operators in Nigeria (Airtel, Etisalat, Glo, and MTN). These comprehensive data were obtained from the Nigerian Communications Commission (NCC). Significant differences in each of the KPIs for the four quarters of each year were presented based on Analysis of Variance (ANOVA). The values of the KPIs were plotted against the months of the year for better visualization and understanding of data trends across the four quarters. Multiple comparisons of the mean-quarterly differences of the KPIs were also presented using Tukey's Post Hoc test. Public availability and further interpretation and discussion of these useful information will assist the network providers, Nigerian government, local and international regulatory bodies, policy makers, and other stakeholders in ensuring access of people, machines, and things to high quality telecommunications services.

The ground truth about metadata and community detection in networks.

PubMed

Peel, Leto; Larremore, Daniel B; Clauset, Aaron

2017-05-01

Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system's components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate the performance of community detection algorithms by their ability to find so-called ground truth communities. This works well in synthetic networks with planted communities because these networks' links are formed explicitly based on those known communities. However, there are no planted communities in real-world networks. Instead, it is standard practice to treat some observed discrete-valued node attributes, or metadata, as ground truth. We show that metadata are not the same as ground truth and that treating them as such induces severe theoretical and practical problems. We prove that no algorithm can uniquely solve community detection, and we prove a general No Free Lunch theorem for community detection, which implies that there can be no algorithm that is optimal for all possible community detection tasks. However, community detection remains a powerful tool and node metadata still have value, so a careful exploration of their relationship with network structure can yield insights of genuine worth. We illustrate this point by introducing two statistical techniques that can quantify the relationship between metadata and community structure for a broad class of models. We demonstrate these techniques using both synthetic and real-world networks, and for multiple types of metadata and community structures.

Phylogenetic diversity and biodiversity indices on phylogenetic networks.

PubMed

Wicke, Kristina; Fischer, Mareike

2018-04-01

In biodiversity conservation it is often necessary to prioritize the species to conserve. Existing approaches to prioritization, e.g. the Fair Proportion Index and the Shapley Value, are based on phylogenetic trees and rank species according to their contribution to overall phylogenetic diversity. However, in many cases evolution is not treelike and thus, phylogenetic networks have been developed as a generalization of phylogenetic trees, allowing for the representation of non-treelike evolutionary events, such as hybridization. Here, we extend the concepts of phylogenetic diversity and phylogenetic diversity indices from phylogenetic trees to phylogenetic networks. On the one hand, we consider the treelike content of a phylogenetic network, e.g. the (multi)set of phylogenetic trees displayed by a network and the so-called lowest stable ancestor tree associated with it. On the other hand, we derive the phylogenetic diversity of subsets of taxa and biodiversity indices directly from the internal structure of the network. We consider both approaches that are independent of so-called inheritance probabilities as well as approaches that explicitly incorporate these probabilities. Furthermore, we introduce our software package NetDiversity, which is implemented in Perl and allows for the calculation of all generalized measures of phylogenetic diversity and generalized phylogenetic diversity indices established in this note that are independent of inheritance probabilities. We apply our methods to a phylogenetic network representing the evolutionary relationships among swordtails and platyfishes (Xiphophorus: Poeciliidae), a group of species characterized by widespread hybridization. Copyright © 2018 Elsevier Inc. All rights reserved.

Constructive autoassociative neural network for facial recognition.

PubMed

Fernandes, Bruno J T; Cavalcanti, George D C; Ren, Tsang I

2014-01-01

Autoassociative artificial neural networks have been used in many different computer vision applications. However, it is difficult to define the most suitable neural network architecture because this definition is based on previous knowledge and depends on the problem domain. To address this problem, we propose a constructive autoassociative neural network called CANet (Constructive Autoassociative Neural Network). CANet integrates the concepts of receptive fields and autoassociative memory in a dynamic architecture that changes the configuration of the receptive fields by adding new neurons in the hidden layer, while a pruning algorithm removes neurons from the output layer. Neurons in the CANet output layer present lateral inhibitory connections that improve the recognition rate. Experiments in face recognition and facial expression recognition show that the CANet outperforms other methods presented in the literature.

ZERO: probabilistic routing for deploy and forget Wireless Sensor Networks.

PubMed

Vilajosana, Xavier; Llosa, Jordi; Pacho, Jose Carlos; Vilajosana, Ignasi; Juan, Angel A; Vicario, Jose Lopez; Morell, Antoni

2010-01-01

As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols route data through most reliable links aiming to ensure 99% packet delivery. However, they suffer from the so-called "hot spot" problem. Most reliable routes waste their energy fast, thus partitioning the network and reducing the area monitored. To cope with this "hot spot" problem we propose ZERO a combined approach at Network and Link layers to increase network lifespan while conserving reliability levels by means of probabilistic load balancing techniques.

Emergence of bursts and communities in evolving weighted networks.

PubMed

Jo, Hang-Hyun; Pan, Raj Kumar; Kaski, Kimmo

2011-01-01

Understanding the patterns of human dynamics and social interaction and the way they lead to the formation of an organized and functional society are important issues especially for techno-social development. Addressing these issues of social networks has recently become possible through large scale data analysis of mobile phone call records, which has revealed the existence of modular or community structure with many links between nodes of the same community and relatively few links between nodes of different communities. The weights of links, e.g., the number of calls between two users, and the network topology are found correlated such that intra-community links are stronger compared to the weak inter-community links. This feature is known as Granovetter's "The strength of weak ties" hypothesis. In addition to this inhomogeneous community structure, the temporal patterns of human dynamics turn out to be inhomogeneous or bursty, characterized by the heavy tailed distribution of time interval between two consecutive events, i.e., inter-event time. In this paper, we study how the community structure and the bursty dynamics emerge together in a simple evolving weighted network model. The principal mechanisms behind these patterns are social interaction by cyclic closure, i.e., links to friends of friends and the focal closure, links to individuals sharing similar attributes or interests, and human dynamics by task handling process. These three mechanisms have been implemented as a network model with local attachment, global attachment, and priority-based queuing processes. By comprehensive numerical simulations we show that the interplay of these mechanisms leads to the emergence of heavy tailed inter-event time distribution and the evolution of Granovetter-type community structure. Moreover, the numerical results are found to be in qualitative agreement with empirical analysis results from mobile phone call dataset.

Sharing programming resources between Bio* projects through remote procedure call and native call stack strategies.

PubMed

Prins, Pjotr; Goto, Naohisa; Yates, Andrew; Gautier, Laurent; Willis, Scooter; Fields, Christopher; Katayama, Toshiaki

2012-01-01

Open-source software (OSS) encourages computer programmers to reuse software components written by others. In evolutionary bioinformatics, OSS comes in a broad range of programming languages, including C/C++, Perl, Python, Ruby, Java, and R. To avoid writing the same functionality multiple times for different languages, it is possible to share components by bridging computer languages and Bio* projects, such as BioPerl, Biopython, BioRuby, BioJava, and R/Bioconductor. In this chapter, we compare the two principal approaches for sharing software between different programming languages: either by remote procedure call (RPC) or by sharing a local call stack. RPC provides a language-independent protocol over a network interface; examples are RSOAP and Rserve. The local call stack provides a between-language mapping not over the network interface, but directly in computer memory; examples are R bindings, RPy, and languages sharing the Java Virtual Machine stack. This functionality provides strategies for sharing of software between Bio* projects, which can be exploited more often. Here, we present cross-language examples for sequence translation, and measure throughput of the different options. We compare calling into R through native R, RSOAP, Rserve, and RPy interfaces, with the performance of native BioPerl, Biopython, BioJava, and BioRuby implementations, and with call stack bindings to BioJava and the European Molecular Biology Open Software Suite. In general, call stack approaches outperform native Bio* implementations and these, in turn, outperform RPC-based approaches. To test and compare strategies, we provide a downloadable BioNode image with all examples, tools, and libraries included. The BioNode image can be run on VirtualBox-supported operating systems, including Windows, OSX, and Linux.

Persistence of social signatures in human communication.

PubMed

Saramäki, Jari; Leicht, E A; López, Eduardo; Roberts, Sam G B; Reed-Tsochas, Felix; Dunbar, Robin I M

2014-01-21

The social network maintained by a focal individual, or ego, is intrinsically dynamic and typically exhibits some turnover in membership over time as personal circumstances change. However, the consequences of such changes on the distribution of an ego's network ties are not well understood. Here we use a unique 18-mo dataset that combines mobile phone calls and survey data to track changes in the ego networks and communication patterns of students making the transition from school to university or work. Our analysis reveals that individuals display a distinctive and robust social signature, captured by how interactions are distributed across different alters. Notably, for a given ego, these social signatures tend to persist over time, despite considerable turnover in the identity of alters in the ego network. Thus, as new network members are added, some old network members either are replaced or receive fewer calls, preserving the overall distribution of calls across network members. This is likely to reflect the consequences of finite resources such as the time available for communication, the cognitive and emotional effort required to sustain close relationships, and the ability to make emotional investments.

Persistence of social signatures in human communication

PubMed Central

Saramäki, Jari; Leicht, E. A.; López, Eduardo; Roberts, Sam G. B.; Reed-Tsochas, Felix; Dunbar, Robin I. M.

2014-01-01

The social network maintained by a focal individual, or ego, is intrinsically dynamic and typically exhibits some turnover in membership over time as personal circumstances change. However, the consequences of such changes on the distribution of an ego’s network ties are not well understood. Here we use a unique 18-mo dataset that combines mobile phone calls and survey data to track changes in the ego networks and communication patterns of students making the transition from school to university or work. Our analysis reveals that individuals display a distinctive and robust social signature, captured by how interactions are distributed across different alters. Notably, for a given ego, these social signatures tend to persist over time, despite considerable turnover in the identity of alters in the ego network. Thus, as new network members are added, some old network members either are replaced or receive fewer calls, preserving the overall distribution of calls across network members. This is likely to reflect the consequences of finite resources such as the time available for communication, the cognitive and emotional effort required to sustain close relationships, and the ability to make emotional investments. PMID:24395777

Designing Personalized Learning Products for Middle School Mathematics: The Case for Networked Learning Games

ERIC Educational Resources Information Center

Evans, Michael A.; Pruett, Jordan; Chang, Mido; Nino, Miguel

2014-01-01

Middle school mathematics education is subject to ongoing reform based on advances in digital instructional technologies, especially learning games, leading to recent calls for investment in "personalized learning." Through an extensive literature review, this investigation identified three priority areas that should be taken into…

Application of Hierarchy Theory to Cross-Scale Hydrologic Modeling of Nutrient Loads

EPA Science Inventory

We describe a model called Regional Hydrologic Modeling for Environmental Evaluation 16 (RHyME²) for quantifying annual nutrient loads in stream networks and watersheds. RHyME² is 17 a cross-scale statistical and process-based water-quality model. The model ...

Software GOLUCA: Knowledge Representation in Mental Calculation

ERIC Educational Resources Information Center

Casas-Garcia, Luis M.; Luengo-Gonzalez, Ricardo; Godinho-Lopes, Vitor

2011-01-01

We present a new software, called Goluca (Godinho, Luengo, and Casas, 2007), based on the technique of Pathfinder Associative Networks (Schvaneveldt, 1989), which produces graphical representations of the cognitive structure of individuals in a given field knowledge. In this case, we studied the strategies used by teachers and its relationship…

47 CFR 64.601 - Definitions and provisions of general applicability.

Code of Federal Regulations, 2014 CFR

2014-10-01

... a text telephone (TTY) and the public switched telephone network. (18) IP Relay access technology... used to make and receive an Internet-based TRS call. (20) Neutral Video Communication Service Platform... by the Neutral Video Communication Service Platform include the provision of a video link, user...

47 CFR 64.601 - Definitions and provisions of general applicability.

Code of Federal Regulations, 2013 CFR

2013-10-01

... a text telephone (TTY) and the public switched telephone network. (18) IP Relay access technology... used to make and receive an Internet-based TRS call. (20) Neutral Video Communication Service Platform... by the Neutral Video Communication Service Platform include the provision of a video link, user...

A Novel Dual Separate Paths (DSP) Algorithm Providing Fault-Tolerant Communication for Wireless Sensor Networks.

PubMed

Tien, Nguyen Xuan; Kim, Semog; Rhee, Jong Myung; Park, Sang Yoon

2017-07-25

Fault tolerance has long been a major concern for sensor communications in fault-tolerant cyber physical systems (CPSs). Network failure problems often occur in wireless sensor networks (WSNs) due to various factors such as the insufficient power of sensor nodes, the dislocation of sensor nodes, the unstable state of wireless links, and unpredictable environmental interference. Fault tolerance is thus one of the key requirements for data communications in WSN applications. This paper proposes a novel path redundancy-based algorithm, called dual separate paths (DSP), that provides fault-tolerant communication with the improvement of the network traffic performance for WSN applications, such as fault-tolerant CPSs. The proposed DSP algorithm establishes two separate paths between a source and a destination in a network based on the network topology information. These paths are node-disjoint paths and have optimal path distances. Unicast frames are delivered from the source to the destination in the network through the dual paths, providing fault-tolerant communication and reducing redundant unicast traffic for the network. The DSP algorithm can be applied to wired and wireless networks, such as WSNs, to provide seamless fault-tolerant communication for mission-critical and life-critical applications such as fault-tolerant CPSs. The analyzed and simulated results show that the DSP-based approach not only provides fault-tolerant communication, but also improves network traffic performance. For the case study in this paper, when the DSP algorithm was applied to high-availability seamless redundancy (HSR) networks, the proposed DSP-based approach reduced the network traffic by 80% to 88% compared with the standard HSR protocol, thus improving network traffic performance.

Cooperation in memory-based prisoner's dilemma game on interdependent networks

NASA Astrophysics Data System (ADS)

Luo, Chao; Zhang, Xiaolin; Liu, Hong; Shao, Rui

2016-05-01

Memory or so-called experience normally plays the important role to guide the human behaviors in real world, that is essential for rational decisions made by individuals. Hence, when the evolutionary behaviors of players with bounded rationality are investigated, it is reasonable to make an assumption that players in system are with limited memory. Besides, in order to unravel the intricate variability of complex systems in real world and make a highly integrative understanding of their dynamics, in recent years, interdependent networks as a comprehensive network structure have obtained more attention in this community. In this article, the evolution of cooperation in memory-based prisoner's dilemma game (PDG) on interdependent networks composed by two coupled square lattices is studied. Herein, all or part of players are endowed with finite memory ability, and we focus on the mutual influence of memory effect and interdependent network reciprocity on cooperation of spatial PDG. We show that the density of cooperation can be significantly promoted within an optimal region of memory length and interdependent strength. Furthermore, distinguished by whether having memory ability/external links or not, each kind of players on networks would have distinct evolutionary behaviors. Our work could be helpful to understand the emergence and maintenance of cooperation under the evolution of memory-based players on interdependent networks.

Simple Peer-to-Peer SIP Privacy

NASA Astrophysics Data System (ADS)

Koskela, Joakim; Tarkoma, Sasu

In this paper, we introduce a model for enhancing privacy in peer-to-peer communication systems. The model is based on data obfuscation, preventing intermediate nodes from tracking calls, while still utilizing the shared resources of the peer network. This increases security when moving between untrusted, limited and ad-hoc networks, when the user is forced to rely on peer-to-peer schemes. The model is evaluated using a Host Identity Protocol-based prototype on mobile devices, and is found to provide good privacy, especially when combined with a source address hiding scheme. The contribution of this paper is to present the model and results obtained from its use, including usability considerations.

Aeronautical Satellite-Assisted Process for Information Exchange Through Network Technologies (Aero-SAPIENT) Conducted

NASA Technical Reports Server (NTRS)

Zernic, Michael J.

2002-01-01

Broadband satellite communications for aeronautics marries communication and network technologies to address NASA's goals in information technology base research and development, thereby serving the safety and capacity needs of the National Airspace System. This marriage of technology increases the interactivity between airborne vehicles and ground systems. It improves decision-making and efficiency, reduces operation costs, and improves the safety and capacity of the National Airspace System. To this end, a collaborative project called the Aeronautical Satellite Assisted Process for Information Exchange through Network Technologies, or Aero-SAPIENT, was conducted out of Tinker AFB, Oklahoma, during November and December 2000.

ACTS TDMA network control. [Advanced Communication Technology Satellite

NASA Technical Reports Server (NTRS)

Inukai, T.; Campanella, S. J.

1984-01-01

This paper presents basic network control concepts for the Advanced Communications Technology Satellite (ACTS) System. Two experimental systems, called the low-burst-rate and high-burst-rate systems, along with ACTS ground system features, are described. The network control issues addressed include frame structures, acquisition and synchronization procedures, coordinated station burst-time plan and satellite-time plan changes, on-board clock control based on ground drift measurements, rain fade control by means of adaptive forward-error-correction (FEC) coding and transmit power augmentation, and reassignment of channel capacities on demand. The NASA ground system, which includes a primary station, diversity station, and master control station, is also described.

Probabilistic Priority Message Checking Modeling Based on Controller Area Networks

NASA Astrophysics Data System (ADS)

Lin, Cheng-Min

Although the probabilistic model checking tool called PRISM has been applied in many communication systems, such as wireless local area network, Bluetooth, and ZigBee, the technique is not used in a controller area network (CAN). In this paper, we use PRISM to model the mechanism of priority messages for CAN because the mechanism has allowed CAN to become the leader in serial communication for automobile and industry control. Through modeling CAN, it is easy to analyze the characteristic of CAN for further improving the security and efficiency of automobiles. The Markov chain model helps us to model the behaviour of priority messages.

PROPER: global protein interaction network alignment through percolation matching.

PubMed

Kazemi, Ehsan; Hassani, Hamed; Grossglauser, Matthias; Pezeshgi Modarres, Hassan

2016-12-12

The alignment of protein-protein interaction (PPI) networks enables us to uncover the relationships between different species, which leads to a deeper understanding of biological systems. Network alignment can be used to transfer biological knowledge between species. Although different PPI-network alignment algorithms were introduced during the last decade, developing an accurate and scalable algorithm that can find alignments with high biological and structural similarities among PPI networks is still challenging. In this paper, we introduce a new global network alignment algorithm for PPI networks called PROPER. Compared to other global network alignment methods, our algorithm shows higher accuracy and speed over real PPI datasets and synthetic networks. We show that the PROPER algorithm can detect large portions of conserved biological pathways between species. Also, using a simple parsimonious evolutionary model, we explain why PROPER performs well based on several different comparison criteria. We highlight that PROPER has high potential in further applications such as detecting biological pathways, finding protein complexes and PPI prediction. The PROPER algorithm is available at http://proper.epfl.ch .

Identifying important nodes by adaptive LeaderRank

NASA Astrophysics Data System (ADS)

Xu, Shuang; Wang, Pei

2017-03-01

Spreading process is a common phenomenon in complex networks. Identifying important nodes in complex networks is of great significance in real-world applications. Based on the spreading process on networks, a lot of measures have been proposed to evaluate the importance of nodes. However, most of the existing measures are appropriate to static networks, which are fragile to topological perturbations. Many real-world complex networks are dynamic rather than static, meaning that the nodes and edges of such networks may change with time, which challenge numerous existing centrality measures. Based on a new weighted mechanism and the newly proposed H-index and LeaderRank (LR), this paper introduces a variant of the LR measure, called adaptive LeaderRank (ALR), which is a new member of the LR-family. Simulations on six real-world networks reveal that the new measure can well balance between prediction accuracy and robustness. More interestingly, the new measure can better adapt to the adjustment or local perturbations of network topologies, as compared with the existing measures. By discussing the detailed properties of the measures from the LR-family, we illustrate that the ALR has its competitive advantages over the other measures. The proposed algorithm enriches the measures to understand complex networks, and may have potential applications in social networks and biological systems.

Self-organized network of fractal-shaped components coupled through statistical interaction.

PubMed

Ugajin, R

2001-09-01

A dissipative dynamics is introduced to generate self-organized networks of interacting objects, which we call coupled-fractal networks. The growth model is constructed based on a growth hypothesis in which the growth rate of each object is a product of the probability of receiving source materials from faraway and the probability of receiving adhesives from other grown objects, where each object grows to be a random fractal if isolated, but connects with others if glued. The network is governed by the statistical interaction between fractal-shaped components, which can only be identified in a statistical manner over ensembles. This interaction is investigated using the degree of correlation between fractal-shaped components, enabling us to determine whether it is attractive or repulsive.

47 CFR 64.1600 - Definitions.

Code of Federal Regulations, 2010 CFR

2010-10-01

...) Aggregate information. The term “aggregate information” means collective data that relate to a group or... Signaling System 7 network. (d) Charge number. The term “charge number” refers to the delivery of the... Signaling System 7 network, that indicates whether the calling party authorizes presentation of the calling...

Hybrid discrete-time neural networks.

PubMed

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

Inclusion of tank configurations as a variable in the cost optimization of branched piped-water networks

NASA Astrophysics Data System (ADS)

Hooda, Nikhil; Damani, Om

2017-06-01

The classic problem of the capital cost optimization of branched piped networks consists of choosing pipe diameters for each pipe in the network from a discrete set of commercially available pipe diameters. Each pipe in the network can consist of multiple segments of differing diameters. Water networks also consist of intermediate tanks that act as buffers between incoming flow from the primary source and the outgoing flow to the demand nodes. The network from the primary source to the tanks is called the primary network, and the network from the tanks to the demand nodes is called the secondary network. During the design stage, the primary and secondary networks are optimized separately, with the tanks acting as demand nodes for the primary network. Typically the choice of tank locations, their elevations, and the set of demand nodes to be served by different tanks is manually made in an ad hoc fashion before any optimization is done. It is desirable therefore to include this tank configuration choice in the cost optimization process itself. In this work, we explain why the choice of tank configuration is important to the design of a network and describe an integer linear program model that integrates the tank configuration to the standard pipe diameter selection problem. In order to aid the designers of piped-water networks, the improved cost optimization formulation is incorporated into our existing network design system called JalTantra.

Information Flow in Interaction Networks II: Channels, Path Lengths, and Potentials

PubMed Central

Stojmirović, Aleksandar

2012-01-01

Abstract In our previous publication, a framework for information flow in interaction networks based on random walks with damping was formulated with two fundamental modes: emitting and absorbing. While many other network analysis methods based on random walks or equivalent notions have been developed before and after our earlier work, one can show that they can all be mapped to one of the two modes. In addition to these two fundamental modes, a major strength of our earlier formalism was its accommodation of context-specific directed information flow that yielded plausible and meaningful biological interpretation of protein functions and pathways. However, the directed flow from origins to destinations was induced via a potential function that was heuristic. Here, with a theoretically sound approach called the channel mode, we extend our earlier work for directed information flow. This is achieved by constructing a potential function facilitating a purely probabilistic interpretation of the channel mode. For each network node, the channel mode combines the solutions of emitting and absorbing modes in the same context, producing what we call a channel tensor. The entries of the channel tensor at each node can be interpreted as the amount of flow passing through that node from an origin to a destination. Similarly to our earlier model, the channel mode encompasses damping as a free parameter that controls the locality of information flow. Through examples involving the yeast pheromone response pathway, we illustrate the versatility and stability of our new framework. PMID:22409812

Assuring SS7 dependability: A robustness characterization of signaling network elements

NASA Astrophysics Data System (ADS)

Karmarkar, Vikram V.

1994-04-01

Current and evolving telecommunication services will rely on signaling network performance and reliability properties to build competitive call and connection control mechanisms under increasing demands on flexibility without compromising on quality. The dimensions of signaling dependability most often evaluated are the Rate of Call Loss and End-to-End Route Unavailability. A third dimension of dependability that captures the concern about large or catastrophic failures can be termed Network Robustness. This paper is concerned with the dependability aspects of the evolving Signaling System No. 7 (SS7) networks and attempts to strike a balance between the probabilistic and deterministic measures that must be evaluated to accomplish a risk-trend assessment to drive architecture decisions. Starting with high-level network dependability objectives and field experience with SS7 in the U.S., potential areas of growing stringency in network element (NE) dependability are identified to improve against current measures of SS7 network quality, as per-call signaling interactions increase. A sensitivity analysis is presented to highlight the impact due to imperfect coverage of duplex network component or element failures (i.e., correlated failures), to assist in the setting of requirements on NE robustness. A benefit analysis, covering several dimensions of dependability, is used to generate the domain of solutions available to the network architect in terms of network and network element fault tolerance that may be specified to meet the desired signaling quality goals.

Leveraging multiple gene networks to prioritize GWAS candidate genes via network representation learning.

PubMed

Wu, Mengmeng; Zeng, Wanwen; Liu, Wenqiang; Lv, Hairong; Chen, Ting; Jiang, Rui

2018-06-03

Genome-wide association studies (GWAS) have successfully discovered a number of disease-associated genetic variants in the past decade, providing an unprecedented opportunity for deciphering genetic basis of human inherited diseases. However, it is still a challenging task to extract biological knowledge from the GWAS data, due to such issues as missing heritability and weak interpretability. Indeed, the fact that the majority of discovered loci fall into noncoding regions without clear links to genes has been preventing the characterization of their functions and appealing for a sophisticated approach to bridge genetic and genomic studies. Towards this problem, network-based prioritization of candidate genes, which performs integrated analysis of gene networks with GWAS data, has emerged as a promising direction and attracted much attention. However, most existing methods overlook the sparse and noisy properties of gene networks and thus may lead to suboptimal performance. Motivated by this understanding, we proposed a novel method called REGENT for integrating multiple gene networks with GWAS data to prioritize candidate genes for complex diseases. We leveraged a technique called the network representation learning to embed a gene network into a compact and robust feature space, and then designed a hierarchical statistical model to integrate features of multiple gene networks with GWAS data for the effective inference of genes associated with a disease of interest. We applied our method to six complex diseases and demonstrated the superior performance of REGENT over existing approaches in recovering known disease-associated genes. We further conducted a pathway analysis and showed that the ability of REGENT to discover disease-associated pathways. We expect to see applications of our method to a broad spectrum of diseases for post-GWAS analysis. REGENT is freely available at https://github.com/wmmthu/REGENT. Copyright © 2018 Elsevier Inc. All rights reserved.

Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks.

PubMed

Smerlak, Matteo; Stoll, Brady; Gupta, Agam; Magdanz, James S

2015-01-01

The financial crisis illustrated the need for a functional understanding of systemic risk in strongly interconnected financial structures. Dynamic processes on complex networks being intrinsically difficult to model analytically, most recent studies of this problem have relied on numerical simulations. Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters, such as interest rates and leverage ratios. We obtain a closed-form formula for the "critical degree" (the number of creditors per bank below which an individual shock can propagate throughout the network), and relate failures distributions to network topologies, in particular scalefree ones. Our criterion for the onset of contagion turns out to be isomorphic to the condition for cooperation to evolve on graphs and social networks, as recently formulated in evolutionary game theory. This remarkable connection supports recent calls for a methodological rapprochement between finance and ecology.

SiBIC: a web server for generating gene set networks based on biclusters obtained by maximal frequent itemset mining.

PubMed

Takahashi, Kei-ichiro; Takigawa, Ichigaku; Mamitsuka, Hiroshi

2013-01-01

Detecting biclusters from expression data is useful, since biclusters are coexpressed genes under only part of all given experimental conditions. We present a software called SiBIC, which from a given expression dataset, first exhaustively enumerates biclusters, which are then merged into rather independent biclusters, which finally are used to generate gene set networks, in which a gene set assigned to one node has coexpressed genes. We evaluated each step of this procedure: 1) significance of the generated biclusters biologically and statistically, 2) biological quality of merged biclusters, and 3) biological significance of gene set networks. We emphasize that gene set networks, in which nodes are not genes but gene sets, can be more compact than usual gene networks, meaning that gene set networks are more comprehensible. SiBIC is available at http://utrecht.kuicr.kyoto-u.ac.jp:8080/miami/faces/index.jsp.

Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks

PubMed Central

Smerlak, Matteo; Stoll, Brady; Gupta, Agam; Magdanz, James S.

2015-01-01

The financial crisis illustrated the need for a functional understanding of systemic risk in strongly interconnected financial structures. Dynamic processes on complex networks being intrinsically difficult to model analytically, most recent studies of this problem have relied on numerical simulations. Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters, such as interest rates and leverage ratios. We obtain a closed-form formula for the “critical degree” (the number of creditors per bank below which an individual shock can propagate throughout the network), and relate failures distributions to network topologies, in particular scalefree ones. Our criterion for the onset of contagion turns out to be isomorphic to the condition for cooperation to evolve on graphs and social networks, as recently formulated in evolutionary game theory. This remarkable connection supports recent calls for a methodological rapprochement between finance and ecology. PMID:26207631

Modeling complex metabolic reactions, ecological systems, and financial and legal networks with MIANN models based on Markov-Wiener node descriptors.

PubMed

Duardo-Sánchez, Aliuska; Munteanu, Cristian R; Riera-Fernández, Pablo; López-Díaz, Antonio; Pazos, Alejandro; González-Díaz, Humberto

2014-01-27

The use of numerical parameters in Complex Network analysis is expanding to new fields of application. At a molecular level, we can use them to describe the molecular structure of chemical entities, protein interactions, or metabolic networks. However, the applications are not restricted to the world of molecules and can be extended to the study of macroscopic nonliving systems, organisms, or even legal or social networks. On the other hand, the development of the field of Artificial Intelligence has led to the formulation of computational algorithms whose design is based on the structure and functioning of networks of biological neurons. These algorithms, called Artificial Neural Networks (ANNs), can be useful for the study of complex networks, since the numerical parameters that encode information of the network (for example centralities/node descriptors) can be used as inputs for the ANNs. The Wiener index (W) is a graph invariant widely used in chemoinformatics to quantify the molecular structure of drugs and to study complex networks. In this work, we explore for the first time the possibility of using Markov chains to calculate analogues of node distance numbers/W to describe complex networks from the point of view of their nodes. These parameters are called Markov-Wiener node descriptors of order k(th) (W(k)). Please, note that these descriptors are not related to Markov-Wiener stochastic processes. Here, we calculated the W(k)(i) values for a very high number of nodes (>100,000) in more than 100 different complex networks using the software MI-NODES. These networks were grouped according to the field of application. Molecular networks include the Metabolic Reaction Networks (MRNs) of 40 different organisms. In addition, we analyzed other biological and legal and social networks. These include the Interaction Web Database Biological Networks (IWDBNs), with 75 food webs or ecological systems and the Spanish Financial Law Network (SFLN). The calculated W(k)(i) values were used as inputs for different ANNs in order to discriminate correct node connectivity patterns from incorrect random patterns. The MIANN models obtained present good values of Sensitivity/Specificity (%): MRNs (78/78), IWDBNs (90/88), and SFLN (86/84). These preliminary results are very promising from the point of view of a first exploratory study and suggest that the use of these models could be extended to the high-throughput re-evaluation of connectivity in known complex networks (collation).

Intelligent call admission control for multi-class services in mobile cellular networks

NASA Astrophysics Data System (ADS)

Ma, Yufeng; Hu, Xiulin; Zhang, Yunyu

2005-11-01

Scarcity of the spectrum resource and mobility of users make quality of service (QoS) provision a critical issue in mobile cellular networks. This paper presents a fuzzy call admission control scheme to meet the requirement of the QoS. A performance measure is formed as a weighted linear function of new call and handoff call blocking probabilities of each service class. Simulation compares the proposed fuzzy scheme with complete sharing and guard channel policies. Simulation results show that fuzzy scheme has a better robust performance in terms of average blocking criterion.

Neural Net-Based Redesign of Transonic Turbines for Improved Unsteady Aerodynamic Performance

NASA Technical Reports Server (NTRS)

Madavan, Nateri K.; Rai, Man Mohan; Huber, Frank W.

1998-01-01

A recently developed neural net-based aerodynamic design procedure is used in the redesign of a transonic turbine stage to improve its unsteady aerodynamic performance. The redesign procedure used incorporates the advantages of both traditional response surface methodology (RSM) and neural networks by employing a strategy called parameter-based partitioning of the design space. Starting from the reference design, a sequence of response surfaces based on both neural networks and polynomial fits are constructed to traverse the design space in search of an optimal solution that exhibits improved unsteady performance. The procedure combines the power of neural networks and the economy of low-order polynomials (in terms of number of simulations required and network training requirements). A time-accurate, two-dimensional, Navier-Stokes solver is used to evaluate the various intermediate designs and provide inputs to the optimization procedure. The optimization procedure yields a modified design that improves the aerodynamic performance through small changes to the reference design geometry. The computed results demonstrate the capabilities of the neural net-based design procedure, and also show the tremendous advantages that can be gained by including high-fidelity unsteady simulations that capture the relevant flow physics in the design optimization process.

Architecture design and performance evaluation of multigranularity optical networks based on optical code division multiplexing

NASA Astrophysics Data System (ADS)

Huang, Shaowei; Baba, Ken-Ichi; Murata, Masayuki; Kitayama, Ken-Ichi

2006-12-01

In traditional lambda-based multigranularity optical networks, a lambda is always treated as the basic routing unit, resulting in low wavelength utilization. On the basis of optical code division multiplexing (OCDM) technology, a novel OCDM-based multigranularity optical cross-connect (MG-OXC) is proposed. Compared with the traditional lambda-based MG-OXC, its switching capability has been extended to support fiber switching, waveband switching, lambda switching, and OCDM switching. In a network composed of OCDM-based MG-OXCs, a single wavelength can be shared by distinct label switched paths (LSPs) called OCDM-LSPs, and OCDM-LSP switching can be implemented in the optical domain. To improve the network flexibility for an OCDM-LSP provisioning, two kinds of switches enabling hybrid optical code (OC)-wavelength conversion are designed. Simulation results indicate that a blocking probability reduction of 2 orders can be obtained by deploying only five OCs to a single wavelength. Furthermore, compared with time-division-multiplexing LSP (TDM-LSP), owing to the asynchronous accessibility and the OC conversion, OCDM-LSPs have been shown to permit a simpler switch architecture and achieve better blocking performance than TDM-LSPs.

Lightweight SIP/SDP compression scheme (LSSCS)

NASA Astrophysics Data System (ADS)

Wu, Jian J.; Demetrescu, Cristian

2001-10-01

In UMTS new IP based services with tight delay constraints will be deployed over the W-CDMA air interface such as IP multimedia and interactive services. To integrate the wireline and wireless IP services, 3GPP standard forum adopted the Session Initiation Protocol (SIP) as the call control protocol for the UMTS Release 5, which will implement next generation, all IP networks for real-time QoS services. In the current form the SIP protocol is not suitable for wireless transmission due to its large message size which will need either a big radio pipe for transmission or it will take far much longer to transmit than the current GSM Call Control (CC) message sequence. In this paper we present a novel compression algorithm called Lightweight SIP/SDP Compression Scheme (LSSCS), which acts at the SIP application layer and therefore removes the information redundancy before it is sent to the network and transport layer. A binary octet-aligned header is added to the compressed SIP/SDP message before sending it to the network layer. The receiver uses this binary header as well as the pre-cached information to regenerate the original SIP/SDP message. The key features of the LSSCS compression scheme are presented in this paper along with implementation examples. It is shown that this compression algorithm makes SIP transmission efficient over the radio interface without losing the SIP generality and flexibility.

Experimental high-speed network

NASA Astrophysics Data System (ADS)

McNeill, Kevin M.; Klein, William P.; Vercillo, Richard; Alsafadi, Yasser H.; Parra, Miguel V.; Dallas, William J.

1993-09-01

Many existing local area networking protocols currently applied in medical imaging were originally designed for relatively low-speed, low-volume networking. These protocols utilize small packet sizes appropriate for text based communication. Local area networks of this type typically provide raw bandwidth under 125 MHz. These older network technologies are not optimized for the low delay, high data traffic environment of a totally digital radiology department. Some current implementations use point-to-point links when greater bandwidth is required. However, the use of point-to-point communications for a total digital radiology department network presents many disadvantages. This paper describes work on an experimental multi-access local area network called XFT. The work includes the protocol specification, and the design and implementation of network interface hardware and software. The protocol specifies the Physical and Data Link layers (OSI layers 1 & 2) for a fiber-optic based token ring providing a raw bandwidth of 500 MHz. The protocol design and implementation of the XFT interface hardware includes many features to optimize image transfer and provide flexibility for additional future enhancements which include: a modular hardware design supporting easy portability to a variety of host system buses, a versatile message buffer design providing 16 MB of memory, and the capability to extend the raw bandwidth of the network to 3.0 GHz.

An Energy-Efficient and High-Quality Video Transmission Architecture in Wireless Video-Based Sensor Networks.

PubMed

Aghdasi, Hadi S; Abbaspour, Maghsoud; Moghadam, Mohsen Ebrahimi; Samei, Yasaman

2008-08-04

Technological progress in the fields of Micro Electro-Mechanical Systems (MEMS) and wireless communications and also the availability of CMOS cameras, microphones and small-scale array sensors, which may ubiquitously capture multimedia content from the field, have fostered the development of low-cost limited resources Wireless Video-based Sensor Networks (WVSN). With regards to the constraints of videobased sensor nodes and wireless sensor networks, a supporting video stream is not easy to implement with the present sensor network protocols. In this paper, a thorough architecture is presented for video transmission over WVSN called Energy-efficient and high-Quality Video transmission Architecture (EQV-Architecture). This architecture influences three layers of communication protocol stack and considers wireless video sensor nodes constraints like limited process and energy resources while video quality is preserved in the receiver side. Application, transport, and network layers are the layers in which the compression protocol, transport protocol, and routing protocol are proposed respectively, also a dropping scheme is presented in network layer. Simulation results over various environments with dissimilar conditions revealed the effectiveness of the architecture in improving the lifetime of the network as well as preserving the video quality.

Overlapping Community Detection based on Network Decomposition

NASA Astrophysics Data System (ADS)

Ding, Zhuanlian; Zhang, Xingyi; Sun, Dengdi; Luo, Bin

2016-04-01

Community detection in complex network has become a vital step to understand the structure and dynamics of networks in various fields. However, traditional node clustering and relatively new proposed link clustering methods have inherent drawbacks to discover overlapping communities. Node clustering is inadequate to capture the pervasive overlaps, while link clustering is often criticized due to the high computational cost and ambiguous definition of communities. So, overlapping community detection is still a formidable challenge. In this work, we propose a new overlapping community detection algorithm based on network decomposition, called NDOCD. Specifically, NDOCD iteratively splits the network by removing all links in derived link communities, which are identified by utilizing node clustering technique. The network decomposition contributes to reducing the computation time and noise link elimination conduces to improving the quality of obtained communities. Besides, we employ node clustering technique rather than link similarity measure to discover link communities, thus NDOCD avoids an ambiguous definition of community and becomes less time-consuming. We test our approach on both synthetic and real-world networks. Results demonstrate the superior performance of our approach both in computation time and accuracy compared to state-of-the-art algorithms.

Active influence in dynamical models of structural balance in social networks

NASA Astrophysics Data System (ADS)

Summers, Tyler H.; Shames, Iman

2013-07-01

We consider a nonlinear dynamical system on a signed graph, which can be interpreted as a mathematical model of social networks in which the links can have both positive and negative connotations. In accordance with a concept from social psychology called structural balance, the negative links play a key role in both the structure and dynamics of the network. Recent research has shown that in a nonlinear dynamical system modeling the time evolution of “friendliness levels” in the network, two opposing factions emerge from almost any initial condition. Here we study active external influence in this dynamical model and show that any agent in the network can achieve any desired structurally balanced state from any initial condition by perturbing its own local friendliness levels. Based on this result, we also introduce a new network centrality measure for signed networks. The results are illustrated in an international-relations network using United Nations voting record data from 1946 to 2008 to estimate friendliness levels amongst various countries.

Optimal Micropatterns in 2D Transport Networks and Their Relation to Image Inpainting

NASA Astrophysics Data System (ADS)

Brancolini, Alessio; Rossmanith, Carolin; Wirth, Benedikt

2018-04-01

We consider two different variational models of transport networks: the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field, we show for a two-dimensional situation that both highly non-convex network optimization tasks can be transformed into a convex variational problem, which may be very useful from analytical and numerical perspectives. As applications of the convex formulation, we use it to perform numerical simulations (to our knowledge this is the first numerical treatment of urban planning), and we prove a lower bound for the network cost that matches a known upper bound (in terms of how the cost scales in the model parameters) which helps better understand optimal networks and their minimal costs.

A Study of Teacher-Mediated Enhancement of Students' Organization of Earth Science Knowledge Using Web Diagrams as a Teaching Device

NASA Astrophysics Data System (ADS)

Anderson, O. Roger; Contino, Julie

2010-10-01

Current research indicates that students with enhanced knowledge networks are more effective in learning science content and applying higher order thinking skills in open-ended inquiry learning. This research examined teacher implementation of a novel teaching strategy called “web diagramming,” a form of network mapping, in a secondary school earth science class. We report evidence for student improvement in knowledge networking, questionnaire-based reports by the students on the merits of web diagramming in terms of interest and usefulness, and information on the collaborating teacher’s perceptions of the process of implementation, including implications for teacher education. This is among the first reports that teachers can be provided with strategies to enhance student knowledge networking capacity, especially for those students whose initial networking scores are among the lowest.

Can investor sentiment be used to predict the stock price? Dynamic analysis based on China stock market

NASA Astrophysics Data System (ADS)

Guo, Kun; Sun, Yi; Qian, Xin

2017-03-01

With the development of the social network, the interaction between investors in stock market became more fast and convenient. Thus, investor sentiment which can influence their investment decisions may be quickly spread and magnified through the network, and to a certain extent the stock market can be affected. This paper collected the user comments data from a popular professional social networking site of China stock market called Xueqiu, then the investor sentiment data can be obtained through semantic analysis. The dynamic analysis on relationship between investor sentiment and stock market is proposed based on Thermal Optimal Path (TOP) method. The results show that the sentiment data was not always leading over stock market price, and it can be used to predict the stock price only when the stock has high investor attention.

Directional virtual backbone based data aggregation scheme for Wireless Visual Sensor Networks.

PubMed

Zhang, Jing; Liu, Shi-Jian; Tsai, Pei-Wei; Zou, Fu-Min; Ji, Xiao-Rong

2018-01-01

Data gathering is a fundamental task in Wireless Visual Sensor Networks (WVSNs). Features of directional antennas and the visual data make WVSNs more complex than the conventional Wireless Sensor Network (WSN). The virtual backbone is a technique, which is capable of constructing clusters. The version associating with the aggregation operation is also referred to as the virtual backbone tree. In most of the existing literature, the main focus is on the efficiency brought by the construction of clusters that the existing methods neglect local-balance problems in general. To fill up this gap, Directional Virtual Backbone based Data Aggregation Scheme (DVBDAS) for the WVSNs is proposed in this paper. In addition, a measurement called the energy consumption density is proposed for evaluating the adequacy of results in the cluster-based construction problems. Moreover, the directional virtual backbone construction scheme is proposed by considering the local-balanced factor. Furthermore, the associated network coding mechanism is utilized to construct DVBDAS. Finally, both the theoretical analysis of the proposed DVBDAS and the simulations are given for evaluating the performance. The experimental results prove that the proposed DVBDAS achieves higher performance in terms of both the energy preservation and the network lifetime extension than the existing methods.

Creating Reality: How TV News Distorts Events.

ERIC Educational Resources Information Center

Altheide, David L.

A three-year research project, including more than one year in a network affiliate station, provided the material for an analysis of current practices in television news programming. Based on the thesis that the organization of news encourages the oversimplification of events, this analysis traces the foundation of the bias called the "news…

Impacts and Characteristics of Computer-Based Science Inquiry Learning Environments for Precollege Students

ERIC Educational Resources Information Center

Donnelly, Dermot F.; Linn, Marcia C.; Ludvigsen, Sten

2014-01-01

The National Science Foundation-sponsored report "Fostering Learning in the Networked World" called for "a common, open platform to support communities of developers and learners in ways that enable both to take advantage of advances in the learning sciences." We review research on science inquiry learning environments (ILEs)…

Optimizing Mothers' Social Networks: Information-Sharing Strategies

ERIC Educational Resources Information Center

Lashley, Cynthia O'Nell

2010-01-01

Finding high-quality infant care continues to be challenging for many families. Such challenges are even greater for single mothers with limited resources and English language skills. Several years ago, this challenge formed the basis for an urban, center-based program called the Pregnant-Mothers Support Group (PSG). The PSG served single,…

Techniques of Power: Performance Pay Systems and the Network of School Power Relations

ERIC Educational Resources Information Center

Drexler Booth, Caleb

2014-01-01

As decades pass, new rounds of educational discussion surrounding teacher pay emerge calling for alternative compensation based on performance indicators. While much of the research on this latest iteration of performance pay, inspired by the presidential initiatives "No Child Left Behind" and "Race to the Top," focuses on…

Network structure exploration in networks with node attributes

NASA Astrophysics Data System (ADS)

Chen, Yi; Wang, Xiaolong; Bu, Junzhao; Tang, Buzhou; Xiang, Xin

2016-05-01

Complex networks provide a powerful way to represent complex systems and have been widely studied during the past several years. One of the most important tasks of network analysis is to detect structures (also called structural regularities) embedded in networks by determining group number and group partition. Most of network structure exploration models only consider network links. However, in real world networks, nodes may have attributes that are useful for network structure exploration. In this paper, we propose a novel Bayesian nonparametric (BNP) model to explore structural regularities in networks with node attributes, called Bayesian nonparametric attribute (BNPA) model. This model does not only take full advantage of both links between nodes and node attributes for group partition via shared hidden variables, but also determine group number automatically via the Bayesian nonparametric theory. Experiments conducted on a number of real and synthetic networks show that our BNPA model is able to automatically explore structural regularities in networks with node attributes and is competitive with other state-of-the-art models.

Topographic Spreading Analysis of an Empirical Sex Workers' Network

NASA Astrophysics Data System (ADS)

Bjell, Johannes; Canright, Geoffrey; Engø-Monsen, Kenth; Remple, Valencia P.

The problem of epidemic spreading over networks has received considerable attention in recent years, due both to its intrinsic intellectual challenge and to its practical importance. A good recent summary of such work may be found in Newman (8), while (9) gives an outstanding example of a non-trivial prediction which is obtained from explicitly modeling the network in the epidemic spreading. In the language of mathematicians and computer scientists, a network of nodes connected by edges is called a graph. Most work on epidemic spreading over networks focuses on whole-graph properties, such as the percentage of infected nodes at long time. Two of us have, in contrast, focused on understanding the spread of an infection over time and space (the network) (61; 63; 62). This work involves decomposing any given network into subgraphs called regions (61). Regions are precisely defined as disjoint subgraphs which may be viewed as coarse-grained units of infection—in that, once one node in a region is infected, the progress of the infection over the remainder of the region is relatively fast and predictable (63). We note that this approach is based on the ‘Susceptible-Infected’ (SI) model of infection, in which nodes, once infected, are never cured. This model is reasonable for some infections, such as HIV—which is one of the diseases studied here. We also study gonorrhea and chlamydia, for which a more appropriate model is Susceptible-Infected-Susceptible (SIS) (67) (since nodes can be cured); we discuss the limitations of our approach for these cases below.

Enhanced polychronization in a spiking network with metaplasticity.

PubMed

Guise, Mira; Knott, Alistair; Benuskova, Lubica

2015-01-01

Computational models of metaplasticity have usually focused on the modeling of single synapses (Shouval et al., 2002). In this paper we study the effect of metaplasticity on network behavior. Our guiding assumption is that the primary purpose of metaplasticity is to regulate synaptic plasticity, by increasing it when input is low and decreasing it when input is high. For our experiments we adopt a model of metaplasticity that demonstrably has this effect for a single synapse; our primary interest is in how metaplasticity thus defined affects network-level phenomena. We focus on a network-level phenomenon called polychronicity, that has a potential role in representation and memory. A network with polychronicity has the ability to produce non-synchronous but precisely timed sequences of neural firing events that can arise from strongly connected groups of neurons called polychronous neural groups (Izhikevich et al., 2004). Polychronous groups (PNGs) develop readily when spiking networks are exposed to repeated spatio-temporal stimuli under the influence of spike-timing-dependent plasticity (STDP), but are sensitive to changes in synaptic weight distribution. We use a technique we have recently developed called Response Fingerprinting to show that PNGs formed in the presence of metaplasticity are significantly larger than those with no metaplasticity. A potential mechanism for this enhancement is proposed that links an inherent property of integrator type neurons called spike latency to an increase in the tolerance of PNG neurons to jitter in their inputs.

Cyber Security Vulnerabilities During Long Term Evolution Power-Saving Discontinuous Reception Protocol

DTIC Science & Technology

2014-06-01

2G second generation 3G third generation 3GPP Third Generation Partnership Project 4G fourth generation AAA authentication, authorization and...RRC_IDLE or the RRC_CONNECTED states in 4G LTE as shown in Figure 19. 2G and 3G networks use DRX in idle mode only. In Figure 19, LTE-U_u is the new DRX...is a wireless access communications network that consists of base stations called eNodeBs (eNBs), which allow connectivity between the mobile device

A New Regulatory Policy for FTTx-Based Next-Generation Access Networks

NASA Astrophysics Data System (ADS)

Makarovič, Boštjan

2013-07-01

This article critically assesses the latest European Commission policies in relation to next-generation access investment that put focus on regulated prices and relaxing of wholesale access obligations. Pointing at the vital socio-legal and economic arguments, it further challenges the assumptions of the current EU regulatory framework and calls for a more contractual utility-based model of regulation instead of the current system that overly relies on market-driven infrastructure-based competition.

Breast Cancer Diagnostics Based on Spatial Genome Organization

DTIC Science & Technology

2012-07-01

using an already established imaging tool, called NMFA-FLO (Nuclei Manual and FISH automatic). In order to achieve accurate segmentation of nuclei...in tissue we used an artificial neuronal network (ANN)-based supervised pattern recognition approach to screen out well segmented nuclei, after image ... segmentation used to process images for automated nuclear segmentation . Part a) has been adapted from [15] and b) from [16]. Figure 4. Comparison of

Integrative Analysis of Many Weighted Co-Expression Networks Using Tensor Computation

PubMed Central

Li, Wenyuan; Liu, Chun-Chi; Zhang, Tong; Li, Haifeng; Waterman, Michael S.; Zhou, Xianghong Jasmine

2011-01-01

The rapid accumulation of biological networks poses new challenges and calls for powerful integrative analysis tools. Most existing methods capable of simultaneously analyzing a large number of networks were primarily designed for unweighted networks, and cannot easily be extended to weighted networks. However, it is known that transforming weighted into unweighted networks by dichotomizing the edges of weighted networks with a threshold generally leads to information loss. We have developed a novel, tensor-based computational framework for mining recurrent heavy subgraphs in a large set of massive weighted networks. Specifically, we formulate the recurrent heavy subgraph identification problem as a heavy 3D subtensor discovery problem with sparse constraints. We describe an effective approach to solving this problem by designing a multi-stage, convex relaxation protocol, and a non-uniform edge sampling technique. We applied our method to 130 co-expression networks, and identified 11,394 recurrent heavy subgraphs, grouped into 2,810 families. We demonstrated that the identified subgraphs represent meaningful biological modules by validating against a large set of compiled biological knowledge bases. We also showed that the likelihood for a heavy subgraph to be meaningful increases significantly with its recurrence in multiple networks, highlighting the importance of the integrative approach to biological network analysis. Moreover, our approach based on weighted graphs detects many patterns that would be overlooked using unweighted graphs. In addition, we identified a large number of modules that occur predominately under specific phenotypes. This analysis resulted in a genome-wide mapping of gene network modules onto the phenome. Finally, by comparing module activities across many datasets, we discovered high-order dynamic cooperativeness in protein complex networks and transcriptional regulatory networks. PMID:21698123

A novel power efficient location-based cooperative routing with transmission power-upper-limit for wireless sensor networks.

PubMed

Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

2013-05-15

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.

Balancing energy consumption with hybrid clustering and routing strategy in wireless sensor networks.

PubMed

Xu, Zhezhuang; Chen, Liquan; Liu, Ting; Cao, Lianyang; Chen, Cailian

2015-10-20

Multi-hop data collection in wireless sensor networks (WSNs) is a challenge issue due to the limited energy resource and transmission range of wireless sensors. The hybrid clustering and routing (HCR) strategy has provided an effective solution, which can generate a connected and efficient cluster-based topology for multi-hop data collection in WSNs. However, it suffers from imbalanced energy consumption, which results in the poor performance of the network lifetime. In this paper, we evaluate the energy consumption of HCR and discover an important result: the imbalanced energy consumption generally appears in gradient k = 1, i.e., the nodes that can communicate with the sink directly. Based on this observation, we propose a new protocol called HCR-1, which includes the adaptive relay selection and tunable cost functions to balance the energy consumption. The guideline of setting the parameters in HCR-1 is provided based on simulations. The analytical and numerical results prove that, with minor modification of the topology in Sensors 2015, 15 26584 gradient k = 1, the HCR-1 protocol effectively balances the energy consumption and prolongs the network lifetime.

A Novel Power Efficient Location-Based Cooperative Routing with Transmission Power-Upper-Limit for Wireless Sensor Networks

PubMed Central

Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

2013-01-01

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate. PMID:23676625

Reconstructing genome-wide regulatory network of E. coli using transcriptome data and predicted transcription factor activities

PubMed Central

2011-01-01

Background Gene regulatory networks play essential roles in living organisms to control growth, keep internal metabolism running and respond to external environmental changes. Understanding the connections and the activity levels of regulators is important for the research of gene regulatory networks. While relevance score based algorithms that reconstruct gene regulatory networks from transcriptome data can infer genome-wide gene regulatory networks, they are unfortunately prone to false positive results. Transcription factor activities (TFAs) quantitatively reflect the ability of the transcription factor to regulate target genes. However, classic relevance score based gene regulatory network reconstruction algorithms use models do not include the TFA layer, thus missing a key regulatory element. Results This work integrates TFA prediction algorithms with relevance score based network reconstruction algorithms to reconstruct gene regulatory networks with improved accuracy over classic relevance score based algorithms. This method is called Gene expression and Transcription factor activity based Relevance Network (GTRNetwork). Different combinations of TFA prediction algorithms and relevance score functions have been applied to find the most efficient combination. When the integrated GTRNetwork method was applied to E. coli data, the reconstructed genome-wide gene regulatory network predicted 381 new regulatory links. This reconstructed gene regulatory network including the predicted new regulatory links show promising biological significances. Many of the new links are verified by known TF binding site information, and many other links can be verified from the literature and databases such as EcoCyc. The reconstructed gene regulatory network is applied to a recent transcriptome analysis of E. coli during isobutanol stress. In addition to the 16 significantly changed TFAs detected in the original paper, another 7 significantly changed TFAs have been detected by using our reconstructed network. Conclusions The GTRNetwork algorithm introduces the hidden layer TFA into classic relevance score-based gene regulatory network reconstruction processes. Integrating the TFA biological information with regulatory network reconstruction algorithms significantly improves both detection of new links and reduces that rate of false positives. The application of GTRNetwork on E. coli gene transcriptome data gives a set of potential regulatory links with promising biological significance for isobutanol stress and other conditions. PMID:21668997

Genotyping External Quality Assurance in the World Health Organization HIV Drug Resistance Laboratory Network During 2007–2010

PubMed Central

Bremer, James; Bertagnolio, Silvia

2012-01-01

The World Health Organization (WHO) has developed a global laboratory network to support human immunodeficiency virus drug resistance genotyping for public health surveillance in resource-limited countries. Blinded proficiency panels are an essential part of a genotyping quality-assurance program and are used to monitor the reliability of genotyping data in the WHO laboratory network. Laboratories in Europe, North America, Asia, Africa, and the Caribbean have tested panels annually since 2007; 103 of 131 submissions (79%) had >99% nucleotide sequence identity and resistance mutation concordance, compared with consensus. Most errors were associated with mixtures in the test specimen, leading to subjectivity in base-calling or amplification bias. Overall, genotyping assays used by the WHO laboratory network are reliable. PMID:22544186

Nonlinearly Activated Neural Network for Solving Time-Varying Complex Sylvester Equation.

PubMed

Li, Shuai; Li, Yangming

2013-10-28

The Sylvester equation is often encountered in mathematics and control theory. For the general time-invariant Sylvester equation problem, which is defined in the domain of complex numbers, the Bartels-Stewart algorithm and its extensions are effective and widely used with an O(n³) time complexity. When applied to solving the time-varying Sylvester equation, the computation burden increases intensively with the decrease of sampling period and cannot satisfy continuous realtime calculation requirements. For the special case of the general Sylvester equation problem defined in the domain of real numbers, gradient-based recurrent neural networks are able to solve the time-varying Sylvester equation in real time, but there always exists an estimation error while a recently proposed recurrent neural network by Zhang et al [this type of neural network is called Zhang neural network (ZNN)] converges to the solution ideally. The advancements in complex-valued neural networks cast light to extend the existing real-valued ZNN for solving the time-varying real-valued Sylvester equation to its counterpart in the domain of complex numbers. In this paper, a complex-valued ZNN for solving the complex-valued Sylvester equation problem is investigated and the global convergence of the neural network is proven with the proposed nonlinear complex-valued activation functions. Moreover, a special type of activation function with a core function, called sign-bi-power function, is proven to enable the ZNN to converge in finite time, which further enhances its advantage in online processing. In this case, the upper bound of the convergence time is also derived analytically. Simulations are performed to evaluate and compare the performance of the neural network with different parameters and activation functions. Both theoretical analysis and numerical simulations validate the effectiveness of the proposed method.

"Contextualizing Context": Reconciling Environmental Exposures, Social Networks, and Location Preferences in Health Research.

PubMed

Kestens, Yan; Wasfi, Rania; Naud, Alexandre; Chaix, Basile

2017-03-01

The aim of this paper is to review the recent advances in health and place research and discuss concepts useful to explore how context affects health. More specifically, it reviews measures and tools used to account for place; concepts relating to daily mobility and multiple exposure to places, and further points to the intertwining between social and spatial networks to help further our understanding of how context translates into health profiles. Significant advances in environmental or neighborhood effects have been made in the last decades. Specifically, conceptual and methodological developments have improved our consideration of spatial processes, shifting from a residential-based view of context to a more dynamic activity space and daily mobility paradigm. Yet, such advances have led to overlooking other potentially important aspects related to social networks and decision-making processes. With an increasing capacity to collect high-precision data on daily mobility and behavior, new possibilities in understanding how environments relate to behavior and health inequalities arise. Two overlooked aspects need to be addressed: the questions of "with or for whom", and "why". While the former calls for a better consideration of social networks and social interactions, the latter calls for refining our understanding of place preference and decision-making leading to daily mobility and multiple exposures.

The association of drinking water treatment and distribution network disturbances with Health Call Centre contacts for gastrointestinal illness symptoms.

PubMed

Malm, Annika; Axelsson, Gösta; Barregard, Lars; Ljungqvist, Jakob; Forsberg, Bertil; Bergstedt, Olof; Pettersson, Thomas J R

2013-09-01

There are relatively few studies on the association between disturbances in drinking water services and symptoms of gastrointestinal (GI) illness. Health Call Centres data concerning GI illness may be a useful source of information. This study investigates if there is an increased frequency of contacts with the Health Call Centre (HCC) concerning gastrointestinal symptoms at times when there is a risk of impaired water quality due to disturbances at water works or the distribution network. The study was conducted in Gothenburg, a Swedish city with 0.5 million inhabitants with a surface water source of drinking water and two water works. All HCC contacts due to GI symptoms (diarrhoea, vomiting or abdominal pain) were recorded for a three-year period, including also sex, age, and geocoded location of residence. The number of contacts with the HCC in the affected geographical areas were recorded during eight periods of disturbances in the water works (e.g. short stops of chlorine dosing), six periods of large disturbances in the distribution network (e.g. pumping station failure or pipe breaks with major consequences), and 818 pipe break and leak repairs over a three-year period. For each period of disturbance the observed number of calls was compared with the number of calls during a control period without disturbances in the same geographical area. In total about 55, 000 calls to the HCC due to GI symptoms were recorded over the three-year period, 35 per 1000 inhabitants and year, but much higher (>200) for children <3 yrs of age. There was no statistically significant increase in calls due to GI illness during or after disturbances at the water works or in the distribution network. Our results indicate that GI symptoms due to disturbances in water works or the distribution network are rare. The number of serious failures was, however limited, and further studies are needed to be able to assess the risk of GI illness in such cases. The technique of using geocoded HCC data together with geocoded records of disturbances in the drinking water network was feasible. Copyright © 2013 Elsevier Ltd. All rights reserved.

PILOT: An intelligent distributed operations support system

NASA Technical Reports Server (NTRS)

Rasmussen, Arthur N.

1993-01-01

The Real-Time Data System (RTDS) project is exploring the application of advanced technologies to the real-time flight operations environment of the Mission Control Centers at NASA's Johnson Space Center. The system, based on a network of engineering workstations, provides services such as delivery of real time telemetry data to flight control applications. To automate the operation of this complex distributed environment, a facility called PILOT (Process Integrity Level and Operation Tracker) is being developed. PILOT comprises a set of distributed agents cooperating with a rule-based expert system; together they monitor process operation and data flows throughout the RTDS network. The goal of PILOT is to provide unattended management and automated operation under user control.

Off-lexicon online Arabic handwriting recognition using neural network

NASA Astrophysics Data System (ADS)

Yahia, Hamdi; Chaabouni, Aymen; Boubaker, Houcine; Alimi, Adel M.

2017-03-01

This paper highlights a new method for online Arabic handwriting recognition based on graphemes segmentation. The main contribution of our work is to explore the utility of Beta-elliptic model in segmentation and features extraction for online handwriting recognition. Indeed, our method consists in decomposing the input signal into continuous part called graphemes based on Beta-Elliptical model, and classify them according to their position in the pseudo-word. The segmented graphemes are then described by the combination of geometric features and trajectory shape modeling. The efficiency of the considered features has been evaluated using feed forward neural network classifier. Experimental results using the benchmarking ADAB Database show the performance of the proposed method.

uFarm: a smart farm management system based on RFID

NASA Astrophysics Data System (ADS)

Kim, Hyoungsuk; Lee, Moonsup; Jung, Jonghyuk; Lee, Hyunwook; Kim, Taehyoun

2007-12-01

Recently, the livestock industry in Korea has been threatened by many challenges such as low productivity due to labor intensiveness, global competition compelled by the Free Trade Agreement (FTA), and emerging animal disease issues such as BSE or foot-and-mouth. In this paper, we propose a smart farm management system, called uFarm, which would come up with such challenges by automating farm management. First, we automate labor-intensive jobs using equipments based on sensors and actuators. The automation subsystem can be controlled by remote user through wireless network. Second, we provide real-time traceability of information on farm animals using the radio-frequency identification (RFID) method and embedded data server with network connectivity.

A Systems Approach to Scalable Transportation Network Modeling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perumalla, Kalyan S

2006-01-01

Emerging needs in transportation network modeling and simulation are raising new challenges with respect to scal-ability of network size and vehicular traffic intensity, speed of simulation for simulation-based optimization, and fidel-ity of vehicular behavior for accurate capture of event phe-nomena. Parallel execution is warranted to sustain the re-quired detail, size and speed. However, few parallel simulators exist for such applications, partly due to the challenges underlying their development. Moreover, many simulators are based on time-stepped models, which can be computationally inefficient for the purposes of modeling evacuation traffic. Here an approach is presented to de-signing a simulator with memory andmore » speed efficiency as the goals from the outset, and, specifically, scalability via parallel execution. The design makes use of discrete event modeling techniques as well as parallel simulation meth-ods. Our simulator, called SCATTER, is being developed, incorporating such design considerations. Preliminary per-formance results are presented on benchmark road net-works, showing scalability to one million vehicles simu-lated on one processor.« less

Improving deep convolutional neural networks with mixed maxout units

PubMed Central

Liu, Fu-xian; Li, Long-yue

2017-01-01

Motivated by insights from the maxout-units-based deep Convolutional Neural Network (CNN) that “non-maximal features are unable to deliver” and “feature mapping subspace pooling is insufficient,” we present a novel mixed variant of the recently introduced maxout unit called a mixout unit. Specifically, we do so by calculating the exponential probabilities of feature mappings gained by applying different convolutional transformations over the same input and then calculating the expected values according to their exponential probabilities. Moreover, we introduce the Bernoulli distribution to balance the maximum values with the expected values of the feature mappings subspace. Finally, we design a simple model to verify the pooling ability of mixout units and a Mixout-units-based Network-in-Network (NiN) model to analyze the feature learning ability of the mixout models. We argue that our proposed units improve the pooling ability and that mixout models can achieve better feature learning and classification performance. PMID:28727737

Finite-horizon control-constrained nonlinear optimal control using single network adaptive critics.

PubMed

Heydari, Ali; Balakrishnan, Sivasubramanya N

2013-01-01

To synthesize fixed-final-time control-constrained optimal controllers for discrete-time nonlinear control-affine systems, a single neural network (NN)-based controller called the Finite-horizon Single Network Adaptive Critic is developed in this paper. Inputs to the NN are the current system states and the time-to-go, and the network outputs are the costates that are used to compute optimal feedback control. Control constraints are handled through a nonquadratic cost function. Convergence proofs of: 1) the reinforcement learning-based training method to the optimal solution; 2) the training error; and 3) the network weights are provided. The resulting controller is shown to solve the associated time-varying Hamilton-Jacobi-Bellman equation and provide the fixed-final-time optimal solution. Performance of the new synthesis technique is demonstrated through different examples including an attitude control problem wherein a rigid spacecraft performs a finite-time attitude maneuver subject to control bounds. The new formulation has great potential for implementation since it consists of only one NN with single set of weights and it provides comprehensive feedback solutions online, though it is trained offline.

Clustered Numerical Data Analysis Using Markov Lie Monoid Based Networks

NASA Astrophysics Data System (ADS)

Johnson, Joseph

2016-03-01

We have designed and build an optimal numerical standardization algorithm that links numerical values with their associated units, error level, and defining metadata thus supporting automated data exchange and new levels of artificial intelligence (AI). The software manages all dimensional and error analysis and computational tracing. Tables of entities verses properties of these generalized numbers (called ``metanumbers'') support a transformation of each table into a network among the entities and another network among their properties where the network connection matrix is based upon a proximity metric between the two items. We previously proved that every network is isomorphic to the Lie algebra that generates continuous Markov transformations. We have also shown that the eigenvectors of these Markov matrices provide an agnostic clustering of the underlying patterns. We will present this methodology and show how our new work on conversion of scientific numerical data through this process can reveal underlying information clusters ordered by the eigenvalues. We will also show how the linking of clusters from different tables can be used to form a ``supernet'' of all numerical information supporting new initiatives in AI.

Query-based learning for aerospace applications.

PubMed

Saad, E W; Choi, J J; Vian, J L; Wunsch, D C Ii

2003-01-01

Models of real-world applications often include a large number of parameters with a wide dynamic range, which contributes to the difficulties of neural network training. Creating the training data set for such applications becomes costly, if not impossible. In order to overcome the challenge, one can employ an active learning technique known as query-based learning (QBL) to add performance-critical data to the training set during the learning phase, thereby efficiently improving the overall learning/generalization. The performance-critical data can be obtained using an inverse mapping called network inversion (discrete network inversion and continuous network inversion) followed by oracle query. This paper investigates the use of both inversion techniques for QBL learning, and introduces an original heuristic to select the inversion target values for continuous network inversion method. Efficiency and generalization was further enhanced by employing node decoupled extended Kalman filter (NDEKF) training and a causality index (CI) as a means to reduce the input search dimensionality. The benefits of the overall QBL approach are experimentally demonstrated in two aerospace applications: a classification problem with large input space and a control distribution problem.

Performance evaluation of distributed wavelength assignment in WDM optical networks

NASA Astrophysics Data System (ADS)

Hashiguchi, Tomohiro; Wang, Xi; Morikawa, Hiroyuki; Aoyama, Tomonori

2004-04-01

In WDM wavelength routed networks, prior to a data transfer, a call setup procedure is required to reserve a wavelength path between the source-destination node pairs. A distributed approach to a connection setup can achieve a very high speed, while improving the reliability and reducing the implementation cost of the networks. However, along with many advantages, several major challenges have been posed by the distributed scheme in how the management and allocation of wavelength could be efficiently carried out. In this thesis, we apply a distributed wavelength assignment algorithm named priority based wavelength assignment (PWA) that was originally proposed for the use in burst switched optical networks to the problem of reserving wavelengths of path reservation protocols in the distributed control optical networks. Instead of assigning wavelengths randomly, this approach lets each node select the "safest" wavelengths based on the information of wavelength utilization history, thus unnecessary future contention is prevented. The simulation results presented in this paper show that the proposed protocol can enhance the performance of the system without introducing any apparent drawbacks.

Reversible stress softening of collagen based networks from the jumbo squid mantle (Dosidicus gigas).

PubMed

Torres, F G; Troncoso, O P; Rivas, E R; Gomez, C G; Lopez, D

2014-04-01

Dosidicus gigas is the largest and one of the most abundant jumbo squids in the eastern Pacific Ocean. In this paper we have studied the muscle of the mantle of D. gigas (DGM). Morphological, thermal and rheological properties were assessed by means of atomic force microscopy, scanning electron microscopy, energy-dispersive X-ray spectroscopy, differential scanning calorimetry, thermogravimetry and oscillatory rheometry. This study allowed us to assess the morphological and rheological properties of a collagen based network occurring in nature. The results showed that the DGM network displays a nonlinear effect called reversible stress softening (RSS) that has been previously described for other types of biological structures such as naturally occurring cellulose networks and actin networks. We propose that the RSS could play a key role on the way jumbo squids withstand hydrostatic pressure. The results presented here confirm that this phenomenon occurs in a wider number of materials than previously thought, all of them exhibiting different size scales as well as physical conformation. Copyright © 2013 Elsevier B.V. All rights reserved.

Network-based reading system for lung cancer screening CT

NASA Astrophysics Data System (ADS)

Fujino, Yuichi; Fujimura, Kaori; Nomura, Shin-ichiro; Kawashima, Harumi; Tsuchikawa, Megumu; Matsumoto, Toru; Nagao, Kei-ichi; Uruma, Takahiro; Yamamoto, Shinji; Takizawa, Hotaka; Kuroda, Chikazumi; Nakayama, Tomio

2006-03-01

This research aims to support chest computed tomography (CT) medical checkups to decrease the death rate by lung cancer. We have developed a remote cooperative reading system for lung cancer screening over the Internet, a secure transmission function, and a cooperative reading environment. It is called the Network-based Reading System. A telemedicine system involves many issues, such as network costs and data security if we use it over the Internet, which is an open network. In Japan, broadband access is widespread and its cost is the lowest in the world. We developed our system considering human machine interface and security. It consists of data entry terminals, a database server, a computer aided diagnosis (CAD) system, and some reading terminals. It uses a secure Digital Imaging and Communication in Medicine (DICOM) encrypting method and Public Key Infrastructure (PKI) based secure DICOM image data distribution. We carried out an experimental trial over the Japan Gigabit Network (JGN), which is the testbed for the Japanese next-generation network, and conducted verification experiments of secure screening image distribution, some kinds of data addition, and remote cooperative reading. We found that network bandwidth of about 1.5 Mbps enabled distribution of screening images and cooperative reading and that the encryption and image distribution methods we proposed were applicable to the encryption and distribution of general DICOM images via the Internet.

Consciousness, cognition and brain networks: New perspectives.

PubMed

Aldana, E M; Valverde, J L; Fábregas, N

2016-10-01

A detailed analysis of the literature on consciousness and cognition mechanisms based on the neural networks theory is presented. The immune and inflammatory response to the anesthetic-surgical procedure induces modulation of neuronal plasticity by influencing higher cognitive functions. Anesthetic drugs can cause unconsciousness, producing a functional disruption of cortical and thalamic cortical integration complex. The external and internal perceptions are processed through an intricate network of neural connections, involving the higher nervous activity centers, especially the cerebral cortex. This requires an integrated model, formed by neural networks and their interactions with highly specialized regions, through large-scale networks, which are distributed throughout the brain collecting information flow of these perceptions. Functional and effective connectivity between large-scale networks, are essential for consciousness, unconsciousness and cognition. It is what is called the "human connectome" or map neural networks. Copyright © 2014 Sociedad Española de Anestesiología, Reanimación y Terapéutica del Dolor. Publicado por Elsevier España, S.L.U. All rights reserved.

Ethernet-Based Services for Next Generation Networks

NASA Astrophysics Data System (ADS)

Hernandez-Valencia, Enrique

Over the last few years, Ethernet technology and services have emerged as an indispensable component of the broadband networking and telecommunications infrastructure, both for network operators and service providers. As an example, Worldwide Enterprise customer demand for Ethernet services by itself is expected to hit the 30B US mark by year 2012. Use of Ethernet technology in the feeder networks that support residential applications, such as "triple play" voice, data, and video services, is equally on the rise. As the synergies between packet-aware transport and service oriented equipment continue to be exploited in the path toward transport convergence. Ethernet technology is expected to play a critical part in the evolution toward converged Optical/Packet Transport networks. Here we discuss the main business motivations, services, and technologies driving the specifications of so-called carrier Ethernet and highlight challenges associated with delivering the expectations for low implementation complexity, easy of use, provisioning and management of networks and network elements embracing this technology.

Protein complex prediction in large ontology attributed protein-protein interaction networks.

PubMed

Zhang, Yijia; Lin, Hongfei; Yang, Zhihao; Wang, Jian; Li, Yanpeng; Xu, Bo

2013-01-01

Protein complexes are important for unraveling the secrets of cellular organization and function. Many computational approaches have been developed to predict protein complexes in protein-protein interaction (PPI) networks. However, most existing approaches focus mainly on the topological structure of PPI networks, and largely ignore the gene ontology (GO) annotation information. In this paper, we constructed ontology attributed PPI networks with PPI data and GO resource. After constructing ontology attributed networks, we proposed a novel approach called CSO (clustering based on network structure and ontology attribute similarity). Structural information and GO attribute information are complementary in ontology attributed networks. CSO can effectively take advantage of the correlation between frequent GO annotation sets and the dense subgraph for protein complex prediction. Our proposed CSO approach was applied to four different yeast PPI data sets and predicted many well-known protein complexes. The experimental results showed that CSO was valuable in predicting protein complexes and achieved state-of-the-art performance.

A Strategy Based on Protein-Protein Interface Motifs May Help in Identifying Drug Off-Targets

PubMed Central

Engin, H. Billur; Keskin, Ozlem; Nussinov, Ruth; Gursoy, Attila

2014-01-01

Networks are increasingly used to study the impact of drugs at the systems level. From the algorithmic standpoint, a drug can ‘attack’ nodes or edges of a protein-protein interaction network. In this work, we propose a new network strategy, “The Interface Attack”, based on protein-protein interfaces. Similar interface architectures can occur between unrelated proteins. Consequently, in principle, a drug that binds to one has a certain probability of binding others. The interface attack strategy simultaneously removes from the network all interactions that consist of similar interface motifs. This strategy is inspired by network pharmacology and allows inferring potential off-targets. We introduce a network model which we call “Protein Interface and Interaction Network (P2IN)”, which is the integration of protein-protein interface structures and protein interaction networks. This interface-based network organization clarifies which protein pairs have structurally similar interfaces, and which proteins may compete to bind the same surface region. We built the P2IN of p53 signaling network and performed network robustness analysis. We show that (1) ‘hitting’ frequent interfaces (a set of edges distributed around the network) might be as destructive as eleminating high degree proteins (hub nodes); (2) frequent interfaces are not always topologically critical elements in the network; and (3) interface attack may reveal functional changes in the system better than attack of single proteins. In the off-target detection case study, we found that drugs blocking the interface between CDK6 and CDKN2D may also affect the interaction between CDK4 and CDKN2D. PMID:22817115

Hybrid swarm intelligence optimization approach for optimal data storage position identification in wireless sensor networks.

PubMed

Mohanasundaram, Ranganathan; Periasamy, Pappampalayam Sanmugam

2015-01-01

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

A soft-hard combination-based cooperative spectrum sensing scheme for cognitive radio networks.

PubMed

Do, Nhu Tri; An, Beongku

2015-02-13

In this paper we propose a soft-hard combination scheme, called SHC scheme, for cooperative spectrum sensing in cognitive radio networks. The SHC scheme deploys a cluster based network in which Likelihood Ratio Test (LRT)-based soft combination is applied at each cluster, and weighted decision fusion rule-based hard combination is utilized at the fusion center. The novelties of the SHC scheme are as follows: the structure of the SHC scheme reduces the complexity of cooperative detection which is an inherent limitation of soft combination schemes. By using the LRT, we can detect primary signals in a low signal-to-noise ratio regime (around an average of -15 dB). In addition, the computational complexity of the LRT is reduced since we derive the closed-form expression of the probability density function of LRT value. The SHC scheme also takes into account the different effects of large scale fading on different users in the wide area network. The simulation results show that the SHC scheme not only provides the better sensing performance compared to the conventional hard combination schemes, but also reduces sensing overhead in terms of reporting time compared to the conventional soft combination scheme using the LRT.

Squeezeposenet: Image Based Pose Regression with Small Convolutional Neural Networks for Real Time Uas Navigation

NASA Astrophysics Data System (ADS)

Müller, M. S.; Urban, S.; Jutzi, B.

2017-08-01

The number of unmanned aerial vehicles (UAVs) is increasing since low-cost airborne systems are available for a wide range of users. The outdoor navigation of such vehicles is mostly based on global navigation satellite system (GNSS) methods to gain the vehicles trajectory. The drawback of satellite-based navigation are failures caused by occlusions and multi-path interferences. Beside this, local image-based solutions like Simultaneous Localization and Mapping (SLAM) and Visual Odometry (VO) can e.g. be used to support the GNSS solution by closing trajectory gaps but are computationally expensive. However, if the trajectory estimation is interrupted or not available a re-localization is mandatory. In this paper we will provide a novel method for a GNSS-free and fast image-based pose regression in a known area by utilizing a small convolutional neural network (CNN). With on-board processing in mind, we employ a lightweight CNN called SqueezeNet and use transfer learning to adapt the network to pose regression. Our experiments show promising results for GNSS-free and fast localization.

Structural Health Monitoring of a Composite Panel Based on PZT Sensors and a Transfer Impedance Framework.

PubMed

Dziendzikowski, Michal; Niedbala, Patryk; Kurnyta, Artur; Kowalczyk, Kamil; Dragan, Krzysztof

2018-05-11

One of the ideas for development of Structural Health Monitoring (SHM) systems is based on excitation of elastic waves by a network of PZT piezoelectric transducers integrated with the structure. In the paper, a variant of the so-called Transfer Impedance (TI) approach to SHM is followed. Signal characteristics, called the Damage Indices (DIs), were proposed for data presentation and analysis. The idea underlying the definition of DIs was to maintain most of the information carried by the voltage induced on PZT sensors by elastic waves. In particular, the DIs proposed in the paper should be sensitive to all types of damage which can influence the amplitude or the phase of the voltage induced on the sensor. Properties of the proposed DIs were investigated experimentally using a GFRP composite panel equipped with PZT networks attached to its surface and embedded into its internal structure. Repeatability and stability of DI indications under controlled conditions were verified in tests. Also, some performance indicators for surface-attached and structure-embedded sensors were obtained. The DIs' behavior was dependent mostly on the presence of a simulated damage in the structure. Anisotropy of mechanical properties of the specimen, geometrical properties of PZT network as well as, to some extent, the technology of sensor integration with the structure were irrelevant for damage indication. This property enables the method to be used for damage detection and classification.

Elements of an algorithm for optimizing a parameter-structural neural network

NASA Astrophysics Data System (ADS)

Mrówczyńska, Maria

2016-06-01

The field of processing information provided by measurement results is one of the most important components of geodetic technologies. The dynamic development of this field improves classic algorithms for numerical calculations in the aspect of analytical solutions that are difficult to achieve. Algorithms based on artificial intelligence in the form of artificial neural networks, including the topology of connections between neurons have become an important instrument connected to the problem of processing and modelling processes. This concept results from the integration of neural networks and parameter optimization methods and makes it possible to avoid the necessity to arbitrarily define the structure of a network. This kind of extension of the training process is exemplified by the algorithm called the Group Method of Data Handling (GMDH), which belongs to the class of evolutionary algorithms. The article presents a GMDH type network, used for modelling deformations of the geometrical axis of a steel chimney during its operation.

Modeling Epidemics Spreading on Social Contact Networks.

PubMed

Zhang, Zhaoyang; Wang, Honggang; Wang, Chonggang; Fang, Hua

2015-09-01

Social contact networks and the way people interact with each other are the key factors that impact on epidemics spreading. However, it is challenging to model the behavior of epidemics based on social contact networks due to their high dynamics. Traditional models such as susceptible-infected-recovered (SIR) model ignore the crowding or protection effect and thus has some unrealistic assumption. In this paper, we consider the crowding or protection effect and develop a novel model called improved SIR model. Then, we use both deterministic and stochastic models to characterize the dynamics of epidemics on social contact networks. The results from both simulations and real data set conclude that the epidemics are more likely to outbreak on social contact networks with higher average degree. We also present some potential immunization strategies, such as random set immunization, dominating set immunization, and high degree set immunization to further prove the conclusion.

Modeling Epidemics Spreading on Social Contact Networks

PubMed Central

ZHANG, ZHAOYANG; WANG, HONGGANG; WANG, CHONGGANG; FANG, HUA

2016-01-01

Social contact networks and the way people interact with each other are the key factors that impact on epidemics spreading. However, it is challenging to model the behavior of epidemics based on social contact networks due to their high dynamics. Traditional models such as susceptible-infected-recovered (SIR) model ignore the crowding or protection effect and thus has some unrealistic assumption. In this paper, we consider the crowding or protection effect and develop a novel model called improved SIR model. Then, we use both deterministic and stochastic models to characterize the dynamics of epidemics on social contact networks. The results from both simulations and real data set conclude that the epidemics are more likely to outbreak on social contact networks with higher average degree. We also present some potential immunization strategies, such as random set immunization, dominating set immunization, and high degree set immunization to further prove the conclusion. PMID:27722037

Efficient packet transportation on complex networks with nonuniform node capacity distribution

NASA Astrophysics Data System (ADS)

He, Xuan; Niu, Kai; He, Zhiqiang; Lin, Jiaru; Jiang, Zhong-Yuan

2015-03-01

Provided that node delivery capacity may be not uniformly distributed in many realistic networks, we present a node delivery capacity distribution in which each node capacity is composed of uniform fraction and degree related proportion. Based on the node delivery capacity distribution, we construct a novel routing mechanism called efficient weighted routing (EWR) strategy to enhance network traffic capacity and transportation efficiency. Compared with the shortest path routing and the efficient routing strategies, the EWR achieves the highest traffic capacity. After investigating average path length, network diameter, maximum efficient betweenness, average efficient betweenness, average travel time and average traffic load under extensive simulations, it indicates that the EWR appears to be a very effective routing method. The idea of this routing mechanism gives us a good insight into network science research. The practical use of this work is prospective in some real complex systems such as the Internet.

A wireless medical monitoring over a heterogeneous sensor network.

PubMed

Yuce, Mehmet R; Ng, Peng Choong; Lee, Chin K; Khan, Jamil Y; Liu, Wentai

2007-01-01

This paper presents a heterogeneous sensor network system that has the capability to monitor physiological parameters from multiple patient bodies by means of different communication standards. The system uses the recently opened medical band called MICS (Medical Implant Communication Service) between the sensor nodes and a remote central control unit (CCU) that behaves as a base station. The CCU communicates with another network standard (the internet or a mobile network) for a long distance data transfer. The proposed system offers mobility to patients and flexibility to medical staff to obtain patient's physiological data on demand basis via Internet. A prototype sensor network including hardware, firmware and software designs has been implemented and tested by incorporating temperature and pulse rate sensors on nodes. The developed system has been optimized for power consumption by having the nodes sleep when there is no communication via a bidirectional communication.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Núñez, Rubén, E-mail: ruben.nunez@ies-def.upm.es; Antón, Ignacio; Askins, Steve

In the frame of the European project SOPHIA, a spectral network based on component (also called isotypes) cells has been created. Among the members of this project, several spectral sensors based on component cells and collimating tubes, so-called spectroheliometers, were installed in the last years, allowing the collection of minute-resolution spectral data useful for CPV systems characterization across Europe. The use of spectroheliometers has been proved useful to establish the necessary spectral conditions to perform power rating of CPV modules and systems. If enough data in a given period of time is collected, ideally a year, it is possible tomore » characterize spectrally the place where measurements are taken, in the same way that hours of annual irradiation can be estimated using a pyrheliometer.« less

World Input-Output Network

PubMed Central

Cerina, Federica; Zhu, Zhen; Chessa, Alessandro; Riccaboni, Massimo

2015-01-01

Production systems, traditionally analyzed as almost independent national systems, are increasingly connected on a global scale. Only recently becoming available, the World Input-Output Database (WIOD) is one of the first efforts to construct the global multi-regional input-output (GMRIO) tables. By viewing the world input-output system as an interdependent network where the nodes are the individual industries in different economies and the edges are the monetary goods flows between industries, we analyze respectively the global, regional, and local network properties of the so-called world input-output network (WION) and document its evolution over time. At global level, we find that the industries are highly but asymmetrically connected, which implies that micro shocks can lead to macro fluctuations. At regional level, we find that the world production is still operated nationally or at most regionally as the communities detected are either individual economies or geographically well defined regions. Finally, at local level, for each industry we compare the network-based measures with the traditional methods of backward linkages. We find that the network-based measures such as PageRank centrality and community coreness measure can give valuable insights into identifying the key industries. PMID:26222389

Consensus-based methodology for detection communities in multilayered networks

NASA Astrophysics Data System (ADS)

Karimi-Majd, Amir-Mohsen; Fathian, Mohammad; Makrehchi, Masoud

2018-03-01

Finding groups of network users who are densely related with each other has emerged as an interesting problem in the area of social network analysis. These groups or so-called communities would be hidden behind the behavior of users. Most studies assume that such behavior could be understood by focusing on user interfaces, their behavioral attributes or a combination of these network layers (i.e., interfaces with their attributes). They also assume that all network layers refer to the same behavior. However, in real-life networks, users' behavior in one layer may differ from their behavior in another one. In order to cope with these issues, this article proposes a consensus-based community detection approach (CBC). CBC finds communities among nodes at each layer, in parallel. Then, the results of layers should be aggregated using a consensus clustering method. This means that different behavior could be detected and used in the analysis. As for other significant advantages, the methodology would be able to handle missing values. Three experiments on real-life and computer-generated datasets have been conducted in order to evaluate the performance of CBC. The results indicate superiority and stability of CBC in comparison to other approaches.

Functional connectivity decreases in autism in emotion, self, and face circuits identified by Knowledge-based Enrichment Analysis.

PubMed

Cheng, Wei; Rolls, Edmund T; Zhang, Jie; Sheng, Wenbo; Ma, Liang; Wan, Lin; Luo, Qiang; Feng, Jianfeng

2017-03-01

A powerful new method is described called Knowledge based functional connectivity Enrichment Analysis (KEA) for interpreting resting state functional connectivity, using circuits that are functionally identified using search terms with the Neurosynth database. The method derives its power by focusing on neural circuits, sets of brain regions that share a common biological function, instead of trying to interpret single functional connectivity links. This provides a novel way of investigating how task- or function-related networks have resting state functional connectivity differences in different psychiatric states, provides a new way to bridge the gap between task and resting-state functional networks, and potentially helps to identify brain networks that might be treated. The method was applied to interpreting functional connectivity differences in autism. Functional connectivity decreases at the network circuit level in 394 patients with autism compared with 473 controls were found in networks involving the orbitofrontal cortex, anterior cingulate cortex, middle temporal gyrus cortex, and the precuneus, in networks that are implicated in the sense of self, face processing, and theory of mind. The decreases were correlated with symptom severity. Copyright © 2017. Published by Elsevier Inc.

Bifurcations: Focal Points of Particle Adhesion in Microvascular Networks

PubMed Central

Prabhakarpandian, Balabhaskar; Wang, Yi; Rea-Ramsey, Angela; Sundaram, Shivshankar; Kiani, Mohammad F.; Pant, Kapil

2011-01-01

Objective Particle adhesion in vivo is dependent on microcirculation environment which features unique anatomical (bifurcations, tortuosity, cross-sectional changes) and physiological (complex hemodynamics) characteristics. The mechanisms behind these complex phenomena are not well understood. In this study, we used a recently developed in vitro model of microvascular networks, called Synthetic Microvascular Network, for characterizing particle adhesion patterns in the microcirculation. Methods Synthetic microvascular networks were fabricated using soft lithography processes followed by particle adhesion studies using avidin and biotin-conjugated microspheres. Particle adhesion patterns were subsequently analyzed using CFD based modeling. Results Experimental and modeling studies highlighted the complex and heterogeneous fluid flow patterns encountered by particles in microvascular networks resulting in significantly higher propensity of adhesion (>1.5X) near bifurcations compared to the branches of the microvascular networks. Conclusion Bifurcations are the focal points of particle adhesion in microvascular networks. Changing flow patterns and morphology near bifurcations are the primary factors controlling the preferential adhesion of functionalized particles in microvascular networks. Synthetic microvascular networks provide an in vitro framework for understanding particle adhesion. PMID:21418388

A mathematical model for mesenchymal and chemosensitive cell dynamics.

PubMed

Häcker, Anita

2012-01-01

The structure of an underlying tissue network has a strong impact on cell dynamics. If, in addition, cells alter the network by mechanical and chemical interactions, their movement is called mesenchymal. Important examples for mesenchymal movement include fibroblasts in wound healing and metastatic tumour cells. This paper is focused on the latter. Based on the anisotropic biphasic theory of Barocas and Tranquillo, which models a fibre network and interstitial solution as two-component fluid, a mathematical model for the interactions of cells with a fibre network is developed. A new description for fibre reorientation is given and orientation-dependent proteolysis is added to the model. With respect to cell dynamics, the equation, based on anisotropic diffusion, is extended by haptotaxis and chemotaxis. The chemoattractants are the solute network fragments, emerging from proteolysis, and the epidermal growth factor which may guide the cells to a blood vessel. Moreover the cell migration is impeded at either high or low network density. This new model enables us to study chemotactic cell migration in a complex fibre network and the consequential network deformation. Numerical simulations for the cell migration and network deformation are carried out in two space dimensions. Simulations of cell migration in underlying tissue networks visualise the impact of the network structure on cell dynamics. In a scenario for fibre reorientation between cell clusters good qualitative agreement with experimental results is achieved. The invasion speeds of cells in an aligned and an isotropic fibre network are compared. © Springer-Verlag 2011

Using Synchronous Boolean Networks to Model Several Phenomena of Collective Behavior

PubMed Central

Kochemazov, Stepan; Semenov, Alexander

2014-01-01

In this paper, we propose an approach for modeling and analysis of a number of phenomena of collective behavior. By collectives we mean multi-agent systems that transition from one state to another at discrete moments of time. The behavior of a member of a collective (agent) is called conforming if the opinion of this agent at current time moment conforms to the opinion of some other agents at the previous time moment. We presume that at each moment of time every agent makes a decision by choosing from the set (where 1-decision corresponds to action and 0-decision corresponds to inaction). In our approach we model collective behavior with synchronous Boolean networks. We presume that in a network there can be agents that act at every moment of time. Such agents are called instigators. Also there can be agents that never act. Such agents are called loyalists. Agents that are neither instigators nor loyalists are called simple agents. We study two combinatorial problems. The first problem is to find a disposition of instigators that in several time moments transforms a network from a state where the majority of simple agents are inactive to a state with the majority of active agents. The second problem is to find a disposition of loyalists that returns the network to a state with the majority of inactive agents. Similar problems are studied for networks in which simple agents demonstrate the contrary to conforming behavior that we call anticonforming. We obtained several theoretical results regarding the behavior of collectives of agents with conforming or anticonforming behavior. In computational experiments we solved the described problems for randomly generated networks with several hundred vertices. We reduced corresponding combinatorial problems to the Boolean satisfiability problem (SAT) and used modern SAT solvers to solve the instances obtained. PMID:25526612

Recall of past use of mobile phone handsets.

PubMed

Parslow, R C; Hepworth, S J; McKinney, P A

2003-01-01

Previous studies investigating health effects of mobile phones have based their estimation of exposure on self-reported levels of phone use. This UK validation study assesses the accuracy of reported voice calls made from mobile handsets. Data collected by postal questionnaire from 93 volunteers was compared to records obtained prospectively over 6 months from four network operators. Agreement was measured for outgoing calls using the kappa statistic, log-linear modelling, Spearman correlation coefficient and graphical methods. Agreement for number of calls gained moderate classification (kappa = 0.39) with better agreement for duration (kappa = 0.50). Log-linear modelling produced similar results. The Spearman correlation coefficient was 0.48 for number of calls and 0.60 for duration. Graphical agreement methods demonstrated patterns of over-reporting call numbers (by a factor of 1.7) and duration (by a factor of 2.8). These results suggest that self-reported mobile phone use may not fully represent patterns of actual use. This has implications for calculating exposures from questionnaire data.

Mobile infostation network technology

NASA Astrophysics Data System (ADS)

Rajappan, Gowri; Acharya, Joydeep; Liu, Hongbo; Mandayam, Narayan; Seskar, Ivan; Yates, Roy

2006-05-01

Inefficient use of network resources on the battlefield is a serious liability: if an asset communicates with the network command for data-a terrain map, for instance-it ties up the end-to-end network resources. When many such assets contend for data simultaneously, traffic is limited by the slowest link along the path from the network command to the asset. A better approach is for a local server, known as an infostation, to download data on an anticipated-need basis when the network load is low. The infostation can then dump data when needed to the assets over a high-speed wireless connection. The infostation serves the local assets over an OFDM-based wireless data link that has MIMO enhancements for high data rate and robustness. We aim for data rate in excess of 100 Mbps, spectral efficiency in excess of 5 bits/sec/Hz, and robustness to poor channel conditions and jammers. We propose an adaptive physical layer that determines power levels, modulation schemes, and the MIMO enhancements to use based on the channel state and the level of interference in the system. We also incorporate the idea of superuser: a user who is allowed preferential use of the high data rate link. We propose a MAC that allows for this priority-based bandwidth allocation scheme. The proposed infostation MAC is integrated tightly with the physical layer through a cross-layer design. We call the proposed infostation PHY, MAC, and network technology, collectively, as the Mobile Infostation Network Technology (MINT).

Concepts of Connectivity and Human Epileptic Activity

PubMed Central

Lemieux, Louis; Daunizeau, Jean; Walker, Matthew C.

2011-01-01

This review attempts to place the concept of connectivity from increasingly sophisticated neuroimaging data analysis methodologies within the field of epilepsy research. We introduce the more principled connectivity terminology developed recently in neuroimaging and review some of the key concepts related to the characterization of propagation of epileptic activity using what may be called traditional correlation-based studies based on EEG. We then show how essentially similar methodologies, and more recently models addressing causality, have been used to characterize whole-brain and regional networks using functional MRI data. Following a discussion of our current understanding of the neuronal system aspects of the onset and propagation of epileptic discharges and seizures, we discuss the most advanced and ambitious framework to attempt to fully characterize epileptic networks based on neuroimaging data. PMID:21472027

Functional networks inference from rule-based machine learning models.

PubMed

Lazzarini, Nicola; Widera, Paweł; Williamson, Stuart; Heer, Rakesh; Krasnogor, Natalio; Bacardit, Jaume

2016-01-01

Functional networks play an important role in the analysis of biological processes and systems. The inference of these networks from high-throughput (-omics) data is an area of intense research. So far, the similarity-based inference paradigm (e.g. gene co-expression) has been the most popular approach. It assumes a functional relationship between genes which are expressed at similar levels across different samples. An alternative to this paradigm is the inference of relationships from the structure of machine learning models. These models are able to capture complex relationships between variables, that often are different/complementary to the similarity-based methods. We propose a protocol to infer functional networks from machine learning models, called FuNeL. It assumes, that genes used together within a rule-based machine learning model to classify the samples, might also be functionally related at a biological level. The protocol is first tested on synthetic datasets and then evaluated on a test suite of 8 real-world datasets related to human cancer. The networks inferred from the real-world data are compared against gene co-expression networks of equal size, generated with 3 different methods. The comparison is performed from two different points of view. We analyse the enriched biological terms in the set of network nodes and the relationships between known disease-associated genes in a context of the network topology. The comparison confirms both the biological relevance and the complementary character of the knowledge captured by the FuNeL networks in relation to similarity-based methods and demonstrates its potential to identify known disease associations as core elements of the network. Finally, using a prostate cancer dataset as a case study, we confirm that the biological knowledge captured by our method is relevant to the disease and consistent with the specialised literature and with an independent dataset not used in the inference process. The implementation of our network inference protocol is available at: http://ico2s.org/software/funel.html.

Network Analysis of Conversation Data for Engineering Professional Skills Assessment. Research Report. ETS RR-17-59

ERIC Educational Resources Information Center

Zhu, Mengxiao; Zhang, Mo

2017-01-01

In this paper, we examine the student group discussion processes in a scenario-based assessment of engineering professional skills called Engineering Professional Skills Assessment (EPSA). In the assessment, the students were evaluated through a discussion on a scenario related to an engineering problem with no clear-cut solution. We applied…

Reflexive Language and Ethnic Minority Activism in Hong Kong: A Trajectory-Based Analysis

ERIC Educational Resources Information Center

Pérez-Milans, Miguel; Soto, Carlos

2016-01-01

This article engages with Archer's call to further research on reflexivity and social change under conditions of late modernity (2007, 2010, 2012) from the perspective of existing work on reflexive discourse in the language disciplines (Silverstein 1976, Lucy 1993). Drawing from a linguistic ethnography of the networked trajectories of a group of…

CCML--Exchanging Marked-Up Documents in a Networked Writing Classroom.

ERIC Educational Resources Information Center

Ogata, Hiroaki; Yano, Yoneo; Wakita, Riko

1998-01-01

Describes an on-line mark-up-based composition learning environment system called CoCoA (Communicative Collection Assisting System). This system allows students and teachers to engage in marked-up documents via the Internet, and its environment is very similar to a real-world one in which people use pen and paper. CCML also facilitates teachers to…

Designing an Engaged Swarm: Toward a "Techne" for Multi-Class, Interdisciplinary Collaborations with Nonprofit Partners

ERIC Educational Resources Information Center

McCarthy, Seán

2016-01-01

This essay proposes a model of university-community partnership called "an engaged swarm" that mobilizes networks of students from across classes and disciplines to work with off-campus partners such as nonprofits. Based on theories that translate the distributed, adaptive, and flexible activity of actors in biological systems to…

Learning the Norm of Internality: NetNorm, a Connectionist Model

ERIC Educational Resources Information Center

Thierry, Bollon; Adeline, Paignon; Pascal, Pansu

2011-01-01

The objective of the present article is to show that connectionist simulations can be used to model some of the socio-cognitive processes underlying the learning of the norm of internality. For our simulations, we developed a connectionist model which we called NetNorm (based on Dual-Network formalism). This model is capable of simulating the…

The Research Path to the Virtual Class. ZIFF Papiere 105.

ERIC Educational Resources Information Center

Rajasingham, Lalita

This paper describes a project conducted in 1991-92, based on research conducted in 1986-87 that demonstrated the need for a telecommunications system with the capacity of integrated services digital networks (ISDN) that would allow for sound, vision, and integrated computer services. Called the Tri-Centre Project, it set out to explore, from the…

Enhancing International Collaboration among Academic Developers in Established and Emerging Contexts: Moving toward a Post-Colonial Perspective

ERIC Educational Resources Information Center

Lee, Virginia S.; DeZure, Deborah; Debowski, Shelda; Ho, Angela; Li, Kang

2013-01-01

With the acceleration of globalization, academic developers from institutions and countries with established educational development programs and networks are called upon increasingly to share their expertise and offer guidance to colleagues in emerging higher education contexts. Based on a higher education conference held in Beijing in 2009, this…

SLIDER: a generic metaheuristic for the discovery of correlated motifs in protein-protein interaction networks.

PubMed

Boyen, Peter; Van Dyck, Dries; Neven, Frank; van Ham, Roeland C H J; van Dijk, Aalt D J

2011-01-01

Correlated motif mining (cmm) is the problem of finding overrepresented pairs of patterns, called motifs, in sequences of interacting proteins. Algorithmic solutions for cmm thereby provide a computational method for predicting binding sites for protein interaction. In this paper, we adopt a motif-driven approach where the support of candidate motif pairs is evaluated in the network. We experimentally establish the superiority of the Chi-square-based support measure over other support measures. Furthermore, we obtain that cmm is an np-hard problem for a large class of support measures (including Chi-square) and reformulate the search for correlated motifs as a combinatorial optimization problem. We then present the generic metaheuristic slider which uses steepest ascent with a neighborhood function based on sliding motifs and employs the Chi-square-based support measure. We show that slider outperforms existing motif-driven cmm methods and scales to large protein-protein interaction networks. The slider-implementation and the data used in the experiments are available on http://bioinformatics.uhasselt.be.

Classification of polycystic ovary based on ultrasound images using competitive neural network

NASA Astrophysics Data System (ADS)

Dewi, R. M.; Adiwijaya; Wisesty, U. N.; Jondri

2018-03-01

Infertility in the women reproduction system due to inhibition of follicles maturation process causing the number of follicles which is called polycystic ovaries (PCO). PCO detection is still operated manually by a gynecologist by counting the number and size of follicles in the ovaries, so it takes a long time and needs high accuracy. In general, PCO can be detected by calculating stereology or feature extraction and classification. In this paper, we designed a system to classify PCO by using the feature extraction (Gabor Wavelet method) and Competitive Neural Network (CNN). CNN was selected because this method is the combination between Hemming Net and The Max Net so that the data classification can be performed based on the specific characteristics of ultrasound data. Based on the result of system testing, Competitive Neural Network obtained the highest accuracy is 80.84% and the time process is 60.64 seconds (when using 32 feature vectors as well as weight and bias values respectively of 0.03 and 0.002).

Soft sensor based composition estimation and controller design for an ideal reactive distillation column.

PubMed

Vijaya Raghavan, S R; Radhakrishnan, T K; Srinivasan, K

2011-01-01

In this research work, the authors have presented the design and implementation of a recurrent neural network (RNN) based inferential state estimation scheme for an ideal reactive distillation column. Decentralized PI controllers are designed and implemented. The reactive distillation process is controlled by controlling the composition which has been estimated from the available temperature measurements using a type of RNN called Time Delayed Neural Network (TDNN). The performance of the RNN based state estimation scheme under both open loop and closed loop have been compared with a standard Extended Kalman filter (EKF) and a Feed forward Neural Network (FNN). The online training/correction has been done for both RNN and FNN schemes for every ten minutes whenever new un-trained measurements are available from a conventional composition analyzer. The performance of RNN shows better state estimation capability as compared to other state estimation schemes in terms of qualitative and quantitative performance indices. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.

Sparse dictionary learning for resting-state fMRI analysis

NASA Astrophysics Data System (ADS)

Lee, Kangjoo; Han, Paul Kyu; Ye, Jong Chul

2011-09-01

Recently, there has been increased interest in the usage of neuroimaging techniques to investigate what happens in the brain at rest. Functional imaging studies have revealed that the default-mode network activity is disrupted in Alzheimer's disease (AD). However, there is no consensus, as yet, on the choice of analysis method for the application of resting-state analysis for disease classification. This paper proposes a novel compressed sensing based resting-state fMRI analysis tool called Sparse-SPM. As the brain's functional systems has shown to have features of complex networks according to graph theoretical analysis, we apply a graph model to represent a sparse combination of information flows in complex network perspectives. In particular, a new concept of spatially adaptive design matrix has been proposed by implementing sparse dictionary learning based on sparsity. The proposed approach shows better performance compared to other conventional methods, such as independent component analysis (ICA) and seed-based approach, in classifying the AD patients from normal using resting-state analysis.

Influence maximization in social networks under an independent cascade-based model

NASA Astrophysics Data System (ADS)

Wang, Qiyao; Jin, Yuehui; Lin, Zhen; Cheng, Shiduan; Yang, Tan

2016-02-01

The rapid growth of online social networks is important for viral marketing. Influence maximization refers to the process of finding influential users who make the most of information or product adoption. An independent cascade-based model for influence maximization, called IMIC-OC, was proposed to calculate positive influence. We assumed that influential users spread positive opinions. At the beginning, users held positive or negative opinions as their initial opinions. When more users became involved in the discussions, users balanced their own opinions and those of their neighbors. The number of users who did not change positive opinions was used to determine positive influence. Corresponding influential users who had maximum positive influence were then obtained. Experiments were conducted on three real networks, namely, Facebook, HEP-PH and Epinions, to calculate maximum positive influence based on the IMIC-OC model and two other baseline methods. The proposed model resulted in larger positive influence, thus indicating better performance compared with the baseline methods.

Image texture segmentation using a neural network

NASA Astrophysics Data System (ADS)

Sayeh, Mohammed R.; Athinarayanan, Ragu; Dhali, Pushpuak

1992-09-01

In this paper we use a neural network called the Lyapunov associative memory (LYAM) system to segment image texture into different categories or clusters. The LYAM system is constructed by a set of ordinary differential equations which are simulated on a digital computer. The clustering can be achieved by using a single tuning parameter in the simplest model. Pattern classes are represented by the stable equilibrium states of the system. Design of the system is based on synthesizing two local energy functions, namely, the learning and recall energy functions. Before the implementation of the segmentation process, a Gauss-Markov random field (GMRF) model is applied to the raw image. This application suitably reduces the image data and prepares the texture information for the neural network process. We give a simple image example illustrating the capability of the technique. The GMRF-generated features are also used for a clustering, based on the Euclidean distance.

Dynamic virtual optical network embedding in spectral and spatial domains over elastic optical networks with multicore fibers

NASA Astrophysics Data System (ADS)

Zhu, Ruijie; Zhao, Yongli; Yang, Hui; Tan, Yuanlong; Chen, Haoran; Zhang, Jie; Jue, Jason P.

2016-08-01

Network virtualization can eradicate the ossification of the infrastructure and stimulate innovation of new network architectures and applications. Elastic optical networks (EONs) are ideal substrate networks for provisioning flexible virtual optical network (VON) services. However, as network traffic continues to increase exponentially, the capacity of EONs will reach the physical limitation soon. To further increase network flexibility and capacity, the concept of EONs is extended into the spatial domain. How to map the VON onto substrate networks by thoroughly using the spectral and spatial resources is extremely important. This process is called VON embedding (VONE).Considering the two kinds of resources at the same time during the embedding process, we propose two VONE algorithms, the adjacent link embedding algorithm (ALEA) and the remote link embedding algorithm (RLEA). First, we introduce a model to solve the VONE problem. Then we design the embedding ability measurement of network elements. Based on the network elements' embedding ability, two VONE algorithms were proposed. Simulation results show that the proposed VONE algorithms could achieve better performance than the baseline algorithm in terms of blocking probability and revenue-to-cost ratio.

On the Reliability of Individual Brain Activity Networks.

PubMed

Cassidy, Ben; Bowman, F DuBois; Rae, Caroline; Solo, Victor

2018-02-01

There is intense interest in fMRI research on whole-brain functional connectivity, and however, two fundamental issues are still unresolved: the impact of spatiotemporal data resolution (spatial parcellation and temporal sampling) and the impact of the network construction method on the reliability of functional brain networks. In particular, the impact of spatiotemporal data resolution on the resulting connectivity findings has not been sufficiently investigated. In fact, a number of studies have already observed that functional networks often give different conclusions across different parcellation scales. If the interpretations from functional networks are inconsistent across spatiotemporal scales, then the whole validity of the functional network paradigm is called into question. This paper investigates the consistency of resting state network structure when using different temporal sampling or spatial parcellation, or different methods for constructing the networks. To pursue this, we develop a novel network comparison framework based on persistent homology from a topological data analysis. We use the new network comparison tools to characterize the spatial and temporal scales under which consistent functional networks can be constructed. The methods are illustrated on Human Connectome Project data, showing that the DISCOH 2 network construction method outperforms other approaches at most data spatiotemporal resolutions.

Lay persons alerted by mobile application system initiate earlier cardio-pulmonary resuscitation: A comparison with SMS-based system notification.

PubMed

Caputo, Maria Luce; Muschietti, Sandro; Burkart, Roman; Benvenuti, Claudio; Conte, Giulio; Regoli, François; Mauri, Romano; Klersy, Catherine; Moccetti, Tiziano; Auricchio, Angelo

2017-05-01

We compared the time to initiation of cardiopulmonary resuscitation (CPR) by lay responders and/or first responders alerted either via Short Message Service (SMS) or by using a mobile application-based alert system (APP). The Ticino Registry of Cardiac Arrest collects all data about out-of-hospital cardiac arrests (OHCAs) occurring in the Canton of Ticino. At the time of a bystander's call, the EMS dispatcher sends one ambulance and alerts the first-responders network made up of police officers or fire brigade equipped with an automatic external defibrillator, the so called "traditional" first responders, and - if the scene was considered safe - lay responders as well. We evaluated the time from call to arrival of traditional first responders and/or lay responders when alerted either via SMS or the new developed mobile APP. Over the study period 593 OHCAs have occurred. Notification to the first responders network was sent via SMS in 198 cases and via mobile APP in 134 cases. Median time to first responder/lay responder arrival on scene was significantly reduced by the APP-based system (3.5 [2.8-5.2]) compared to the SMS-based system (5.6 [4.2-8.5] min, p 0.0001). The proportion of lay responders arriving first on the scene significantly increased (70% vs. 15%, p<0.01) with the APP. Earlier arrival of a first responder or of a lay responder determined a higher survival rate. The mobile APP system is highly efficient in the recruitment of first responders, significantly reducing the time to the initiation of CPR thus increasing survival rates. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

The role of symmetry in neural networks and their Laplacian spectra.

PubMed

de Lange, Siemon C; van den Heuvel, Martijn P; de Reus, Marcel A

2016-11-01

Human and animal nervous systems constitute complexly wired networks that form the infrastructure for neural processing and integration of information. The organization of these neural networks can be analyzed using the so-called Laplacian spectrum, providing a mathematical tool to produce systems-level network fingerprints. In this article, we examine a characteristic central peak in the spectrum of neural networks, including anatomical brain network maps of the mouse, cat and macaque, as well as anatomical and functional network maps of human brain connectivity. We link the occurrence of this central peak to the level of symmetry in neural networks, an intriguing aspect of network organization resulting from network elements that exhibit similar wiring patterns. Specifically, we propose a measure to capture the global level of symmetry of a network and show that, for both empirical networks and network models, the height of the main peak in the Laplacian spectrum is strongly related to node symmetry in the underlying network. Moreover, examination of spectra of duplication-based model networks shows that neural spectra are best approximated using a trade-off between duplication and diversification. Taken together, our results facilitate a better understanding of neural network spectra and the importance of symmetry in neural networks. Copyright © 2016 Elsevier Inc. All rights reserved.

Encryption for confidentiality of the network and influence of this to the quality of streaming video through network

NASA Astrophysics Data System (ADS)

Sevcik, L.; Uhrin, D.; Frnda, J.; Voznak, M.; Toral-Cruz, Homer; Mikulec, M.; Jakovlev, Sergej

2015-05-01

Nowadays, the interest in real-time services, like audio and video, is growing. These services are mostly transmitted over packet networks, which are based on IP protocol. It leads to analyses of these services and their behavior in such networks which are becoming more frequent. Video has become the significant part of all data traffic sent via IP networks. In general, a video service is one-way service (except e.g. video calls) and network delay is not such an important factor as in a voice service. Dominant network factors that influence the final video quality are especially packet loss, delay variation and the capacity of the transmission links. Analysis of video quality concentrates on the resistance of video codecs to packet loss in the network, which causes artefacts in the video. IPsec provides confidentiality in terms of safety, integrity and non-repudiation (using HMAC-SHA1 and 3DES encryption for confidentiality and AES in CBC mode) with an authentication header and ESP (Encapsulating Security Payload). The paper brings a detailed view of the performance of video streaming over an IP-based network. We compared quality of video with packet loss and encryption as well. The measured results demonstrated the relation between the video codec type and bitrate to the final video quality.

Diverse Region-Based CNN for Hyperspectral Image Classification.

PubMed

Zhang, Mengmeng; Li, Wei; Du, Qian

2018-06-01

Convolutional neural network (CNN) is of great interest in machine learning and has demonstrated excellent performance in hyperspectral image classification. In this paper, we propose a classification framework, called diverse region-based CNN, which can encode semantic context-aware representation to obtain promising features. With merging a diverse set of discriminative appearance factors, the resulting CNN-based representation exhibits spatial-spectral context sensitivity that is essential for accurate pixel classification. The proposed method exploiting diverse region-based inputs to learn contextual interactional features is expected to have more discriminative power. The joint representation containing rich spectral and spatial information is then fed to a fully connected network and the label of each pixel vector is predicted by a softmax layer. Experimental results with widely used hyperspectral image data sets demonstrate that the proposed method can surpass any other conventional deep learning-based classifiers and other state-of-the-art classifiers.

RuleMonkey: software for stochastic simulation of rule-based models

PubMed Central

2010-01-01

Background The system-level dynamics of many molecular interactions, particularly protein-protein interactions, can be conveniently represented using reaction rules, which can be specified using model-specification languages, such as the BioNetGen language (BNGL). A set of rules implicitly defines a (bio)chemical reaction network. The reaction network implied by a set of rules is often very large, and as a result, generation of the network implied by rules tends to be computationally expensive. Moreover, the cost of many commonly used methods for simulating network dynamics is a function of network size. Together these factors have limited application of the rule-based modeling approach. Recently, several methods for simulating rule-based models have been developed that avoid the expensive step of network generation. The cost of these "network-free" simulation methods is independent of the number of reactions implied by rules. Software implementing such methods is now needed for the simulation and analysis of rule-based models of biochemical systems. Results Here, we present a software tool called RuleMonkey, which implements a network-free method for simulation of rule-based models that is similar to Gillespie's method. The method is suitable for rule-based models that can be encoded in BNGL, including models with rules that have global application conditions, such as rules for intramolecular association reactions. In addition, the method is rejection free, unlike other network-free methods that introduce null events, i.e., steps in the simulation procedure that do not change the state of the reaction system being simulated. We verify that RuleMonkey produces correct simulation results, and we compare its performance against DYNSTOC, another BNGL-compliant tool for network-free simulation of rule-based models. We also compare RuleMonkey against problem-specific codes implementing network-free simulation methods. Conclusions RuleMonkey enables the simulation of rule-based models for which the underlying reaction networks are large. It is typically faster than DYNSTOC for benchmark problems that we have examined. RuleMonkey is freely available as a stand-alone application http://public.tgen.org/rulemonkey. It is also available as a simulation engine within GetBonNie, a web-based environment for building, analyzing and sharing rule-based models. PMID:20673321

[Personal emergency call system based on human vital and system technical parameters in a Smart Home environment].

PubMed

Hampicke, M; Schadow, B; Rossdeutscher, W; Fellbaum, K; Boenick, U

2002-11-01

Progress in microtechnology and radio transmission technology has enabled the development of highly reliable emergency-call systems. The present article describes systems that have been specially designed to improve the safety and independence of handicapped and elderly persons living at home. For such persons immediate help in an emergency situation is of crucial importance. The technical state of the art of emergency-call systems specially developed for use by the elderly, is briefly discussed, in particular the well-known radio emergency-call button, with the aid of which an alarm can be activated manually. This system, however, does not offer adequate safety in all emergency situations. Alternative or complementary systems designed to automatically trigger an alarm on the basis of the recording and evaluation of so-called vital parameters, are therefore proposed. In addition, in a smart-home environment with networked devices, further parameters--so-called environment parameters can be used. It is found that the identification of an emergency situation becomes more reliable as the number of parameters employed increases.

Optimization of European call options considering physical delivery network and reservoir operation rules

NASA Astrophysics Data System (ADS)

Cheng, Wei-Chen; Hsu, Nien-Sheng; Cheng, Wen-Ming; Yeh, William W.-G.

2011-10-01

This paper develops alternative strategies for European call options for water purchase under hydrological uncertainties that can be used by water resources managers for decision making. Each alternative strategy maximizes its own objective over a selected sequence of future hydrology that is characterized by exceedance probability. Water trade provides flexibility and enhances water distribution system reliability. However, water trade between two parties in a regional water distribution system involves many issues, such as delivery network, reservoir operation rules, storage space, demand, water availability, uncertainty, and any existing contracts. An option is a security giving the right to buy or sell an asset; in our case, the asset is water. We extend a flow path-based water distribution model to include reservoir operation rules. The model simultaneously considers both the physical distribution network as well as the relationships between water sellers and buyers. We first test the model extension. Then we apply the proposed optimization model for European call options to the Tainan water distribution system in southern Taiwan. The formulation lends itself to a mixed integer linear programming model. We use the weighing method to formulate a composite function for a multiobjective problem. The proposed methodology provides water resources managers with an overall picture of water trade strategies and the consequence of each strategy. The results from the case study indicate that the strategy associated with a streamflow exceedence probability of 50% or smaller should be adopted as the reference strategy for the Tainan water distribution system.

The ground truth about metadata and community detection in networks

PubMed Central

Peel, Leto; Larremore, Daniel B.; Clauset, Aaron

2017-01-01

Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system’s components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate the performance of community detection algorithms by their ability to find so-called ground truth communities. This works well in synthetic networks with planted communities because these networks’ links are formed explicitly based on those known communities. However, there are no planted communities in real-world networks. Instead, it is standard practice to treat some observed discrete-valued node attributes, or metadata, as ground truth. We show that metadata are not the same as ground truth and that treating them as such induces severe theoretical and practical problems. We prove that no algorithm can uniquely solve community detection, and we prove a general No Free Lunch theorem for community detection, which implies that there can be no algorithm that is optimal for all possible community detection tasks. However, community detection remains a powerful tool and node metadata still have value, so a careful exploration of their relationship with network structure can yield insights of genuine worth. We illustrate this point by introducing two statistical techniques that can quantify the relationship between metadata and community structure for a broad class of models. We demonstrate these techniques using both synthetic and real-world networks, and for multiple types of metadata and community structures. PMID:28508065

Bidirectional QoS support for novelty detection applications based on hierarchical wireless sensor network model

NASA Astrophysics Data System (ADS)

Edwards, Mark; Hu, Fei; Kumar, Sunil

2004-10-01

The research on the Novelty Detection System (NDS) (called as VENUS) at the authors' universities has generated exciting results. For example, we can detect an abnormal behavior (such as cars thefts from the parking lot) from a series of video frames based on the cognitively motivated theory of habituation. In this paper, we would like to describe the implementation strategies of lower layer protocols for using large-scale Wireless Sensor Networks (WSN) to NDS with Quality-of-Service (QoS) support. Wireless data collection framework, consisting of small and low-power sensor nodes, provides an alternative mechanism to observe the physical world, by using various types of sensing capabilities that include images (and even videos using Panoptos), sound and basic physical measurements such as temperature. We do not want to lose any 'data query command' packets (in the downstream direction: sink-to-sensors) or have any bit-errors in them since they are so important to the whole sensor network. In the upstream direction (sensors-to-sink), we may tolerate the loss of some sensing data packets. But the 'interested' sensing flow should be assigned a higher priority in terms of multi-hop path choice, network bandwidth allocation, and sensing data packet generation frequency (we hope to generate more sensing data packet for that novel event in the specified network area). The focus of this paper is to investigate MAC-level Quality of Service (QoS) issue in Wireless Sensor Networks (WSN) for Novelty Detection applications. Although QoS has been widely studied in other types of networks including wired Internet, general ad hoc networks and mobile cellular networks, we argue that QoS in WSN has its own characteristics. In wired Internet, the main QoS parameters include delay, jitter and bandwidth. In mobile cellular networks, two most common QoS metrics are: handoff call dropping probability and new call blocking probability. Since the main task of WSN is to detect and report events, the most important QoS parameters should include sensing data packet transmission reliability, lifetime extension degree from sensor sleeping control, event detection latency, congestion reduction level through removal of redundant sensing data. In this paper, we will focus on the following bi-directional QoS topics: (1) Downstream (sink-to-sensor) QoS: Reliable data query command forwarding to particular sensor(s). In other words, we do not want to lose the query command packets; (2) Upstream (sensor-to-sink) QoS: transmission of sensed data with priority control. The more interested data that can help in novelty detection should be transmitted on an optimal path with higher reliability. We propose the use of Differentiated Data Collection. Due to the large-scale nature and resource constraints of typical wireless sensor networks, such as limited energy, small memory (typically RAM < 4K bytes) and short communication range, the above problems become even more challenging. Besides QoS support issue, we will also describe our low-energy Sensing Data Transmission network Architecture. Our research results show the scalability and energy-efficiency of our proposed WSN QoS schemes.

Network inference using informative priors

PubMed Central

Mukherjee, Sach; Speed, Terence P.

2008-01-01

Recent years have seen much interest in the study of systems characterized by multiple interacting components. A class of statistical models called graphical models, in which graphs are used to represent probabilistic relationships between variables, provides a framework for formal inference regarding such systems. In many settings, the object of inference is the network structure itself. This problem of “network inference” is well known to be a challenging one. However, in scientific settings there is very often existing information regarding network connectivity. A natural idea then is to take account of such information during inference. This article addresses the question of incorporating prior information into network inference. We focus on directed models called Bayesian networks, and use Markov chain Monte Carlo to draw samples from posterior distributions over network structures. We introduce prior distributions on graphs capable of capturing information regarding network features including edges, classes of edges, degree distributions, and sparsity. We illustrate our approach in the context of systems biology, applying our methods to network inference in cancer signaling. PMID:18799736

Network inference using informative priors.

PubMed

Mukherjee, Sach; Speed, Terence P

2008-09-23

Recent years have seen much interest in the study of systems characterized by multiple interacting components. A class of statistical models called graphical models, in which graphs are used to represent probabilistic relationships between variables, provides a framework for formal inference regarding such systems. In many settings, the object of inference is the network structure itself. This problem of "network inference" is well known to be a challenging one. However, in scientific settings there is very often existing information regarding network connectivity. A natural idea then is to take account of such information during inference. This article addresses the question of incorporating prior information into network inference. We focus on directed models called Bayesian networks, and use Markov chain Monte Carlo to draw samples from posterior distributions over network structures. We introduce prior distributions on graphs capable of capturing information regarding network features including edges, classes of edges, degree distributions, and sparsity. We illustrate our approach in the context of systems biology, applying our methods to network inference in cancer signaling.

Comparison of Point Matching Techniques for Road Network Matching

NASA Astrophysics Data System (ADS)

Hackeloeer, A.; Klasing, K.; Krisp, J. M.; Meng, L.

2013-05-01

Map conflation investigates the unique identification of geographical entities across different maps depicting the same geographic region. It involves a matching process which aims to find commonalities between geographic features. A specific subdomain of conflation called Road Network Matching establishes correspondences between road networks of different maps on multiple layers of abstraction, ranging from elementary point locations to high-level structures such as road segments or even subgraphs derived from the induced graph of a road network. The process of identifying points located on different maps by means of geometrical, topological and semantical information is called point matching. This paper provides an overview of various techniques for point matching, which is a fundamental requirement for subsequent matching steps focusing on complex high-level entities in geospatial networks. Common point matching approaches as well as certain combinations of these are described, classified and evaluated. Furthermore, a novel similarity metric called the Exact Angular Index is introduced, which considers both topological and geometrical aspects. The results offer a basis for further research on a bottom-up matching process for complex map features, which must rely upon findings derived from suitable point matching algorithms. In the context of Road Network Matching, reliable point matches provide an immediate starting point for finding matches between line segments describing the geometry and topology of road networks, which may in turn be used for performing a structural high-level matching on the network level.

Statistical Mechanics of Temporal and Interacting Networks

NASA Astrophysics Data System (ADS)

Zhao, Kun

In the last ten years important breakthroughs in the understanding of the topology of complexity have been made in the framework of network science. Indeed it has been found that many networks belong to the universality classes called small-world networks or scale-free networks. Moreover it was found that the complex architecture of real world networks strongly affects the critical phenomena defined on these structures. Nevertheless the main focus of the research has been the characterization of single and static networks. Recently, temporal networks and interacting networks have attracted large interest. Indeed many networks are interacting or formed by a multilayer structure. Example of these networks are found in social networks where an individual might be at the same time part of different social networks, in economic and financial networks, in physiology or in infrastructure systems. Moreover, many networks are temporal, i.e. the links appear and disappear on the fast time scale. Examples of these networks are social networks of contacts such as face-to-face interactions or mobile-phone communication, the time-dependent correlations in the brain activity and etc. Understanding the evolution of temporal and multilayer networks and characterizing critical phenomena in these systems is crucial if we want to describe, predict and control the dynamics of complex system. In this thesis, we investigate several statistical mechanics models of temporal and interacting networks, to shed light on the dynamics of this new generation of complex networks. First, we investigate a model of temporal social networks aimed at characterizing human social interactions such as face-to-face interactions and phone-call communication. Indeed thanks to the availability of data on these interactions, we are now in the position to compare the proposed model to the real data finding good agreement. Second, we investigate the entropy of temporal networks and growing networks , to provide a new framework to quantify the information encoded in these networks and to answer a fundamental problem in network science: how complex are temporal and growing networks. Finally, we consider two examples of critical phenomena in interacting networks. In particular, on one side we investigate the percolation of interacting networks by introducing antagonistic interactions. On the other side, we investigate a model of political election based on the percolation of antagonistic networks. The aim of this research is to show how antagonistic interactions change the physics of critical phenomena on interacting networks. We believe that the work presented in these thesis offers the possibility to appreciate the large variability of problems that can be addressed in the new framework of temporal and interacting networks.

A simplified computational memory model from information processing.

PubMed

Zhang, Lanhua; Zhang, Dongsheng; Deng, Yuqin; Ding, Xiaoqian; Wang, Yan; Tang, Yiyuan; Sun, Baoliang

2016-11-23

This paper is intended to propose a computational model for memory from the view of information processing. The model, called simplified memory information retrieval network (SMIRN), is a bi-modular hierarchical functional memory network by abstracting memory function and simulating memory information processing. At first meta-memory is defined to express the neuron or brain cortices based on the biology and graph theories, and we develop an intra-modular network with the modeling algorithm by mapping the node and edge, and then the bi-modular network is delineated with intra-modular and inter-modular. At last a polynomial retrieval algorithm is introduced. In this paper we simulate the memory phenomena and functions of memorization and strengthening by information processing algorithms. The theoretical analysis and the simulation results show that the model is in accordance with the memory phenomena from information processing view.

Demonstration of Cost-Effective, High-Performance Computing at Performance and Reliability Levels Equivalent to a 1994 Vector Supercomputer

NASA Technical Reports Server (NTRS)

Babrauckas, Theresa

2000-01-01

The Affordable High Performance Computing (AHPC) project demonstrated that high-performance computing based on a distributed network of computer workstations is a cost-effective alternative to vector supercomputers for running CPU and memory intensive design and analysis tools. The AHPC project created an integrated system called a Network Supercomputer. By connecting computer work-stations through a network and utilizing the workstations when they are idle, the resulting distributed-workstation environment has the same performance and reliability levels as the Cray C90 vector Supercomputer at less than 25 percent of the C90 cost. In fact, the cost comparison between a Cray C90 Supercomputer and Sun workstations showed that the number of distributed networked workstations equivalent to a C90 costs approximately 8 percent of the C90.

Particle identification with neural networks using a rotational invariant moment representation

NASA Astrophysics Data System (ADS)

Sinkus, Ralph; Voss, Thomas

1997-02-01

A feed-forward neural network is used to identify electromagnetic particles based upon their showering properties within a segmented calorimeter. A preprocessing procedure is applied to the spatial energy distribution of the particle shower in order to account for the varying geometry of the calorimeter. The novel feature is the expansion of the energy distribution in terms of moments of the so-called Zernike functions which are invariant under rotation. The distributions of moments exhibit very different scales, thus the multidimensional input distribution for the neural network is transformed via a principal component analysis and rescaled by its respective variances to ensure input values of the order of one. This increases the sensitivity of the network and thus results in better performance in identifying and separating electromagnetic from hadronic particles, especially at low energies.

Dynamic segment shared protection for multicast traffic in meshed wavelength-division-multiplexing optical networks

NASA Astrophysics Data System (ADS)

Liao, Luhua; Li, Lemin; Wang, Sheng

2006-12-01

We investigate the protection approach for dynamic multicast traffic under shared risk link group (SRLG) constraints in meshed wavelength-division-multiplexing optical networks. We present a shared protection algorithm called dynamic segment shared protection for multicast traffic (DSSPM), which can dynamically adjust the link cost according to the current network state and can establish a primary light-tree as well as corresponding SRLG-disjoint backup segments for a dependable multicast connection. A backup segment can efficiently share the wavelength capacity of its working tree and the common resources of other backup segments based on SRLG-disjoint constraints. The simulation results show that DSSPM not only can protect the multicast sessions against a single-SRLG breakdown, but can make better use of the wavelength resources and also lower the network blocking probability.

PRAIS: Distributed, real-time knowledge-based systems made easy

NASA Technical Reports Server (NTRS)

Goldstein, David G.

1990-01-01

This paper discusses an architecture for real-time, distributed (parallel) knowledge-based systems called the Parallel Real-time Artificial Intelligence System (PRAIS). PRAIS strives for transparently parallelizing production (rule-based) systems, even when under real-time constraints. PRAIS accomplishes these goals by incorporating a dynamic task scheduler, operating system extensions for fact handling, and message-passing among multiple copies of CLIPS executing on a virtual blackboard. This distributed knowledge-based system tool uses the portability of CLIPS and common message-passing protocols to operate over a heterogeneous network of processors.

Prediction of competitive diffusion on complex networks

NASA Astrophysics Data System (ADS)

Zhao, Jiuhua; Liu, Qipeng; Wang, Lin; Wang, Xiaofan

2018-10-01

In this paper, we study the prediction problem of diffusion process on complex networks in competitive circumstances. With this problem solved, the competitors could timely intervene the diffusion process if needed such that an expected outcome might be obtained. We consider a model with two groups of competitors spreading opposite opinions on a network. A prediction method based on the mutual influences among the agents is proposed, called Influence Matrix (IM for short), and simulations on real-world networks show that the proposed IM method has quite high accuracy on predicting both the preference of any normal agent and the final competition result. For comparison purpose, classic centrality measures are also used to predict the competition result. It is shown that PageRank, Degree, Katz Centrality, and the IM method are suitable for predicting the competition result. More precisely, in undirected networks, the IM method performs better than these centrality measures when the competing group contains more than one agent; in directed networks, the IM method performs only second to PageRank.

A Spectrum Access Based on Quality of Service (QoS) in Cognitive Radio Networks.

PubMed

Zhai, Linbo; Wang, Hua; Gao, Chuangen

2016-01-01

The quality of service (QoS) is important issue for cognitive radio networks. In the cognitive radio system, the licensed users, also called primary users (PUs), are authorized to utilize the wireless spectrum, while unlicensed users, also called secondary users (SUs), are not authorized to use the wireless spectrum. SUs access the wireless spectrum opportunistically when the spectrum is idle. While SUs use an idle channel, the instance that PUs come back makes SUs terminate their communications and leave the current channel. Therefore, quality of service (QoS) is difficult to be ensured for SUs. In this paper, we first propose an analysis model to obtain QoS for cognitive radio networks such as blocking probability, completed traffic and termination probability of SUs. When the primary users use the channels frequently, QoS of SUs is difficult to be ensured, especially the termination probability. Then, we propose a channel reservation scheme to improve QoS of SUs. The scheme makes the terminated SUs move to the reserved channels and keep on communications. Simulation results show that our scheme can improve QoS of SUs especially the termination probability with a little cost of blocking probability in dynamic environment.

Computer Code for Transportation Network Design and Analysis

DOT National Transportation Integrated Search

1977-01-01

This document describes the results of research into the application of the mathematical programming technique of decomposition to practical transportation network problems. A computer code called Catnap (for Control Analysis Transportation Network A...

Programmable ubiquitous telerobotic devices

NASA Astrophysics Data System (ADS)

Doherty, Michael; Greene, Matthew; Keaton, David; Och, Christian; Seidl, Matthew L.; Waite, William; Zorn, Benjamin G.

1997-12-01

We are investigating a field of research that we call ubiquitous telepresence, which involves the design and implementation of low-cost robotic devices that can be programmed and operated from anywhere on the Internet. These devices, which we call ubots, can be used for academic purposes (e.g., a biologist could remote conduct a population survey), commercial purposes (e.g., a house could be shown remotely by a real-estate agent), and for recreation and education (e.g., someone could tour a museum remotely). We anticipate that such devices will become increasingly common due to recent changes in hardware and software technology. In particular, current hardware technology enables such devices to be constructed very cheaply (less than $500), and current software and network technology allows highly portable code to be written and downloaded across the Internet. In this paper, we present our prototype system architecture, and the ubot implementation we have constructed based on it. The hardware technology we use is the handy board, a 6811-based controller board with digital and analog inputs and outputs. Our software includes a network layer based on TCP/IP and software layers written in Java. Our software enables users across the Internet to program the behavior of the vehicle and to receive image feedback from a camera mounted on it.

Pubface: Celebrity face identification based on deep learning

NASA Astrophysics Data System (ADS)

Ouanan, H.; Ouanan, M.; Aksasse, B.

2018-05-01

In this paper, we describe a new real time application called PubFace, which allows to recognize celebrities in public spaces by employs a new pose invariant face recognition deep neural network algorithm with an extremely low error rate. To build this application, we make the following contributions: firstly, we build a novel dataset with over five million faces labelled. Secondly, we fine tuning the deep convolutional neural network (CNN) VGG-16 architecture on our new dataset that we have built. Finally, we deploy this model on the Raspberry Pi 3 model B using the OpenCv dnn module (OpenCV 3.3).

New amplifying laser concept for inertial fusion driver

NASA Astrophysics Data System (ADS)

Mourou, G. A.; Labaune, C.; Hulin, D.; Galvanauskas, A.

2008-05-01

This paper presents a new amplifying laser concept designed to produce high energy in either short or long pulses using coherent or incoherent addition of few millions fibers. These are called respectively CAN for Coherent Amplification Network and FAN for Fiber Amplification Network. The fibers would be large core or Large Mode Area (LMA) which have demonstrated up to 10, mJ output energy per fiber1. Such a system could meet the driver criteria of Inertial Fusion Energy (IFE) power plants based on Inertial Confinement Fusion (ICF), in particular high efficiency and high repetition rate.

Assessing the Impact of Homophobic Name Calling on Early Adolescent Mental Health: A Longitudinal Social Network Analysis of Competing Peer Influence Effects.

PubMed

DeLay, Dawn; Hanish, Laura D; Zhang, Linlin; Martin, Carol Lynn

2017-05-01

The goal of the current study was to improve our understanding of why adolescence is a critical period for the consideration of declining mental health. We did this by focusing on the impact of homophobic name calling on early adolescent mental health after the transition to middle school. Because we know that homophobic name calling emerges within a dynamic peer group structure, we used longitudinal social network analysis to assess the relation between homophobic name calling, depressive symptoms, and self-esteem while simultaneously limiting bias from alternative peer socialization mechanisms. A sample of adolescents who recently transitioned to a large public middle school (N = 299; 53 % girls; M age  = 11.13 years, SD = 0.48) were assessed. Longitudinal assessments of peer relationship networks, depressive symptoms, and self-esteem were collected during the fall and spring of the academic year. The results suggest that, after accounting for the simultaneous effect of alternative peer socialization processes, adolescent experiences of homophobic name calling in the fall predict higher levels of depressive symptoms and lower levels of self-esteem over the course of the academic year. These findings provide evidence of a significant influence of homophobic name calling on adolescent mental health.

Packetized Video On MAGNET

NASA Astrophysics Data System (ADS)

Lazar, Aurel A.; White, John S.

1987-07-01

Theoretical analysis of integrated local area network model of MAGNET, an integrated network testbed developed at Columbia University, shows that the bandwidth freed up during video and voice calls during periods of little movement in the images and periods of silence in the speech signals could be utilized efficiently for graphics and data transmission. Based on these investigations, an architecture supporting adaptive protocols that are dynamicaly controlled by the requirements of a fluctuating load and changing user environment has been advanced. To further analyze the behavior of the network, a real-time packetized video system has been implemented. This system is embedded in the real-time multimedia workstation EDDY, which integrates video, voice, and data traffic flows. Protocols supporting variable-bandwidth, fixed-quality packetized video transport are described in detail.

Intelligent Foreign Particle Inspection Machine for Injection Liquid Examination Based on Modified Pulse-Coupled Neural Networks

PubMed Central

Ge, Ji; Wang, YaoNan; Zhou, BoWen; Zhang, Hui

2009-01-01

A biologically inspired spiking neural network model, called pulse-coupled neural networks (PCNN), has been applied in an automatic inspection machine to detect visible foreign particles intermingled in glucose or sodium chloride injection liquids. Proper mechanisms and improved spin/stop techniques are proposed to avoid the appearance of air bubbles, which increases the algorithms' complexity. Modified PCNN is adopted to segment the difference images, judging the existence of foreign particles according to the continuity and smoothness properties of their moving traces. Preliminarily experimental results indicate that the inspection machine can detect the visible foreign particles effectively and the detection speed, accuracy and correct detection rate also satisfying the needs of medicine preparation. PMID:22412318

CENet: A Cabinet Environmental Sensing Network

PubMed Central

Zhang, Zusheng; Yu, Fengqi; Chen, Liang; Cao, Guangmin

2010-01-01

For data center cooling and intelligent substation systems, real time cabinet environmental monitoring is a strong requirement. Monitoring data, such as temperature, humidity, and noise, is important for operators to manage the facilities in cabinets. We here propose a sensing network, called CENet, which is energy efficient and reliable for cabinet environmental monitoring. CENet achieves above 93% reliable data yield and sends fewer beacons compared to periodic beaconing. It does so through a data-aided routing protocol. In addition, based on B-MAC, we propose a scheduling scheme to increase the lifetime of the network by reducing unnecessary message snooping and channel listening, thus it is more energy efficient than B-MAC. The performance of CENet is evaluated by simulations and experiments. PMID:22205856

Mean Field Analysis of Large-Scale Interacting Populations of Stochastic Conductance-Based Spiking Neurons Using the Klimontovich Method

NASA Astrophysics Data System (ADS)

Gandolfo, Daniel; Rodriguez, Roger; Tuckwell, Henry C.

2017-03-01

We investigate the dynamics of large-scale interacting neural populations, composed of conductance based, spiking model neurons with modifiable synaptic connection strengths, which are possibly also subjected to external noisy currents. The network dynamics is controlled by a set of neural population probability distributions (PPD) which are constructed along the same lines as in the Klimontovich approach to the kinetic theory of plasmas. An exact non-closed, nonlinear, system of integro-partial differential equations is derived for the PPDs. As is customary, a closing procedure leads to a mean field limit. The equations we have obtained are of the same type as those which have been recently derived using rigorous techniques of probability theory. The numerical solutions of these so called McKean-Vlasov-Fokker-Planck equations, which are only valid in the limit of infinite size networks, actually shows that the statistical measures as obtained from PPDs are in good agreement with those obtained through direct integration of the stochastic dynamical system for large but finite size networks. Although numerical solutions have been obtained for networks of Fitzhugh-Nagumo model neurons, which are often used to approximate Hodgkin-Huxley model neurons, the theory can be readily applied to networks of general conductance-based model neurons of arbitrary dimension.

Predicting Mycobacterium tuberculosis Complex Clades Using Knowledge-Based Bayesian Networks

PubMed Central

Bennett, Kristin P.

2014-01-01

We develop a novel approach for incorporating expert rules into Bayesian networks for classification of Mycobacterium tuberculosis complex (MTBC) clades. The proposed knowledge-based Bayesian network (KBBN) treats sets of expert rules as prior distributions on the classes. Unlike prior knowledge-based support vector machine approaches which require rules expressed as polyhedral sets, KBBN directly incorporates the rules without any modification. KBBN uses data to refine rule-based classifiers when the rule set is incomplete or ambiguous. We develop a predictive KBBN model for 69 MTBC clades found in the SITVIT international collection. We validate the approach using two testbeds that model knowledge of the MTBC obtained from two different experts and large DNA fingerprint databases to predict MTBC genetic clades and sublineages. These models represent strains of MTBC using high-throughput biomarkers called spacer oligonucleotide types (spoligotypes), since these are routinely gathered from MTBC isolates of tuberculosis (TB) patients. Results show that incorporating rules into problems can drastically increase classification accuracy if data alone are insufficient. The SITVIT KBBN is publicly available for use on the World Wide Web. PMID:24864238

The middleware architecture supports heterogeneous network systems for module-based personal robot system

NASA Astrophysics Data System (ADS)

Choo, Seongho; Li, Vitaly; Choi, Dong Hee; Jung, Gi Deck; Park, Hong Seong; Ryuh, Youngsun

2005-12-01

On developing the personal robot system presently, the internal architecture is every module those occupy separated functions are connected through heterogeneous network system. This module-based architecture supports specialization and division of labor at not only designing but also implementation, as an effect of this architecture, it can reduce developing times and costs for modules. Furthermore, because every module is connected among other modules through network systems, we can get easy integrations and synergy effect to apply advanced mutual functions by co-working some modules. In this architecture, one of the most important technologies is the network middleware that takes charge communications among each modules connected through heterogeneous networks systems. The network middleware acts as the human nerve system inside of personal robot system; it relays, transmits, and translates information appropriately between modules that are similar to human organizations. The network middleware supports various hardware platform, heterogeneous network systems (Ethernet, Wireless LAN, USB, IEEE 1394, CAN, CDMA-SMS, RS-232C). This paper discussed some mechanisms about our network middleware to intercommunication and routing among modules, methods for real-time data communication and fault-tolerant network service. There have designed and implemented a layered network middleware scheme, distributed routing management, network monitoring/notification technology on heterogeneous networks for these goals. The main theme is how to make routing information in our network middleware. Additionally, with this routing information table, we appended some features. Now we are designing, making a new version network middleware (we call 'OO M/W') that can support object-oriented operation, also are updating program sources itself for object-oriented architecture. It is lighter, faster, and can support more operation systems and heterogeneous network systems, but other general purposed middlewares like CORBA, UPnP, etc. can support only one network protocol or operating system.

Distributed Efficient Similarity Search Mechanism in Wireless Sensor Networks

PubMed Central

Ahmed, Khandakar; Gregory, Mark A.

2015-01-01

The Wireless Sensor Network similarity search problem has received considerable research attention due to sensor hardware imprecision and environmental parameter variations. Most of the state-of-the-art distributed data centric storage (DCS) schemes lack optimization for similarity queries of events. In this paper, a DCS scheme with metric based similarity searching (DCSMSS) is proposed. DCSMSS takes motivation from vector distance index, called iDistance, in order to transform the issue of similarity searching into the problem of an interval search in one dimension. In addition, a sector based distance routing algorithm is used to efficiently route messages. Extensive simulation results reveal that DCSMSS is highly efficient and significantly outperforms previous approaches in processing similarity search queries. PMID:25751081

Online Databases for Taxonomy and Identification of Pathogenic Fungi and Proposal for a Cloud-Based Dynamic Data Network Platform

PubMed Central

Prakash, Peralam Yegneswaran; Irinyi, Laszlo; Halliday, Catriona; Chen, Sharon; Robert, Vincent

2017-01-01

ABSTRACT The increase in public online databases dedicated to fungal identification is noteworthy. This can be attributed to improved access to molecular approaches to characterize fungi, as well as to delineate species within specific fungal groups in the last 2 decades, leading to an ever-increasing complexity of taxonomic assortments and nomenclatural reassignments. Thus, well-curated fungal databases with substantial accurate sequence data play a pivotal role for further research and diagnostics in the field of mycology. This minireview aims to provide an overview of currently available online databases for the taxonomy and identification of human and animal-pathogenic fungi and calls for the establishment of a cloud-based dynamic data network platform. PMID:28179406

An Ultra-Low Power and Flexible Acoustic Modem Design to Develop Energy-Efficient Underwater Sensor Networks

PubMed Central

Sánchez, Antonio; Blanc, Sara; Yuste, Pedro; Perles, Angel; Serrano, Juan José

2012-01-01

This paper is focused on the description of the physical layer of a new acoustic modem called ITACA. The modem architecture includes as a major novelty an ultra-low power asynchronous wake-up system implementation for underwater acoustic transmission that is based on a low-cost off-the-shelf RFID peripheral integrated circuit. This feature enables a reduced power dissipation of 10 μW in stand-by mode and registers very low power values during reception and transmission. The modem also incorporates clear channel assessment (CCA) to support CSMA-based medium access control (MAC) layer protocols. The design is part of a compact platform for a long-life short/medium range underwater wireless sensor network. PMID:22969324

An ultra-low power and flexible acoustic modem design to develop energy-efficient underwater sensor networks.

PubMed

Sánchez, Antonio; Blanc, Sara; Yuste, Pedro; Perles, Angel; Serrano, Juan José

2012-01-01

This paper is focused on the description of the physical layer of a new acoustic modem called ITACA. The modem architecture includes as a major novelty an ultra-low power asynchronous wake-up system implementation for underwater acoustic transmission that is based on a low-cost off-the-shelf RFID peripheral integrated circuit. This feature enables a reduced power dissipation of 10 μW in stand-by mode and registers very low power values during reception and transmission. The modem also incorporates clear channel assessment (CCA) to support CSMA-based medium access control (MAC) layer protocols. The design is part of a compact platform for a long-life short/medium range underwater wireless sensor network.

Genetic learning in rule-based and neural systems

NASA Technical Reports Server (NTRS)

Smith, Robert E.

1993-01-01

The design of neural networks and fuzzy systems can involve complex, nonlinear, and ill-conditioned optimization problems. Often, traditional optimization schemes are inadequate or inapplicable for such tasks. Genetic Algorithms (GA's) are a class of optimization procedures whose mechanics are based on those of natural genetics. Mathematical arguments show how GAs bring substantial computational leverage to search problems, without requiring the mathematical characteristics often necessary for traditional optimization schemes (e.g., modality, continuity, availability of derivative information, etc.). GA's have proven effective in a variety of search tasks that arise in neural networks and fuzzy systems. This presentation begins by introducing the mechanism and theoretical underpinnings of GA's. GA's are then related to a class of rule-based machine learning systems called learning classifier systems (LCS's). An LCS implements a low-level production-system that uses a GA as its primary rule discovery mechanism. This presentation illustrates how, despite its rule-based framework, an LCS can be thought of as a competitive neural network. Neural network simulator code for an LCS is presented. In this context, the GA is doing more than optimizing and objective function. It is searching for an ecology of hidden nodes with limited connectivity. The GA attempts to evolve this ecology such that effective neural network performance results. The GA is particularly well adapted to this task, given its naturally-inspired basis. The LCS/neural network analogy extends itself to other, more traditional neural networks. Conclusions to the presentation discuss the implications of using GA's in ecological search problems that arise in neural and fuzzy systems.

From seconds to months: an overview of multi-scale dynamics of mobile telephone calls

NASA Astrophysics Data System (ADS)

Saramäki, Jari; Moro, Esteban

2015-06-01

Big Data on electronic records of social interactions allow approaching human behaviour and sociality from a quantitative point of view with unforeseen statistical power. Mobile telephone Call Detail Records (CDRs), automatically collected by telecom operators for billing purposes, have proven especially fruitful for understanding one-to-one communication patterns as well as the dynamics of social networks that are reflected in such patterns. We present an overview of empirical results on the multi-scale dynamics of social dynamics and networks inferred from mobile telephone calls. We begin with the shortest timescales and fastest dynamics, such as burstiness of call sequences between individuals, and "zoom out" towards longer temporal and larger structural scales, from temporal motifs formed by correlated calls between multiple individuals to long-term dynamics of social groups. We conclude this overview with a future outlook.

An Exploration of Autonetnography as an eResearch Methodology to Examine Learning and Teaching Scholarship in Networked Learning

ERIC Educational Resources Information Center

Howard, Lyz

2016-01-01

As an experienced face-to-face teacher, working in a small Crown Dependency with no Higher Education Institute (HEI) to call its own, the subsequent geographical and professional isolation in the context of Networked Learning (NL), as a sub-set of eLearning, calls for innovative ways in which to develop self-reliant methods of professional…

Call Admission Control on Single Node Networks under Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) Scheduler

NASA Astrophysics Data System (ADS)

Hanada, Masaki; Nakazato, Hidenori; Watanabe, Hitoshi

Multimedia applications such as music or video streaming, video teleconferencing and IP telephony are flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve this problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) was proposed in [17]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we propose a call admission control (CAC) algorithm for ORC-GPS, for leaky-bucket constrained sessions with deterministic delay requirements. This CAC algorithm for ORC-GPS determines the optimal values of parameters of ORC-GPS from the deterministic delay requirements of the sessions. In numerical experiments, we compare the CAC algorithm for ORC-GPS with one for GPS in terms of schedulable region and computational complexity.

Sigma Routing Metric for RPL Protocol.

PubMed

Sanmartin, Paul; Rojas, Aldo; Fernandez, Luis; Avila, Karen; Jabba, Daladier; Valle, Sebastian

2018-04-21

This paper presents the adaptation of a specific metric for the RPL protocol in the objective function MRHOF. Among the functions standardized by IETF, we find OF0, which is based on the minimum hop count, as well as MRHOF, which is based on the Expected Transmission Count (ETX). However, when the network becomes denser or the number of nodes increases, both OF0 and MRHOF introduce long hops, which can generate a bottleneck that restricts the network. The adaptation is proposed to optimize both OFs through a new routing metric. To solve the above problem, the metrics of the minimum number of hops and the ETX are combined by designing a new routing metric called SIGMA-ETX, in which the best route is calculated using the standard deviation of ETX values between each node, as opposed to working with the ETX average along the route. This method ensures a better routing performance in dense sensor networks. The simulations are done through the Cooja simulator, based on the Contiki operating system. The simulations showed that the proposed optimization outperforms at a high margin in both OF0 and MRHOF, in terms of network latency, packet delivery ratio, lifetime, and power consumption.

Protein function prediction using neighbor relativity in protein-protein interaction network.

PubMed

Moosavi, Sobhan; Rahgozar, Masoud; Rahimi, Amir

2013-04-01

There is a large gap between the number of discovered proteins and the number of functionally annotated ones. Due to the high cost of determining protein function by wet-lab research, function prediction has become a major task for computational biology and bioinformatics. Some researches utilize the proteins interaction information to predict function for un-annotated proteins. In this paper, we propose a novel approach called "Neighbor Relativity Coefficient" (NRC) based on interaction network topology which estimates the functional similarity between two proteins. NRC is calculated for each pair of proteins based on their graph-based features including distance, common neighbors and the number of paths between them. In order to ascribe function to an un-annotated protein, NRC estimates a weight for each neighbor to transfer its annotation to the unknown protein. Finally, the unknown protein will be annotated by the top score transferred functions. We also investigate the effect of using different coefficients for various types of functions. The proposed method has been evaluated on Saccharomyces cerevisiae and Homo sapiens interaction networks. The performance analysis demonstrates that NRC yields better results in comparison with previous protein function prediction approaches that utilize interaction network. Copyright © 2012 Elsevier Ltd. All rights reserved.

Sigma Routing Metric for RPL Protocol

PubMed Central

Rojas, Aldo; Fernandez, Luis

2018-01-01

This paper presents the adaptation of a specific metric for the RPL protocol in the objective function MRHOF. Among the functions standardized by IETF, we find OF0, which is based on the minimum hop count, as well as MRHOF, which is based on the Expected Transmission Count (ETX). However, when the network becomes denser or the number of nodes increases, both OF0 and MRHOF introduce long hops, which can generate a bottleneck that restricts the network. The adaptation is proposed to optimize both OFs through a new routing metric. To solve the above problem, the metrics of the minimum number of hops and the ETX are combined by designing a new routing metric called SIGMA-ETX, in which the best route is calculated using the standard deviation of ETX values between each node, as opposed to working with the ETX average along the route. This method ensures a better routing performance in dense sensor networks. The simulations are done through the Cooja simulator, based on the Contiki operating system. The simulations showed that the proposed optimization outperforms at a high margin in both OF0 and MRHOF, in terms of network latency, packet delivery ratio, lifetime, and power consumption. PMID:29690524

Teaching about Genocide in a New Millennium

ERIC Educational Resources Information Center

Brown, James G.

2007-01-01

The "Darfur is Dying" website was the winning entry of a contest called Darfur Digital Activist, launched by MTV's 24-hour college network (mtvU). The site describes the winning game as "a narrative-based simulation where the user negotiates forces that threaten the survival of his or her refugee camp. It offers a faint glimpse of what it is like…

HIV vaccines in Canada: legal and ethical issues--an overview.

PubMed

Garmaise, David

2002-07-01

In July 2002 the Legal Network released an overview paper on legal and ethical issues related to an HIV vaccine in Canada. The paper, which is based on a more detailed report prepared in collaboration with the Centre for Bioethics of the Clinical Research Institute of Montréal, calls for the establishment of a Canadian HIV Vaccine Plan.

On the Embedded Complementarity of Agent-Based and Aggregate Reasoning in Students' Developing Understanding of Dynamic Systems

ERIC Educational Resources Information Center

Stroup, Walter M.; Wilensky, Uri

2014-01-01

Placed in the larger context of broadening the engagement with systems dynamics and complexity theory in school-aged learning and teaching, this paper is intended to introduce, situate, and illustrate--with results from the use of network supported participatory simulations in classrooms--a stance we call "embedded complementarity" as an…

Facing the IT Talent Squeeze in a Networked Economy

ERIC Educational Resources Information Center

Joyce, Peter J.

2008-01-01

Ten years ago, Cisco began working with schools on a pilot initiative called the Cisco Networking Academy. Today, the Networking Academy program operates in more than 160 countries, comprising a network of more than 7,600 schools that teach the information technology skills essential in a global economy. Cisco Networking Academy has partnered with…

Punctuated evolution and robustness in morphogenesis

PubMed Central

Grigoriev, D.; Reinitz, J.; Vakulenko, S.; Weber, A.

2014-01-01

This paper presents an analytic approach to the pattern stability and evolution problem in morphogenesis. The approach used here is based on the ideas from the gene and neural network theory. We assume that gene networks contain a number of small groups of genes (called hubs) controlling morphogenesis process. Hub genes represent an important element of gene network architecture and their existence is empirically confirmed. We show that hubs can stabilize morphogenetic pattern and accelerate the morphogenesis. The hub activity exhibits an abrupt change depending on the mutation frequency. When the mutation frequency is small, these hubs suppress all mutations and gene product concentrations do not change, thus, the pattern is stable. When the environmental pressure increases and the population needs new genotypes, the genetic drift and other effects increase the mutation frequency. For the frequencies that are larger than a critical amount the hubs turn off; and as a result, many mutations can affect phenotype. This effect can serve as an engine for evolution. We show that this engine is very effective: the evolution acceleration is an exponential function of gene redundancy. Finally, we show that the Eldredge-Gould concept of punctuated evolution results from the network architecture, which provides fast evolution, control of evolvability, and pattern robustness. To describe analytically the effect of exponential acceleration, we use mathematical methods developed recently for hard combinatorial problems, in particular, for so-called k-SAT problem, and numerical simulations. PMID:24996115

High performance interconnection between high data rate networks

NASA Technical Reports Server (NTRS)

Foudriat, E. C.; Maly, K.; Overstreet, C. M.; Zhang, L.; Sun, W.

1992-01-01

The bridge/gateway system needed to interconnect a wide range of computer networks to support a wide range of user quality-of-service requirements is discussed. The bridge/gateway must handle a wide range of message types including synchronous and asynchronous traffic, large, bursty messages, short, self-contained messages, time critical messages, etc. It is shown that messages can be classified into three basic classes, synchronous and large and small asynchronous messages. The first two require call setup so that packet identification, buffer handling, etc. can be supported in the bridge/gateway. Identification enables resequences in packet size. The third class is for messages which do not require call setup. Resequencing hardware based to handle two types of resequencing problems is presented. The first is for a virtual parallel circuit which can scramble channel bytes. The second system is effective in handling both synchronous and asynchronous traffic between networks with highly differing packet sizes and data rates. The two other major needs for the bridge/gateway are congestion and error control. A dynamic, lossless congestion control scheme which can easily support effective error correction is presented. Results indicate that the congestion control scheme provides close to optimal capacity under congested conditions. Under conditions where error may develop due to intervening networks which are not lossless, intermediate error recovery and correction takes 1/3 less time than equivalent end-to-end error correction under similar conditions.

A design for living technology: experiments with the mind time machine.

PubMed

Ikegami, Takashi

2013-01-01

Living technology aims to help people expand their experiences in everyday life. The environment offers people ways to interact with it, which we call affordances. Living technology is a design for new affordances. When we experience something new, we remember it by the way we perceive and interact with it. Recent studies in neuroscience have led to the idea of a default mode network, which is a baseline activity of a brain system. The autonomy of artificial life must be understood as a sort of default mode that self-organizes its baseline activity, preparing for its external inputs and its interaction with humans. I thus propose a method for creating a suitable default mode as a design principle for living technology. I built a machine called the mind time machine (MTM), which runs continuously for 10 h per day and receives visual data from its environment using 15 video cameras. The MTM receives and edits the video inputs while it self-organizes the momentary now. Its base program is a neural network that includes chaotic dynamics inside the system and a meta-network that consists of video feedback systems. Using this system as the hardware and a default mode network as a conceptual framework, I describe the system's autonomous behavior. Using the MTM as a testing ground, I propose a design principle for living technology.

Markov Chain Model-Based Optimal Cluster Heads Selection for Wireless Sensor Networks

PubMed Central

Ahmed, Gulnaz; Zou, Jianhua; Zhao, Xi; Sadiq Fareed, Mian Muhammad

2017-01-01

The longer network lifetime of Wireless Sensor Networks (WSNs) is a goal which is directly related to energy consumption. This energy consumption issue becomes more challenging when the energy load is not properly distributed in the sensing area. The hierarchal clustering architecture is the best choice for these kind of issues. In this paper, we introduce a novel clustering protocol called Markov chain model-based optimal cluster heads (MOCHs) selection for WSNs. In our proposed model, we introduce a simple strategy for the optimal number of cluster heads selection to overcome the problem of uneven energy distribution in the network. The attractiveness of our model is that the BS controls the number of cluster heads while the cluster heads control the cluster members in each cluster in such a restricted manner that a uniform and even load is ensured in each cluster. We perform an extensive range of simulation using five quality measures, namely: the lifetime of the network, stable and unstable region in the lifetime of the network, throughput of the network, the number of cluster heads in the network, and the transmission time of the network to analyze the proposed model. We compare MOCHs against Sleep-awake Energy Efficient Distributed (SEED) clustering, Artificial Bee Colony (ABC), Zone Based Routing (ZBR), and Centralized Energy Efficient Clustering (CEEC) using the above-discussed quality metrics and found that the lifetime of the proposed model is almost 1095, 2630, 3599, and 2045 rounds (time steps) greater than SEED, ABC, ZBR, and CEEC, respectively. The obtained results demonstrate that the MOCHs is better than SEED, ABC, ZBR, and CEEC in terms of energy efficiency and the network throughput. PMID:28241492

Behavioral networks as a model for intelligent agents

NASA Technical Reports Server (NTRS)

Sliwa, Nancy E.

1990-01-01

On-going work at NASA Langley Research Center in the development and demonstration of a paradigm called behavioral networks as an architecture for intelligent agents is described. This work focuses on the need to identify a methodology for smoothly integrating the characteristics of low-level robotic behavior, including actuation and sensing, with intelligent activities such as planning, scheduling, and learning. This work assumes that all these needs can be met within a single methodology, and attempts to formalize this methodology in a connectionist architecture called behavioral networks. Behavioral networks are networks of task processes arranged in a task decomposition hierarchy. These processes are connected by both command/feedback data flow, and by the forward and reverse propagation of weights which measure the dynamic utility of actions and beliefs.

Detection of whale calls in noise: performance comparison between a beluga whale, human listeners, and a neural network.

PubMed

Erbe, C

2000-07-01

This article examines the masking by anthropogenic noise of beluga whale calls. Results from human masking experiments and a software backpropagation neural network are compared to the performance of a trained beluga whale. The goal was to find an accurate, reliable, and fast model to replace lengthy and expensive animal experiments. A beluga call was masked by three types of noise, an icebreaker's bubbler system and propeller noise, and ambient arctic ice-cracking noise. Both the human experiment and the neural network successfully modeled the beluga data in the sense that they classified the noises in the same order from strongest to weakest masking as the whale and with similar call-detection thresholds. The neural network slightly outperformed the humans. Both models were then used to predict the masking of a fourth type of noise, Gaussian white noise. Their prediction ability was judged by returning to the aquarium to measure masked-hearing thresholds of a beluga in white noise. Both models and the whale identified bubbler noise as the strongest masker, followed by ramming, then white noise. Natural ice-cracking noise masked the least. However, the humans and the neural network slightly overpredicted the amount of masking for white noise. This is neglecting individual variation in belugas, because only one animal could be trained. Comparing the human model to the neural network model, the latter has the advantage of objectivity, reproducibility of results, and efficiency, particularly if the interference of a large number of signals and noise is to be examined.

Airborne wireless communication systems, airborne communication methods, and communication methods

DOEpatents

Deaton, Juan D [Menan, ID; Schmitt, Michael J [Idaho Falls, ID; Jones, Warren F [Idaho Falls, ID

2011-12-13

An airborne wireless communication system includes circuitry configured to access information describing a configuration of a terrestrial wireless communication base station that has become disabled. The terrestrial base station is configured to implement wireless communication between wireless devices located within a geographical area and a network when the terrestrial base station is not disabled. The circuitry is further configured, based on the information, to configure the airborne station to have the configuration of the terrestrial base station. An airborne communication method includes answering a 911 call from a terrestrial cellular wireless phone using an airborne wireless communication system.

Network structure of multivariate time series.

PubMed

Lacasa, Lucas; Nicosia, Vincenzo; Latora, Vito

2015-10-21

Our understanding of a variety of phenomena in physics, biology and economics crucially depends on the analysis of multivariate time series. While a wide range tools and techniques for time series analysis already exist, the increasing availability of massive data structures calls for new approaches for multidimensional signal processing. We present here a non-parametric method to analyse multivariate time series, based on the mapping of a multidimensional time series into a multilayer network, which allows to extract information on a high dimensional dynamical system through the analysis of the structure of the associated multiplex network. The method is simple to implement, general, scalable, does not require ad hoc phase space partitioning, and is thus suitable for the analysis of large, heterogeneous and non-stationary time series. We show that simple structural descriptors of the associated multiplex networks allow to extract and quantify nontrivial properties of coupled chaotic maps, including the transition between different dynamical phases and the onset of various types of synchronization. As a concrete example we then study financial time series, showing that a multiplex network analysis can efficiently discriminate crises from periods of financial stability, where standard methods based on time-series symbolization often fail.

Use seismic colored inversion and power law committee machine based on imperial competitive algorithm for improving porosity prediction in a heterogeneous reservoir

NASA Astrophysics Data System (ADS)

Ansari, Hamid Reza

2014-09-01

In this paper we propose a new method for predicting rock porosity based on a combination of several artificial intelligence systems. The method focuses on one of the Iranian carbonate fields in the Persian Gulf. Because there is strong heterogeneity in carbonate formations, estimation of rock properties experiences more challenge than sandstone. For this purpose, seismic colored inversion (SCI) and a new approach of committee machine are used in order to improve porosity estimation. The study comprises three major steps. First, a series of sample-based attributes is calculated from 3D seismic volume. Acoustic impedance is an important attribute that is obtained by the SCI method in this study. Second, porosity log is predicted from seismic attributes using common intelligent computation systems including: probabilistic neural network (PNN), radial basis function network (RBFN), multi-layer feed forward network (MLFN), ε-support vector regression (ε-SVR) and adaptive neuro-fuzzy inference system (ANFIS). Finally, a power law committee machine (PLCM) is constructed based on imperial competitive algorithm (ICA) to combine the results of all previous predictions in a single solution. This technique is called PLCM-ICA in this paper. The results show that PLCM-ICA model improved the results of neural networks, support vector machine and neuro-fuzzy system.

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

PubMed Central

Mohanasundaram, Ranganathan; Periasamy, Pappampalayam Sanmugam

2015-01-01

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

Identification of Human Disease Genes from Interactome Network Using Graphlet Interaction

PubMed Central

Yang, Lun; Wei, Dong-Qing; Qi, Ying-Xin; Jiang, Zong-Lai

2014-01-01

Identifying genes related to human diseases, such as cancer and cardiovascular disease, etc., is an important task in biomedical research because of its applications in disease diagnosis and treatment. Interactome networks, especially protein-protein interaction networks, had been used to disease genes identification based on the hypothesis that strong candidate genes tend to closely relate to each other in some kinds of measure on the network. We proposed a new measure to analyze the relationship between network nodes which was called graphlet interaction. The graphlet interaction contained 28 different isomers. The results showed that the numbers of the graphlet interaction isomers between disease genes in interactome networks were significantly larger than random picked genes, while graphlet signatures were not. Then, we designed a new type of score, based on the network properties, to identify disease genes using graphlet interaction. The genes with higher scores were more likely to be disease genes, and all candidate genes were ranked according to their scores. Then the approach was evaluated by leave-one-out cross-validation. The precision of the current approach achieved 90% at about 10% recall, which was apparently higher than the previous three predominant algorithms, random walk, Endeavour and neighborhood based method. Finally, the approach was applied to predict new disease genes related to 4 common diseases, most of which were identified by other independent experimental researches. In conclusion, we demonstrate that the graphlet interaction is an effective tool to analyze the network properties of disease genes, and the scores calculated by graphlet interaction is more precise in identifying disease genes. PMID:24465923

Enabling Comprehension of Patient Subgroups and Characteristics in Large Bipartite Networks: Implications for Precision Medicine

PubMed Central

Bhavnani, Suresh K.; Chen, Tianlong; Ayyaswamy, Archana; Visweswaran, Shyam; Bellala, Gowtham; Rohit, Divekar; Kevin E., Bassler

2017-01-01

A primary goal of precision medicine is to identify patient subgroups based on their characteristics (e.g., comorbidities or genes) with the goal of designing more targeted interventions. While network visualization methods such as Fruchterman-Reingold have been used to successfully identify such patient subgroups in small to medium sized data sets, they often fail to reveal comprehensible visual patterns in large and dense networks despite having significant clustering. We therefore developed an algorithm called ExplodeLayout, which exploits the existence of significant clusters in bipartite networks to automatically “explode” a traditional network layout with the goal of separating overlapping clusters, while at the same time preserving key network topological properties that are critical for the comprehension of patient subgroups. We demonstrate the utility of ExplodeLayout by visualizing a large dataset extracted from Medicare consisting of readmitted hip-fracture patients and their comorbidities, demonstrate its statistically significant improvement over a traditional layout algorithm, and discuss how the resulting network visualization enabled clinicians to infer mechanisms precipitating hospital readmission in specific patient subgroups. PMID:28815099

Smart Collision Avoidance and Hazard Routing Mechanism for Intelligent Transport Network

NASA Astrophysics Data System (ADS)

Singh, Gurpreet; Gupta, Pooja; Wahab, Mohd Helmy Abd

2017-08-01

The smart vehicular ad-hoc network is the network that consists of vehicles for smooth movement and better management of the vehicular connectivity across the given network. This research paper aims to propose a set of solution for the VANETs consisting of the automatic driven vehicles, also called as the autonomous car. Such vehicular networks are always prone to collision due to the natural or un-natural reasons which must be solved before the large-scale deployment of the autonomous transport systems. The newly designed intelligent transport movement control mechanism is based upon the intelligent data propagation along with the vehicle collision and traffic jam prevention schema [8], which may help the future designs of smart cities to become more robust and less error-prone. In the proposed model, the focus is on designing a new dynamic and robust hazard routing protocol for intelligent vehicular networks for improvement of the overall performance in various aspects. It is expected to improve the overall transmission delay as well as the number of collisions or adversaries across the vehicular network zone.

Structural stability of interaction networks against negative external fields

NASA Astrophysics Data System (ADS)

Yoon, S.; Goltsev, A. V.; Mendes, J. F. F.

2018-04-01

We explore structural stability of weighted and unweighted networks of positively interacting agents against a negative external field. We study how the agents support the activity of each other to confront the negative field, which suppresses the activity of agents and can lead to collapse of the whole network. The competition between the interactions and the field shape the structure of stable states of the system. In unweighted networks (uniform interactions) the stable states have the structure of k -cores of the interaction network. The interplay between the topology and the distribution of weights (heterogeneous interactions) impacts strongly the structural stability against a negative field, especially in the case of fat-tailed distributions of weights. We show that apart from critical slowing down there is also a critical change in the system structure that precedes the network collapse. The change can serve as an early warning of the critical transition. To characterize changes of network structure we develop a method based on statistical analysis of the k -core organization and so-called "corona" clusters belonging to the k -cores.

Convergent evolution of modularity in metabolic networks through different community structures.

PubMed

Zhou, Wanding; Nakhleh, Luay

2012-09-14

It has been reported that the modularity of metabolic networks of bacteria is closely related to the variability of their living habitats. However, given the dependency of the modularity score on the community structure, it remains unknown whether organisms achieve certain modularity via similar or different community structures. In this work, we studied the relationship between similarities in modularity scores and similarities in community structures of the metabolic networks of 1021 species. Both similarities are then compared against the genetic distances. We revisited the association between modularity and variability of the microbial living environments and extended the analysis to other aspects of their life style such as temperature and oxygen requirements. We also tested both topological and biological intuition of the community structures identified and investigated the extent of their conservation with respect to the taxonomy. We find that similar modularities are realized by different community structures. We find that such convergent evolution of modularity is closely associated with the number of (distinct) enzymes in the organism's metabolome, a consequence of different life styles of the species. We find that the order of modularity is the same as the order of the number of the enzymes under the classification based on the temperature preference but not on the oxygen requirement. Besides, inspection of modularity-based communities reveals that these communities are graph-theoretically meaningful yet not reflective of specific biological functions. From an evolutionary perspective, we find that the community structures are conserved only at the level of kingdoms. Our results call for more investigation into the interplay between evolution and modularity: how evolution shapes modularity, and how modularity affects evolution (mainly in terms of fitness and evolvability). Further, our results call for exploring new measures of modularity and network communities that better correspond to functional categorizations.

An Open, Snow-based Hydrologic System on Noachian Mars

NASA Technical Reports Server (NTRS)

Zent, A. P.

1999-01-01

Properties of Noachian valley networks on Mars suggest that the conditions under which they formed were marginal for liquid water formation. The networks are sparsely scattered, poorly dissected, and tend to be small; a majority occupy areas only a few hundred kilometers in extent. Models in which networks formed by mass wasting are contra-indicated by the discovery of channels within the valleys. Greenhouse hypotheses for the stability of liquid water have foundered on familiar problems: first, a very substantial CO2 atmosphere would be required to bring global average conditions to 273 K; the CO2 should still be present in extensive carbonate deposits that have not been detected. Explanations that call upon groundwater sapping are hampered by the need for a hydrologic system to recharge the groundwater system, which effectively reinstates the need for a heavy CO2 atmosphere. Based upon field experience and geomorphic similarities between drainage developed in the periglacial terrain in and around the Haughton impact structure, Devon Island, Nuunavuut, Canada, we have suggested that some of the channel networks may have formed either subglacially, or as ice marginal structures.

Overlapping community detection based on link graph using distance dynamics

NASA Astrophysics Data System (ADS)

Chen, Lei; Zhang, Jing; Cai, Li-Jun

2018-01-01

The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.

The impact of countermeasure propagation on the prevalence of computer viruses.

PubMed

Chen, Li-Chiou; Carley, Kathleen M

2004-04-01

Countermeasures such as software patches or warnings can be effective in helping organizations avert virus infection problems. However, current strategies for disseminating such countermeasures have limited their effectiveness. We propose a new approach, called the Countermeasure Competing (CMC) strategy, and use computer simulation to formally compare its relative effectiveness with three antivirus strategies currently under consideration. CMC is based on the idea that computer viruses and countermeasures spread through two separate but interlinked complex networks-the virus-spreading network and the countermeasure-propagation network, in which a countermeasure acts as a competing species against the computer virus. Our results show that CMC is more effective than other strategies based on the empirical virus data. The proposed CMC reduces the size of virus infection significantly when the countermeasure-propagation network has properties that favor countermeasures over viruses, or when the countermeasure-propagation rate is higher than the virus-spreading rate. In addition, our work reveals that CMC can be flexibly adapted to different uncertainties in the real world, enabling it to be tuned to a greater variety of situations than other strategies.

White blood cells identification system based on convolutional deep neural learning networks.

PubMed

Shahin, A I; Guo, Yanhui; Amin, K M; Sharawi, Amr A

2017-11-16

White blood cells (WBCs) differential counting yields valued information about human health and disease. The current developed automated cell morphology equipments perform differential count which is based on blood smear image analysis. Previous identification systems for WBCs consist of successive dependent stages; pre-processing, segmentation, feature extraction, feature selection, and classification. There is a real need to employ deep learning methodologies so that the performance of previous WBCs identification systems can be increased. Classifying small limited datasets through deep learning systems is a major challenge and should be investigated. In this paper, we propose a novel identification system for WBCs based on deep convolutional neural networks. Two methodologies based on transfer learning are followed: transfer learning based on deep activation features and fine-tuning of existed deep networks. Deep acrivation featues are extracted from several pre-trained networks and employed in a traditional identification system. Moreover, a novel end-to-end convolutional deep architecture called "WBCsNet" is proposed and built from scratch. Finally, a limited balanced WBCs dataset classification is performed through the WBCsNet as a pre-trained network. During our experiments, three different public WBCs datasets (2551 images) have been used which contain 5 healthy WBCs types. The overall system accuracy achieved by the proposed WBCsNet is (96.1%) which is more than different transfer learning approaches or even the previous traditional identification system. We also present features visualization for the WBCsNet activation which reflects higher response than the pre-trained activated one. a novel WBCs identification system based on deep learning theory is proposed and a high performance WBCsNet can be employed as a pre-trained network. Copyright © 2017. Published by Elsevier B.V.

Modeling and performance analysis using extended fuzzy-timing Petri nets for networked virtual environments.

PubMed

Zhou, Y; Murata, T; Defanti, T A

2000-01-01

Despite their attractive properties, networked virtual environments (net-VEs) are notoriously difficult to design, implement, and test due to the concurrency, real-time and networking features in these systems. Net-VEs demand high quality-of-service (QoS) requirements on the network to maintain natural and real-time interactions among users. The current practice for net-VE design is basically trial and error, empirical, and totally lacks formal methods. This paper proposes to apply a Petri net formal modeling technique to a net-VE-NICE (narrative immersive constructionist/collaborative environment), predict the net-VE performance based on simulation, and improve the net-VE performance. NICE is essentially a network of collaborative virtual reality systems called the CAVE-(CAVE automatic virtual environment). First, we introduce extended fuzzy-timing Petri net (EFTN) modeling and analysis techniques. Then, we present EFTN models of the CAVE, NICE, and transport layer protocol used in NICE: transmission control protocol (TCP). We show the possibility analysis based on the EFTN model for the CAVE. Then, by using these models and design/CPN as the simulation tool, we conducted various simulations to study real-time behavior, network effects and performance (latencies and jitters) of NICE. Our simulation results are consistent with experimental data.

New recursive-least-squares algorithms for nonlinear active control of sound and vibration using neural networks.

PubMed

Bouchard, M

2001-01-01

In recent years, a few articles describing the use of neural networks for nonlinear active control of sound and vibration were published. Using a control structure with two multilayer feedforward neural networks (one as a nonlinear controller and one as a nonlinear plant model), steepest descent algorithms based on two distinct gradient approaches were introduced for the training of the controller network. The two gradient approaches were sometimes called the filtered-x approach and the adjoint approach. Some recursive-least-squares algorithms were also introduced, using the adjoint approach. In this paper, an heuristic procedure is introduced for the development of recursive-least-squares algorithms based on the filtered-x and the adjoint gradient approaches. This leads to the development of new recursive-least-squares algorithms for the training of the controller neural network in the two networks structure. These new algorithms produce a better convergence performance than previously published algorithms. Differences in the performance of algorithms using the filtered-x and the adjoint gradient approaches are discussed in the paper. The computational load of the algorithms discussed in the paper is evaluated for multichannel systems of nonlinear active control. Simulation results are presented to compare the convergence performance of the algorithms, showing the convergence gain provided by the new algorithms.

Complete characterization of the stability of cluster synchronization in complex dynamical networks.

PubMed

Sorrentino, Francesco; Pecora, Louis M; Hagerstrom, Aaron M; Murphy, Thomas E; Roy, Rajarshi

2016-04-01

Synchronization is an important and prevalent phenomenon in natural and engineered systems. In many dynamical networks, the coupling is balanced or adjusted to admit global synchronization, a condition called Laplacian coupling. Many networks exhibit incomplete synchronization, where two or more clusters of synchronization persist, and computational group theory has recently proved to be valuable in discovering these cluster states based on the topology of the network. In the important case of Laplacian coupling, additional synchronization patterns can exist that would not be predicted from the group theory analysis alone. Understanding how and when clusters form, merge, and persist is essential for understanding collective dynamics, synchronization, and failure mechanisms of complex networks such as electric power grids, distributed control networks, and autonomous swarming vehicles. We describe a method to find and analyze all of the possible cluster synchronization patterns in a Laplacian-coupled network, by applying methods of computational group theory to dynamically equivalent networks. We present a general technique to evaluate the stability of each of the dynamically valid cluster synchronization patterns. Our results are validated in an optoelectronic experiment on a five-node network that confirms the synchronization patterns predicted by the theory.

An optimization method of VON mapping for energy efficiency and routing in elastic optical networks

NASA Astrophysics Data System (ADS)

Liu, Huanlin; Xiong, Cuilian; Chen, Yong; Li, Changping; Chen, Derun

2018-03-01

To improve resources utilization efficiency, network virtualization in elastic optical networks has been developed by sharing the same physical network for difference users and applications. In the process of virtual nodes mapping, longer paths between physical nodes will consume more spectrum resources and energy. To address the problem, we propose a virtual optical network mapping algorithm called genetic multi-objective optimize virtual optical network mapping algorithm (GM-OVONM-AL), which jointly optimizes the energy consumption and spectrum resources consumption in the process of virtual optical network mapping. Firstly, a vector function is proposed to balance the energy consumption and spectrum resources by optimizing population classification and crowding distance sorting. Then, an adaptive crossover operator based on hierarchical comparison is proposed to improve search ability and convergence speed. In addition, the principle of the survival of the fittest is introduced to select better individual according to the relationship of domination rank. Compared with the spectrum consecutiveness-opaque virtual optical network mapping-algorithm and baseline-opaque virtual optical network mapping algorithm, simulation results show the proposed GM-OVONM-AL can achieve the lowest bandwidth blocking probability and save the energy consumption.

Random Evolution of Idiotypic Networks: Dynamics and Architecture

NASA Astrophysics Data System (ADS)

Brede, Markus; Behn, Ulrich

The paper deals with modelling a subsystem of the immune system, the so-called idiotypic network (INW). INWs, conceived by N.K. Jerne in 1974, are functional networks of interacting antibodies and B cells. In principle, Jernes' framework provides solutions to many issues in immunology, such as immunological memory, mechanisms for antigen recognition and self/non-self discrimination. Explaining the interconnection between the elementary components, local dynamics, network formation and architecture, and possible modes of global system function appears to be an ideal playground of statistical mechanics. We present a simple cellular automaton model, based on a graph representation of the system. From a simplified description of idiotypic interactions, rules for the random evolution of networks of occupied and empty sites on these graphs are derived. In certain biologically relevant parameter ranges the resultant dynamics leads to stationary states. A stationary state is found to correspond to a specific pattern of network organization. It turns out that even these very simple rules give rise to a multitude of different kinds of patterns. We characterize these networks by classifying `static' and `dynamic' network-patterns. A type of `dynamic' network is found to display many features of real INWs.

Structural Health Monitoring of a Composite Panel Based on PZT Sensors and a Transfer Impedance Framework

PubMed Central

Dziendzikowski, Michal; Niedbala, Patryk; Kurnyta, Artur; Kowalczyk, Kamil; Dragan, Krzysztof

2018-01-01

One of the ideas for development of Structural Health Monitoring (SHM) systems is based on excitation of elastic waves by a network of PZT piezoelectric transducers integrated with the structure. In the paper, a variant of the so-called Transfer Impedance (TI) approach to SHM is followed. Signal characteristics, called the Damage Indices (DIs), were proposed for data presentation and analysis. The idea underlying the definition of DIs was to maintain most of the information carried by the voltage induced on PZT sensors by elastic waves. In particular, the DIs proposed in the paper should be sensitive to all types of damage which can influence the amplitude or the phase of the voltage induced on the sensor. Properties of the proposed DIs were investigated experimentally using a GFRP composite panel equipped with PZT networks attached to its surface and embedded into its internal structure. Repeatability and stability of DI indications under controlled conditions were verified in tests. Also, some performance indicators for surface-attached and structure-embedded sensors were obtained. The DIs’ behavior was dependent mostly on the presence of a simulated damage in the structure. Anisotropy of mechanical properties of the specimen, geometrical properties of PZT network as well as, to some extent, the technology of sensor integration with the structure were irrelevant for damage indication. This property enables the method to be used for damage detection and classification. PMID:29751664

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

PubMed

Francis, Andrew; Moulton, Vincent

2018-06-07

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

Adaptive Suspicious Prevention for Defending DoS Attacks in SDN-Based Convergent Networks

PubMed Central

Dao, Nhu-Ngoc; Kim, Joongheon; Park, Minho; Cho, Sungrae

2016-01-01

The convergent communication network will play an important role as a single platform to unify heterogeneous networks and integrate emerging technologies and existing legacy networks. Although there have been proposed many feasible solutions, they could not become convergent frameworks since they mainly focused on converting functions between various protocols and interfaces in edge networks, and handling functions for multiple services in core networks, e.g., the Multi-protocol Label Switching (MPLS) technique. Software-defined networking (SDN), on the other hand, is expected to be the ideal future for the convergent network since it can provide a controllable, dynamic, and cost-effective network. However, SDN has an original structural vulnerability behind a lot of advantages, which is the centralized control plane. As the brains of the network, a controller manages the whole network, which is attractive to attackers. In this context, we proposes a novel solution called adaptive suspicious prevention (ASP) mechanism to protect the controller from the Denial of Service (DoS) attacks that could incapacitate an SDN. The ASP is integrated with OpenFlow protocol to detect and prevent DoS attacks effectively. Our comprehensive experimental results show that the ASP enhances the resilience of an SDN network against DoS attacks by up to 38%. PMID:27494411

Adaptive Suspicious Prevention for Defending DoS Attacks in SDN-Based Convergent Networks.

PubMed

Dao, Nhu-Ngoc; Kim, Joongheon; Park, Minho; Cho, Sungrae

2016-01-01

The convergent communication network will play an important role as a single platform to unify heterogeneous networks and integrate emerging technologies and existing legacy networks. Although there have been proposed many feasible solutions, they could not become convergent frameworks since they mainly focused on converting functions between various protocols and interfaces in edge networks, and handling functions for multiple services in core networks, e.g., the Multi-protocol Label Switching (MPLS) technique. Software-defined networking (SDN), on the other hand, is expected to be the ideal future for the convergent network since it can provide a controllable, dynamic, and cost-effective network. However, SDN has an original structural vulnerability behind a lot of advantages, which is the centralized control plane. As the brains of the network, a controller manages the whole network, which is attractive to attackers. In this context, we proposes a novel solution called adaptive suspicious prevention (ASP) mechanism to protect the controller from the Denial of Service (DoS) attacks that could incapacitate an SDN. The ASP is integrated with OpenFlow protocol to detect and prevent DoS attacks effectively. Our comprehensive experimental results show that the ASP enhances the resilience of an SDN network against DoS attacks by up to 38%.

Monitor Network Traffic with Packet Capture (pcap) on an Android Device

DTIC Science & Technology

2015-09-01

administrative privileges . Under the current design Android development requirement, an Android Graphical User Interface (GUI) application cannot directly...build an Android application to monitor network traffic using open source packet capture (pcap) libraries. 15. SUBJECT TERMS ELIDe, Android , pcap 16...Building Application with Native Codes 5 8.1 Calling Native Codes Using JNI 5 8.2 Calling Native Codes from an Android Application 8 9. Retrieve Live

Modeling the heterogeneous traffic correlations in urban road systems using traffic-enhanced community detection approach

NASA Astrophysics Data System (ADS)

Lu, Feng; Liu, Kang; Duan, Yingying; Cheng, Shifen; Du, Fei

2018-07-01

A better characterization of the traffic influence among urban roads is crucial for traffic control and traffic forecasting. The existence of spatial heterogeneity imposes great influence on modeling the extent and degree of road traffic correlation, which is usually neglected by the traditional distance based method. In this paper, we propose a traffic-enhanced community detection approach to spatially reveal the traffic correlation in city road networks. First, the road network is modeled as a traffic-enhanced dual graph with the closeness between two road segments determined not only by their topological connection, but also by the traffic correlation between them. Then a flow-based community detection algorithm called Infomap is utilized to identify the road segment clusters. Evaluated by Moran's I, Calinski-Harabaz Index and the traffic interpolation application, we find that compared to the distance based method and the community based method, our proposed traffic-enhanced community based method behaves better in capturing the extent of traffic relevance as both the topological structure of the road network and the traffic correlations among urban roads are considered. It can be used in more traffic-related applications, such as traffic forecasting, traffic control and guidance.

Analysis of a large-scale weighted network of one-to-one human communication

NASA Astrophysics Data System (ADS)

Onnela, Jukka-Pekka; Saramäki, Jari; Hyvönen, Jörkki; Szabó, Gábor; Argollo de Menezes, M.; Kaski, Kimmo; Barabási, Albert-László; Kertész, János

2007-06-01

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

"Master-Slave" Biological Network Alignment

NASA Astrophysics Data System (ADS)

Ferraro, Nicola; Palopoli, Luigi; Panni, Simona; Rombo, Simona E.

Performing global alignment between protein-protein interaction (PPI) networks of different organisms is important to infer knowledge about conservation across species. Known methods that perform this task operate symmetrically, that is to say, they do not assign a distinct role to the input PPI networks. However, in most cases, the input networks are indeed distinguishable on the basis of how well the corresponding organism is biologically well-characterized. For well-characterized organisms the associated PPI network supposedly encode in a sound manner all the information about their proteins and associated interactions, which is far from being the case for not well characterized ones. Here the new idea is developed to devise a method for global alignment of PPI networks that in fact exploit differences in the characterization of organisms at hand. We assume that the PPI network (called Master) of the best characterized is used as a fingerprint to guide the alignment process to the second input network (called Slave), so that generated results preferably retain the structural characteristics of the Master (and using the Slave) network. We tested our method showing that the results it returns are biologically relevant.

An incentive-based distributed mechanism for scheduling divisible loads in tree networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carroll, T. E.; Grosu, D.

The underlying assumption of Divisible Load Scheduling (DLS) theory is that the pro-cessors composing the network are obedient, i.e., they do not “cheat” the scheduling algorithm. This assumption is unrealistic if the processors are owned by autonomous, self-interested organizations that have no a priori motivation for cooperation and they will manipulate the algorithm if it is beneficial to do so. In this paper, we address this issue by designing a distributed mechanism for scheduling divisible loads in tree net-works, called DLS-T, which provides incentives to processors for reporting their true processing capacity and executing their assigned load at full processingmore » capacity. We prove that the DLS-T mechanism computes the optimal allocation in an ex post Nash equilibrium. Finally, we simulate and study the mechanism under various network structures and processor parameters.« less

Learning and retrieval behavior in recurrent neural networks with pre-synaptic dependent homeostatic plasticity

NASA Astrophysics Data System (ADS)

Mizusaki, Beatriz E. P.; Agnes, Everton J.; Erichsen, Rubem; Brunnet, Leonardo G.

2017-08-01

The plastic character of brain synapses is considered to be one of the foundations for the formation of memories. There are numerous kinds of such phenomenon currently described in the literature, but their role in the development of information pathways in neural networks with recurrent architectures is still not completely clear. In this paper we study the role of an activity-based process, called pre-synaptic dependent homeostatic scaling, in the organization of networks that yield precise-timed spiking patterns. It encodes spatio-temporal information in the synaptic weights as it associates a learned input with a specific response. We introduce a correlation measure to evaluate the precision of the spiking patterns and explore the effects of different inhibitory interactions and learning parameters. We find that large learning periods are important in order to improve the network learning capacity and discuss this ability in the presence of distinct inhibitory currents.

A simplified computational memory model from information processing

PubMed Central

Zhang, Lanhua; Zhang, Dongsheng; Deng, Yuqin; Ding, Xiaoqian; Wang, Yan; Tang, Yiyuan; Sun, Baoliang

2016-01-01

This paper is intended to propose a computational model for memory from the view of information processing. The model, called simplified memory information retrieval network (SMIRN), is a bi-modular hierarchical functional memory network by abstracting memory function and simulating memory information processing. At first meta-memory is defined to express the neuron or brain cortices based on the biology and graph theories, and we develop an intra-modular network with the modeling algorithm by mapping the node and edge, and then the bi-modular network is delineated with intra-modular and inter-modular. At last a polynomial retrieval algorithm is introduced. In this paper we simulate the memory phenomena and functions of memorization and strengthening by information processing algorithms. The theoretical analysis and the simulation results show that the model is in accordance with the memory phenomena from information processing view. PMID:27876847

A Study of the Effects of Fieldbus Network Induced Delays on Control Systems

ERIC Educational Resources Information Center

Mainoo, Joseph

2012-01-01

Fieldbus networks are all-digital, two-way, multi-drop communication systems that are used to connect field devices such as sensors and actuators, and controllers. These fieldbus network systems are also called networked control systems (NCS). Although, there are different varieties of fieldbus networks such as Foundation Field Bus, DeviceNet, and…

Vocalization frequency and duration are coded in separate hindbrain nuclei.

PubMed

Chagnaud, Boris P; Baker, Robert; Bass, Andrew H

2011-06-14

Temporal patterning is an essential feature of neural networks producing precisely timed behaviours such as vocalizations that are widely used in vertebrate social communication. Here we show that intrinsic and network properties of separate hindbrain neuronal populations encode the natural call attributes of frequency and duration in vocal fish. Intracellular structure/function analyses indicate that call duration is encoded by a sustained membrane depolarization in vocal prepacemaker neurons that innervate downstream pacemaker neurons. Pacemaker neurons, in turn, encode call frequency by rhythmic, ultrafast oscillations in their membrane potential. Pharmacological manipulations show prepacemaker activity to be independent of pacemaker function, thus accounting for natural variation in duration which is the predominant feature distinguishing call types. Prepacemaker neurons also innervate key hindbrain auditory nuclei thereby effectively serving as a call-duration corollary discharge. We propose that premotor compartmentalization of neurons coding distinct acoustic attributes is a fundamental trait of hindbrain vocal pattern generators among vertebrates.

Vocalization frequency and duration are coded in separate hindbrain nuclei

PubMed Central

Chagnaud, Boris P.; Baker, Robert; Bass, Andrew H.

2011-01-01

Temporal patterning is an essential feature of neural networks producing precisely timed behaviours such as vocalizations that are widely used in vertebrate social communication. Here we show that intrinsic and network properties of separate hindbrain neuronal populations encode the natural call attributes of frequency and duration in vocal fish. Intracellular structure/function analyses indicate that call duration is encoded by a sustained membrane depolarization in vocal prepacemaker neurons that innervate downstream pacemaker neurons. Pacemaker neurons, in turn, encode call frequency by rhythmic, ultrafast oscillations in their membrane potential. Pharmacological manipulations show prepacemaker activity to be independent of pacemaker function, thus accounting for natural variation in duration which is the predominant feature distinguishing call types. Prepacemaker neurons also innervate key hindbrain auditory nuclei thereby effectively serving as a call-duration corollary discharge. We propose that premotor compartmentalization of neurons coding distinct acoustic attributes is a fundamental trait of hindbrain vocal pattern generators among vertebrates. PMID:21673667

HydroDesktop: An Open Source GIS-Based Platform for Hydrologic Data Discovery, Visualization, and Analysis

NASA Astrophysics Data System (ADS)

Ames, D. P.; Kadlec, J.; Cao, Y.; Grover, D.; Horsburgh, J. S.; Whiteaker, T.; Goodall, J. L.; Valentine, D. W.

2010-12-01

A growing number of hydrologic information servers are being deployed by government agencies, university networks, and individual researchers using the Consortium of Universities for the Advancement of Hydrologic Science, Inc. (CUAHSI) Hydrologic Information System (HIS). The CUAHSI HIS Project has developed a standard software stack, called HydroServer, for publishing hydrologic observations data. It includes the Observations Data Model (ODM) database and Water Data Service web services, which together enable publication of data on the Internet in a standard format called Water Markup Language (WaterML). Metadata describing available datasets hosted on these servers is compiled within a central metadata catalog called HIS Central at the San Diego Supercomputer Center and is searchable through a set of predefined web services based queries. Together, these servers and central catalog service comprise a federated HIS of a scale and comprehensiveness never previously available. This presentation will briefly review/introduce the CUAHSI HIS system with special focus on a new HIS software tool called "HydroDesktop" and the open source software development web portal, www.HydroDesktop.org, which supports community development and maintenance of the software. HydroDesktop is a client-side, desktop software application that acts as a search and discovery tool for exploring the distributed network of HydroServers, downloading specific data series, visualizing and summarizing data series and exporting these to formats needed for analysis by external software. HydroDesktop is based on the open source DotSpatial GIS developer toolkit which provides it with map-based data interaction and visualization, and a plug-in interface that can be used by third party developers and researchers to easily extend the software using Microsoft .NET programming languages. HydroDesktop plug-ins that are presently available or currently under development within the project and by third party collaborators include functions for data search and discovery, extensive graphing, data editing and export, HydroServer exploration, integration with the OpenMI workflow and modeling system, and an interface for data analysis through the R statistical package.

FireFly: reconfigurable optical wireless networking data centers

NASA Astrophysics Data System (ADS)

Kavehrad, Mohsen; Deng, Peng; Gupta, H.; Longtin, J.; Das, S. R.; Sekar, V.

2017-01-01

We explore a novel, free-space optics based approach for building data center interconnects. Data centers (DCs) are a critical piece of today's networked applications in both private and public sectors. The key factors that have driven this trend are economies of scale, reduced management costs, better utilization of hardware via statistical multiplexing, and the ability to elastically scale applications in response to changing workload patterns. A robust DC network fabric is fundamental to the success of DCs and to ensure that the network does not become a bottleneck for high-performance applications. In this context, DC network design must satisfy several goals: high performance (e.g., high throughput and low latency), low equipment and management cost, robustness to dynamic traffic patterns, incremental expandability to add new servers or racks, and other practical concerns such as cabling complexity, and power and cooling costs. Current DC network architectures do not seem to provide a satisfactory solution, with respect to the above requirements. In particular, traditional static (wired) networks are either overprovisioned or oversubscribed. Recent works have tried to overcome the above limitations by augmenting a static (wired) "core" with some flexible links (RF-wireless or optical). These augmented architectures show promise, but offer only incremental improvement in performance. Specifically, RFwireless based augmented solutions also offer only limited performance improvement, due to inherent interference and range constraints of RF links. This paper explores an alternative design point—a fully flexible and all-wireless DC interrack network based on free-space optical (FSO) links. We call this FireFly as in; Free-space optical Inter-Rack nEtwork with high FLexibilitY. We will present our designs and tests using various configurations that can help the performance and reliability of the FSO links.

Optical network unit placement in Fiber-Wireless (FiWi) access network by Moth-Flame optimization algorithm

NASA Astrophysics Data System (ADS)

Singh, Puja; Prakash, Shashi

2017-07-01

Hybrid wireless-optical broadband access network (WOBAN) or Fiber-Wireless (FiWi) is the integration of wireless access network and optical network. This hybrid multi-domain network adopts the advantages of wireless and optical domains and serves the demand of technology savvy users. FiWi exhibits the properties of cost effectiveness, robustness, flexibility, high capacity, reliability and is self organized. Optical Network Unit (ONU) placement problem in FiWi contributes in simplifying the network design and enhances the performance in terms of cost efficiency and increased throughput. Several individual-based algorithms, such as Simulated Annealing (SA), Tabu Search, etc. have been suggested for ONU placement, but these algorithms suffer from premature convergence (trapping in a local optima). The present research work undertakes the deployment of FiWi and proposes a novel nature-inspired heuristic paradigm called Moth-Flame optimization (MFO) algorithm for multiple optical network units' placement. MFO is a population based algorithm. Population-based algorithms are better in handling local optima avoidance. The simulation results are compared with the existing Greedy and Simulated Annealing algorithms to optimize the position of ONUs. To the best of our knowledge, MFO algorithm has been used for the first time in this domain, moreover it has been able to provide very promising and competitive results. The performance of MFO algorithm has been analyzed by varying the 'b' parameter. MFO algorithm results in faster convergence than the existing strategies of Greedy and SA and returns a lower value of overall cost function. The results exhibit the dependence of the objective function on the distribution of wireless users also.

A Privacy-Protecting Authentication Scheme for Roaming Services with Smart Cards

NASA Astrophysics Data System (ADS)

Son, Kyungho; Han, Dong-Guk; Won, Dongho

In this work we propose a novel smart card based privacy-protecting authentication scheme for roaming services. Our proposal achieves so-called Class 2 privacy protection, i.e., no information identifying a roaming user and also linking the user's behaviors is not revealed in a visited network. It can be used to overcome the inherent structural flaws of smart card based anonymous authentication schemes issued recently. As shown in our analysis, our scheme is computationally efficient for a mobile user.

Rapid weather information dissemination in Florida

NASA Technical Reports Server (NTRS)

Martsolf, J. D.; Heinemann, P. H.; Gerber, J. F.; Crosby, F. L.; Smith, D. L.

1984-01-01

The development of the Florida Agricultural Services and Technology (FAST) plan to provide ports for users to call for weather information is described. FAST is based on the Satellite Frost Forecast System, which makes a broad base of weather data available to its users. The methods used for acquisition and dissemination of data from various networks under the FAST plan are examined. The system provides color coded IR or thermal maps, precipitation maps, and textural forecast information. A diagram of the system is provided.

Recommendation Techniques for Drug-Target Interaction Prediction and Drug Repositioning.

PubMed

Alaimo, Salvatore; Giugno, Rosalba; Pulvirenti, Alfredo

2016-01-01

The usage of computational methods in drug discovery is a common practice. More recently, by exploiting the wealth of biological knowledge bases, a novel approach called drug repositioning has raised. Several computational methods are available, and these try to make a high-level integration of all the knowledge in order to discover unknown mechanisms. In this chapter, we review drug-target interaction prediction methods based on a recommendation system. We also give some extensions which go beyond the bipartite network case.

Subsurface event detection and classification using Wireless Signal Networks.

PubMed

Yoon, Suk-Un; Ghazanfari, Ehsan; Cheng, Liang; Pamukcu, Sibel; Suleiman, Muhannad T

2012-11-05

Subsurface environment sensing and monitoring applications such as detection of water intrusion or a landslide, which could significantly change the physical properties of the host soil, can be accomplished using a novel concept, Wireless Signal Networks (WSiNs). The wireless signal networks take advantage of the variations of radio signal strength on the distributed underground sensor nodes of WSiNs to monitor and characterize the sensed area. To characterize subsurface environments for event detection and classification, this paper provides a detailed list and experimental data of soil properties on how radio propagation is affected by soil properties in subsurface communication environments. Experiments demonstrated that calibrated wireless signal strength variations can be used as indicators to sense changes in the subsurface environment. The concept of WSiNs for the subsurface event detection is evaluated with applications such as detection of water intrusion, relative density change, and relative motion using actual underground sensor nodes. To classify geo-events using the measured signal strength as a main indicator of geo-events, we propose a window-based minimum distance classifier based on Bayesian decision theory. The window-based classifier for wireless signal networks has two steps: event detection and event classification. With the event detection, the window-based classifier classifies geo-events on the event occurring regions that are called a classification window. The proposed window-based classification method is evaluated with a water leakage experiment in which the data has been measured in laboratory experiments. In these experiments, the proposed detection and classification method based on wireless signal network can detect and classify subsurface events.

Subsurface Event Detection and Classification Using Wireless Signal Networks

PubMed Central

Yoon, Suk-Un; Ghazanfari, Ehsan; Cheng, Liang; Pamukcu, Sibel; Suleiman, Muhannad T.

2012-01-01

Subsurface environment sensing and monitoring applications such as detection of water intrusion or a landslide, which could significantly change the physical properties of the host soil, can be accomplished using a novel concept, Wireless Signal Networks (WSiNs). The wireless signal networks take advantage of the variations of radio signal strength on the distributed underground sensor nodes of WSiNs to monitor and characterize the sensed area. To characterize subsurface environments for event detection and classification, this paper provides a detailed list and experimental data of soil properties on how radio propagation is affected by soil properties in subsurface communication environments. Experiments demonstrated that calibrated wireless signal strength variations can be used as indicators to sense changes in the subsurface environment. The concept of WSiNs for the subsurface event detection is evaluated with applications such as detection of water intrusion, relative density change, and relative motion using actual underground sensor nodes. To classify geo-events using the measured signal strength as a main indicator of geo-events, we propose a window-based minimum distance classifier based on Bayesian decision theory. The window-based classifier for wireless signal networks has two steps: event detection and event classification. With the event detection, the window-based classifier classifies geo-events on the event occurring regions that are called a classification window. The proposed window-based classification method is evaluated with a water leakage experiment in which the data has been measured in laboratory experiments. In these experiments, the proposed detection and classification method based on wireless signal network can detect and classify subsurface events. PMID:23202191

A mathematical method for verifying the validity of measured information about the flows of energy resources based on the state estimation theory

NASA Astrophysics Data System (ADS)

Pazderin, A. V.; Sof'in, V. V.; Samoylenko, V. O.

2015-11-01

Efforts aimed at improving energy efficiency in all branches of the fuel and energy complex shall be commenced with setting up a high-tech automated system for monitoring and accounting energy resources. Malfunctions and failures in the measurement and information parts of this system may distort commercial measurements of energy resources and lead to financial risks for power supplying organizations. In addition, measurement errors may be connected with intentional distortion of measurements for reducing payment for using energy resources on the consumer's side, which leads to commercial loss of energy resource. The article presents a universal mathematical method for verifying the validity of measurement information in networks for transporting energy resources, such as electricity and heat, petroleum, gas, etc., based on the state estimation theory. The energy resource transportation network is represented by a graph the nodes of which correspond to producers and consumers, and its branches stand for transportation mains (power lines, pipelines, and heat network elements). The main idea of state estimation is connected with obtaining the calculated analogs of energy resources for all available measurements. Unlike "raw" measurements, which contain inaccuracies, the calculated flows of energy resources, called estimates, will fully satisfy the suitability condition for all state equations describing the energy resource transportation network. The state equations written in terms of calculated estimates will be already free from residuals. The difference between a measurement and its calculated analog (estimate) is called in the estimation theory an estimation remainder. The obtained large values of estimation remainders are an indicator of high errors of particular energy resource measurements. By using the presented method it is possible to improve the validity of energy resource measurements, to estimate the transportation network observability, to eliminate the energy resource flows measurement imbalances, and to filter invalid measurements at the data acquisition and processing stage in performing monitoring of an automated energy resource monitoring and accounting system.

Sensitive and specific peak detection for SELDI-TOF mass spectrometry using a wavelet/neural-network based approach.

PubMed

Emanuele, Vincent A; Panicker, Gitika; Gurbaxani, Brian M; Lin, Jin-Mann S; Unger, Elizabeth R

2012-01-01

SELDI-TOF mass spectrometer's compact size and automated, high throughput design have been attractive to clinical researchers, and the platform has seen steady-use in biomarker studies. Despite new algorithms and preprocessing pipelines that have been developed to address reproducibility issues, visual inspection of the results of SELDI spectra preprocessing by the best algorithms still shows miscalled peaks and systematic sources of error. This suggests that there continues to be problems with SELDI preprocessing. In this work, we study the preprocessing of SELDI in detail and introduce improvements. While many algorithms, including the vendor supplied software, can identify peak clusters of specific mass (or m/z) in groups of spectra with high specificity and low false discover rate (FDR), the algorithms tend to underperform estimating the exact prevalence and intensity of peaks in those clusters. Thus group differences that at first appear very strong are shown, after careful and laborious hand inspection of the spectra, to be less than significant. Here we introduce a wavelet/neural network based algorithm which mimics what a team of expert, human users would call for peaks in each of several hundred spectra in a typical SELDI clinical study. The wavelet denoising part of the algorithm optimally smoothes the signal in each spectrum according to an improved suite of signal processing algorithms previously reported (the LibSELDI toolbox under development). The neural network part of the algorithm combines those results with the raw signal and a training dataset of expertly called peaks, to call peaks in a test set of spectra with approximately 95% accuracy. The new method was applied to data collected from a study of cervical mucus for the early detection of cervical cancer in HPV infected women. The method shows promise in addressing the ongoing SELDI reproducibility issues.

Dynamics and thermodynamics of open chemical networks

NASA Astrophysics Data System (ADS)

Esposito, Massimiliano

Open chemical networks (OCN) are large sets of coupled chemical reactions where some of the species are chemostated (i.e. continuously restored from the environment). Cell metabolism is a notable example of OCN. Two results will be presented. First, dissipation in OCN operating in nonequilibrium steady-states strongly depends on the network topology (algebraic properties of the stoichiometric matrix). An application to oligosaccharides exchange dynamics performed by so-called D-enzymes will be provided. Second, at low concentration the dissipation of OCN is in general inaccurately predicted by deterministic dynamics (i.e. nonlinear rate equations for the species concentrations). In this case a description in terms of the chemical master equation is necessary. A notable exception is provided by so-called deficiency zero networks, i.e. chemical networks with no hidden cycles present in the graph of reactant complexes.

Evaluating the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ortiz-Rodriguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.

In this work the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks is evaluated. The first one code based on traditional iterative procedures and called Neutron spectrometry and dosimetry from the Universidad Autonoma de Zacatecas (NSDUAZ) use the SPUNIT iterative algorithm and was designed to unfold neutron spectrum and calculate 15 dosimetric quantities and 7 IAEA survey meters. The main feature of this code is the automated selection of the initial guess spectrum trough a compendium of neutron spectrum compiled by the IAEA. The second one code known as Neutron spectrometry and dosimetrymore » with artificial neural networks (NDSann) is a code designed using neural nets technology. The artificial intelligence approach of neural net does not solve mathematical equations. By using the knowledge stored at synaptic weights on a neural net properly trained, the code is capable to unfold neutron spectrum and to simultaneously calculate 15 dosimetric quantities, needing as entrance data, only the rate counts measured with a Bonner spheres system. Similarities of both NSDUAZ and NSDann codes are: they follow the same easy and intuitive user's philosophy and were designed in a graphical interface under the LabVIEW programming environment. Both codes unfold the neutron spectrum expressed in 60 energy bins, calculate 15 dosimetric quantities and generate a full report in HTML format. Differences of these codes are: NSDUAZ code was designed using classical iterative approaches and needs an initial guess spectrum in order to initiate the iterative procedure. In NSDUAZ, a programming routine was designed to calculate 7 IAEA instrument survey meters using the fluence-dose conversion coefficients. NSDann code use artificial neural networks for solving the ill-conditioned equation system of neutron spectrometry problem through synaptic weights of a properly trained neural network. Contrary to iterative procedures, in neural net approach it is possible to reduce the rate counts used to unfold the neutron spectrum. To evaluate these codes a computer tool called Neutron Spectrometry and dosimetry computer tool was designed. The results obtained with this package are showed. The codes here mentioned are freely available upon request to the authors.« less

Evaluating the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks

NASA Astrophysics Data System (ADS)

Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solís Sánches, L. O.; Miranda, R. Castañeda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.

2013-07-01

In this work the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks is evaluated. The first one code based on traditional iterative procedures and called Neutron spectrometry and dosimetry from the Universidad Autonoma de Zacatecas (NSDUAZ) use the SPUNIT iterative algorithm and was designed to unfold neutron spectrum and calculate 15 dosimetric quantities and 7 IAEA survey meters. The main feature of this code is the automated selection of the initial guess spectrum trough a compendium of neutron spectrum compiled by the IAEA. The second one code known as Neutron spectrometry and dosimetry with artificial neural networks (NDSann) is a code designed using neural nets technology. The artificial intelligence approach of neural net does not solve mathematical equations. By using the knowledge stored at synaptic weights on a neural net properly trained, the code is capable to unfold neutron spectrum and to simultaneously calculate 15 dosimetric quantities, needing as entrance data, only the rate counts measured with a Bonner spheres system. Similarities of both NSDUAZ and NSDann codes are: they follow the same easy and intuitive user's philosophy and were designed in a graphical interface under the LabVIEW programming environment. Both codes unfold the neutron spectrum expressed in 60 energy bins, calculate 15 dosimetric quantities and generate a full report in HTML format. Differences of these codes are: NSDUAZ code was designed using classical iterative approaches and needs an initial guess spectrum in order to initiate the iterative procedure. In NSDUAZ, a programming routine was designed to calculate 7 IAEA instrument survey meters using the fluence-dose conversion coefficients. NSDann code use artificial neural networks for solving the ill-conditioned equation system of neutron spectrometry problem through synaptic weights of a properly trained neural network. Contrary to iterative procedures, in neural net approach it is possible to reduce the rate counts used to unfold the neutron spectrum. To evaluate these codes a computer tool called Neutron Spectrometry and dosimetry computer tool was designed. The results obtained with this package are showed. The codes here mentioned are freely available upon request to the authors.

Structural identifiability of cyclic graphical models of biological networks with latent variables.

PubMed

Wang, Yulin; Lu, Na; Miao, Hongyu

2016-06-13

Graphical models have long been used to describe biological networks for a variety of important tasks such as the determination of key biological parameters, and the structure of graphical model ultimately determines whether such unknown parameters can be unambiguously obtained from experimental observations (i.e., the identifiability problem). Limited by resources or technical capacities, complex biological networks are usually partially observed in experiment, which thus introduces latent variables into the corresponding graphical models. A number of previous studies have tackled the parameter identifiability problem for graphical models such as linear structural equation models (SEMs) with or without latent variables. However, the limited resolution and efficiency of existing approaches necessarily calls for further development of novel structural identifiability analysis algorithms. An efficient structural identifiability analysis algorithm is developed in this study for a broad range of network structures. The proposed method adopts the Wright's path coefficient method to generate identifiability equations in forms of symbolic polynomials, and then converts these symbolic equations to binary matrices (called identifiability matrix). Several matrix operations are introduced for identifiability matrix reduction with system equivalency maintained. Based on the reduced identifiability matrices, the structural identifiability of each parameter is determined. A number of benchmark models are used to verify the validity of the proposed approach. Finally, the network module for influenza A virus replication is employed as a real example to illustrate the application of the proposed approach in practice. The proposed approach can deal with cyclic networks with latent variables. The key advantage is that it intentionally avoids symbolic computation and is thus highly efficient. Also, this method is capable of determining the identifiability of each single parameter and is thus of higher resolution in comparison with many existing approaches. Overall, this study provides a basis for systematic examination and refinement of graphical models of biological networks from the identifiability point of view, and it has a significant potential to be extended to more complex network structures or high-dimensional systems.

The brain as a system of nested but partially overlapping networks. Heuristic relevance of the model for brain physiology and pathology.

PubMed

Agnati, L F; Guidolin, D; Fuxe, K

2007-01-01

A new model of the brain organization is proposed. The model is based on the assumption that a global molecular network enmeshes the entire central nervous system. Thus, brain extra-cellular and intra-cellular molecular networks are proposed to communicate at the level of special plasma membrane regions (e.g., the lipid rafts) where horizontal molecular networks can represent input/output regions allowing the cell to have informational exchanges with the extracellular environment. Furthermore, some "pervasive signals" such as field potentials, pressure waves and thermal gradients that affect large parts of the brain cellular and molecular networks are discussed. Finally, at least two learning paradigms are analyzed taking into account the possible role of Volume Transmission: the so-called model of "temporal difference learning" and the "Turing B-unorganised machine". The relevance of this new view of brain organization for a deeper understanding of some neurophysiological and neuropathological aspects of its function is briefly discussed.

Matrix product algorithm for stochastic dynamics on networks applied to nonequilibrium Glauber dynamics

NASA Astrophysics Data System (ADS)

Barthel, Thomas; De Bacco, Caterina; Franz, Silvio

2018-01-01

We introduce and apply an efficient method for the precise simulation of stochastic dynamical processes on locally treelike graphs. Networks with cycles are treated in the framework of the cavity method. Such models correspond, for example, to spin-glass systems, Boolean networks, neural networks, or other technological, biological, and social networks. Building upon ideas from quantum many-body theory, our approach is based on a matrix product approximation of the so-called edge messages—conditional probabilities of vertex variable trajectories. Computation costs and accuracy can be tuned by controlling the matrix dimensions of the matrix product edge messages (MPEM) in truncations. In contrast to Monte Carlo simulations, the algorithm has a better error scaling and works for both single instances as well as the thermodynamic limit. We employ it to examine prototypical nonequilibrium Glauber dynamics in the kinetic Ising model. Because of the absence of cancellation effects, observables with small expectation values can be evaluated accurately, allowing for the study of decay processes and temporal correlations.

Scale-space measures for graph topology link protein network architecture to function.

PubMed

Hulsman, Marc; Dimitrakopoulos, Christos; de Ridder, Jeroen

2014-06-15

The network architecture of physical protein interactions is an important determinant for the molecular functions that are carried out within each cell. To study this relation, the network architecture can be characterized by graph topological characteristics such as shortest paths and network hubs. These characteristics have an important shortcoming: they do not take into account that interactions occur across different scales. This is important because some cellular functions may involve a single direct protein interaction (small scale), whereas others require more and/or indirect interactions, such as protein complexes (medium scale) and interactions between large modules of proteins (large scale). In this work, we derive generalized scale-aware versions of known graph topological measures based on diffusion kernels. We apply these to characterize the topology of networks across all scales simultaneously, generating a so-called graph topological scale-space. The comprehensive physical interaction network in yeast is used to show that scale-space based measures consistently give superior performance when distinguishing protein functional categories and three major types of functional interactions-genetic interaction, co-expression and perturbation interactions. Moreover, we demonstrate that graph topological scale spaces capture biologically meaningful features that provide new insights into the link between function and protein network architecture. Matlab(TM) code to calculate the scale-aware topological measures (STMs) is available at http://bioinformatics.tudelft.nl/TSSA © The Author 2014. Published by Oxford University Press.

A new network representation of the metabolism to detect chemical transformation modules.

PubMed

Sorokina, Maria; Medigue, Claudine; Vallenet, David

2015-11-14

Metabolism is generally modeled by directed networks where nodes represent reactions and/or metabolites. In order to explore metabolic pathway conservation and divergence among organisms, previous studies were based on graph alignment to find similar pathways. Few years ago, the concept of chemical transformation modules, also called reaction modules, was introduced and correspond to sequences of chemical transformations which are conserved in metabolism. We propose here a novel graph representation of the metabolic network where reactions sharing a same chemical transformation type are grouped in Reaction Molecular Signatures (RMS). RMS were automatically computed for all reactions and encode changes in atoms and bonds. A reaction network containing all available metabolic knowledge was then reduced by an aggregation of reaction nodes and edges to obtain a RMS network. Paths in this network were explored and a substantial number of conserved chemical transformation modules was detected. Furthermore, this graph-based formalism allows us to define several path scores reflecting different biological conservation meanings. These scores are significantly higher for paths corresponding to known metabolic pathways and were used conjointly to build association rules that should predict metabolic pathway types like biosynthesis or degradation. This representation of metabolism in a RMS network offers new insights to capture relevant metabolic contexts. Furthermore, along with genomic context methods, it should improve the detection of gene clusters corresponding to new metabolic pathways.

Distributed clone detection in static wireless sensor networks: random walk with network division.

PubMed

Khan, Wazir Zada; Aalsalem, Mohammed Y; Saad, N M

2015-01-01

Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.

Application of Gaussian beam ray-equivalent model and back-propagation artificial neural network in laser diode fast axis collimator assembly.

PubMed

Yu, Hao; Rossi, Giammarco; Braglia, Andrea; Perrone, Guido

2016-08-10

The paper presents the development of a tool based on a back-propagation artificial neural network to assist in the accurate positioning of the lenses used to collimate the beam from semiconductor laser diodes along the so-called fast axis. After training using a Gaussian beam ray-equivalent model, the network is capable of indicating the tilt, decenter, and defocus of such lenses from the measured field distribution, so the operator can determine the errors with respect to the actual lens position and optimize the diode assembly procedure. An experimental validation using a typical configuration exploited in multi-emitter diode module assembly and fast axis collimating lenses with different focal lengths and numerical apertures is reported.

Network community structure and loop coefficient method

NASA Astrophysics Data System (ADS)

Vragović, I.; Louis, E.

2006-07-01

A modular structure, in which groups of tightly connected nodes could be resolved as separate entities, is a property that can be found in many complex networks. In this paper, we propose a algorithm for identifying communities in networks. It is based on a local measure, so-called loop coefficient that is a generalization of the clustering coefficient. Nodes with a large loop coefficient tend to be core inner community nodes, while other vertices are usually peripheral sites at the borders of communities. Our method gives satisfactory results for both artificial and real-world graphs, if they have a relatively pronounced modular structure. This type of algorithm could open a way of interpreting the role of nodes in communities in terms of the local loop coefficient, and could be used as a complement to other methods.

Two-dimensional quantum repeaters

NASA Astrophysics Data System (ADS)

Wallnöfer, J.; Zwerger, M.; Muschik, C.; Sangouard, N.; Dür, W.

2016-11-01

The endeavor to develop quantum networks gave rise to a rapidly developing field with far-reaching applications such as secure communication and the realization of distributed computing tasks. This ultimately calls for the creation of flexible multiuser structures that allow for quantum communication between arbitrary pairs of parties in the network and facilitate also multiuser applications. To address this challenge, we propose a two-dimensional quantum repeater architecture to establish long-distance entanglement shared between multiple communication partners in the presence of channel noise and imperfect local control operations. The scheme is based on the creation of self-similar multiqubit entanglement structures at growing scale, where variants of entanglement swapping and multiparty entanglement purification are combined to create high-fidelity entangled states. We show how such networks can be implemented using trapped ions in cavities.

Designing the Next Generation Global Geodetic Network for GGOS

NASA Astrophysics Data System (ADS)

Pavlis, Erricos C.; Kuzmicz-Cieslak, Magdalena; König, Daniel; MacMillan, Daniel S.

2014-05-01

The U.S. National Research Council report "Precise Geodetic Infrastructure: National Requirements for a Shared Resource" (2010) recommended that we 'make a long-term commitment to maintain the International Terrestrial Reference Frame (ITRF) to ensure its continuity and stability'. It further determined that to ensure this, a network of about ~30 globally distributed "core" observatories with state of the art equipment was necessary and should be deployed over the next decade or so. The findings were based on simulation studies using conceptual networks where Satellite Laser Ranging (SLR) and Very Long Baseline Interferometry (VLBI) equipment of the next generation quality were deployed and operated 24/7. Since then, GGOS—the Global Geodetic Observing System, has embarked in an international effort to organize this future network, soliciting contributions from around the world, through an open solicitation "Call for Proposals—CfP". After a critical number of proposals were received, the results were evaluated and a data base was established where the likely sites are ranked in terms of the available equipment, local environment and weather, probability of completion and the relevant date, etc. The renewal process is expected to evolve smoothly over many years, from the current (legacy) state to the next generation ("GGOS-class") equipment. In order to design the optimal distribution of the proposed sites and to determine any gaps in the final network, simulations have been called for again, only this time the site locations are identical to those listed in the compiled data base, and the equipment at each site is in accordance to what is described in the data base for each point in time. The main objective of the simulations addresses the quality of the ITRF product from a network we expect to have in place about five and ten years after the NRC report (2016/2020). A secondary but equally important simulation task is the study of trade-offs when deploying new sites, e.g. comparing possible alternatives from several proposed sites in a region, or the order in time of deployment of future sites so that the transition is seamless and the ITRF suffers no degradation. As a first step, the simulation process was validated against the prior realization of the ITRF, using simulated SLR, VLBI and GNSS information based on two years of real data contributing to ITRF. We present the results of these simulation studies and examine the likelihood that the designed networks will successfully meet the GGOS goal of 1 mm or better accuracy at epoch and a temporal stability on the order of 0.1 mm/y, with similar numbers for the scale and orientation components of the ITRF.

The case of the religious network group.

PubMed

Friedman, R

1999-01-01

GenCorp, a Connecticut-based paper-goods manufacturer, has long supported employee-organized network groups. Its social support group for African-Americans, in fact, has been a particular success, having provided black employees with opportunities to further enhance their careers and helped the company retain top talent, meet its EEO goals, and gain favorable publicity. So when Alice Lawrence, a top accountant at GenCorp, called general manager Bill Thompson about the Christian network group being organized in one of the company's southern plants, Bill hardly flinched. After all, the Christian group was being organized by Russell Kramer, one of the company's most effective plant managers. What could be the problem there? But a couple of years ago, Alice noted, Russell had sent around a companywide letter that talked about the sinful nature of homosexuality. And that letter has made her and other gay and lesbian employees terribly uneasy. To complicate matters, the issue of "Christian rights" in the workplace was being widely discussed on radio talk shows, and several books on the topic had recently been published. An employee had even called the new region's head of human resources to get clarification on the topic. Up until now, GenCorp hadn't placed a lot of restrictions on network groups. But the emergence of a religious group was raising new questions for GenCorp's managers. Should the company accept religious groups or try to stop them? What policy, if any, should GenCorp adopt toward these network groups? Five experts comment on this fictional case study.

Online Databases for Taxonomy and Identification of Pathogenic Fungi and Proposal for a Cloud-Based Dynamic Data Network Platform.

PubMed

Prakash, Peralam Yegneswaran; Irinyi, Laszlo; Halliday, Catriona; Chen, Sharon; Robert, Vincent; Meyer, Wieland

2017-04-01

The increase in public online databases dedicated to fungal identification is noteworthy. This can be attributed to improved access to molecular approaches to characterize fungi, as well as to delineate species within specific fungal groups in the last 2 decades, leading to an ever-increasing complexity of taxonomic assortments and nomenclatural reassignments. Thus, well-curated fungal databases with substantial accurate sequence data play a pivotal role for further research and diagnostics in the field of mycology. This minireview aims to provide an overview of currently available online databases for the taxonomy and identification of human and animal-pathogenic fungi and calls for the establishment of a cloud-based dynamic data network platform. Copyright © 2017 American Society for Microbiology.

Methods for parameter identification in oscillatory networks and application to cortical and thalamic 600 Hz activity.

PubMed

Leistritz, L; Suesse, T; Haueisen, J; Hilgenfeld, B; Witte, H

2006-01-01

Directed information transfer in the human brain occurs presumably by oscillations. As of yet, most approaches for the analysis of these oscillations are based on time-frequency or coherence analysis. The present work concerns the modeling of cortical 600 Hz oscillations, localized within the Brodmann Areas 3b and 1 after stimulation of the nervus medianus, by means of coupled differential equations. This approach leads to the so-called parameter identification problem, where based on a given data set, a set of unknown parameters of a system of ordinary differential equations is determined by special optimization procedures. Some suitable algorithms for this task are presented in this paper. Finally an oscillatory network model is optimally fitted to the data taken from ten volunteers.

A Novel QKD-based Secure Edge Router Architecture Design for Burst Confidentiality in Optical Burst Switched Networks

NASA Astrophysics Data System (ADS)

Balamurugan, A. M.; Sivasubramanian, A.

2014-06-01

The Optical Burst Switching (OBS) is an emergent result to the technology issue that could achieve a viable network in future. They have the ability to meet the bandwidth requisite of those applications that call for intensive bandwidth. The field of optical transmission has undergone numerous advancements and is still being researched mainly due to the fact that optical data transmission can be done at enormous speeds. The concept of OBS is still far from perfection facing issues in case of security threat. The transfer of optical switching paradigm to optical burst switching faces serious downfall in the fields of burst aggregation, routing, authentication, dispute resolution and quality of service (QoS). This paper proposes a framework based on QKD based secure edge router architecture design to provide burst confidentiality. The QKD protocol offers high level of confidentiality as it is indestructible. The design architecture was implemented in FPGA using diverse models and the results were taken. The results show that the proposed model is suitable for real time secure routing applications of the Optical burst switched networks.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Gregory L.; Arnold, Dorian; LeGendre, Matthew

STAT is a light weight debugging tool that gathers and merges stack traces from all of the processes in a parallel application. STAT uses the MRNet tree based overlay network to broadcast commands from the tool front-end to the STAT daemons and for the front-end to gather the traces from the STAT daemons. As the traces propagate through the MRNet network tree, they are merged across all tasks to form a similar function call patterns and to delineate a small set of equivalence classes. A representative task from each of these classes can then be fed into a full featuremore » debugger like TolalView for root cause analysis.« less

Analytical performance assessment of orbital configurations

NASA Astrophysics Data System (ADS)

Hitzl, D. L.; Krakowski, D. C.

1981-08-01

The system analysis of an orbital communication network of N satellites has been conducted. Specifically, the problem of connecting, in an optimal way, a set of ground-based laser transmitters to a second set of ground receivers on another part of the earth via a number of relay satellites fitted with retroreflectors has been addressed. A computer program has been developed which can treat either the so-called 'single-bounce' or 'double-bounce' cases. Sample results included in this paper consider a double-bounce orbital network composed of 12 relay satellites in 6 hour elliptical orbits together with 16 transceiver (delivery) satellites in 4.8 hour elliptical orbits.

National Communications System: Ensuring Essential Communications for the Homeland

DTIC Science & Technology

2002-01-01

EP calls receive priority in the Signaling System 7 ( SS7 ) networks that manage calls in the carrier trunk networks. In 1993, the American National...the application of available GETS features. In 1996, ANSI modified the SS7 standards so that NS/EP traffic would have a higher signaling priority...facilitate industry migration to the standard related to SS7 message priority. GETS representatives worked with the GETS interexchange and local

PIYAS-proceeding to intelligent service oriented memory allocation for flash based data centric sensor devices in wireless sensor networks.

PubMed

Rizvi, Sanam Shahla; Chung, Tae-Sun

2010-01-01

Flash memory has become a more widespread storage medium for modern wireless devices because of its effective characteristics like non-volatility, small size, light weight, fast access speed, shock resistance, high reliability and low power consumption. Sensor nodes are highly resource constrained in terms of limited processing speed, runtime memory, persistent storage, communication bandwidth and finite energy. Therefore, for wireless sensor networks supporting sense, store, merge and send schemes, an efficient and reliable file system is highly required with consideration of sensor node constraints. In this paper, we propose a novel log structured external NAND flash memory based file system, called Proceeding to Intelligent service oriented memorY Allocation for flash based data centric Sensor devices in wireless sensor networks (PIYAS). This is the extended version of our previously proposed PIYA [1]. The main goals of the PIYAS scheme are to achieve instant mounting and reduced SRAM space by keeping memory mapping information to a very low size of and to provide high query response throughput by allocation of memory to the sensor data by network business rules. The scheme intelligently samples and stores the raw data and provides high in-network data availability by keeping the aggregate data for a longer period of time than any other scheme has done before. We propose effective garbage collection and wear-leveling schemes as well. The experimental results show that PIYAS is an optimized memory management scheme allowing high performance for wireless sensor networks.

Social disadvantage and borderline personality disorder: A study of social networks.

PubMed

Beeney, Joseph E; Hallquist, Michael N; Clifton, Allan D; Lazarus, Sophie A; Pilkonis, Paul A

2018-01-01

Examining differences in social integration, social support, and relationship characteristics in social networks may be critical for understanding the character and costs of the social difficulties experienced of borderline personality disorder (BPD). We conducted an ego-based (self-reported, individual) social network analysis of 142 participants recruited from clinical and community sources. Each participant listed the 30 most significant people (called alters) in their social network, then rated each alter in terms of amount of contact, social support, attachment strength and negative interactions. In addition, measures of social integration were determined using participant's report of the connection between people in their networks. BPD was associated with poorer social support, more frequent negative interactions, and less social integration. Examination of alter-by-BPD interactions indicated that whereas participants with low BPD symptoms had close relationships with people with high centrality within their networks, participants with high BPD symptoms had their closest relationships with people less central to their networks. The results suggest that individuals with BPD are at a social disadvantage: Those with whom they are most closely linked (including romantic partners) are less socially connected (i.e., less central) within their social network. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

sNebula, a network-based algorithm to predict binding between human leukocyte antigens and peptides

DOE Office of Scientific and Technical Information (OSTI.GOV)

Luo, Heng; Ye, Hao; Ng, Hui Wen

Understanding the binding between human leukocyte antigens (HLAs) and peptides is important to understand the functioning of the immune system. Since it is time-consuming and costly to measure the binding between large numbers of HLAs and peptides, computational methods including machine learning models and network approaches have been developed to predict HLA-peptide binding. However, there are several limitations for the existing methods. We developed a network-based algorithm called sNebula to address these limitations. We curated qualitative Class I HLA-peptide binding data and demonstrated the prediction performance of sNebula on this dataset using leave-one-out cross-validation and five-fold cross-validations. Furthermore, this algorithmmore » can predict not only peptides of different lengths and different types of HLAs, but also the peptides or HLAs that have no existing binding data. We believe sNebula is an effective method to predict HLA-peptide binding and thus improve our understanding of the immune system.« less

Evaluation of architectures for an ASP MPEG-4 decoder using a system-level design methodology

NASA Astrophysics Data System (ADS)

Garcia, Luz; Reyes, Victor; Barreto, Dacil; Marrero, Gustavo; Bautista, Tomas; Nunez, Antonio

2005-06-01

Trends in multimedia consumer electronics, digital video and audio, aim to reach users through low-cost mobile devices connected to data broadcasting networks with limited bandwidth. An emergent broadcasting network is the digital audio broadcasting network (DAB) which provides CD quality audio transmission together with robustness and efficiency techniques to allow good quality reception in motion conditions. This paper focuses on the system-level evaluation of different architectural options to allow low bandwidth digital video reception over DAB, based on video compression techniques. Profiling and design space exploration techniques are applied over the ASP MPEG-4 decoder in order to find out the best HW/SW partition given the application and platform constraints. An innovative SystemC-based system-level design tool, called CASSE, is being used for modelling, exploration and evaluation of different ASP MPEG-4 decoder HW/SW partitions. System-level trade offs and quantitative data derived from this analysis are also presented in this work.

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks

PubMed Central

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV. PMID:27258013

Event-Based $H_\\infty $ State Estimation for Time-Varying Stochastic Dynamical Networks With State- and Disturbance-Dependent Noises.

PubMed

Sheng, Li; Wang, Zidong; Zou, Lei; Alsaadi, Fuad E

2017-10-01

In this paper, the event-based finite-horizon H ∞ state estimation problem is investigated for a class of discrete time-varying stochastic dynamical networks with state- and disturbance-dependent noises [also called (x,v) -dependent noises]. An event-triggered scheme is proposed to decrease the frequency of the data transmission between the sensors and the estimator, where the signal is transmitted only when certain conditions are satisfied. The purpose of the problem addressed is to design a time-varying state estimator in order to estimate the network states through available output measurements. By employing the completing-the-square technique and the stochastic analysis approach, sufficient conditions are established to ensure that the error dynamics of the state estimation satisfies a prescribed H ∞ performance constraint over a finite horizon. The desired estimator parameters can be designed via solving coupled backward recursive Riccati difference equations. Finally, a numerical example is exploited to demonstrate the effectiveness of the developed state estimation scheme.

sNebula, a network-based algorithm to predict binding between human leukocyte antigens and peptides

PubMed Central

Luo, Heng; Ye, Hao; Ng, Hui Wen; Sakkiah, Sugunadevi; Mendrick, Donna L.; Hong, Huixiao

2016-01-01

Understanding the binding between human leukocyte antigens (HLAs) and peptides is important to understand the functioning of the immune system. Since it is time-consuming and costly to measure the binding between large numbers of HLAs and peptides, computational methods including machine learning models and network approaches have been developed to predict HLA-peptide binding. However, there are several limitations for the existing methods. We developed a network-based algorithm called sNebula to address these limitations. We curated qualitative Class I HLA-peptide binding data and demonstrated the prediction performance of sNebula on this dataset using leave-one-out cross-validation and five-fold cross-validations. This algorithm can predict not only peptides of different lengths and different types of HLAs, but also the peptides or HLAs that have no existing binding data. We believe sNebula is an effective method to predict HLA-peptide binding and thus improve our understanding of the immune system. PMID:27558848

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks.

PubMed

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.

sNebula, a network-based algorithm to predict binding between human leukocyte antigens and peptides

DOE PAGES

Luo, Heng; Ye, Hao; Ng, Hui Wen; ...

2016-08-25

Understanding the binding between human leukocyte antigens (HLAs) and peptides is important to understand the functioning of the immune system. Since it is time-consuming and costly to measure the binding between large numbers of HLAs and peptides, computational methods including machine learning models and network approaches have been developed to predict HLA-peptide binding. However, there are several limitations for the existing methods. We developed a network-based algorithm called sNebula to address these limitations. We curated qualitative Class I HLA-peptide binding data and demonstrated the prediction performance of sNebula on this dataset using leave-one-out cross-validation and five-fold cross-validations. Furthermore, this algorithmmore » can predict not only peptides of different lengths and different types of HLAs, but also the peptides or HLAs that have no existing binding data. We believe sNebula is an effective method to predict HLA-peptide binding and thus improve our understanding of the immune system.« less

Deduction of reservoir operating rules for application in global hydrological models

NASA Astrophysics Data System (ADS)

Coerver, Hubertus M.; Rutten, Martine M.; van de Giesen, Nick C.

2018-01-01

A big challenge in constructing global hydrological models is the inclusion of anthropogenic impacts on the water cycle, such as caused by dams. Dam operators make decisions based on experience and often uncertain information. In this study information generally available to dam operators, like inflow into the reservoir and storage levels, was used to derive fuzzy rules describing the way a reservoir is operated. Using an artificial neural network capable of mimicking fuzzy logic, called the ANFIS adaptive-network-based fuzzy inference system, fuzzy rules linking inflow and storage with reservoir release were determined for 11 reservoirs in central Asia, the US and Vietnam. By varying the input variables of the neural network, different configurations of fuzzy rules were created and tested. It was found that the release from relatively large reservoirs was significantly dependent on information concerning recent storage levels, while release from smaller reservoirs was more dependent on reservoir inflows. Subsequently, the derived rules were used to simulate reservoir release with an average Nash-Sutcliffe coefficient of 0.81.

Discovering latent commercial networks from online financial news articles

NASA Astrophysics Data System (ADS)

Xia, Yunqing; Su, Weifeng; Lau, Raymond Y. K.; Liu, Yi

2013-08-01

Unlike most online social networks where explicit links among individual users are defined, the relations among commercial entities (e.g. firms) may not be explicitly declared in commercial Web sites. One main contribution of this article is the development of a novel computational model for the discovery of the latent relations among commercial entities from online financial news. More specifically, a CRF model which can exploit both structural and contextual features is applied to commercial entity recognition. In addition, a point-wise mutual information (PMI)-based unsupervised learning method is developed for commercial relation identification. To evaluate the effectiveness of the proposed computational methods, a prototype system called CoNet has been developed. Based on the financial news articles crawled from Google finance, the CoNet system achieves average F-scores of 0.681 and 0.754 in commercial entity recognition and commercial relation identification, respectively. Our experimental results confirm that the proposed shallow natural language processing methods are effective for the discovery of latent commercial networks from online financial news.

Reflections on Active Networking

DTIC Science & Technology

2005-01-01

Reflections on Active Networking Jonathan M. Smith CIS Department, University of Pennsylvania jms@cis.upenn.edu Abstract Interactions among...called “ Active Networking” came into being. It demonstrates the deep roots Active Networking has in the programming languages, networking and operating...broader research agenda, and the specific goals pursued in the SwitchWare project. I close by speculating on possible futures for Active Networking

Meta-path based heterogeneous combat network link prediction

NASA Astrophysics Data System (ADS)

Li, Jichao; Ge, Bingfeng; Yang, Kewei; Chen, Yingwu; Tan, Yuejin

2017-09-01

The combat system-of-systems in high-tech informative warfare, composed of many interconnected combat systems of different types, can be regarded as a type of complex heterogeneous network. Link prediction for heterogeneous combat networks (HCNs) is of significant military value, as it facilitates reconfiguring combat networks to represent the complex real-world network topology as appropriate with observed information. This paper proposes a novel integrated methodology framework called HCNMP (HCN link prediction based on meta-path) to predict multiple types of links simultaneously for an HCN. More specifically, the concept of HCN meta-paths is introduced, through which the HCNMP can accumulate information by extracting different features of HCN links for all the six defined types. Next, an HCN link prediction model, based on meta-path features, is built to predict all types of links of the HCN simultaneously. Then, the solution algorithm for the HCN link prediction model is proposed, in which the prediction results are obtained by iteratively updating with the newly predicted results until the results in the HCN converge or reach a certain maximum iteration number. Finally, numerical experiments on the dataset of a real HCN are conducted to demonstrate the feasibility and effectiveness of the proposed HCNMP, in comparison with 30 baseline methods. The results show that the performance of the HCNMP is superior to those of the baseline methods.

Networked Participatory Scholarship: Emergent Techno-Cultural Pressures toward Open and Digital Scholarship in Online Networks

ERIC Educational Resources Information Center

Veletsianos, George; Kimmons, Royce

2012-01-01

We examine the relationship between scholarly practice and participatory technologies and explore how such technologies invite and reflect the emergence of a new form of scholarship that we call "Networked Participatory Scholarship": scholars' participation in online social networks to share, reflect upon, critique, improve, validate, and…

The Ontario Benthos Biomonitoring Network

Treesearch

Chris Jones; Brian Craig; Nicole Dmytrow

2006-01-01

Canada’s Ontario Ministry of the Environment and Environment Canada (Ecological Monitoring and Assessment Network) are developing an aquatic macroinvertebrate biomonitoring network for Ontario’s lakes, streams, and wetlands. We are building the program, called the Ontario Benthos Biomonitoring Network (OBBN), on the principles of partnership, free data sharing, and...

Networked Improvement Communities: The Discipline of Improvement Science Meets the Power of Networks

ERIC Educational Resources Information Center

LeMahieu, Paul G.; Grunow, Alicia; Baker, Laura; Nordstrum, Lee E.; Gomez, Louis M.

2017-01-01

Purpose: The purpose of this paper is to delineate an approach to quality assurance in education called networked improvement communities (NICs) that focused on integrating the methodologies of improvement science with few of the networks. Quality improvement, the science and practice of continuously improving programs, practices, processes,…

Behavior-based network management: a unique model-based approach to implementing cyber superiority

NASA Astrophysics Data System (ADS)

Seng, Jocelyn M.

2016-05-01

Behavior-Based Network Management (BBNM) is a technological and strategic approach to mastering the identification and assessment of network behavior, whether human-driven or machine-generated. Recognizing that all five U.S. Air Force (USAF) mission areas rely on the cyber domain to support, enhance and execute their tasks, BBNM is designed to elevate awareness and improve the ability to better understand the degree of reliance placed upon a digital capability and the operational risk.2 Thus, the objective of BBNM is to provide a holistic view of the digital battle space to better assess the effects of security, monitoring, provisioning, utilization management, allocation to support mission sustainment and change control. Leveraging advances in conceptual modeling made possible by a novel advancement in software design and implementation known as Vector Relational Data Modeling (VRDM™), the BBNM approach entails creating a network simulation in which meaning can be inferred and used to manage network behavior according to policy, such as quickly detecting and countering malicious behavior. Initial research configurations have yielded executable BBNM models as combinations of conceptualized behavior within a network management simulation that includes only concepts of threats and definitions of "good" behavior. A proof of concept assessment called "Lab Rat," was designed to demonstrate the simplicity of network modeling and the ability to perform adaptation. The model was tested on real world threat data and demonstrated adaptive and inferential learning behavior. Preliminary results indicate this is a viable approach towards achieving cyber superiority in today's volatile, uncertain, complex and ambiguous (VUCA) environment.

Leveraging disjoint communities for detecting overlapping community structure

NASA Astrophysics Data System (ADS)

Chakraborty, Tanmoy

2015-05-01

Network communities represent mesoscopic structure for understanding the organization of real-world networks, where nodes often belong to multiple communities and form overlapping community structure in the network. Due to non-triviality in finding the exact boundary of such overlapping communities, this problem has become challenging, and therefore huge effort has been devoted to detect overlapping communities from the network. In this paper, we present PVOC (Permanence based Vertex-replication algorithm for Overlapping Community detection), a two-stage framework to detect overlapping community structure. We build on a novel observation that non-overlapping community structure detected by a standard disjoint community detection algorithm from a network has high resemblance with its actual overlapping community structure, except the overlapping part. Based on this observation, we posit that there is perhaps no need of building yet another overlapping community finding algorithm; but one can efficiently manipulate the output of any existing disjoint community finding algorithm to obtain the required overlapping structure. We propose a new post-processing technique that by combining with any existing disjoint community detection algorithm, can suitably process each vertex using a new vertex-based metric, called permanence, and thereby finds out overlapping candidates with their community memberships. Experimental results on both synthetic and large real-world networks show that PVOC significantly outperforms six state-of-the-art overlapping community detection algorithms in terms of high similarity of the output with the ground-truth structure. Thus our framework not only finds meaningful overlapping communities from the network, but also allows us to put an end to the constant effort of building yet another overlapping community detection algorithm.

An object-oriented design for automated navigation of semantic networks inside a medical data dictionary.

PubMed

Ruan, W; Bürkle, T; Dudeck, J

2000-01-01

In this paper we present a data dictionary server for the automated navigation of information sources. The underlying knowledge is represented within a medical data dictionary. The mapping between medical terms and information sources is based on a semantic network. The key aspect of implementing the dictionary server is how to represent the semantic network in a way that is easier to navigate and to operate, i.e. how to abstract the semantic network and to represent it in memory for various operations. This paper describes an object-oriented design based on Java that represents the semantic network in terms of a group of objects. A node and its relationships to its neighbors are encapsulated in one object. Based on such a representation model, several operations have been implemented. They comprise the extraction of parts of the semantic network which can be reached from a given node as well as finding all paths between a start node and a predefined destination node. This solution is independent of any given layout of the semantic structure. Therefore the module, called Giessen Data Dictionary Server can act independent of a specific clinical information system. The dictionary server will be used to present clinical information, e.g. treatment guidelines or drug information sources to the clinician in an appropriate working context. The server is invoked from clinical documentation applications which contain an infobutton. Automated navigation will guide the user to all the information relevant to her/his topic, which is currently available inside our closed clinical network.

Integrating Computer-Assisted Language Learning in Saudi Schools: A Change Model

ERIC Educational Resources Information Center

Alresheed, Saleh; Leask, Marilyn; Raiker, Andrea

2015-01-01

Computer-assisted language learning (CALL) technology and pedagogy have gained recognition globally for their success in supporting second language acquisition (SLA). In Saudi Arabia, the government aims to provide most educational institutions with computers and networking for integrating CALL into classrooms. However, the recognition of CALL's…

A Knowledge Navigation Method for the Domain of Customers' Services of Mobile Communication Corporations in China

NASA Astrophysics Data System (ADS)

Wu, Jiangning; Wang, Xiaohuan

Rapidly increasing amount of mobile phone users and types of services leads to a great accumulation of complaining information. How to use this information to enhance the quality of customers' services is a big issue at present. To handle this kind of problem, the paper presents an approach to construct a domain knowledge map for navigating the explicit and tacit knowledge in two ways: building the Topic Map-based explicit knowledge navigation model, which includes domain TM construction, a semantic topic expansion algorithm and VSM-based similarity calculation; building Social Network Analysis-based tacit knowledge navigation model, which includes a multi-relational expert navigation algorithm and the criterions to evaluate the performance of expert networks. In doing so, both the customer managers and operators in call centers can find the appropriate knowledge and experts quickly and exactly. The experimental results show that the above method is very powerful for knowledge navigation.

Finger Vein Recognition Based on Local Directional Code

PubMed Central

Meng, Xianjing; Yang, Gongping; Yin, Yilong; Xiao, Rongyang

2012-01-01

Finger vein patterns are considered as one of the most promising biometric authentication methods for its security and convenience. Most of the current available finger vein recognition methods utilize features from a segmented blood vessel network. As an improperly segmented network may degrade the recognition accuracy, binary pattern based methods are proposed, such as Local Binary Pattern (LBP), Local Derivative Pattern (LDP) and Local Line Binary Pattern (LLBP). However, the rich directional information hidden in the finger vein pattern has not been fully exploited by the existing local patterns. Inspired by the Webber Local Descriptor (WLD), this paper represents a new direction based local descriptor called Local Directional Code (LDC) and applies it to finger vein recognition. In LDC, the local gradient orientation information is coded as an octonary decimal number. Experimental results show that the proposed method using LDC achieves better performance than methods using LLBP. PMID:23202194

Thin-slice vision: inference of confidence measure from perceptual video quality

NASA Astrophysics Data System (ADS)

Hameed, Abdul; Balas, Benjamin; Dai, Rui

2016-11-01

There has been considerable research on thin-slice judgments, but no study has demonstrated the predictive validity of confidence measures when assessors watch videos acquired from communication systems, in which the perceptual quality of videos could be degraded by limited bandwidth and unreliable network conditions. This paper studies the relationship between high-level thin-slice judgments of human behavior and factors that contribute to perceptual video quality. Based on a large number of subjective test results, it has been found that the confidence of a single individual present in all the videos, called speaker's confidence (SC), could be predicted by a list of features that contribute to perceptual video quality. Two prediction models, one based on artificial neural network and the other based on a decision tree, were built to predict SC. Experimental results have shown that both prediction models can result in high correlation measures.

Finger vein recognition based on local directional code.

PubMed

Meng, Xianjing; Yang, Gongping; Yin, Yilong; Xiao, Rongyang

2012-11-05

Finger vein patterns are considered as one of the most promising biometric authentication methods for its security and convenience. Most of the current available finger vein recognition methods utilize features from a segmented blood vessel network. As an improperly segmented network may degrade the recognition accuracy, binary pattern based methods are proposed, such as Local Binary Pattern (LBP), Local Derivative Pattern (LDP) and Local Line Binary Pattern (LLBP). However, the rich directional information hidden in the finger vein pattern has not been fully exploited by the existing local patterns. Inspired by the Webber Local Descriptor (WLD), this paper represents a new direction based local descriptor called Local Directional Code (LDC) and applies it to finger vein recognition. In LDC, the local gradient orientation information is coded as an octonary decimal number. Experimental results show that the proposed method using LDC achieves better performance than methods using LLBP.

Extensions to the Parallel Real-Time Artificial Intelligence System (PRAIS) for fault-tolerant heterogeneous cycle-stealing reasoning

NASA Technical Reports Server (NTRS)

Goldstein, David

1991-01-01

Extensions to an architecture for real-time, distributed (parallel) knowledge-based systems called the Parallel Real-time Artificial Intelligence System (PRAIS) are discussed. PRAIS strives for transparently parallelizing production (rule-based) systems, even under real-time constraints. PRAIS accomplished these goals (presented at the first annual C Language Integrated Production System (CLIPS) conference) by incorporating a dynamic task scheduler, operating system extensions for fact handling, and message-passing among multiple copies of CLIPS executing on a virtual blackboard. This distributed knowledge-based system tool uses the portability of CLIPS and common message-passing protocols to operate over a heterogeneous network of processors. Results using the original PRAIS architecture over a network of Sun 3's, Sun 4's and VAX's are presented. Mechanisms using the producer-consumer model to extend the architecture for fault-tolerance and distributed truth maintenance initiation are also discussed.

Prediction and Testing of Biological Networks Underlying Intestinal Cancer

PubMed Central

Mariadason, John M.; Wang, Donghai; Augenlicht, Leonard H.; Chance, Mark R.

2010-01-01

Colorectal cancer progresses through an accumulation of somatic mutations, some of which reside in so-called “driver” genes that provide a growth advantage to the tumor. To identify points of intersection between driver gene pathways, we implemented a network analysis framework using protein interactions to predict likely connections – both precedented and novel – between key driver genes in cancer. We applied the framework to find significant connections between two genes, Apc and Cdkn1a (p21), known to be synergistic in tumorigenesis in mouse models. We then assessed the functional coherence of the resulting Apc-Cdkn1a network by engineering in vivo single node perturbations of the network: mouse models mutated individually at Apc (Apc1638N+/−) or Cdkn1a (Cdkn1a−/−), followed by measurements of protein and gene expression changes in intestinal epithelial tissue. We hypothesized that if the predicted network is biologically coherent (functional), then the predicted nodes should associate more specifically with dysregulated genes and proteins than stochastically selected genes and proteins. The predicted Apc-Cdkn1a network was significantly perturbed at the mRNA-level by both single gene knockouts, and the predictions were also strongly supported based on physical proximity and mRNA coexpression of proteomic targets. These results support the functional coherence of the proposed Apc-Cdkn1a network and also demonstrate how network-based predictions can be statistically tested using high-throughput biological data. PMID:20824133

Ethernet access network based on free-space optic deployment technology

NASA Astrophysics Data System (ADS)

Gebhart, Michael; Leitgeb, Erich; Birnbacher, Ulla; Schrotter, Peter

2004-06-01

The satisfaction of all communication needs from single households and business companies over a single access infrastructure is probably the most challenging topic in communications technology today. But even though the so-called "Last Mile Access Bottleneck" is well known since more than ten years and many distribution technologies have been tried out, the optimal solution has not yet been found and paying commercial access networks offering all service classes are still rare today. Conventional services like telephone, radio and TV, as well as new and emerging services like email, web browsing, online-gaming, video conferences, business data transfer or external data storage can all be transmitted over the well known and cost effective Ethernet networking protocol standard. Key requirements for the deployment technology driven by the different services are high data rates to the single customer, security, moderate deployment costs and good scalability to number and density of users, quick and flexible deployment without legal impediments and high availability, referring to the properties of optical and wireless communication. We demonstrate all elements of an Ethernet Access Network based on Free Space Optic distribution technology. Main physical parts are Central Office, Distribution Network and Customer Equipment. Transmission of different services, as well as configuration, service upgrades and remote control of the network are handled by networking features over one FSO connection. All parts of the network are proven, the latest commercially available technology. The set up is flexible and can be adapted to any more specific need if required.

HPNAIDM: The High-Performance Network Anomaly/Intrusion Detection and Mitigation System

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Yan

Identifying traffic anomalies and attacks rapidly and accurately is critical for large network operators. With the rapid growth of network bandwidth, such as the next generation DOE UltraScience Network, and fast emergence of new attacks/virus/worms, existing network intrusion detection systems (IDS) are insufficient because they: • Are mostly host-based and not scalable to high-performance networks; • Are mostly signature-based and unable to adaptively recognize flow-level unknown attacks; • Cannot differentiate malicious events from the unintentional anomalies. To address these challenges, we proposed and developed a new paradigm called high-performance network anomaly/intrustion detection and mitigation (HPNAIDM) system. The new paradigm ismore » significantly different from existing IDSes with the following features (research thrusts). • Online traffic recording and analysis on high-speed networks; • Online adaptive flow-level anomaly/intrusion detection and mitigation; • Integrated approach for false positive reduction. Our research prototype and evaluation demonstrate that the HPNAIDM system is highly effective and economically feasible. Beyond satisfying the pre-set goals, we even exceed that significantly (see more details in the next section). Overall, our project harvested 23 publications (2 book chapters, 6 journal papers and 15 peer-reviewed conference/workshop papers). Besides, we built a website for technique dissemination, which hosts two system prototype release to the research community. We also filed a patent application and developed strong international and domestic collaborations which span both academia and industry.« less

International Digestive Endoscopy Network 2014: Turnpike to the Future

PubMed Central

Kim, Eun Young; Kwon, Kwang An; Choi, Il Ju; Ryu, Ji Kon

2014-01-01

Social networks are useful in the study of relationships between individuals or entire populations, and the ties through which any given social unit connects. Those represent the convergence of the various social contacts of that unit. Consequently, the term "social networking service" (SNS) became extremely familiar. Similar to familiar SNSs, International Digestive Endoscopy Network (IDEN) 2014 was based on an international network composed of an impressive 2-day scientific program dealing with a variety of topics for gastrointestinal (GI) diseases, which connects physicians and researchers from all over the world. The scientific programs included live endoscopic demonstrations and provided cutting-edge information and practice tips as well as the latest advances concerning upper GI, lower GI, and pancreatobiliary endoscopy. IDEN 2014 featured American Society for Gastrointestinal Endoscopy-Korean Society of Gastrointestinal Endoscopy (ASGE-KSGE)-joint sessions prepared through cooperation between ASGE and KSGE. Furthermore, IDEN 2014 provided a special program for young scientists called the 'Asian Young Endoscopist Award Forum' to foster networks, with many young endoscopists from Asian countries taking an active interest and participation. PMID:25324994

Node Survival in Networks under Correlated Attacks

PubMed Central

Hao, Yan; Armbruster, Dieter; Hütt, Marc-Thorsten

2015-01-01

We study the interplay between correlations, dynamics, and networks for repeated attacks on a socio-economic network. As a model system we consider an insurance scheme against disasters that randomly hit nodes, where a node in need receives support from its network neighbors. The model is motivated by gift giving among the Maasai called Osotua. Survival of nodes under different disaster scenarios (uncorrelated, spatially, temporally and spatio-temporally correlated) and for different network architectures are studied with agent-based numerical simulations. We find that the survival rate of a node depends dramatically on the type of correlation of the disasters: Spatially and spatio-temporally correlated disasters increase the survival rate; purely temporally correlated disasters decrease it. The type of correlation also leads to strong inequality among the surviving nodes. We introduce the concept of disaster masking to explain some of the results of our simulations. We also analyze the subsets of the networks that were activated to provide support after fifty years of random disasters. They show qualitative differences for the different disaster scenarios measured by path length, degree, clustering coefficient, and number of cycles. PMID:25932635

Network analysis: A new way of understanding psychopathology?

PubMed

Fonseca-Pedrero, Eduardo

Current taxonomic systems are based on a descriptive and categorical approach where psychopathological symptoms and signs are caused by a hypothetical underlying mental disorder. In order to circumvent the limitations of classification systems, it is necessary to incorporate new conceptual and psychometric models that allow to understand, analyze and intervene in psychopathological phenomena from another perspective. The main goal was to present a new approach called network analysis for its application in the field of psychopathology. First of all, a brief introduction where psychopathological disorders are conceived as complex dynamic systems was carried out. Key concepts, as well as the different types of networks and the procedures for their estimation, are discussed. Following this, centrality measures, important for the understanding of the network as well as to examine the relevance of the variables within the network were addressed. These factors were then exemplified by estimating a network of self-reported psychopathological symptoms in a representative sample of adolescents. Finally, a brief recapitulation is made and future lines of research are discussed. Copyright © 2017 SEP y SEPB. Publicado por Elsevier España, S.L.U. All rights reserved.

International digestive endoscopy network 2014: turnpike to the future.

PubMed

Kim, Eun Young; Kwon, Kwang An; Choi, Il Ju; Ryu, Ji Kon; Hahm, Ki Baik

2014-09-01

Social networks are useful in the study of relationships between individuals or entire populations, and the ties through which any given social unit connects. Those represent the convergence of the various social contacts of that unit. Consequently, the term "social networking service" (SNS) became extremely familiar. Similar to familiar SNSs, International Digestive Endoscopy Network (IDEN) 2014 was based on an international network composed of an impressive 2-day scientific program dealing with a variety of topics for gastrointestinal (GI) diseases, which connects physicians and researchers from all over the world. The scientific programs included live endoscopic demonstrations and provided cutting-edge information and practice tips as well as the latest advances concerning upper GI, lower GI, and pancreatobiliary endoscopy. IDEN 2014 featured American Society for Gastrointestinal Endoscopy-Korean Society of Gastrointestinal Endoscopy (ASGE-KSGE)-joint sessions prepared through cooperation between ASGE and KSGE. Furthermore, IDEN 2014 provided a special program for young scientists called the 'Asian Young Endoscopist Award Forum' to foster networks, with many young endoscopists from Asian countries taking an active interest and participation.

Information spreading on mobile communication networks: A new model that incorporates human behaviors

NASA Astrophysics Data System (ADS)

Ren, Fei; Li, Sai-Ping; Liu, Chuang

2017-03-01

Recently, there is a growing interest in the modeling and simulation based on real social networks among researchers in multi-disciplines. Using an empirical social network constructed from the calling records of a Chinese mobile service provider, we here propose a new model to simulate the information spreading process. This model takes into account two important ingredients that exist in real human behaviors: information prevalence and preferential spreading. The fraction of informed nodes when the system reaches an asymptotically stable state is primarily determined by information prevalence, and the heterogeneity of link weights would slow down the information diffusion. Moreover, the sizes of blind clusters which consist of connected uninformed nodes show a power-law distribution, and these uninformed nodes correspond to a particular portion of nodes which are located at special positions in the network, namely at the edges of large clusters or inside the clusters connected through weak links. Since the simulations are performed on a real world network, the results should be useful in the understanding of the influences of social network structures and human behaviors on information propagation.

Performance of Deep and Shallow Neural Networks, the Universal Approximation Theorem, Activity Cliffs, and QSAR.

PubMed

Winkler, David A; Le, Tu C

2017-01-01

Neural networks have generated valuable Quantitative Structure-Activity/Property Relationships (QSAR/QSPR) models for a wide variety of small molecules and materials properties. They have grown in sophistication and many of their initial problems have been overcome by modern mathematical techniques. QSAR studies have almost always used so-called "shallow" neural networks in which there is a single hidden layer between the input and output layers. Recently, a new and potentially paradigm-shifting type of neural network based on Deep Learning has appeared. Deep learning methods have generated impressive improvements in image and voice recognition, and are now being applied to QSAR and QSAR modelling. This paper describes the differences in approach between deep and shallow neural networks, compares their abilities to predict the properties of test sets for 15 large drug data sets (the kaggle set), discusses the results in terms of the Universal Approximation theorem for neural networks, and describes how DNN may ameliorate or remove troublesome "activity cliffs" in QSAR data sets. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Stable architectures for deep neural networks

NASA Astrophysics Data System (ADS)

Haber, Eldad; Ruthotto, Lars

2018-01-01

Deep neural networks have become invaluable tools for supervised machine learning, e.g. classification of text or images. While often offering superior results over traditional techniques and successfully expressing complicated patterns in data, deep architectures are known to be challenging to design and train such that they generalize well to new data. Critical issues with deep architectures are numerical instabilities in derivative-based learning algorithms commonly called exploding or vanishing gradients. In this paper, we propose new forward propagation techniques inspired by systems of ordinary differential equations (ODE) that overcome this challenge and lead to well-posed learning problems for arbitrarily deep networks. The backbone of our approach is our interpretation of deep learning as a parameter estimation problem of nonlinear dynamical systems. Given this formulation, we analyze stability and well-posedness of deep learning and use this new understanding to develop new network architectures. We relate the exploding and vanishing gradient phenomenon to the stability of the discrete ODE and present several strategies for stabilizing deep learning for very deep networks. While our new architectures restrict the solution space, several numerical experiments show their competitiveness with state-of-the-art networks.

A hybrid modeling approach for option pricing

NASA Astrophysics Data System (ADS)

Hajizadeh, Ehsan; Seifi, Abbas

2011-11-01

The complexity of option pricing has led many researchers to develop sophisticated models for such purposes. The commonly used Black-Scholes model suffers from a number of limitations. One of these limitations is the assumption that the underlying probability distribution is lognormal and this is so controversial. We propose a couple of hybrid models to reduce these limitations and enhance the ability of option pricing. The key input to option pricing model is volatility. In this paper, we use three popular GARCH type model for estimating volatility. Then, we develop two non-parametric models based on neural networks and neuro-fuzzy networks to price call options for S&P 500 index. We compare the results with those of Black-Scholes model and show that both neural network and neuro-fuzzy network models outperform Black-Scholes model. Furthermore, comparing the neural network and neuro-fuzzy approaches, we observe that for at-the-money options, neural network model performs better and for both in-the-money and an out-of-the money option, neuro-fuzzy model provides better results.

vMon-mobile provides wireless connection to the electronic patient record

NASA Astrophysics Data System (ADS)

Oliveira, Pedro P., Jr.; Rebelo, Marina; Pilon, Paulo E.; Gutierrez, Marco A.; Tachinardi, Umberto

2002-05-01

This work presents the development of a set of tools to help doctors to continuously monitor critical patients. Real-time monitoring signals are displayed via a Web Based Electronic Patient Record (Web-EPR) developed at the Heart Institute. Any computer on the Hospital's Intranet can access the Web-EPR that will open a browser plug-in called vMon. Recently vMon was adapted to wireless mobile devices providing the same real-time visualization of vital signals of its desktop counterpart. The monitoring network communicates with the hospital network through a gateway using HL7 messages and has the ability to export waveforms in real time using the multicast protocol through an API library. A dedicated ActiveX component was built that establishes the streaming of the biomedical signals under monitoring and displays them on an Internet Explorer 5.x browser. The mobile version - called vMon-mobile - will parse the browser window and deliver it to a PDA device connected to a local area network. The result is a virtual monitor presenting real-time data on a mobile device. All parameters and signals acquired from the moment the patient is connected to the monitors are stored for a few days. The most clinically relevant information is added to patient's EPR.

Public Safety Networks--Examining Mimetic, Complexity, and Legacy Effects on Interorganizational Collaborations

ERIC Educational Resources Information Center

Dias, Martin A.

2012-01-01

The purpose of this dissertation is to examine information systems-enabled interorganizational collaborations called public safety networks--their proliferation, information systems architecture, and technology evolution. These networks face immense pressures from member organizations, external stakeholders, and environmental contingencies. This…

Control range: a controllability-based index for node significance in directed networks

NASA Astrophysics Data System (ADS)

Wang, Bingbo; Gao, Lin; Gao, Yong

2012-04-01

While a large number of methods for module detection have been developed for undirected networks, it is difficult to adapt them to handle directed networks due to the lack of consensus criteria for measuring the node significance in a directed network. In this paper, we propose a novel structural index, the control range, motivated by recent studies on the structural controllability of large-scale directed networks. The control range of a node quantifies the size of the subnetwork that the node can effectively control. A related index, called the control range similarity, is also introduced to measure the structural similarity between two nodes. When applying the index of control range to several real-world and synthetic directed networks, it is observed that the control range of the nodes is mainly influenced by the network's degree distribution and that nodes with a low degree may have a high control range. We use the index of control range similarity to detect and analyze functional modules in glossary networks and the enzyme-centric network of homo sapiens. Our results, as compared with other approaches to module detection such as modularity optimization algorithm, dynamic algorithm and clique percolation method, indicate that the proposed indices are effective and practical in depicting structural and modular characteristics of sparse directed networks.

Dental problems and Familismo: social network discussion of oral health issues among adults of Mexican origin living in the Midwest United States.

PubMed

Maupome, G; McConnell, W R; Perry, B L

2016-12-01

To examine the influence of collectivist orientation (often called familismo when applied to the Latino sub-group in the United States) in oral health discussion networks. Through respondent-driven sampling and face-to-face interviews, we identified respondents' (egos) personal social network members (alters). Egos stated whom they talked with about oral health, and how often they discussed dental problems in the preceding 12 months. An urban community of adult Mexican-American immigrants in the Midwest United States. We interviewed 332 egos (90% born in Mexico); egos named an average of 3.9 alters in their networks, 1,299 in total. We applied egocentric network methods to examine the ego, alter, and network variables that characterize health discussion networks. Kin were most often leveraged when dental problems arose; egos relied on individuals whom they perceive to have better knowledge about dental matters. However, reliance on knowledgeable alters decreased among egos with greater behavioral acculturation. This paper developed a network-based conceptualization of familismo. We describe the structure of oral health networks, including kin, fictive kin, peers, and health professionals, and examine how networks and acculturation help shape oral health among these Mexican-Americans. Copyright© 2016 Dennis Barber Ltd

Performance verification of network function virtualization in software defined optical transport networks

NASA Astrophysics Data System (ADS)

Zhao, Yongli; Hu, Liyazhou; Wang, Wei; Li, Yajie; Zhang, Jie

2017-01-01

With the continuous opening of resource acquisition and application, there are a large variety of network hardware appliances deployed as the communication infrastructure. To lunch a new network application always implies to replace the obsolete devices and needs the related space and power to accommodate it, which will increase the energy and capital investment. Network function virtualization1 (NFV) aims to address these problems by consolidating many network equipment onto industry standard elements such as servers, switches and storage. Many types of IT resources have been deployed to run Virtual Network Functions (vNFs), such as virtual switches and routers. Then how to deploy NFV in optical transport networks is a of great importance problem. This paper focuses on this problem, and gives an implementation architecture of NFV-enabled optical transport networks based on Software Defined Optical Networking (SDON) with the procedure of vNFs call and return. Especially, an implementation solution of NFV-enabled optical transport node is designed, and a parallel processing method for NFV-enabled OTN nodes is proposed. To verify the performance of NFV-enabled SDON, the protocol interaction procedures of control function virtualization and node function virtualization are demonstrated on SDON testbed. Finally, the benefits and challenges of the parallel processing method for NFV-enabled OTN nodes are simulated and analyzed.

Auditory neural networks involved in attention modulation prefer biologically significant sounds and exhibit sexual dimorphism in anurans.

PubMed

Xue, Fei; Yue, Xizi; Fan, Yanzhu; Cui, Jianguo; Brauth, Steven E; Tang, Yezhong; Fang, Guangzhan

2018-03-09

Allocating attention to biologically relevant stimuli in a complex environment is critically important for survival and reproductive success. In humans, attention modulation is regulated by the frontal cortex, and is often reflected by changes in specific components of the event-related potential (ERP). Although brain networks for attention modulation have been widely studied in primates and avian species, little is known about attention modulation in amphibians. The present study aimed to investigate the attention modulation networks in an anuran species, the Emei music frog ( Babina daunchina ). Male music frogs produce advertisement calls from within underground nest burrows that modify the acoustic features of the calls, and both males and females prefer calls produced from inside burrows. We broadcast call stimuli to male and female music frogs while simultaneously recording electroencephalographic (EEG) signals from the telencephalon and mesencephalon. Granger causal connectivity analysis was used to elucidate functional brain networks within the time window of ERP components. The results show that calls produced from inside nests which are highly sexually attractive result in the strongest brain connections; both ascending and descending connections involving the left telencephalon were stronger in males while those in females were stronger with the right telencephalon. Our findings indicate that the frog brain allocates neural attention resources to highly attractive sounds within the window of early components of ERP, and that such processing is sexually dimorphic, presumably reflecting the different reproductive strategies of males and females. © 2018. Published by The Company of Biologists Ltd.

Mapping of interconnection of climate risks

NASA Astrophysics Data System (ADS)

Yokohata, Tokuta; Tanaka, Katsumasa; Nishina, Kazuya; Takanashi, Kiyoshi; Emori, Seita; Kiguchi, Masashi; Iseri, Yoshihiko; Honda, Yasushi; Okada, Masashi; Masaki, Yoshimitsu; Yamamoto, Akitomo; Shigemitsu, Masahito; Yoshimori, Masakazu; Sueyoshi, Tetsuo; Iwase, Kenta; Hanasaki, Naota; Ito, Akihiko; Sakurai, Gen; Iizumi, Toshichika; Oki, Taikan

2015-04-01

Anthropogenic climate change possibly causes various impacts on human society and ecosystem. Here, we call possible damages or benefits caused by the future climate change as "climate risks". Many climate risks are closely interconnected with each other by direct cause-effect relationship. In this study, the major climate risks are comprehensively summarized based on the survey of studies in the literature using IPCC AR5 etc, and their cause-effect relationship are visualized by a "network diagram". This research is conducted by the collaboration between the experts of various fields, such as water, energy, agriculture, health, society, and eco-system under the project called ICA-RUS (Integrated Climate Assessment - Risks, Uncertainties and Society). First, the climate risks are classified into 9 categories (water, energy, food, health, disaster, industry, society, ecosystem, and tipping elements). Second, researchers of these fields in our project survey the research articles, and pick up items of climate risks, and possible cause-effect relationship between the risk items. A long list of the climate risks is summarized into ~130, and that of possible cause-effect relationship between the risk items is summarized into ~300, because the network diagram would be illegible if the number of the risk items and cause-effect relationship is too large. Here, we only consider the risks that could occur if climate mitigation policies are not conducted. Finally, the chain of climate risks is visualized by creating a "network diagram" based on a network graph theory (Fruchtman & Reingold algorithm). Through the analysis of network diagram, we find that climate risks at various sectors are closely related. For example, the decrease in the precipitation under the global climate change possibly causes the decrease in river runoff and the decrease in soil moisture, which causes the changes in crop production. The changes in crop production can have an impact on society by changing the food price or food supply. Changes in river runoff can also make an impact on the hydropower efficiency. Comprehensive pictures of climate risks and their interconnections are clearly shown in a straightforward manner by the network diagram. We will have a discussion how our results can be helpful for our society to recognize the climate risk.

Visualization of the chains of risks under global climate change

NASA Astrophysics Data System (ADS)

Yokohata, T.; Nishina, K.; Takahashi, K.; Kiguchi, M.; Iseri, Y.; Sueyoshi, T.; Yoshimori, M.; Iwase, K.; Yamamoto, A.; Shigemitsu, M.; Honda, Y.; Hanasaki, N.; Masaki, Y.; Ito, A.; Iizumi, T.; Sakurai, G.; Okada, M.; Emori, S.; Oki, T.

2014-12-01

Anthropogenic climate change possibly causes various impacts on human society and ecosystem. Here, we call possible damages or benefits caused by the future climate change as "climate risks". Many climate risks are closely interconnected with each other by direct cause-effect relationship. In this study, the major climate risks are comprehensively summarized based on the survey of studies in the literature using IPCC AR5 etc, and their cause-effect relationship are visualized by a "network diagram". This research is conducted by the collaboration between the experts of various fields, such as water, energy, agriculture, health, society, and eco-system under the project called ICA-RUS (Integrated Climate Assessment - Risks, Uncertainties and Society). First, the climate risks are classified into 9 categories (water, energy, food, health, disaster, industry, society, ecosystem, and tipping elements). Second, researchers of these fields in our project survey the research articles, and pick up items of climate risks, and possible cause-effect relationship between the risk items. A long list of the climate risks is summarized into ~130, and that of possible cause-effect relationship between the risk items is summarized into ~300, because the network diagram would be illegible if the number of the risk items and cause-effect relationship is too large. Here, we only consider the risks that could occur if climate mitigation policies are not conducted. Finally, the chain of climate risks is visualized by creating a "network diagram" based on a network graph theory (Fruchtman & Reingold algorithm). Through the analysis of network diagram, we find that climate risks at various sectors are closely related. For example, the decrease in the precipitation under the global climate change possibly causes the decrease in river runoff and the decrease in soil moisture, which causes the changes in crop production. The changes in crop production can have an impact on society by changing the food price or food supply. Changes in river runoff can also make an impact on the hydropower efficiency. Comprehensive pictures of climate risks and their interconnections are clearly shown in a straightforward manner by the network diagram. We will have a discussion how our results can be helpful for our society to recognize the climate risk.

Comparison of large-scale human brain functional and anatomical networks in schizophrenia.

PubMed

Nelson, Brent G; Bassett, Danielle S; Camchong, Jazmin; Bullmore, Edward T; Lim, Kelvin O

2017-01-01

Schizophrenia is a disease with disruptions in thought, emotion, and behavior. The dysconnectivity hypothesis suggests these disruptions are due to aberrant brain connectivity. Many studies have identified connectivity differences but few have been able to unify gray and white matter findings into one model. Here we develop an extension of the Network-Based Statistic (NBS) called NBSm (Multimodal Network-based statistic) to compare functional and anatomical networks in schizophrenia. Structural, resting functional, and diffusion magnetic resonance imaging data were collected from 29 chronic patients with schizophrenia and 29 healthy controls. Images were preprocessed, and average time courses were extracted for 90 regions of interest (ROI). Functional connectivity matrices were estimated by pairwise correlations between wavelet coefficients of ROI time series. Following diffusion tractography, anatomical connectivity matrices were estimated by white matter streamline counts between each pair of ROIs. Global and regional strength were calculated for each modality. NBSm was used to find significant overlap between functional and anatomical components that distinguished health from schizophrenia. Global strength was decreased in patients in both functional and anatomical networks. Regional strength was decreased in all regions in functional networks and only one region in anatomical networks. NBSm identified a distinguishing functional component consisting of 46 nodes with 113 links (p < 0.001), a distinguishing anatomical component with 47 nodes and 50 links (p = 0.002), and a distinguishing intermodal component with 26 nodes (p < 0.001). NBSm is a powerful technique for understanding network-based group differences present in both anatomical and functional data. In light of the dysconnectivity hypothesis, these results provide compelling evidence for the presence of significant overlapping anatomical and functional disruption in people with schizophrenia.

Using CLIPS in a distributed system: The Network Control Center (NCC) expert system

NASA Technical Reports Server (NTRS)

Wannemacher, Tom

1990-01-01

This paper describes an intelligent troubleshooting system for the Help Desk domain. It was developed on an IBM-compatible 80286 PC using Microsoft C and CLIPS and an AT&T 3B2 minicomputer using the UNIFY database and a combination of shell script, C programs and SQL queries. The two computers are linked by a lan. The functions of this system are to help non-technical NCC personnel handle trouble calls, to keep a log of problem calls with complete, concise information, and to keep a historical database of problems. The database helps identify hardware and software problem areas and provides a source of new rules for the troubleshooting knowledge base.

Ubiquitous health monitoring system for multiple users using a ZigBee and WLAN dual-network.

PubMed

Cha, Yong Dae; Yoon, Gilwon

2009-11-01

A ubiquitous health monitoring system for multiple users was developed based on a ZigBee and wireless local area network (WLAN) dual-network. A compact biosignal monitoring unit (BMU) for measuring electrocardiogram (ECG), photoplethysmogram (PPG), and temperature was also developed. A single 8-bit microcontroller operated the BMU including most of digital filtering and wireless communication. The BMU with its case was reduced to 55 x 35 x 15 mm and 33 g. In routine use, vital signs of 6 bytes/sec (heart rate, temperature, pulse transit time) per each user were transmitted through a ZigBee module even though all the real-time data were recorded in a secure digital memory of the BMU. In an emergency or when need arises, a channel of a particular user was switched to another ZigBee module, called the emergency module, that sent all ECG and PPG waveforms in real time. Each emergency ZigBee module handled up to a few users. Data from multiple users were wirelessly received by the ZigBee receiver modules in a controller called ZigBee-WLAN gateway, where the ZigBee modules were connected to a WLAN module. This WLAN module sent all data wirelessly to a monitoring center. Operating the dual modes of ZigBee/WLAN utilized an advantage of ZigBee by handling multiple users with minimum power consumption, and overcame the ZigBee limitation of low data rate. This dual-network system for LAN is economically competitive and reliable.

Unlocking Proteomic Heterogeneity in Complex Diseases through Visual Analytics

PubMed Central

Bhavnani, Suresh K.; Dang, Bryant; Bellala, Gowtham; Divekar, Rohit; Visweswaran, Shyam; Brasier, Allan; Kurosky, Alex

2015-01-01

Despite years of preclinical development, biological interventions designed to treat complex diseases like asthma often fail in phase III clinical trials. These failures suggest that current methods to analyze biomedical data might be missing critical aspects of biological complexity such as the assumption that cases and controls come from homogeneous distributions. Here we discuss why and how methods from the rapidly evolving field of visual analytics can help translational teams (consisting of biologists, clinicians, and bioinformaticians) to address the challenge of modeling and inferring heterogeneity in the proteomic and phenotypic profiles of patients with complex diseases. Because a primary goal of visual analytics is to amplify the cognitive capacities of humans for detecting patterns in complex data, we begin with an overview of the cognitive foundations for the field of visual analytics. Next, we organize the primary ways in which a specific form of visual analytics called networks have been used to model and infer biological mechanisms, which help to identify the properties of networks that are particularly useful for the discovery and analysis of proteomic heterogeneity in complex diseases. We describe one such approach called subject-protein networks, and demonstrate its application on two proteomic datasets. This demonstration provides insights to help translational teams overcome theoretical, practical, and pedagogical hurdles for the widespread use of subject-protein networks for analyzing molecular heterogeneities, with the translational goal of designing biomarker-based clinical trials, and accelerating the development of personalized approaches to medicine. PMID:25684269

New Markov-Shannon Entropy models to assess connectivity quality in complex networks: from molecular to cellular pathway, Parasite-Host, Neural, Industry, and Legal-Social networks.

PubMed

Riera-Fernández, Pablo; Munteanu, Cristian R; Escobar, Manuel; Prado-Prado, Francisco; Martín-Romalde, Raquel; Pereira, David; Villalba, Karen; Duardo-Sánchez, Aliuska; González-Díaz, Humberto

2012-01-21

Graph and Complex Network theory is expanding its application to different levels of matter organization such as molecular, biological, technological, and social networks. A network is a set of items, usually called nodes, with connections between them, which are called links or edges. There are many different experimental and/or theoretical methods to assign node-node links depending on the type of network we want to construct. Unfortunately, the use of a method for experimental reevaluation of the entire network is very expensive in terms of time and resources; thus the development of cheaper theoretical methods is of major importance. In addition, different methods to link nodes in the same type of network are not totally accurate in such a way that they do not always coincide. In this sense, the development of computational methods useful to evaluate connectivity quality in complex networks (a posteriori of network assemble) is a goal of major interest. In this work, we report for the first time a new method to calculate numerical quality scores S(L(ij)) for network links L(ij) (connectivity) based on the Markov-Shannon Entropy indices of order k-th (θ(k)) for network nodes. The algorithm may be summarized as follows: (i) first, the θ(k)(j) values are calculated for all j-th nodes in a complex network already constructed; (ii) A Linear Discriminant Analysis (LDA) is used to seek a linear equation that discriminates connected or linked (L(ij)=1) pairs of nodes experimentally confirmed from non-linked ones (L(ij)=0); (iii) the new model is validated with external series of pairs of nodes; (iv) the equation obtained is used to re-evaluate the connectivity quality of the network, connecting/disconnecting nodes based on the quality scores calculated with the new connectivity function. This method was used to study different types of large networks. The linear models obtained produced the following results in terms of overall accuracy for network reconstruction: Metabolic networks (72.3%), Parasite-Host networks (93.3%), CoCoMac brain cortex co-activation network (89.6%), NW Spain fasciolosis spreading network (97.2%), Spanish financial law network (89.9%) and World trade network for Intelligent & Active Food Packaging (92.8%). In order to seek these models, we studied an average of 55,388 pairs of nodes in each model and a total of 332,326 pairs of nodes in all models. Finally, this method was used to solve a more complicated problem. A model was developed to score the connectivity quality in the Drug-Target network of US FDA approved drugs. In this last model the θ(k) values were calculated for three types of molecular networks representing different levels of organization: drug molecular graphs (atom-atom bonds), protein residue networks (amino acid interactions), and drug-target network (compound-protein binding). The overall accuracy of this model was 76.3%. This work opens a new door to the computational reevaluation of network connectivity quality (collation) for complex systems in molecular, biomedical, technological, and legal-social sciences as well as in world trade and industry. Copyright © 2011 Elsevier Ltd. All rights reserved.

Travelling Wave Pulse Coupled Oscillator (TWPCO) Using a Self-Organizing Scheme for Energy-Efficient Wireless Sensor Networks.

PubMed

Al-Mekhlafi, Zeyad Ghaleb; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Recently, Pulse Coupled Oscillator (PCO)-based travelling waves have attracted substantial attention by researchers in wireless sensor network (WSN) synchronization. Because WSNs are generally artificial occurrences that mimic natural phenomena, the PCO utilizes firefly synchronization of attracting mating partners for modelling the WSN. However, given that sensor nodes are unable to receive messages while transmitting data packets (due to deafness), the PCO model may not be efficient for sensor network modelling. To overcome this limitation, this paper proposed a new scheme called the Travelling Wave Pulse Coupled Oscillator (TWPCO). For this, the study used a self-organizing scheme for energy-efficient WSNs that adopted travelling wave biologically inspired network systems based on phase locking of the PCO model to counteract deafness. From the simulation, it was found that the proposed TWPCO scheme attained a steady state after a number of cycles. It also showed superior performance compared to other mechanisms, with a reduction in the total energy consumption of 25%. The results showed that the performance improved by 13% in terms of data gathering. Based on the results, the proposed scheme avoids the deafness that occurs in the transmit state in WSNs and increases the data collection throughout the transmission states in WSNs.

Travelling Wave Pulse Coupled Oscillator (TWPCO) Using a Self-Organizing Scheme for Energy-Efficient Wireless Sensor Networks

PubMed Central

Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Recently, Pulse Coupled Oscillator (PCO)-based travelling waves have attracted substantial attention by researchers in wireless sensor network (WSN) synchronization. Because WSNs are generally artificial occurrences that mimic natural phenomena, the PCO utilizes firefly synchronization of attracting mating partners for modelling the WSN. However, given that sensor nodes are unable to receive messages while transmitting data packets (due to deafness), the PCO model may not be efficient for sensor network modelling. To overcome this limitation, this paper proposed a new scheme called the Travelling Wave Pulse Coupled Oscillator (TWPCO). For this, the study used a self-organizing scheme for energy-efficient WSNs that adopted travelling wave biologically inspired network systems based on phase locking of the PCO model to counteract deafness. From the simulation, it was found that the proposed TWPCO scheme attained a steady state after a number of cycles. It also showed superior performance compared to other mechanisms, with a reduction in the total energy consumption of 25%. The results showed that the performance improved by 13% in terms of data gathering. Based on the results, the proposed scheme avoids the deafness that occurs in the transmit state in WSNs and increases the data collection throughout the transmission states in WSNs. PMID:28056020