LinkMind: link optimization in swarming mobile sensor networks.

Science.gov (United States)

Ngo, Trung Dung

2011-01-01

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

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

Directory of Open Access Journals (Sweden)

Trung Dung Ngo

2011-08-01

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

Cascade of links in complex networks

Energy Technology Data Exchange (ETDEWEB)

Feng, Yeqian; Sun, Bihui [Department of Management Science, School of Government, Beijing Normal University, 100875 Beijing (China); Zeng, An, E-mail: anzeng@bnu.edu.cn [School of Systems Science, Beijing Normal University, 100875 Beijing (China)

2017-01-30

Cascading failure is an important process which has been widely used to model catastrophic events such as blackouts and financial crisis in real systems. However, so far most of the studies in the literature focus on the cascading process on nodes, leaving the possibility of link cascade overlooked. In many real cases, the catastrophic events are actually formed by the successive disappearance of links. Examples exist in the financial systems where the firms and banks (i.e. nodes) still exist but many financial trades (i.e. links) are gone during the crisis, and the air transportation systems where the airports (i.e. nodes) are still functional but many airlines (i.e. links) stop operating during bad weather. In this letter, we develop a link cascade model in complex networks. With this model, we find that both artificial and real networks tend to collapse even if a few links are initially attacked. However, the link cascading process can be effectively terminated by setting a few strong nodes in the network which do not respond to any link reduction. Finally, a simulated annealing algorithm is used to optimize the location of these strong nodes, which significantly improves the robustness of the networks against the link cascade. - Highlights: • We propose a link cascade model in complex networks. • Both artificial and real networks tend to collapse even if a few links are initially attacked. • The link cascading process can be effectively terminated by setting a few strong nodes. • A simulated annealing algorithm is used to optimize the location of these strong nodes.

Cascade of links in complex networks

International Nuclear Information System (INIS)

Feng, Yeqian; Sun, Bihui; Zeng, An

2017-01-01

Cascading failure is an important process which has been widely used to model catastrophic events such as blackouts and financial crisis in real systems. However, so far most of the studies in the literature focus on the cascading process on nodes, leaving the possibility of link cascade overlooked. In many real cases, the catastrophic events are actually formed by the successive disappearance of links. Examples exist in the financial systems where the firms and banks (i.e. nodes) still exist but many financial trades (i.e. links) are gone during the crisis, and the air transportation systems where the airports (i.e. nodes) are still functional but many airlines (i.e. links) stop operating during bad weather. In this letter, we develop a link cascade model in complex networks. With this model, we find that both artificial and real networks tend to collapse even if a few links are initially attacked. However, the link cascading process can be effectively terminated by setting a few strong nodes in the network which do not respond to any link reduction. Finally, a simulated annealing algorithm is used to optimize the location of these strong nodes, which significantly improves the robustness of the networks against the link cascade. - Highlights: • We propose a link cascade model in complex networks. • Both artificial and real networks tend to collapse even if a few links are initially attacked. • The link cascading process can be effectively terminated by setting a few strong nodes. • A simulated annealing algorithm is used to optimize the location of these strong nodes.

Earth-Space Link Attenuation Estimation via Ground Radar Kdp

Science.gov (United States)

Bolen, Steven M.; Benjamin, Andrew L.; Chandrasekar, V.

2003-01-01

A method of predicting attenuation on microwave Earth/spacecraft communication links, over wide areas and under various atmospheric conditions, has been developed. In the area around the ground station locations, a nearly horizontally aimed polarimetric S-band ground radar measures the specific differential phase (Kdp) along the Earth-space path. The specific attenuation along a path of interest is then computed by use of a theoretical model of the relationship between the measured S-band specific differential phase and the specific attenuation at the frequency to be used on the communication link. The model includes effects of rain, wet ice, and other forms of precipitation. The attenuation on the path of interest is then computed by integrating the specific attenuation over the length of the path. This method can be used to determine statistics of signal degradation on Earth/spacecraft communication links. It can also be used to obtain real-time estimates of attenuation along multiple Earth/spacecraft links that are parts of a communication network operating within the radar coverage area, thereby enabling better management of the network through appropriate dynamic routing along the best combination of links.

Cross-linked structure of network evolution

International Nuclear Information System (INIS)

Bassett, Danielle S.; Wymbs, Nicholas F.; Grafton, Scott T.; Porter, Mason A.; Mucha, Peter J.

2014-01-01

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks

Cross-linked structure of network evolution

Energy Technology Data Exchange (ETDEWEB)

Bassett, Danielle S., E-mail: dsb@seas.upenn.edu [Department of Bioengineering, University of Pennsylvania, Philadelphia, Pennsylvania 19104 (United States); Department of Physics, University of California, Santa Barbara, California 93106 (United States); Sage Center for the Study of the Mind, University of California, Santa Barbara, California 93106 (United States); Wymbs, Nicholas F.; Grafton, Scott T. [Department of Psychology and UCSB Brain Imaging Center, University of California, Santa Barbara, California 93106 (United States); Porter, Mason A. [Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom); CABDyN Complexity Centre, University of Oxford, Oxford, OX1 1HP (United Kingdom); Mucha, Peter J. [Carolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599 (United States); Department of Applied Physical Sciences, University of North Carolina, Chapel Hill, North Carolina 27599 (United States)

2014-03-15

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.

Coarse-grain bandwidth estimation techniques for large-scale network

Science.gov (United States)

Cheung, Kar-Ming; Jennings, E.

In this paper, we describe a top-down analysis and simulation approach to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. We use these techniques to estimate the wide area network (WAN) bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network.

Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks.

Science.gov (United States)

Shi, Chaoyang; Chen, Bi Yu; Lam, William H K; Li, Qingquan

2017-12-06

Travel times in congested urban road networks are highly stochastic. Provision of travel time distribution information, including both mean and variance, can be very useful for travelers to make reliable path choice decisions to ensure higher probability of on-time arrival. To this end, a heterogeneous data fusion method is proposed to estimate travel time distributions by fusing heterogeneous data from point and interval detectors. In the proposed method, link travel time distributions are first estimated from point detector observations. The travel time distributions of links without point detectors are imputed based on their spatial correlations with links that have point detectors. The estimated link travel time distributions are then fused with path travel time distributions obtained from the interval detectors using Dempster-Shafer evidence theory. Based on fused path travel time distribution, an optimization technique is further introduced to update link travel time distributions and their spatial correlations. A case study was performed using real-world data from Hong Kong and showed that the proposed method obtained accurate and robust estimations of link and path travel time distributions in congested road networks.

Capacity utilization in resilient wavelength-routed optical networks using link restoration

DEFF Research Database (Denmark)

Limal, Emmanuel; Danielsen, Søren Lykke; Stubkjær, Kristian

1998-01-01

The construction of resilient wavelength-routed optical networks has attracted much interest. Many network topologies, path and wavelength assignment strategies have been proposed. The assessment of network strategies is very complex and comparison is difficult. Here, we take a novel analytical...... approach in estimating the maximum capacity utilization that is possible in wavelength-division multiplexing (WDM) networks that are resilient against single link failures. The results apply to general network topologies and can therefore be used to evaluate the performance of more specific wavelength...

Coarse-Grain Bandwidth Estimation Techniques for Large-Scale Space Network

Science.gov (United States)

Cheung, Kar-Ming; Jennings, Esther

2013-01-01

In this paper, we describe a top-down analysis and simulation approach to size the bandwidths of a store-andforward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. We use these techniques to estimate the wide area network (WAN) bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network.

Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks

Directory of Open Access Journals (Sweden)

Chaoyang Shi

2017-12-01

Full Text Available Travel times in congested urban road networks are highly stochastic. Provision of travel time distribution information, including both mean and variance, can be very useful for travelers to make reliable path choice decisions to ensure higher probability of on-time arrival. To this end, a heterogeneous data fusion method is proposed to estimate travel time distributions by fusing heterogeneous data from point and interval detectors. In the proposed method, link travel time distributions are first estimated from point detector observations. The travel time distributions of links without point detectors are imputed based on their spatial correlations with links that have point detectors. The estimated link travel time distributions are then fused with path travel time distributions obtained from the interval detectors using Dempster-Shafer evidence theory. Based on fused path travel time distribution, an optimization technique is further introduced to update link travel time distributions and their spatial correlations. A case study was performed using real-world data from Hong Kong and showed that the proposed method obtained accurate and robust estimations of link and path travel time distributions in congested road networks.

Porous Cross-Linked Polyimide-Urea Networks

Science.gov (United States)

Meador, Mary Ann B. (Inventor); Nguyen, Baochau N. (Inventor)

2015-01-01

Porous cross-linked polyimide-urea networks are provided. The networks comprise a subunit comprising two anhydride end-capped polyamic acid oligomers in direct connection via a urea linkage. The oligomers (a) each comprise a repeating unit of a dianhydride and a diamine and a terminal anhydride group and (b) are formulated with 2 to 15 of the repeating units. The subunit was formed by reaction of the diamine and a diisocyanate to form a diamine-urea linkage-diamine group, followed by reaction of the diamine-urea linkage-diamine group with the dianhydride and the diamine to form the subunit. The subunit has been cross-linked via a cross-linking agent, comprising three or more amine groups, at a balanced stoichiometry of the amine groups to the terminal anhydride groups. The subunit has been chemically imidized to yield the porous cross-linked polyimide-urea network. Also provided are wet gels, aerogels, and thin films comprising the networks, and methods of making the networks.

Heuristic Decision Making in Network Linking

NARCIS (Netherlands)

M.J.W. Harmsen - Van Hout (Marjolein); B.G.C. Dellaert (Benedict); P.J.J. Herings (Jean-Jacques)

2015-01-01

textabstractNetwork formation among individuals constitutes an important part of many OR processes, but relatively little is known about how individuals make their linking decisions in networks. This article provides an investigation of heuristic effects in individual linking decisions for

Link prediction in multiplex online social networks

Science.gov (United States)

Jalili, Mahdi; Orouskhani, Yasin; Asgari, Milad; Alipourfard, Nazanin; Perc, Matjaž

2017-02-01

Online social networks play a major role in modern societies, and they have shaped the way social relationships evolve. Link prediction in social networks has many potential applications such as recommending new items to users, friendship suggestion and discovering spurious connections. Many real social networks evolve the connections in multiple layers (e.g. multiple social networking platforms). In this article, we study the link prediction problem in multiplex networks. As an example, we consider a multiplex network of Twitter (as a microblogging service) and Foursquare (as a location-based social network). We consider social networks of the same users in these two platforms and develop a meta-path-based algorithm for predicting the links. The connectivity information of the two layers is used to predict the links in Foursquare network. Three classical classifiers (naive Bayes, support vector machines (SVM) and K-nearest neighbour) are used for the classification task. Although the networks are not highly correlated in the layers, our experiments show that including the cross-layer information significantly improves the prediction performance. The SVM classifier results in the best performance with an average accuracy of 89%.

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

Science.gov (United States)

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.

Utility-Based Link Recommendation in Social Networks

Science.gov (United States)

Li, Zhepeng

2013-01-01

Link recommendation, which suggests links to connect currently unlinked users, is a key functionality offered by major online social networking platforms. Salient examples of link recommendation include "people you may know"' on Facebook and "who to follow" on Twitter. A social networking platform has two types of stakeholder:…

Link Prediction in Social Networks: the State-of-the-Art

OpenAIRE

Wang, Peng; Xu, Baowen; Wu, Yurong; Zhou, Xiaoyu

2014-01-01

In social networks, link prediction predicts missing links in current networks and new or dissolution links in future networks, is important for mining and analyzing the evolution of social networks. In the past decade, many works have been done about the link prediction in social networks. The goal of this paper is to comprehensively review, analyze and discuss the state-of-the-art of the link prediction in social networks. A systematical category for link prediction techniques and problems ...

Assessing the weather monitoring capabilities of cellular microwave link networks

Science.gov (United States)

Fencl, Martin; Vrzba, Miroslav; Rieckermann, Jörg; Bareš, Vojtěch

2016-04-01

Using of microwave links for rainfall monitoring was suggested already by (Atlas and Ulbrich, 1977). However, this technique attracted broader attention of scientific community only in the recent decade, with the extensive growth of cellular microwave link (CML) networks, which form the backbone of today's cellular telecommunication infrastructure. Several studies have already shown that CMLs can be conveniently used as weather sensors and have potential to provide near-ground path-integrated observations of rainfall but also humidity or fog. However, although research is still focusing on algorithms to improve the weather sensing capabilities (Fencl et al., 2015), it is not clear how to convince cellular operators to provide the power levels of their network. One step in this direction is to show in which regions or municipalities the networks are sufficiently dense to provide/develop good services. In this contribution we suggest a standardized approach to evaluate CML networks in terms of rainfall observation and to identify suitable regions for CML rainfall monitoring. We estimate precision of single CML based on its sensitivity to rainfall, i.e. as a function of frequency, polarization and path length. Capability of a network to capture rainfall spatial patterns is estimated from the CML coverage and path lengths considering that single CML provides path-integrated rain rates. We also search for suitable predictors for regions where no network topologies are available. We test our approach on several European networks and discuss the results. Our results show that CMLs are very dense in urban areas (> 1 CML/km2), but less in rural areas (online tool. In summary, our results demonstrate that CML represent promising environmental observation network, suitable especially for urban rainfall monitoring. The developed approach integrated into an open source online tool can be conveniently used e.g. by local operators or authorities to evaluate the suitability of

Experimental FSO network availability estimation using interactive fog condition monitoring

Science.gov (United States)

Turán, Ján.; Ovseník, Łuboš

2016-12-01

Free Space Optics (FSO) is a license free Line of Sight (LOS) telecommunication technology which offers full duplex connectivity. FSO uses infrared beams of light to provide optical broadband connection and it can be installed literally in a few hours. Data rates go through from several hundreds of Mb/s to several Gb/s and range is from several 100 m up to several km. FSO link advantages: Easy connection establishment, License free communication, No excavation are needed, Highly secure and safe, Allows through window connectivity and single customer service and Compliments fiber by accelerating the first and last mile. FSO link disadvantages: Transmission media is air, Weather and climate dependence, Attenuation due to rain, snow and fog, Scattering of laser beam, Absorption of laser beam, Building motion and Air pollution. In this paper FSO availability evaluation is based on long term measured data from Fog sensor developed and installed at TUKE experimental FSO network in TUKE campus, Košice, Slovakia. Our FSO experimental network has three links with different physical distances between each FSO heads. Weather conditions have a tremendous impact on FSO operation in terms of FSO availability. FSO link availability is the percentage of time over a year that the FSO link will be operational. It is necessary to evaluate the climate and weather at the actual geographical location where FSO link is going to be mounted. It is important to determine the impact of a light scattering, absorption, turbulence and receiving optical power at the particular FSO link. Visibility has one of the most critical influences on the quality of an FSO optical transmission channel. FSO link availability is usually estimated using visibility information collected from nearby airport weather stations. Raw data from fog sensor (Fog Density, Relative Humidity, Temperature measured at each ms) are collected and processed by FSO Simulator software package developed at our Department. Based

Estimation of global network statistics from incomplete data.

Directory of Open Access Journals (Sweden)

Catherine A Bliss

Full Text Available Complex networks underlie an enormous variety of social, biological, physical, and virtual systems. A profound complication for the science of complex networks is that in most cases, observing all nodes and all network interactions is impossible. Previous work addressing the impacts of partial network data is surprisingly limited, focuses primarily on missing nodes, and suggests that network statistics derived from subsampled data are not suitable estimators for the same network statistics describing the overall network topology. We generate scaling methods to predict true network statistics, including the degree distribution, from only partial knowledge of nodes, links, or weights. Our methods are transparent and do not assume a known generating process for the network, thus enabling prediction of network statistics for a wide variety of applications. We validate analytical results on four simulated network classes and empirical data sets of various sizes. We perform subsampling experiments by varying proportions of sampled data and demonstrate that our scaling methods can provide very good estimates of true network statistics while acknowledging limits. Lastly, we apply our techniques to a set of rich and evolving large-scale social networks, Twitter reply networks. Based on 100 million tweets, we use our scaling techniques to propose a statistical characterization of the Twitter Interactome from September 2008 to November 2008. Our treatment allows us to find support for Dunbar's hypothesis in detecting an upper threshold for the number of active social contacts that individuals maintain over the course of one week.

The Algorithm of Link Prediction on Social Network

Directory of Open Access Journals (Sweden)

Liyan Dong

2013-01-01

Full Text Available At present, most link prediction algorithms are based on the similarity between two entities. Social network topology information is one of the main sources to design the similarity function between entities. But the existing link prediction algorithms do not apply the network topology information sufficiently. For lack of traditional link prediction algorithms, we propose two improved algorithms: CNGF algorithm based on local information and KatzGF algorithm based on global information network. For the defect of the stationary of social network, we also provide the link prediction algorithm based on nodes multiple attributes information. Finally, we verified these algorithms on DBLP data set, and the experimental results show that the performance of the improved algorithm is superior to that of the traditional link prediction algorithm.

Scaling of Airborne Ad-hoc Network Metrics with Link Range and Satellite Connectivity

Directory of Open Access Journals (Sweden)

Kai-Daniel BÜCHTER

2018-06-01

Full Text Available In this contribution, large-scale commercial aeronautical ad-hoc networks are evaluated. The investigation is based on a simulation environment with input from 2016 flight schedule and aircraft performance databases for flight movement modelling, along with a defined infrastructure of ground gateways and communication satellites. A cluster-based algorithm is used to build the communication network topology between aircraft. Cloud top pressure data can be considered to estimate cloud height and evaluate the impact of link obscuration on network availability, assuming a free-space optics-based communication network. The effects of communication range, satellite availability, fleet equipage ratio and clouds are discussed. It is shown how network reach and performance can be enhanced by adding taps to the network in the form of high-speed satellite links. The effect of adding these is two-fold: firstly, network reach can be increased by connecting remote aircraft clusters. Secondly, larger clusters can effectively be split into smaller ones in order to increase performance especially with regard to hop count and available overall capacity. In a realistic scenario concerning communication range and with moderate numbers of high-speed satellite terminals, on average, 78% of all widebody aircraft can be reached. With clouds considered (assuming laser links, this number reduces by 10%.

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

Directory of Open Access Journals (Sweden)

WenJun Zhang

2016-06-01

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

Effects of multi-state links in network community detection

International Nuclear Information System (INIS)

Rocco, Claudio M.; Moronta, José; Ramirez-Marquez, José E.; Barker, Kash

2017-01-01

A community is defined as a group of nodes of a network that are densely interconnected with each other but only sparsely connected with the rest of the network. The set of communities (i.e., the network partition) and their inter-community links could be derived using special algorithms account for the topology of the network and, in certain cases, the possible weights associated to the links. In general, the set of weights represents some characteristic as capacity, flow and reliability, among others. The effects of considering weights could be translated to obtain a different partition. In many real situations, particularly when modeling infrastructure systems, networks must be modeled as multi-state networks (e.g., electric power networks). In such networks, each link is characterized by a vector of known random capacities (i.e., the weight on each link could vary according to a known probability distribution). In this paper a simple Monte Carlo approach is proposed to evaluate the effects of multi-state links on community detection as well as on the performance of the network. The approach is illustrated with the topology of an electric power system. - Highlights: • Identify network communities when considering multi-state links. • Identified how effects of considering weights translate to different partition. • Identified importance of Inter-Community Links and changes with respect to community. • Preamble to performing a resilience assessment able to mimic the evolution of the state of each community.

Effectiveness of link prediction for face-to-face behavioral networks.

Science.gov (United States)

Tsugawa, Sho; Ohsaki, Hiroyuki

2013-01-01

Research on link prediction for social networks has been actively pursued. In link prediction for a given social network obtained from time-windowed observation, new link formation in the network is predicted from the topology of the obtained network. In contrast, recent advances in sensing technology have made it possible to obtain face-to-face behavioral networks, which are social networks representing face-to-face interactions among people. However, the effectiveness of link prediction techniques for face-to-face behavioral networks has not yet been explored in depth. To clarify this point, here we investigate the accuracy of conventional link prediction techniques for networks obtained from the history of face-to-face interactions among participants at an academic conference. Our findings were (1) that conventional link prediction techniques predict new link formation with a precision of 0.30-0.45 and a recall of 0.10-0.20, (2) that prolonged observation of social networks often degrades the prediction accuracy, (3) that the proposed decaying weight method leads to higher prediction accuracy than can be achieved by observing all records of communication and simply using them unmodified, and (4) that the prediction accuracy for face-to-face behavioral networks is relatively high compared to that for non-social networks, but not as high as for other types of social networks.

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

Science.gov (United States)

Cheung, Kar-Ming; Jennings, Esther H.; Sergui, John S.

2013-01-01

A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of

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

Directory of Open Access Journals (Sweden)

Ed Manley

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

Predicting Hidden Links in Supply Networks

Directory of Open Access Journals (Sweden)

A. Brintrup

2018-01-01

Full Text Available Manufacturing companies often lack visibility of the procurement interdependencies between the suppliers within their supply network. However, knowledge of these interdependencies is useful to plan for potential operational disruptions. In this paper, we develop the Supply Network Link Predictor (SNLP method to infer supplier interdependencies using the manufacturer’s incomplete knowledge of the network. SNLP uses topological data to extract relational features from the known network to train a classifier for predicting potential links. Using a test case from the automotive industry, four features are extracted: (i number of existing supplier links, (ii overlaps between supplier product portfolios, (iii product outsourcing associations, and (iv likelihood of buyers purchasing from two suppliers together. Naïve Bayes and Logistic Regression are then employed to predict whether these features can help predict interdependencies between two suppliers. Our results show that these features can indeed be used to predict interdependencies in the network and that predictive accuracy is maximised by (i and (iii. The findings give rise to the exciting possibility of using data analytics for improving supply chain visibility. We then proceed to discuss to what extent such approaches can be adopted and their limitations, highlighting next steps for future work in this area.

Identification of hybrid node and link communities in complex networks.

Science.gov (United States)

He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

2015-03-02

Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.

Identification of hybrid node and link communities in complex networks

Science.gov (United States)

He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

2015-03-01

Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.

Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

Science.gov (United States)

Fathpour, Nanaz; Hadaegh, Fred Y.; Mesbahi, Mehran; Rahmani, Amirreza

2011-01-01

Spacecraft formation flying involves the coordination of states among multiple spacecraft through relative sensing, inter-spacecraft communication, and control. Most existing formation-flying estimation algorithms can only be supported via highly centralized, all-to-all, static relative sensing. New algorithms are proposed that are scalable, modular, and robust to variations in the topology and link characteristics of the formation exchange network. These distributed algorithms rely on a local information exchange network, relaxing the assumptions on existing algorithms. Distributed space systems rely on a signal transmission network among multiple spacecraft for their operation. Control and coordination among multiple spacecraft in a formation is facilitated via a network of relative sensing and interspacecraft communications. Guidance, navigation, and control rely on the sensing network. This network becomes more complex the more spacecraft are added, or as mission requirements become more complex. The observability of a formation state was observed by a set of local observations from a particular node in the formation. Formation observability can be parameterized in terms of the matrices appearing in the formation dynamics and observation matrices. An agreement protocol was used as a mechanism for observing formation states from local measurements. An agreement protocol is essentially an unforced dynamic system whose trajectory is governed by the interconnection geometry and initial condition of each node, with a goal of reaching a common value of interest. The observability of the interconnected system depends on the geometry of the network, as well as the position of the observer relative to the topology. For the first time, critical GN&C (guidance, navigation, and control estimation) subsystems are synthesized by bringing the contribution of the spacecraft information-exchange network to the forefront of algorithmic analysis and design. The result is a

Dual adjacency matrix : exploring link groups in dense networks

NARCIS (Netherlands)

Dinkla, K.; Henry Riche, N.; Westenberg, M.A.

2015-01-01

Node grouping is a common way of adding structure and information to networks that aids their interpretation. However, certain networks benefit from the grouping of links instead of nodes. Link communities, for example, are a form of link groups that describe high-quality overlapping node

Reactor building indoor wireless network channel quality estimation using RSSI measurement of wireless sensor network

International Nuclear Information System (INIS)

Merat, S.

2008-01-01

Expanding wireless communication network reception inside reactor buildings (RB) and service wings (SW) has always been a technical challenge for operations service team. This is driven by the volume of metal equipment inside the Reactor Buildings (RB) that blocks and somehow shields the signal throughout the link. In this study, to improve wireless reception inside the Reactor Building (RB), an experimental model using indoor localization mesh based on IEEE 802.15 is developed to implement a wireless sensor network. This experimental model estimates the distance between different nodes by measuring the RSSI (Received Signal Strength Indicator). Then by using triangulation and RSSI measurement, the validity of the estimation techniques is verified to simulate the physical environmental obstacles, which block the signal transmission. (author)

Reactor building indoor wireless network channel quality estimation using RSSI measurement of wireless sensor network

Energy Technology Data Exchange (ETDEWEB)

Merat, S. [Wardrop Engineering Inc., Toronto, Ontario (Canada)

2008-07-01

Expanding wireless communication network reception inside reactor buildings (RB) and service wings (SW) has always been a technical challenge for operations service team. This is driven by the volume of metal equipment inside the Reactor Buildings (RB) that blocks and somehow shields the signal throughout the link. In this study, to improve wireless reception inside the Reactor Building (RB), an experimental model using indoor localization mesh based on IEEE 802.15 is developed to implement a wireless sensor network. This experimental model estimates the distance between different nodes by measuring the RSSI (Received Signal Strength Indicator). Then by using triangulation and RSSI measurement, the validity of the estimation techniques is verified to simulate the physical environmental obstacles, which block the signal transmission. (author)

Transmission Delay Based Control over Networks with Wireless Links

Institute of Scientific and Technical Information of China (English)

无

2002-01-01

To achieve the mobility of computers during communication, the TCP connections between fixed host and mobile host may often traverse wired and wireless networks, and the recovery of losses due to wireless transmission error is much different from congestion control. The paper analyzes the side effect of RTT estimation while making the TCP source to handle congestion and wireless error losses properly. Then present a strategy using information feedback by the last hop acknowledgement and monitoring the queuing level of the wired bottleneck link by calculating the changes in transmission delay along the path. With the identification of the early stage of congestion, it can respond to wired congestion quickly while keeping wireless link more reliable, and make TCP react to the different packets losses more appropriately.

Computer simulation of randomly cross-linked polymer networks

International Nuclear Information System (INIS)

Williams, Timothy Philip

2002-01-01

In this work, Monte Carlo and Stochastic Dynamics computer simulations of mesoscale model randomly cross-linked networks were undertaken. Task parallel implementations of the lattice Monte Carlo Bond Fluctuation model and Kremer-Grest Stochastic Dynamics bead-spring continuum model were designed and used for this purpose. Lattice and continuum precursor melt systems were prepared and then cross-linked to varying degrees. The resultant networks were used to study structural changes during deformation and relaxation dynamics. The effects of a random network topology featuring a polydisperse distribution of strand lengths and an abundance of pendant chain ends, were qualitatively compared to recent published work. A preliminary investigation into the effects of temperature on the structural and dynamical properties was also undertaken. Structural changes during isotropic swelling and uniaxial deformation, revealed a pronounced non-affine deformation dependant on the degree of cross-linking. Fractal heterogeneities were observed in the swollen model networks and were analysed by considering constituent substructures of varying size. The network connectivity determined the length scales at which the majority of the substructure unfolding process occurred. Simulated stress-strain curves and diffraction patterns for uniaxially deformed swollen networks, were found to be consistent with experimental findings. Analysis of the relaxation dynamics of various network components revealed a dramatic slowdown due to the network connectivity. The cross-link junction spatial fluctuations for networks close to the sol-gel threshold, were observed to be at least comparable with the phantom network prediction. The dangling chain ends were found to display the largest characteristic relaxation time. (author)

Retrieval algorithm for rainfall mapping from microwave links in a cellular communication network

NARCIS (Netherlands)

Overeem, Aart; Leijnse, Hidde; Uijlenhoet, Remko

2016-01-01

Microwave links in commercial cellular communication networks hold a promise for areal rainfall monitoring and could complement rainfall estimates from ground-based weather radars, rain gauges, and satellites. It has been shown that country-wide (≈ 35 500 km²) 15 min rainfall maps can

Meta-path based heterogeneous combat network link prediction

Science.gov (United States)

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.

Spin networks, quantum automata and link invariants

International Nuclear Information System (INIS)

Garnerone, Silvano; Marzuoli, Annalisa; Rasetti, Mario

2006-01-01

The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFT). More precisely, when working with purely discrete unitary gates, the simulator is naturally modelled as families of quantum automata which in turn represent discrete versions of topological quantum computation models. Such a quantum combinatorial scheme, which essentially encodes SU(2) Racah-Wigner algebra and its braided counterpart, is particularly suitable to address problems in topology and group theory and we discuss here a finite states-quantum automaton able to accept the language of braid group in view of applications to the problem of estimating link polynomials in Chern-Simons field theory

Link overlap, viability, and mutual percolation in multiplex networks

International Nuclear Information System (INIS)

Min, Byungjoon; Lee, Sangchul; Lee, Kyu-Min; Goh, K.-I.

2015-01-01

Many real-world complex systems are best modeled by multiplex networks. The multiplexity has proved to have broad impact on the system’s structure and function. Most theoretical studies on multiplex networks to date, however, have largely ignored the effect of the link overlap across layers despite strong empirical evidences for its significance. In this article, we investigate the effect of the link overlap in the viability of multiplex networks, both analytically and numerically. After a short recap of the original multiplex viability study, the distinctive role of overlapping links in viability and mutual connectivity is emphasized and exploited for setting up a proper analytic framework. A rich phase diagram for viability is obtained and greatly diversified patterns of hysteretic behavior in viability are observed in the presence of link overlap. Mutual percolation with link overlap is revisited as a limit of multiplex viability problem, and the controversy between existing results is clarified. The distinctive role of overlapping links is further demonstrated by the different responses of networks under random removals of overlapping and non-overlapping links, respectively, as well as under several link-removal strategies. Our results show that the link overlap facilitates the viability and mutual percolation; at the same time, the presence of link overlap poses a challenge in analytical approaches to the problem

Congested Link Inference Algorithms in Dynamic Routing IP Network

Directory of Open Access Journals (Sweden)

Yu Chen

2017-01-01

Full Text Available The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP and Rest Bayesian Network Model (RBNM, we proposed an Improved CLINK (ICLINK algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

Deflating link buffers in a wireless mesh network

KAUST Repository

Jamshaid, Kamran; Shihada, Basem; Showail, Ahmad; Levis, Philip

2014-01-01

We analyze the problem of buffer sizing for backlogged TCP flows in 802.11-based wireless mesh networks. Our objective is to maintain high network utilization while providing low queueing delays. Unlike wired networks where a single link buffer feeds a bottleneck link, the radio spectral resource in a mesh network is shared among a set of contending mesh routers. We account for this by formulating the buffer size problem as sizing a collective buffer distributed over a set of interfering nodes. In this paper we propose mechanisms for sizing and distributing this collective buffer among the mesh nodes constituting the network bottleneck. Our mechanism factors in the network topology and wireless link rates, improving on pre-set buffer allocations that cannot optimally work across the range of configurations achievable with 802.11 radios. We evaluate our mechanisms using simulations as well as experiments on a testbed. Our results show that we can reduce the RTT of a flow by 6× or more, at the cost of less than 10% drop in end-to-end flow throughput.

Deflating link buffers in a wireless mesh network

KAUST Repository

Jamshaid, Kamran

2014-05-01

We analyze the problem of buffer sizing for backlogged TCP flows in 802.11-based wireless mesh networks. Our objective is to maintain high network utilization while providing low queueing delays. Unlike wired networks where a single link buffer feeds a bottleneck link, the radio spectral resource in a mesh network is shared among a set of contending mesh routers. We account for this by formulating the buffer size problem as sizing a collective buffer distributed over a set of interfering nodes. In this paper we propose mechanisms for sizing and distributing this collective buffer among the mesh nodes constituting the network bottleneck. Our mechanism factors in the network topology and wireless link rates, improving on pre-set buffer allocations that cannot optimally work across the range of configurations achievable with 802.11 radios. We evaluate our mechanisms using simulations as well as experiments on a testbed. Our results show that we can reduce the RTT of a flow by 6× or more, at the cost of less than 10% drop in end-to-end flow throughput.

A new mutually reinforcing network node and link ranking algorithm.

Science.gov (United States)

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E

2015-10-23

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity.

A new mutually reinforcing network node and link ranking algorithm

Science.gov (United States)

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

2015-10-01

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity.

A new mutually reinforcing network node and link ranking algorithm

Science.gov (United States)

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

2015-01-01

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity. PMID:26492958

Flood quantile estimation at ungauged sites by Bayesian networks

Science.gov (United States)

Mediero, L.; Santillán, D.; Garrote, L.

2012-04-01

Estimating flood quantiles at a site for which no observed measurements are available is essential for water resources planning and management. Ungauged sites have no observations about the magnitude of floods, but some site and basin characteristics are known. The most common technique used is the multiple regression analysis, which relates physical and climatic basin characteristic to flood quantiles. Regression equations are fitted from flood frequency data and basin characteristics at gauged sites. Regression equations are a rigid technique that assumes linear relationships between variables and cannot take the measurement errors into account. In addition, the prediction intervals are estimated in a very simplistic way from the variance of the residuals in the estimated model. Bayesian networks are a probabilistic computational structure taken from the field of Artificial Intelligence, which have been widely and successfully applied to many scientific fields like medicine and informatics, but application to the field of hydrology is recent. Bayesian networks infer the joint probability distribution of several related variables from observations through nodes, which represent random variables, and links, which represent causal dependencies between them. A Bayesian network is more flexible than regression equations, as they capture non-linear relationships between variables. In addition, the probabilistic nature of Bayesian networks allows taking the different sources of estimation uncertainty into account, as they give a probability distribution as result. A homogeneous region in the Tagus Basin was selected as case study. A regression equation was fitted taking the basin area, the annual maximum 24-hour rainfall for a given recurrence interval and the mean height as explanatory variables. Flood quantiles at ungauged sites were estimated by Bayesian networks. Bayesian networks need to be learnt from a huge enough data set. As observational data are reduced, a

Impact of Dual-Link Failures on Impairment-Aware Routed Networks

DEFF Research Database (Denmark)

Georgakilas, Konstantinos N; Katrinis, Kostas; Tzanakaki, Anna

2010-01-01

This paper evaluates the impact of dual-link failures on single-link failure resilient networks, while physical layer constraints are taken into consideration during demand routing, as dual link failures and equivalent situations appear to be quite probable in core optical networks. In particular...

Mining Heterogeneous Information Networks by Exploring the Power of Links

Science.gov (United States)

Han, Jiawei

Knowledge is power but for interrelated data, knowledge is often hidden in massive links in heterogeneous information networks. We explore the power of links at mining heterogeneous information networks with several interesting tasks, including link-based object distinction, veracity analysis, multidimensional online analytical processing of heterogeneous information networks, and rank-based clustering. Some recent results of our research that explore the crucial information hidden in links will be introduced, including (1) Distinct for object distinction analysis, (2) TruthFinder for veracity analysis, (3) Infonet-OLAP for online analytical processing of information networks, and (4) RankClus for integrated ranking-based clustering. We also discuss some of our on-going studies in this direction.

Efficient network disintegration under incomplete information: the comic effect of link prediction

Science.gov (United States)

Tan, Suo-Yi; Wu, Jun; Lü, Linyuan; Li, Meng-Jun; Lu, Xin

2016-01-01

The study of network disintegration has attracted much attention due to its wide applications, including suppressing the epidemic spreading, destabilizing terrorist network, preventing financial contagion, controlling the rumor diffusion and perturbing cancer networks. The crux of this matter is to find the critical nodes whose removal will lead to network collapse. This paper studies the disintegration of networks with incomplete link information. An effective method is proposed to find the critical nodes by the assistance of link prediction techniques. Extensive experiments in both synthetic and real networks suggest that, by using link prediction method to recover partial missing links in advance, the method can largely improve the network disintegration performance. Besides, to our surprise, we find that when the size of missing information is relatively small, our method even outperforms than the results based on complete information. We refer to this phenomenon as the “comic effect” of link prediction, which means that the network is reshaped through the addition of some links that identified by link prediction algorithms, and the reshaped network is like an exaggerated but characteristic comic of the original one, where the important parts are emphasized. PMID:26960247

Efficient network disintegration under incomplete information: the comic effect of link prediction

Science.gov (United States)

Tan, Suo-Yi; Wu, Jun; Lü, Linyuan; Li, Meng-Jun; Lu, Xin

2016-03-01

The study of network disintegration has attracted much attention due to its wide applications, including suppressing the epidemic spreading, destabilizing terrorist network, preventing financial contagion, controlling the rumor diffusion and perturbing cancer networks. The crux of this matter is to find the critical nodes whose removal will lead to network collapse. This paper studies the disintegration of networks with incomplete link information. An effective method is proposed to find the critical nodes by the assistance of link prediction techniques. Extensive experiments in both synthetic and real networks suggest that, by using link prediction method to recover partial missing links in advance, the method can largely improve the network disintegration performance. Besides, to our surprise, we find that when the size of missing information is relatively small, our method even outperforms than the results based on complete information. We refer to this phenomenon as the “comic effect” of link prediction, which means that the network is reshaped through the addition of some links that identified by link prediction algorithms, and the reshaped network is like an exaggerated but characteristic comic of the original one, where the important parts are emphasized.

Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks

Science.gov (United States)

Ma, Xiaoke; Sun, Penggang; Wang, Yu

2018-04-01

Many networks derived from society and nature are temporal and incomplete. The temporal link prediction problem in networks is to predict links at time T + 1 based on a given temporal network from time 1 to T, which is essential to important applications. The current algorithms either predict the temporal links by collapsing the dynamic networks or collapsing features derived from each network, which are criticized for ignoring the connection among slices. to overcome the issue, we propose a novel graph regularized nonnegative matrix factorization algorithm (GrNMF) for the temporal link prediction problem without collapsing the dynamic networks. To obtain the feature for each network from 1 to t, GrNMF factorizes the matrix associated with networks by setting the rest networks as regularization, which provides a better way to characterize the topological information of temporal links. Then, the GrNMF algorithm collapses the feature matrices to predict temporal links. Compared with state-of-the-art methods, the proposed algorithm exhibits significantly improved accuracy by avoiding the collapse of temporal networks. Experimental results of a number of artificial and real temporal networks illustrate that the proposed method is not only more accurate but also more robust than state-of-the-art approaches.

Constrained Active Learning for Anchor Link Prediction Across Multiple Heterogeneous Social Networks.

Science.gov (United States)

Zhu, Junxing; Zhang, Jiawei; Wu, Quanyuan; Jia, Yan; Zhou, Bin; Wei, Xiaokai; Yu, Philip S

2017-08-03

Nowadays, people are usually involved in multiple heterogeneous social networks simultaneously. Discovering the anchor links between the accounts owned by the same users across different social networks is crucial for many important inter-network applications, e.g., cross-network link transfer and cross-network recommendation. Many different supervised models have been proposed to predict anchor links so far, but they are effective only when the labeled anchor links are abundant. However, in real scenarios, such a requirement can hardly be met and most anchor links are unlabeled, since manually labeling the inter-network anchor links is quite costly and tedious. To overcome such a problem and utilize the numerous unlabeled anchor links in model building, in this paper, we introduce the active learning based anchor link prediction problem. Different from the traditional active learning problems, due to the one-to-one constraint on anchor links, if an unlabeled anchor link a = ( u , v ) is identified as positive (i.e., existing), all the other unlabeled anchor links incident to account u or account v will be negative (i.e., non-existing) automatically. Viewed in such a perspective, asking for the labels of potential positive anchor links in the unlabeled set will be rewarding in the active anchor link prediction problem. Various novel anchor link information gain measures are defined in this paper, based on which several constraint active anchor link prediction methods are introduced. Extensive experiments have been done on real-world social network datasets to compare the performance of these methods with state-of-art anchor link prediction methods. The experimental results show that the proposed Mean-entropy-based Constrained Active Learning (MC) method can outperform other methods with significant advantages.

The Inverse Contagion Problem (ICP) vs.. Predicting site contagion in real time, when network links are not observable

Science.gov (United States)

Mushkin, I.; Solomon, S.

2017-10-01

We study the inverse contagion problem (ICP). As opposed to the direct contagion problem, in which the network structure is known and the question is when each node will be contaminated, in the inverse problem the links of the network are unknown but a sequence of contagion histories (the times when each node was contaminated) is observed. We consider two versions of the ICP: The strong problem (SICP), which is the reconstruction of the network and has been studied before, and the weak problem (WICP), which requires "only" the prediction (at each time step) of the nodes that will be contaminated at the next time step (this is often the real life situation in which a contagion is observed and predictions are made in real time). Moreover, our focus is on analyzing the increasing accuracy of the solution, as a function of the number of contagion histories already observed. For simplicity, we discuss the simplest (deterministic and synchronous) contagion dynamics and the simplest solution algorithm, which we have applied to different network types. The main result of this paper is that the complex problem of the convergence of the ICP for a network can be reduced to an individual property of pairs of nodes: the "false link difficulty". By definition, given a pair of unlinked nodes i and j, the difficulty of the false link (i,j) is the probability that in a random contagion history, the nodes i and j are not contaminated at the same time step (or at consecutive time steps). In other words, the "false link difficulty" of a non-existing network link is the probability that the observations during a random contagion history would not rule out that link. This probability is relatively straightforward to calculate, and in most instances relies only on the relative positions of the two nodes (i,j) and not on the entire network structure. We have observed the distribution of false link difficulty for various network types, estimated it theoretically and confronted it

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Swami Ananthram

2007-01-01

Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Ananthram Swami

2007-12-01

Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

Pinning adaptive synchronization of a class of uncertain complex dynamical networks with multi-link against network deterioration

International Nuclear Information System (INIS)

Li, Lixiang; Li, Weiwei; Kurths, Jürgen; Luo, Qun; Yang, Yixian; Li, Shudong

2015-01-01

For the reason that the uncertain complex dynamic network with multi-link is quite close to various practical networks, there is superiority in the fields of research and application. In this paper, we focus upon pinning adaptive synchronization for uncertain complex dynamic networks with multi-link against network deterioration. The pinning approach can be applied to adapt uncertain coupling factors of deteriorated networks which can compensate effects of uncertainty. Several new synchronization criterions for networks with multi-link are derived, which ensure the synchronized states to be local or global stable with uncertainty and deterioration. Results of simulation are shown to demonstrate the feasibility and usefulness of our method

Toward Continental-scale Rainfall Monitoring Using Commercial Microwave Links From Cellular Communication Networks

Science.gov (United States)

Uijlenhoet, R.; Leijnse, H.; Overeem, A.

2017-12-01

Accurate and timely surface precipitation measurements are crucial for water resources management, agriculture, weather prediction, climate research, as well as ground validation of satellite-based precipitation estimates. However, the majority of the land surface of the earth lacks such data, and in many parts of the world the density of surface precipitation gauging networks is even rapidly declining. This development can potentially be counteracted by using received signal level data from the enormous number of microwave links used worldwide in commercial cellular communication networks. Along such links, radio signals propagate from a transmitting antenna at one base station to a receiving antenna at another base station. Rain-induced attenuation and, subsequently, path-averaged rainfall intensity can be retrieved from the signal's attenuation between transmitter and receiver. We have previously shown how one such a network can be used to retrieve the space-time dynamics of rainfall for an entire country (The Netherlands, ˜35,500 km2), based on an unprecedented number of links (˜2,400) and a rainfall retrieval algorithm that can be applied in real time. This demonstrated the potential of such networks for real-time rainfall monitoring, in particular in those parts of the world where networks of dedicated ground-based rainfall sensors are often virtually absent. The presentation will focus on the potential for upscaling this technique to continental-scale rainfall monitoring in Europe. In addition, several examples of recent applications of this technique on other continents (South America, Africa, Asia and Australia) will be given.

A novel multilayer model for missing link prediction and future link forecasting in dynamic complex networks

Science.gov (United States)

Yasami, Yasser; Safaei, Farshad

2018-02-01

The traditional complex network theory is particularly focused on network models in which all network constituents are dealt with equivalently, while fail to consider the supplementary information related to the dynamic properties of the network interactions. This is a main constraint leading to incorrect descriptions of some real-world phenomena or incomplete capturing the details of certain real-life problems. To cope with the problem, this paper addresses the multilayer aspects of dynamic complex networks by analyzing the properties of intrinsically multilayered co-authorship networks, DBLP and Astro Physics, and presenting a novel multilayer model of dynamic complex networks. The model examines the layers evolution (layers birth/death process and lifetime) throughout the network evolution. Particularly, this paper models the evolution of each node's membership in different layers by an Infinite Factorial Hidden Markov Model considering feature cascade, and thereby formulates the link generation process for intra-layer and inter-layer links. Although adjacency matrixes are useful to describe the traditional single-layer networks, such a representation is not sufficient to describe and analyze the multilayer dynamic networks. This paper also extends a generalized mathematical infrastructure to address the problems issued by multilayer complex networks. The model inference is performed using some Markov Chain Monte Carlo sampling strategies, given synthetic and real complex networks data. Experimental results indicate a tremendous improvement in the performance of the proposed multilayer model in terms of sensitivity, specificity, positive and negative predictive values, positive and negative likelihood ratios, F1-score, Matthews correlation coefficient, and accuracy for two important applications of missing link prediction and future link forecasting. The experimental results also indicate the strong predictivepower of the proposed model for the application of

Geographical constraints to range-based attacks on links in complex networks

International Nuclear Information System (INIS)

Gong Baihua; Liu Jun; Huang Liang; Yang Kongqing; Yang Lei

2008-01-01

In this paper, we studied range-based attacks on links in geographically constrained scale-free networks and found that there is a continuous switching of roles of short- and long-range attacks on links when tuning the geographical constraint strength. Our results demonstrate that the geography has a significant impact on the network efficiency and security; thus one can adjust the geographical structure to optimize the robustness and the efficiency of the networks. We introduce a measurement of the impact of links on the efficiency of the network, and an effective attacking strategy is suggested

Link prediction with node clustering coefficient

Science.gov (United States)

Wu, Zhihao; Lin, Youfang; Wang, Jing; Gregory, Steve

2016-06-01

Predicting missing links in incomplete complex networks efficiently and accurately is still a challenging problem. The recently proposed Cannistrai-Alanis-Ravai (CAR) index shows the power of local link/triangle information in improving link-prediction accuracy. Inspired by the idea of employing local link/triangle information, we propose a new similarity index with more local structure information. In our method, local link/triangle structure information can be conveyed by clustering coefficient of common-neighbors directly. The reason why clustering coefficient has good effectiveness in estimating the contribution of a common-neighbor is that it employs links existing between neighbors of a common-neighbor and these links have the same structural position with the candidate link to this common-neighbor. In our experiments, three estimators: precision, AUP and AUC are used to evaluate the accuracy of link prediction algorithms. Experimental results on ten tested networks drawn from various fields show that our new index is more effective in predicting missing links than CAR index, especially for networks with low correlation between number of common-neighbors and number of links between common-neighbors.

Link Label Prediction in Signed Citation Network

KAUST Repository

Akujuobi, Uchenna

2016-04-12

Link label prediction is the problem of predicting the missing labels or signs of all the unlabeled edges in a network. For signed networks, these labels can either be positive or negative. In recent years, different algorithms have been proposed such as using regression, trust propagation and matrix factorization. These approaches have tried to solve the problem of link label prediction by using ideas from social theories, where most of them predict a single missing label given that labels of other edges are known. However, in most real-world social graphs, the number of labeled edges is usually less than that of unlabeled edges. Therefore, predicting a single edge label at a time would require multiple runs and is more computationally demanding. In this thesis, we look at link label prediction problem on a signed citation network with missing edge labels. Our citation network consists of papers from three major machine learning and data mining conferences together with their references, and edges showing the relationship between them. An edge in our network is labeled either positive (dataset relevant) if the reference is based on the dataset used in the paper or negative otherwise. We present three approaches to predict the missing labels. The first approach converts the label prediction problem into a standard classification problem. We then, generate a set of features for each edge and then adopt Support Vector Machines in solving the classification problem. For the second approach, we formalize the graph such that the edges are represented as nodes with links showing similarities between them. We then adopt a label propagation method to propagate the labels on known nodes to those with unknown labels. In the third approach, we adopt a PageRank approach where we rank the nodes according to the number of incoming positive and negative edges, after which we set a threshold. Based on the ranks, we can infer an edge would be positive if it goes a node above the

Network worlds : from link analysis to virtual places.

Energy Technology Data Exchange (ETDEWEB)

Joslyn, C. (Cliff)

2002-01-01

Significant progress is being made in knowledge systems through recent advances in the science of very large networks. Attention is now turning in many quarters to the potential impact on counter-terrorism methods. After reviewing some of these advances, we will discuss the difference between such 'network analytic' approaches, which focus on large, homogeneous graph strucures, and what we are calling 'link analytic' approaches, which focus on somewhat smaller graphs with heterogeneous link types. We use this venue to begin the process of rigorously defining link analysis methods, especially the concept of chaining of views of multidimensional databases. We conclude with some speculation on potential connections to virtual world architectures.

Uncovering the essential links in online commercial networks

Science.gov (United States)

Zeng, Wei; Fang, Meiling; Shao, Junming; Shang, Mingsheng

2016-09-01

Recommender systems are designed to effectively support individuals' decision-making process on various web sites. It can be naturally represented by a user-object bipartite network, where a link indicates that a user has collected an object. Recently, research on the information backbone has attracted researchers' interests, which is a sub-network with fewer nodes and links but carrying most of the relevant information. With the backbone, a system can generate satisfactory recommenda- tions while saving much computing resource. In this paper, we propose an enhanced topology-aware method to extract the information backbone in the bipartite network mainly based on the information of neighboring users and objects. Our backbone extraction method enables the recommender systems achieve more than 90% of the accuracy of the top-L recommendation, however, consuming only 20% links. The experimental results show that our method outperforms the alternative backbone extraction methods. Moreover, the structure of the information backbone is studied in detail. Finally, we highlight that the information backbone is one of the most important properties of the bipartite network, with which one can significantly improve the efficiency of the recommender system.

On the estimation of the volatility-growth link

DEFF Research Database (Denmark)

Launov, Andrey; Posch, Olaf; Wälde, Klaus

It is common practice to estimate the volatility-growth link by specifying a standard growth equation such that the variance of the error term appears as an explanatory variable in this growth equation. The variance in turn is modelled by a second equation. Hardly any of existing applications...... of this framework includes exogenous controls in this second variance equation. Our theoretical …ndings suggest that the absence of relevant explanatory variables in the variance equation leads to a biased and inconsistent estimate of the volatility-growth link. Our simulations show that this effect is large. Once...... the appropriate controls are included in the variance equation consistency is restored. In short, we suggest that the variance equation must include relevant control variables to estimate the volatility-growth link....

Networked Airborne Communications Using Adaptive Multi Beam Directional Links

Science.gov (United States)

2016-03-05

Networked Airborne Communications Using Adaptive Multi-Beam Directional Links R. Bruce MacLeod Member, IEEE, and Adam Margetts Member, IEEE MIT...provide new techniques for increasing throughput in airborne adaptive directional net- works. By adaptive directional linking, we mean systems that can...techniques can dramatically increase the capacity in airborne networks. Advances in digital array technology are beginning to put these gains within reach

Topology control algorithm for wireless sensor networks based on Link forwarding

Science.gov (United States)

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.

The integration of weighted human gene association networks based on link prediction.

Science.gov (United States)

Yang, Jian; Yang, Tinghong; Wu, Duzhi; Lin, Limei; Yang, Fan; Zhao, Jing

2017-01-31

Physical and functional interplays between genes or proteins have important biological meaning for cellular functions. Some efforts have been made to construct weighted gene association meta-networks by integrating multiple biological resources, where the weight indicates the confidence of the interaction. However, it is found that these existing human gene association networks share only quite limited overlapped interactions, suggesting their incompleteness and noise. Here we proposed a workflow to construct a weighted human gene association network using information of six existing networks, including two weighted specific PPI networks and four gene association meta-networks. We applied link prediction algorithm to predict possible missing links of the networks, cross-validation approach to refine each network and finally integrated the refined networks to get the final integrated network. The common information among the refined networks increases notably, suggesting their higher reliability. Our final integrated network owns much more links than most of the original networks, meanwhile its links still keep high functional relevance. Being used as background network in a case study of disease gene prediction, the final integrated network presents good performance, implying its reliability and application significance. Our workflow could be insightful for integrating and refining existing gene association data.

Predictors of the peak width for networks with exponential links

Science.gov (United States)

Troutman, B.M.; Karlinger, M.R.

1989-01-01

We investigate optimal predictors of the peak (S) and distance to peak (T) of the width function of drainage networks under the assumption that the networks are topologically random with independent and exponentially distributed link lengths. Analytical results are derived using the fact that, under these assumptions, the width function is a homogeneous Markov birth-death process. In particular, exact expressions are derived for the asymptotic conditional expectations of S and T given network magnitude N and given mainstream length H. In addition, a simulation study is performed to examine various predictors of S and T, including N, H, and basin morphometric properties; non-asymptotic conditional expectations and variances are estimated. The best single predictor of S is N, of T is H, and of the scaled peak (S divided by the area under the width function) is H. Finally, expressions tested on a set of drainage basins from the state of Wyoming perform reasonably well in predicting S and T despite probable violations of the original assumptions. ?? 1989 Springer-Verlag.

Fast and Accurate Video PQoS Estimation over Wireless Networks

Directory of Open Access Journals (Sweden)

Emanuele Viterbo

2008-06-01

Full Text Available This paper proposes a curve fitting technique for fast and accurate estimation of the perceived quality of streaming media contents, delivered within a wireless network. The model accounts for the effects of various network parameters such as congestion, radio link power, and video transmission bit rate. The evaluation of the perceived quality of service (PQoS is based on the well-known VQM objective metric, a powerful technique which is highly correlated to the more expensive and time consuming subjective metrics. Currently, PQoS is used only for offline analysis after delivery of the entire video content. Thanks to the proposed simple model, we can estimate in real time the video PQoS and we can rapidly adapt the content transmission through scalable video coding and bit rates in order to offer the best perceived quality to the end users. The designed model has been validated through many different measurements in realistic wireless environments using an ad hoc WiFi test bed.

Identifying the Critical Links in Road Transportation Networks: Centrality-based approach utilizing structural properties

Energy Technology Data Exchange (ETDEWEB)

Chinthavali, Supriya [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2016-04-01

Surface transportation road networks share structural properties similar to other complex networks (e.g., social networks, information networks, biological networks, and so on). This research investigates the structural properties of road networks for any possible correlation with the traffic characteristics such as link flows those determined independently. Additionally, we define a criticality index for the links of the road network that identifies the relative importance in the network. We tested our hypotheses with two sample road networks. Results show that, correlation exists between the link flows and centrality measures of a link of the road (dual graph approach is followed) and the criticality index is found to be effective for one test network to identify the vulnerable nodes.

Modeling online social networks based on preferential linking

International Nuclear Information System (INIS)

Hu Hai-Bo; Chen Jun; Guo Jin-Li

2012-01-01

We study the phenomena of preferential linking in a large-scale evolving online social network and find that the linear preference holds for preferential creation, preferential acceptance, and preferential attachment. Based on the linear preference, we propose an analyzable model, which illustrates the mechanism of network growth and reproduces the process of network evolution. Our simulations demonstrate that the degree distribution of the network produced by the model is in good agreement with that of the real network. This work provides a possible bridge between the micro-mechanisms of network growth and the macrostructures of online social networks

Permanent Set of Cross-Linking Networks: Comparison of Theory with Molecular Dynamics Simulations

DEFF Research Database (Denmark)

Rottach, Dana R.; Curro, John G.; Budzien, Joanne

2006-01-01

The permanent set of cross-linking networks is studied by molecular dynamics. The uniaxial stress for a bead-spring polymer network is investigated as a function of strain and cross-link density history, where cross-links are introduced in unstrained and strained networks. The permanent set...

RAINLINK: Retrieval algorithm for rainfall monitoring employing microwave links from a cellular communication network

Science.gov (United States)

Uijlenhoet, R.; Overeem, A.; Leijnse, H.; Rios Gaona, M. F.

2017-12-01

The basic principle of rainfall estimation using microwave links is as follows. Rainfall attenuates the electromagnetic signals transmitted from one telephone tower to another. By measuring the received power at one end of a microwave link as a function of time, the path-integrated attenuation due to rainfall can be calculated, which can be converted to average rainfall intensities over the length of a link. Microwave links from cellular communication networks have been proposed as a promising new rainfall measurement technique for one decade. They are particularly interesting for those countries where few surface rainfall observations are available. Yet to date no operational (real-time) link-based rainfall products are available. To advance the process towards operational application and upscaling of this technique, there is a need for freely available, user-friendly computer code for microwave link data processing and rainfall mapping. Such software is now available as R package "RAINLINK" on GitHub (https://github.com/overeem11/RAINLINK). It contains a working example to compute link-based 15-min rainfall maps for the entire surface area of The Netherlands for 40 hours from real microwave link data. This is a working example using actual data from an extensive network of commercial microwave links, for the first time, which will allow users to test their own algorithms and compare their results with ours. The package consists of modular functions, which facilitates running only part of the algorithm. The main processings steps are: 1) Preprocessing of link data (initial quality and consistency checks); 2) Wet-dry classification using link data; 3) Reference signal determination; 4) Removal of outliers ; 5) Correction of received signal powers; 6) Computation of mean path-averaged rainfall intensities; 7) Interpolation of rainfall intensities ; 8) Rainfall map visualisation. Some applications of RAINLINK will be shown based on microwave link data from a

Estimating Conditional Distributions by Neural Networks

DEFF Research Database (Denmark)

Kulczycki, P.; Schiøler, Henrik

1998-01-01

Neural Networks for estimating conditionaldistributions and their associated quantiles are investigated in this paper. A basic network structure is developed on the basis of kernel estimation theory, and consistency property is considered from a mild set of assumptions. A number of applications...

Cascaded multiplexed optical link on a telecommunication network for frequency dissemination.

Science.gov (United States)

Lopez, Olivier; Haboucha, Adil; Kéfélian, Fabien; Jiang, Haifeng; Chanteau, Bruno; Roncin, Vincent; Chardonnet, Christian; Amy-Klein, Anne; Santarelli, Giorgio

2010-08-02

We demonstrate a cascaded optical link for ultrastable frequency dissemination comprised of two compensated links of 150 km and a repeater station. Each link includes 114 km of Internet fiber simultaneously carrying data traffic through a dense wavelength division multiplexing technology, and passes through two routing centers of the telecommunication network. The optical reference signal is inserted in and extracted from the communication network using bidirectional optical add-drop multiplexers. The repeater station operates autonomously ensuring noise compensation on the two links and the ultra-stable signal optical regeneration. The compensated link shows a fractional frequency instability of 3 x 10(-15) at one second measurement time and 5 x 10(-20) at 20 hours. This work paves the way to a wide dissemination of ultra-stable optical clock signals between distant laboratories via the Internet network.

Voice Quality Estimation in Wireless Networks

Directory of Open Access Journals (Sweden)

Petr Zach

2015-01-01

Full Text Available This article deals with the impact of Wireless (Wi-Fi networks on the perceived quality of voice services. The Quality of Service (QoS metrics must be monitored in the computer network during the voice data transmission to ensure proper voice service quality the end-user has paid for, especially in the wireless networks. In addition to the QoS, research area called Quality of Experience (QoE provides metrics and methods for quality evaluation from the end-user’s perspective. This article focuses on a QoE estimation of Voice over IP (VoIP calls in the wireless networks using network simulator. Results contribute to voice quality estimation based on characteristics of the wireless network and location of a wireless client.

Space Link Extension Protocol Emulation for High-Throughput, High-Latency Network Connections

Science.gov (United States)

Tchorowski, Nicole; Murawski, Robert

2014-01-01

New space missions require higher data rates and new protocols to meet these requirements. These high data rate space communication links push the limitations of not only the space communication links, but of the ground communication networks and protocols which forward user data to remote ground stations (GS) for transmission. The Consultative Committee for Space Data Systems, (CCSDS) Space Link Extension (SLE) standard protocol is one protocol that has been proposed for use by the NASA Space Network (SN) Ground Segment Sustainment (SGSS) program. New protocol implementations must be carefully tested to ensure that they provide the required functionality, especially because of the remote nature of spacecraft. The SLE protocol standard has been tested in the NASA Glenn Research Center's SCENIC Emulation Lab in order to observe its operation under realistic network delay conditions. More specifically, the delay between then NASA Integrated Services Network (NISN) and spacecraft has been emulated. The round trip time (RTT) delay for the continental NISN network has been shown to be up to 120ms; as such the SLE protocol was tested with network delays ranging from 0ms to 200ms. Both a base network condition and an SLE connection were tested with these RTT delays, and the reaction of both network tests to the delay conditions were recorded. Throughput for both of these links was set at 1.2Gbps. The results will show that, in the presence of realistic network delay, the SLE link throughput is significantly reduced while the base network throughput however remained at the 1.2Gbps specification. The decrease in SLE throughput has been attributed to the implementation's use of blocking calls. The decrease in throughput is not acceptable for high data rate links, as the link requires constant data a flow in order for spacecraft and ground radios to stay synchronized, unless significant data is queued a the ground station. In cases where queuing the data is not an option

An algorithm for link restoration of wavelength routing optical networks

DEFF Research Database (Denmark)

Limal, Emmanuel; Stubkjær, Kristian

1999-01-01

We present an algorithm for restoration of single link failure in wavelength routing multihop optical networks. The algorithm is based on an innovative study of networks using graph theory. It has the following original features: it (i) assigns working and spare channels simultaneously, (ii......) prevents the search for unacceptable routing paths by pointing out channels required for restoration, (iii) offers a high utilization of the capacity resources and (iv) allows a trivial search for the restoration paths. The algorithm is for link restoration of networks without wavelength translation. Its...

Real time data acquisition of a countrywide commercial microwave link network

Science.gov (United States)

Chwala, Christian; Keis, Felix; Kunstmann, Harald

2015-04-01

Research in recent years has shown that data from commercial microwave link networks can provide very valuable precipitation information. Since these networks comprise the backbone of the cell phone network, they provide countrywide coverage. However acquiring the necessary data from the network operators is still difficult. Data is usually made available for researchers with a large time delay and often at irregular basis. This of course hinders the exploitation of commercial microwave link data in operational applications like QPE forecasts running at national meteorological services. To overcome this, we have developed a custom software in joint cooperation with our industry partner Ericsson. The software is installed on a dedicated server at Ericsson and is capable of acquiring data from the countrywide microwave link network in Germany. In its current first operational testing phase, data from several hundred microwave links in southern Germany is recorded. All data is instantaneously sent to our server where it is stored and organized in an emerging database. Time resolution for the Ericsson data is one minute. The custom acquisition software, however, is capable of processing higher sampling rates. Additionally we acquire and manage 1 Hz data from four microwave links operated by the skiing resort in Garmisch-Partenkirchen. We will present the concept of the data acquisition and show details of the custom-built software. Additionally we will showcase the accessibility and basic processing of real time microwave link data via our database web frontend.

State estimation in networked systems

NARCIS (Netherlands)

Sijs, J.

2012-01-01

This thesis considers state estimation strategies for networked systems. State estimation refers to a method for computing the unknown state of a dynamic process by combining sensor measurements with predictions from a process model. The most well known method for state estimation is the Kalman

Analysis of Network Vulnerability Under Joint Node and Link Attacks

Science.gov (United States)

Li, Yongcheng; Liu, Shumei; Yu, Yao; Cao, Ting

2018-03-01

The security problem of computer network system is becoming more and more serious. The fundamental reason is that there are security vulnerabilities in the network system. Therefore, it’s very important to identify and reduce or eliminate these vulnerabilities before they are attacked. In this paper, we are interested in joint node and link attacks and propose a vulnerability evaluation method based on the overall connectivity of the network to defense this attack. Especially, we analyze the attack cost problem from the attackers’ perspective. The purpose is to find the set of least costs for joint links and nodes, and their deletion will lead to serious network connection damage. The simulation results show that the vulnerable elements obtained from the proposed method are more suitable for the attacking idea of the malicious persons in joint node and link attack. It is easy to find that the proposed method has more realistic protection significance.

Estimation of Conditional Quantile using Neural Networks

DEFF Research Database (Denmark)

Kulczycki, P.; Schiøler, Henrik

1999-01-01

The problem of estimating conditional quantiles using neural networks is investigated here. A basic structure is developed using the methodology of kernel estimation, and a theory guaranteeing con-sistency on a mild set of assumptions is provided. The constructed structure constitutes a basis...... for the design of a variety of different neural networks, some of which are considered in detail. The task of estimating conditional quantiles is related to Bayes point estimation whereby a broad range of applications within engineering, economics and management can be suggested. Numerical results illustrating...... the capabilities of the elaborated neural network are also given....

Wireless sensor networks distributed consensus estimation

CERN Document Server

Chen, Cailian; Guan, Xinping

2014-01-01

This SpringerBrief evaluates the cooperative effort of sensor nodes to accomplish high-level tasks with sensing, data processing and communication. The metrics of network-wide convergence, unbiasedness, consistency and optimality are discussed through network topology, distributed estimation algorithms and consensus strategy. Systematic analysis reveals that proper deployment of sensor nodes and a small number of low-cost relays (without sensing function) can speed up the information fusion and thus improve the estimation capability of wireless sensor networks (WSNs). This brief also investiga

Paradoxes in networks with zero emission links: implications for telecommunications versus transportation

Energy Technology Data Exchange (ETDEWEB)

Nagurney, A. [University of Massachusetts, Amherst, MA (United States). Isenberg School of Management; June Dong [State University of New York, Oswego, NY (United States). School of Business

2001-07-01

In this paper, we consider networks in which a link is characterized by zero emissions as is typical of networks in which certain links correspond to telecommunication links. We identify three new and distinct paradoxical phenomena that can occur in such networks, which demonstrate that so-called improvements to the network may result in increases in total emissions generated. In particular, we illustrate, through specific examples, the following: (1) the addition of a link with zero emissions may result in an increase in total emissions with no change in travel demand; (2) the total emissions on a network with a zero emission link may increase with a decrease in travel demand; and (3) the addition of a path connecting an origin/destination (O/D) pair and consisting solely of a zero emission link may result in an increase in total emissions. We then propose an emission pricing policy which guarantees that such paradoxes do not occur. The pricing policy is shown to be equivalent to a particular weighting mechanism associated with the criterion of emission generation provided that the users are now multicriteria decision-makers who seek to minimize both the cost of their route choices as well as the emissions that they generate. (author)

Condition Monitoring for DC-link Capacitors Based on Artificial Neural Network Algorithm

DEFF Research Database (Denmark)

Soliman, Hammam Abdelaal Hammam; Wang, Huai; Gadalla, Brwene Salah Abdelkarim

2015-01-01

hardware will reduce the cost, and therefore could be more promising for industry applications. A condition monitoring method based on Artificial Neural Network (ANN) algorithm is therefore proposed in this paper. The implementation of the ANN to the DC-link capacitor condition monitoring in a back......In power electronic systems, capacitor is one of the reliability critical components . Recently, the condition monitoring of capacitors to estimate their health status have been attracted by the academic research. Industry applications require more reliable power electronics products...... with preventive maintenance. However, the existing capacitor condition monitoring methods suffer from either increased hardware cost or low estimation accuracy, being the challenges to be adopted in industry applications. New development in condition monitoring technology with software solutions without extra...

Estimating network effects in China's mobile telecommunications

Institute of Scientific and Technical Information of China (English)

无

2005-01-01

A model is proposed along with empirical investigation to prove the existence of network effects in China's mobile telecommunications market. Futhernore, network effects on China's mobile telecommunications are estimated with a dynamic model. The structural parameters are identified from regression coefficients and the results are analyzed and compared with another literature. Data and estimation issues are also discussed. Conclusions are drawn that network effects are significant in China's mobile telecommunications market, and that ignoring network effects leads to bad policy making.

Influence of Personal Preferences on Link Dynamics in Social Networks

Directory of Open Access Journals (Sweden)

Ashwin Bahulkar

2017-01-01

Full Text Available We study a unique network dataset including periodic surveys and electronic logs of dyadic contacts via smartphones. The participants were a sample of freshmen entering university in the Fall 2011. Their opinions on a variety of political and social issues and lists of activities on campus were regularly recorded at the beginning and end of each semester for the first three years of study. We identify a behavioral network defined by call and text data, and a cognitive network based on friendship nominations in ego-network surveys. Both networks are limited to study participants. Since a wide range of attributes on each node were collected in self-reports, we refer to these networks as attribute-rich networks. We study whether student preferences for certain attributes of friends can predict formation and dissolution of edges in both networks. We introduce a method for computing student preferences for different attributes which we use to predict link formation and dissolution. We then rank these attributes according to their importance for making predictions. We find that personal preferences, in particular political views, and preferences for common activities help predict link formation and dissolution in both the behavioral and cognitive networks.

Estimation of the proteomic cancer co-expression sub networks by using association estimators.

Directory of Open Access Journals (Sweden)

Cihat Erdoğan

Full Text Available In this study, the association estimators, which have significant influences on the gene network inference methods and used for determining the molecular interactions, were examined within the co-expression network inference concept. By using the proteomic data from five different cancer types, the hub genes/proteins within the disease-associated gene-gene/protein-protein interaction sub networks were identified. Proteomic data from various cancer types is collected from The Cancer Proteome Atlas (TCPA. Correlation and mutual information (MI based nine association estimators that are commonly used in the literature, were compared in this study. As the gold standard to measure the association estimators' performance, a multi-layer data integration platform on gene-disease associations (DisGeNET and the Molecular Signatures Database (MSigDB was used. Fisher's exact test was used to evaluate the performance of the association estimators by comparing the created co-expression networks with the disease-associated pathways. It was observed that the MI based estimators provided more successful results than the Pearson and Spearman correlation approaches, which are used in the estimation of biological networks in the weighted correlation network analysis (WGCNA package. In correlation-based methods, the best average success rate for five cancer types was 60%, while in MI-based methods the average success ratio was 71% for James-Stein Shrinkage (Shrink and 64% for Schurmann-Grassberger (SG association estimator, respectively. Moreover, the hub genes and the inferred sub networks are presented for the consideration of researchers and experimentalists.

Reducing bias in rainfall estimates from microwave links by considering variable drop size distribution

Science.gov (United States)

Fencl, Martin; Jörg, Rieckermann; Vojtěch, Bareš

2015-04-01

Commercial microwave links (MWL) are point-to-point radio systems which are used in backhaul networks of cellular operators. For several years, they have been suggested as rainfall sensors complementary to rain gauges and weather radars, because, first, they operate at frequencies where rain drops represent significant source of attenuation and, second, cellular networks almost completely cover urban and rural areas. Usually, path-average rain rates along a MWL are retrieved from the rain-induced attenuation of received MWL signals with a simple model based on a power law relationship. The model is often parameterized based on the characteristics of a particular MWL, such as frequency, polarization and the drop size distribution (DSD) along the MWL. As information on the DSD is usually not available in operational conditions, the model parameters are usually considered constant. Unfortunately, this introduces bias into rainfall estimates from MWL. In this investigation, we propose a generic method to eliminate this bias in MWL rainfall estimates. Specifically, we search for attenuation statistics which makes it possible to classify rain events into distinct groups for which same power-law parameters can be used. The theoretical attenuation used in the analysis is calculated from DSD data using T-Matrix method. We test the validity of our approach on observations from a dedicated field experiment in Dübendorf (CH) with a 1.85-km long commercial dual-polarized microwave link transmitting at a frequency of 38 GHz, an autonomous network of 5 optical distrometers and 3 rain gauges distributed along the path of the MWL. The data is recorded at a high temporal resolution of up to 30s. It is further tested on data from an experimental catchment in Prague (CZ), where 14 MWLs, operating at 26, 32 and 38 GHz frequencies, and reference rainfall from three RGs is recorded every minute. Our results suggest that, for our purpose, rain events can be nicely characterized based on

Space Network Time Distribution and Synchronization Protocol Development for Mars Proximity Link

Science.gov (United States)

Woo, Simon S.; Gao, Jay L.; Mills, David

2010-01-01

Time distribution and synchronization in deep space network are challenging due to long propagation delays, spacecraft movements, and relativistic effects. Further, the Network Time Protocol (NTP) designed for terrestrial networks may not work properly in space. In this work, we consider the time distribution protocol based on time message exchanges similar to Network Time Protocol (NTP). We present the Proximity-1 Space Link Interleaved Time Synchronization (PITS) algorithm that can work with the CCSDS Proximity-1 Space Data Link Protocol. The PITS algorithm provides faster time synchronization via two-way time transfer over proximity links, improves scalability as the number of spacecraft increase, lowers storage space requirement for collecting time samples, and is robust against packet loss and duplication which underlying protocol mechanisms provide.

Linking Environmental Orientation to Start-ups’ Networking Activities

DEFF Research Database (Denmark)

Dickel, Petra; Ritter, Thomas

Besides for-profit start-ups, an increasing number of firms start their existence with the purpose to “do good” for society – mirrored in an increasing academic discussion of sustainable firms. Yet, there is little research on the networking activities of start-ups that do not have profit...... generation as their primary focus. Addressing this research gap, we develop hypotheses on the different networking activities of environmentally oriented start-ups arguing that their societal focus has a positive impact on the frequency of their networking and the size of their network. For empirically...... investigating such networking differences, we use data from 179 technology-based start-ups and show that start-ups with a strong external environmental orientation have significantly higher networking frequency and build larger networks. On the contrary, strong internal environmental orientation is linked...

Space Link Extension (SLE) Emulation for High-Throughput Network Communication

Science.gov (United States)

Murawski, Robert W.; Tchorowski, Nicole; Golden, Bert

2014-01-01

As the data rate requirements for space communications increases, significant stress is placed not only on the wireless satellite communication links, but also on the ground networks which forward data from end-users to remote ground stations. These wide area network (WAN) connections add delay and jitter to the end-to-end satellite communication link, effects which can have significant impacts on the wireless communication link. It is imperative that any ground communication protocol can react to these effects such that the ground network does not become a bottleneck in the communication path to the satellite. In this paper, we present our SCENIC Emulation Lab testbed which was developed to test the CCSDS SLE protocol implementations proposed for use on future NASA communication networks. Our results show that in the presence of realistic levels of network delay, high-throughput SLE communication links can experience significant data rate throttling. Based on our observations, we present some insight into why this data throttling happens, and trace the probable issue back to non-optimal blocking communication which is sup-ported by the CCSDS SLE API recommended practices. These issues were presented as well to the SLE implementation developers which, based on our reports, developed a new release for SLE which we show fixes the SLE blocking issue and greatly improves the protocol throughput. In this paper, we also discuss future developments for our end-to-end emulation lab and how these improvements can be used to develop and test future space communication technologies.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

Science.gov (United States)

Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jeevaa Katiravan

2015-01-01

Full Text Available In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Link and route availability for Inter-working multi-hop wireless networks

CSIR Research Space (South Africa)

Salami, O

2009-09-01

Full Text Available pairs in inter-working multi-hop wireless networks can be evaluated based on the availability and reliability of radio links that form the communication path linking the nodes. This paper presents an analytical study of the link and route availability...

Home-School Links: Networking the Learning Community.

Science.gov (United States)

1996

The topic of networking the learning community with home-school links is addressed in four papers: "Internet Access via School: Expectations of Students and Parents" (Roy Crotty); "The School Library as Community Information Gateway" (Megan Perry); "Rural Access to the Internet" (Ken Eustace); and "NetDay '96:…

Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

International Nuclear Information System (INIS)

Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo

2015-01-01

Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug–target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively

Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

Science.gov (United States)

Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo

2015-11-01

Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug-target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively

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

Directory of Open Access Journals (Sweden)

Zhensheng Wang

2017-02-01

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

Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks

OpenAIRE

Chaoyang Shi; Bi Yu Chen; William H. K. Lam; Qingquan Li

2017-01-01

Travel times in congested urban road networks are highly stochastic. Provision of travel time distribution information, including both mean and variance, can be very useful for travelers to make reliable path choice decisions to ensure higher probability of on-time arrival. To this end, a heterogeneous data fusion method is proposed to estimate travel time distributions by fusing heterogeneous data from point and interval detectors. In the proposed method, link travel time distributions are f...

Link Investigation of IEEE 802.15.4 Wireless Sensor Networks in Forests.

Science.gov (United States)

Ding, Xingjian; Sun, Guodong; Yang, Gaoxiang; Shang, Xinna

2016-06-27

Wireless sensor networks are expected to automatically monitor the ecological evolution and wildlife habits in forests. Low-power links (transceivers) are often adopted in wireless sensor network applications, in order to save the precious sensor energy and then achieve long-term, unattended monitoring. Recent research has presented some performance characteristics of such low-power wireless links under laboratory or outdoor scenarios with less obstacles, and they have found that low-power wireless links are unreliable and prone to be affected by the target environment. However, there is still less understanding about how well the low-power wireless link performs in real-world forests and to what extent the complex in-forest surrounding environments affect the link performances. In this paper, we empirically evaluate the low-power links of wireless sensors in three typical different forest environments. Our experiment investigates the performance of the link layer compatible with the IEEE 802.15.4 standard and analyzes the variation patterns of the packet reception ratio (PRR), the received signal strength indicator (RSSI) and the link quality indicator (LQI) under diverse experimental settings. Some observations of this study are inconsistent with or even contradict prior results that are achieved in open fields or relatively clean environments and thus, provide new insights both into effectively evaluating the low-power wireless links and into efficiently deploying wireless sensor network systems in forest environments.

Small Strain Topological Effects of Biopolymer Networks with Rigid Cross-Links

NARCIS (Netherlands)

Zagar, G.; Onck, P. R.; Van der Giessen, E.; Garikipati, K; Arruda, EM

2010-01-01

Networks of cross-linked filamentous biopolymers form topological structures characterized by L, T and X cross-link types of connectivity 2, 3 and 4, respectively. The distribution of cross-links over these three types proofs to be very important for the initial elastic shear stiffness of isotropic

Fiber Orientation Estimation Guided by a Deep Network.

Science.gov (United States)

Ye, Chuyang; Prince, Jerry L

2017-09-01

Diffusion magnetic resonance imaging (dMRI) is currently the only tool for noninvasively imaging the brain's white matter tracts. The fiber orientation (FO) is a key feature computed from dMRI for tract reconstruction. Because the number of FOs in a voxel is usually small, dictionary-based sparse reconstruction has been used to estimate FOs. However, accurate estimation of complex FO configurations in the presence of noise can still be challenging. In this work we explore the use of a deep network for FO estimation in a dictionary-based framework and propose an algorithm named Fiber Orientation Reconstruction guided by a Deep Network (FORDN). FORDN consists of two steps. First, we use a smaller dictionary encoding coarse basis FOs to represent diffusion signals. To estimate the mixture fractions of the dictionary atoms, a deep network is designed to solve the sparse reconstruction problem. Second, the coarse FOs inform the final FO estimation, where a larger dictionary encoding a dense basis of FOs is used and a weighted ℓ 1 -norm regularized least squares problem is solved to encourage FOs that are consistent with the network output. FORDN was evaluated and compared with state-of-the-art algorithms that estimate FOs using sparse reconstruction on simulated and typical clinical dMRI data. The results demonstrate the benefit of using a deep network for FO estimation.

Link-Prediction Enhanced Consensus Clustering for Complex Networks (Open Access)

Science.gov (United States)

2016-05-20

RESEARCH ARTICLE Link-Prediction Enhanced Consensus Clustering for Complex Networks Matthew Burgess1*, Eytan Adar1,2, Michael Cafarella1 1Computer...consensus clustering algorithm to enhance community detection on incomplete networks. Our framework utilizes existing community detection algorithms that...types of complex networks exhibit community structure: groups of highly connected nodes. Communities or clusters often reflect nodes that share similar

Architecture and design of optical path networks utilizing waveband virtual links

Science.gov (United States)

Ito, Yusaku; Mori, Yojiro; Hasegawa, Hiroshi; Sato, Ken-ichi

2016-02-01

We propose a novel optical network architecture that uses waveband virtual links, each of which can carry several optical paths, to directly bridge distant node pairs. Future photonic networks should not only transparently cover extended areas but also expand fiber capacity. However, the traversal of many ROADM nodes impairs the optical signal due to spectrum narrowing. To suppress the degradation, the bandwidth of guard bands needs to be increased, which degrades fiber frequency utilization. Waveband granular switching allows us to apply broader pass-band filtering at ROADMs and to insert sufficient guard bands between wavebands with minimum frequency utilization offset. The scheme resolves the severe spectrum narrowing effect. Moreover, the guard band between optical channels in a waveband can be minimized, which increases the number of paths that can be accommodated per fiber. In the network, wavelength path granular routing is done without utilizing waveband virtual links, and it still suffers from spectrum narrowing. A novel network design algorithm that can bound the spectrum narrowing effect by limiting the number of hops (traversed nodes that need wavelength path level routing) is proposed in this paper. This algorithm dynamically changes the waveband virtual link configuration according to the traffic distribution variation, where optical paths that need many node hops are effectively carried by virtual links. Numerical experiments demonstrate that the number of necessary fibers is reduced by 23% compared with conventional optical path networks.

A Glider-Assisted Link Disruption Restoration Mechanism in Underwater Acoustic Sensor Networks.

Science.gov (United States)

Jin, Zhigang; Wang, Ning; Su, Yishan; Yang, Qiuling

2018-02-07

Underwater acoustic sensor networks (UASNs) have become a hot research topic. In UASNs, nodes can be affected by ocean currents and external forces, which could result in sudden link disruption. Therefore, designing a flexible and efficient link disruption restoration mechanism to ensure the network connectivity is a challenge. In the paper, we propose a glider-assisted restoration mechanism which includes link disruption recognition and related link restoring mechanism. In the link disruption recognition mechanism, the cluster heads collect the link disruption information and then schedule gliders acting as relay nodes to restore the disrupted link. Considering the glider's sawtooth motion, we design a relay location optimization algorithm with a consideration of both the glider's trajectory and acoustic channel attenuation model. The utility function is established by minimizing the channel attenuation and the optimal location of glider is solved by a multiplier method. The glider-assisted restoration mechanism can greatly improve the packet delivery rate and reduce the communication energy consumption and it is more general for the restoration of different link disruption scenarios. The simulation results show that glider-assisted restoration mechanism can improve the delivery rate of data packets by 15-33% compared with cooperative opportunistic routing (OVAR), the hop-by-hop vector-based forwarding (HH-VBF) and the vector based forward (VBF) methods, and reduce communication energy consumption by 20-58% for a typical network's setting.

Restorability on 3-connected WDM Networks Under Single and Dual Physical Link Failures

DEFF Research Database (Denmark)

Gutierrez Lopez, Jose Manuel; Jensen, Michael; Riaz, Tahir

2013-01-01

This work studies the influence the network interconnection has over restoration techniques. The way physical links are distributed to interconnect network nodes has a great impact on parameters such as path distances when failures occur and restoration is applied. The work focuses on single and ...... to network planning, the trade-off network length vs. performance of the different topological options is studied. The results show how 3-connected graphs could provide a reasonable trade-off between costs, link failure rates, and restored path parameters....

Rainfall measurement using cell phone links

NARCIS (Netherlands)

Schip, van het T.I.; Overeem, A.; Leijnse, H.; Uijlenhoet, R.; Meirink, J.F.; Delden, van A.J.

2017-01-01

Commercial cellular telecommunication networks can be used for rainfall estimation by measuring the attenuation of electromagnetic signals transmitted between antennas from microwave links. However, as the received link signal may also decrease during dry periods, a method to separate wet and dry

The vulnerability of the global container shipping network to targeted link disruption

CSIR Research Space (South Africa)

Viljoen, NM

2016-11-01

Full Text Available transport, complex network theory has had limited application in studying the vulnerability of maritime networks. This study uses targeted link disruption to investigate the strategy specific vulnerability of the network. Although nodal infrastructure...

Modeling the video distribution link in the Next Generation Optical Access Networks

International Nuclear Information System (INIS)

Amaya, F; Cardenas, A; Tafur, I

2011-01-01

In this work we present a model for the design and optimization of the video distribution link in the next generation optical access network. We analyze the video distribution performance in a SCM-WDM link, including the noise, the distortion and the fiber optic nonlinearities. Additionally, we consider in the model the effect of distributed Raman amplification, used to extent the capacity and the reach of the optical link. In the model, we use the nonlinear Schroedinger equation with the purpose to obtain capacity limitations and design constrains of the next generation optical access networks.

A multilayer network analysis of hashtags in twitter via co-occurrence and semantic links

Science.gov (United States)

Türker, Ilker; Sulak, Eyüb Ekmel

2018-02-01

Complex network studies, as an interdisciplinary framework, span a large variety of subjects including social media. In social networks, several mechanisms generate miscellaneous structures like friendship networks, mention networks, tag networks, etc. Focusing on tag networks (namely, hashtags in twitter), we made a two-layer analysis of tag networks from a massive dataset of Twitter entries. The first layer is constructed by converting the co-occurrences of these tags in a single entry (tweet) into links, while the second layer is constructed converting the semantic relations of the tags into links. We observed that the universal properties of the real networks like small-world property, clustering and power-law distributions in various network parameters are also evident in the multilayer network of hashtags. Moreover, we outlined that co-occurrences of hashtags in tweets are mostly coupled with semantic relations, whereas a small number of semantically unrelated, therefore random links reduce node separation and network diameter in the co-occurrence network layer. Together with the degree distributions, the power-law consistencies of degree difference, edge weight and cosine similarity distributions in both layers are also appealing forms of Zipf’s law evident in nature.

Consistent sensor, relay, and link selection in wireless sensor networks

NARCIS (Netherlands)

Arroyo Valles, M.D.R.; Simonetto, A.; Leus, G.J.T.

2017-01-01

In wireless sensor networks, where energy is scarce, it is inefficient to have all nodes active because they consume a non-negligible amount of battery. In this paper we consider the problem of jointly selecting sensors, relays and links in a wireless sensor network where the active sensors need

Selective removal of heavy metal ions by disulfide linked polymer networks

Energy Technology Data Exchange (ETDEWEB)

Ko, Dongah [Department of Environmental Engineering, Technical University of Denmark, Miljøvej 113, 2800 Kgs. Lyngby (Denmark); Lee, Joo Sung [Graduate School of EEWS, Korea Advanced Institute of Science and Technology (KAIST), Daejeon 34141 (Korea, Republic of); Patel, Hasmukh A. [Department of Chemistry, Northwestern University, Evanston, IL 60208 (United States); Jakobsen, Mogens H. [Department of Micro and Nano technology, Technical University of Denmark, Ørsteds Plads, 345B, 2800 Kgs. Lyngby (Denmark); Hwang, Yuhoon [Department of Environmental Engineering, Seoul National University of Science and Technology, 232 Gongreung-ro, Nowon-gu, Seoul 01811 (Korea, Republic of); Yavuz, Cafer T. [Graduate School of EEWS, Korea Advanced Institute of Science and Technology (KAIST), Daejeon 34141 (Korea, Republic of); Hansen, Hans Chr. Bruun [Department of Plant and Environmental Sciences, University of Copenhagen, Frederiksberg, Thorvaldsensvej 40, 1871 Frederiksberg C (Denmark); Andersen, Henrik R., E-mail: henrik@ndersen.net [Department of Environmental Engineering, Technical University of Denmark, Miljøvej 113, 2800 Kgs. Lyngby (Denmark)

2017-06-15

Highlights: • Disulfide/thiol polymer networks are promising as sorbent for heavy metals. • Rapid sorption and high Langmuir affinity constant (a{sub L}) for stormwater treatment. • Selective sorption for copper, cadmium, and zinc in the presence of calcium. • Reusability likely due to structure stability of disulfide linked polymer networks. - Abstract: Heavy metal contaminated surface water is one of the oldest pollution problems, which is critical to ecosystems and human health. We devised disulfide linked polymer networks and employed as a sorbent for removing heavy metal ions from contaminated water. Although the polymer network material has a moderate surface area, it demonstrated cadmium removal efficiency equivalent to highly porous activated carbon while it showed 16 times faster sorption kinetics compared to activated carbon, owing to the high affinity of cadmium towards disulfide and thiol functionality in the polymer network. The metal sorption mechanism on polymer network was studied by sorption kinetics, effect of pH, and metal complexation. We observed that the metal ions–copper, cadmium, and zinc showed high binding affinity in polymer network, even in the presence of competing cations like calcium in water.

Curing critical links in oscillator networks as power flow models

International Nuclear Information System (INIS)

Rohden, Martin; Meyer-Ortmanns, Hildegard; Witthaut, Dirk; Timme, Marc

2017-01-01

Modern societies crucially depend on the robust supply with electric energy so that blackouts of power grids can have far reaching consequences. Typically, large scale blackouts take place after a cascade of failures: the failure of a single infrastructure component, such as a critical transmission line, results in several subsequent failures that spread across large parts of the network. Improving the robustness of a network to prevent such secondary failures is thus key for assuring a reliable power supply. In this article we analyze the nonlocal rerouting of power flows after transmission line failures for a simplified AC power grid model and compare different strategies to improve network robustness. We identify critical links in the grid and compute alternative pathways to quantify the grid’s redundant capacity and to find bottlenecks along the pathways. Different strategies are developed and tested to increase transmission capacities to restore stability with respect to transmission line failures. We show that local and nonlocal strategies typically perform alike: one can equally well cure critical links by providing backup capacities locally or by extending the capacities of bottleneck links at remote locations. (paper)

DC Link Current Estimation in Wind-Double Feed Induction Generator Power Conditioning System

Directory of Open Access Journals (Sweden)

MARIAN GAICEANU

2010-12-01

Full Text Available In this paper the implementation of the DC link current estimator in power conditioning system of the variable speed wind turbine is shown. The wind turbine is connected to double feed induction generator (DFIG. The variable electrical energy parameters delivered by DFIG are fitted with the electrical grid parameters through back-to-back power converter. The bidirectional AC-AC power converter covers a wide speed range from subsynchronous to supersynchronous speeds. The modern control of back-to-back power converter involves power balance concept, therefore its load power should be known in any instant. By using the power balance control, the DC link voltage variation at the load changes can be reduced. In this paper the load power is estimated from the dc link, indirectly, through a second order DC link current estimator. The load current estimator is based on the DC link voltage and on the dc link input current of the rotor side converter. This method presents certain advantages instead of using measured method, which requires a low pass filter: no time delay, the feedforward current component has no ripple, no additional hardware, and more fast control response. Through the numerical simulation the performances of the proposed DC link output current estimator scheme are demonstrated.

Modeling the video distribution link in the Next Generation Optical Access Networks

DEFF Research Database (Denmark)

Amaya, F.; Cárdenas, A.; Tafur Monroy, Idelfonso

2011-01-01

In this work we present a model for the design and optimization of the video distribution link in the next generation optical access network. We analyze the video distribution performance in a SCM-WDM link, including the noise, the distortion and the fiber optic nonlinearities. Additionally, we...... consider in the model the effect of distributed Raman amplification, used to extent the capacity and the reach of the optical link. In the model, we use the nonlinear Schrödinger equation with the purpose to obtain capacity limitations and design constrains of the next generation optical access networks....

Evaluation of mobile ad hoc network reliability using propagation-based link reliability model

International Nuclear Information System (INIS)

Padmavathy, N.; Chaturvedi, Sanjay K.

2013-01-01

A wireless mobile ad hoc network (MANET) is a collection of solely independent nodes (that can move randomly around the area of deployment) making the topology highly dynamic; nodes communicate with each other by forming a single hop/multi-hop network and maintain connectivity in decentralized manner. MANET is modelled using geometric random graphs rather than random graphs because the link existence in MANET is a function of the geometric distance between the nodes and the transmission range of the nodes. Among many factors that contribute to the MANET reliability, the reliability of these networks also depends on the robustness of the link between the mobile nodes of the network. Recently, the reliability of such networks has been evaluated for imperfect nodes (transceivers) with binary model of communication links based on the transmission range of the mobile nodes and the distance between them. However, in reality, the probability of successful communication decreases as the signal strength deteriorates due to noise, fading or interference effects even up to the nodes' transmission range. Hence, in this paper, using a propagation-based link reliability model rather than a binary-model with nodes following a known failure distribution to evaluate the network reliability (2TR m , ATR m and AoTR m ) of MANET through Monte Carlo Simulation is proposed. The method is illustrated with an application and some imperative results are also presented

Models for stiffening in cross-linked biopolymer networks : A comparative study

NARCIS (Netherlands)

van Dillen, T.; Onck, P. R.; Van der Giessen, E.

In a recent publication, we studied the mechanical stiffening behavior in two-dimensional (2D) cross-linked networks of semiflexible biopolymer filaments under simple shear [Onck, P.R., Koeman, T., Van Dillen, T., Van der Giessen, E., 2005. Alternative explanation of stiffening in cross-linked

The structural role of weak and strong links in a financial market network

Science.gov (United States)

Garas, A.; Argyrakis, P.; Havlin, S.

2008-05-01

We investigate the properties of correlation based networks originating from economic complex systems, such as the network of stocks traded at the New York Stock Exchange (NYSE). The weaker links (low correlation) of the system are found to contribute to the overall connectivity of the network significantly more than the strong links (high correlation). We find that nodes connected through strong links form well defined communities. These communities are clustered together in more complex ways compared to the widely used classification according to the economic activity. We find that some companies, such as General Electric (GE), Coca Cola (KO), and others, can be involved in different communities. The communities are found to be quite stable over time. Similar results were obtained by investigating markets completely different in size and properties, such as the Athens Stock Exchange (ASE). The present method may be also useful for other networks generated through correlations.

On Efficient Link Recommendation in Social Networks Using Actor-Fact Matrices

Directory of Open Access Journals (Sweden)

Michał Ciesielczyk

2015-01-01

Full Text Available Link recommendation is a popular research subject in the field of social network analysis and mining. Often, the main emphasis is put on the development of new recommendation algorithms, semantic enhancements to existing solutions, design of new similarity measures, and so forth. However, relatively little scientific attention has been paid to the impact that various data representation models have on the performance of recommendation algorithms. And by performance we do not mean the time or memory efficiency of algorithms, but the precision and recall of recommender systems. Our recent findings unanimously show that the choice of network representation model has an important and measurable impact on the quality of recommendations. In this paper we argue that the computation quality of link recommendation algorithms depends significantly on the social network representation and we advocate the use of actor-fact matrix as the best alternative. We verify our findings using several state-of-the-art link recommendation algorithms, such as SVD, RSVD, and RRI using both single-relation and multirelation dataset.

Network Structure and Biased Variance Estimation in Respondent Driven Sampling.

Science.gov (United States)

Verdery, Ashton M; Mouw, Ted; Bauldry, Shawn; Mucha, Peter J

2015-01-01

This paper explores bias in the estimation of sampling variance in Respondent Driven Sampling (RDS). Prior methodological work on RDS has focused on its problematic assumptions and the biases and inefficiencies of its estimators of the population mean. Nonetheless, researchers have given only slight attention to the topic of estimating sampling variance in RDS, despite the importance of variance estimation for the construction of confidence intervals and hypothesis tests. In this paper, we show that the estimators of RDS sampling variance rely on a critical assumption that the network is First Order Markov (FOM) with respect to the dependent variable of interest. We demonstrate, through intuitive examples, mathematical generalizations, and computational experiments that current RDS variance estimators will always underestimate the population sampling variance of RDS in empirical networks that do not conform to the FOM assumption. Analysis of 215 observed university and school networks from Facebook and Add Health indicates that the FOM assumption is violated in every empirical network we analyze, and that these violations lead to substantially biased RDS estimators of sampling variance. We propose and test two alternative variance estimators that show some promise for reducing biases, but which also illustrate the limits of estimating sampling variance with only partial information on the underlying population social network.

Distributed parameter estimation in unreliable sensor networks via broadcast gossip algorithms.

Science.gov (United States)

Wang, Huiwei; Liao, Xiaofeng; Wang, Zidong; Huang, Tingwen; Chen, Guo

2016-01-01

In this paper, we present an asynchronous algorithm to estimate the unknown parameter under an unreliable network which allows new sensors to join and old sensors to leave, and can tolerate link failures. Each sensor has access to partially informative measurements when it is awakened. In addition, the proposed algorithm can avoid the interference among messages and effectively reduce the accumulated measurement and quantization errors. Based on the theory of stochastic approximation, we prove that our proposed algorithm almost surely converges to the unknown parameter. Finally, we present a numerical example to assess the performance and the communication cost of the algorithm. Copyright © 2015 Elsevier Ltd. All rights reserved.

An auxiliary optimization method for complex public transit route network based on link prediction

Science.gov (United States)

Zhang, Lin; Lu, Jian; Yue, Xianfei; Zhou, Jialin; Li, Yunxuan; Wan, Qian

2018-02-01

Inspired by the missing (new) link prediction and the spurious existing link identification in link prediction theory, this paper establishes an auxiliary optimization method for public transit route network (PTRN) based on link prediction. First, link prediction applied to PTRN is described, and based on reviewing the previous studies, the summary indices set and its algorithms set are collected for the link prediction experiment. Second, through analyzing the topological properties of Jinan’s PTRN established by the Space R method, we found that this is a typical small-world network with a relatively large average clustering coefficient. This phenomenon indicates that the structural similarity-based link prediction will show a good performance in this network. Then, based on the link prediction experiment of the summary indices set, three indices with maximum accuracy are selected for auxiliary optimization of Jinan’s PTRN. Furthermore, these link prediction results show that the overall layout of Jinan’s PTRN is stable and orderly, except for a partial area that requires optimization and reconstruction. The above pattern conforms to the general pattern of the optimal development stage of PTRN in China. Finally, based on the missing (new) link prediction and the spurious existing link identification, we propose optimization schemes that can be used not only to optimize current PTRN but also to evaluate PTRN planning.

Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches.

Science.gov (United States)

Enns, Eva A; Brandeau, Margaret L

2015-04-21

For many communicable diseases, knowledge of the underlying contact network through which the disease spreads is essential to determining appropriate control measures. When behavior change is the primary intervention for disease prevention, it is important to understand how to best modify network connectivity using the limited resources available to control disease spread. We describe and compare four algorithms for selecting a limited number of links to remove from a network: two "preventive" approaches (edge centrality, R0 minimization), where the decision of which links to remove is made prior to any disease outbreak and depends only on the network structure; and two "reactive" approaches (S-I edge centrality, optimal quarantining), where information about the initial disease states of the nodes is incorporated into the decision of which links to remove. We evaluate the performance of these algorithms in minimizing the total number of infections that occur over the course of an acute outbreak of disease. We consider different network structures, including both static and dynamic Erdös-Rényi random networks with varying levels of connectivity, a real-world network of residential hotels connected through injection drug use, and a network exhibiting community structure. We show that reactive approaches outperform preventive approaches in averting infections. Among reactive approaches, removing links in order of S-I edge centrality is favored when the link removal budget is small, while optimal quarantining performs best when the link removal budget is sufficiently large. The budget threshold above which optimal quarantining outperforms the S-I edge centrality algorithm is a function of both network structure (higher for unstructured Erdös-Rényi random networks compared to networks with community structure or the real-world network) and disease infectiousness (lower for highly infectious diseases). We conduct a value-of-information analysis of knowing which

Green IGP Link Weights for Energy-efficiency and Load-balancing in IP Backbone Networks

OpenAIRE

Francois, Frederic; Wang, Ning; Moessner, Klaus; Georgoulas, Stylianos; Xu, Ke

2013-01-01

The energy consumption of backbone networks has become a primary concern for network operators and regulators due to the pervasive deployment of wired backbone networks to meet the requirements of bandwidth-hungry applications. While traditional optimization of IGP link weights has been used in IP based load-balancing operations, in this paper we introduce a novel link weight setting algorithm, the Green Load-balancing Algorithm (GLA), which is able to jointly optimize both energy efficiency ...

High-Capacity Hybrid Optical Fiber-Wireless Communications Links in Access Networks

DEFF Research Database (Denmark)

Pang, Xiaodan

of broadband services access. To realize the seamless convergence between the two network segments, the lower capacity of wireless systems need to be increased to match the continuously increasing bandwidth of fiber-optic systems. The research works included in this thesis are devoted to experimental...... investigations of photonic-wireless links with record high capacities to fulfill the requirements of next generation hybrid optical fiber-wireless access networks. The main contributions of this thesis have expanded the state-of-the-art in two main areas: high speed millimeter-wave (mm-wave) communication links......Integration between fiber-optic and wireless communications systems in the "last mile" access networks is currently considered as a promising solution for both service providers and users, in terms of minimizing deployment cost, shortening upgrading period and increasing mobility and flexibility...

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

OpenAIRE

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

2017-01-01

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

Reconstruction of financial networks for robust estimation of systemic risk

Science.gov (United States)

Mastromatteo, Iacopo; Zarinelli, Elia; Marsili, Matteo

2012-03-01

In this paper we estimate the propagation of liquidity shocks through interbank markets when the information about the underlying credit network is incomplete. We show that techniques such as maximum entropy currently used to reconstruct credit networks severely underestimate the risk of contagion by assuming a trivial (fully connected) topology, a type of network structure which can be very different from the one empirically observed. We propose an efficient message-passing algorithm to explore the space of possible network structures and show that a correct estimation of the network degree of connectedness leads to more reliable estimations for systemic risk. Such an algorithm is also able to produce maximally fragile structures, providing a practical upper bound for the risk of contagion when the actual network structure is unknown. We test our algorithm on ensembles of synthetic data encoding some features of real financial networks (sparsity and heterogeneity), finding that more accurate estimations of risk can be achieved. Finally we find that this algorithm can be used to control the amount of information that regulators need to require from banks in order to sufficiently constrain the reconstruction of financial networks.

Reconstruction of financial networks for robust estimation of systemic risk

International Nuclear Information System (INIS)

Mastromatteo, Iacopo; Zarinelli, Elia; Marsili, Matteo

2012-01-01

In this paper we estimate the propagation of liquidity shocks through interbank markets when the information about the underlying credit network is incomplete. We show that techniques such as maximum entropy currently used to reconstruct credit networks severely underestimate the risk of contagion by assuming a trivial (fully connected) topology, a type of network structure which can be very different from the one empirically observed. We propose an efficient message-passing algorithm to explore the space of possible network structures and show that a correct estimation of the network degree of connectedness leads to more reliable estimations for systemic risk. Such an algorithm is also able to produce maximally fragile structures, providing a practical upper bound for the risk of contagion when the actual network structure is unknown. We test our algorithm on ensembles of synthetic data encoding some features of real financial networks (sparsity and heterogeneity), finding that more accurate estimations of risk can be achieved. Finally we find that this algorithm can be used to control the amount of information that regulators need to require from banks in order to sufficiently constrain the reconstruction of financial networks

Effectiveness evaluation of double-layered satellite network with laser and microwave hybrid links based on fuzzy analytic hierarchy process

Science.gov (United States)

Zhang, Wei; Rao, Qiaomeng

2018-01-01

In order to solve the problem of high speed, large capacity and limited spectrum resources of satellite communication network, a double-layered satellite network with global seamless coverage based on laser and microwave hybrid links is proposed in this paper. By analyzing the characteristics of the double-layered satellite network with laser and microwave hybrid links, an effectiveness evaluation index system for the network is established. And then, the fuzzy analytic hierarchy process, which combines the analytic hierarchy process and the fuzzy comprehensive evaluation theory, is used to evaluate the effectiveness of the double-layered satellite network with laser and microwave hybrid links. Furthermore, the evaluation result of the proposed hybrid link network is obtained by simulation. The effectiveness evaluation process of the proposed double-layered satellite network with laser and microwave hybrid links can help to optimize the design of hybrid link double-layered satellite network and improve the operating efficiency of the satellite system.

Joint Hybrid Backhaul and Access Links Design in Cloud-Radio Access Networks

KAUST Repository

Dhifallah, Oussama Najeeb

2015-09-06

The cloud-radio access network (CRAN) is expected to be the core network architecture for next generation mobile radio systems. In this paper, we consider the downlink of a CRAN formed of one central processor (the cloud) and several base station (BS), where each BS is connected to the cloud via either a wireless or capacity-limited wireline backhaul link. The paper addresses the joint design of the hybrid backhaul links (i.e., designing the wireline and wireless backhaul connections from the cloud to the BSs) and the access links (i.e., determining the sparse beamforming solution from the BSs to the users). The paper formulates the hybrid backhaul and access link design problem by minimizing the total network power consumption. The paper solves the problem using a two-stage heuristic algorithm. At one stage, the sparse beamforming solution is found using a weighted mixed 11/12 norm minimization approach; the correlation matrix of the quantization noise of the wireline backhaul links is computed using the classical rate-distortion theory. At the second stage, the transmit powers of the wireless backhaul links are found by solving a power minimization problem subject to quality-of-service constraints, based on the principle of conservation of rate by utilizing the rates found in the first stage. Simulation results suggest that the performance of the proposed algorithm approaches the global optimum solution, especially at high signal-to-interference-plus-noise ratio (SINR).

Cascaded optical fiber link using the internet network for remote clocks comparison.

Science.gov (United States)

Chiodo, Nicola; Quintin, Nicolas; Stefani, Fabio; Wiotte, Fabrice; Camisard, Emilie; Chardonnet, Christian; Santarelli, Giorgio; Amy-Klein, Anne; Pottie, Paul-Eric; Lopez, Olivier

2015-12-28

We report a cascaded optical link of 1100 km for ultra-stable frequency distribution over an Internet fiber network. The link is composed of four spans for which the propagation noise is actively compensated. The robustness and the performance of the link are ensured by five fully automated optoelectronic stations, two of them at the link ends, and three deployed on the field and connecting the spans. This device coherently regenerates the optical signal with the heterodyne optical phase locking of a low-noise laser diode. Optical detection of the beat-note signals for the laser lock and the link noise compensation are obtained with stable and low-noise fibered optical interferometer. We show 3.5 days of continuous operation of the noise-compensated 4-span cascaded link leading to fractional frequency instability of 4x10(-16) at 1-s measurement time and 1x10(-19) at 2000 s. This cascaded link was extended to 1480-km with the same performance. This work is a significant step towards a sustainable wide area ultra-stable optical frequency distribution and comparison network at a very high level of performance.

Elasticity in Physically Cross-Linked Amyloid Fibril Networks

Science.gov (United States)

Cao, Yiping; Bolisetty, Sreenath; Adamcik, Jozef; Mezzenga, Raffaele

2018-04-01

We provide a constitutive model of semiflexible and rigid amyloid fibril networks by combining the affine thermal model of network elasticity with the Derjaguin-Landau-Vervey-Overbeek (DLVO) theory of electrostatically charged colloids. When compared to rheological experiments on β -lactoglobulin and lysozyme amyloid networks, this approach provides the correct scaling of elasticity versus both concentration (G ˜c2.2 and G ˜c2.5 for semiflexible and rigid fibrils, respectively) and ionic strength (G ˜I4.4 and G ˜I3.8 for β -lactoglobulin and lysozyme, independent from fibril flexibility). The pivotal role played by the screening salt is to reduce the electrostatic barrier among amyloid fibrils, converting labile physical entanglements into long-lived cross-links. This gives a power-law behavior of G with I having exponents significantly larger than in other semiflexible polymer networks (e.g., actin) and carrying DLVO traits specific to the individual amyloid fibrils.

PWR system simulation and parameter estimation with neural networks

Energy Technology Data Exchange (ETDEWEB)

Akkurt, Hatice; Colak, Uener E-mail: uc@nuke.hacettepe.edu.tr

2002-11-01

A detailed nonlinear model for a typical PWR system has been considered for the development of simulation software. Each component in the system has been represented by appropriate differential equations. The SCILAB software was used for solving nonlinear equations to simulate steady-state and transient operational conditions. Overall system has been constructed by connecting individual components to each other. The validity of models for individual components and overall system has been verified. The system response against given transients have been analyzed. A neural network has been utilized to estimate system parameters during transients. Different transients have been imposed in training and prediction stages with neural networks. Reactor power and system reactivity during the transient event have been predicted by the neural network. Results show that neural networks estimations are in good agreement with the calculated response of the reactor system. The maximum errors are within {+-}0.254% for power and between -0.146 and 0.353% for reactivity prediction cases. Steam generator parameters, pressure and water level, are also successfully predicted by the neural network employed in this study. The noise imposed on the input parameters of the neural network deteriorates the power estimation capability whereas the reactivity estimation capability is not significantly affected.

PWR system simulation and parameter estimation with neural networks

International Nuclear Information System (INIS)

Akkurt, Hatice; Colak, Uener

2002-01-01

A detailed nonlinear model for a typical PWR system has been considered for the development of simulation software. Each component in the system has been represented by appropriate differential equations. The SCILAB software was used for solving nonlinear equations to simulate steady-state and transient operational conditions. Overall system has been constructed by connecting individual components to each other. The validity of models for individual components and overall system has been verified. The system response against given transients have been analyzed. A neural network has been utilized to estimate system parameters during transients. Different transients have been imposed in training and prediction stages with neural networks. Reactor power and system reactivity during the transient event have been predicted by the neural network. Results show that neural networks estimations are in good agreement with the calculated response of the reactor system. The maximum errors are within ±0.254% for power and between -0.146 and 0.353% for reactivity prediction cases. Steam generator parameters, pressure and water level, are also successfully predicted by the neural network employed in this study. The noise imposed on the input parameters of the neural network deteriorates the power estimation capability whereas the reactivity estimation capability is not significantly affected

Reef-fish larval dispersal patterns validate no-take marine reserve network connectivity that links human communities

Science.gov (United States)

Abesamis, Rene A.; Saenz-Agudelo, Pablo; Berumen, Michael L.; Bode, Michael; Jadloc, Claro Renato L.; Solera, Leilani A.; Villanoy, Cesar L.; Bernardo, Lawrence Patrick C.; Alcala, Angel C.; Russ, Garry R.

2017-09-01

Networks of no-take marine reserves (NTMRs) are a widely advocated strategy for managing coral reefs. However, uncertainty about the strength of population connectivity between individual reefs and NTMRs through larval dispersal remains a major obstacle to effective network design. In this study, larval dispersal among NTMRs and fishing grounds in the Philippines was inferred by conducting genetic parentage analysis on a coral-reef fish ( Chaetodon vagabundus). Adult and juvenile fish were sampled intensively in an area encompassing approximately 90 km of coastline. Thirty-seven true parent-offspring pairs were accepted after screening 1978 juveniles against 1387 adults. The data showed all types of dispersal connections that may occur in NTMR networks, with assignments suggesting connectivity among NTMRs and fishing grounds ( n = 35) far outnumbering those indicating self-recruitment ( n = 2). Critically, half (51%) of the inferred occurrences of larval dispersal linked reefs managed by separate, independent municipalities and constituent villages, emphasising the need for nested collaborative management arrangements across management units to sustain NTMR networks. Larval dispersal appeared to be influenced by wind-driven seasonal reversals in the direction of surface currents. The best-fit larval dispersal kernel estimated from the parentage data predicted that 50% of larvae originating from a population would attempt to settle within 33 km, and 95% within 83 km. Mean larval dispersal distance was estimated to be 36.5 km. These results suggest that creating a network of closely spaced (less than a few tens of km apart) NTMRs can enhance recruitment for protected and fished populations throughout the NTMR network. The findings underscore major challenges for regional coral-reef management initiatives that must be addressed with priority: (1) strengthening management of NTMR networks across political or customary boundaries; and (2) achieving adequate population

Reef-fish larval dispersal patterns validate no-take marine reserve network connectivity that links human communities

KAUST Repository

Abesamis, Rene A.

2017-03-24

Networks of no-take marine reserves (NTMRs) are a widely advocated strategy for managing coral reefs. However, uncertainty about the strength of population connectivity between individual reefs and NTMRs through larval dispersal remains a major obstacle to effective network design. In this study, larval dispersal among NTMRs and fishing grounds in the Philippines was inferred by conducting genetic parentage analysis on a coral-reef fish (Chaetodon vagabundus). Adult and juvenile fish were sampled intensively in an area encompassing approximately 90 km of coastline. Thirty-seven true parent-offspring pairs were accepted after screening 1978 juveniles against 1387 adults. The data showed all types of dispersal connections that may occur in NTMR networks, with assignments suggesting connectivity among NTMRs and fishing grounds (n = 35) far outnumbering those indicating self-recruitment (n = 2). Critically, half (51%) of the inferred occurrences of larval dispersal linked reefs managed by separate, independent municipalities and constituent villages, emphasising the need for nested collaborative management arrangements across management units to sustain NTMR networks. Larval dispersal appeared to be influenced by wind-driven seasonal reversals in the direction of surface currents. The best-fit larval dispersal kernel estimated from the parentage data predicted that 50% of larvae originating from a population would attempt to settle within 33 km, and 95% within 83 km. Mean larval dispersal distance was estimated to be 36.5 km. These results suggest that creating a network of closely spaced (less than a few tens of km apart) NTMRs can enhance recruitment for protected and fished populations throughout the NTMR network. The findings underscore major challenges for regional coral-reef management initiatives that must be addressed with priority: (1) strengthening management of NTMR networks across political or customary boundaries; and (2) achieving adequate population

Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics

Directory of Open Access Journals (Sweden)

Fei Gao

2015-01-01

Full Text Available Currently, we are experiencing a rapid growth of the number of social-based online systems. The availability of the vast amounts of data gathered in those systems brings new challenges that we face when trying to analyse it. One of the intensively researched topics is the prediction of social connections between users. Although a lot of effort has been made to develop new prediction approaches, the existing methods are not comprehensively analysed. In this paper we investigate the correlation between network metrics and accuracy of different prediction methods. We selected six time-stamped real-world social networks and ten most widely used link prediction methods. The results of the experiments show that the performance of some methods has a strong correlation with certain network metrics. We managed to distinguish “prediction friendly” networks, for which most of the prediction methods give good performance, as well as “prediction unfriendly” networks, for which most of the methods result in high prediction error. Correlation analysis between network metrics and prediction accuracy of prediction methods may form the basis of a metalearning system where based on network characteristics it will be able to recommend the right prediction method for a given network.

Epidemics in Adaptive Social Networks with Temporary Link Deactivation

Science.gov (United States)

Tunc, Ilker; Shkarayev, Maxim S.; Shaw, Leah B.

2013-04-01

Disease spread in a society depends on the topology of the network of social contacts. Moreover, individuals may respond to the epidemic by adapting their contacts to reduce the risk of infection, thus changing the network structure and affecting future disease spread. We propose an adaptation mechanism where healthy individuals may choose to temporarily deactivate their contacts with sick individuals, allowing reactivation once both individuals are healthy. We develop a mean-field description of this system and find two distinct regimes: slow network dynamics, where the adaptation mechanism simply reduces the effective number of contacts per individual, and fast network dynamics, where more efficient adaptation reduces the spread of disease by targeting dangerous connections. Analysis of the bifurcation structure is supported by numerical simulations of disease spread on an adaptive network. The system displays a single parameter-dependent stable steady state and non-monotonic dependence of connectivity on link deactivation rate.

Application of radial basis neural network for state estimation of ...

African Journals Online (AJOL)

An original application of radial basis function (RBF) neural network for power system state estimation is proposed in this paper. The property of massive parallelism of neural networks is employed for this. The application of RBF neural network for state estimation is investigated by testing its applicability on a IEEE 14 bus ...

Cardinality Estimation Algorithm in Large-Scale Anonymous Wireless Sensor Networks

KAUST Repository

Douik, Ahmed

2017-08-30

Consider a large-scale anonymous wireless sensor network with unknown cardinality. In such graphs, each node has no information about the network topology and only possesses a unique identifier. This paper introduces a novel distributed algorithm for cardinality estimation and topology discovery, i.e., estimating the number of node and structure of the graph, by querying a small number of nodes and performing statistical inference methods. While the cardinality estimation allows the design of more efficient coding schemes for the network, the topology discovery provides a reliable way for routing packets. The proposed algorithm is shown to produce a cardinality estimate proportional to the best linear unbiased estimator for dense graphs and specific running times. Simulation results attest the theoretical results and reveal that, for a reasonable running time, querying a small group of nodes is sufficient to perform an estimation of 95% of the whole network. Applications of this work include estimating the number of Internet of Things (IoT) sensor devices, online social users, active protein cells, etc.

Multi-link faults localization and restoration based on fuzzy fault set for dynamic optical networks.

Science.gov (United States)

Zhao, Yongli; Li, Xin; Li, Huadong; Wang, Xinbo; Zhang, Jie; Huang, Shanguo

2013-01-28

Based on a distributed method of bit-error-rate (BER) monitoring, a novel multi-link faults restoration algorithm is proposed for dynamic optical networks. The concept of fuzzy fault set (FFS) is first introduced for multi-link faults localization, which includes all possible optical equipment or fiber links with a membership describing the possibility of faults. Such a set is characterized by a membership function which assigns each object a grade of membership ranging from zero to one. OSPF protocol extension is designed for the BER information flooding in the network. The BER information can be correlated to link faults through FFS. Based on the BER information and FFS, multi-link faults localization mechanism and restoration algorithm are implemented and experimentally demonstrated on a GMPLS enabled optical network testbed with 40 wavelengths in each fiber link. Experimental results show that the novel localization mechanism has better performance compared with the extended limited perimeter vector matching (LVM) protocol and the restoration algorithm can improve the restoration success rate under multi-link faults scenario.

Estimating network effect in geocenter motion: Theory

Science.gov (United States)

Zannat, Umma Jamila; Tregoning, Paul

2017-10-01

Geophysical models and their interpretations of several processes of interest, such as sea level rise, postseismic relaxation, and glacial isostatic adjustment, are intertwined with the need to realize the International Terrestrial Reference Frame. However, this realization needs to take into account the geocenter motion, that is, the motion of the center of figure of the Earth surface, due to, for example, deformation of the surface by earthquakes or hydrological loading effects. Usually, there is also a discrepancy, known as the network effect, between the theoretically convenient center of figure and the physically accessible center of network frames, because of unavoidable factors such as uneven station distribution, lack of stations in the oceans, disparity in the coverage between the two hemispheres, and the existence of tectonically deforming zones. Here we develop a method to estimate the magnitude of the network effect, that is, the error introduced by the incomplete sampling of the Earth surface, in measuring the geocenter motion, for a network of space geodetic stations of a fixed size N. For this purpose, we use, as our proposed estimate, the standard deviations of the changes in Helmert parameters measured by a random network of the same size N. We show that our estimate scales as 1/√N and give an explicit formula for it in terms of the vector spherical harmonics expansion of the displacement field. In a complementary paper we apply this formalism to coseismic displacements and elastic deformations due to surface water movements.

A new way to improve the robustness of complex communication networks by allocating redundancy links

International Nuclear Information System (INIS)

Shi Chunhui; Zhuo Yue; Tang Jieying; Long Keping; Peng Yunfeng

2012-01-01

We investigate the robustness of complex communication networks on allocating redundancy links. The protecting key nodes (PKN) strategy is proposed to improve the robustness of complex communication networks against intentional attack. Our numerical simulations show that allocating a few redundant links among key nodes using the PKN strategy will significantly increase the robustness of scale-free complex networks. We have also theoretically proved and demonstrated the effectiveness of the PKN strategy. We expect that our work will help achieve a better understanding of communication networks. (paper)

Enhancing network performance under single link failure with AS-disjoint BGP extension

DEFF Research Database (Denmark)

Manolova, Anna Vasileva; Romeral, S.; Ruepp, Sarah Renée

2009-01-01

In this paper we propose an enhancement of the BGP protocol for obtaining AS-disjoint paths in GMPLS multi-domain networks. We evaluate the benefits of having AS-disjoint paths under single inter-domain link failure for two main applications: routing of future connection requests during routing...... protocol re-convergence and applying multi-domain restoration as survivability mechanism in case of a single link failure. The proposed BGP modification is a simple and effective solution for disjoint path selection in connection-oriented multi-domain networks. Our results show that applying the proper...

Sparse and shrunken estimates of MRI networks in the brain and their influence on network properties

DEFF Research Database (Denmark)

Romero-Garcia, Rafael; Clemmensen, Line Katrine Harder

2014-01-01

approaches showed more stable results with a relative low variance at the expense of a little bias. Interestingly, topological properties as local and global efficiency estimated in networks constructed from traditional non-regularized correlations also showed higher variability when compared to those from...... regularized networks. Our findings suggest that a population-based connectivity study can achieve a more robust description of cortical topology through regularization of the correlation estimates. Four regularization methods were examined: Two with shrinkage (Ridge and Schäfer’s shrinkage), one with sparsity...... (Lasso) and one with both shrinkage and sparsity (Elastic net). Furthermore, the different regularizations resulted in different correlation estimates as well as network properties. The shrunken estimates resulted in lower variance of the estimates than the sparse estimates....

Automated mode shape estimation in agent-based wireless sensor networks

Science.gov (United States)

Zimmerman, Andrew T.; Lynch, Jerome P.

2010-04-01

Recent advances in wireless sensing technology have made it possible to deploy dense networks of sensing transducers within large structural systems. Because these networks leverage the embedded computing power and agent-based abilities integral to many wireless sensing devices, it is possible to analyze sensor data autonomously and in-network. In this study, market-based techniques are used to autonomously estimate mode shapes within a network of agent-based wireless sensors. Specifically, recent work in both decentralized Frequency Domain Decomposition and market-based resource allocation is leveraged to create a mode shape estimation algorithm derived from free-market principles. This algorithm allows an agent-based wireless sensor network to autonomously shift emphasis between improving mode shape accuracy and limiting the consumption of certain scarce network resources: processing time, storage capacity, and power consumption. The developed algorithm is validated by successfully estimating mode shapes using a network of wireless sensor prototypes deployed on the mezzanine balcony of Hill Auditorium, located on the University of Michigan campus.

Distributed fusion estimation for sensor networks with communication constraints

CERN Document Server

Zhang, Wen-An; Song, Haiyu; Yu, Li

2016-01-01

This book systematically presents energy-efficient robust fusion estimation methods to achieve thorough and comprehensive results in the context of network-based fusion estimation. It summarizes recent findings on fusion estimation with communication constraints; several novel energy-efficient and robust design methods for dealing with energy constraints and network-induced uncertainties are presented, such as delays, packet losses, and asynchronous information... All the results are presented as algorithms, which are convenient for practical applications.

Application of Functional Link Artificial Neural Network for Prediction of Machinery Noise in Opencast Mines

Directory of Open Access Journals (Sweden)

Santosh Kumar Nanda

2011-01-01

Full Text Available Functional link-based neural network models were applied to predict opencast mining machineries noise. The paper analyzes the prediction capabilities of functional link neural network based noise prediction models vis-à-vis existing statistical models. In order to find the actual noise status in opencast mines, some of the popular noise prediction models, for example, ISO-9613-2, CONCAWE, VDI, and ENM, have been applied in mining and allied industries to predict the machineries noise by considering various attenuation factors. Functional link artificial neural network (FLANN, polynomial perceptron network (PPN, and Legendre neural network (LeNN were used to predict the machinery noise in opencast mines. The case study is based on data collected from an opencast coal mine of Orissa, India. From the present investigations, it could be concluded that the FLANN model give better noise prediction than the PPN and LeNN model.

Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks

Directory of Open Access Journals (Sweden)

Ispolatov Iaroslav

2008-10-01

Full Text Available Abstract Background Finding the dominant direction of flow of information in densely interconnected regulatory or signaling networks is required in many applications in computational biology and neuroscience. This is achieved by first identifying and removing links which close up feedback loops in the original network and hierarchically arranging nodes in the remaining network. In mathematical language this corresponds to a problem of making a graph acyclic by removing as few links as possible and thus altering the original graph in the least possible way. The exact solution of this problem requires enumeration of all cycles and combinations of removed links, which, as an NP-hard problem, is computationally prohibitive even for modest-size networks. Results We introduce and compare two approximate numerical algorithms for solving this problem: the probabilistic one based on a simulated annealing of the hierarchical layout of the network which minimizes the number of "backward" links going from lower to higher hierarchical levels, and the deterministic, "greedy" algorithm that sequentially cuts the links that participate in the largest number of feedback cycles. We find that the annealing algorithm outperforms the deterministic one in terms of speed, memory requirement, and the actual number of removed links. To further improve a visual perception of the layout produced by the annealing algorithm, we perform an additional minimization of the length of hierarchical links while keeping the number of anti-hierarchical links at their minimum. The annealing algorithm is then tested on several examples of regulatory and signaling networks/pathways operating in human cells. Conclusion The proposed annealing algorithm is powerful enough to performs often optimal layouts of protein networks in whole organisms, consisting of around ~104 nodes and ~105 links, while the applicability of the greedy algorithm is limited to individual pathways with ~100

A Network Coding Approach to Loss Tomography

DEFF Research Database (Denmark)

Sattari, Pegah; Markopoulou, Athina; Fragouli, Christina

2013-01-01

network coding capabilities. We design a framework for estimating link loss rates, which leverages network coding capabilities and we show that it improves several aspects of tomography, including the identifiability of links, the tradeoff between estimation accuracy and bandwidth efficiency......, and the complexity of probe path selection. We discuss the cases of inferring the loss rates of links in a tree topology or in a general topology. In the latter case, the benefits of our approach are even more pronounced compared to standard techniques but we also face novel challenges, such as dealing with cycles...

Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis

Directory of Open Access Journals (Sweden)

Rosario G. Garroppo

2013-01-01

Full Text Available The paper deeply analyzes a novel network-wide power management problem, called Power-Aware Routing and Network Design with Bundled Links (PARND-BL, which is able to take into account both the relationship between the power consumption and the traffic throughput of the nodes and to power off both the chassis and even the single Physical Interface Card (PIC composing each link. The solutions of the PARND-BL model have been analyzed by taking into account different aspects associated with the actual applicability in real network scenarios: (i the time for obtaining the solution, (ii the deployed network topology and the resulting topology provided by the solution, (iii the power behavior of the network elements, (iv the traffic load, (v the QoS requirement, and (vi the number of paths to route each traffic demand. Among the most interesting and novel results, our analysis shows that the strategy of minimizing the number of powered-on network elements through the traffic consolidation does not always produce power savings, and the solution of this kind of problems, in some cases, can lead to spliting a single traffic demand into a high number of paths.

A Mobility-Aware Link Enhancement Mechanism for Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Kai-Wen Hu

2008-04-01

Full Text Available With the growth up of internet in mobile commerce, researchers have reproduced various mobile applications that vary from entertainment and commercial services to diagnostic and safety tools. Mobility management has widely been recognized as one of the most challenging problems for seamless access to wireless networks. In this paper, a novel link enhancement mechanism is proposed to deal with mobility management problem in vehicular ad hoc networks. Two machine learning techniques, namely, particle swarm optimization and fuzzy logic systems, are incorporated into the proposed schemes to enhance the accuracy of prediction of link break and congestion occurrence. The experimental results verify the effectiveness and feasibility of the proposed schemes.

A Mobility-Aware Link Enhancement Mechanism for Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Huang Chenn-Jung

2008-01-01

Full Text Available Abstract With the growth up of internet in mobile commerce, researchers have reproduced various mobile applications that vary from entertainment and commercial services to diagnostic and safety tools. Mobility management has widely been recognized as one of the most challenging problems for seamless access to wireless networks. In this paper, a novel link enhancement mechanism is proposed to deal with mobility management problem in vehicular ad hoc networks. Two machine learning techniques, namely, particle swarm optimization and fuzzy logic systems, are incorporated into the proposed schemes to enhance the accuracy of prediction of link break and congestion occurrence. The experimental results verify the effectiveness and feasibility of the proposed schemes.

Linking structure and activity in nonlinear spiking networks.

Directory of Open Access Journals (Sweden)

Gabriel Koch Ocker

2017-06-01

Full Text Available Recent experimental advances are producing an avalanche of data on both neural connectivity and neural activity. To take full advantage of these two emerging datasets we need a framework that links them, revealing how collective neural activity arises from the structure of neural connectivity and intrinsic neural dynamics. This problem of structure-driven activity has drawn major interest in computational neuroscience. Existing methods for relating activity and architecture in spiking networks rely on linearizing activity around a central operating point and thus fail to capture the nonlinear responses of individual neurons that are the hallmark of neural information processing. Here, we overcome this limitation and present a new relationship between connectivity and activity in networks of nonlinear spiking neurons by developing a diagrammatic fluctuation expansion based on statistical field theory. We explicitly show how recurrent network structure produces pairwise and higher-order correlated activity, and how nonlinearities impact the networks' spiking activity. Our findings open new avenues to investigating how single-neuron nonlinearities-including those of different cell types-combine with connectivity to shape population activity and function.

Linking structure and activity in nonlinear spiking networks.

Science.gov (United States)

Ocker, Gabriel Koch; Josić, Krešimir; Shea-Brown, Eric; Buice, Michael A

2017-06-01

Recent experimental advances are producing an avalanche of data on both neural connectivity and neural activity. To take full advantage of these two emerging datasets we need a framework that links them, revealing how collective neural activity arises from the structure of neural connectivity and intrinsic neural dynamics. This problem of structure-driven activity has drawn major interest in computational neuroscience. Existing methods for relating activity and architecture in spiking networks rely on linearizing activity around a central operating point and thus fail to capture the nonlinear responses of individual neurons that are the hallmark of neural information processing. Here, we overcome this limitation and present a new relationship between connectivity and activity in networks of nonlinear spiking neurons by developing a diagrammatic fluctuation expansion based on statistical field theory. We explicitly show how recurrent network structure produces pairwise and higher-order correlated activity, and how nonlinearities impact the networks' spiking activity. Our findings open new avenues to investigating how single-neuron nonlinearities-including those of different cell types-combine with connectivity to shape population activity and function.

Imbalanced functional link between executive control network and reward network explain the online-game seeking behaviors in Internet gaming disorder.

Science.gov (United States)

Dong, Guangheng; Lin, Xiao; Hu, Yanbo; Xie, Chunming; Du, Xiaoxia

2015-03-17

Literatures have shown that Internet gaming disorder (IGD) subjects show impaired executive control and enhanced reward sensitivities than healthy controls. However, how these two networks jointly affect the valuation process and drive IGD subjects' online-game-seeking behaviors remains unknown. Thirty-five IGD and 36 healthy controls underwent a resting-states scan in the MRI scanner. Functional connectivity (FC) was examined within control and reward network seeds regions, respectively. Nucleus accumbens (NAcc) was selected as the node to find the interactions between these two networks. IGD subjects show decreased FC in the executive control network and increased FC in the reward network when comparing with the healthy controls. When examining the correlations between the NAcc and the executive control/reward networks, the link between the NAcc - executive control network is negatively related with the link between NAcc - reward network. The changes (decrease/increase) in IGD subjects' brain synchrony in control/reward networks suggest the inefficient/overly processing within neural circuitry underlying these processes. The inverse proportion between control network and reward network in IGD suggest that impairments in executive control lead to inefficient inhibition of enhanced cravings to excessive online game playing. This might shed light on the mechanistic understanding of IGD.

Macroecology of pollination networks

DEFF Research Database (Denmark)

Nielsen, Kristian Trøjelsgaard; Olesen, Jens Mogens

2013-01-01

towards the tropics, and that network topology would be affected by current climate. Location Global. Methods Each network was organized as a presence/absence matrix, consisting of P plant species, A pollinator species and their links. From these matrices, network parameters were estimated. Additionally...... with either latitude or elevation. However, network modularity decreased significantly with latitude whereas mean number of links per plant species (Lp) and A/P ratio peaked at mid-latitude. Above 500 m a.s.l., A/P ratio decreased and mean number of links per pollinator species (La) increased with elevation......Aim Interacting communities of species are organized into complex networks, and network analysis is reckoned to be a strong tool for describing their architecture. Many species assemblies show strong macroecological patterns, e.g. increasing species richness with decreasing latitude, but whether...

Modelling, Estimation and Control of Networked Complex Systems

CERN Document Server

Chiuso, Alessandro; Frasca, Mattia; Rizzo, Alessandro; Schenato, Luca; Zampieri, Sandro

2009-01-01

The paradigm of complexity is pervading both science and engineering, leading to the emergence of novel approaches oriented at the development of a systemic view of the phenomena under study; the definition of powerful tools for modelling, estimation, and control; and the cross-fertilization of different disciplines and approaches. This book is devoted to networked systems which are one of the most promising paradigms of complexity. It is demonstrated that complex, dynamical networks are powerful tools to model, estimate, and control many interesting phenomena, like agent coordination, synchronization, social and economics events, networks of critical infrastructures, resources allocation, information processing, or control over communication networks. Moreover, it is shown how the recent technological advances in wireless communication and decreasing in cost and size of electronic devices are promoting the appearance of large inexpensive interconnected systems, each with computational, sensing and mobile cap...

Probability Density Estimation Using Neural Networks in Monte Carlo Calculations

International Nuclear Information System (INIS)

Shim, Hyung Jin; Cho, Jin Young; Song, Jae Seung; Kim, Chang Hyo

2008-01-01

The Monte Carlo neutronics analysis requires the capability for a tally distribution estimation like an axial power distribution or a flux gradient in a fuel rod, etc. This problem can be regarded as a probability density function estimation from an observation set. We apply the neural network based density estimation method to an observation and sampling weight set produced by the Monte Carlo calculations. The neural network method is compared with the histogram and the functional expansion tally method for estimating a non-smooth density, a fission source distribution, and an absorption rate's gradient in a burnable absorber rod. The application results shows that the neural network method can approximate a tally distribution quite well. (authors)

Availability and Reliability of FSO Links Estimated from Visibility

Directory of Open Access Journals (Sweden)

M. Tatarko

2012-06-01

Full Text Available This paper is focused on estimation availability and reliability of FSO systems. Shortcut FSO means Free Space Optics. It is a system which allows optical transmission between two steady points. We can say that it is a last mile communication system. It is an optical communication system, but the propagation media is air. This solution of last mile does not require expensive optical fiber and establishing of connection is very simple. But there are some drawbacks which have a bad influence of quality of services and availability of the link. Number of phenomena in the atmosphere such as scattering, absorption and turbulence cause a large variation of receiving optical power and laser beam attenuation. The influence of absorption and turbulence can be significantly reduced by an appropriate design of FSO link. But the visibility has the main influence on quality of the optical transmission channel. Thus, in typical continental area where rain, snow or fog occurs is important to know their values. This article gives a description of device for measuring weather conditions and information about estimation of availability and reliability of FSO links in Slovakia.

Distributed state estimation for multi-agent based active distribution networks

NARCIS (Netherlands)

Nguyen, H.P.; Kling, W.L.

2010-01-01

Along with the large-scale implementation of distributed generators, the current distribution networks have changed gradually from passive to active operation. State estimation plays a vital role to facilitate this transition. In this paper, a suitable state estimation method for the active network

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

Science.gov (United States)

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.

Vision-based stress estimation model for steel frame structures with rigid links

Science.gov (United States)

Park, Hyo Seon; Park, Jun Su; Oh, Byung Kwan

2017-07-01

This paper presents a stress estimation model for the safety evaluation of steel frame structures with rigid links using a vision-based monitoring system. In this model, the deformed shape of a structure under external loads is estimated via displacements measured by a motion capture system (MCS), which is a non-contact displacement measurement device. During the estimation of the deformed shape, the effective lengths of the rigid link ranges in the frame structure are identified. The radius of the curvature of the structural member to be monitored is calculated using the estimated deformed shape and is employed to estimate stress. Using MCS in the presented model, the safety of a structure can be assessed gauge-freely. In addition, because the stress is directly extracted from the radius of the curvature obtained from the measured deformed shape, information on the loadings and boundary conditions of the structure are not required. Furthermore, the model, which includes the identification of the effective lengths of the rigid links, can consider the influences of the stiffness of the connection and support on the deformation in the stress estimation. To verify the applicability of the presented model, static loading tests for a steel frame specimen were conducted. By comparing the stress estimated by the model with the measured stress, the validity of the model was confirmed.

Time development in the early history of social networks: link stabilization, group dynamics, and segregation.

Science.gov (United States)

Bruun, Jesper; Bearden, Ian G

2014-01-01

Studies of the time development of empirical networks usually investigate late stages where lasting connections have already stabilized. Empirical data on early network history are rare but needed for a better understanding of how social network topology develops in real life. Studying students who are beginning their studies at a university with no or few prior connections to each other offers a unique opportunity to investigate the formation and early development of link patterns and community structure in social networks. During a nine week introductory physics course, first year physics students were asked to identify those with whom they communicated about problem solving in physics during the preceding week. We use these students' self reports to produce time dependent student interaction networks. We investigate these networks to elucidate possible effects of different student attributes in early network formation. Changes in the weekly number of links show that while roughly half of all links change from week to week, students also reestablish a growing number of links as they progress through their first weeks of study. Using the Infomap community detection algorithm, we show that the networks exhibit community structure, and we use non-network student attributes, such as gender and end-of-course grade to characterize communities during their formation. Specifically, we develop a segregation measure and show that students structure themselves according to gender and pre-organized sections (in which students engage in problem solving and laboratory work), but not according to end-of-coure grade. Alluvial diagrams of consecutive weeks' communities show that while student movement between groups are erratic in the beginning of their studies, they stabilize somewhat towards the end of the course. Taken together, the analyses imply that student interaction networks stabilize quickly and that students establish collaborations based on who is immediately

Linking Climate Risk, Policy Networks and Adaptation Planning in Public Lands

Science.gov (United States)

Lubell, M.; Schwartz, M.; Peters, C.

2014-12-01

Federal public land management agencies in the United States have engaged a variety of planning efforts to address climate adaptation. A major goal of these efforts is to build policy networks that enable land managers to access information and expertise needed for responding to local climate risks. This paper investigates whether the perceived and modeled climate risk faced by different land managers is leading to larger networks or more participating in climate adaptation. In theory, the benefits of climate planning networks are larger when land managers are facing more potential changes. The basic hypothesis is tested with a survey of public land managers from hundreds of local and regional public lands management units in the Southwestern United States, as well as other stakeholders involved with climate adaptation planning. All survey respondents report their perceptions of climate risk along a variety of dimensions, as well as their participation in climate adaptation planning and information sharing networks. For a subset of respondents, we have spatially explicity GIS data about their location, which will be linked with downscaled climate model data. With the focus on climate change, the analysis is a subset of the overall idea of linking social and ecological systems.

A Glider-Assisted Link Disruption Restoration Mechanism in Underwater Acoustic Sensor Networks

Directory of Open Access Journals (Sweden)

Zhigang Jin

2018-02-01

Full Text Available Underwater acoustic sensor networks (UASNs have become a hot research topic. In UASNs, nodes can be affected by ocean currents and external forces, which could result in sudden link disruption. Therefore, designing a flexible and efficient link disruption restoration mechanism to ensure the network connectivity is a challenge. In the paper, we propose a glider-assisted restoration mechanism which includes link disruption recognition and related link restoring mechanism. In the link disruption recognition mechanism, the cluster heads collect the link disruption information and then schedule gliders acting as relay nodes to restore the disrupted link. Considering the glider’s sawtooth motion, we design a relay location optimization algorithm with a consideration of both the glider’s trajectory and acoustic channel attenuation model. The utility function is established by minimizing the channel attenuation and the optimal location of glider is solved by a multiplier method. The glider-assisted restoration mechanism can greatly improve the packet delivery rate and reduce the communication energy consumption and it is more general for the restoration of different link disruption scenarios. The simulation results show that glider-assisted restoration mechanism can improve the delivery rate of data packets by 15–33% compared with cooperative opportunistic routing (OVAR, the hop-by-hop vector-based forwarding (HH-VBF and the vector based forward (VBF methods, and reduce communication energy consumption by 20–58% for a typical network’s setting.

Link-quality measurement and reporting in wireless sensor networks.

Science.gov (United States)

Chehri, Abdellah; Jeon, Gwanggil; Choi, Byoungjo

2013-03-04

Wireless Sensor networks (WSNs) are created by small hardware devices that possess the necessary functionalities to measure and exchange a variety of environmental data in their deployment setting. In this paper, we discuss the experiments in deploying a testbed as a first step towards creating a fully functional heterogeneous wireless network-based underground monitoring system. The system is mainly composed of mobile and static ZigBee nodes, which are deployed on the underground mine galleries for measuring ambient temperature. In addition, we describe the measured results of link characteristics such as received signal strength, latency and throughput for different scenarios.

Link-Quality Measurement and Reporting in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Byoungjo Choi

2013-03-01

Full Text Available Wireless Sensor networks (WSNs are created by small hardware devices that possess the necessary functionalities to measure and exchange a variety of environmental data in their deployment setting. In this paper, we discuss the experiments in deploying a testbed as a first step towards creating a fully functional heterogeneous wireless network-based underground monitoring system. The system is mainly composed of mobile and static ZigBee nodes, which are deployed on the underground mine galleries for measuring ambient temperature. In addition, we describe the measured results of link characteristics such as received signal strength, latency and throughput for different scenarios.

Impact of Radio Link Unreliability on the Connectivity of Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Gorce Jean-Marie

2007-01-01

Full Text Available Many works have been devoted to connectivity of ad hoc networks. This is an important feature for wireless sensor networks (WSNs to provide the nodes with the capability of communicating with one or several sinks. In most of these works, radio links are assumed ideal, that is, with no transmission errors. To fulfil this assumption, the reception threshold should be high enough to guarantee that radio links have a low transmission error probability. As a consequence, all unreliable links are dismissed. This approach is suboptimal concerning energy consumption because unreliable links should permit to reduce either the transmission power or the number of active nodes. The aim of this paper is to quantify the contribution of unreliable long hops to an increase of the connectivity of WSNs. In our model, each node is assumed to be connected to each other node in a probabilistic manner. Such a network is modeled as a complete random graph, that is, all edges exist. The instantaneous node degree is then defined as the number of simultaneous valid single-hop receptions of the same message, and finally the mean node degree is computed analytically in both AWGN and block-fading channels. We show the impact on connectivity of two MACs and routing parameters. The first one is the energy detection level such as the one used in carrier sense mechanisms. The second one is the reliability threshold used by the routing layer to select stable links only. Both analytic and simulation results show that using opportunistic protocols is challenging.

Impact of Radio Link Unreliability on the Connectivity of Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jean-Marie Gorce

2007-06-01

Full Text Available Many works have been devoted to connectivity of ad hoc networks. This is an important feature for wireless sensor networks (WSNs to provide the nodes with the capability of communicating with one or several sinks. In most of these works, radio links are assumed ideal, that is, with no transmission errors. To fulfil this assumption, the reception threshold should be high enough to guarantee that radio links have a low transmission error probability. As a consequence, all unreliable links are dismissed. This approach is suboptimal concerning energy consumption because unreliable links should permit to reduce either the transmission power or the number of active nodes. The aim of this paper is to quantify the contribution of unreliable long hops to an increase of the connectivity of WSNs. In our model, each node is assumed to be connected to each other node in a probabilistic manner. Such a network is modeled as a complete random graph, that is, all edges exist. The instantaneous node degree is then defined as the number of simultaneous valid single-hop receptions of the same message, and finally the mean node degree is computed analytically in both AWGN and block-fading channels. We show the impact on connectivity of two MACs and routing parameters. The first one is the energy detection level such as the one used in carrier sense mechanisms. The second one is the reliability threshold used by the routing layer to select stable links only. Both analytic and simulation results show that using opportunistic protocols is challenging.

Probing Rubber Cross-Linking Generation of Industrial Polymer Networks at Nanometer Scale.

Science.gov (United States)

Gabrielle, Brice; Gomez, Emmanuel; Korb, Jean-Pierre

2016-06-23

We present improved analyses of rheometric torque measurements as well as (1)H double-quantum (DQ) nuclear magnetic resonance (NMR) buildup data on polymer networks of industrial compounds. This latter DQ NMR analysis allows finding the distribution of an orientation order parameter (Dres) resulting from the noncomplete averaging of proton dipole-dipole couplings within the cross-linked polymer chains. We investigate the influence of the formulation (filler and vulcanization systems) as well as the process (curing temperature) ending to the final polymer network. We show that DQ NMR follows the generation of the polymer network during the vulcanization process from a heterogeneous network to a very homogeneous one. The time variations of microscopic Dres and macroscopic rheometric torques present power-law behaviors above a threshold time scale with characteristic exponents of the percolation theory. We observe also a very good linear correlation between the kinetics of Dres and rheometric data routinely performed in industry. All these observations confirm the description of the polymer network generation as a critical phenomenon. On the basis of all these results, we believe that DQ NMR could become a valuable tool for investigating in situ the cross-linking of industrial polymer networks at the nanometer scale.

Overlapping community detection in networks with positive and negative links

International Nuclear Information System (INIS)

Chen, Y; Wang, X L; Yuan, B; Tang, B Z

2014-01-01

Complex networks considering both positive and negative links have gained considerable attention during the past several years. Community detection is one of the main challenges for complex network analysis. Most of the existing algorithms for community detection in a signed network aim at providing a hard-partition of the network where any node should belong to a community or not. However, they cannot detect overlapping communities where a node is allowed to belong to multiple communities. The overlapping communities widely exist in many real-world networks. In this paper, we propose a signed probabilistic mixture (SPM) model for overlapping community detection in signed networks. Compared with the existing models, the advantages of our methodology are (i) providing soft-partition solutions for signed networks; (ii) providing soft memberships of nodes. Experiments on a number of signed networks show that our SPM model: (i) can identify assortative structures or disassortative structures as the same as other state-of-the-art models; (ii) can detect overlapping communities; (iii) outperforms other state-of-the-art models at shedding light on the community detection in synthetic signed networks. (paper)

Coevolution of game and network structure with adjustable linking

Science.gov (United States)

Qin, Shao-Meng; Zhang, Guo-Yong; Chen, Yong

2009-12-01

Most papers about the evolutionary game on graph assume the statistic network structure. However, in the real world, social interaction could change the relationship among people. And the change of social structure will also affect people’s strategies. We build a coevolution model of prisoner’s dilemma game and network structure to study the dynamic interaction in the real world. Differing from other coevolution models, players rewire their network connections according to the density of cooperation and other players’ payoffs. We use a parameter α to control the effect of payoff in the process of rewiring. Based on the asynchronous update rule and Monte Carlo simulation, we find that, when players prefer to rewire their links to those who are richer, the temptation can increase the cooperation density.

Performance of monitoring networks estimated from a Gaussian plume model

International Nuclear Information System (INIS)

Seebregts, A.J.; Hienen, J.F.A.

1990-10-01

In support of the ECN study on monitoring strategies after nuclear accidents, the present report describes the analysis of the performance of a monitoring network in a square grid. This network is used to estimate the distribution of the deposition pattern after a release of radioactivity into the atmosphere. The analysis is based upon a single release, a constant wind direction and an atmospheric dispersion according to a simplified Gaussian plume model. A technique is introduced to estimate the parameters in this Gaussian model based upon measurements at specific monitoring locations and linear regression, although this model is intrinsically non-linear. With these estimated parameters and the Gaussian model the distribution of the contamination due to deposition can be estimated. To investigate the relation between the network and the accuracy of the estimates for the deposition, deposition data have been generated by the Gaussian model, including a measurement error by a Monte Carlo simulation and this procedure has been repeated for several grid sizes, dispersion conditions, number of measurements per location, and errors per single measurement. The present technique has also been applied for the mesh sizes of two networks in the Netherlands, viz. the Landelijk Meetnet Radioaciviteit (National Measurement Network on Radioactivity, mesh size approx. 35 km) and the proposed Landelijk Meetnet Nucleaire Incidenten (National Measurement Network on Nuclear Incidents, mesh size approx. 15 km). The results show accuracies of 11 and 7 percent, respectively, if monitoring locations are used more than 10 km away from the postulated accident site. These figures are based upon 3 measurements per location and a dispersion during neutral weather with a wind velocity of 4 m/s. For stable weather conditions and low wind velocities, i.e. a small plume, the calculated accuracies are at least a factor 1.5 worse.The present type of analysis makes a cost-benefit approach to the

Kinetic limitation in the formation of end-linked elastomer networks

Czech Academy of Sciences Publication Activity Database

Meissner, Bohumil; Matějka, Libor

2005-01-01

Roč. 46, č. 24 (2005), s. 10618-10625 ISSN 0032-3861 R&D Projects: GA ČR GA203/05/2252 Keywords : end-linked elastomer networks * effect of stoichiometry * kinetic limitations Subject RIV: CD - Macromolecular Chemistry Impact factor: 2.849, year: 2005

Design and Analysis of Underwater Acoustic Networks with Reflected Links

Science.gov (United States)

Emokpae, Lloyd

Underwater acoustic networks (UWANs) have applications in environmental state monitoring, oceanic profile measurements, leak detection in oil fields, distributed surveillance, and navigation. For these applications, sets of nodes are employed to collaboratively monitor an area of interest and track certain events or phenomena. In addition, it is common to find autonomous underwater vehicles (AUVs) acting as mobile sensor nodes that perform search-and-rescue missions, reconnaissance in combat zones, and coastal patrol. These AUVs are to work cooperatively to achieve a desired goal and thus need to be able to, in an ad-hoc manner, establish and sustain communication links in order to ensure some desired level of quality of service. Therefore, each node is required to adapt to environmental changes and be able to overcome broken communication links caused by external noise affecting the communication channel due to node mobility. In addition, since radio waves are quickly absorbed in the water medium, it is common for most underwater applications to rely on acoustic (or sound) rather than radio channels for mid-to-long range communications. However, acoustic channels pose multiple challenging issues, most notably the high transmission delay due to slow signal propagation and the limited channel bandwidth due to high frequency attenuation. Moreover, the inhomogeneous property of the water medium affects the sound speed profile while the signal surface and bottom reflections leads to multipath effects. In this dissertation, we address these networking challenges by developing protocols that take into consideration the underwater physical layer dynamics. We begin by introducing a novel surface-based reflection scheme (SBR), which takes advantage of the multipath effects of the acoustic channel. SBR works by using reflections from the water surface, and bottom, to establish non-line-of-sight (NLOS) communication links. SBR makes it possible to incorporate both line

Shuttle Planning for Link Closures in Urban Public Transport Networks

DEFF Research Database (Denmark)

van der Hurk, Evelien; Koutsopoulos, Haris N.; Wilson, Nigel

2016-01-01

Urban public transport systems must periodically close certain links for maintenance, which can have significant effects on the service provided to passengers. In practice, the effects of closures are mitigated by replacing the closed links with a simple shuttle service. However, alternative...... cost, which includes transfers and frequency-dependent waiting time costs. This model is applied to a shuttle design problem based on a real-world case study of the Massachusetts Bay Transportation Authority network of Boston, Massachusetts. The results show that additional shuttle routes can reduce...

Link Power Budget and Traffict QoS Performance Analysis of Gygabit Passive Optical Network

Science.gov (United States)

Ubaidillah, A.; Alfita, R.; Toyyibah

2018-01-01

Data service of telecommunication network is needed widely in the world; therefore extra wide bandwidth must be provided. For this case, PT. Telekomunikasi Tbk. applies GPON (Gigabit Passive Optical Network) as optical fibre based on telecommunication network system. GPON is a point to a multipoint technology of FTTx (Fiber to The x) that transmits information signals to the subscriber over optical fibre. In GPON trunking system, from OLT (Optical Line Terminal), the network is split to many ONT (Optical Network Terminal) of the subscribers, so it causes path loss and attenuation. In this research, the GPON performance is measured from the link power budget system and the Quality of Service (QoS) of the traffic. And the observation result shows that the link power budget system of this GPON is in good condition. The link power budget values from the mathematical calculation and direct measurement are satisfy the ITU-T G984 Class B standard, that the power level must be between -8 dBm to -27 dBm. While from the traffic performance, the observation result shows that the network resource utility of the subscribers of the observed area is not optimum. The mean of subscriber utility rate is 27.985 bps for upstream and 79.687 bps for downstream. While maximally, It should be 60.800 bps for upstream and 486.400 bps for downstream.

Fine-granularity inference and estimations to network traffic for SDN.

Directory of Open Access Journals (Sweden)

Dingde Jiang

Full Text Available An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN. However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective.

Fine-granularity inference and estimations to network traffic for SDN.

Science.gov (United States)

Jiang, Dingde; Huo, Liuwei; Li, Ya

2018-01-01

An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective.

Estimation of parameter sensitivities for stochastic reaction networks

KAUST Repository

Gupta, Ankit

2016-01-07

Quantification of the effects of parameter uncertainty is an important and challenging problem in Systems Biology. We consider this problem in the context of stochastic models of biochemical reaction networks where the dynamics is described as a continuous-time Markov chain whose states represent the molecular counts of various species. For such models, effects of parameter uncertainty are often quantified by estimating the infinitesimal sensitivities of some observables with respect to model parameters. The aim of this talk is to present a holistic approach towards this problem of estimating parameter sensitivities for stochastic reaction networks. Our approach is based on a generic formula which allows us to construct efficient estimators for parameter sensitivity using simulations of the underlying model. We will discuss how novel simulation techniques, such as tau-leaping approximations, multi-level methods etc. can be easily integrated with our approach and how one can deal with stiff reaction networks where reactions span multiple time-scales. We will demonstrate the efficiency and applicability of our approach using many examples from the biological literature.

An Integrated Approach for Reliable Facility Location/Network Design Problem with Link Disruption

Directory of Open Access Journals (Sweden)

Davood Shishebori

2015-05-01

Full Text Available Proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. This paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. With respect to the probability of link disruptions, the objective function of the model minimizes the total costs, including location costs, link construction costs and also the expected transportation costs. An efficient hybrid algorithm based on LP relaxation and variable neighbourhood search metaheuristic is developed in order to solve the mathematical model. Numerical results demonstrate that the proposed hybrid algorithm has suitable efficiency in terms of duration of solution time and determining excellent solution quality.

Selective removal of heavy metal ions by disulfide linked polymer networks

DEFF Research Database (Denmark)

Ko, Dongah; Sung Lee, Joo; Patel, Hasmukh A.

2017-01-01

Heavy metal contaminated surface water is one of the oldest pollution problems, which is critical to ecosystems and human health. We devised disulfide linked polymer networks and employed as a sorbent for removing heavy metal ions from contaminated water. Although the polymer network material has...... a moderate surface area, it demonstrated cadmium removal efficiency equivalent to highly porous activated carbon while it showed 16 times faster sorption kinetics compared to activated carbon, owing to the high affinity of cadmium towards disulfide and thiol functionality in the polymer network. The metal...... sorption mechanism on polymer network was studied by sorption kinetics, effect of pH, and metal complexation. We observed that the metal ions―copper, cadmium, and zinc showed high binding affinity in polymer network, even in the presence of competing cations like calcium in water....

Community detection, link prediction, and layer interdependence in multilayer networks

Science.gov (United States)

De Bacco, Caterina; Power, Eleanor A.; Larremore, Daniel B.; Moore, Cristopher

2017-04-01

Complex systems are often characterized by distinct types of interactions between the same entities. These can be described as a multilayer network where each layer represents one type of interaction. These layers may be interdependent in complicated ways, revealing different kinds of structure in the network. In this work we present a generative model, and an efficient expectation-maximization algorithm, which allows us to perform inference tasks such as community detection and link prediction in this setting. Our model assumes overlapping communities that are common between the layers, while allowing these communities to affect each layer in a different way, including arbitrary mixtures of assortative, disassortative, or directed structure. It also gives us a mathematically principled way to define the interdependence between layers, by measuring how much information about one layer helps us predict links in another layer. In particular, this allows us to bundle layers together to compress redundant information and identify small groups of layers which suffice to predict the remaining layers accurately. We illustrate these findings by analyzing synthetic data and two real multilayer networks, one representing social support relationships among villagers in South India and the other representing shared genetic substring material between genes of the malaria parasite.

Parameter estimation in space systems using recurrent neural networks

Science.gov (United States)

Parlos, Alexander G.; Atiya, Amir F.; Sunkel, John W.

1991-01-01

The identification of time-varying parameters encountered in space systems is addressed, using artificial neural systems. A hybrid feedforward/feedback neural network, namely a recurrent multilayer perception, is used as the model structure in the nonlinear system identification. The feedforward portion of the network architecture provides its well-known interpolation property, while through recurrency and cross-talk, the local information feedback enables representation of temporal variations in the system nonlinearities. The standard back-propagation-learning algorithm is modified and it is used for both the off-line and on-line supervised training of the proposed hybrid network. The performance of recurrent multilayer perceptron networks in identifying parameters of nonlinear dynamic systems is investigated by estimating the mass properties of a representative large spacecraft. The changes in the spacecraft inertia are predicted using a trained neural network, during two configurations corresponding to the early and late stages of the spacecraft on-orbit assembly sequence. The proposed on-line mass properties estimation capability offers encouraging results, though, further research is warranted for training and testing the predictive capabilities of these networks beyond nominal spacecraft operations.

Directed networks' different link formation mechanisms causing degree distribution distinction

Science.gov (United States)

Behfar, Stefan Kambiz; Turkina, Ekaterina; Cohendet, Patrick; Burger-Helmchen, Thierry

2016-11-01

Within undirected networks, scientists have shown much interest in presenting power-law features. For instance, Barabási and Albert (1999) claimed that a common property of many large networks is that vertex connectivity follows scale-free power-law distribution, and in another study Barabási et al. (2002) showed power law evolution in the social network of scientific collaboration. At the same time, Jiang et al. (2011) discussed deviation from power-law distribution; others indicated that size effect (Bagrow et al., 2008), information filtering mechanism (Mossa et al., 2002), and birth and death process (Shi et al., 2005) could account for this deviation. Within directed networks, many authors have considered that outlinks follow a similar mechanism of creation as inlinks' (Faloutsos et al., 1999; Krapivsky et al., 2001; Tanimoto, 2009) with link creation rate being the linear function of node degree, resulting in a power-law shape for both indegree and outdegree distribution. Some other authors have made an assumption that directed networks, such as scientific collaboration or citation, behave as undirected, resulting in a power-law degree distribution accordingly (Barabási et al., 2002). At the same time, we claim (1) Outlinks feature different degree distributions than inlinks; where different link formation mechanisms cause the distribution distinctions, (2) in/outdegree distribution distinction holds for different levels of system decomposition; therefore this distribution distinction is a property of directed networks. First, we emphasize in/outlink formation mechanisms as causal factors for distinction between indegree and outdegree distributions (where this distinction has already been noticed in Barker et al. (2010) and Baxter et al. (2006)) within a sample network of OSS projects as well as Java software corpus as a network. Second, we analyze whether this distribution distinction holds for different levels of system decomposition: open

Virtual Sensor for Kinematic Estimation of Flexible Links in Parallel Robots.

Science.gov (United States)

Bengoa, Pablo; Zubizarreta, Asier; Cabanes, Itziar; Mancisidor, Aitziber; Pinto, Charles; Mata, Sara

2017-08-23

The control of flexible link parallel manipulators is still an open area of research, endpoint trajectory tracking being one of the main challenges in this type of robot. The flexibility and deformations of the limbs make the estimation of the Tool Centre Point (TCP) position a challenging one. Authors have proposed different approaches to estimate this deformation and deduce the location of the TCP. However, most of these approaches require expensive measurement systems or the use of high computational cost integration methods. This work presents a novel approach based on a virtual sensor which can not only precisely estimate the deformation of the flexible links in control applications (less than 2% error), but also its derivatives (less than 6% error in velocity and 13% error in acceleration) according to simulation results. The validity of the proposed Virtual Sensor is tested in a Delta Robot, where the position of the TCP is estimated based on the Virtual Sensor measurements with less than a 0.03% of error in comparison with the flexible approach developed in ADAMS Multibody Software.

Mathematical model of transmission network static state estimation

Directory of Open Access Journals (Sweden)

Ivanov Aleksandar

2012-01-01

Full Text Available In this paper the characteristics and capabilities of the power transmission network static state estimator are presented. The solving process of the mathematical model containing the measurement errors and their processing is developed. To evaluate difference between the general model of state estimation and the fast decoupled state estimation model, the both models are applied to an example, and so derived results are compared.

Application of Artificial Neural Networks for Efficient High-Resolution 2D DOA Estimation

Directory of Open Access Journals (Sweden)

M. Agatonović

2012-12-01

Full Text Available A novel method to provide high-resolution Two-Dimensional Direction of Arrival (2D DOA estimation employing Artificial Neural Networks (ANNs is presented in this paper. The observed space is divided into azimuth and elevation sectors. Multilayer Perceptron (MLP neural networks are employed to detect the presence of a source in a sector while Radial Basis Function (RBF neural networks are utilized for DOA estimation. It is shown that a number of appropriately trained neural networks can be successfully used for the high-resolution DOA estimation of narrowband sources in both azimuth and elevation. The training time of each smaller network is significantly re¬duced as different training sets are used for networks in detection and estimation stage. By avoiding the spectral search, the proposed method is suitable for real-time ap¬plications as it provides DOA estimates in a matter of seconds. At the same time, it demonstrates the accuracy comparable to that of the super-resolution 2D MUSIC algorithm.

The Effect of Error in Item Parameter Estimates on the Test Response Function Method of Linking.

Science.gov (United States)

Kaskowitz, Gary S.; De Ayala, R. J.

2001-01-01

Studied the effect of item parameter estimation for computation of linking coefficients for the test response function (TRF) linking/equating method. Simulation results showed that linking was more accurate when there was less error in the parameter estimates, and that 15 or 25 common items provided better results than 5 common items under both…

Building Student Networks with LinkedIn: The Potential for Connections, Internships, and Jobs

Science.gov (United States)

Peterson, Robert M.; Dover, Howard F.

2014-01-01

Networking is a chance to interact with people, build friendships or business partners, identify opportunities, and create value. Technology has made this process easier, since individuals can readily contact others who were previously unknown. In the professional world, LinkedIn has become the standard way to build virtual and personal networks.…

The Linking Probability of Deep Spider-Web Networks

OpenAIRE

Pippenger, Nicholas

2005-01-01

We consider crossbar switching networks with base $b$ (that is, constructed from $b\\times b$ crossbar switches), scale $k$ (that is, with $b^k$ inputs, $b^k$ outputs and $b^k$ links between each consecutive pair of stages) and depth $l$ (that is, with $l$ stages). We assume that the crossbars are interconnected according to the spider-web pattern, whereby two diverging paths reconverge only after at least $k$ stages. We assume that each vertex is independently idle with probability $q$, the v...

Usage of link-level performance indicators for HSDPA network-level simulations in E-UMTS

NARCIS (Netherlands)

Brouwer, Frank; de Bruin, I.C.C.; Silva, João Carlos; Souto, Nuno; Cercas, Francisco; Correia, Américo

2004-01-01

The paper describes integration of HSDPA (high-speed downlink packet access) link-level simulation results into network-level simulations for enhanced UMTS. The link-level simulations model all physical layer features depicted in the 3GPP standards. These include: generation of transport blocks;

Value Co-creation and Co-innovation: Linking Networked Organisations and Customer Communities

Science.gov (United States)

Romero, David; Molina, Arturo

Strategic networks such as Collaborative Networked Organisations (CNOs) and Virtual Customer Communities (VCCs) show a high potential as drivers of value co-creation and collaborative innovation in today’s Networking Era. Both look at the network structures as a source of jointly value creation and open innovation through access to new skills, knowledge, markets and technologies by sharing risk and integrating complementary competencies. This collaborative endeavour has proven to be able to enhance the adaptability and flexibility of CNOs and VCCs value creating systems in order to react in response to external drivers such as collaborative (business) opportunities. This paper presents a reference framework for creating interface networks, also known as ‘experience-centric networks’, as enablers for linking networked organisations and customer communities in order to support the establishment of user-driven and collaborative innovation networks.

Capacity planning of link restorable optical networks under dynamic change of traffic

Science.gov (United States)

Ho, Kwok Shing; Cheung, Kwok Wai

2005-11-01

Future backbone networks shall require full-survivability and support dynamic changes of traffic demands. The Generalized Survivable Networks (GSN) was proposed to meet these challenges. GSN is fully-survivable under dynamic traffic demand changes, so it offers a practical and guaranteed characterization framework for ASTN / ASON survivable network planning and bandwidth-on-demand resource allocation 4. The basic idea of GSN is to incorporate the non-blocking network concept into the survivable network models. In GSN, each network node must specify its I/O capacity bound which is taken as constraints for any allowable traffic demand matrix. In this paper, we consider the following generic GSN network design problem: Given the I/O bounds of each network node, find a routing scheme (and the corresponding rerouting scheme under failure) and the link capacity assignment (both working and spare) which minimize the cost, such that any traffic matrix consistent with the given I/O bounds can be feasibly routed and it is single-fault tolerant under the link restoration scheme. We first show how the initial, infeasible formal mixed integer programming formulation can be transformed into a more feasible problem using the duality transformation of the linear program. Then we show how the problem can be simplified using the Lagrangian Relaxation approach. Previous work has outlined a two-phase approach for solving this problem where the first phase optimizes the working capacity assignment and the second phase optimizes the spare capacity assignment. In this paper, we present a jointly optimized framework for dimensioning the survivable optical network with the GSN model. Experiment results show that the jointly optimized GSN can bring about on average of 3.8% cost savings when compared with the separate, two-phase approach. Finally, we perform a cost comparison and show that GSN can be deployed with a reasonable cost.

Estimating cellular network performance during hurricanes

International Nuclear Information System (INIS)

Booker, Graham; Torres, Jacob; Guikema, Seth; Sprintson, Alex; Brumbelow, Kelly

2010-01-01

Cellular networks serve a critical role during and immediately after a hurricane, allowing citizens to contact emergency services when land-line communication is lost and serving as a backup communication channel for emergency responders. However, due to their ubiquitous deployment and limited design for extreme loading events, basic network elements, such as cellular towers and antennas are prone to failures during adverse weather conditions such as hurricanes. Accordingly, a systematic and computationally feasible approach is required for assessing and improving the reliability of cellular networks during hurricanes. In this paper we develop a new multi-disciplinary approach to efficiently and accurately assess cellular network reliability during hurricanes. We show how the performance of a cellular network during and immediately after future hurricanes can be estimated based on a combination of hurricane wind field models, structural reliability analysis, Monte Carlo simulation, and cellular network models and simulation tools. We then demonstrate the use of this approach for assessing the improvement in system reliability that can be achieved with discrete topological changes in the system. Our results suggest that adding redundancy, particularly through a mesh topology or through the addition of an optical fiber ring around the perimeter of the system can be an effective way to significantly increase the reliability of some cellular systems during hurricanes.

Congestion estimation technique in the optical network unit registration process.

Science.gov (United States)

Kim, Geunyong; Yoo, Hark; Lee, Dongsoo; Kim, Youngsun; Lim, Hyuk

2016-07-01

We present a congestion estimation technique (CET) to estimate the optical network unit (ONU) registration success ratio for the ONU registration process in passive optical networks. An optical line terminal (OLT) estimates the number of collided ONUs via the proposed scheme during the serial number state. The OLT can obtain congestion level among ONUs to be registered such that this information may be exploited to change the size of a quiet window to decrease the collision probability. We verified the efficiency of the proposed method through simulation and experimental results.

Neural networks for link prediction in realistic biomedical graphs: a multi-dimensional evaluation of graph embedding-based approaches.

Science.gov (United States)

Crichton, Gamal; Guo, Yufan; Pyysalo, Sampo; Korhonen, Anna

2018-05-21

Link prediction in biomedical graphs has several important applications including predicting Drug-Target Interactions (DTI), Protein-Protein Interaction (PPI) prediction and Literature-Based Discovery (LBD). It can be done using a classifier to output the probability of link formation between nodes. Recently several works have used neural networks to create node representations which allow rich inputs to neural classifiers. Preliminary works were done on this and report promising results. However they did not use realistic settings like time-slicing, evaluate performances with comprehensive metrics or explain when or why neural network methods outperform. We investigated how inputs from four node representation algorithms affect performance of a neural link predictor on random- and time-sliced biomedical graphs of real-world sizes (∼ 6 million edges) containing information relevant to DTI, PPI and LBD. We compared the performance of the neural link predictor to those of established baselines and report performance across five metrics. In random- and time-sliced experiments when the neural network methods were able to learn good node representations and there was a negligible amount of disconnected nodes, those approaches outperformed the baselines. In the smallest graph (∼ 15,000 edges) and in larger graphs with approximately 14% disconnected nodes, baselines such as Common Neighbours proved a justifiable choice for link prediction. At low recall levels (∼ 0.3) the approaches were mostly equal, but at higher recall levels across all nodes and average performance at individual nodes, neural network approaches were superior. Analysis showed that neural network methods performed well on links between nodes with no previous common neighbours; potentially the most interesting links. Additionally, while neural network methods benefit from large amounts of data, they require considerable amounts of computational resources to utilise them. Our results indicate

Estimation of effective connectivity using multi-layer perceptron artificial neural network.

Science.gov (United States)

Talebi, Nasibeh; Nasrabadi, Ali Motie; Mohammad-Rezazadeh, Iman

2018-02-01

Studies on interactions between brain regions estimate effective connectivity, (usually) based on the causality inferences made on the basis of temporal precedence. In this study, the causal relationship is modeled by a multi-layer perceptron feed-forward artificial neural network, because of the ANN's ability to generate appropriate input-output mapping and to learn from training examples without the need of detailed knowledge of the underlying system. At any time instant, the past samples of data are placed in the network input, and the subsequent values are predicted at its output. To estimate the strength of interactions, the measure of " Causality coefficient " is defined based on the network structure, the connecting weights and the parameters of hidden layer activation function. Simulation analysis demonstrates that the method, called "CREANN" (Causal Relationship Estimation by Artificial Neural Network), can estimate time-invariant and time-varying effective connectivity in terms of MVAR coefficients. The method shows robustness with respect to noise level of data. Furthermore, the estimations are not significantly influenced by the model order (considered time-lag), and the different initial conditions (initial random weights and parameters of the network). CREANN is also applied to EEG data collected during a memory recognition task. The results implicate that it can show changes in the information flow between brain regions, involving in the episodic memory retrieval process. These convincing results emphasize that CREANN can be used as an appropriate method to estimate the causal relationship among brain signals.

From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks.

KAUST Repository

Cannistraci, C.V.

2013-04-08

Growth and remodelling impact the network topology of complex systems, yet a general theory explaining how new links arise between existing nodes has been lacking, and little is known about the topological properties that facilitate link-prediction. Here we investigate the extent to which the connectivity evolution of a network might be predicted by mere topological features. We show how a link/community-based strategy triggers substantial prediction improvements because it accounts for the singular topology of several real networks organised in multiple local communities - a tendency here named local-community-paradigm (LCP). We observe that LCP networks are mainly formed by weak interactions and characterise heterogeneous and dynamic systems that use self-organisation as a major adaptation strategy. These systems seem designed for global delivery of information and processing via multiple local modules. Conversely, non-LCP networks have steady architectures formed by strong interactions, and seem designed for systems in which information/energy storage is crucial.

Improving the Network Scale-Up Estimator: Incorporating Means of Sums, Recursive Back Estimation, and Sampling Weights.

Directory of Open Access Journals (Sweden)

Patrick Habecker

Full Text Available Researchers interested in studying populations that are difficult to reach through traditional survey methods can now draw on a range of methods to access these populations. Yet many of these methods are more expensive and difficult to implement than studies using conventional sampling frames and trusted sampling methods. The network scale-up method (NSUM provides a middle ground for researchers who wish to estimate the size of a hidden population, but lack the resources to conduct a more specialized hidden population study. Through this method it is possible to generate population estimates for a wide variety of groups that are perhaps unwilling to self-identify as such (for example, users of illegal drugs or other stigmatized populations via traditional survey tools such as telephone or mail surveys--by asking a representative sample to estimate the number of people they know who are members of such a "hidden" subpopulation. The original estimator is formulated to minimize the weight a single scaling variable can exert upon the estimates. We argue that this introduces hidden and difficult to predict biases, and instead propose a series of methodological advances on the traditional scale-up estimation procedure, including a new estimator. Additionally, we formalize the incorporation of sample weights into the network scale-up estimation process, and propose a recursive process of back estimation "trimming" to identify and remove poorly performing predictors from the estimation process. To demonstrate these suggestions we use data from a network scale-up mail survey conducted in Nebraska during 2014. We find that using the new estimator and recursive trimming process provides more accurate estimates, especially when used in conjunction with sampling weights.

Managing coopetition through horizontal supply chain relations : Linking dyadic and network levels of analysis

NARCIS (Netherlands)

Wilhelm, Miriam M.

2011-01-01

A growing research stream has expanded the level of analysis beyond single buyer-supplier relations to the network, including supplier-supplier relations. These supplier-supplier relations may constitute a missing link between the traditional analysis of the dyadic and the network level of analysis

Managing coopetition through horizontal supply chain relations : Linking dyadic and network levels of analysis

NARCIS (Netherlands)

Wilhelm, Miriam M.

A growing research stream has expanded the level of analysis beyond single buyer-supplier relations to the network, including supplier-supplier relations. These supplier-supplier relations may constitute a missing link between the traditional analysis of the dyadic and the network level of analysis

Reprocessing and Recycling of Highly Cross-Linked Ion-Conducting Networks through Transalkylation Exchanges of C-N Bonds.

Science.gov (United States)

Obadia, Mona M; Mudraboyina, Bhanu P; Serghei, Anatoli; Montarnal, Damien; Drockenmuller, Eric

2015-05-13

Exploiting exchangeable covalent bonds as dynamic cross-links recently afforded a new class of polymer materials coined as vitrimers. These permanent networks are insoluble and infusible, but the network topology can be reshuffled at high temperatures, thus enabling glasslike plastic deformation and reprocessing without depolymerization. We disclose herein the development of functional and high-value ion-conducting vitrimers that take inspiration from poly(ionic liquid)s. Tunable networks with high ionic content are obtained by the solvent- and catalyst-free polyaddition of an α-azide-ω-alkyne monomer and simultaneous alkylation of the resulting poly(1,2,3-triazole)s with a series of difunctional cross-linking agents. Temperature-induced transalkylation exchanges of C-N bonds between 1,2,3-triazolium cross-links and halide-functionalized dangling chains enable recycling and reprocessing of these highly cross-linked permanent networks. They can also be recycled by depolymerization with specific solvents able to displace the transalkylation equilibrium, and they display a great potential for applications that require solid electrolytes with excellent mechanical performances and facile processing such as supercapacitors, batteries, fuel cells, and separation membranes.

Efficient Algorithm for Computing Link-based Similarity in Real World Networks

DEFF Research Database (Denmark)

Cai, Yuanzhe; Cong, Gao; Xu, Jia

2009-01-01

Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiti...

Weed Growth Stage Estimator Using Deep Convolutional Neural Networks

DEFF Research Database (Denmark)

Teimouri, Nima; Dyrmann, Mads; Nielsen, Per Rydahl

2018-01-01

conditions with regards to soil types, resolution and light settings. Then, 9649 of these images were used for training the computer, which automatically divided the weeds into nine growth classes. The performance of this proposed convolutional neural network approach was evaluated on a further set of 2516...... in estimating the number of leaves and 96% accuracy when accepting a deviation of two leaves. These results show that this new method of using deep convolutional neural networks has a relatively high ability to estimate early growth stages across a wide variety of weed species....

Adjustment of positional geodetic networks by unconventional estimations

Directory of Open Access Journals (Sweden)

Silvia Gašincová

2010-06-01

Full Text Available The content of this paper is the adjustment of positional geodetic networks by robust estimations. The techniques (basedon the unconventional estimations of repeated least-square method which have turned out to be suitable and applicable in the practisehave been demonstrated on the example of the local geodetic network, which was founded to compose this thesis. In the thesisthe following techniques have been chosen to compare the Method of least-squares with those many published in foreign literature:M-estimation of Biweight,M-estimation of Welsch and Danish method. All presented methods are based on the repeated least-squaremethod principle with gradual changing of weight of individual measurements. In the first stage a standard least-square method wascarried out in the following steps – iterations we gradually change individual weights according to the relevant instructions/ regulation(so-called weight function. Iteration process will be stopped when no deviated measurements are found in the file of measured data.MatLab programme version 5.2 T was used to implement mathematical adjustment.

Social networks and links to isolation and loneliness among elderly HCBS clients.

Science.gov (United States)

Medvene, Louis J; Nilsen, Kari M; Smith, Rachel; Ofei-Dodoo, Samuel; DiLollo, Anthony; Webster, Noah; Graham, Annette; Nance, Anita

2016-01-01

The purpose of this study was to explore the network types of HCBS clients based on the structural characteristics of their social networks. We also examined how the network types were associated with social isolation, relationship quality and loneliness. Forty personal interviews were carried out with HCBS clients to assess the structure of their social networks as indicated by frequency of contact with children, friends, family and participation in religious and community organizations. Hierarchical cluster analysis was conducted to identify network types. Four network types were found including: family (n = 16), diverse (n = 8), restricted (n = 8) and religious (n = 7). Family members comprised almost half of participants' social networks, and friends comprised less than one-third. Clients embedded in family, diverse and religious networks had significantly more positive relationships than clients embedded in restricted networks. Clients embedded in restricted networks had significantly higher social isolation scores and were lonelier than clients in diverse and family networks. The findings suggest that HCBS clients' isolation and loneliness are linked to the types of social networks in which they are embedded. The findings also suggest that clients embedded in restricted networks are at high risk for negative outcomes.

Event-Triggered Fault Estimation for Stochastic Systems over Multi-Hop Relay Networks with Randomly Occurring Sensor Nonlinearities and Packet Dropouts.

Science.gov (United States)

Li, Yunji; Peng, Li

2018-02-28

Wireless sensors have many new applications where remote estimation is essential. Considering that a remote estimator is located far away from the process and the wireless transmission distance of sensor nodes is limited, sensor nodes always forward data packets to the remote estimator through a series of relays over a multi-hop link. In this paper, we consider a network with sensor nodes and relay nodes where the relay nodes can forward the estimated values to the remote estimator. An event-triggered remote estimator of state and fault with the corresponding data-forwarding scheme is investigated for stochastic systems subject to both randomly occurring nonlinearity and randomly occurring packet dropouts governed by Bernoulli-distributed sequences to achieve a trade-off between estimation accuracy and energy consumption. Recursive Riccati-like matrix equations are established to calculate the estimator gain to minimize an upper bound of the estimator error covariance. Subsequently, a sufficient condition and data-forwarding scheme are presented under which the error covariance is mean-square bounded in the multi-hop links with random packet dropouts. Furthermore, implementation issues of the theoretical results are discussed where a new data-forwarding communication protocol is designed. Finally, the effectiveness of the proposed algorithms and communication protocol are extensively evaluated using an experimental platform that was established for performance evaluation with a sensor and two relay nodes.

Establishing a Statistical Link between Network Oscillations and Neural Synchrony.

Directory of Open Access Journals (Sweden)

Pengcheng Zhou

2015-10-01

Full Text Available Pairs of active neurons frequently fire action potentials or "spikes" nearly synchronously (i.e., within 5 ms of each other. This spike synchrony may occur by chance, based solely on the neurons' fluctuating firing patterns, or it may occur too frequently to be explicable by chance alone. When spike synchrony above chances levels is present, it may subserve computation for a specific cognitive process, or it could be an irrelevant byproduct of such computation. Either way, spike synchrony is a feature of neural data that should be explained. A point process regression framework has been developed previously for this purpose, using generalized linear models (GLMs. In this framework, the observed number of synchronous spikes is compared to the number predicted by chance under varying assumptions about the factors that affect each of the individual neuron's firing-rate functions. An important possible source of spike synchrony is network-wide oscillations, which may provide an essential mechanism of network information flow. To establish the statistical link between spike synchrony and network-wide oscillations, we have integrated oscillatory field potentials into our point process regression framework. We first extended a previously-published model of spike-field association and showed that we could recover phase relationships between oscillatory field potentials and firing rates. We then used this new framework to demonstrate the statistical relationship between oscillatory field potentials and spike synchrony in: 1 simulated neurons, 2 in vitro recordings of hippocampal CA1 pyramidal cells, and 3 in vivo recordings of neocortical V4 neurons. Our results provide a rigorous method for establishing a statistical link between network oscillations and neural synchrony.

Linking social and pathogen transmission networks using microbial genetics in giraffe (Giraffa camelopardalis).

Science.gov (United States)

VanderWaal, Kimberly L; Atwill, Edward R; Isbell, Lynne A; McCowan, Brenda

2014-03-01

Although network analysis has drawn considerable attention as a promising tool for disease ecology, empirical research has been hindered by limitations in detecting the occurrence of pathogen transmission (who transmitted to whom) within social networks. Using a novel approach, we utilize the genetics of a diverse microbe, Escherichia coli, to infer where direct or indirect transmission has occurred and use these data to construct transmission networks for a wild giraffe population (Giraffe camelopardalis). Individuals were considered to be a part of the same transmission chain and were interlinked in the transmission network if they shared genetic subtypes of E. coli. By using microbial genetics to quantify who transmits to whom independently from the behavioural data on who is in contact with whom, we were able to directly investigate how the structure of contact networks influences the structure of the transmission network. To distinguish between the effects of social and environmental contact on transmission dynamics, the transmission network was compared with two separate contact networks defined from the behavioural data: a social network based on association patterns, and a spatial network based on patterns of home-range overlap among individuals. We found that links in the transmission network were more likely to occur between individuals that were strongly linked in the social network. Furthermore, individuals that had more numerous connections or that occupied 'bottleneck' positions in the social network tended to occupy similar positions in the transmission network. No similar correlations were observed between the spatial and transmission networks. This indicates that an individual's social network position is predictive of transmission network position, which has implications for identifying individuals that function as super-spreaders or transmission bottlenecks in the population. These results emphasize the importance of association patterns in

A common brain network links development, aging, and vulnerability to disease.

Science.gov (United States)

Douaud, Gwenaëlle; Groves, Adrian R; Tamnes, Christian K; Westlye, Lars Tjelta; Duff, Eugene P; Engvig, Andreas; Walhovd, Kristine B; James, Anthony; Gass, Achim; Monsch, Andreas U; Matthews, Paul M; Fjell, Anders M; Smith, Stephen M; Johansen-Berg, Heidi

2014-12-09

Several theories link processes of development and aging in humans. In neuroscience, one model posits for instance that healthy age-related brain degeneration mirrors development, with the areas of the brain thought to develop later also degenerating earlier. However, intrinsic evidence for such a link between healthy aging and development in brain structure remains elusive. Here, we show that a data-driven analysis of brain structural variation across 484 healthy participants (8-85 y) reveals a largely--but not only--transmodal network whose lifespan pattern of age-related change intrinsically supports this model of mirroring development and aging. We further demonstrate that this network of brain regions, which develops relatively late during adolescence and shows accelerated degeneration in old age compared with the rest of the brain, characterizes areas of heightened vulnerability to unhealthy developmental and aging processes, as exemplified by schizophrenia and Alzheimer's disease, respectively. Specifically, this network, while derived solely from healthy subjects, spatially recapitulates the pattern of brain abnormalities observed in both schizophrenia and Alzheimer's disease. This network is further associated in our large-scale healthy population with intellectual ability and episodic memory, whose impairment contributes to key symptoms of schizophrenia and Alzheimer's disease. Taken together, our results suggest that the common spatial pattern of abnormalities observed in these two disorders, which emerge at opposite ends of the life spectrum, might be influenced by the timing of their separate and distinct pathological processes in disrupting healthy cerebral development and aging, respectively.

Infrared and Visible links for medical Body Sensor Networks

OpenAIRE

Lebas , C; Sahuguede , S; Julien-Vergonjanne , A; Combeau , P; Aveneau , L

2018-01-01

International audience; — Our previous studies focused on channel simulation and performance evaluation of optical wireless links for medical body sensor networks. This allowed us to increase our expertise in this field and to propose here a full optical wireless bidirectional system named as LiFi communication system for medical monitoring applications. The full duplex bidirectional communication is based on an infrared uplink and visible downlink. The studied scenario considers a patient we...

Linear and nonlinear ARMA model parameter estimation using an artificial neural network

Science.gov (United States)

Chon, K. H.; Cohen, R. J.

1997-01-01

This paper addresses parametric system identification of linear and nonlinear dynamic systems by analysis of the input and output signals. Specifically, we investigate the relationship between estimation of the system using a feedforward neural network model and estimation of the system by use of linear and nonlinear autoregressive moving-average (ARMA) models. By utilizing a neural network model incorporating a polynomial activation function, we show the equivalence of the artificial neural network to the linear and nonlinear ARMA models. We compare the parameterization of the estimated system using the neural network and ARMA approaches by utilizing data generated by means of computer simulations. Specifically, we show that the parameters of a simulated ARMA system can be obtained from the neural network analysis of the simulated data or by conventional least squares ARMA analysis. The feasibility of applying neural networks with polynomial activation functions to the analysis of experimental data is explored by application to measurements of heart rate (HR) and instantaneous lung volume (ILV) fluctuations.

Transport link scanner: simulating geographic transport network expansion through individual investments

Science.gov (United States)

Jacobs-Crisioni, C.; Koopmans, C. C.

2016-07-01

This paper introduces a GIS-based model that simulates the geographic expansion of transport networks by several decision-makers with varying objectives. The model progressively adds extensions to a growing network by choosing the most attractive investments from a limited choice set. Attractiveness is defined as a function of variables in which revenue and broader societal benefits may play a role and can be based on empirically underpinned parameters that may differ according to private or public interests. The choice set is selected from an exhaustive set of links and presumably contains those investment options that best meet private operator's objectives by balancing the revenues of additional fare against construction costs. The investment options consist of geographically plausible routes with potential detours. These routes are generated using a fine-meshed regularly latticed network and shortest path finding methods. Additionally, two indicators of the geographic accuracy of the simulated networks are introduced. A historical case study is presented to demonstrate the model's first results. These results show that the modelled networks reproduce relevant results of the historically built network with reasonable accuracy.

Linked versus unlinked hospital discharge data on hip fractures for estimating incidence and comorbidity profiles.

Science.gov (United States)

Vu, Trang; Day, Lesley; Finch, Caroline F

2012-08-01

Studies comparing internally linked (person-identifying) and unlinked (episodes of care) hospital discharge data (HDD) on hip fractures have mainly focused on incidence overestimation by unlinked HDD, but little is known about the impact of overestimation on patient profiles such as comorbidity estimates. In view of the continuing use of unlinked HDD in hip fracture research and the desire to apply research results to hip fracture prevention, we concurrently assessed the accuracy of both incidence and comorbidity estimates derived from unlinked HDD compared to those estimated from internally linked HDD. We analysed unlinked and internally linked HDD between 01 July 2005 and 30 June 2008, inclusive, from Victoria, Australia to estimate the incidence of hospital admission for fall-related hip fracture in community-dwelling older people aged 65+ years and determine the prevalence of comorbidity in patients. Community-dwelling status was defined as living in private residence, supported residential facilities or special accommodation but not in nursing homes. We defined internally linked HDD as the reference standard and calculated measures of accuracy of fall-related hip fracture incidence by unlinked HDD using standard definitions. The extent to which comorbidity prevalence estimates by unlinked HDD differed from those by the reference standard was assessed in absolute terms. The sensitivity and specificity of a standard approach for estimating fall-related hip fracture incidence using unlinked HDD (i.e. omitting records of in-hospital deaths, inter-hospital transfers and readmissions within 30 days of discharge) were 94.4% and 97.5%, respectively. The standard approach and its variants underestimated the prevalence of some comorbidities and altered their ranking. The use of more stringent selection criteria led to major improvements in all measures of accuracy as well as overall and specific comorbidity estimates. This study strongly supports the use of linked

Manifold absolute pressure estimation using neural network with hybrid training algorithm.

Directory of Open Access Journals (Sweden)

Mohd Taufiq Muslim

Full Text Available In a modern small gasoline engine fuel injection system, the load of the engine is estimated based on the measurement of the manifold absolute pressure (MAP sensor, which took place in the intake manifold. This paper present a more economical approach on estimating the MAP by using only the measurements of the throttle position and engine speed, resulting in lower implementation cost. The estimation was done via two-stage multilayer feed-forward neural network by combining Levenberg-Marquardt (LM algorithm, Bayesian Regularization (BR algorithm and Particle Swarm Optimization (PSO algorithm. Based on the results found in 20 runs, the second variant of the hybrid algorithm yields a better network performance than the first variant of hybrid algorithm, LM, LM with BR and PSO by estimating the MAP closely to the simulated MAP values. By using a valid experimental training data, the estimator network that trained with the second variant of the hybrid algorithm showed the best performance among other algorithms when used in an actual retrofit fuel injection system (RFIS. The performance of the estimator was also validated in steady-state and transient condition by showing a closer MAP estimation to the actual value.

Manifold absolute pressure estimation using neural network with hybrid training algorithm.

Science.gov (United States)

Muslim, Mohd Taufiq; Selamat, Hazlina; Alimin, Ahmad Jais; Haniff, Mohamad Fadzli

2017-01-01

In a modern small gasoline engine fuel injection system, the load of the engine is estimated based on the measurement of the manifold absolute pressure (MAP) sensor, which took place in the intake manifold. This paper present a more economical approach on estimating the MAP by using only the measurements of the throttle position and engine speed, resulting in lower implementation cost. The estimation was done via two-stage multilayer feed-forward neural network by combining Levenberg-Marquardt (LM) algorithm, Bayesian Regularization (BR) algorithm and Particle Swarm Optimization (PSO) algorithm. Based on the results found in 20 runs, the second variant of the hybrid algorithm yields a better network performance than the first variant of hybrid algorithm, LM, LM with BR and PSO by estimating the MAP closely to the simulated MAP values. By using a valid experimental training data, the estimator network that trained with the second variant of the hybrid algorithm showed the best performance among other algorithms when used in an actual retrofit fuel injection system (RFIS). The performance of the estimator was also validated in steady-state and transient condition by showing a closer MAP estimation to the actual value.

Enhancement of Localization Accuracy in Cellular Networks via Cooperative AdHoc Links

DEFF Research Database (Denmark)

Lhomme, Edouard; Frattasi, Simone; Figueiras, Joao

2006-01-01

Positioning information enables new applications for cellular phones, personal communication systems, and specialized mobile radios. The network heterogeneity emerging in the fourth generation (4G) of mobile networks can be utilized for enhancements of the location estimation accuracy...

Rate-based congestion control in networks with smart links, revision. B.S. Thesis - May 1988

Science.gov (United States)

Heybey, Andrew Tyrrell

1990-01-01

The author uses a network simulator to explore rate-based congestion control in networks with smart links that can feed back information to tell senders to adjust their transmission rates. This method differs in a very important way from congestion control in which a congested network component just drops packets - the most commonly used method. It is clearly advantageous for the links in the network to communicate with the end users about the network capacity, rather than the users unilaterally picking a transmission rate. The components in the middle of the network, not the end users, have information about the capacity and traffic in the network. The author experiments with three different algorithms for calculating the control rate to feed back to the users. All of the algorithms exhibit problems in the form of large queues when simulated with a configuration modeling the dynamics of a packet-voice system. However, the problems are not with the algorithms themselves, but with the fact that feedback takes time. If the network steady-state utilization is low enough that it can absorb transients in the traffic through it, then the large queues disappear. If the users are modified to start sending slowly, to allow the network to adapt to a new flow without causing congestion, a greater portion of the network's bandwidth can be used.

Position estimation of transceivers in communication networks

Science.gov (United States)

Kent, Claudia A [Pleasanton, CA; Dowla, Farid [Castro Valley, CA

2008-06-03

This invention provides a system and method using wireless communication interfaces coupled with statistical processing of time-of-flight data to locate by position estimation unknown wireless receivers. Such an invention can be applied in sensor network applications, such as environmental monitoring of water in the soil or chemicals in the air where the position of the network nodes is deemed critical. Moreover, the present invention can be arranged to operate in areas where a Global Positioning System (GPS) is not available, such as inside buildings, caves, and tunnels.

LINKEDIN TRILOGY: Part 1. Top 10 Reasons You Should NOT Join LinkedIn Professional Network!

Science.gov (United States)

Berk, Ronald A.

2013-01-01

Disclaimer: I have been an active "free" user of LinkedIn for 5.463 years with more than 3000 (1st degree) connections from all over the world. I have no vested interest in LinkedIn other than as a user of the services it provides. Despite the fact that LinkedIn was originally designed as a network for business professionals, not…

Link reliability based hybrid routing for tactical mobile ad hoc network

Institute of Scientific and Technical Information of China (English)

Xie Xiaochuan; Wei Gang; Wu Keping; Wang Gang; Jia Shilou

2008-01-01

Tactical mobile ad hoc network (MANET) is a collection of mobile nodes forming a temporary network,without the aid of pre-established network infrastructure. The routing protocol has a crucial impact on the networkperformance in battlefields. Link reliability based hybrid routing (LRHR) is proposed, which is a novel hybrid routing protocol, for tactical MANET. Contrary to the traditional single path routing strategy, multiple paths are established between a pair of source-destination nodes. In the hybrid routing strategy, the rate of topological change provides a natural mechanism for switching dynamically between table-driven and on-demand routing. The simulation results indicate that the performances of the protocol in packet delivery ratio, routing overhead, and average end-to-end delay are better than the conventional routing protocol.

Estimating Ads’ Click through Rate with Recurrent Neural Network

Directory of Open Access Journals (Sweden)

Chen Qiao-Hong

2016-01-01

Full Text Available With the development of the Internet, online advertising spreads across every corner of the world, the ads' click through rate (CTR estimation is an important method to improve the online advertising revenue. Compared with the linear model, the nonlinear models can study much more complex relationships between a large number of nonlinear characteristics, so as to improve the accuracy of the estimation of the ads’ CTR. The recurrent neural network (RNN based on Long-Short Term Memory (LSTM is an improved model of the feedback neural network with ring structure. The model overcomes the problem of the gradient of the general RNN. Experiments show that the RNN based on LSTM exceeds the linear models, and it can effectively improve the estimation effect of the ads’ click through rate.

Design of Artificial Neural Network-Based pH Estimator

Directory of Open Access Journals (Sweden)

Shebel A. Alsabbah

2010-10-01

Full Text Available Taking into consideration the cost, size and drawbacks might be found with real hardware instrument for measuring pH values such that the complications of the wiring, installing, calibrating and troubleshooting the system, would make a person look for a cheaper, accurate, and alternative choice to perform the measuring operation, Where’s hereby, a feedforward artificial neural network-based pH estimator has to be proposed. The proposed estimator has been designed with multi- layer perceptrons. One input which is a measured base stream and two outputs represent pH values at strong base and strong/weak acids for a titration process. The created data base has been obtained with consideration of temperature variation. The final numerical results ensure the effectiveness and robustness of the design neural network-based pH estimator.

Robust nonlinear autoregressive moving average model parameter estimation using stochastic recurrent artificial neural networks

DEFF Research Database (Denmark)

Chon, K H; Hoyer, D; Armoundas, A A

1999-01-01

In this study, we introduce a new approach for estimating linear and nonlinear stochastic autoregressive moving average (ARMA) model parameters, given a corrupt signal, using artificial recurrent neural networks. This new approach is a two-step approach in which the parameters of the deterministic...... part of the stochastic ARMA model are first estimated via a three-layer artificial neural network (deterministic estimation step) and then reestimated using the prediction error as one of the inputs to the artificial neural networks in an iterative algorithm (stochastic estimation step). The prediction...... error is obtained by subtracting the corrupt signal of the estimated ARMA model obtained via the deterministic estimation step from the system output response. We present computer simulation examples to show the efficacy of the proposed stochastic recurrent neural network approach in obtaining accurate...

Artificial Neural Network Based State Estimators Integrated into Kalmtool

DEFF Research Database (Denmark)

Bayramoglu, Enis; Ravn, Ole; Poulsen, Niels Kjølstad

2012-01-01

In this paper we present a toolbox enabling easy evaluation and comparison of dierent ltering algorithms. The toolbox is called Kalmtool and is a set of MATLAB tools for state estimation of nonlinear systems. The toolbox now contains functions for Articial Neural Network Based State Estimation as...

Energy parameter estimation in solar powered wireless sensor networks

KAUST Repository

Mousa, Mustafa; Claudel, Christian G.

2014-01-01

The operation of solar powered wireless sensor networks is associated with numerous challenges. One of the main challenges is the high variability of solar power input and battery capacity, due to factors such as weather, humidity, dust and temperature. In this article, we propose a set of tools that can be implemented onboard high power wireless sensor networks to estimate the battery condition and capacity as well as solar power availability. These parameters are very important to optimize sensing and communications operations and maximize the reliability of the complete system. Experimental results show that the performance of typical Lithium Ion batteries severely degrades outdoors in a matter of weeks or months, and that the availability of solar energy in an urban solar powered wireless sensor network is highly variable, which underlines the need for such power and energy estimation algorithms.

Energy parameter estimation in solar powered wireless sensor networks

KAUST Repository

Mousa, Mustafa

2014-02-24

The operation of solar powered wireless sensor networks is associated with numerous challenges. One of the main challenges is the high variability of solar power input and battery capacity, due to factors such as weather, humidity, dust and temperature. In this article, we propose a set of tools that can be implemented onboard high power wireless sensor networks to estimate the battery condition and capacity as well as solar power availability. These parameters are very important to optimize sensing and communications operations and maximize the reliability of the complete system. Experimental results show that the performance of typical Lithium Ion batteries severely degrades outdoors in a matter of weeks or months, and that the availability of solar energy in an urban solar powered wireless sensor network is highly variable, which underlines the need for such power and energy estimation algorithms.

Estimating Usage Can Reduce the Stress of Social Networking

OpenAIRE

Zhou, Y.; Bird, J.; Cox, A. L.; Brumby, D.

2013-01-01

Social networks are increasingly popular and provide benefits such as easy peer group communication. However, there is evidence that they can have negative consequences, such as increased stress levels. For two weeks, we provided participants with an objective measure of their social network usage and also asked them for a daily estimate of their usage over the previous 24 hours. Although their social network usage did not significantly change, participants’ perception of this activity was tr...

An RSS based location estimation technique for cognitive relay networks

KAUST Repository

Qaraqe, Khalid A.; Hussain, Syed Imtiaz; Ç elebi, Hasari Burak; Abdallah, Mohamed M.; Alouini, Mohamed-Slim

2010-01-01

In this paper, a received signal strength (RSS) based location estimation method is proposed for a cooperative wireless relay network where the relay is a cognitive radio. We propose a method for the considered cognitive relay network to determine

Small vessel disease is linked to disrupted structural network covariance in Alzheimer's disease.

Science.gov (United States)

Nestor, Sean M; Mišić, Bratislav; Ramirez, Joel; Zhao, Jiali; Graham, Simon J; Verhoeff, Nicolaas P L G; Stuss, Donald T; Masellis, Mario; Black, Sandra E

2017-07-01

Cerebral small vessel disease (SVD) is thought to contribute to Alzheimer's disease (AD) through abnormalities in white matter networks. Gray matter (GM) hub covariance networks share only partial overlap with white matter connectivity, and their relationship with SVD has not been examined in AD. We developed a multivariate analytical pipeline to elucidate the cortical GM thickness systems that covary with major network hubs and assessed whether SVD and neurodegenerative pathologic markers were associated with attenuated covariance network integrity in mild AD and normal elderly control subjects. SVD burden was associated with reduced posterior cingulate corticocortical GM network integrity and subneocorticocortical hub network integrity in AD. These findings provide evidence that SVD is linked to the selective disruption of cortical hub GM networks in AD brains and point to the need to consider GM hub covariance networks when assessing network disruption in mixed disease. Copyright © 2017 the Alzheimer's Association. Published by Elsevier Inc. All rights reserved.

Estimating marine aerosol particle volume and number from Maritime Aerosol Network data

Directory of Open Access Journals (Sweden)

A. M. Sayer

2012-09-01

Full Text Available As well as spectral aerosol optical depth (AOD, aerosol composition and concentration (number, volume, or mass are of interest for a variety of applications. However, remote sensing of these quantities is more difficult than for AOD, as it is more sensitive to assumptions relating to aerosol composition. This study uses spectral AOD measured on Maritime Aerosol Network (MAN cruises, with the additional constraint of a microphysical model for unpolluted maritime aerosol based on analysis of Aerosol Robotic Network (AERONET inversions, to estimate these quantities over open ocean. When the MAN data are subset to those likely to be comprised of maritime aerosol, number and volume concentrations obtained are physically reasonable. Attempts to estimate surface concentration from columnar abundance, however, are shown to be limited by uncertainties in vertical distribution. Columnar AOD at 550 nm and aerosol number for unpolluted maritime cases are also compared with Moderate Resolution Imaging Spectroradiometer (MODIS data, for both the present Collection 5.1 and forthcoming Collection 6. MODIS provides a best-fitting retrieval solution, as well as the average for several different solutions, with different aerosol microphysical models. The "average solution" MODIS dataset agrees more closely with MAN than the "best solution" dataset. Terra tends to retrieve lower aerosol number than MAN, and Aqua higher, linked with differences in the aerosol models commonly chosen. Collection 6 AOD is likely to agree more closely with MAN over open ocean than Collection 5.1. In situations where spectral AOD is measured accurately, and aerosol microphysical properties are reasonably well-constrained, estimates of aerosol number and volume using MAN or similar data would provide for a greater variety of potential comparisons with aerosol properties derived from satellite or chemistry transport model data. However, without accurate AOD data and prior knowledge of

A fuzzy neural network for sensor signal estimation

International Nuclear Information System (INIS)

Na, Man Gyun

2000-01-01

In this work, a fuzzy neural network is used to estimate the relevant sensor signal using other sensor signals. Noise components in input signals into the fuzzy neural network are removed through the wavelet denoising technique. Principal component analysis (PCA) is used to reduce the dimension of an input space without losing a significant amount of information. A lower dimensional input space will also usually reduce the time necessary to train a fuzzy-neural network. Also, the principal component analysis makes easy the selection of the input signals into the fuzzy neural network. The fuzzy neural network parameters are optimized by two learning methods. A genetic algorithm is used to optimize the antecedent parameters of the fuzzy neural network and a least-squares algorithm is used to solve the consequent parameters. The proposed algorithm was verified through the application to the pressurizer water level and the hot-leg flowrate measurements in pressurized water reactors

Lewis Information Network (LINK): Background and overview

Science.gov (United States)

Schulte, Roger R.

1987-01-01

The NASA Lewis Research Center supports many research facilities with many isolated buildings, including wind tunnels, test cells, and research laboratories. These facilities are all located on a 350 acre campus adjacent to the Cleveland Hopkins Airport. The function of NASA-Lewis is to do basic and applied research in all areas of aeronautics, fluid mechanics, materials and structures, space propulsion, and energy systems. These functions require a great variety of remote high speed, high volume data communications for computing and interactive graphic capabilities. In addition, new requirements for local distribution of intercenter video teleconferencing and data communications via satellite have developed. To address these and future communications requirements for the next 15 yrs, a project team was organized to design and implement a new high speed communication system that would handle both data and video information in a common lab-wide Local Area Network. The project team selected cable television broadband coaxial cable technology as the communications medium and first installation of in-ground cable began in the summer of 1980. The Lewis Information Network (LINK) became operational in August 1982 and has become the backbone of all data communications and video.

Criteria for Evaluating Alternative Network and Link Layer Protocols for the NASA Constellation Program Communication Architecture

Science.gov (United States)

Benbenek, Daniel; Soloff, Jason; Lieb, Erica

2010-01-01

Selecting a communications and network architecture for future manned space flight requires an evaluation of the varying goals and objectives of the program, development of communications and network architecture evaluation criteria, and assessment of critical architecture trades. This paper uses Cx Program proposed exploration activities as a guideline; lunar sortie, outpost, Mars, and flexible path options are described. A set of proposed communications network architecture criteria are proposed and described. They include: interoperability, security, reliability, and ease of automating topology changes. Finally a key set of architecture options are traded including (1) multiplexing data at a common network layer vs. at the data link layer, (2) implementing multiple network layers vs. a single network layer, and (3) the use of a particular network layer protocol, primarily IPv6 vs. Delay Tolerant Networking (DTN). In summary, the protocol options are evaluated against the proposed exploration activities and their relative performance with respect to the criteria are assessed. An architectural approach which includes (a) the capability of multiplexing at both the network layer and the data link layer and (b) a single network layer for operations at each program phase, as these solutions are best suited to respond to the widest array of program needs and meet each of the evaluation criteria.

Distributed estimation based on observations prediction in wireless sensor networks

KAUST Repository

Bouchoucha, Taha; Ahmed, Mohammed F A; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

We consider wireless sensor networks (WSNs) used for distributed estimation of unknown parameters. Due to the limited bandwidth, sensor nodes quantize their noisy observations before transmission to a fusion center (FC) for the estimation process

Deep convolutional neural networks for estimating porous material parameters with ultrasound tomography

Science.gov (United States)

Lähivaara, Timo; Kärkkäinen, Leo; Huttunen, Janne M. J.; Hesthaven, Jan S.

2018-02-01

We study the feasibility of data based machine learning applied to ultrasound tomography to estimate water-saturated porous material parameters. In this work, the data to train the neural networks is simulated by solving wave propagation in coupled poroviscoelastic-viscoelastic-acoustic media. As the forward model, we consider a high-order discontinuous Galerkin method while deep convolutional neural networks are used to solve the parameter estimation problem. In the numerical experiment, we estimate the material porosity and tortuosity while the remaining parameters which are of less interest are successfully marginalized in the neural networks-based inversion. Computational examples confirms the feasibility and accuracy of this approach.

Using LinkedIn in the Marketing Classroom: Exploratory Insights and Recommendations for Teaching Social Media/Networking

Science.gov (United States)

McCorkle, Denny E.; McCorkle, Yuhua Li

2012-01-01

With the rapid growth of social networking and media comes their consideration for use in the marketing classroom. Social networking skills are becoming essential for personal branding (e.g., networking, self-marketing) and corporate/product branding (e.g., marketing communication). This paper addresses the use of LinkedIn (i.e., an online…

A Review Paper On Exploring Text Link And Spacial-Temporal Information In Social Media Networks

Directory of Open Access Journals (Sweden)

Dr. Mamta Madan

2015-03-01

Full Text Available ABSTRACT The objective of this paper is to have a literature review on the various methods to mine the knowledge from the social media by taking advantage of embedded heterogeneous information. Specifically we are trying to review different types of mining framework which provides us useful information from these networks that have heterogeneous data types including text spacial-temporal and data association LINK information. Firstly we will discuss the link mining to study the link structure with respect to Social Media SM. Secondly we summarize the various text mining models thirdly we shall review spacial as well the temporal models to extract or detect the frequent related topics from SM. Fourthly we will try to figure out few improvised models that take advantage of the link textual temporal and spacial information which motivates to discover progressive principles and fresh methodologies for DM Data Mining in social media networks SMNs.

A Robust Approach for Clock Offset Estimation in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Kim Jang-Sub

2010-01-01

Full Text Available The maximum likelihood estimators (MLEs for the clock phase offset assuming a two-way message exchange mechanism between the nodes of a wireless sensor network were recently derived assuming Gaussian and exponential network delays. However, the MLE performs poorly in the presence of non-Gaussian or nonexponential network delay distributions. Currently, there is a need to develop clock synchronization algorithms that are robust to the distribution of network delays. This paper proposes a clock offset estimator based on the composite particle filter (CPF to cope with the possible asymmetries and non-Gaussianity of the network delay distributions. Also, a variant of the CPF approach based on the bootstrap sampling (BS is shown to exhibit good performance in the presence of reduced number of observations. Computer simulations illustrate that the basic CPF and its BS-based variant present superior performance than MLE under general random network delay distributions such as asymmetric Gaussian, exponential, Gamma, Weibull as well as various mixtures.

The Trust-Committment-Flexibility Link in Transnational Buyer-Supplier Relationships: A Network Perspective

Directory of Open Access Journals (Sweden)

Matevž Rašković

2015-06-01

Full Text Available The purpose of this paper is to analyze the manner in which trust and commitment impact relationship flexibility in a transnational buyer-supplier network context. There is an abundance of research on trust and commitment related to buyer-supplier relationships in the marketing literature; however, their link to relationship flexibility in particular has not attracted much attention within the marketing field to date. Whereas the marketing literature tends to focus on traditional performance outcomes in buyer-supplier relationships (i.e. financial performance, satisfaction, loyalty, the supply chain management literature emphasizes the importance of flexibility as fundamental characteristics of well-performing supply networks. In this paper, a novel network analysis approach is employed for the marketing literature to analyze the link between trust, commitment and relationship flexibility. The analyzed network is a two-mode, egocentric and valued network, consisting of 11 purchasing managers and 53 suppliers connected to a transnational company in the steel construction industry with headquarters in Slovenia. To analyze the impact of trust and commitment on buyer-supplier relationship flexibility, a Multiple Regression Quadratic Assignment Procedure (MRQAP approach was used. Results show that trust and commitment are not just important determinants of buyer-supplier relationship flexibility in a network context, but also how their impact on relationship flexibility changes depending on the importance of the buyer-supplier relationship. In high importance relationships trust is the overwhelming determinant of relationship flexibility, while in low importance relationships commitment is a more important determinant of relationship flexibility.

Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

Science.gov (United States)

Yu, Chao

2013-01-01

In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

An automated method for estimating reliability of grid systems using Bayesian networks

International Nuclear Information System (INIS)

Doguc, Ozge; Emmanuel Ramirez-Marquez, Jose

2012-01-01

Grid computing has become relevant due to its applications to large-scale resource sharing, wide-area information transfer, and multi-institutional collaborating. In general, in grid computing a service requests the use of a set of resources, available in a grid, to complete certain tasks. Although analysis tools and techniques for these types of systems have been studied, grid reliability analysis is generally computation-intensive to obtain due to the complexity of the system. Moreover, conventional reliability models have some common assumptions that cannot be applied to the grid systems. Therefore, new analytical methods are needed for effective and accurate assessment of grid reliability. This study presents a new method for estimating grid service reliability, which does not require prior knowledge about the grid system structure unlike the previous studies. Moreover, the proposed method does not rely on any assumptions about the link and node failure rates. This approach is based on a data-mining algorithm, the K2, to discover the grid system structure from raw historical system data, that allows to find minimum resource spanning trees (MRST) within the grid then, uses Bayesian networks (BN) to model the MRST and estimate grid service reliability.

Using Of Learning Vector Quantization Network for Pan Evaporation Estimation

Directory of Open Access Journals (Sweden)

Kamil7 A. Abdulmohsen

2013-05-01

Full Text Available A modern technique is presented to study the evaporation process which is considered as an important component of the hydrological cycle. The Pan Evaporation depth is estimated depending upon four metrological factors viz. (temperature, relative humidity, sunshine, and wind speed. Unsupervised Artificial Neural Network has been proposed to accomplish the study goal, specifically, a type called Linear Vector Quantitization, (LVQ.  A step by step method is used to cope with difficulties that usually associated with computation procedures inherent in these kind of networks. Such systematic approach may close the gap between the hesitation of the user to make use of the capabilities of these type of neural networks and the relative complexity involving the computations procedures. The results reveal the possibility of using LVQ for of Pan Evaporation depth estimation where a good agreement has been noticed between the outputs of the proposed network and the observed values of the Pan Evaporation depth with a correlation coefficient of 0.986. 

Conditional estimation of exponential random graph models from snowball sampling designs

NARCIS (Netherlands)

Pattison, Philippa E.; Robins, Garry L.; Snijders, Tom A. B.; Wang, Peng

2013-01-01

A complete survey of a network in a large population may be prohibitively difficult and costly. So it is important to estimate models for networks using data from various network sampling designs, such as link-tracing designs. We focus here on snowball sampling designs, designs in which the members

Foot Plantar Pressure Estimation Using Artificial Neural Networks

OpenAIRE

Xidias , Elias; Koutkalaki , Zoi; Papagiannis , Panagiotis; Papanikos , Paraskevas; Azariadis , Philip

2015-01-01

Part 1: Smart Products; International audience; In this paper, we present a novel approach to estimate the maximum pressure over the foot plantar surface exerted by a two-layer shoe sole for three distinct phases of the gait cycle. The proposed method is based on Artificial Neural Networks and can be utilized for the determination of the comfort that is related to the sole construction. Input parameters to the proposed neural network are the material properties and the thicknesses of the sole...

MUSIC algorithm DoA estimation for cooperative node location in mobile ad hoc networks

Science.gov (United States)

Warty, Chirag; Yu, Richard Wai; ElMahgoub, Khaled; Spinsante, Susanna

In recent years the technological development has encouraged several applications based on distributed communications network without any fixed infrastructure. The problem of providing a collaborative early warning system for multiple mobile nodes against a fast moving object. The solution is provided subject to system level constraints: motion of nodes, antenna sensitivity and Doppler effect at 2.4 GHz and 5.8 GHz. This approach consists of three stages. The first phase consists of detecting the incoming object using a highly directive two element antenna at 5.0 GHz band. The second phase consists of broadcasting the warning message using a low directivity broad antenna beam using 2× 2 antenna array which then in third phase will be detected by receiving nodes by using direction of arrival (DOA) estimation technique. The DOA estimation technique is used to estimate the range and bearing of the incoming nodes. The position of fast arriving object can be estimated using the MUSIC algorithm for warning beam DOA estimation. This paper is mainly intended to demonstrate the feasibility of early detection and warning system using a collaborative node to node communication links. The simulation is performed to show the behavior of detecting and broadcasting antennas as well as performance of the detection algorithm. The idea can be further expanded to implement commercial grade detection and warning system

An RSS based location estimation technique for cognitive relay networks

KAUST Repository

Qaraqe, Khalid A.

2010-11-01

In this paper, a received signal strength (RSS) based location estimation method is proposed for a cooperative wireless relay network where the relay is a cognitive radio. We propose a method for the considered cognitive relay network to determine the location of the source using the direct and the relayed signal at the destination. We derive the Cramer-Rao lower bound (CRLB) expressions separately for x and y coordinates of the location estimate. We analyze the effects of cognitive behaviour of the relay on the performance of the proposed method. We also discuss and quantify the reliability of the location estimate using the proposed technique if the source is not stationary. The overall performance of the proposed method is presented through simulations. ©2010 IEEE.

Networked Estimation for Event-Based Sampling Systems with Packet Dropouts

Directory of Open Access Journals (Sweden)

Young Soo Suh

2009-04-01

Full Text Available This paper is concerned with a networked estimation problem in which sensor data are transmitted over the network. In the event-based sampling scheme known as level-crossing or send-on-delta (SOD, sensor data are transmitted to the estimator node if the difference between the current sensor value and the last transmitted one is greater than a given threshold. Event-based sampling has been shown to be more efficient than the time-triggered one in some situations, especially in network bandwidth improvement. However, it cannot detect packet dropout situations because data transmission and reception do not use a periodical time-stamp mechanism as found in time-triggered sampling systems. Motivated by this issue, we propose a modified event-based sampling scheme called modified SOD in which sensor data are sent when either the change of sensor output exceeds a given threshold or the time elapses more than a given interval. Through simulation results, we show that the proposed modified SOD sampling significantly improves estimation performance when packet dropouts happen.

The role of detachment of in-links in scale-free networks

International Nuclear Information System (INIS)

Lansky, P; Polito, F; Sacerdote, L

2014-01-01

Real-world networks may exhibit a detachment phenomenon determined by the canceling of previously existing connections. We discuss a tractable extension of the Yule model to account for this feature. Analytical results are derived and discussed both asymptotically and for a finite number of links. Comparison with the original model is performed in the supercritical case. The first-order asymptotic tail behavior of the two models is similar but differences arise in the second-order term. We explicitly refer to world wide web modeling and we show the agreement of the proposed model on very recent data. However, other possible network applications are also mentioned. (paper)

Estimating the hydraulic conductivity of two-dimensional fracture networks

Science.gov (United States)

Leung, C. T.; Zimmerman, R. W.

2010-12-01

Most oil and gas reservoirs, as well as most potential sites for nuclear waste disposal, are naturally fractured. In these sites, the network of fractures will provide the main path for fluid to flow through the rock mass. In many cases, the fracture density is so high as to make it impractical to model it with a discrete fracture network (DFN) approach. For such rock masses, it would be useful to have recourse to analytical, or semi-analytical, methods to estimate the macroscopic hydraulic conductivity of the fracture network. We have investigated single-phase fluid flow through stochastically generated two-dimensional fracture networks. The centres and orientations of the fractures are uniformly distributed, whereas their lengths follow either a lognormal distribution or a power law distribution. We have considered the case where the fractures in the network each have the same aperture, as well as the case where the aperture of each fracture is directly proportional to the fracture length. The discrete fracture network flow and transport simulator NAPSAC, developed by Serco (Didcot, UK), is used to establish the “true” macroscopic hydraulic conductivity of the network. We then attempt to match this conductivity using a simple estimation method that does not require extensive computation. For our calculations, fracture networks are represented as networks composed of conducting segments (bonds) between nodes. Each bond represents the region of a single fracture between two adjacent intersections with other fractures. We assume that the bonds are arranged on a kagome lattice, with some fraction of the bonds randomly missing. The conductance of each bond is then replaced with some effective conductance, Ceff, which we take to be the arithmetic mean of the individual conductances, averaged over each bond, rather than over each fracture. This is in contrast to the usual approximation used in effective medium theories, wherein the geometric mean is used. Our

A Study of an Optical Lunar Surface Communications Network with High Bandwidth Direct to Earth Link

Science.gov (United States)

Wilson, K.; Biswas, A.; Schoolcraft, J.

2011-01-01

Analyzed optical DTE (direct to earth) and lunar relay satellite link analyses, greater than 200 Mbps downlink to 1-m Earth receiver and greater than 1 Mbps uplink achieved with mobile 5-cm lunar transceiver, greater than 1Gbps downlink and greater than 10 Mpbs uplink achieved with 10-cm stationary lunar transceiver, MITLL (MIT Lincoln Laboratory) 2013 LLCD (Lunar Laser Communications Demonstration) plans to demonstrate 622 Mbps downlink with 20 Mbps uplink between lunar orbiter and ground station; Identified top five technology challenges to deploying lunar optical network, Performed preliminary experiments on two of challenges: (i) lunar dust removal and (ii)DTN over optical carrier, Exploring opportunities to evaluate DTN (delay-tolerant networking) over optical link in a multi-node network e.g. Desert RATS.

Models and synchronization of time-delayed complex dynamical networks with multi-links based on adaptive control

International Nuclear Information System (INIS)

Peng Haipeng; Wei Nan; Li Lixiang; Xie Weisheng; Yang Yixian

2010-01-01

In this Letter, time-delay has been introduced in to split the networks, upon which a model of complex dynamical networks with multi-links has been constructed. Moreover, based on Lyapunov stability theory and some hypotheses, we achieve synchronization between two complex networks with different structures by designing effective controllers. The validity of the results was proved through numerical simulations of this Letter.

Dependency links can hinder the evolution of cooperation in the prisoner's dilemma game on lattices and networks.

Directory of Open Access Journals (Sweden)

Xuwen Wang

Full Text Available Networks with dependency links are more vulnerable when facing the attacks. Recent research also has demonstrated that the interdependent groups support the spreading of cooperation. We study the prisoner's dilemma games on spatial networks with dependency links, in which a fraction of individual pairs is selected to depend on each other. The dependency individuals can gain an extra payoff whose value is between the payoff of mutual cooperation and the value of temptation to defect. Thus, this mechanism reflects that the dependency relation is stronger than the relation of ordinary mutual cooperation, but it is not large enough to cause the defection of the dependency pair. We show that the dependence of individuals hinders, promotes and never affects the cooperation on regular ring networks, square lattice, random and scale-free networks, respectively. The results for the square lattice and regular ring networks are demonstrated by the pair approximation.

Multi-stimulus-responsive shape-memory polymer nanocomposite network cross-linked by cellulose nanocrystals.

Science.gov (United States)

Liu, Ye; Li, Ying; Yang, Guang; Zheng, Xiaotong; Zhou, Shaobing

2015-02-25

In this study, we developed a thermoresponsive and water-responsive shape-memory polymer nanocomposite network by chemically cross-linking cellulose nanocrystals (CNCs) with polycaprolactone (PCL) and polyethylene glycol (PEG). The nanocomposite network was fully characterized, including the microstructure, cross-link density, water contact angle, water uptake, crystallinity, thermal properties, and static and dynamic mechanical properties. We found that the PEG[60]-PCL[40]-CNC[10] nanocomposite exhibited excellent thermo-induced and water-induced shape-memory effects in water at 37 °C (close to body temperature), and the introduction of CNC clearly improved the mechanical properties of the mixture of both PEG and PCL polymers with low molecular weights. In addition, Alamar blue assays based on osteoblasts indicated that the nanocomposites possessed good cytocompatibility. Therefore, this thermoresponsive and water-responsive shape-memory nanocomposite could be potentially developed into a new smart biomaterial.

A new method to estimate parameters of linear compartmental models using artificial neural networks

International Nuclear Information System (INIS)

Gambhir, Sanjiv S.; Keppenne, Christian L.; Phelps, Michael E.; Banerjee, Pranab K.

1998-01-01

At present, the preferred tool for parameter estimation in compartmental analysis is an iterative procedure; weighted nonlinear regression. For a large number of applications, observed data can be fitted to sums of exponentials whose parameters are directly related to the rate constants/coefficients of the compartmental models. Since weighted nonlinear regression often has to be repeated for many different data sets, the process of fitting data from compartmental systems can be very time consuming. Furthermore the minimization routine often converges to a local (as opposed to global) minimum. In this paper, we examine the possibility of using artificial neural networks instead of weighted nonlinear regression in order to estimate model parameters. We train simple feed-forward neural networks to produce as outputs the parameter values of a given model when kinetic data are fed to the networks' input layer. The artificial neural networks produce unbiased estimates and are orders of magnitude faster than regression algorithms. At noise levels typical of many real applications, the neural networks are found to produce lower variance estimates than weighted nonlinear regression in the estimation of parameters from mono- and biexponential models. These results are primarily due to the inability of weighted nonlinear regression to converge. These results establish that artificial neural networks are powerful tools for estimating parameters for simple compartmental models. (author)

Buckshot Routing with Distance Vectors in Three Application Scenarios for Wireless Sensor Networks with Unstable Network Topologies and Unidirectional Links

Directory of Open Access Journals (Sweden)

Reinhardt Karnapke

2015-02-01

Full Text Available Experiments have shown that the number of asymmetric and unidirectional links often exceeds the number of bidirectional ones, especially in the transitional area of the communication range of wireless sensor nodes. Still, most of today’s routing protocols ignore their existence or try to remove their implications. Also, links are not stable over time, and routes become unusable often, resulting in a need for new routing protocols that can handle highly dynamic links and use unidirectional links to their advantage. At SENSORCOMM' 2014, we presented BuckshotDV, a routing protocol which is resilient against link fluctuations and uses the longer reach of unidirectional links to increase its performance. Furthermore, its distance vector nature makes it scalable for large sensor networks. This paper is an extended version which adds some implementation details and the evaluation of BuckshotDV in two more application scenarios.

Enhancing the reliability of AC transmission networks by using a long distance HVDC-link

Energy Technology Data Exchange (ETDEWEB)

Fleckenstein, Marco; Balzer, Gerd; Wasserrab, Andreas; Neumann, Claus [Technische Univ. Darmstadt (Germany). Inst. of Electrical Power and Energy

2012-07-01

The absorption of energy from offshore wind farms is a difficult task for Transmission system operators (TSO) in Germany, even if no offshore wind farm is connected directly. The role of the TSOs in the north it is to transport this energy to the south of Germany. The transmission capacities of overhead lines are limited. With the expected rapid expansion of wind farms, this is no longer enough. Thus, the transmission system must be enhanced. One possibility is the installation of an HVDC link from north to south between two main substations in the 380 kV network. Based on a realistic case study, the impact of such a link on the reliability of the entire extra high voltage network is shown. (orig.)

Estimating pole/zero errors in GSN-IRIS/USGS network calibration metadata

Science.gov (United States)

Ringler, A.T.; Hutt, C.R.; Aster, R.; Bolton, H.; Gee, L.S.; Storm, T.

2012-01-01

Mapping the digital record of a seismograph into true ground motion requires the correction of the data by some description of the instrument's response. For the Global Seismographic Network (Butler et al., 2004), as well as many other networks, this instrument response is represented as a Laplace domain pole–zero model and published in the Standard for the Exchange of Earthquake Data (SEED) format. This Laplace representation assumes that the seismometer behaves as a linear system, with any abrupt changes described adequately via multiple time-invariant epochs. The SEED format allows for published instrument response errors as well, but these typically have not been estimated or provided to users. We present an iterative three-step method to estimate the instrument response parameters (poles and zeros) and their associated errors using random calibration signals. First, we solve a coarse nonlinear inverse problem using a least-squares grid search to yield a first approximation to the solution. This approach reduces the likelihood of poorly estimated parameters (a local-minimum solution) caused by noise in the calibration records and enhances algorithm convergence. Second, we iteratively solve a nonlinear parameter estimation problem to obtain the least-squares best-fit Laplace pole–zero–gain model. Third, by applying the central limit theorem, we estimate the errors in this pole–zero model by solving the inverse problem at each frequency in a two-thirds octave band centered at each best-fit pole–zero frequency. This procedure yields error estimates of the 99% confidence interval. We demonstrate the method by applying it to a number of recent Incorporated Research Institutions in Seismology/United States Geological Survey (IRIS/USGS) network calibrations (network code IU).

Data Reduction with Quantization Constraints for Decentralized Estimation in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Yang Weng

2014-01-01

Full Text Available The unknown vector estimation problem with bandwidth constrained wireless sensor network is considered. In such networks, sensor nodes make distributed observations on the unknown vector and collaborate with a fusion center to generate a final estimate. Due to power and communication bandwidth limitations, each sensor node must compress its data and transmit to the fusion center. In this paper, both centralized and decentralized estimation frameworks are developed. The closed-form solution for the centralized estimation framework is proposed. The computational complexity of decentralized estimation problem is proven to be NP-hard and a Gauss-Seidel algorithm to search for an optimal solution is also proposed. Simulation results show the good performance of the proposed algorithms.

Resting State Network Estimation in Individual Subjects

Science.gov (United States)

Hacker, Carl D.; Laumann, Timothy O.; Szrama, Nicholas P.; Baldassarre, Antonello; Snyder, Abraham Z.

2014-01-01

Resting-state functional magnetic resonance imaging (fMRI) has been used to study brain networks associated with both normal and pathological cognitive function. The objective of this work is to reliably compute resting state network (RSN) topography in single participants. We trained a supervised classifier (multi-layer perceptron; MLP) to associate blood oxygen level dependent (BOLD) correlation maps corresponding to pre-defined seeds with specific RSN identities. Hard classification of maps obtained from a priori seeds was highly reliable across new participants. Interestingly, continuous estimates of RSN membership retained substantial residual error. This result is consistent with the view that RSNs are hierarchically organized, and therefore not fully separable into spatially independent components. After training on a priori seed-based maps, we propagated voxel-wise correlation maps through the MLP to produce estimates of RSN membership throughout the brain. The MLP generated RSN topography estimates in individuals consistent with previous studies, even in brain regions not represented in the training data. This method could be used in future studies to relate RSN topography to other measures of functional brain organization (e.g., task-evoked responses, stimulation mapping, and deficits associated with lesions) in individuals. The multi-layer perceptron was directly compared to two alternative voxel classification procedures, specifically, dual regression and linear discriminant analysis; the perceptron generated more spatially specific RSN maps than either alternative. PMID:23735260

Introduction to wireless sensor networks

CERN Document Server

Forster, Anna

2016-01-01

Explores real-world wireless sensor network development, deployment, and applications. The book begins with an introduction to wireless sensor networks and their fundamental concepts. Hardware components, operating systems, protocols, and algorithms that make up the anatomy of a sensor node are described in chapter two. Properties of wireless communications, medium access protocols, wireless links, and link estimation protocols are described in chapter three and chapter four. Routing basics and metrics, clustering techniques, time synchronization and localization protocols, as well as sensing techniques are introduced in chapter five to nine. The concluding chapter summarizes the learnt methods and shows how to use them to deploy real-world sensor networks in a structured way.

Internal measuring models in trained neural networks for parameter estimation from images

NARCIS (Netherlands)

Feng, Tian-Jin; Feng, T.J.; Houkes, Z.; Korsten, Maarten J.; Spreeuwers, Lieuwe Jan

1992-01-01

The internal representations of 'learned' knowledge in neural networks are still poorly understood, even for backpropagation networks. The paper discusses a possible interpretation of learned knowledge of a network trained for parameter estimation from images. The outputs of the hidden layer are the

Parameter estimation in tree graph metabolic networks

Directory of Open Access Journals (Sweden)

Laura Astola

2016-09-01

Full Text Available We study the glycosylation processes that convert initially toxic substrates to nutritionally valuable metabolites in the flavonoid biosynthesis pathway of tomato (Solanum lycopersicum seedlings. To estimate the reaction rates we use ordinary differential equations (ODEs to model the enzyme kinetics. A popular choice is to use a system of linear ODEs with constant kinetic rates or to use Michaelis–Menten kinetics. In reality, the catalytic rates, which are affected among other factors by kinetic constants and enzyme concentrations, are changing in time and with the approaches just mentioned, this phenomenon cannot be described. Another problem is that, in general these kinetic coefficients are not always identifiable. A third problem is that, it is not precisely known which enzymes are catalyzing the observed glycosylation processes. With several hundred potential gene candidates, experimental validation using purified target proteins is expensive and time consuming. We aim at reducing this task via mathematical modeling to allow for the pre-selection of most potential gene candidates. In this article we discuss a fast and relatively simple approach to estimate time varying kinetic rates, with three favorable properties: firstly, it allows for identifiable estimation of time dependent parameters in networks with a tree-like structure. Secondly, it is relatively fast compared to usually applied methods that estimate the model derivatives together with the network parameters. Thirdly, by combining the metabolite concentration data with a corresponding microarray data, it can help in detecting the genes related to the enzymatic processes. By comparing the estimated time dynamics of the catalytic rates with time series gene expression data we may assess potential candidate genes behind enzymatic reactions. As an example, we show how to apply this method to select prominent glycosyltransferase genes in tomato seedlings.

Parameter estimation in tree graph metabolic networks.

Science.gov (United States)

Astola, Laura; Stigter, Hans; Gomez Roldan, Maria Victoria; van Eeuwijk, Fred; Hall, Robert D; Groenenboom, Marian; Molenaar, Jaap J

2016-01-01

We study the glycosylation processes that convert initially toxic substrates to nutritionally valuable metabolites in the flavonoid biosynthesis pathway of tomato (Solanum lycopersicum) seedlings. To estimate the reaction rates we use ordinary differential equations (ODEs) to model the enzyme kinetics. A popular choice is to use a system of linear ODEs with constant kinetic rates or to use Michaelis-Menten kinetics. In reality, the catalytic rates, which are affected among other factors by kinetic constants and enzyme concentrations, are changing in time and with the approaches just mentioned, this phenomenon cannot be described. Another problem is that, in general these kinetic coefficients are not always identifiable. A third problem is that, it is not precisely known which enzymes are catalyzing the observed glycosylation processes. With several hundred potential gene candidates, experimental validation using purified target proteins is expensive and time consuming. We aim at reducing this task via mathematical modeling to allow for the pre-selection of most potential gene candidates. In this article we discuss a fast and relatively simple approach to estimate time varying kinetic rates, with three favorable properties: firstly, it allows for identifiable estimation of time dependent parameters in networks with a tree-like structure. Secondly, it is relatively fast compared to usually applied methods that estimate the model derivatives together with the network parameters. Thirdly, by combining the metabolite concentration data with a corresponding microarray data, it can help in detecting the genes related to the enzymatic processes. By comparing the estimated time dynamics of the catalytic rates with time series gene expression data we may assess potential candidate genes behind enzymatic reactions. As an example, we show how to apply this method to select prominent glycosyltransferase genes in tomato seedlings.

Estimating wheat and maize daily evapotranspiration using artificial neural network

Science.gov (United States)

Abrishami, Nazanin; Sepaskhah, Ali Reza; Shahrokhnia, Mohammad Hossein

2018-02-01

In this research, artificial neural network (ANN) is used for estimating wheat and maize daily standard evapotranspiration. Ten ANN models with different structures were designed for each crop. Daily climatic data [maximum temperature (T max), minimum temperature (T min), average temperature (T ave), maximum relative humidity (RHmax), minimum relative humidity (RHmin), average relative humidity (RHave), wind speed (U 2), sunshine hours (n), net radiation (Rn)], leaf area index (LAI), and plant height (h) were used as inputs. For five structures of ten, the evapotranspiration (ETC) values calculated by ETC = ET0 × K C equation (ET0 from Penman-Monteith equation and K C from FAO-56, ANNC) were used as outputs, and for the other five structures, the ETC values measured by weighing lysimeter (ANNM) were used as outputs. In all structures, a feed forward multiple-layer network with one or two hidden layers and sigmoid transfer function and BR or LM training algorithm was used. Favorite network was selected based on various statistical criteria. The results showed the suitable capability and acceptable accuracy of ANNs, particularly those having two hidden layers in their structure in estimating the daily evapotranspiration. Best model for estimation of maize daily evapotranspiration is «M»ANN1 C (8-4-2-1), with T max, T min, RHmax, RHmin, U 2, n, LAI, and h as input data and LM training rule and its statistical parameters (NRMSE, d, and R2) are 0.178, 0.980, and 0.982, respectively. Best model for estimation of wheat daily evapotranspiration is «W»ANN5 C (5-2-3-1), with T max, T min, Rn, LAI, and h as input data and LM training rule, its statistical parameters (NRMSE, d, and R 2) are 0.108, 0.987, and 0.981 respectively. In addition, if the calculated ETC used as the output of the network for both wheat and maize, higher accurate estimation was obtained. Therefore, ANN is suitable method for estimating evapotranspiration of wheat and maize.

Iterative Available Bandwidth Estimation for Mobile Transport Networks

DEFF Research Database (Denmark)

Ubeda Castellanos, Carlos; López Villa, Dimas; Teyeb, Oumer Mohammed

2007-01-01

Available bandwidth estimation has lately been proposed to be used for end-to-end resource management in existing and emerging mobile communication systems, whose transport networks could end up being the bottleneck rather than the air interface. Algorithms for admission control, handover...

Modelling computer networks

International Nuclear Information System (INIS)

Max, G

2011-01-01

Traffic models in computer networks can be described as a complicated system. These systems show non-linear features and to simulate behaviours of these systems are also difficult. Before implementing network equipments users wants to know capability of their computer network. They do not want the servers to be overloaded during temporary traffic peaks when more requests arrive than the server is designed for. As a starting point for our study a non-linear system model of network traffic is established to exam behaviour of the network planned. The paper presents setting up a non-linear simulation model that helps us to observe dataflow problems of the networks. This simple model captures the relationship between the competing traffic and the input and output dataflow. In this paper, we also focus on measuring the bottleneck of the network, which was defined as the difference between the link capacity and the competing traffic volume on the link that limits end-to-end throughput. We validate the model using measurements on a working network. The results show that the initial model estimates well main behaviours and critical parameters of the network. Based on this study, we propose to develop a new algorithm, which experimentally determines and predict the available parameters of the network modelled.

Rainfall measurement using cell phone links: classification of wet and dry periods using geostationary satellites

NARCIS (Netherlands)

van Delden, A.J.; van het Schip, T.I.; Overeem, Aart; Leijnse, Hidde; Uijlenhoet, Remko; Meirink, J.F.

2017-01-01

Commercial cellular telecommunication networks can be used for rainfall estimation by measur- ing the attenuation of electromagnetic signals transmitted between antennas from microwave links. However, as the received link signal may also decrease during dry periods, a method to separate wet and dry

A network-based multi-target computational estimation scheme for anticoagulant activities of compounds.

Directory of Open Access Journals (Sweden)

Qian Li

Full Text Available BACKGROUND: Traditional virtual screening method pays more attention on predicted binding affinity between drug molecule and target related to a certain disease instead of phenotypic data of drug molecule against disease system, as is often less effective on discovery of the drug which is used to treat many types of complex diseases. Virtual screening against a complex disease by general network estimation has become feasible with the development of network biology and system biology. More effective methods of computational estimation for the whole efficacy of a compound in a complex disease system are needed, given the distinct weightiness of the different target in a biological process and the standpoint that partial inhibition of several targets can be more efficient than the complete inhibition of a single target. METHODOLOGY: We developed a novel approach by integrating the affinity predictions from multi-target docking studies with biological network efficiency analysis to estimate the anticoagulant activities of compounds. From results of network efficiency calculation for human clotting cascade, factor Xa and thrombin were identified as the two most fragile enzymes, while the catalytic reaction mediated by complex IXa:VIIIa and the formation of the complex VIIIa:IXa were recognized as the two most fragile biological matter in the human clotting cascade system. Furthermore, the method which combined network efficiency with molecular docking scores was applied to estimate the anticoagulant activities of a serial of argatroban intermediates and eight natural products respectively. The better correlation (r = 0.671 between the experimental data and the decrease of the network deficiency suggests that the approach could be a promising computational systems biology tool to aid identification of anticoagulant activities of compounds in drug discovery. CONCLUSIONS: This article proposes a network-based multi-target computational estimation

A network-based multi-target computational estimation scheme for anticoagulant activities of compounds.

Science.gov (United States)

Li, Qian; Li, Xudong; Li, Canghai; Chen, Lirong; Song, Jun; Tang, Yalin; Xu, Xiaojie

2011-03-22

Traditional virtual screening method pays more attention on predicted binding affinity between drug molecule and target related to a certain disease instead of phenotypic data of drug molecule against disease system, as is often less effective on discovery of the drug which is used to treat many types of complex diseases. Virtual screening against a complex disease by general network estimation has become feasible with the development of network biology and system biology. More effective methods of computational estimation for the whole efficacy of a compound in a complex disease system are needed, given the distinct weightiness of the different target in a biological process and the standpoint that partial inhibition of several targets can be more efficient than the complete inhibition of a single target. We developed a novel approach by integrating the affinity predictions from multi-target docking studies with biological network efficiency analysis to estimate the anticoagulant activities of compounds. From results of network efficiency calculation for human clotting cascade, factor Xa and thrombin were identified as the two most fragile enzymes, while the catalytic reaction mediated by complex IXa:VIIIa and the formation of the complex VIIIa:IXa were recognized as the two most fragile biological matter in the human clotting cascade system. Furthermore, the method which combined network efficiency with molecular docking scores was applied to estimate the anticoagulant activities of a serial of argatroban intermediates and eight natural products respectively. The better correlation (r = 0.671) between the experimental data and the decrease of the network deficiency suggests that the approach could be a promising computational systems biology tool to aid identification of anticoagulant activities of compounds in drug discovery. This article proposes a network-based multi-target computational estimation method for anticoagulant activities of compounds by

Factorized Estimation of Partially Shared Parameters in Diffusion Networks

Czech Academy of Sciences Publication Activity Database

Dedecius, Kamil; Sečkárová, Vladimíra

2017-01-01

Roč. 65, č. 19 (2017), s. 5153-5163 ISSN 1053-587X R&D Projects: GA ČR(CZ) GP14-06678P; GA ČR GA16-09848S Institutional support: RVO:67985556 Keywords : Diffusion network * Diffusion estimation * Heterogeneous parameters * Multitask networks Subject RIV: BD - Theory of Information OBOR OECD: Applied mathematics Impact factor: 4.300, year: 2016 http://library.utia.cas.cz/separaty/2017/AS/dedecius-0477044.pdf

Dually cross-linked single network poly(acrylic acid) hydrogels with superior mechanical properties and water absorbency.

Science.gov (United States)

Zhong, Ming; Liu, Yi-Tao; Liu, Xiao-Ying; Shi, Fu-Kuan; Zhang, Li-Qin; Zhu, Mei-Fang; Xie, Xu-Ming

2016-06-28

Poly(acrylic acid) (PAA) hydrogels with superior mechanical properties, based on a single network structure with dual cross-linking, are prepared by one-pot free radical polymerization. The network structure of the PAA hydrogels is composed of dual cross-linking: a dynamic and reversible ionic cross-linking among the PAA chains enabled by Fe(3+) ions, and a sparse covalent cross-linking enabled by a covalent cross-linker (Bis). Under deformation, the covalently cross-linked PAA chains remain intact to maintain their original configuration, while the Fe(3+)-enabled ionic cross-linking among the PAA chains is broken to dissipate energy and then recombined. It is found that the mechanical properties of the PAA hydrogels are significantly influenced by the contents of covalent cross-linkers, Fe(3+) ions and water, which can be adjusted within a substantial range and thus broaden the applications of the hydrogels. Meanwhile, the PAA hydrogels have excellent recoverability based on the dynamic and reversible ionic cross-linking enabled by Fe(3+) ions. Moreover, the swelling capacity of the PAA hydrogels is as high as 1800 times in deionized water due to the synergistic effects of ionic and covalent cross-linkings. The combination of balanced mechanical properties, efficient recoverability, high swelling capacity and facile preparation provides a new method to obtain high-performance hydrogels.

An Interference-Aware Traffic-Priority-Based Link Scheduling Algorithm for Interference Mitigation in Multiple Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Thien T. T. Le

2016-12-01

Full Text Available Currently, wireless body area networks (WBANs are effectively used for health monitoring services. However, in cases where WBANs are densely deployed, interference among WBANs can cause serious degradation of network performance and reliability. Inter-WBAN interference can be reduced by scheduling the communication links of interfering WBANs. In this paper, we propose an interference-aware traffic-priority-based link scheduling (ITLS algorithm to overcome inter-WBAN interference in densely deployed WBANs. First, we model a network with multiple WBANs as an interference graph where node-level interference and traffic priority are taken into account. Second, we formulate link scheduling for multiple WBANs as an optimization model where the objective is to maximize the throughput of the entire network while ensuring the traffic priority of sensor nodes. Finally, we propose the ITLS algorithm for multiple WBANs on the basis of the optimization model. High spatial reuse is also achieved in the proposed ITLS algorithm. The proposed ITLS achieves high spatial reuse while considering traffic priority, packet length, and the number of interfered sensor nodes. Our simulation results show that the proposed ITLS significantly increases spatial reuse and network throughput with lower delay by mitigating inter-WBAN interference.

Estimation of scattered photons using a neural network in SPECT

International Nuclear Information System (INIS)

Hasegawa, Wataru; Ogawa, Koichi

1994-01-01

In single photon emission CT (SPECT), measured projection data involve scattered photons. This causes degradation of spatial resolution and contrast in reconstructed images. The purpose of this study is to estimate the scattered photons, and eliminate them from measured data. To estimate the scattered photons, we used an artificial neural network which consists of five input units, five hidden units, and two output units. The inputs of the network are the ratios of the counts acquired by five narrow energy windows and their sum. The outputs are the ratios of the count of scattered photons and that of primary photons to the total count. The neural network was trained with a back-propagation algorithm using count data obtained by a Monte Carlo simulation. The results of simulation showed improvement of contrast and spatial resolution in reconstructed images. (author)

Estimation of Anonymous Email Network Characteristics through Statistical Disclosure Attacks

Directory of Open Access Journals (Sweden)

Javier Portela

2016-11-01

Full Text Available Social network analysis aims to obtain relational data from social systems to identify leaders, roles, and communities in order to model profiles or predict a specific behavior in users’ network. Preserving anonymity in social networks is a subject of major concern. Anonymity can be compromised by disclosing senders’ or receivers’ identity, message content, or sender-receiver relationships. Under strongly incomplete information, a statistical disclosure attack is used to estimate the network and node characteristics such as centrality and clustering measures, degree distribution, and small-world-ness. A database of email networks in 29 university faculties is used to study the method. A research on the small-world-ness and Power law characteristics of these email networks is also developed, helping to understand the behavior of small email networks.

Estimation of Anonymous Email Network Characteristics through Statistical Disclosure Attacks

Science.gov (United States)

Portela, Javier; García Villalba, Luis Javier; Silva Trujillo, Alejandra Guadalupe; Sandoval Orozco, Ana Lucila; Kim, Tai-Hoon

2016-01-01

Social network analysis aims to obtain relational data from social systems to identify leaders, roles, and communities in order to model profiles or predict a specific behavior in users’ network. Preserving anonymity in social networks is a subject of major concern. Anonymity can be compromised by disclosing senders’ or receivers’ identity, message content, or sender-receiver relationships. Under strongly incomplete information, a statistical disclosure attack is used to estimate the network and node characteristics such as centrality and clustering measures, degree distribution, and small-world-ness. A database of email networks in 29 university faculties is used to study the method. A research on the small-world-ness and Power law characteristics of these email networks is also developed, helping to understand the behavior of small email networks. PMID:27809275

Equal Graph Partitioning on Estimated Infection Network as an Effective Epidemic Mitigation Measure

Science.gov (United States)

Hadidjojo, Jeremy; Cheong, Siew Ann

2011-01-01

Controlling severe outbreaks remains the most important problem in infectious disease area. With time, this problem will only become more severe as population density in urban centers grows. Social interactions play a very important role in determining how infectious diseases spread, and organization of people along social lines gives rise to non-spatial networks in which the infections spread. Infection networks are different for diseases with different transmission modes, but are likely to be identical or highly similar for diseases that spread the same way. Hence, infection networks estimated from common infections can be useful to contain epidemics of a more severe disease with the same transmission mode. Here we present a proof-of-concept study demonstrating the effectiveness of epidemic mitigation based on such estimated infection networks. We first generate artificial social networks of different sizes and average degrees, but with roughly the same clustering characteristic. We then start SIR epidemics on these networks, censor the simulated incidences, and use them to reconstruct the infection network. We then efficiently fragment the estimated network by removing the smallest number of nodes identified by a graph partitioning algorithm. Finally, we demonstrate the effectiveness of this targeted strategy, by comparing it against traditional untargeted strategies, in slowing down and reducing the size of advancing epidemics. PMID:21799777

The effect of tracking network configuration on GPS baseline estimates for the CASA Uno experiment

Science.gov (United States)

Wolf, S. Kornreich; Dixon, T. H.; Freymueller, J. T.

1990-01-01

The effect of the tracking network on long (greater than 100 km) GPS baseline estimates was estimated using various subsets of the global tracking network initiated by the first Central and South America (CASA Uno) experiment. It was found that best results could be obtained with a global tacking network consisting of three U.S. stations, two sites in the southwestern Pacific, and two sites in Europe. In comparison with smaller subsets, this global network improved the baseline repeatability, the resolution of carrier phase cycle ambiguities, and formal errors of the orbit estimates.

Inference in hybrid Bayesian networks

DEFF Research Database (Denmark)

Lanseth, Helge; Nielsen, Thomas Dyhre; Rumí, Rafael

2009-01-01

Since the 1980s, Bayesian Networks (BNs) have become increasingly popular for building statistical models of complex systems. This is particularly true for boolean systems, where BNs often prove to be a more efficient modelling framework than traditional reliability-techniques (like fault trees...... decade's research on inference in hybrid Bayesian networks. The discussions are linked to an example model for estimating human reliability....

Nonlinear neural network for hemodynamic model state and input estimation using fMRI data

KAUST Repository

Karam, Ayman M.

2014-11-01

Originally inspired by biological neural networks, artificial neural networks (ANNs) are powerful mathematical tools that can solve complex nonlinear problems such as filtering, classification, prediction and more. This paper demonstrates the first successful implementation of ANN, specifically nonlinear autoregressive with exogenous input (NARX) networks, to estimate the hemodynamic states and neural activity from simulated and measured real blood oxygenation level dependent (BOLD) signals. Blocked and event-related BOLD data are used to test the algorithm on real experiments. The proposed method is accurate and robust even in the presence of signal noise and it does not depend on sampling interval. Moreover, the structure of the NARX networks is optimized to yield the best estimate with minimal network architecture. The results of the estimated neural activity are also discussed in terms of their potential use.

Using Semantic Linking to Understand Persons’ Networks Extracted from Text

Directory of Open Access Journals (Sweden)

Alessio Palmero Aprosio

2017-11-01

Full Text Available In this work, we describe a methodology to interpret large persons’ networks extracted from text by classifying cliques using the DBpedia ontology. The approach relies on a combination of NLP, Semantic web technologies, and network analysis. The classification methodology that first starts from single nodes and then generalizes to cliques is effective in terms of performance and is able to deal also with nodes that are not linked to Wikipedia. The gold standard manually developed for evaluation shows that groups of co-occurring entities share in most of the cases a category that can be automatically assigned. This holds for both languages considered in this study. The outcome of this work may be of interest to enhance the readability of large networks and to provide an additional semantic layer on top of cliques. This would greatly help humanities scholars when dealing with large amounts of textual data that need to be interpreted or categorized. Furthermore, it represents an unsupervised approach to automatically extend DBpedia starting from a corpus.

Estimation of local rainfall erosivity using artificial neural network

Directory of Open Access Journals (Sweden)

Paulo Tarso Sanches Oliveira

2011-08-01

Full Text Available The information retrieval of local values of rainfall erosivity is essential for soil loss estimation with the Universal Soil Loss Equation (USLE, and thus is very useful in soil and water conservation planning. In this manner, the objective of this study was to develop an Artificial Neural Network (ANN with the capacity of estimating, with satisfactory accuracy, the rainfall erosivity in any location of the Mato Grosso do Sul state. We used data from rain erosivity, latitude, longitude, altitude of pluviometric and pluviographic stations located in the state to train and test an ANN. After training with various network configurations, we selected the best performance and higher coefficient of determination calculated on the basis of data erosivity of the sample test and the values estimated by ANN. In evaluating the results, the confidence and the agreement indices were used in addition to the coefficient of determination. It was found that it is possible to estimate the rainfall erosivity for any location in the state of Mato Grosso do Sul, in a reliable way, using only data of geographical coordinates and altitude.

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

Directory of Open Access Journals (Sweden)

Mansour Sheikhan

2012-06-01

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

Reorientational motion of a cross-link junction in a poly(dimethylsiloxane) network measured by time-resolved fluorescence depolarization

International Nuclear Information System (INIS)

Stein, A.D.; Hoffman, D.A.; Frank, C.W.; Fayer, M.D.

1992-01-01

The reorientational dynamics of a cross-link junction in poly(dimethylsiloxane) networks, measured by the fluorescence anisotropy decay of a chromophore tagged to the cross-link, have been investigated over a range of temperatures from T g +75 to T g +150. The probe chromophore, 1-dimethylamino-5-sulfonylnaphthalene amide (dansyl amide), is pendant to a trifunctional silane that acts as a cross-linking molecule. In cyclohexanol, the fluorescence anisotropy decay is in agreement with Debye--Stokes--Einstein hydrodynamic theory (rotational diffusion) demonstrating that the cross-linker can be used as a probe of orientational relaxation. The fluorescence anisotropy decays at a rapid rate in an end-linked poly(dimethyl siloxane) network reflecting fast reorientational motion of the cross-link junction. This reorientation appears diffusive and has a temperature dependence in accord with the Williams--Landel--Ferry equation. A model is proposed that suggests that reorientation and translational motion of the cross-link occur simultaneously and are both coupled to fluctuations of the polymer chain ends

Multiple Time Series Forecasting Using Quasi-Randomized Functional Link Neural Networks

Directory of Open Access Journals (Sweden)

Thierry Moudiki

2018-03-01

Full Text Available We are interested in obtaining forecasts for multiple time series, by taking into account the potential nonlinear relationships between their observations. For this purpose, we use a specific type of regression model on an augmented dataset of lagged time series. Our model is inspired by dynamic regression models (Pankratz 2012, with the response variable’s lags included as predictors, and is known as Random Vector Functional Link (RVFL neural networks. The RVFL neural networks have been successfully applied in the past, to solving regression and classification problems. The novelty of our approach is to apply an RVFL model to multivariate time series, under two separate regularization constraints on the regression parameters.

Estimation of Collapse Moment for Wall Thinned Elbows Using Fuzzy Neural Networks

International Nuclear Information System (INIS)

Na, Man Gyun; Kim, Jin Weon; Shin, Sun Ho; Kim, Koung Suk; Kang, Ki Soo

2004-01-01

In this work, the collapse moment due to wall-thinning defects is estimated by using fuzzy neural networks. The developed fuzzy neural networks have been applied to the numerical data obtained from the finite element analysis. Principal component analysis is used to preprocess the input signals into the fuzzy neural network to reduce the sensitivity to the input change and the fuzzy neural networks are trained by using the data set prepared for training (training data) and verified by using another data set different (independent) from the training data. Also, two fuzzy neural networks are trained for two data sets divided into the two classes of extrados and intrados defects, which is because they have different characteristics. The relative 2-sigma errors of the estimated collapse moment are 3.07% for the training data and 4.12% for the test data. It is known from this result that the fuzzy neural networks are sufficiently accurate to be used in the wall-thinning monitoring of elbows

Broadband nanophotonic wireless links and networks using on-chip integrated plasmonic antennas.

Science.gov (United States)

Yang, Yuanqing; Li, Qiang; Qiu, Min

2016-01-19

Owing to their high capacity and flexibility, broadband wireless communications have been widely employed in radio and microwave regimes, playing indispensable roles in our daily life. Their optical analogs, however, have not been demonstrated at the nanoscale. In this paper, by exploiting plasmonic nanoantennas, we demonstrate the complete design of broadband wireless links and networks in the realm of nanophotonics. With a 100-fold enhancement in power transfer superior to previous designs as well as an ultrawide bandwidth that covers the entire telecommunication wavelength range, such broadband nanolinks and networks are expected to pave the way for future optical integrated nanocircuits.

Down-link power distributions for 2G and 3G mobile communication networks

International Nuclear Information System (INIS)

Colombi, D.; Thors, B.; Persson, T.; Wiren, N.; Larsson, L. E.; Jonsson, M.; Toernevik, C.

2013-01-01

Knowledge of realistic power levels is key when conducting accurate EMF exposure assessments. In this study, down-link output power distributions for radio base stations in 2G and 3G mobile communication networks have been assessed. The distributions were obtained from network measurement data collected from the Operations Support System, which normally is used for network monitoring and management. Significant amounts of data were gathered simultaneously for large sets of radio base stations covering wide geographical areas and different environments. The method was validated with in situ measurements. For the 3G network, the 90. percentile of the averaged output power during high traffic hours was found to be 43 % of the maximum available power. The corresponding number for 2G, with two or more transceivers installed, was 65 % or below. (authors)

Energy-Aware Topology Evolution Model with Link and Node Deletion in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Xiaojuan Luo

2012-01-01

Full Text Available Based on the complex network theory, a new topological evolving model is proposed. In the evolution of the topology of sensor networks, the energy-aware mechanism is taken into account, and the phenomenon of change of the link and node in the network is discussed. Theoretical analysis and numerical simulation are conducted to explore the topology characteristics and network performance with different node energy distribution. We find that node energy distribution has the weak effect on the degree distribution P(k that evolves into the scale-free state, nodes with more energy carry more connections, and degree correlation is nontrivial disassortative. Moreover, the results show that, when nodes energy is more heterogeneous, the network is better clustered and enjoys higher performance in terms of the network efficiency and the average path length for transmitting data.

A neural network-based estimator for the mixture ratio of the Space Shuttle Main Engine

Science.gov (United States)

Guo, T. H.; Musgrave, J.

1992-11-01

In order to properly utilize the available fuel and oxidizer of a liquid propellant rocket engine, the mixture ratio is closed loop controlled during main stage (65 percent - 109 percent power) operation. However, because of the lack of flight-capable instrumentation for measuring mixture ratio, the value of mixture ratio in the control loop is estimated using available sensor measurements such as the combustion chamber pressure and the volumetric flow, and the temperature and pressure at the exit duct on the low pressure fuel pump. This estimation scheme has two limitations. First, the estimation formula is based on an empirical curve fitting which is accurate only within a narrow operating range. Second, the mixture ratio estimate relies on a few sensor measurements and loss of any of these measurements will make the estimate invalid. In this paper, we propose a neural network-based estimator for the mixture ratio of the Space Shuttle Main Engine. The estimator is an extension of a previously developed neural network based sensor failure detection and recovery algorithm (sensor validation). This neural network uses an auto associative structure which utilizes the redundant information of dissimilar sensors to detect inconsistent measurements. Two approaches have been identified for synthesizing mixture ratio from measurement data using a neural network. The first approach uses an auto associative neural network for sensor validation which is modified to include the mixture ratio as an additional output. The second uses a new network for the mixture ratio estimation in addition to the sensor validation network. Although mixture ratio is not directly measured in flight, it is generally available in simulation and in test bed firing data from facility measurements of fuel and oxidizer volumetric flows. The pros and cons of these two approaches will be discussed in terms of robustness to sensor failures and accuracy of the estimate during typical transients using

LP-LPA: A link influence-based label propagation algorithm for discovering community structures in networks

Science.gov (United States)

Berahmand, Kamal; Bouyer, Asgarali

2018-03-01

Community detection is an essential approach for analyzing the structural and functional properties of complex networks. Although many community detection algorithms have been recently presented, most of them are weak and limited in different ways. Label Propagation Algorithm (LPA) is a well-known and efficient community detection technique which is characterized by the merits of nearly-linear running time and easy implementation. However, LPA has some significant problems such as instability, randomness, and monster community detection. In this paper, an algorithm, namely node’s label influence policy for label propagation algorithm (LP-LPA) was proposed for detecting efficient community structures. LP-LPA measures link strength value for edges and nodes’ label influence value for nodes in a new label propagation strategy with preference on link strength and for initial nodes selection, avoid of random behavior in tiebreak states, and efficient updating order and rule update. These procedures can sort out the randomness issue in an original LPA and stabilize the discovered communities in all runs of the same network. Experiments on synthetic networks and a wide range of real-world social networks indicated that the proposed method achieves significant accuracy and high stability. Indeed, it can obviously solve monster community problem with regard to detecting communities in networks.

The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

Energy Technology Data Exchange (ETDEWEB)

Kim, M; Leskovec, J

2011-11-14

Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

Channel estimation for physical layer network coding systems

CERN Document Server

Gao, Feifei; Wang, Gongpu

2014-01-01

This SpringerBrief presents channel estimation strategies for the physical later network coding (PLNC) systems. Along with a review of PLNC architectures, this brief examines new challenges brought by the special structure of bi-directional two-hop transmissions that are different from the traditional point-to-point systems and unidirectional relay systems. The authors discuss the channel estimation strategies over typical fading scenarios, including frequency flat fading, frequency selective fading and time selective fading, as well as future research directions. Chapters explore the performa

Link2U: un social network aumentato su dispositivi mobili

Directory of Open Access Journals (Sweden)

Monica Sebillo

2012-04-01

Full Text Available Negli ultimi anni il connubio mobile entertainment e social network ha attirato un notevole interesse da parte dispecifici settori che, nonostante le criticità del momento, hanno deciso di investire nella realizzazione di ambienti esoluzioni di intrattenimento/divertimento, un fattore chiave alla base del miglioramento della tecnologia.Link2U: augmenting social networks on mobile devicesNowadays, modern mobile devices have become real person-al  computers  that  increase  the  ability  of  building/extending existing applications by combining several technologies such as camera, GPS, 3D graphics and permanent Internet connec-tion. The  resulting  integration  of  such  technologies  allows  to  run complex  applications,  such  as  augmented  reality  and  Social Networks. The goal of our current research is to support mobile users’ daily activities, by developing advanced solutions which take into account principles of human-computer interac-tion and usability. In this paper we propose to exploit the potential of the aug-mented reality and the ability to communicate of social net-works to create a mobile social network, where each commu-nity user may exploit advanced location based services, such as navigation through a two dimensional map, exploration of an area through a camera mode, and identification of points of interest embedded in an augmented reality environment.

Link2U: un social network aumentato su dispositivi mobili

Directory of Open Access Journals (Sweden)

Monica Sebillo

2012-04-01

Full Text Available Negli ultimi anni il connubio mobile entertainment e social network ha attirato un notevole interesse da parte dispecifici settori che, nonostante le criticità del momento, hanno deciso di investire nella realizzazione di ambienti esoluzioni di intrattenimento/divertimento, un fattore chiave alla base del miglioramento della tecnologia. Link2U: augmenting social networks on mobile devices Nowadays, modern mobile devices have become real person-al  computers  that  increase  the  ability  of  building/extending existing applications by combining several technologies such as camera, GPS, 3D graphics and permanent Internet connec-tion. The  resulting  integration  of  such  technologies  allows  to  run complex  applications,  such  as  augmented  reality  and  Social Networks. The goal of our current research is to support mobile users’ daily activities, by developing advanced solutions which take into account principles of human-computer interac-tion and usability. In this paper we propose to exploit the potential of the aug-mented reality and the ability to communicate of social net-works to create a mobile social network, where each commu-nity user may exploit advanced location based services, such as navigation through a two dimensional map, exploration of an area through a camera mode, and identification of points of interest embedded in an augmented reality environment.

Individual Channel Estimation in a Diamond Relay Network Using Relay-Assisted Training

Directory of Open Access Journals (Sweden)

Xianwen He

2017-01-01

Full Text Available We consider the training design and channel estimation in the amplify-and-forward (AF diamond relay network. Our strategy is to transmit the source training in time-multiplexing (TM mode while each relay node superimposes its own relay training over the amplified received data signal without bandwidth expansion. The principal challenge is to obtain accurate channel state information (CSI of second-hop link due to the multiaccess interference (MAI and cooperative data interference (CDI. To maintain the orthogonality between data and training, a modified relay-assisted training scheme is proposed to migrate the CDI, where some of the cooperative data at the relay are discarded to accommodate relay training. Meanwhile, a couple of optimal zero-correlation zone (ZCZ relay-assisted sequences are designed to avoid MAI. At the destination node, the received signals from the two relay nodes are combined to achieve spatial diversity and enhanced data reliability. The simulation results are presented to validate the performance of the proposed schemes.

Sequential optimization of methotrexate encapsulation in micellar nano-networks of polyethyleneimine ionomer containing redox-sensitive cross-links.

Science.gov (United States)

Abolmaali, Samira Sadat; Tamaddon, Ali; Yousefi, Gholamhossein; Javidnia, Katayoun; Dinarvand, Rasoul

2014-01-01

A functional polycation nanonetwork was developed for delivery of water soluble chemotherapeutic agents. The complexes of polyethyleneimine grafted methoxy polyethylene glycol (PEI-g-mPEG) and Zn(2+) were utilized as the micellar template for cross-linking with dithiodipropionic acid, followed by an acidic pH dialysis to remove the metal ion from the micellar template. The synthesis method was optimized according to pH, the molar ratio of Zn(2+), and the cross-link ratio. The atomic force microscopy showed soft, discrete, and uniform nano-networks. They were sensitive to the simulated reductive environment as determined by Ellman's assay. They showed few positive ζ potential and an average hydrodynamic diameter of 162±10 nm, which decreased to 49±11 nm upon dehydration. The ionic character of the nano-networks allowed the achievement of a higher-loading capacity of methotrexate (MTX), approximately 57% weight per weight, depending on the cross-link and the drug feed ratios. The nano-networks actively loaded with MTX presented some suitable properties, such as the hydrodynamic size of 117±16 nm, polydispersity index of 0.22, and a prolonged swelling-controlled release profile over 24 hours that boosted following reductive activation of the nanonetwork biodegradation. Unlike the PEI ionomer, the nano-networks provided an acceptable cytotoxicity profile. The drug-loaded nano-networks exhibited more specific cytotoxicity against human hepatocellular carcinoma cells if compared to free MTX at concentrations above 1 μM. The enhanced antitumor activity in vitro might be attributed to endocytic entry of MTX-loaded nano-networks that was found in the epifluorescence microscopy experiment for the fluorophore-labeled nano-networks.

Weed Growth Stage Estimator Using Deep Convolutional Neural Networks

DEFF Research Database (Denmark)

Teimouri, Nima; Dyrmann, Mads; Nielsen, Per Rydahl

2018-01-01

This study outlines a new method of automatically estimating weed species and growth stages (from cotyledon until eight leaves are visible) of in situ images covering 18 weed species or families. Images of weeds growing within a variety of crops were gathered across variable environmental conditi...... in estimating the number of leaves and 96% accuracy when accepting a deviation of two leaves. These results show that this new method of using deep convolutional neural networks has a relatively high ability to estimate early growth stages across a wide variety of weed species....

Exponentially convergent state estimation for delayed switched recurrent neural networks.

Science.gov (United States)

Ahn, Choon Ki

2011-11-01

This paper deals with the delay-dependent exponentially convergent state estimation problem for delayed switched neural networks. A set of delay-dependent criteria is derived under which the resulting estimation error system is exponentially stable. It is shown that the gain matrix of the proposed state estimator is characterised in terms of the solution to a set of linear matrix inequalities (LMIs), which can be checked readily by using some standard numerical packages. An illustrative example is given to demonstrate the effectiveness of the proposed state estimator.

Estimating Memory Deterioration Rates Following Neurodegeneration and Traumatic Brain Injuries in a Hopfield Network Model

Directory of Open Access Journals (Sweden)

Melanie Weber

2017-11-01

Full Text Available Neurodegenerative diseases and traumatic brain injuries (TBI are among the main causes of cognitive dysfunction in humans. At a neuronal network level, they both extensively exhibit focal axonal swellings (FAS, which in turn, compromise the information encoded in spike trains and lead to potentially severe functional deficits. There are currently no satisfactory quantitative predictors of decline in memory-encoding neuronal networks based on the impact and statistics of FAS. Some of the challenges of this translational approach include our inability to access small scale injuries with non-invasive methods, the overall complexity of neuronal pathologies, and our limited knowledge of how networks process biological signals. The purpose of this computational study is three-fold: (i to extend Hopfield's model for associative memory to account for the effects of FAS, (ii to calibrate FAS parameters from biophysical observations of their statistical distribution and size, and (iii to systematically evaluate deterioration rates for different memory-recall tasks as a function of FAS injury. We calculate deterioration rates for a face-recognition task to account for highly correlated memories and also for a discrimination task of random, uncorrelated memories with a size at the capacity limit of the Hopfield network. While it is expected that the performance of any injured network should decrease with injury, our results link, for the first time, the memory recall ability to observed FAS statistics. This allows for plausible estimates of cognitive decline for different stages of brain disorders within neuronal networks, bridging experimental observations following neurodegeneration and TBI with compromised memory recall. The work lends new insights to help close the gap between theory and experiment on how biological signals are processed in damaged, high-dimensional functional networks, and towards positing new diagnostic tools to measure cognitive

Estimating Memory Deterioration Rates Following Neurodegeneration and Traumatic Brain Injuries in a Hopfield Network Model

Science.gov (United States)

Weber, Melanie; Maia, Pedro D.; Kutz, J. Nathan

2017-01-01

Neurodegenerative diseases and traumatic brain injuries (TBI) are among the main causes of cognitive dysfunction in humans. At a neuronal network level, they both extensively exhibit focal axonal swellings (FAS), which in turn, compromise the information encoded in spike trains and lead to potentially severe functional deficits. There are currently no satisfactory quantitative predictors of decline in memory-encoding neuronal networks based on the impact and statistics of FAS. Some of the challenges of this translational approach include our inability to access small scale injuries with non-invasive methods, the overall complexity of neuronal pathologies, and our limited knowledge of how networks process biological signals. The purpose of this computational study is three-fold: (i) to extend Hopfield's model for associative memory to account for the effects of FAS, (ii) to calibrate FAS parameters from biophysical observations of their statistical distribution and size, and (iii) to systematically evaluate deterioration rates for different memory-recall tasks as a function of FAS injury. We calculate deterioration rates for a face-recognition task to account for highly correlated memories and also for a discrimination task of random, uncorrelated memories with a size at the capacity limit of the Hopfield network. While it is expected that the performance of any injured network should decrease with injury, our results link, for the first time, the memory recall ability to observed FAS statistics. This allows for plausible estimates of cognitive decline for different stages of brain disorders within neuronal networks, bridging experimental observations following neurodegeneration and TBI with compromised memory recall. The work lends new insights to help close the gap between theory and experiment on how biological signals are processed in damaged, high-dimensional functional networks, and towards positing new diagnostic tools to measure cognitive deficits. PMID

Artificial neural networks for stiffness estimation in magnetic resonance elastography.

Science.gov (United States)

Murphy, Matthew C; Manduca, Armando; Trzasko, Joshua D; Glaser, Kevin J; Huston, John; Ehman, Richard L

2018-07-01

To investigate the feasibility of using artificial neural networks to estimate stiffness from MR elastography (MRE) data. Artificial neural networks were fit using model-based training patterns to estimate stiffness from images of displacement using a patch size of ∼1 cm in each dimension. These neural network inversions (NNIs) were then evaluated in a set of simulation experiments designed to investigate the effects of wave interference and noise on NNI accuracy. NNI was also tested in vivo, comparing NNI results against currently used methods. In 4 simulation experiments, NNI performed as well or better than direct inversion (DI) for predicting the known stiffness of the data. Summary NNI results were also shown to be significantly correlated with DI results in the liver (R 2  = 0.974) and in the brain (R 2  = 0.915), and also correlated with established biological effects including fibrosis stage in the liver and age in the brain. Finally, repeatability error was lower in the brain using NNI compared to DI, and voxel-wise modeling using NNI stiffness maps detected larger effects than using DI maps with similar levels of smoothing. Artificial neural networks represent a new approach to inversion of MRE data. Summary results from NNI and DI are highly correlated and both are capable of detecting biologically relevant signals. Preliminary evidence suggests that NNI stiffness estimates may be more resistant to noise than an algebraic DI approach. Taken together, these results merit future investigation into NNIs to improve the estimation of stiffness in small regions. Magn Reson Med 80:351-360, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Network Performance Evaluation of Abis Interface over DVB-S2 in the GSM over Satellite Network

Directory of Open Access Journals (Sweden)

S. B. Musabekov

2010-01-01

Full Text Available This paper deals with establishing a GSM link over Satellite. Abis interface, which is defined between Base Transceiver Station (BTS and Base Station Controller (BSC, in a GSM network is considered here to be routed over the Satellite. The satellite link enables a quick and cost-effective GSM link in meagerly populated areas. A different scenario comparison was done to understand the impact of Satellite environment on network availability comparing to terrestrial scenario. We have implemented an Abis interface over DVB S2 in NS2 and evaluated the performance over the high delay and loss satellite channel. Network performance was evaluated with respect to Satellite channel delay and DVB S2 encapsulation efficiency under different amount of user traffic and compared with the terrestrial scenario. The results clearly showed an increased amount of SDCCH and TCH channels required in the case of satellite scenario for the same amount of traffic in comparison to conventional terrestrial scenario. We have optimized the parameters based on the simulation results. Link budget estimation considering DVB-S2 platform was done to find satellite bandwidth and cost requirements for different network setups.

Underwater Inherent Optical Properties Estimation Using a Depth Aided Deep Neural Network

Directory of Open Access Journals (Sweden)

Zhibin Yu

2017-01-01

Full Text Available Underwater inherent optical properties (IOPs are the fundamental clues to many research fields such as marine optics, marine biology, and underwater vision. Currently, beam transmissometers and optical sensors are considered as the ideal IOPs measuring methods. But these methods are inflexible and expensive to be deployed. To overcome this problem, we aim to develop a novel measuring method using only a single underwater image with the help of deep artificial neural network. The power of artificial neural network has been proved in image processing and computer vision fields with deep learning technology. However, image-based IOPs estimation is a quite different and challenging task. Unlike the traditional applications such as image classification or localization, IOP estimation looks at the transparency of the water between the camera and the target objects to estimate multiple optical properties simultaneously. In this paper, we propose a novel Depth Aided (DA deep neural network structure for IOPs estimation based on a single RGB image that is even noisy. The imaging depth information is considered as an aided input to help our model make better decision.

Underwater Inherent Optical Properties Estimation Using a Depth Aided Deep Neural Network.

Science.gov (United States)

Yu, Zhibin; Wang, Yubo; Zheng, Bing; Zheng, Haiyong; Wang, Nan; Gu, Zhaorui

2017-01-01

Underwater inherent optical properties (IOPs) are the fundamental clues to many research fields such as marine optics, marine biology, and underwater vision. Currently, beam transmissometers and optical sensors are considered as the ideal IOPs measuring methods. But these methods are inflexible and expensive to be deployed. To overcome this problem, we aim to develop a novel measuring method using only a single underwater image with the help of deep artificial neural network. The power of artificial neural network has been proved in image processing and computer vision fields with deep learning technology. However, image-based IOPs estimation is a quite different and challenging task. Unlike the traditional applications such as image classification or localization, IOP estimation looks at the transparency of the water between the camera and the target objects to estimate multiple optical properties simultaneously. In this paper, we propose a novel Depth Aided (DA) deep neural network structure for IOPs estimation based on a single RGB image that is even noisy. The imaging depth information is considered as an aided input to help our model make better decision.

Quantum demultiplexer of quantum parameter-estimation information in quantum networks

Science.gov (United States)

Xie, Yanqing; Huang, Yumeng; Wu, Yinzhong; Hao, Xiang

2018-05-01

The quantum demultiplexer is constructed by a series of unitary operators and multipartite entangled states. It is used to realize information broadcasting from an input node to multiple output nodes in quantum networks. The scheme of quantum network communication with respect to phase estimation is put forward through the demultiplexer subjected to amplitude damping noises. The generalized partial measurements can be applied to protect the transferring efficiency from environmental noises in the protocol. It is found out that there are some optimal coherent states which can be prepared to enhance the transmission of phase estimation. The dynamics of state fidelity and quantum Fisher information are investigated to evaluate the feasibility of the network communication. While the state fidelity deteriorates rapidly, the quantum Fisher information can be enhanced to a maximum value and then decreases slowly. The memory effect of the environment induces the oscillations of fidelity and quantum Fisher information. The adjustment of the strength of partial measurements is helpful to increase quantum Fisher information.

Deep mining heterogeneous networks of biomedical linked data to predict novel drug-target associations.

Science.gov (United States)

Zong, Nansu; Kim, Hyeoneui; Ngo, Victoria; Harismendy, Olivier

2017-08-01

A heterogeneous network topology possessing abundant interactions between biomedical entities has yet to be utilized in similarity-based methods for predicting drug-target associations based on the array of varying features of drugs and their targets. Deep learning reveals features of vertices of a large network that can be adapted in accommodating the similarity-based solutions to provide a flexible method of drug-target prediction. We propose a similarity-based drug-target prediction method that enhances existing association discovery methods by using a topology-based similarity measure. DeepWalk, a deep learning method, is adopted in this study to calculate the similarities within Linked Tripartite Network (LTN), a heterogeneous network generated from biomedical linked datasets. This proposed method shows promising results for drug-target association prediction: 98.96% AUC ROC score with a 10-fold cross-validation and 99.25% AUC ROC score with a Monte Carlo cross-validation with LTN. By utilizing DeepWalk, we demonstrate that: (i) this method outperforms other existing topology-based similarity computation methods, (ii) the performance is better for tripartite than with bipartite networks and (iii) the measure of similarity using network topology outperforms the ones derived from chemical structure (drugs) or genomic sequence (targets). Our proposed methodology proves to be capable of providing a promising solution for drug-target prediction based on topological similarity with a heterogeneous network, and may be readily re-purposed and adapted in the existing of similarity-based methodologies. The proposed method has been developed in JAVA and it is available, along with the data at the following URL: https://github.com/zongnansu1982/drug-target-prediction . nazong@ucsd.edu. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Escape routes, weak links, and desynchronization in fluctuation-driven networks

DEFF Research Database (Denmark)

Schäfer, Benjamin; Matthiae, Moritz; Zhang, Xiaozhu

2017-01-01

Shifting our electricity generation from fossil fuel to renewable energy sources introduces large fluctuations to the power system. Here, we demonstrate how increased fluctuations, reduced damping, and reduced intertia may undermine the dynamical robustness of power grid networks. Focusing...... on fundamental noise models, we derive analytic insights into which factors limit the dynamic robustness and how fluctuations may induce a system escape from an operating state. Moreover, we identify weak links in the grid that make it particularly vulnerable to fluctuations. These results thereby not only...

H∞ state estimation of stochastic memristor-based neural networks with time-varying delays.

Science.gov (United States)

Bao, Haibo; Cao, Jinde; Kurths, Jürgen; Alsaedi, Ahmed; Ahmad, Bashir

2018-03-01

This paper addresses the problem of H ∞ state estimation for a class of stochastic memristor-based neural networks with time-varying delays. Under the framework of Filippov solution, the stochastic memristor-based neural networks are transformed into systems with interval parameters. The present paper is the first to investigate the H ∞ state estimation problem for continuous-time Itô-type stochastic memristor-based neural networks. By means of Lyapunov functionals and some stochastic technique, sufficient conditions are derived to ensure that the estimation error system is asymptotically stable in the mean square with a prescribed H ∞ performance. An explicit expression of the state estimator gain is given in terms of linear matrix inequalities (LMIs). Compared with other results, our results reduce control gain and control cost effectively. Finally, numerical simulations are provided to demonstrate the efficiency of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

Reorientational motion of a cross-link junction in a poly(dimethylsiloxane) network measured by time-resolved fluorescence depolarization

Energy Technology Data Exchange (ETDEWEB)

Stein, A.D. (Department of Chemistry, Stanford University, Stanford, California 94305 (United States)); Hoffman, D.A. (Department of Materials Science and Engineering, Stanford University, Stanford, California 94305 (United States)); Frank, C.W. (Department of Chemical Engineering, Stanford University, Stanford, California 94305 (United States)); Fayer, M.D. (Department of Chemistry, Stanford University, Stanford, California 94305 (United States))

1992-02-15

The reorientational dynamics of a cross-link junction in poly(dimethylsiloxane) networks, measured by the fluorescence anisotropy decay of a chromophore tagged to the cross-link, have been investigated over a range of temperatures from {ital T}{sub {ital g}}+75 to {ital T}{sub {ital g}}+150. The probe chromophore, 1-dimethylamino-5-sulfonylnaphthalene amide (dansyl amide), is pendant to a trifunctional silane that acts as a cross-linking molecule. In cyclohexanol, the fluorescence anisotropy decay is in agreement with Debye--Stokes--Einstein hydrodynamic theory (rotational diffusion) demonstrating that the cross-linker can be used as a probe of orientational relaxation. The fluorescence anisotropy decays at a rapid rate in an end-linked poly(dimethyl siloxane) network reflecting fast reorientational motion of the cross-link junction. This reorientation appears diffusive and has a temperature dependence in accord with the Williams--Landel--Ferry equation. A model is proposed that suggests that reorientation and translational motion of the cross-link occur simultaneously and are both coupled to fluctuations of the polymer chain ends.

Error estimation of deformable image registration of pulmonary CT scans using convolutional neural networks.

Science.gov (United States)

Eppenhof, Koen A J; Pluim, Josien P W

2018-04-01

Error estimation in nonlinear medical image registration is a nontrivial problem that is important for validation of registration methods. We propose a supervised method for estimation of registration errors in nonlinear registration of three-dimensional (3-D) images. The method is based on a 3-D convolutional neural network that learns to estimate registration errors from a pair of image patches. By applying the network to patches centered around every voxel, we construct registration error maps. The network is trained using a set of representative images that have been synthetically transformed to construct a set of image pairs with known deformations. The method is evaluated on deformable registrations of inhale-exhale pairs of thoracic CT scans. Using ground truth target registration errors on manually annotated landmarks, we evaluate the method's ability to estimate local registration errors. Estimation of full domain error maps is evaluated using a gold standard approach. The two evaluation approaches show that we can train the network to robustly estimate registration errors in a predetermined range, with subvoxel accuracy. We achieved a root-mean-square deviation of 0.51 mm from gold standard registration errors and of 0.66 mm from ground truth landmark registration errors.

Modeling interacting dynamic networks: II. Systematic study of the statistical properties of cross-links between two networks with preferred degrees

International Nuclear Information System (INIS)

Liu, Wenjia; Schmittmann, B; Zia, R K P

2014-01-01

In a recent work (Liu et al, 2013 J. Stat. Mech. P08001), we introduced dynamic networks with preferred degrees and presented simulation and analytic studies of a single, homogeneous system as well as two interacting networks. Here, we extend these studies to a wider range of parameter space, in a more systematic fashion. Though the interaction we introduced seems simple and intuitive, it produced dramatically different behavior in the single- and two-network systems. Specifically, partitioning the single network into two identical sectors, we find the cross-link distribution to be a sharply peaked Gaussian. In stark contrast, we find a very broad and flat plateau in the case of two interacting identical networks. A sound understanding of this phenomenon remains elusive. Exploring more asymmetric interacting networks, we discover a kind of ‘universal behavior’ for systems in which the ‘introverts’ (nodes with smaller preferred degree) are far outnumbered. Remarkably, an approximation scheme for their degree distribution can be formulated, leading to very successful predictions. (paper)

Promoting Wired Links in Wireless Mesh Networks: An Efficient Engineering Solution

Science.gov (United States)

Barekatain, Behrang; Raahemifar, Kaamran; Ariza Quintana, Alfonso; Triviño Cabrera, Alicia

2015-01-01

Wireless Mesh Networks (WMNs) cannot completely guarantee good performance of traffic sources such as video streaming. To improve the network performance, this study proposes an efficient engineering solution named Wireless-to-Ethernet-Mesh-Portal-Passageway (WEMPP) that allows effective use of wired communication in WMNs. WEMPP permits transmitting data through wired and stable paths even when the destination is in the same network as the source (Intra-traffic). Tested with four popular routing protocols (Optimized Link State Routing or OLSR as a proactive protocol, Dynamic MANET On-demand or DYMO as a reactive protocol, DYMO with spanning tree ability and HWMP), WEMPP considerably decreases the end-to-end delay, jitter, contentions and interferences on nodes, even when the network size or density varies. WEMPP is also cost-effective and increases the network throughput. Moreover, in contrast to solutions proposed by previous studies, WEMPP is easily implemented by modifying the firmware of the actual Ethernet hardware without altering the routing protocols and/or the functionality of the IP/MAC/Upper layers. In fact, there is no need for modifying the functionalities of other mesh components in order to work with WEMPPs. The results of this study show that WEMPP significantly increases the performance of all routing protocols, thus leading to better video quality on nodes. PMID:25793516

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

Science.gov (United States)

Carnegie, Nicole Bohme

2018-01-30

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

Artificial Neural Network for Location Estimation in Wireless Communication Systems

Directory of Open Access Journals (Sweden)

Chien-Sheng Chen

2012-03-01

Full Text Available In a wireless communication system, wireless location is the technique used to estimate the location of a mobile station (MS. To enhance the accuracy of MS location prediction, we propose a novel algorithm that utilizes time of arrival (TOA measurements and the angle of arrival (AOA information to locate MS when three base stations (BSs are available. Artificial neural networks (ANN are widely used techniques in various areas to overcome the problem of exclusive and nonlinear relationships. When the MS is heard by only three BSs, the proposed algorithm utilizes the intersections of three TOA circles (and the AOA line, based on various neural networks, to estimate the MS location in non-line-of-sight (NLOS environments. Simulations were conducted to evaluate the performance of the algorithm for different NLOS error distributions. The numerical analysis and simulation results show that the proposed algorithms can obtain more precise location estimation under different NLOS environments.

Artificial neural network for location estimation in wireless communication systems.

Science.gov (United States)

Chen, Chien-Sheng

2012-01-01

In a wireless communication system, wireless location is the technique used to estimate the location of a mobile station (MS). To enhance the accuracy of MS location prediction, we propose a novel algorithm that utilizes time of arrival (TOA) measurements and the angle of arrival (AOA) information to locate MS when three base stations (BSs) are available. Artificial neural networks (ANN) are widely used techniques in various areas to overcome the problem of exclusive and nonlinear relationships. When the MS is heard by only three BSs, the proposed algorithm utilizes the intersections of three TOA circles (and the AOA line), based on various neural networks, to estimate the MS location in non-line-of-sight (NLOS) environments. Simulations were conducted to evaluate the performance of the algorithm for different NLOS error distributions. The numerical analysis and simulation results show that the proposed algorithms can obtain more precise location estimation under different NLOS environments.

Inference of directed climate networks: role of instability of causality estimation methods

Science.gov (United States)

Hlinka, Jaroslav; Hartman, David; Vejmelka, Martin; Paluš, Milan

2013-04-01

Climate data are increasingly analyzed by complex network analysis methods, including graph-theoretical approaches [1]. For such analysis, links between localized nodes of climate network are typically quantified by some statistical measures of dependence (connectivity) between measured variables of interest. To obtain information on the directionality of the interactions in the networks, a wide range of methods exists. These can be broadly divided into linear and nonlinear methods, with some of the latter having the theoretical advantage of being model-free, and principally a generalization of the former [2]. However, as a trade-off, this generality comes together with lower accuracy - in particular if the system was close to linear. In an overall stationary system, this may potentially lead to higher variability in the nonlinear network estimates. Therefore, with the same control of false alarms, this may lead to lower sensitivity for detection of real changes in the network structure. These problems are discussed on the example of daily SAT and SLP data from the NCEP/NCAR reanalysis dataset. We first reduce the dimensionality of data using PCA with VARIMAX rotation to detect several dozens of components that together explain most of the data variability. We further construct directed climate networks applying a selection of most widely used methods - variants of linear Granger causality and conditional mutual information. Finally, we assess the stability of the detected directed climate networks by computing them in sliding time windows. To understand the origin of the observed instabilities and their range, we also apply the same procedure to two types of surrogate data: either with non-stationarity in network structure removed, or imposed in a controlled way. In general, the linear methods show stable results in terms of overall similarity of directed climate networks inferred. For instance, for different decades of SAT data, the Spearman correlation of edge

Multi-Hop Link Capacity of Multi-Route Multi-Hop MRC Diversity for a Virtual Cellular Network

Science.gov (United States)

Daou, Imane; Kudoh, Eisuke; Adachi, Fumiyuki

In virtual cellular network (VCN), proposed for high-speed mobile communications, the signal transmitted from a mobile terminal is received by some wireless ports distributed in each virtual cell and relayed to the central port that acts as a gateway to the core network. In this paper, we apply the multi-route MHMRC diversity in order to decrease the transmit power and increase the multi-hop link capacity. The transmit power, the interference power and the link capacity are evaluated for DS-CDMA multi-hop VCN by computer simulation. The multi-route MHMRC diversity can be applied to not only DS-CDMA but also other access schemes (i. e. MC-CDMA, OFDM, etc.).

Permeability Estimation of Rock Reservoir Based on PCA and Elman Neural Networks

Science.gov (United States)

Shi, Ying; Jian, Shaoyong

2018-03-01

an intelligent method which based on fuzzy neural networks with PCA algorithm, is proposed to estimate the permeability of rock reservoir. First, the dimensionality reduction process is utilized for these parameters by principal component analysis method. Further, the mapping relationship between rock slice characteristic parameters and permeability had been found through fuzzy neural networks. The estimation validity and reliability for this method were tested with practical data from Yan’an region in Ordos Basin. The result showed that the average relative errors of permeability estimation for this method is 6.25%, and this method had the better convergence speed and more accuracy than other. Therefore, by using the cheap rock slice related information, the permeability of rock reservoir can be estimated efficiently and accurately, and it is of high reliability, practicability and application prospect.

Energy flow models for the estimation of technical losses in distribution network

International Nuclear Information System (INIS)

Au, Mau Teng; Tan, Chin Hooi

2013-01-01

This paper presents energy flow models developed to estimate technical losses in distribution network. Energy flow models applied in this paper is based on input energy and peak demand of distribution network, feeder length and peak demand, transformer loading capacity, and load factor. Two case studies, an urban distribution network and a rural distribution network are used to illustrate application of the energy flow models. Results on technical losses obtained for the two distribution networks are consistent and comparable to network of similar types and characteristics. Hence, the energy flow models are suitable for practical application.

Scanning the available Dictyostelium discoideum proteome for O-linked GlcNAc glycosylation sitesusing neural networks

DEFF Research Database (Denmark)

Gupta, Ramneek; Jung, Eva; Gooley, Andrew A

1999-01-01

Dictyostelium discoideum has been suggested as a eukaryotic model organism for glycobiology studies. Presently, the characteristics of acceptor sites for the N-acetylglucosaminyl-transferases in Dictyostelium discoideum, which link GlcNAc in an alpha linkage to hydroxyl residues, are largely...... unknown. This motivates the development of a species specific method for prediction of O-linked GlcNAc glycosylation sites in secreted and membrane proteins of D. discoideum. The method presented here employs a jury of artificial neural networks. These networks were trained to recognize the sequence...... context and protein surface accessibility in 39 experimentally determined O-alpha-GlcNAc sites found in D. discoideum glycoproteins expressed in vivo. Cross-validation of the data revealed a correlation in which 97% of the glycosylated and nonglycosylated sites were correctly identified. Based...

Weed Growth Stage Estimator Using Deep Convolutional Neural Networks.

Science.gov (United States)

Teimouri, Nima; Dyrmann, Mads; Nielsen, Per Rydahl; Mathiassen, Solvejg Kopp; Somerville, Gayle J; Jørgensen, Rasmus Nyholm

2018-05-16

This study outlines a new method of automatically estimating weed species and growth stages (from cotyledon until eight leaves are visible) of in situ images covering 18 weed species or families. Images of weeds growing within a variety of crops were gathered across variable environmental conditions with regards to soil types, resolution and light settings. Then, 9649 of these images were used for training the computer, which automatically divided the weeds into nine growth classes. The performance of this proposed convolutional neural network approach was evaluated on a further set of 2516 images, which also varied in term of crop, soil type, image resolution and light conditions. The overall performance of this approach achieved a maximum accuracy of 78% for identifying Polygonum spp. and a minimum accuracy of 46% for blackgrass. In addition, it achieved an average 70% accuracy rate in estimating the number of leaves and 96% accuracy when accepting a deviation of two leaves. These results show that this new method of using deep convolutional neural networks has a relatively high ability to estimate early growth stages across a wide variety of weed species.

An Improved Convolutional Neural Network on Crowd Density Estimation

Directory of Open Access Journals (Sweden)

Pan Shao-Yun

2016-01-01

Full Text Available In this paper, a new method is proposed for crowd density estimation. An improved convolutional neural network is combined with traditional texture feature. The data calculated by the convolutional layer can be treated as a new kind of features.So more useful information of images can be extracted by different features.In the meantime, the size of image has little effect on the result of convolutional neural network. Experimental results indicate that our scheme has adequate performance to allow for its use in real world applications.

On the Impacts and Benefits of Implementing Full-Duplex Communications Links in an Underwater Acoustic Network

National Research Council Canada - National Science Library

Gibson, J; Larraza, A; Rice, J; Smith, K; Xie, G

2002-01-01

.... These networks may provide command and control for autonomous underwater vehicles, forward reporting by arrays of sensor grids, ad hoc communications links to covert forces, or positive control...

Legal Effects of Link Sharing in Social Networks

Directory of Open Access Journals (Sweden)

Eugenio Gil

2015-12-01

Full Text Available Knowledge sharing among individuals has changed deeply with the advent of social networks in the environment of Web 2.0. Every user has the possibility of publishing what he or she deems of interest for their audience, regardless of the origin or authorship of the piece of knowledge. It is generally accepted that as the user is sharing a link to a document or video, for example, without getting paid for it, there is no point in worrying about the rights of the original author. It seems that the concepts of authorship and originality is about to disappear as promised the structuralists fifty years ago. Nevertheless the legal system has not changed, nor have the economic interests concerned. This paper explores the last developments of the legal system concerning these issues.

3D position estimation using an artificial neural network for a continuous scintillator PET detector

International Nuclear Information System (INIS)

Wang, Y; Zhu, W; Cheng, X; Li, D

2013-01-01

Continuous crystal based PET detectors have features of simple design, low cost, good energy resolution and high detection efficiency. Through single-end readout of scintillation light, direct three-dimensional (3D) position estimation could be another advantage that the continuous crystal detector would have. In this paper, we propose to use artificial neural networks to simultaneously estimate the plane coordinate and DOI coordinate of incident γ photons with detected scintillation light. Using our experimental setup with an ‘8 + 8’ simplified signal readout scheme, the training data of perpendicular irradiation on the front surface and one side surface are obtained, and the plane (x, y) networks and DOI networks are trained and evaluated. The test results show that the artificial neural network for DOI estimation is as effective as for plane estimation. The performance of both estimators is presented by resolution and bias. Without bias correction, the resolution of the plane estimator is on average better than 2 mm and that of the DOI estimator is about 2 mm over the whole area of the detector. With bias correction, the resolution at the edge area for plane estimation or at the end of the block away from the readout PMT for DOI estimation becomes worse, as we expect. The comprehensive performance of the 3D positioning by a neural network is accessed by the experimental test data of oblique irradiations. To show the combined effect of the 3D positioning over the whole area of the detector, the 2D flood images of oblique irradiation are presented with and without bias correction. (paper)

A generalized theory of preferential linking

Science.gov (United States)

Hu, Haibo; Guo, Jinli; Liu, Xuan; Wang, Xiaofan

2014-12-01

There are diverse mechanisms driving the evolution of social networks. A key open question dealing with understanding their evolution is: How do various preferential linking mechanisms produce networks with different features? In this paper we first empirically study preferential linking phenomena in an evolving online social network, find and validate the linear preference. We propose an analyzable model which captures the real growth process of the network and reveals the underlying mechanism dominating its evolution. Furthermore based on preferential linking we propose a generalized model reproducing the evolution of online social networks, and present unified analytical results describing network characteristics for 27 preference scenarios. We study the mathematical structure of degree distributions and find that within the framework of preferential linking analytical degree distributions can only be the combinations of finite kinds of functions which are related to rational, logarithmic and inverse tangent functions, and extremely complex network structure will emerge even for very simple sublinear preferential linking. This work not only provides a verifiable origin for the emergence of various network characteristics in social networks, but bridges the micro individuals' behaviors and the global organization of social networks.

Branch current state estimation of three phase distribution networks suitable for paralellization

NARCIS (Netherlands)

Blaauwbroek, N.; Nguyen, H.P.; Gibescu, M.; Slootweg, J.G.

2017-01-01

The evolution of distribution networks from passive to active distribution systems puts new requirements on the monitoring and control capabilities of these systems. The development of state estimation algorithms to gain insight in the actual system state of a distribution network has resulted in a

High voltage direct current (HVDC) link between the power networks of Italy and Greece

International Nuclear Information System (INIS)

Carcano, C.; Oliva, P.; Voyatzakis, J.

1996-01-01

Interconnection between the power networks of Italy and Greece has long been declared of European interest. The link, which will directly connect Greece with the power network of UCPTE, is perfectly in line with the targets of the European Union in terms of trans-European power networks. The interconnection, which benefits of a financial contribution of the EU, will rely on a 400 kV d.c. transmission system with one submarine cable between the Italian and Greek coasts, overhead lines on land, d.c./a.c. conversion stations, return of current to sea via marine electrodes. The main technical features of the project are described, highlighting its most significant design concepts. (author)

White Rabbit Precision Time Protocol on Long-Distance Fiber Links.

Science.gov (United States)

Dierikx, Erik F; Wallin, Anders E; Fordell, Thomas; Myyry, Jani; Koponen, Petri; Merimaa, Mikko; Pinkert, Tjeerd J; Koelemeij, Jeroen C J; Peek, Henk Z; Smets, Rob

2016-07-01

The application of White Rabbit precision time protocol (WR-PTP) in long-distance optical fiber links has been investigated. WR-PTP is an implementation of PTP in synchronous Ethernet optical fiber networks, originally intended for synchronization of equipment within a range of 10 km. This paper discusses the results and limitations of two implementations of WR-PTP in the existing communication fiber networks. A 950-km WR-PTP link was realized using unidirectional paths in a fiber pair between Espoo and Kajaani, Finland. The time transfer on this link was compared (after initial calibration) against a clock comparison by GPS precise point positioning (PPP). The agreement between the two methods remained within [Formula: see text] over three months of measurements. Another WR-PTP implementation was realized between Delft and Amsterdam, the Netherlands, by cascading two links of 137 km each. In this case, the WR links were realized as bidirectional paths in single fibers. The measured time offset between the starting and end points of the link was within 5 ns with an uncertainty of 8 ns, mainly due to the estimated delay asymmetry caused by chromatic dispersion.

A case study to estimate costs using Neural Networks and regression based models

Directory of Open Access Journals (Sweden)

Nadia Bhuiyan

2012-07-01

Full Text Available Bombardier Aerospace’s high performance aircrafts and services set the utmost standard for the Aerospace industry. A case study in collaboration with Bombardier Aerospace is conducted in order to estimate the target cost of a landing gear. More precisely, the study uses both parametric model and neural network models to estimate the cost of main landing gears, a major aircraft commodity. A comparative analysis between the parametric based model and those upon neural networks model will be considered in order to determine the most accurate method to predict the cost of a main landing gear. Several trials are presented for the design and use of the neural network model. The analysis for the case under study shows the flexibility in the design of the neural network model. Furthermore, the performance of the neural network model is deemed superior to the parametric models for this case study.

Mobile Position Estimation using Artificial Neural Network in CDMA Cellular Systems

Directory of Open Access Journals (Sweden)

Omar Waleed Abdulwahhab

2017-01-01

Full Text Available Using the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA and received signal strength (RSS are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through that region. The results show that the neural network has good performance compared with two other analytical methods which are average positioning method and optimal positioning method.

Link prediction in weighted networks

DEFF Research Database (Denmark)

Wind, David Kofoed; Mørup, Morten

2012-01-01

Many complex networks feature relations with weight information. Some models utilize this information while other ignore the weight information when inferring the structure. In this paper we investigate if edge-weights when modeling real networks, carry important information about the network...... is to infer presence of edges, but that simpler models are better at inferring the actual weights....

Simultaneous Parameters Identifiability and Estimation of an E. coli Metabolic Network Model

Directory of Open Access Journals (Sweden)

Kese Pontes Freitas Alberton

2015-01-01

Full Text Available This work proposes a procedure for simultaneous parameters identifiability and estimation in metabolic networks in order to overcome difficulties associated with lack of experimental data and large number of parameters, a common scenario in the modeling of such systems. As case study, the complex real problem of parameters identifiability of the Escherichia coli K-12 W3110 dynamic model was investigated, composed by 18 differential ordinary equations and 35 kinetic rates, containing 125 parameters. With the procedure, model fit was improved for most of the measured metabolites, achieving 58 parameters estimated, including 5 unknown initial conditions. The results indicate that simultaneous parameters identifiability and estimation approach in metabolic networks is appealing, since model fit to the most of measured metabolites was possible even when important measures of intracellular metabolites and good initial estimates of parameters are not available.

Analyses of the response of a complex weighted network to nodes removal strategies considering links weight: The case of the Beijing urban road system

Science.gov (United States)

Bellingeri, Michele; Lu, Zhe-Ming; Cassi, Davide; Scotognella, Francesco

2018-02-01

Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.

An Artificial Neural Networks Approach to Estimate Occupational Accident: A National Perspective for Turkey

Directory of Open Access Journals (Sweden)

Hüseyin Ceylan

2014-01-01

Full Text Available Occupational accident estimation models were developed by using artificial neural networks (ANNs for Turkey. Using these models the number of occupational accidents and death and permanent incapacity numbers resulting from occupational accidents were estimated for Turkey until the year of 2025 by the three different scenarios. In the development of the models, insured workers, workplace, occupational accident, death, and permanent incapacity values were used as model parameters with data between 1970 and 2012. 2-5-1 neural network architecture was selected as the best network architecture. Sigmoid was used in hidden layers and linear function was used at output layer. The feed forward back propagation algorithm was used to train the network. In order to obtain a useful model, the network was trained between 1970 and 1999 to estimate the values of 2000 to 2012. The result was compared with the real values and it was seen that it is applicable for this aim. The performances of all developed models were evaluated using mean absolute percent errors (MAPE, mean absolute errors (MAE, and root mean square errors (RMSE.

Optimal capacity and buffer size estimation under Generalized Markov Fluids Models and QoS parameters

International Nuclear Information System (INIS)

Bavio, José; Marrón, Beatriz

2014-01-01

Quality of service (QoS) for internet traffic management requires good traffic models and good estimation of sharing network resource. A link of a network processes all traffic and it is designed with certain capacity C and buffer size B. A Generalized Markov Fluid model (GMFM), introduced by Marrón (2011), is assumed for the sources because describes in a versatile way the traffic, allows estimation based on traffic traces, and also consistent effective bandwidth estimation can be done. QoS, interpreted as buffer overflow probability, can be estimated for GMFM through the effective bandwidth estimation and solving the optimization problem presented in Courcoubetis (2002), the so call inf-sup formulas. In this work we implement a code to solve the inf-sup problem and other optimization related with it, that allow us to do traffic engineering in links of data networks to calculate both, minimum capacity required when QoS and buffer size are given or minimum buffer size required when QoS and capacity are given

Projection-based circular constrained state estimation and fusion over long-haul links

Energy Technology Data Exchange (ETDEWEB)

Liu, Qiang [ORNL; Rao, Nageswara S. [ORNL

2017-07-01

In this paper, we consider a scenario where sensors are deployed over a large geographical area for tracking a target with circular nonlinear constraints on its motion dynamics. The sensor state estimates are sent over long-haul networks to a remote fusion center for fusion. We are interested in different ways to incorporate the constraints into the estimation and fusion process in the presence of communication loss. In particular, we consider closed-form projection-based solutions, including rules for fusing the estimates and for incorporating the constraints, which jointly can guarantee timely fusion often required in realtime systems. We test the performance of these methods in the long-haul tracking environment using a simple example.

Gross domestic product estimation based on electricity utilization by artificial neural network

Science.gov (United States)

Stevanović, Mirjana; Vujičić, Slađana; Gajić, Aleksandar M.

2018-01-01

The main goal of the paper was to estimate gross domestic product (GDP) based on electricity estimation by artificial neural network (ANN). The electricity utilization was analyzed based on different sources like renewable, coal and nuclear sources. The ANN network was trained with two training algorithms namely extreme learning method and back-propagation algorithm in order to produce the best prediction results of the GDP. According to the results it can be concluded that the ANN model with extreme learning method could produce the acceptable prediction of the GDP based on the electricity utilization.

Constraint Network Analysis (CNA): a Python software package for efficiently linking biomacromolecular structure, flexibility, (thermo-)stability, and function.

Science.gov (United States)

Pfleger, Christopher; Rathi, Prakash Chandra; Klein, Doris L; Radestock, Sebastian; Gohlke, Holger

2013-04-22

For deriving maximal advantage from information on biomacromolecular flexibility and rigidity, results from rigidity analyses must be linked to biologically relevant characteristics of a structure. Here, we describe the Python-based software package Constraint Network Analysis (CNA) developed for this task. CNA functions as a front- and backend to the graph-based rigidity analysis software FIRST. CNA goes beyond the mere identification of flexible and rigid regions in a biomacromolecule in that it (I) provides a refined modeling of thermal unfolding simulations that also considers the temperature-dependence of hydrophobic tethers, (II) allows performing rigidity analyses on ensembles of network topologies, either generated from structural ensembles or by using the concept of fuzzy noncovalent constraints, and (III) computes a set of global and local indices for quantifying biomacromolecular stability. This leads to more robust results from rigidity analyses and extends the application domain of rigidity analyses in that phase transition points ("melting points") and unfolding nuclei ("structural weak spots") are determined automatically. Furthermore, CNA robustly handles small-molecule ligands in general. Such advancements are important for applying rigidity analysis to data-driven protein engineering and for estimating the influence of ligand molecules on biomacromolecular stability. CNA maintains the efficiency of FIRST such that the analysis of a single protein structure takes a few seconds for systems of several hundred residues on a single core. These features make CNA an interesting tool for linking biomacromolecular structure, flexibility, (thermo-)stability, and function. CNA is available from http://cpclab.uni-duesseldorf.de/software for nonprofit organizations.

Improving local clustering based top-L link prediction methods via asymmetric link clustering information

Science.gov (United States)

Wu, Zhihao; Lin, Youfang; Zhao, Yiji; Yan, Hongyan

2018-02-01

Networks can represent a wide range of complex systems, such as social, biological and technological systems. Link prediction is one of the most important problems in network analysis, and has attracted much research interest recently. Many link prediction methods have been proposed to solve this problem with various techniques. We can note that clustering information plays an important role in solving the link prediction problem. In previous literatures, we find node clustering coefficient appears frequently in many link prediction methods. However, node clustering coefficient is limited to describe the role of a common-neighbor in different local networks, because it cannot distinguish different clustering abilities of a node to different node pairs. In this paper, we shift our focus from nodes to links, and propose the concept of asymmetric link clustering (ALC) coefficient. Further, we improve three node clustering based link prediction methods via the concept of ALC. The experimental results demonstrate that ALC-based methods outperform node clustering based methods, especially achieving remarkable improvements on food web, hamster friendship and Internet networks. Besides, comparing with other methods, the performance of ALC-based methods are very stable in both globalized and personalized top-L link prediction tasks.

A Novel Group-Fused Sparse Partial Correlation Method for Simultaneous Estimation of Functional Networks in Group Comparison Studies.

Science.gov (United States)

Liang, Xiaoyun; Vaughan, David N; Connelly, Alan; Calamante, Fernando

2018-05-01

The conventional way to estimate functional networks is primarily based on Pearson correlation along with classic Fisher Z test. In general, networks are usually calculated at the individual-level and subsequently aggregated to obtain group-level networks. However, such estimated networks are inevitably affected by the inherent large inter-subject variability. A joint graphical model with Stability Selection (JGMSS) method was recently shown to effectively reduce inter-subject variability, mainly caused by confounding variations, by simultaneously estimating individual-level networks from a group. However, its benefits might be compromised when two groups are being compared, given that JGMSS is blinded to other groups when it is applied to estimate networks from a given group. We propose a novel method for robustly estimating networks from two groups by using group-fused multiple graphical-lasso combined with stability selection, named GMGLASS. Specifically, by simultaneously estimating similar within-group networks and between-group difference, it is possible to address inter-subject variability of estimated individual networks inherently related with existing methods such as Fisher Z test, and issues related to JGMSS ignoring between-group information in group comparisons. To evaluate the performance of GMGLASS in terms of a few key network metrics, as well as to compare with JGMSS and Fisher Z test, they are applied to both simulated and in vivo data. As a method aiming for group comparison studies, our study involves two groups for each case, i.e., normal control and patient groups; for in vivo data, we focus on a group of patients with right mesial temporal lobe epilepsy.

A Gossip-based Churn Estimator for Large Dynamic Networks

NARCIS (Netherlands)

Giuffrida, C.; Ortolani, S.

2010-01-01

Gossip-based aggregation is an emerging paradigm to perform distributed computations and measurements in a large-scale setting. In this paper we explore the possibility of using gossip-based aggregation to estimate churn in arbitrarily large networks. To this end, we introduce a new model to compute

Application of Artificial Neural Networks for estimating index floods

Science.gov (United States)

Šimor, Viliam; Hlavčová, Kamila; Kohnová, Silvia; Szolgay, Ján

2012-12-01

This article presents an application of Artificial Neural Networks (ANNs) and multiple regression models for estimating mean annual maximum discharge (index flood) at ungauged sites. Both approaches were tested for 145 small basins in Slovakia in areas ranging from 20 to 300 km2. Using the objective clustering method, the catchments were divided into ten homogeneous pooling groups; for each pooling group, mutually independent predictors (catchment characteristics) were selected for both models. The neural network was applied as a simple multilayer perceptron with one hidden layer and with a back propagation learning algorithm. Hyperbolic tangents were used as an activation function in the hidden layer. Estimating index floods by the multiple regression models were based on deriving relationships between the index floods and catchment predictors. The efficiencies of both approaches were tested by the Nash-Sutcliffe and a correlation coefficients. The results showed the comparative applicability of both models with slightly better results for the index floods achieved using the ANNs methodology.

Unavailability of critical SCADA communication links interconnecting a power grid and a Telco network

International Nuclear Information System (INIS)

Bobbio, A.; Bonanni, G.; Ciancamerla, E.; Clemente, R.; Iacomini, A.; Minichino, M.; Scarlatti, A.; Terruggia, R.; Zendri, E.

2010-01-01

The availability of power supply to power grid customers depends upon the availability of services of supervision, control and data acquisition (SCADA) system, which constitutes the nervous system of a power grid. In turn, SCADA services depend on the availability of the interconnected networks supporting such services. We propose a service oriented stochastic modelling methodology to investigate the availability of large interconnected networks, based on the hierarchical application of different modelling formalisms to different parts of the networks. Interconnected networks are decomposed according to the specific services delivered until the failure and repair mechanisms of the decomposed elementary blocks can be identified. We represent each network by a convenient stochastic modelling formalism, able to capture the main technological issues and to cope with realistic assumptions about failure and recovery mechanisms. This procedure confines the application of the more intensive computational techniques to those subsystems that actually require it. The paper concentrates on an actual failure scenario, occurred in Rome in January 2004 that involved the outage of critical SCADA communication links, interconnecting a power grid and a Telco network.

Unavailability of critical SCADA communication links interconnecting a power grid and a Telco network

Energy Technology Data Exchange (ETDEWEB)

Bobbio, A. [Dipartimento di Informatica, Universita del Piemonte Orientale, Viale Michel 11, 15121 Alessandria (Italy); Bonanni, G.; Ciancamerla, E. [ENEA - CRE Casaccia, Via Anguillarese 301, 00060 Roma (Italy); Clemente, R. [Telecom Italia Mobile, Via Isonzo112, 10141 Torino (Italy); Iacomini, A. [ACEA, Pl. Ostiense 2, 00154 Roma (Italy); Minichino, M., E-mail: minichino@casaccia.enea.i [ENEA - CRE Casaccia, Via Anguillarese 301, 00060 Roma (Italy); Scarlatti, A. [ACEA, Pl. Ostiense 2, 00154 Roma (Italy); Terruggia, R. [Dipartimento di Informatica, Universita del Piemonte Orientale, Viale Michel 11, 15121 Alessandria (Italy); Zendri, E. [ACEA, Pl. Ostiense 2, 00154 Roma (Italy)

2010-12-15

The availability of power supply to power grid customers depends upon the availability of services of supervision, control and data acquisition (SCADA) system, which constitutes the nervous system of a power grid. In turn, SCADA services depend on the availability of the interconnected networks supporting such services. We propose a service oriented stochastic modelling methodology to investigate the availability of large interconnected networks, based on the hierarchical application of different modelling formalisms to different parts of the networks. Interconnected networks are decomposed according to the specific services delivered until the failure and repair mechanisms of the decomposed elementary blocks can be identified. We represent each network by a convenient stochastic modelling formalism, able to capture the main technological issues and to cope with realistic assumptions about failure and recovery mechanisms. This procedure confines the application of the more intensive computational techniques to those subsystems that actually require it. The paper concentrates on an actual failure scenario, occurred in Rome in January 2004 that involved the outage of critical SCADA communication links, interconnecting a power grid and a Telco network.

Design and implementation of a fiber optic link for a token ring local area network

OpenAIRE

Doran, Thomas J.

1992-01-01

Approved for public release; distribution is unlimited This thesis described the design and implementation of a fiber optic link for a token ring local area network (LAN). It features the use of fiber optic channels as the transmission medium between a computer system and a wiring concentrator to convert a physical ring design into a star-wired configuration. The LAN was controlled by the TMS380 LAN Adapter chipset, which provided all diagnostic and network management features to include...

MSD-MAP: A Network-Based Systems Biology Platform for Predicting Disease-Metabolite Links.

Science.gov (United States)

Wathieu, Henri; Issa, Naiem T; Mohandoss, Manisha; Byers, Stephen W; Dakshanamurthy, Sivanesan

2017-01-01

Cancer-associated metabolites result from cell-wide mechanisms of dysregulation. The field of metabolomics has sought to identify these aberrant metabolites as disease biomarkers, clues to understanding disease mechanisms, or even as therapeutic agents. This study was undertaken to reliably predict metabolites associated with colorectal, esophageal, and prostate cancers. Metabolite and disease biological action networks were compared in a computational platform called MSD-MAP (Multi Scale Disease-Metabolite Association Platform). Using differential gene expression analysis with patient-based RNAseq data from The Cancer Genome Atlas, genes up- or down-regulated in cancer compared to normal tissue were identified. Relational databases were used to map biological entities including pathways, functions, and interacting proteins, to those differential disease genes. Similar relational maps were built for metabolites, stemming from known and in silico predicted metabolite-protein associations. The hypergeometric test was used to find statistically significant relationships between disease and metabolite biological signatures at each tier, and metabolites were assessed for multi-scale association with each cancer. Metabolite networks were also directly associated with various other diseases using a disease functional perturbation database. Our platform recapitulated metabolite-disease links that have been empirically verified in the scientific literature, with network-based mapping of jointly-associated biological activity also matching known disease mechanisms. This was true for colorectal, esophageal, and prostate cancers, using metabolite action networks stemming from both predicted and known functional protein associations. By employing systems biology concepts, MSD-MAP reliably predicted known cancermetabolite links, and may serve as a predictive tool to streamline conventional metabolomic profiling methodologies. Copyright© Bentham Science Publishers; For any

Voltage Estimation in Active Distribution Grids Using Neural Networks

DEFF Research Database (Denmark)

Pertl, Michael; Heussen, Kai; Gehrke, Oliver

2016-01-01

the observability of distribution systems has to be improved. To increase the situational awareness of the power system operator data driven methods can be employed. These methods benefit from newly available data sources such as smart meters. This paper presents a voltage estimation method based on neural networks...

Neural feedback linearization adaptive control for affine nonlinear systems based on neural network estimator

Directory of Open Access Journals (Sweden)

Bahita Mohamed

2011-01-01

Full Text Available In this work, we introduce an adaptive neural network controller for a class of nonlinear systems. The approach uses two Radial Basis Functions, RBF networks. The first RBF network is used to approximate the ideal control law which cannot be implemented since the dynamics of the system are unknown. The second RBF network is used for on-line estimating the control gain which is a nonlinear and unknown function of the states. The updating laws for the combined estimator and controller are derived through Lyapunov analysis. Asymptotic stability is established with the tracking errors converging to a neighborhood of the origin. Finally, the proposed method is applied to control and stabilize the inverted pendulum system.

A novel application of artificial neural network for wind speed estimation

Science.gov (United States)

Fang, Da; Wang, Jianzhou

2017-05-01

Providing accurate multi-steps wind speed estimation models has increasing significance, because of the important technical and economic impacts of wind speed on power grid security and environment benefits. In this study, the combined strategies for wind speed forecasting are proposed based on an intelligent data processing system using artificial neural network (ANN). Generalized regression neural network and Elman neural network are employed to form two hybrid models. The approach employs one of ANN to model the samples achieving data denoising and assimilation and apply the other to predict wind speed using the pre-processed samples. The proposed method is demonstrated in terms of the predicting improvements of the hybrid models compared with single ANN and the typical forecasting method. To give sufficient cases for the study, four observation sites with monthly average wind speed of four given years in Western China were used to test the models. Multiple evaluation methods demonstrated that the proposed method provides a promising alternative technique in monthly average wind speed estimation.

Estimation of Heavy Metals Contamination in the Soil of Zaafaraniya City Using the Neural Network

Science.gov (United States)

Ghazi, Farah F.

2018-05-01

The aim of this paper is to estimate the heavy metals Contamination in soils which can be used to determine the rate of environmental contamination by using new technique depend on design feedback neural network as an alternative accurate technique. The network simulates to estimate the concentration of Cadmium (Cd), Nickel (Ni), Lead (Pb), Zinc (Zn) and Copper (Cu). Then to show the accuracy and efficiency of suggested design we applied the technique in Al- Zafaraniyah in Baghdad city. The results of this paper show that the suggested networks can be successfully applied to the rapid and accuracy estimation of concentration of heavy metals.

Risk assessment of safety data link and network communication in digital safety feature control system of nuclear power plant

International Nuclear Information System (INIS)

Lee, Sang Hun; Son, Kwang Seop; Jung, Wondea; Kang, Hyun Gook

2017-01-01

Highlights: • Safety data communication risk assessment framework and quantitative scheme were proposed. • Fault-tree model of ESFAS unavailability due to safety data communication failure was developed. • Safety data link and network risk were assessed based on various ESF-CCS design specifications. • The effect of fault-tolerant algorithm reliability of safety data network on ESFAS unavailability was assessed. - Abstract: As one of the safety-critical systems in nuclear power plants (NPPs), the Engineered Safety Feature-Component Control System (ESF-CCS) employs safety data link and network communication for the transmission of safety component actuation signals from the group controllers to loop controllers to effectively accommodate various safety-critical field controllers. Since data communication failure risk in the ESF-CCS has yet to be fully quantified, the ESF-CCS employing data communication systems have not been applied in NPPs. This study therefore developed a fault tree model to assess the data link and data network failure-induced unavailability of a system function used to generate an automated control signal for accident mitigation equipment. The current aim is to provide risk information regarding data communication failure in a digital safety feature control system in consideration of interconnection between controllers and the fault-tolerant algorithm implemented in the target system. Based on the developed fault tree model, case studies were performed to quantitatively assess the unavailability of ESF-CCS signal generation due to data link and network failure and its risk effect on safety signal generation failure. This study is expected to provide insight into the risk assessment of safety-critical data communication in a digitalized NPP instrumentation and control system.

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

Science.gov (United States)