A packet-based dual-rate PID control strategy for a slow-rate sensing Networked Control System.

Science.gov (United States)

Cuenca, A; Alcaina, J; Salt, J; Casanova, V; Pizá, R

2018-05-01

This paper introduces a packet-based dual-rate control strategy to face time-varying network-induced delays, packet dropouts and packet disorder in a Networked Control System. Slow-rate sensing enables to achieve energy saving and to avoid packet disorder. Fast-rate actuation makes reaching the desired control performance possible. The dual-rate PID controller is split into two parts: a slow-rate PI controller located at the remote side (with no permanent communication to the plant) and a fast-rate PD controller located at the local side. The remote side also includes a prediction stage in order to generate the packet of future, estimated slow-rate control actions. These actions are sent to the local side and converted to fast-rate ones to be used when a packet does not arrive at this side due to the network-induced delay or due to occurring dropouts. The proposed control solution is able to approximately reach the nominal (no-delay, no-dropout) performance despite the existence of time-varying delays and packet dropouts. Control system stability is ensured in terms of probabilistic Linear Matrix Inequalities (LMIs). Via real-time control for a Cartesian robot, results clearly reveal the superiority of the control solution compared to a previous proposal by authors. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

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

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

DEFF Research Database (Denmark)

Ngo, Trung Dung

2012-01-01

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

Distributed Ship Navigation Control System Based on Dual Network

Science.gov (United States)

Yao, Ying; Lv, Wu

2017-10-01

Navigation system is very important for ship’s normal running. There are a lot of devices and sensors in the navigation system to guarantee ship’s regular work. In the past, these devices and sensors were usually connected via CAN bus for high performance and reliability. However, as the development of related devices and sensors, the navigation system also needs the ability of high information throughput and remote data sharing. To meet these new requirements, we propose the communication method based on dual network which contains CAN bus and industrial Ethernet. Also, we import multiple distributed control terminals with cooperative strategy based on the idea of synchronizing the status by multicasting UDP message contained operation timestamp to make the system more efficient and reliable.

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.

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

Science.gov (United States)

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

2017-07-25

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

A Velocity-Level Bi-Criteria Optimization Scheme for Coordinated Path Tracking of Dual Robot Manipulators Using Recurrent Neural Network.

Science.gov (United States)

Xiao, Lin; Zhang, Yongsheng; Liao, Bolin; Zhang, Zhijun; Ding, Lei; Jin, Long

2017-01-01

A dual-robot system is a robotic device composed of two robot arms. To eliminate the joint-angle drift and prevent the occurrence of high joint velocity, a velocity-level bi-criteria optimization scheme, which includes two criteria (i.e., the minimum velocity norm and the repetitive motion), is proposed and investigated for coordinated path tracking of dual robot manipulators. Specifically, to realize the coordinated path tracking of dual robot manipulators, two subschemes are first presented for the left and right robot manipulators. After that, such two subschemes are reformulated as two general quadratic programs (QPs), which can be formulated as one unified QP. A recurrent neural network (RNN) is thus presented to solve effectively the unified QP problem. At last, computer simulation results based on a dual three-link planar manipulator further validate the feasibility and the efficacy of the velocity-level optimization scheme for coordinated path tracking using the recurrent neural network.

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.

Identification of dual-tropic HIV-1 using evolved neural networks.

Science.gov (United States)

Fogel, Gary B; Lamers, Susanna L; Liu, Enoch S; Salemi, Marco; McGrath, Michael S

2015-11-01

Blocking the binding of the envelope HIV-1 protein to immune cells is a popular concept for development of anti-HIV therapeutics. R5 HIV-1 binds CCR5, X4 HIV-1 binds CXCR4, and dual-tropic HIV-1 can bind either coreceptor for cellular entry. R5 viruses are associated with early infection and over time can evolve to X4 viruses that are associated with immune failure. Dual-tropic HIV-1 is less studied; however, it represents functional antigenic intermediates during the transition of R5 to X4 viruses. Viral tropism is linked partly to the HIV-1 envelope V3 domain, where the amino acid sequence helps dictate the receptor a particular virus will target; however, using V3 sequence information to identify dual-tropic HIV-1 isolates has remained difficult. Our goal in this study was to elucidate features of dual-tropic HIV-1 isolates that assist in the biological understanding of dual-tropism and develop an approach for their detection. Over 1559 HIV-1 subtype B sequences with known tropisms were analyzed. Each sequence was represented by 73 structural, biochemical and regional features. These features were provided to an evolved neural network classifier and evaluated using balanced and unbalanced data sets. The study resolved R5X4 viruses from R5 with an accuracy of 81.8% and from X4 with an accuracy of 78.8%. The approach also identified a set of V3 features (hydrophobicity, structural and polarity) that are associated with tropism transitions. The ability to distinguish R5X4 isolates will improve computational tropism decisions for R5 vs. X4 and assist in HIV-1 research and drug development efforts. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

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

Dual-color plasmonic enzyme-linked immunosorbent assay based on enzyme-mediated etching of Au nanoparticles

Science.gov (United States)

Guo, Longhua; Xu, Shaohua; Ma, Xiaoming; Qiu, Bin; Lin, Zhenyu; Chen, Guonan

2016-09-01

Colorimetric enzyme-linked immunosorbent assay utilizing 3‧-3-5‧-5-tetramethylbenzidine(TMB) as the chromogenic substrate has been widely used in the hospital for the detection of all kinds of disease biomarkers. Herein, we demonstrate a strategy to change this single-color display into dual-color responses to improve the accuracy of visual inspection. Our investigation firstly reveals that oxidation state of 3‧-3-5‧-5-tetramethylbenzidine (TMB2+) can quantitatively etch gold nanoparticles. Therefore, the incorporation of gold nanoparticles into a commercial TMB-based ELISA kit could generate dual-color responses: the solution color varied gradually from wine red (absorption peak located at ~530 nm) to colorless, and then from colorless to yellow (absorption peak located at ~450 nm) with the increase amount of targets. These dual-color responses effectively improved the sensitivity as well as the accuracy of visual inspection. For example, the proposed dual-color plasmonic ELISA is demonstrated for the detection of prostate-specific antigen (PSA) in human serum with a visual limit of detection (LOD) as low as 0.0093 ng/mL.

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.

Social Network Analysis of the Caste-Based Reservation System in India

OpenAIRE

Iyengar, S. R. S.; Parasuram, Aishwarya; Saini, Jaspal Singh

2015-01-01

It has been argued that the reservation system in India, which has existed since the time of Indian Independence (1947), has caused more havoc and degradation than progress. This being a popular public opinion, these notions have not been based on any rigorous scientific study or research. In this paper, we revisit the cultural divide among the Indian population from a purely social networks based approach. We study the reservation system in detail, starting from its past and observing its ef...

Dual-Level Game-Based Energy Efficiency and Fairness for Green Cellular Networks

Directory of Open Access Journals (Sweden)

Sungwook Kim

2016-01-01

Full Text Available In the recent decades, cellular networks have revolutionized the way of next generation communication networks. However, due to the global climate change, reducing the energy consumption of cellular infrastructures is an important and urgent problem. In this study, we propose a novel two-level cooperative game framework for improving the energy efficiency and fairness in cellular networks. For the energy efficiency, base stations (BSs constantly monitor the current traffic load and cooperate with each other to maximize the energy saving. For the energy fairness, renewable energy can be shared dynamically while ensuring the fairness among BSs. To achieve an excellent cellular network performance, the concepts of the Raiffa Bargaining Solution and Jain’s fairness are extended and practically applied to our dual-level cooperative game model. Through system level simulations, the proposed scheme is evaluated and compared with other existing schemes. The simulation results show that our two-level game approach outperforms the existing schemes in providing a better fair-efficient system performance.

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

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.

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.

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

Dual connectivity for LTE-advanced heterogeneous networks

DEFF Research Database (Denmark)

Wang, Hua; Rosa, Claudio; Pedersen, Klaus I.

2016-01-01

Dual connectivity (DC) allows user equipments (UEs) to receive data simultaneously from different eNodeBs (eNBs) in order to boost the performance in a heterogeneous network with dedicated carrier deployment. Yet, how to efficiently operate with DC opens a number of research questions. In this pa......Dual connectivity (DC) allows user equipments (UEs) to receive data simultaneously from different eNodeBs (eNBs) in order to boost the performance in a heterogeneous network with dedicated carrier deployment. Yet, how to efficiently operate with DC opens a number of research questions...... aggregation (CA) and virtually zerolatency fronthaul connections, and in any case it is significantly higher compared to the case without DC. Keywords: Dual connectivity Heterogeneous network LTE-advanced Radio resource management Performance evaluation...

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

Predicting cryptic links in host-parasite networks.

Directory of Open Access Journals (Sweden)

Tad Dallas

2017-05-01

Full Text Available Networks are a way to represent interactions among one (e.g., social networks or more (e.g., plant-pollinator networks classes of nodes. The ability to predict likely, but unobserved, interactions has generated a great deal of interest, and is sometimes referred to as the link prediction problem. However, most studies of link prediction have focused on social networks, and have assumed a completely censused network. In biological networks, it is unlikely that all interactions are censused, and ignoring incomplete detection of interactions may lead to biased or incorrect conclusions. Previous attempts to predict network interactions have relied on known properties of network structure, making the approach sensitive to observation errors. This is an obvious shortcoming, as networks are dynamic, and sometimes not well sampled, leading to incomplete detection of links. Here, we develop an algorithm to predict missing links based on conditional probability estimation and associated, node-level features. We validate this algorithm on simulated data, and then apply it to a desert small mammal host-parasite network. Our approach achieves high accuracy on simulated and observed data, providing a simple method to accurately predict missing links in networks without relying on prior knowledge about network structure.

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

Structural reliability calculation method based on the dual neural network and direct integration method.

Science.gov (United States)

Li, Haibin; He, Yun; Nie, Xiaobo

2018-01-01

Structural reliability analysis under uncertainty is paid wide attention by engineers and scholars due to reflecting the structural characteristics and the bearing actual situation. The direct integration method, started from the definition of reliability theory, is easy to be understood, but there are still mathematics difficulties in the calculation of multiple integrals. Therefore, a dual neural network method is proposed for calculating multiple integrals in this paper. Dual neural network consists of two neural networks. The neural network A is used to learn the integrand function, and the neural network B is used to simulate the original function. According to the derivative relationships between the network output and the network input, the neural network B is derived from the neural network A. On this basis, the performance function of normalization is employed in the proposed method to overcome the difficulty of multiple integrations and to improve the accuracy for reliability calculations. The comparisons between the proposed method and Monte Carlo simulation method, Hasofer-Lind method, the mean value first-order second moment method have demonstrated that the proposed method is an efficient and accurate reliability method for structural reliability problems.

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.

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.

On the Dual-Decomposition-Based Resource and Power Allocation with Sleeping Strategy for Heterogeneous Networks

KAUST Repository

Alsharoa, Ahmad M.

2015-05-01

In this paper, the problem of radio and power resource management in long term evolution heterogeneous networks (LTE HetNets) is investigated. The goal is to minimize the total power consumption of the network while satisfying the user quality of service determined by each target data rate. We study the model where one macrocell base station is placed in the cell center, and multiple small cell base stations and femtocell access points are distributed around it. The dual decomposition technique is adopted to jointly optimize the power and carrier allocation in the downlink direction in addition to the selection of turned off small cell base stations. Our numerical results investigate the performance of the proposed scheme versus different system parameters and show an important saving in terms of total power consumption. © 2015 IEEE.

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.

In Situ Forming, Cytocompatible, and Self-Recoverable Tough Hydrogels Based on Dual Ionic and Click Cross-Linked Alginate.

Science.gov (United States)

Ghanian, Mohammad Hossein; Mirzadeh, Hamid; Baharvand, Hossein

2018-05-14

A dual cross-linking strategy was developed to answer the urgent need for fatigue-resistant, cytocompatible, and in situ forming tough hydrogels. Clickable, yet calcium-binding derivatives of alginate were synthesized by partial substitution of its carboxyl functionalities with furan, which could come into Diels-Alder click reaction with maleimide end groups of a four arm poly(ethylene glycol) cross-linker. Tuning the cooperative viscoelastic action of transient ionic and permanent click cross-links within the single network of alginate provided a soft tough hydrogel with a set of interesting features: (i) immediate self-recovery under cyclic loading, (ii) highly efficient and autonomous self-healing upon fracture, (iii) in situ forming ability for molding and minimally invasive injection, (iv) capability for viable cell encapsulation, and (v) reactivity for on-demand biomolecule conjugation. The facile strategy is applicable to a wide range of natural and synthetic polymers by introducing the calcium binding and click reacting functional groups and can broaden the use of tough hydrogels in load-bearing, cell-laden applications such as soft tissue engineering and bioactuators.

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.

Analyses of resource reservation schemes for optical burst switching networks

Science.gov (United States)

Solanska, Michaela; Scholtz, Lubomir; Ladanyi, Libor; Mullerova, Jarmila

2017-12-01

With growing demands of Internet Protocol services for transmission capacity and speed, the Optical Burst Switching presents the solution for future high-speed optical networks. Optical Burst Switching is a technology for transmitting large amounts of data bursts through a transparent optical switching network. To successfully transmit bursts over OBS network and reach the destination node, resource reservation schemes have to be implemented to allocate resources and configure optical switches for that burst at each node. The one-way resource reservation schemes and the performance evaluation of reservation schemes are presented. The OBS network model is performed using OMNeT++ simulation environment. During the reservation of network resources, the optical cross-connect based on semiconductor optical amplifier is used as the core node. Optical switches based on semiconductor optical amplifiers are a promising technology for high-speed optical communication networks.

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.

Advance reservation access control using software-defined networking and tokens

Energy Technology Data Exchange (ETDEWEB)

Chung, Joaquin; Jung, Eun-Sung; Kettimuthu, Rajkumar; Rao, Nageswara S. V.; Foster, Ian T.; Clark, Russ; Owen, Henry

2018-02-01

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present here a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization. We use SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. We conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network. (C) 2017 Elsevier B.V. All rights reserved.

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

Probabilistic Coexistence and Throughput of Cognitive Dual-Polarized Networks

Directory of Open Access Journals (Sweden)

J.-M. Dricot

2010-01-01

Full Text Available Diversity techniques for cognitive radio networks are important since they enable the primary and secondary terminals to efficiently share the spectral resources in the same location simultaneously. In this paper, we investigate a simple, yet powerful, diversity scheme by exploiting the polarimetric dimension. More precisely, we evaluate a scenario where the cognitive terminals use cross-polarized communications with respect to the primary users. Our approach is network-centric, that is, the performance of the proposed dual-polarized system is investigated in terms of link throughput in the primary and the secondary networks. In order to carry out this analysis, we impose a probabilistic coexistence constraint derived from an information-theoretic approach, that is, we enforce a guaranteed capacity for a primary terminal for a high fraction of time. Improvements brought about by the use of our scheme are demonstrated analytically and through simulations. In particular, the main simulation parameters are extracted from a measurement campaign dedicated to the characterization of indoor-to-indoor and outdoor-to-indoor polarization behaviors. Our results suggest that the polarimetric dimension represents a remarkable opportunity, yet easily implementable, in the context of cognitive radio networks.

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.

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.

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.

Simple measurement-based admission control for DiffServ access networks

Science.gov (United States)

Lakkakorpi, Jani

2002-07-01

In order to provide good Quality of Service (QoS) in a Differentiated Services (DiffServ) network, a dynamic admission control scheme is definitely needed as an alternative to overprovisioning. In this paper, we present a simple measurement-based admission control (MBAC) mechanism for DiffServ-based access networks. Instead of using active measurements only or doing purely static bookkeeping with parameter-based admission control (PBAC), the admission control decisions are based on bandwidth reservations and periodically measured & exponentially averaged link loads. If any link load on the path between two endpoints is over the applicable threshold, access is denied. Link loads are periodically sent to Bandwidth Broker (BB) of the routing domain, which makes the admission control decisions. The information needed in calculating the link loads is retrieved from the router statistics. The proposed admission control mechanism is verified through simulations. Our results prove that it is possible to achieve very high bottleneck link utilization levels and still maintain good QoS.

A Dual-Channel Acquisition Method Based on Extended Replica Folding Algorithm for Long Pseudo-Noise Code in Inter-Satellite Links.

Science.gov (United States)

Zhao, Hongbo; Chen, Yuying; Feng, Wenquan; Zhuang, Chen

2018-05-25

Inter-satellite links are an important component of the new generation of satellite navigation systems, characterized by low signal-to-noise ratio (SNR), complex electromagnetic interference and the short time slot of each satellite, which brings difficulties to the acquisition stage. The inter-satellite link in both Global Positioning System (GPS) and BeiDou Navigation Satellite System (BDS) adopt the long code spread spectrum system. However, long code acquisition is a difficult and time-consuming task due to the long code period. Traditional folding methods such as extended replica folding acquisition search technique (XFAST) and direct average are largely restricted because of code Doppler and additional SNR loss caused by replica folding. The dual folding method (DF-XFAST) and dual-channel method have been proposed to achieve long code acquisition in low SNR and high dynamic situations, respectively, but the former is easily affected by code Doppler and the latter is not fast enough. Considering the environment of inter-satellite links and the problems of existing algorithms, this paper proposes a new long code acquisition algorithm named dual-channel acquisition method based on the extended replica folding algorithm (DC-XFAST). This method employs dual channels for verification. Each channel contains an incoming signal block. Local code samples are folded and zero-padded to the length of the incoming signal block. After a circular FFT operation, the correlation results contain two peaks of the same magnitude and specified relative position. The detection process is eased through finding the two largest values. The verification takes all the full and partial peaks into account. Numerical results reveal that the DC-XFAST method can improve acquisition performance while acquisition speed is guaranteed. The method has a significantly higher acquisition probability than folding methods XFAST and DF-XFAST. Moreover, with the advantage of higher detection

A Dual-Channel Acquisition Method Based on Extended Replica Folding Algorithm for Long Pseudo-Noise Code in Inter-Satellite Links

Directory of Open Access Journals (Sweden)

Hongbo Zhao

2018-05-01

Full Text Available Inter-satellite links are an important component of the new generation of satellite navigation systems, characterized by low signal-to-noise ratio (SNR, complex electromagnetic interference and the short time slot of each satellite, which brings difficulties to the acquisition stage. The inter-satellite link in both Global Positioning System (GPS and BeiDou Navigation Satellite System (BDS adopt the long code spread spectrum system. However, long code acquisition is a difficult and time-consuming task due to the long code period. Traditional folding methods such as extended replica folding acquisition search technique (XFAST and direct average are largely restricted because of code Doppler and additional SNR loss caused by replica folding. The dual folding method (DF-XFAST and dual-channel method have been proposed to achieve long code acquisition in low SNR and high dynamic situations, respectively, but the former is easily affected by code Doppler and the latter is not fast enough. Considering the environment of inter-satellite links and the problems of existing algorithms, this paper proposes a new long code acquisition algorithm named dual-channel acquisition method based on the extended replica folding algorithm (DC-XFAST. This method employs dual channels for verification. Each channel contains an incoming signal block. Local code samples are folded and zero-padded to the length of the incoming signal block. After a circular FFT operation, the correlation results contain two peaks of the same magnitude and specified relative position. The detection process is eased through finding the two largest values. The verification takes all the full and partial peaks into account. Numerical results reveal that the DC-XFAST method can improve acquisition performance while acquisition speed is guaranteed. The method has a significantly higher acquisition probability than folding methods XFAST and DF-XFAST. Moreover, with the advantage of higher

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.

Link-state-estimation-based transmission power control in wireless body area networks.

Science.gov (United States)

Kim, Seungku; Eom, Doo-Seop

2014-07-01

This paper presents a novel transmission power control protocol to extend the lifetime of sensor nodes and to increase the link reliability in wireless body area networks (WBANs). We first experimentally investigate the properties of the link states using the received signal strength indicator (RSSI). We then propose a practical transmission power control protocol based on both short- and long-term link-state estimations. Both the short- and long-term link-state estimations enable the transceiver to adapt the transmission power level and target the RSSI threshold range, respectively, to simultaneously satisfy the requirements of energy efficiency and link reliability. Finally, the performance of the proposed protocol is experimentally evaluated in two experimental scenarios-body posture change and dynamic body motion-and compared with the typical WBAN transmission power control protocols, a real-time reactive scheme, and a dynamic postural position inference mechanism. From the experimental results, it is found that the proposed protocol increases the lifetime of the sensor nodes by a maximum of 9.86% and enhances the link reliability by reducing the packet loss by a maximum of 3.02%.

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.

Dual branch transmit switch-and-stay diversity for underlay cognitive networks

KAUST Repository

Sayed, Mostafa M.; Abdallah, Mohamed M.; Alouini, Mohamed-Slim; Qaraqe, Khalid A.

2011-01-01

In this paper, we study applying dual branch transmit switch-and-stay combining (SSC) technique for underlay cognitive radio (UCR) networks. In UCR, the secondary user is allowed to share the spectrum with the primary (licensed) user under the condition that interference at the primary receiver is below a predetermined threshold. Assuming binary phaseshift keying (BPSK) modulation and Rayleigh fading channels, we develop a closed form expression for the average bit error rate (BER) of the secondary link as a function of the switching threshold. We then find a closed form expression for the optimal switching threshold in the sense of minimizing the average BER. For the sake of comparison we derive an expression for the average BER of the dual branch transmit selection combining (SC) technique. We finally investigate the effect of correlation between secondary and interference channels on the average BER and the associated optimal switching threshold. © 2011 IEEE.

Dual branch transmit switch-and-stay diversity for underlay cognitive networks

KAUST Repository

Sayed, Mostafa M.

2011-05-01

In this paper, we study applying dual branch transmit switch-and-stay combining (SSC) technique for underlay cognitive radio (UCR) networks. In UCR, the secondary user is allowed to share the spectrum with the primary (licensed) user under the condition that interference at the primary receiver is below a predetermined threshold. Assuming binary phaseshift keying (BPSK) modulation and Rayleigh fading channels, we develop a closed form expression for the average bit error rate (BER) of the secondary link as a function of the switching threshold. We then find a closed form expression for the optimal switching threshold in the sense of minimizing the average BER. For the sake of comparison we derive an expression for the average BER of the dual branch transmit selection combining (SC) technique. We finally investigate the effect of correlation between secondary and interference channels on the average BER and the associated optimal switching threshold. © 2011 IEEE.

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.

Real-time dual-polarization transmission based on hybrid optical wireless communications

Science.gov (United States)

Sousa, Artur N.; Alimi, Isiaka A.; Ferreira, Ricardo M.; Shahpari, Ali; Lima, Mário; Monteiro, Paulo P.; Teixeira, António L.

2018-01-01

We present experimental work on a gigabit-capable and long-reach hybrid coherent UWDM-PON plus FSO system for supporting different applications over the same fiber infrastructure in the mobile backhaul (MBH) networks. Also, for the first time, we demonstrate a reconfigurable real-time DSP transmission/reception of DP-QPSK signals over standard single-mode fiber (SSMF) and FSO links. The receiver presented is based on a commercial field-programmable gate array (FPGA). The considered communication links are based on 20 UDWDM channels with 625 Mbaud and 2.5 GHz channel spacing. We are able to demonstrate the lowest sampling rate required for digital coherent PON by employing four 1.25 Gsa/s ADCs using an electrical front-end receiver that offers only 1 GHz analog bandwidth. We achieved this by implementing a phase and polarization diversity coherent receiver combined with the DP-QPSK modulation formats. The system performance is estimated in terms of receiver sensitivity. The results show the viability of coherent PON and flexible dual-polarization supported by software-defined transceivers for the MBH.

An Enhanced Reservation-Based MAC Protocol for IEEE 802.15.4 Networks

Science.gov (United States)

Afonso, José A.; Silva, Helder D.; Macedo, Pedro; Rocha, Luis A.

2011-01-01

The IEEE 802.15.4 Medium Access Control (MAC) protocol is an enabling standard for wireless sensor networks. In order to support applications requiring dedicated bandwidth or bounded delay, it provides a reservation-based scheme named Guaranteed Time Slot (GTS). However, the GTS scheme presents some drawbacks, such as inefficient bandwidth utilization and support to a maximum of only seven devices. This paper presents eLPRT (enhanced Low Power Real Time), a new reservation-based MAC protocol that introduces several performance enhancing features in comparison to the GTS scheme. This MAC protocol builds on top of LPRT (Low Power Real Time) and includes various mechanisms designed to increase data transmission reliability against channel errors, improve bandwidth utilization and increase the number of supported devices. A motion capture system based on inertial and magnetic sensors has been used to validate the protocol. The effectiveness of the performance enhancements introduced by each of the new features is demonstrated through the provision of both simulation and experimental results. PMID:22163826

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

Science.gov (United States)

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

2015-09-01

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

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.

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

A decision-directed network for dual-polarization crosstalk cancellation

Science.gov (United States)

Weber, W. J., III

1979-01-01

Frequency reuse in the specific form of dual-polarized microwave communication systems has grown in importance in recent years as a practical means of radio spectrum conservation. Ideally the capacity of a given frequency allocation can be doubled through dual-polarization. However, hardware imperfections and propagation effects, particularly rain depolarization, prevent the achievement of this doubling without severe system performance degradation. A decision-directed cross-polarization correction network is presented whose operation depends on only simple base-band signal processing. No pilot tones or frequency offsets are required. The loop can work with any two-dimensional signal set for digital data transmission. The loop has been experimentally verified and provides a means of doubling the data capacity with little performance degradation.

Location based Network Optimizations for Mobile Wireless Networks

DEFF Research Database (Denmark)

Nielsen, Jimmy Jessen

selection in Wi-Fi networks and predictive handover optimization in heterogeneous wireless networks. The investigations in this work have indicated that location based network optimizations are beneficial compared to typical link measurement based approaches. Especially the knowledge of geographical...

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.

A dual exterior point simplex type algorithm for the minimum cost network flow problem

Directory of Open Access Journals (Sweden)

Geranis George

2009-01-01

Full Text Available A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category. Similarly to the classical network dual simplex algorithm (NDSA, this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution outside the dual feasible area (exterior point - dual infeasible tree.

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.

A comprehensive comparison of network similarities for link prediction and spurious link elimination

Science.gov (United States)

Zhang, Peng; Qiu, Dan; Zeng, An; Xiao, Jinghua

2018-06-01

Identifying missing interactions in complex networks, known as link prediction, is realized by estimating the likelihood of the existence of a link between two nodes according to the observed links and nodes' attributes. Similar approaches have also been employed to identify and remove spurious links in networks which is crucial for improving the reliability of network data. In network science, the likelihood for two nodes having a connection strongly depends on their structural similarity. The key to address these two problems thus becomes how to objectively measure the similarity between nodes in networks. In the literature, numerous network similarity metrics have been proposed and their accuracy has been discussed independently in previous works. In this paper, we systematically compare the accuracy of 18 similarity metrics in both link prediction and spurious link elimination when the observed networks are very sparse or consist of inaccurate linking information. Interestingly, some methods have high prediction accuracy, they tend to perform low accuracy in identification spurious interaction. We further find that methods can be classified into several cluster according to their behaviors. This work is useful for guiding future use of these similarity metrics for different purposes.

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

Vascular flow reserve as a link between long-term blood pressure level and physical performance capacity in mammals

DEFF Research Database (Denmark)

Poulsen, Christian B; Damkjær, Mads; Hald, Bjørn O

2016-01-01

Mean arterial pressure (MAP) is surprisingly similar across different species of mammals, and it is, in general, not known which factors determine the arterial pressure level. Mammals often have a pronounced capacity for sustained physical performance. This capacity depends on the vasculature...... having a flow reserve that comes into play as tissue metabolism increases. We hypothesize that microvascular properties allowing for a large vascular flow reserve is linked to the level of the arterial pressure.To study the interaction between network properties and network inlet pressure, we developed...

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

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.

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

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

Dual-mode ultraflow access networks: a hybrid solution for the access bottleneck

Science.gov (United States)

Kazovsky, Leonid G.; Shen, Thomas Shunrong; Dhaini, Ahmad R.; Yin, Shuang; De Leenheer, Marc; Detwiler, Benjamin A.

2013-12-01

Optical Flow Switching (OFS) is a promising solution for large Internet data transfers. In this paper, we introduce UltraFlow Access, a novel optical access network architecture that offers dual-mode service to its end-users: IP and OFS. With UltraFlow Access, we design and implement a new dual-mode control plane and a new dual-mode network stack to ensure efficient connection setup and reliable and optimal data transmission. We study the impact of the UltraFlow system's design on the network throughput. Our experimental results show that with an optimized system design, near optimal (around 10 Gb/s) OFS data throughput can be attained when the line rate is 10Gb/s.

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

KAUST Repository

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

Locating inefficient links in a large-scale transportation network

Science.gov (United States)

Sun, Li; Liu, Like; Xu, Zhongzhi; Jie, Yang; Wei, Dong; Wang, Pu

2015-02-01

Based on data from geographical information system (GIS) and daily commuting origin destination (OD) matrices, we estimated the distribution of traffic flow in the San Francisco road network and studied Braess's paradox in a large-scale transportation network with realistic travel demand. We measured the variation of total travel time Δ T when a road segment is closed, and found that | Δ T | follows a power-law distribution if Δ T 0. This implies that most roads have a negligible effect on the efficiency of the road network, while the failure of a few crucial links would result in severe travel delays, and closure of a few inefficient links would counter-intuitively reduce travel costs considerably. Generating three theoretical networks, we discovered that the heterogeneously distributed travel demand may be the origin of the observed power-law distributions of | Δ T | . Finally, a genetic algorithm was used to pinpoint inefficient link clusters in the road network. We found that closing specific road clusters would further improve the transportation efficiency.

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

Multifunctional fiber-optic microwave links based on remote heterodyne detection

DEFF Research Database (Denmark)

Gliese, Ulrik Bo; Nielsen, Torben Nørskov; Nielsen, Søren Nørskov

1998-01-01

The multifunctionality of microwave links based on remote heterodyne detection (RHD) of signals from a dual-frequency laser transmitter is discussed and experimentally demonstrated in this paper. Typically, direct detection (DD) in conjunction with optical intensity modulation is used to implement...... fiber-optic microwave links. The resulting links are inherently transparent. As opposed to DD links, RHD links can perform radio-system functionalities such as modulation and frequency conversion in addition to transparency. All of these three functionalities are presented and experimentally...

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

A Network Flow-based Analysis of Cognitive Reserve in Normal Ageing and Alzheimer's Disease.

Science.gov (United States)

Wook Yoo, Sang; Han, Cheol E; Shin, Joseph S; Won Seo, Sang; Na, Duk L; Kaiser, Marcus; Jeong, Yong; Seong, Joon-Kyung

2015-05-20

Cognitive reserve is the ability to sustain cognitive function even with a certain amount of brain damages. Here we investigate the neural compensation mechanism of cognitive reserve from the perspective of structural brain connectivity. Our goal was to show that normal people with high education levels (i.e., cognitive reserve) maintain abundant pathways connecting any two brain regions, providing better compensation or resilience after brain damage. Accordingly, patients with high education levels show more deterioration in structural brain connectivity than those with low education levels before symptoms of Alzheimer's disease (AD) become apparent. To test this hypothesis, we use network flow measuring the number of alternative paths between two brain regions in the brain network. The experimental results show that for normal aging, education strengthens network reliability, as measured through flow values, in a subnetwork centered at the supramarginal gyrus. For AD, a subnetwork centered at the left middle frontal gyrus shows a negative correlation between flow and education, which implies more collapse in structural brain connectivity for highly educated patients. We conclude that cognitive reserve may come from the ability of network reorganization to secure the information flow within the brain network, therefore making it more resistant to disease progress.

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.

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.

Accuracy of Dual-Energy Virtual Monochromatic CT Numbers: Comparison between the Single-Source Projection-Based and Dual-Source Image-Based Methods.

Science.gov (United States)

Ueguchi, Takashi; Ogihara, Ryota; Yamada, Sachiko

2018-03-21

To investigate the accuracy of dual-energy virtual monochromatic computed tomography (CT) numbers obtained by two typical hardware and software implementations: the single-source projection-based method and the dual-source image-based method. A phantom with different tissue equivalent inserts was scanned with both single-source and dual-source scanners. A fast kVp-switching feature was used on the single-source scanner, whereas a tin filter was used on the dual-source scanner. Virtual monochromatic CT images of the phantom at energy levels of 60, 100, and 140 keV were obtained by both projection-based (on the single-source scanner) and image-based (on the dual-source scanner) methods. The accuracy of virtual monochromatic CT numbers for all inserts was assessed by comparing measured values to their corresponding true values. Linear regression analysis was performed to evaluate the dependency of measured CT numbers on tissue attenuation, method, and their interaction. Root mean square values of systematic error over all inserts at 60, 100, and 140 keV were approximately 53, 21, and 29 Hounsfield unit (HU) with the single-source projection-based method, and 46, 7, and 6 HU with the dual-source image-based method, respectively. Linear regression analysis revealed that the interaction between the attenuation and the method had a statistically significant effect on the measured CT numbers at 100 and 140 keV. There were attenuation-, method-, and energy level-dependent systematic errors in the measured virtual monochromatic CT numbers. CT number reproducibility was comparable between the two scanners, and CT numbers had better accuracy with the dual-source image-based method at 100 and 140 keV. Copyright © 2018 The Association of University Radiologists. Published by Elsevier Inc. All rights reserved.

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

To trade or not to trade: Link prediction in the virtual water network

Science.gov (United States)

Tuninetti, Marta; Tamea, Stefania; Laio, Francesco; Ridolfi, Luca

2017-12-01

In the international trade network, links express the (temporary) presence of a commercial exchange of goods between any two countries. Given the dynamical behaviour of the trade network, where links are created and dismissed every year, predicting the link activation/deactivation is an open research question. Through the international trade network of agricultural goods, water resources are 'virtually' transferred from the country of production to the country of consumption. We propose a novel methodology for link prediction applied to the network of virtual water trade. Starting from the assumption of having links between any two countries, we estimate the associated virtual water flows by means of a gravity-law model using country and link characteristics as drivers. We consider the links with estimated flows higher than 1000 m3/year as active links, while the others as non-active links. Flows traded along estimated active links are then re-estimated using a similar but differently-calibrated gravity-law model. We were able to correctly model 84% of the existing links and 93% of the non-existing links in year 2011. It is worth to note that the predicted active links carry 99% of the global virtual water flow; hence, missed links are mainly those where a minimum volume of virtual water is exchanged. Results indicate that, over the period from 1986 to 2011, population, geographical distances between countries, and agricultural efficiency (through fertilizers use) are the major factors driving the link activation and deactivation. As opposed to other (network-based) models for link prediction, the proposed method is able to reconstruct the network architecture without any prior knowledge of the network topology, using only the nodes and links attributes; it thus represents a general method that can be applied to other networks such as food or value trade networks.

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

Joint Resource Allocation for Dual - Band Heterogeneous Wireless Network

DEFF Research Database (Denmark)

Adeogun, Ramoni

2018-01-01

In this paper, we investigate downlink resource allocation in two-tier OFDMA heterogeneous networks comprising a macrocell transmitting at a microwave frequency and dual band small cells utilizing both microwave and millimeter wave frequencies. A non - cooperative game theoretic approach...... is proposed for adaptively switching the SC transmission frequency based on the location of small cell users and interference to macrocell users. We propose a resource allocation approach which maximizes the sum rate of small cell users while minimizing interference to macrocell users and the total power...

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

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.

[Construction and optimization of ecological network for nature reserves in Fujian Province, China].

Science.gov (United States)

Gu, Fan; Huang, Yi Xiong; Chen, Chuan Ming; Cheng, Dong Liang; Guo, Jia Lei

2017-03-18

The nature reserve is very important to biodiversity maintenance. However, due to the urbanization, the nature reserve has been fragmented with reduction in area, leading to the loss of species diversity. Establishing ecological network can effectively connect the fragmented habitats and plays an important role in species conversation. In this paper, based on deciding habitat patches and the landscape cost surface in ArcGIS, a minimum cumulative resistance model was used to simulate the potential ecological network of Fujian provincial nature reserves. The connectivity and importance of network were analyzed and evaluated based on comparison of connectivity indices (including the integral index of connectivity and probability of connectivity) and gravity model both before and after the potential ecological network construction. The optimum ecological network optimization measures were proposed. The result demonstrated that woodlands, grasslands and wetlands together made up the important part of the nature reserve ecological network. The habitats with large area had a higher degree of importance in the network. After constructing the network, the connectivity level was significantly improved. Although interaction strength between different patches va-ried greatly, the corridors between patches with large interaction were very important. The research could provide scientific reference and basis for nature protection and planning in Fujian Province.

Application of ecological criteria in selecting marine reserves and developing reserve networks

Science.gov (United States)

Roberts, Callum M.; Branch, George; Bustamante, Rodrigo H.; Castilla, Juan Carlos; Dugan, Jenifer; Halpern, Benjamin S.; Lafferty, Kevin D.; Leslie, Heather; McArdle, Deborah; Ruckelshaus, Mary; Warner, Robert R.

2003-01-01

Marine reserves are being established worldwide in response to a growing recognition of the conservation crisis that is building in the oceans. However, designation of reserves has been largely opportunistic, or protective measures have been implemented (often overlapping and sometimes in conflict) by different entities seeking to achieve different ends. This has created confusion among both users and enforcers, and the proliferation of different measures provides a false sense of protection where little is offered. This paper sets out a procedure grounded in current understanding of ecological processes, that allows the evaluation and selection of reserve sites in order to develop functional, interconnected networks of fully protected reserves that will fulfill multiple objectives. By fully protected we mean permanently closed to fishing and other resource extraction. We provide a framework that unifies the central aims of conservation and fishery management, while also meeting other human needs such as the provision of ecosystem services (e.g., maintenance of coastal water quality, shoreline protection, and recreational opportunities). In our scheme, candidate sites for reserves are evaluated against 12 criteria focused toward sustaining the biological integrity and productivity of marine systems at both local and regional scales. While a limited number of sites will be indispensable in a network, many will be of similar value as reserves, allowing the design of numerous alternative, biologically adequate networks. Devising multiple network designs will help ensure that ecological functionality is preserved throughout the socioeconomic evaluation process. Too often, socioeconomic criteria have dominated the process of reserve selection, potentially undermining their efficacy. We argue that application of biological criteria must precede and inform socioeconomic evaluation, since maintenance of ecosystem functioning is essential for meeting all of the goals for

Advance Network Reservation and Provisioning for Science

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Chaniotakis, Evangelos; Shoshani, Arie; Sim, Alex

2009-07-10

We are witnessing a new era that offers new opportunities to conduct scientific research with the help of recent advancements in computational and storage technologies. Computational intensive science spans multiple scientific domains, such as particle physics, climate modeling, and bio-informatics simulations. These large-scale applications necessitate collaborators to access very large data sets resulting from simulations performed in geographically distributed institutions. Furthermore, often scientific experimental facilities generate massive data sets that need to be transferred to validate the simulation data in remote collaborating sites. A major component needed to support these needs is the communication infrastructure which enables high performance visualization, large volume data analysis, and also provides access to computational resources. In order to provide high-speed on-demand data access between collaborating institutions, national governments support next generation research networks such as Internet 2 and ESnet (Energy Sciences Network). Delivering network-as-a-service that provides predictable performance, efficient resource utilization and better coordination between compute and storage resources is highly desirable. In this paper, we study network provisioning and advanced bandwidth reservation in ESnet for on-demand high performance data transfers. We present a novel approach for path finding in time-dependent transport networks with bandwidth guarantees. We plan to improve the current ESnet advance network reservation system, OSCARS [3], by presenting to the clients, the possible reservation options and alternatives for earliest completion time and shortest transfer duration. The Energy Sciences Network (ESnet) provides high bandwidth connections between research laboratories and academic institutions for data sharing and video/voice communication. The ESnet On-Demand Secure Circuits and Advance Reservation System (OSCARS) establishes

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.

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.

Capacitance estimation algorithm based on DC-link voltage harmonics using artificial neural network in three-phase motor drive systems

DEFF Research Database (Denmark)

Soliman, Hammam Abdelaal Hammam; Davari, Pooya; Wang, Huai

2017-01-01

to industry. In this digest, a condition monitoring methodology that estimates the capacitance value of the dc-link capacitor in a three phase Front-End diode bridge motor drive is proposed. The proposed software methodology is based on Artificial Neural Network (ANN) algorithm. The harmonics of the dc......-link voltage are used as training data to the Artificial Neural Network. Fast Fourier Transform (FFT) of the dc-link voltage is analysed in order to study the impact of capacitance variation on the harmonics order. Laboratory experiments are conducted to validate the proposed methodology and the error analysis......In modern design of power electronic converters, reliability of dc-link capacitors is one of the critical considered aspects. The industrial field have been attracted to the monitoring of their health condition and the estimation of their ageing process status. However, the existing condition...

Optimal Control of Complex Systems Based on Improved Dual Heuristic Dynamic Programming Algorithm

Directory of Open Access Journals (Sweden)

Hui Li

2017-01-01

Full Text Available When applied to solving the data modeling and optimal control problems of complex systems, the dual heuristic dynamic programming (DHP technique, which is based on the BP neural network algorithm (BP-DHP, has difficulty in prediction accuracy, slow convergence speed, poor stability, and so forth. In this paper, a dual DHP technique based on Extreme Learning Machine (ELM algorithm (ELM-DHP was proposed. Through constructing three kinds of network structures, the paper gives the detailed realization process of the DHP technique in the ELM. The controller designed upon the ELM-DHP algorithm controlled a molecular distillation system with complex features, such as multivariability, strong coupling, and nonlinearity. Finally, the effectiveness of the algorithm is verified by the simulation that compares DHP and HDP algorithms based on ELM and BP neural network. The algorithm can also be applied to solve the data modeling and optimal control problems of similar complex systems.

On the Performance of Millimeter Wave-based RF-FSO Multi-hop and Mesh Networks

KAUST Repository

Makki, Behrooz

2017-09-22

This paper studies the performance of multi-hop and mesh networks composed of millimeter wave-based radio frequency (RF) and free-space optical (FSO) links. The results are obtained in cases with and without hybrid automatic repeat request (HARQ). Using the central limit theorem as well as other state-of-the-art approximation schemes, we derive closed-form expressions for the networks’ outage probability and ergodic achievable rates. We also evaluate the effect of various parameters such as power amplifiers efficiency, number of antennas as well as different coherence times of the RF and the FSO links on the system performance. Finally, we determine the minimum number of the transmit antennas in the RF link such that the same rate is supported in the RF- and the FSO-based hops. The results show the efficiency of the RF-FSO setups in different conditions. Moreover, HARQ can effectively improve the outage probability/energy efficiency, and compensate for the effect of hardware impairments in RF-FSO networks. For common parameter settings of the RF-FSO dual-hop networks, outage probability of 10−4 and code rate of 3 nats-per-channel-use, the implementation of HARQ with a maximum of 2 and 3 retransmissions reduces the required power, compared to cases with open-loop communication, by 13 and 17 dB, respectively.

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.

GPS data processing of networks with mixed single- and dual-frequency receivers for deformation monitoring

Science.gov (United States)

Zou, X.; Deng, Z.; Ge, M.; Dick, G.; Jiang, W.; Liu, J.

2010-07-01

In order to obtain crustal deformations of higher spatial resolution, existing GPS networks must be densified. This densification can be carried out using single-frequency receivers at moderate costs. However, ionospheric delay handling is required in the data processing. We adapt the Satellite-specific Epoch-differenced Ionospheric Delay model (SEID) for GPS networks with mixed single- and dual-frequency receivers. The SEID model is modified to utilize the observations from the three nearest dual-frequency reference stations in order to avoid contaminations from more remote stations. As data of only three stations are used, an efficient missing data constructing approach with polynomial fitting is implemented to minimize data losses. Data from large scale reference networks extended with single-frequency receivers can now be processed, based on the adapted SEID model. A new data processing scheme is developed in order to make use of existing GPS data processing software packages without any modifications. This processing scheme is evaluated using a sub-network of the German SAPOS network. The results verify that the new scheme provides an efficient way to densify existing GPS networks with single-frequency receivers.

Artificial Neural Network based DC-link Capacitance Estimation in a Diode-bridge Front-end Inverter System

DEFF Research Database (Denmark)

Soliman, Hammam Abdelaal Hammam; Abdelsalam, Ibrahim; Wang, Huai

2017-01-01

, a proposed software condition monitoring methodology based on Artificial Neural Network (ANN) algorithm is presented. Matlab software is used to train and generate the proposed ANN. The proposed methodology estimates the capacitance of the DC-link capacitor in a three phase front-end diode bridge AC......In modern design of power electronic converters, reliability of DC-link capacitors is an essential aspect to be considered. The industrial field have been attracted to the monitoring of their health condition and the estimation of their ageing process status. The existing condition monitoring...

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.

High performances of dual network PVA hydrogel modified by PVP using borax as the structure-forming accelerator.

Science.gov (United States)

Huang, Min; Hou, Yi; Li, Yubao; Wang, Danqing; Zhang, Li

2017-01-01

A dual network hydrogel made up of polyvinylalcohol (PVA) crosslinked by borax and polyvinylpyrrolidone (PVP) was prepared by means of freezing-thawing circles. Here PVP was incorporated by linking with PVA to form a network structure, while the introduction of borax played the role of crosslinking PVA chains to accelerate the formation of a dual network structure in PVA/PVP composite hydrogel, thus endowing the hydrogel with high mechanical properties. The effects of both PVP and borax on the hydrogels were evaluated by comparing the two systems of PVA/PVP/borax and PVA/borax hydrogels. In the former system, adding 4.0% PVP not only increased the water content and the storage modulus but also enhanced the mechanical strength of the final hydrogel. But an overdose of PVP just as more than 4.0% tended to undermine the structure of hydrogels, and thus deteriorated hydrogels' properties because of the weakened secondary interaction between PVP and PVA. Likewise, increasing borax could promote the gel crosslinking degree, thus making gels show a decrease in water content and swelling ratio, meanwhile shrinking the pores inside the hydrogels and finally enhancing the mechanical strength of hydrogels prominently. The developed hydrogel with high performances holds great potential for applications in biomedical and industrial fields.

VCSEL-based gigabit IR-UWB link for converged communication and sensing applications in optical metro-access networks

DEFF Research Database (Denmark)

Pham, Tien Thang; Gibbon, Timothy Braidwood; Tafur Monroy, Idelfonso

2012-01-01

We report on experimental demonstration of an impulse radio ultrawideband (IR-UWB) based converged communication and sensing system. A 1550-nm VCSEL-generated IR-UWB signal is used for 2-Gbps wireless data distribution over 800-m and 50-km single mode fiber links which present short-range in-buil...... application, paving the way forward for the development and deployment of converged UWB VCSEL-based technologies in access and in-building networks of the future.......We report on experimental demonstration of an impulse radio ultrawideband (IR-UWB) based converged communication and sensing system. A 1550-nm VCSEL-generated IR-UWB signal is used for 2-Gbps wireless data distribution over 800-m and 50-km single mode fiber links which present short-range in......-building and long-reach access network applications. The IR-UWB signal is also used to simultaneously measure the rotational speed of a blade spinning between 18 and 30 Hz. To the best of our knowledge, this is the very first demonstration of a simultaneous gigabit UWB telecommunication and wireless UWB sensing...

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

Dual-earner couples' weekend recovery support, state of recovery, and work engagement: Work-linked relationship as a moderator.

Science.gov (United States)

Park, YoungAh; Haun, Verena C

2017-10-01

Despite growing recovery research, little is known about couple-dyadic processes of recovery from work. Given that dual-earner couples experience most of their recovery opportunities during nonwork times when they are together, partners in a couple relationship may substantially affect recovery and work engagement. In this study, we propose a couple-dyadic model in which weekend partner recovery support (reported by the recipient partner) is positively related to the recipient partner's state of recovery after the weekend which, in turn, increases the recipient's work engagement the following week (actor-actor mediation effect). We also test the effect of one's state of recovery on the partner's subsequent work engagement (partner effect). Additionally, work-linked relationship status is tested as a moderator of the partner effect. Actor-partner interdependence mediation modeling is used to analyze the data from 167 dual-earner couples who answered surveys on 4 measurement occasions. The results support the indirect effect of partner recovery support on work engagement through the postweekend state of recovery. Multigroup analysis results reveal that the partner effect of state of recovery on work engagement is significant for work-linked couples only and is absent for non-work-linked couples. Theoretical and practical implications, limitations, and future research directions are discussed. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Epidemic spreading on dual-structure networks with mobile agents

Science.gov (United States)

Yao, Yiyang; Zhou, Yinzuo

2017-02-01

The rapid development of modern society continually transforms the social structure which leads to an increasingly distinct dual structure of higher population density in urban areas and lower density in rural areas. Such structure may induce distinctive spreading behavior of epidemics which does not happen in a single type structure. In this paper, we study the epidemic spreading of mobile agents on dual structure networks based on SIRS model. First, beyond the well known epidemic threshold for generic epidemic model that when the infection rate is below the threshold a pertinent infectious disease will die out, we find the other epidemic threshold which appears when the infection rate of a disease is relatively high. This feature of two thresholds for the SIRS model may lead to the elimination of infectious disease when social network has either high population density or low population density. Interestingly, however, we find that when a high density area is connected to a low density may cause persistent spreading of the infectious disease, even though the same disease will die out when it spreads in each single area. This phenomenon indicates the critical role of the connection between the two areas which could radically change the behavior of spreading dynamics. Our findings, therefore, provide new understanding of epidemiology pertinent to the characteristic modern social structure and have potential to develop controlling strategies accordingly.

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.

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.

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

Flux networks in metabolic graphs

International Nuclear Information System (INIS)

Warren, P B; Queiros, S M Duarte; Jones, J L

2009-01-01

A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms

A Flexible Reservation Algorithm for Advance Network Provisioning

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Chaniotakis, Evangelos; Shoshani, Arie; Sim, Alex

2010-04-12

Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.

Automated allocation and configuration of dual stack IP networks

OpenAIRE

Daniels, Wilfried; Vanbrabant, Bart; Hughes, Danny; Joosen, Wouter

2013-01-01

The manual configuration and management of a modern network infrastructure is an increasingly complex task. This complexity is caused by factors including heterogeneity, a high degree of change and dependencies between configuration parameters. Due to increasing complexity, manual configuration has become time consuming and error prone. This paper proposes an automatic configuration tool for dual stack IP networks that addresses these issues by using high level abstractions to model the netwo...

Building ties: social capital network analysis of a forest community in a biosphere reserve in Chiapas, Mexico

Directory of Open Access Journals (Sweden)

Luis Rico García-Amado

2012-09-01

Full Text Available Governance of the commons depends on the capacity to generate collective action. Networks and rules that foster that collective action have been defined as social capital. However, their causal link is still not fully understood. We use social network analysis to assess social capital, decision-making, and collective action in a forest-based common pool resource management in La Sepultura Biosphere Reserve (Chiapas, Mexico. Our research analyzes the productive networks and the evolution of coffee groups in one community. The network shows some centrality, with richer landholders tending to occupy core positions and poorer landless peasants occupying peripheral ones. This has fostered the community's environmentally oriented development but has also caused internal conflicts. Market requirements have shaped different but complementary productive networks, where organic coffee commercialization is the main source of bridging ties, which has resulted in more connectivity and resilience. Conservation attitudes, along with the institutional setting of the community, have promoted collective action. The unresolved conflicts, however, still leave some concerns about governance in the future.

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.

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.

Dual-modality and dual-energy gamma ray densitometry of petroleum products using an artificial neural network

International Nuclear Information System (INIS)

Roshani, G.H.; Feghhi, S.A.H.; Setayeshi, S.

2015-01-01

The prediction of volume fractions in order to measure the multiphase flow rate is a very important issue and is the key parameter of multi-phase flow meters (MPFMs). Currently, the gamma ray attenuation technique is known as one of the most precise methods for obtaining volume fractions. The gamma ray attenuation technique is based on the mass attenuation coefficient, which is sensitive to density changes; density is sensitive in turn to temperature and pressure fluctuations. Therefore, MPFM efficiency depends strongly on environmental conditions. The conventional solution to this problem is the periodical recalibration of MPFMs, which is a demanding task. In this study, a method based on dual-modality densitometry and artificial intelligence (AI) is presented, which offers the advantage of the measurement of the oil–gas–water volume fractions independent of density changes. For this purpose, several experiments were carried out and used to validate simulated dual modality densitometry results. The reference density point was established at a temperature of 20 °C and pressure of 1 bar. To cover the full range of likely density fluctuations, four additional density sets were defined (at changes of ±4% and ±8% from the reference point). An annular regime with different percentages of oil, gas and water at different densities was simulated. Four features were extracted from the transmission and scattered detectors and were applied to the artificial neural network (ANN) as inputs. The input parameters included the "2"4"1Am full energy peak, "1"3"7Cs Compton edge, "1"3"7Cs full energy peak and total scattered count, and the outputs were the oil and air percentages. A multi-layer perceptron (MLP) neural network was used to predict the volume fraction independent of the oil and water density changes. The obtained results show that the proposed ANN model achieved good agreement with the real data, with an estimated root mean square error (RMSE) of less than 3

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.

A dual-band planar array of connected dipoles: Experimental validation based on bistatic RCS measurements

NARCIS (Netherlands)

Cavallo, D.; Neto, A.; Gerini, G.; Morello, D.

2010-01-01

Rigorous equivalent networks representing connected arrays in transmission and reception are derived in this paper. These equivalent networks are not based on reciprocity but on Green's functions. Thus, all components have well identified and physically meaningful roles. A dual-band connected array

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

DEFF Research Database (Denmark)

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

2015-01-01

challenges. A capacitance estimation method based on Artificial Neural Network (ANN) algorithm is therefore proposed in this paper. The implemented ANN estimated the capacitance of the DC-link capacitor in a back-toback converter. Analysis of the error of the capacitance estimation is also given......In power electronic converters, reliability of DC-link capacitors is one of the critical issues. The estimation of their health status as an application of condition monitoring have been an attractive subject for industrial field and hence for the academic research filed as well. More reliable...... solutions are required to be adopted by the industry applications in which usage of extra hardware, increased cost, and low estimation accuracy are the main challenges. Therefore, development of new condition monitoring methods based on software solutions could be the new era that covers the aforementioned...

A Comparative Study of the Characteristics of Cross-Linked, Oxidized and Dual-Modified Rice Starches

OpenAIRE

Xiao, Hua-Xi; Lin, Qin-Lu; Liu, Gao-Qiang; Yu, Feng-Xiang

2012-01-01

Rice starch was cross-linked with epichlorohydrin (0.3%, w/w, on a dry starch basis) and oxidized with sodium hypochlorite (2.5% w/w), respectively. Two dual-modified rice starch samples (oxidized cross-linked rice starch and cross-linked oxidized rice starch) were obtained by the oxidation of cross-linked rice starch and the cross-linking of oxidized rice starch at the same level of reagents. The physicochemical properties of native rice starch, cross-linked rice starch and oxidized rice sta...

Cat Swarm Optimization Based Functional Link Artificial Neural Network Filter for Gaussian Noise Removal from Computed Tomography Images

Directory of Open Access Journals (Sweden)

M. Kumar

2016-01-01

Full Text Available Gaussian noise is one of the dominant noises, which degrades the quality of acquired Computed Tomography (CT image data. It creates difficulties in pathological identification or diagnosis of any disease. Gaussian noise elimination is desirable to improve the clarity of a CT image for clinical, diagnostic, and postprocessing applications. This paper proposes an evolutionary nonlinear adaptive filter approach, using Cat Swarm Functional Link Artificial Neural Network (CS-FLANN to remove the unwanted noise. The structure of the proposed filter is based on the Functional Link Artificial Neural Network (FLANN and the Cat Swarm Optimization (CSO is utilized for the selection of optimum weight of the neural network filter. The applied filter has been compared with the existing linear filters, like the mean filter and the adaptive Wiener filter. The performance indices, such as peak signal to noise ratio (PSNR, have been computed for the quantitative analysis of the proposed filter. The experimental evaluation established the superiority of the proposed filtering technique over existing methods.

Approximate solutions of dual fuzzy polynomials by feed-back neural networks

Directory of Open Access Journals (Sweden)

Ahmad Jafarian

2012-11-01

Full Text Available Recently, artificial neural networks (ANNs have been extensively studied and used in different areas such as pattern recognition, associative memory, combinatorial optimization, etc. In this paper, we investigate the ability of fuzzy neural networks to approximate solution of a dual fuzzy polynomial of the form $a_{1}x+ ...+a_{n}x^n =b_{1}x+ ...+b_{n}x^n+d,$ where $a_{j},b_{j},d epsilon E^1 (for j=1,...,n.$ Since the operation of fuzzy neural networks is based on Zadeh's extension principle. For this scope we train a fuzzified neural network by back-propagation-type learning algorithm which has five layer where connection weights are crisp numbers. This neural network can get a crisp input signal and then calculates its corresponding fuzzy output. Presented method can give a real approximate solution for given polynomial by using a cost function which is defined for the level sets of fuzzy output and target output. The simulation results are presented to demonstrate the efficiency and effectiveness of the proposed approach.

Nonbinary tree-based phylogenetic networks

OpenAIRE

Jetten, Laura; van Iersel, Leo

2016-01-01

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

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)

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

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

Flood Monitoring using X-band Dual-polarization Radar Network

Science.gov (United States)

Chandrasekar, V.; Wang, Y.; Maki, M.; Nakane, K.

2009-09-01

A dense weather radar network is an emerging concept advanced by the Center for Collaborative Adaptive Sensing of the Atmosphere (CASA). Using multiple radars observing over a common will create different data outcomes depending on the characteristics of the radar units employed and the network topology. To define this a general framework is developed to describe the radar network space, and formulations are obtained that can be used for weather radar network characterization. Current weather radar surveillance networks are based upon conventional sensing paradigm of widely-separated, standalone sensing systems using long range radars that operate at wavelengths in 5-10 cm range. Such configuration has limited capability to observe close to the surface of the earth because of the earth's curvature but also has poorer resolution at far ranges. The dense network radar system, observes and measures weather phenomenon such as rainfall and severe weather close to the ground at higher spatial and temporal resolution compared to the current paradigm. In addition the dense network paradigm also is easily adaptable to complex terrain. Flooding is one of the most common natural hazards in the world. Especially, excessive development decreases the response time of urban watersheds and complex terrain to rainfall and increases the chance of localized flooding events over a small spatial domain. Successful monitoring of urban floods requires high spatiotemporal resolution, accurate precipitation estimation because of the rapid flood response as well as the complex hydrologic and hydraulic characteristics in an urban environment. This paper reviews various aspects in radar rainfall mapping in urban coverage using dense X-band dual-polarization radar networks. By reducing the maximum range and operating at X-band, one can ensure good azimuthal resolution with a small-size antenna and keep the radar beam closer to the ground. The networked topology helps to achieve satisfactory

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

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

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

Learn-and-Adapt Stochastic Dual Gradients for Network Resource Allocation

OpenAIRE

Chen, Tianyi; Ling, Qing; Giannakis, Georgios B.

2017-01-01

Network resource allocation shows revived popularity in the era of data deluge and information explosion. Existing stochastic optimization approaches fall short in attaining a desirable cost-delay tradeoff. Recognizing the central role of Lagrange multipliers in network resource allocation, a novel learn-and-adapt stochastic dual gradient (LA-SDG) method is developed in this paper to learn the sample-optimal Lagrange multiplier from historical data, and accordingly adapt the upcoming resource...

Nonbinary Tree-Based Phylogenetic Networks.

Science.gov (United States)

Jetten, Laura; van Iersel, Leo

2018-01-01

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

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

Dual-echo ASL based assessment of motor networks: a feasibility study

Science.gov (United States)

Storti, Silvia Francesca; Boscolo Galazzo, Ilaria; Pizzini, Francesca B.; Menegaz, Gloria

2018-04-01

Objective. Dual-echo arterial spin labeling (DE-ASL) technique has been recently proposed for the simultaneous acquisition of ASL and blood-oxygenation-level-dependent (BOLD)-functional magnetic resonance imaging (fMRI) data. The assessment of this technique in detecting functional connectivity at rest or during motor and motor imagery tasks is still unexplored both per-se and in comparison with conventional methods. The purpose is to quantify the sensitivity of the DE-ASL sequence with respect to the conventional fMRI sequence (cvBOLD) in detecting brain activations, and to assess and compare the relevance of node features in decoding the network structure. Approach. Thirteen volunteers were scanned acquiring a pseudo-continuous DE-ASL sequence from which the concomitant BOLD (ccBOLD) simultaneously to the ASL can be extracted. The approach consists of two steps: (i) model-based analyses for assessing brain activations at individual and group levels, followed by statistical analysis for comparing the activation elicited by the three sequences under two conditions (motor and motor imagery), respectively; (ii) brain connectivity graph-theoretical analysis for assessing and comparing the network models properties. Main results. Our results suggest that cvBOLD and ccBOLD have comparable sensitivity in detecting the regions involved in the active task, whereas ASL offers a higher degree of co-localization with smaller activation volumes. The connectivity results and the comparative analysis of node features across sequences revealed that there are no strong changes between rest and tasks and that the differences between the sequences are limited to few connections. Significance. Considering the comparable sensitivity of the ccBOLD and cvBOLD sequences in detecting activated brain regions, the results demonstrate that DE-ASL can be successfully applied in functional studies allowing to obtain both ASL and BOLD information within a single sequence. Further, DE-ASL is a

Networks systems and operations. [wideband communication techniques for data links with satellites

Science.gov (United States)

1975-01-01

The application of wideband communication techniques for data links with satellites is discussed. A diagram of the demand assigned voice communications system is provided. The development of prototype integrated spacecraft paramps at S- and C-bands is described and the performance of space-qualified paramps is tabulated. The characteristics of a dual parabolic cylinder monopulse zoom antenna for use with the tracking and data relay satellite system (TDRSS) are analyzed. The development of a universally applicable transponder at S-band is reported. A block diagram of the major subassemblies of the S-band transponder is included. The technology aspects of network timing and synchronization of communication systems are to show the use of the Omega navigation system. The telemetry data compression system used during the Skylab program is evaluated.

Dual Arm Work Package performance estimates and telerobot task network simulation

International Nuclear Information System (INIS)

Draper, J.V.

1997-01-01

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

A Dual-Process Model of the Alcohol-Behavior Link for Social Drinking

Science.gov (United States)

Moss, Antony C.; Albery, Ian P.

2009-01-01

A dual-process model of the alcohol-behavior link is presented, synthesizing 2 of the major social-cognitive approaches: expectancy and myopia theories. Substantial evidence has accrued to support both of these models, and recent neurocognitive models of the effects of alcohol on thought and behavior have provided evidence to support both as well.…

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.

Performance Analysis of Dual-Polarized Massive MIMO System with Human-Care IoT Devices for Cellular Networks

Directory of Open Access Journals (Sweden)

Jun-Ki Hong

2018-01-01

Full Text Available The performance analysis of the dual-polarized massive multiple-input multiple-output (MIMO system with Internet of things (IoT devices is studied when outdoor human-care IoT devices are connected to a cellular network via a dual-polarized massive MIMO system. The research background of the performance analysis of dual-polarized massive MIMO system with IoT devices is that recently the data usage of outdoor human-care IoT devices has increased. Therefore, the outdoor human-care IoT devices are necessary to connect with 5G cellular networks which can expect 1000 times higher performance compared with 4G cellular networks. Moreover, in order to guarantee the safety of the patient for emergency cases, a human-care Iot device must be connected to cellular networks which offer more stable communication for outdoors compared to short-range communication technologies such as Wi-Fi, Zigbee, and Bluetooth. To analyze the performance of the dual-polarized massive MIMO system for human-care IoT devices, a dual-polarized MIMO spatial channel model (SCM is proposed which considers depolarization effect between the dual-polarized transmit-antennas and the receive-antennas. The simulation results show that the performance of the dual-polarized massive MIMO system is improved about 16% to 92% for 20 to 150 IoT devices compared to conventional single-polarized massive MIMO system for identical size of the transmit array.

An Internet-Based Real-Time Audiovisual Link for Dual MEG Recordings.

Directory of Open Access Journals (Sweden)

Andrey Zhdanov

Full Text Available Most neuroimaging studies of human social cognition have focused on brain activity of single subjects. More recently, "two-person neuroimaging" has been introduced, with simultaneous recordings of brain signals from two subjects involved in social interaction. These simultaneous "hyperscanning" recordings have already been carried out with a spectrum of neuroimaging modalities, such as functional magnetic resonance imaging (fMRI, electroencephalography (EEG, and functional near-infrared spectroscopy (fNIRS.We have recently developed a setup for simultaneous magnetoencephalographic (MEG recordings of two subjects that communicate in real time over an audio link between two geographically separated MEG laboratories. Here we present an extended version of the setup, where we have added a video connection and replaced the telephone-landline-based link with an Internet connection. Our setup enabled transmission of video and audio streams between the sites with a one-way communication latency of about 130 ms. Our software that allows reproducing the setup is publicly available.We demonstrate that the audiovisual Internet-based link can mediate real-time interaction between two subjects who try to mirror each others' hand movements that they can see via the video link. All the nine pairs were able to synchronize their behavior. In addition to the video, we captured the subjects' movements with accelerometers attached to their index fingers; we determined from these signals that the average synchronization accuracy was 215 ms. In one subject pair we demonstrate inter-subject coherence patterns of the MEG signals that peak over the sensorimotor areas contralateral to the hand used in the task.

Software complex for finding the path routings in synchronous digital hierarchy networks

Directory of Open Access Journals (Sweden)

V. A. Bulanov

2014-01-01

Full Text Available Communication network constructions based on the synchronous digital hierarchy (SDH are widely used in design and operation of telephone networks and data transfer ones on the basis of dedicated links. The providing the link for data transmission from one node to another one is a nontrivial objective. The network equipment vendors, as a rule, may provide also a network system control. However, these systems can be used only with the manufacturer's equipment, but are not intended for finding the optimal paths for the current network operation. They serve for examination to choose a network structure at the stage of its development or modernization for the known in advance matrix of connections. From the practice it is seen that the real networks structures use diverse equipment. Therefore to develop a complex to find the paths in SDH-based network is a challenge.Dijkstra algorithm is implemented to find the shortest network path routings in the complex. The use of the classical algorithm is impossible because of the restrictions in providing main and reserve links. There are multiplex sections with no routes to be expected. Such restriction is due to real arrangement of some multiplex sections in the same cables, but in different fibres. When providing the main link, the appropriate structuring sections should be preferable. For example, the link E3 (34 Mbit/s can pass only across the section of relevant configuration. The reserve link cannot pass across those multiplex sections where the main link has passed. This rule is not 'extra' considering the first restriction since the main and reserve link sections cannot crisscross the node. At the dead ends reserving has no sense, and the reserve link has to coincide with the main one to save a multiplex section resource of terminal switching. In implementation all these restrictions have been taken into consideration.In addition to the path routings, complex enables saving information on the network

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.

Link prediction based on nonequilibrium cooperation effect

Science.gov (United States)

Li, Lanxi; Zhu, Xuzhen; Tian, Hui

2018-04-01

Link prediction in complex networks has become a common focus of many researchers. But most existing methods concentrate on neighbors, and rarely consider degree heterogeneity of two endpoints. Node degree represents the importance or status of endpoints. We describe the large-degree heterogeneity as the nonequilibrium between nodes. This nonequilibrium facilitates a stable cooperation between endpoints, so that two endpoints with large-degree heterogeneity tend to connect stably. We name such a phenomenon as the nonequilibrium cooperation effect. Therefore, this paper proposes a link prediction method based on the nonequilibrium cooperation effect to improve accuracy. Theoretical analysis will be processed in advance, and at the end, experiments will be performed in 12 real-world networks to compare the mainstream methods with our indices in the network through numerical analysis.

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.

A Stable-Matching-Based User Linking Method with User Preference Order

Directory of Open Access Journals (Sweden)

Xuzhong Wang

2017-01-01

Full Text Available With the development of social networks, more and more users choose to use multiple accounts from different networks to meet their needs. Linking a particular user’s multiple accounts not only can improve user’s experience of the net-services such as recommender system, but also plays a significant role in network security. However, multiple accounts of the same user are often not directly linked to each other, and further, the privacy policy provided by the service provider makes it harder to find accounts for a particular user. In this paper, we propose a stable-matching-based method with user preference order for the problem of low accuracy of user linking in cross-media sparse data. Different from the traditional way which just calculates the similarity of accounts, we take full account of the mutual influence among multiple accounts by regarding different networks as bilateral (multilateral market and user linking as a stable matching problem in such a market. Based on the combination of Game-Theoretic Machine Learning and Pairwise, a novel user linking method has been proposed. The experiment shows that our method has a 21.6% improvement in accuracy compared with the traditional linking method and a further increase of about 7.8% after adding the prior knowledge.

New approaches to e-reserve linking, sharing and streaming

CERN Document Server

Cheung, Ophelia; Patrick, Susan

2010-01-01

Aimed at academic library practitioners, this book describes how e-reserve services can evolve and adapt to the changing virtual learning environment of higher education. New approaches discussed include: the integration of subscribed, free, and copyrighted resources within course management systems; innovative employment of open URL link resolvers to connect e-reserve with library e-resources and services; video streaming within course documents; and the creative use of bibliographic software to produce customized reading lists. New Approaches to E-Reserve includes detailed descriptions and e

Capacitance Estimation for DC-link Capacitors in a Back-to-Back Converter Based on Artificial Neural Network Algorithm

DEFF Research Database (Denmark)

Soliman, Hammam Abdelaal Hammam; Wang, Huai; Blaabjerg, Frede

2016-01-01

of the aforementioned challenges and shortcomings. In this paper, a pure software condition monitoring method based on Artificial Neural Network (ANN) algorithm is proposed. The implemented ANN estimates the capacitance of the dc-link capacitor in a back-to-back converter. The error analysis of the estimated results......The reliability of dc-link capacitors in power electronic converters is one of the critical aspects to be considered in modern power converter design. The observation of their ageing process and the estimation of their health status have been an attractive subject for the industrial field and hence...

Distributed Similarity based Clustering and Compressed Forwarding for wireless sensor networks.

Science.gov (United States)

Arunraja, Muruganantham; Malathi, Veluchamy; Sakthivel, Erulappan

2015-11-01

Wireless sensor networks are engaged in various data gathering applications. The major bottleneck in wireless data gathering systems is the finite energy of sensor nodes. By conserving the on board energy, the life span of wireless sensor network can be well extended. Data communication being the dominant energy consuming activity of wireless sensor network, data reduction can serve better in conserving the nodal energy. Spatial and temporal correlation among the sensor data is exploited to reduce the data communications. Data similar cluster formation is an effective way to exploit spatial correlation among the neighboring sensors. By sending only a subset of data and estimate the rest using this subset is the contemporary way of exploiting temporal correlation. In Distributed Similarity based Clustering and Compressed Forwarding for wireless sensor networks, we construct data similar iso-clusters with minimal communication overhead. The intra-cluster communication is reduced using adaptive-normalized least mean squares based dual prediction framework. The cluster head reduces the inter-cluster data payload using a lossless compressive forwarding technique. The proposed work achieves significant data reduction in both the intra-cluster and the inter-cluster communications, with the optimal data accuracy of collected data. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Abnormal Ventral and Dorsal Attention Network Activity During Single and Dual Target Detection in Schizophrenia

Directory of Open Access Journals (Sweden)

Amy M. Jimenez

2016-03-01

Full Text Available Early visual perception and attention are impaired in schizophrenia, and these deficits can be observed on target detection tasks. These tasks activate distinct ventral and dorsal brain networks which support stimulus-driven and goal-directed attention, respectively. We used single and dual target rapid serial visual presentation (RSVP tasks during fMRI with an ROI approach to examine regions within these networks associated with target detection and the attentional blink (AB in 21 schizophrenia outpatients and 25 healthy controls. In both tasks, letters were targets and numbers were distractors. For the dual target task, the second target (T2 was presented at 3 different lags after the first target (T1 (lag1=100ms, lag3=300ms, lag7=700ms. For both single and dual target tasks, patients identified fewer targets than controls. For the dual target task, both groups showed the expected AB effect with poorer performance at lag 3 than at lags 1 or 7, and there was no group by lag interaction. During the single target task, patients showed abnormally increased deactivation of the temporo-parietal junction (TPJ, a key region of the ventral network. When attention demands were increased during the dual target task, patients showed overactivation of the posterior intraparietal cortex, a key dorsal network region, along with failure to deactivate TPJ. Results suggest inefficient and faulty suppression of salience-oriented processing regions, resulting in increased sensitivity to stimuli in general, and difficulty distinguishing targets from non-targets.

CAMAC based computer--computer communications via microprocessor data links

International Nuclear Information System (INIS)

Potter, J.M.; Machen, D.R.; Naivar, F.J.; Elkins, E.P.; Simmonds, D.D.

1976-01-01

Communications between the central control computer and remote, satellite data acquisition/control stations at The Clinton P. Anderson Meson Physics Facility (LAMPF) is presently accomplished through the use of CAMAC based Data Link Modules. With the advent of the microprocessor, a new philosophy for digital data communications has evolved. Data Link modules containing microprocessor controllers provide link management and communication network protocol through algorithms executed in the Data Link microprocessor

Highball: A high speed, reserved-access, wide area network

Science.gov (United States)

Mills, David L.; Boncelet, Charles G.; Elias, John G.; Schragger, Paul A.; Jackson, Alden W.

1990-01-01

A network architecture called Highball and a preliminary design for a prototype, wide-area data network designed to operate at speeds of 1 Gbps and beyond are described. It is intended for applications requiring high speed burst transmissions where some latency between requesting a transmission and granting the request can be anticipated and tolerated. Examples include real-time video and disk-disk transfers, national filestore access, remote sensing, and similar applications. The network nodes include an intelligent crossbar switch, but have no buffering capabilities; thus, data must be queued at the end nodes. There are no restrictions on the network topology, link speeds, or end-end protocols. The end system, nodes, and links can operate at any speed up to the limits imposed by the physical facilities. An overview of an initial design approach is presented and is intended as a benchmark upon which a detailed design can be developed. It describes the network architecture and proposed access protocols, as well as functional descriptions of the hardware and software components that could be used in a prototype implementation. It concludes with a discussion of additional issues to be resolved in continuing stages of this project.

Distribution network topology identification based on synchrophasor

Directory of Open Access Journals (Sweden)

Stefania Conti

2018-03-01

Full Text Available A distribution system upgrade moving towards Smart Grid implementation is necessary to face the proliferation of distributed generators and electric vehicles, in order to satisfy the increasing demand for high quality, efficient, secure, reliable energy supply. This perspective requires taking into account system vulnerability to cyber attacks. An effective attack could destroy stored information about network structure, historical data and so on. Countermeasures and network applications could be made impracticable since most of them are based on the knowledge of network topology. Usually, the location of each link between nodes in a network is known. Therefore, the methods used for topology identification determine if a link is open or closed. When no information on the location of the network links is available, these methods become totally unfeasible. This paper presents a method to identify the network topology using only nodal measures obtained by means of phasor measurement units.

Analysis of multiphase flows using dual-energy gamma densitometry and neural networks

International Nuclear Information System (INIS)

Bishop, C.M.; James, G.D.

1993-01-01

Dual-energy gamma densitometry offers a powerful technique for the non-intrusive analysis of multiphase flows. By employing multiple beam lines, information on the phase configuration can be obtained. Once the configuration is known, it then becomes possible in principle to determine the phase fractions. In practice, however, the extraction of the phase fractions from the densitometer data is complicated by the wide variety of phase configurations which can arise, and by the considerable difficulties of modelling multiphase flows. In this paper we show that neural network techniques provide a powerful approach to the analysis of data from dual-energy gamma densitometers, allowing both the phase configuration and the phase fractions to be determined with high accuracy, whilst avoiding the uncertainties associated with modelling. The technique is well suited to the determination of oil, water and gas fractions in multiphase oil pipelines. Results from linear and non-linear network models are compared, and a new technique for validating the network output is described. (orig.)

Longitudinal links between work experiences and marital satisfaction in african american dual-earner couples.

Science.gov (United States)

Sun, Xiaoran; McHale, Susan M; Crouter, Ann C; Jones, Damon E

2017-12-01

This study assessed associations between both work demands (pressure, hours) and work resources (self-direction) and marital satisfaction in a sample of 164 African American dual-earner couples who were interviewed annually across 3 years. Grounded in the work-home resources and family systems frameworks, results from longitudinal actor-partner interdependence models (APIM) revealed main effects of spouses' work experiences on their own marital satisfaction, but these effects were qualified by the interactive effects of spouses' and partners' work experiences. Some interactive effects were consistent with an amplifying pattern, for example that, beyond the main effects of actor self-direction, marital satisfaction was highest when both spouses experienced high work self-direction. Other effects were consistent with a comparative pattern, such that shorter work hours were linked to lower marital satisfaction only when partners worked longer hours. Gender moderation also was evident in findings that wives' work pressure was negatively linked to marital satisfaction only when their husbands reported high pressure, but husbands' work pressure was negatively linked to marital satisfaction only when their wives reported low pressure. This study advances understanding of work-marriage linkages in African American couples, an understudied group with a distinctive connection to the labor force. Analyses demonstrate what can be learned from investigating the couple as a unit and illustrate how family systems concepts can be addressed via APIM. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

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.

Potassium-Based Dual Ion Battery with Dual-Graphite Electrode.

Science.gov (United States)

Fan, Ling; Liu, Qian; Chen, Suhua; Lin, Kairui; Xu, Zhi; Lu, Bingan

2017-08-01

A potassium ion battery has potential applications for large scale electric energy storage systems due to the abundance and low cost of potassium resources. Dual graphite batteries, with graphite as both anode and cathode, eliminate the use of transition metal compounds and greatly lower the overall cost. Herein, combining the merits of the potassium ion battery and dual graphite battery, a potassium-based dual ion battery with dual-graphite electrode is developed. It delivers a reversible capacity of 62 mA h g -1 and medium discharge voltage of ≈3.96 V. The intercalation/deintercalation mechanism of K + and PF 6 - into/from graphite is proposed and discussed in detail, with various characterizations to support. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A VGI data integration framework based on linked data model

Science.gov (United States)

Wan, Lin; Ren, Rongrong

2015-12-01

This paper aims at the geographic data integration and sharing method for multiple online VGI data sets. We propose a semantic-enabled framework for online VGI sources cooperative application environment to solve a target class of geospatial problems. Based on linked data technologies - which is one of core components of semantic web, we can construct the relationship link among geographic features distributed in diverse VGI platform by using linked data modeling methods, then deploy these semantic-enabled entities on the web, and eventually form an interconnected geographic data network to support geospatial information cooperative application across multiple VGI data sources. The mapping and transformation from VGI sources to RDF linked data model is presented to guarantee the unique data represent model among different online social geographic data sources. We propose a mixed strategy which combined spatial distance similarity and feature name attribute similarity as the measure standard to compare and match different geographic features in various VGI data sets. And our work focuses on how to apply Markov logic networks to achieve interlinks of the same linked data in different VGI-based linked data sets. In our method, the automatic generating method of co-reference object identification model according to geographic linked data is discussed in more detail. It finally built a huge geographic linked data network across loosely-coupled VGI web sites. The results of the experiment built on our framework and the evaluation of our method shows the framework is reasonable and practicable.

Multi-immunoreaction-based dual-color capillary electrophoresis for enhanced diagnostic reliability of thyroid gland disease.

Science.gov (United States)

Woo, Nain; Kim, Su-Kang; Kang, Seong Ho

2017-08-04

Thyroid-stimulating hormone (TSH) secretion plays a critical role in regulating thyroid gland function and circulating thyroid hormones (i.e., thyroxine (T4) and triiodothyronine (T3)). A novel multi-immunoreaction-based dual-color capillary electrophoresis (CE) technique was investigated in this study to assess its reliability in diagnosing thyroid gland disease via simultaneous detection of TSH, T3, and T4 in a single run of CE. Compared to the conventional immunoreaction technique, multi-immunoreaction of biotinylated streptavidin antibodies increased the selectivity and sensitivity for individual hormones in human blood samples. Dual-color laser-induced fluorescence (LIF) detection-based CE performed in a running buffer of 25mM Na 2 B 4 O 7 -NaOH (pH 9.3) allowed for fast, simultaneous quantitative analysis of three target thyroid hormones using different excited wavelengths within 3.2min. This process had excellent sensitivity and detection limits of 0.05-5.32 fM. The results showed 1000-100,000 times higher detection sensitivity than previous methods. Method validation with enzyme linked immunosorbent assay for application with human blood samples showed that the CE method was not significantly different at the 98% confidence level. Therefore, the developed CE-LIF method has the advantages of high detection sensitivity, faster analysis time, and smaller sample amount compared to the conventional methods The combined multi-immunoreaction and dual-color CE-LIF method should have increased diagnostic reliability for thyroid gland disease compared to conventional methods based on its highly sensitive detection of thyroid hormones using a single injection and high-throughput screening. Copyright © 2017 Elsevier B.V. All rights reserved.

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.

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

Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization

NARCIS (Netherlands)

Simonetto, A.; Jamali-Rad, H.

2015-01-01

Dual decomposition has been successfully employed in a variety of distributed convex optimization problems solved by a network of computing and communicating nodes. Often, when the cost function is separable but the constraints are coupled, the dual decomposition scheme involves local parallel

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

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.

The assessment of marine reserve networks: guidelines for ecological evaluation: Chapter 11

Science.gov (United States)

Grorud-Colvert, Kirsten; Claudet, Joachim; Carr, Mark; Caselle, Jennifer; Day, Jon; Friedlander, Alan M.; Lester, Sarah E.; Lison de Loma, Thierry; Tissot, Brian; Malone, Dan; Claudet, Joachim

2011-01-01

As marine ecosystems are plagued by an ever-increasing suite of threats including climate change, pollution, habitat degradation, and fisheries impacts (Roessig et al., 2004; Lotze et al., 2006; Jackson, 2008), there are now no ocean areas that are exempt from anthropogenic impacts (Halpern et al., 2008). In order to preserve marine biodiversity, ecosystem function, and the goods and services provided by resistant and/or resilient systems, marine reserves have been increasingly recommended as part of an ecosystem-based approach to management (Browman and Stergiou, 2004; Levin et al., 2009). Marine reserves are defined as “areas of the ocean completely protected from all extractive and destructive activities” (Lubchenco et al., 2003) and can be experimental controls for evaluating the impact of these activities on marine ecosystems. Growing scientific information has shown consistent increases in species density, biomass, size, and diversity in response to full protection inside reserves of varying sizes and ages located in diverse regions (Claudet et al., 2008; Lester et al., 2009; Molloy et al., 2009). However, most of these data are from individual marine reserves and therefore have inherently limited transferability to networks of marine reserves, which when properly designed can outperform single marine reserves for a variety of ecological, economic, and social management goals (Roberts et al., 2003; Almany et al., 2009; Gaines et al., 2010).The concept of marine reserve networks grew out of a desire to achieve both conservation and fishery management goals by minimizing the potential negative economic, social, and cultural impacts of a single large reserve while still producing similar or even greater ecological and economic returns (Murray et al., 1999; Gaines et al., 2010). In addition, reserves networks can provide insurance by protecting areas across a region and spreading the risk that these sites may be impacted by localized catastrophes such as

Bandwidth Reservations in Home Networks

DEFF Research Database (Denmark)

Nelis, Jelle; Verslype, Dieter; Develder, Chris

2010-01-01

In order for service providers to provide their users high quality services in the home network, Quality of Service (QoS) provisioning is needed to protect premium services. In this paper, we describe how a Universal Plug-and-Play (UPnP) based home network architecture solves this problem...... in a heterogeneous home network. We outline how it both relieves the end user from troublesome configuration and still offers control to the service provider. We particularly present performance assessment results for UPnP-QoS v3, based on a fully operational experimental implementation. The quantitative measurement...

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

OCDMA PON supporting ONU inter-networking based on gain-switched Fabry-Pérot lasers with external dual-wavelength injection.

Science.gov (United States)

Liu, Jie; Zeng, Duoduo; Guo, Changjian; Xu, Lei; He, Sailing

2010-10-25

We propose and demonstrate an OCDMA-PON scheme with optical network unit (ONU) internetworking capability, which utilizes low-cost gain-switched Fabry-Pérot (GS-FP) lasers with external dual-wavelength injection as the pulse sources on the ONU side. The injection-generated optical pulses in two wavelengths from the same GS-FP laser are used separately for the PON uplink transmission and ONU internetworking. Experimental results based on a two-user OCDMA system confirm the feasibility of the proposed scheme. With OCDMA technologies, separate ONU-internetworking groups can be established using different optical codes. We also give experiment results to analyze the performance of the ONU-ONU transmission at different power of interference signals when two ONU-internetworking groups are present in the OCDMA-PON.

Internet-Based Approaches to Building Stakeholder Networks for Conservation and Natural Resource Management

Science.gov (United States)

Kreakie, B. J.; Hychka, K. C.; Belaire, J. A.; Minor, E.; Walker, H. A.

2016-02-01

Social network analysis (SNA) is based on a conceptual network representation of social interactions and is an invaluable tool for conservation professionals to increase collaboration, improve information flow, and increase efficiency. We present two approaches to constructing internet-based social networks, and use an existing traditional (survey-based) case study to illustrate in a familiar context the deviations in methods and results. Internet-based approaches to SNA offer a means to overcome institutional hurdles to conducting survey-based SNA, provide unique insight into an institution's web presences, allow for easy snowballing (iterative process that incorporates new nodes in the network), and afford monitoring of social networks through time. The internet-based approaches differ in link definition: hyperlink is based on links on a website that redirect to a different website and relatedness links are based on a Google's "relatedness" operator that identifies pages "similar" to a URL. All networks were initiated with the same start nodes [members of a conservation alliance for the Calumet region around Chicago ( n = 130)], but the resulting networks vary drastically from one another. Interpretation of the resulting networks is highly contingent upon how the links were defined.

Cost-effective handoff scheme based on mobility-aware dual pointer forwarding in proxy mobile IPv6 networks.

Science.gov (United States)

Son, Seungsik; Jeong, Jongpil

2014-01-01

In this paper, a mobility-aware Dual Pointer Forwarding scheme (mDPF) is applied in Proxy Mobile IPv6 (PMIPv6) networks. The movement of a Mobile Node (MN) is classified as intra-domain and inter-domain handoff. When the MN moves, this scheme can reduce the high signaling overhead for intra-handoff/inter-handoff, because the Local Mobility Anchor (LMA) and Mobile Access Gateway (MAG) are connected by pointer chains. In other words, a handoff is aware of low mobility between the previously attached MAG (pMAG) and newly attached MAG (nMAG), and another handoff between the previously attached LMA (pLMA) and newly attached LMA (nLMA) is aware of high mobility. Based on these mobility-aware binding updates, the overhead of the packet delivery can be reduced. Also, we analyse the binding update cost and packet delivery cost for route optimization, based on the mathematical analytic model. Analytical results show that our mDPF outperforms the PMIPv6 and the other pointer forwarding schemes, in terms of reducing the total cost of signaling.

Hydrothermal growth of cross-linked hyperbranched copper dendrites using copper oxalate complex

Science.gov (United States)

Truong, Quang Duc; Kakihana, Masato

2012-06-01

A facile and surfactant-free approach has been developed for the synthesis of cross-linked hyperbranched copper dendrites using copper oxalate complex as a precursor and oxalic acid as a reducing and structure-directing agent. The synthesized particles are composed of highly branched nanostructures with unusual cross-linked hierarchical networks. The formation of copper dendrites can be explained in view of both diffusion control and aggregation-based growth model accompanied by the chelation-assisted assembly. Oxalic acid was found to play dual roles as reducing and structure-directing agent based on the investigation results. The understanding on the crystal growth and the roles of oxalic acid provides clear insight into the formation mechanism of hyperbranched metal dendrites.

Linking personality to larval energy reserves in rainbow trout (Oncorhynchus mykiss)

DEFF Research Database (Denmark)

Andersson, Madelene Åberg; Höglund, Erik

2012-01-01

in larvae with small yolks. The relationship between social dominance and yolk size was present in siblings, demonstrating a link between interfamily variation in energy reserves and aggression, and suggests that larger yolk reserves fuel a more aggressive personality during the initial territorial...

A class-based link prediction using Distance Dependent Chinese Restaurant Process

Science.gov (United States)

Andalib, Azam; Babamir, Seyed Morteza

2016-08-01

One of the important tasks in relational data analysis is link prediction which has been successfully applied on many applications such as bioinformatics, information retrieval, etc. The link prediction is defined as predicting the existence or absence of edges between nodes of a network. In this paper, we propose a novel method for link prediction based on Distance Dependent Chinese Restaurant Process (DDCRP) model which enables us to utilize the information of the topological structure of the network such as shortest path and connectivity of the nodes. We also propose a new Gibbs sampling algorithm for computing the posterior distribution of the hidden variables based on the training data. Experimental results on three real-world datasets show the superiority of the proposed method over other probabilistic models for link prediction problem.

A dual potassium channel activator improves repolarization reserve and normalizes ventricular action potentials

DEFF Research Database (Denmark)

Calloe, Kirstine; Di Diego, José M; Hansen, Rie Schultz

2016-01-01

in cultured canine cardiac myocytes and determined whether a dual K(+) current activator can normalize K(+) currents and restore action potential (AP) configuration. METHODS AND RESULTS: Ventricular myocytes were isolated and cultured for up to 48h. Current and voltage clamp recordings were made using patch...... of EADs. Our results suggest a potential benefit of K(+) current activators under conditions of reduced repolarization reserve including heart failure....

EAP-Based Authentication for Ad Hoc Network

OpenAIRE

Bhakti, Muhammad Agni Catur; Abdullah, Azween; Jung, Low Tan

2007-01-01

Wireless network has been deployed worldwide, but some security issues in wireless network might haveprevented its further acceptance. One of the solutions to overcome the limitation of wireless network security isthe IEEE 802.1X specification, a mechanism for port-based network access control, which is based onExtensible Authentication Protocol (EAP). It is an authentication framework that can support multipleauthentication methods. EAP can run over many types of data-link layer and it is fl...

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.

Tri Band Dual Polarized Patch Antenna System For Next Generation Cellular Networks

Directory of Open Access Journals (Sweden)

Syed Daniyal Ali Shah

2017-12-01

Full Text Available In fifth generation networks much emphasis is given to reduce the handset and base station sizes while incorporating even more features for ubiquitous connectivity. Polarization diversity is one of the methods in which a single multi-polarized antenna brings the advantages of antenna diversity. The multiband handset antennas can be made dual-polarized for improved compensation of fading effects of propagation environment especially in terrestrial bands. This paper focuses on the outcomes of the development of a horizontal and vertical polarized patch antenna scheme that operates on 3 bands 900 MHz 1.8 GHz and 2.4 GHz. The antenna system is tested for gain directivity reflection loss polarization radiation pattern and other parameters. The results are published and found are found to satisfy the requirements of cellular and data communication networks in the specified bands.

Smart Drug Delivery System-Inspired Enzyme-Linked Immunosorbent Assay Based on Fluorescence Resonance Energy Transfer and Allochroic Effect Induced Dual-Modal Colorimetric and Fluorescent Detection.

Science.gov (United States)

Miao, Luyang; Zhu, Chengzhou; Jiao, Lei; Li, He; Du, Dan; Lin, Yuehe; Wei, Qin

2018-02-06

Numerous analytical techniques have been undertaken for the detection of protein biomarkers because of their extensive and significant applications in clinical diagnosis, whereas there are few strategies to develop dual-readout immunosensors to achieve more accurate results. To the best of our knowledge, inspired by smart drug delivery system (DDS), a novel pH-responsive modified enzyme-linked immunosorbent assay (ELISA) was innovatively developed for the first time, realizing dual-modal colorimetric and fluorescent detection of cardiac troponin I (cTnI). Curcumin (CUR) was elaborately selected as a reporter molecule, which played the same role of drugs in DDS based on the following considerations: (1) CUR can be used as a kind of pH indicator by the inherited allochroic effect induced by basic pH value; (2) the fluorescence of CUR can be quenched by certain nanocarriers as the acceptor because of the occurrence of fluorescence resonance energy transfer (FRET), while recovered by the stimuli of basic pH value, which can produce "signal-on" fluorescence detection. Three-dimensional MoS 2 nanoflowers (3D-MoS 2 NFs) were employed in immobilizing CUR to constitute a nanoprobe for the determination of cTnI by virtue of good biocompatibility, high absorption capacity, and fluorescence quench efficiency toward CUR. The proposed DDS-inspired ELISA offered dual-modal colorimetric and fluorescent detection of cTnI, thereby meeting the reliable and precise analysis requirements. We believe that the developed dual-readout ELISA will create a new avenue and bring innovative inspirations for biological detections.

Spectrum scanning and reserve channel methods for link maintenance in cognitive radio systems

OpenAIRE

Subramani, S; Armour, SMD; Kaleshi, D; Fan, Z

2008-01-01

Underutilization of the limited spectrum sparked the need for dynamic spectrum access and flexible spectrum policies. Accurate estimation of spectrum occupancy is an essential step for spectrum access in distributed networks. This paper analyzes a bidirectional and dual scanning method that scans multiple spectrum bands to find a suitable free-channel. Moreover, secondary users' access to available spectrum could be interrupted by the arrival of primary spectrum users, forcing the well-behave...

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

A neural network model of semantic memory linking feature-based object representation and words.

Science.gov (United States)

Cuppini, C; Magosso, E; Ursino, M

2009-06-01

Recent theories in cognitive neuroscience suggest that semantic memory is a distributed process, which involves many cortical areas and is based on a multimodal representation of objects. The aim of this work is to extend a previous model of object representation to realize a semantic memory, in which sensory-motor representations of objects are linked with words. The model assumes that each object is described as a collection of features, coded in different cortical areas via a topological organization. Features in different objects are segmented via gamma-band synchronization of neural oscillators. The feature areas are further connected with a lexical area, devoted to the representation of words. Synapses among the feature areas, and among the lexical area and the feature areas are trained via a time-dependent Hebbian rule, during a period in which individual objects are presented together with the corresponding words. Simulation results demonstrate that, during the retrieval phase, the network can deal with the simultaneous presence of objects (from sensory-motor inputs) and words (from acoustic inputs), can correctly associate objects with words and segment objects even in the presence of incomplete information. Moreover, the network can realize some semantic links among words representing objects with shared features. These results support the idea that semantic memory can be described as an integrated process, whose content is retrieved by the co-activation of different multimodal regions. In perspective, extended versions of this model may be used to test conceptual theories, and to provide a quantitative assessment of existing data (for instance concerning patients with neural deficits).

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

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.

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.

Conservation priorities for mammals in megadiverse Mexico: the efficiency of reserve networks.

Science.gov (United States)

Ceballos, Gerardo

2007-03-01

A major goal of conservation biologists is to identify critical areas for the conservation of biological diversity and then strategically include them in an efficient system of reserves. In general, however, reserve networks have been selected for different objectives, and most countries lack an evaluation of their reserves' ability to represent a percentage of the national diversity. This paper evaluates the effectiveness of a network of reserves to represent the species of mammals in Mexico. The focus of the analyses is on species and site level, evaluating the representation of all terrestrial mammals in the 30 most important reserves. The representation of all species, endemic species, endangered species, and species with restricted distributions in the reserves was assessed and compared. Endemic or endangered species with restricted distributions were expected to be less represented in reserves than were widespread species. The most important reserves for the conservation of mammals were determined with the use of complementarity analyses. Priority sites for the representation of all the species currently absent from the reserve network were then selected. The results have broad applications for conservation. First, 82% of the mammal species from Mexico were represented in the reserve network, which covers a small portion (3.8%) of the country. Second, this percentage is certainly larger as several reserves were not evaluated due to a lack of data. A priority for a national conservation strategy could be to conduct biological surveys in those reserves lacking inventories to evaluate their contribution to conservation. Third, in spite of its demonstrated value, Mexico's reserve network can be improved by designating complementary areas. Additional priority sites, where reserves are required to represent most gap species in the network, were identified. Finally, it is clear that this reserve network has limitations for maintaining biodiversity and ecosystem

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

Social networks, web-based tools and diseases: implications for biomedical research.

Science.gov (United States)

Costa, Fabricio F

2013-03-01

Advances in information technology have improved our ability to gather, collect and analyze information from individuals online. Social networks can be seen as a nonlinear superposition of a multitude of complex connections between people where the nodes represent individuals and the links between them capture a variety of different social interactions. The emergence of different types of social networks has fostered connections between individuals, thus facilitating data exchange in a variety of fields. Therefore, the question posed now is "can these same tools be applied to life sciences in order to improve scientific and medical research?" In this article, I will review how social networks and other web-based tools are changing the way we approach and track diseases in biomedical research. Copyright © 2012 Elsevier Ltd. All rights reserved.

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

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.

A precise clock distribution network for MRPC-based experiments

International Nuclear Information System (INIS)

Wang, S.; Cao, P.; Shang, L.; An, Q.

2016-01-01

In high energy physics experiments, the MRPC (Multi-Gap Resistive Plate Chamber) detectors are widely used recently which can provide higher-resolution measurement for particle identification. However, the application of MRPC detectors leads to a series of challenges in electronics design with large number of front-end electronic channels, especially for distributing clock precisely. To deal with these challenges, this paper presents a universal scheme of clock transmission network for MRPC-based experiments with advantages of both precise clock distribution and global command synchronization. For precise clock distributing, the clock network is designed into a tree architecture with two stages: the first one has a point-to-multipoint long range bidirectional distribution with optical channels and the second one has a fan-out structure with copper link inside readout crates. To guarantee the precision of clock frequency or phase, the r-PTP (reduced Precision Time Protocol) and the DDMTD (digital Dual Mixer Time Difference) methods are used for frequency synthesis, phase measurement and adjustment, which is implemented by FPGA (Field Programmable Gate Array) in real-time. In addition, to synchronize global command execution, based upon this clock distribution network, synchronous signals are coded with clock for transmission. With technique of encoding/decoding and clock data recovery, signals such as global triggers or system control commands, can be distributed to all front-end channels synchronously, which greatly simplifies the system design. The experimental results show that both the clock jitter (RMS) and the clock skew can be less than 100 ps.

Dual Temporal Scale Convolutional Neural Network for Micro-Expression Recognition

Directory of Open Access Journals (Sweden)

Min Peng

2017-10-01

Full Text Available Facial micro-expression is a brief involuntary facial movement and can reveal the genuine emotion that people try to conceal. Traditional methods of spontaneous micro-expression recognition rely excessively on sophisticated hand-crafted feature design and the recognition rate is not high enough for its practical application. In this paper, we proposed a Dual Temporal Scale Convolutional Neural Network (DTSCNN for spontaneous micro-expressions recognition. The DTSCNN is a two-stream network. Different of stream of DTSCNN is used to adapt to different frame rate of micro-expression video clips. Each stream of DSTCNN consists of independent shallow network for avoiding the overfitting problem. Meanwhile, we fed the networks with optical-flow sequences to ensure that the shallow networks can further acquire higher-level features. Experimental results on spontaneous micro-expression databases (CASME I/II showed that our method can achieve a recognition rate almost 10% higher than what some state-of-the-art method can achieve.

Dual Temporal Scale Convolutional Neural Network for Micro-Expression Recognition.

Science.gov (United States)

Peng, Min; Wang, Chongyang; Chen, Tong; Liu, Guangyuan; Fu, Xiaolan

2017-01-01

Facial micro-expression is a brief involuntary facial movement and can reveal the genuine emotion that people try to conceal. Traditional methods of spontaneous micro-expression recognition rely excessively on sophisticated hand-crafted feature design and the recognition rate is not high enough for its practical application. In this paper, we proposed a Dual Temporal Scale Convolutional Neural Network (DTSCNN) for spontaneous micro-expressions recognition. The DTSCNN is a two-stream network. Different of stream of DTSCNN is used to adapt to different frame rate of micro-expression video clips. Each stream of DSTCNN consists of independent shallow network for avoiding the overfitting problem. Meanwhile, we fed the networks with optical-flow sequences to ensure that the shallow networks can further acquire higher-level features. Experimental results on spontaneous micro-expression databases (CASME I/II) showed that our method can achieve a recognition rate almost 10% higher than what some state-of-the-art method can achieve.

Dual Temporal Scale Convolutional Neural Network for Micro-Expression Recognition

Science.gov (United States)

Peng, Min; Wang, Chongyang; Chen, Tong; Liu, Guangyuan; Fu, Xiaolan

2017-01-01

Facial micro-expression is a brief involuntary facial movement and can reveal the genuine emotion that people try to conceal. Traditional methods of spontaneous micro-expression recognition rely excessively on sophisticated hand-crafted feature design and the recognition rate is not high enough for its practical application. In this paper, we proposed a Dual Temporal Scale Convolutional Neural Network (DTSCNN) for spontaneous micro-expressions recognition. The DTSCNN is a two-stream network. Different of stream of DTSCNN is used to adapt to different frame rate of micro-expression video clips. Each stream of DSTCNN consists of independent shallow network for avoiding the overfitting problem. Meanwhile, we fed the networks with optical-flow sequences to ensure that the shallow networks can further acquire higher-level features. Experimental results on spontaneous micro-expression databases (CASME I/II) showed that our method can achieve a recognition rate almost 10% higher than what some state-of-the-art method can achieve. PMID:29081753

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.

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

Shared protection based virtual network mapping in space division multiplexing optical networks

Science.gov (United States)

Zhang, Huibin; Wang, Wei; Zhao, Yongli; Zhang, Jie

2018-05-01

Space Division Multiplexing (SDM) has been introduced to improve the capacity of optical networks. In SDM optical networks, there are multiple cores/modes in each fiber link, and spectrum resources are multiplexed in both frequency and core/modes dimensions. Enabled by network virtualization technology, one SDM optical network substrate can be shared by several virtual networks operators. Similar with point-to-point connection services, virtual networks (VN) also need certain survivability to guard against network failures. Based on customers' heterogeneous requirements on the survivability of their virtual networks, this paper studies the shared protection based VN mapping problem and proposes a Minimum Free Frequency Slots (MFFS) mapping algorithm to improve spectrum efficiency. Simulation results show that the proposed algorithm can optimize SDM optical networks significantly in terms of blocking probability and spectrum utilization.

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.

Performance Analysis of RF-FSO Multi-Hop Networks

KAUST Repository

Makki, Behrooz

2017-05-12

We study the performance of multi-hop networks composed of millimeter wave (MMW)-based radio frequency (RF) and free-space optical (FSO) links. The results are obtained in the cases with and without hybrid automatic repeat request (HARQ). Taking the MMW characteristics of the RF links into account, we derive closed-form expressions for the network outage probability. We also evaluate the effect of various parameters such as power amplifiers efficiency, number of antennas as well as different coherence times of the RF and the FSO links on the system performance. Finally, we present mappings between the performance of RF- FSO multi-hop networks and the ones using only the RF- or the FSO-based communication, in the sense that with appropriate parameter settings the same outage probability is achieved in these setups. The results show the efficiency of the RF-FSO setups in different conditions. Moreover, the HARQ can effectively improve the outage probability/energy efficiency, and compensate the effect of hardware impairments in RF-FSO networks. For common parameter settings of the RF-FSO dual- hop networks, outage probability 10^{-4} and code rate 3 nats-per-channel-use, the implementation of HARQ with a maximum of 2 and 3 retransmissions reduces the required power, compared to the cases with no HARQ, by 13 and 17 dB, respectively.

Aerial Triangulation Close-range Images with Dual Quaternion

Directory of Open Access Journals (Sweden)

SHENG Qinghong

2015-05-01

Full Text Available A new method for the aerial triangulation of close-range images based on dual quaternion is presented. Using dual quaternion to represent the spiral screw motion of the beam in the space, the real part of dual quaternion represents the angular elements of all the beams in the close-range area networks, the real part and the dual part of dual quaternion represents the line elements corporately. Finally, an aerial triangulation adjustment model based on dual quaternion is established, and the elements of interior orientation and exterior orientation and the object coordinates of the ground points are calculated. Real images and large attitude angle simulated images are selected to run the experiments of aerial triangulation. The experimental results show that the new method for the aerial triangulation of close-range images based on dual quaternion can obtain higher accuracy.

Fair and efficient network congestion control based on minority game

Science.gov (United States)

Wang, Zuxi; Wang, Wen; Hu, Hanping; Deng, Zhaozhang

2011-12-01

Low link utility, RTT unfairness and unfairness of Multi-Bottleneck network are the existing problems in the present network congestion control algorithms at large. Through the analogy of network congestion control with the "El Farol Bar" problem, we establish a congestion control model based on minority game(MG), and then present a novel network congestion control algorithm based on the model. The result of simulations indicates that the proposed algorithm can make the achievements of link utility closing to 100%, zero packet lose rate, and small of queue size. Besides, the RTT unfairness and the unfairness of Multi-Bottleneck network can be solved, to achieve the max-min fairness in Multi-Bottleneck network, while efficiently weaken the "ping-pong" oscillation caused by the overall synchronization.

Overlapping community detection based on link graph using distance dynamics

Science.gov (United States)

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

2018-01-01

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

Energy Efficient Routing Algorithms in Dynamic Optical Core Networks with Dual Energy Sources

DEFF Research Database (Denmark)

Wang, Jiayuan; Fagertun, Anna Manolova; Ruepp, Sarah Renée

2013-01-01

This paper proposes new energy efficient routing algorithms in optical core networks, with the application of solar energy sources and bundled links. A comprehensive solar energy model is described in the proposed network scenarios. Network performance in energy savings, connection blocking...... probability, resource utilization and bundled link usage are evaluated with dynamic network simulations. Results show that algorithms proposed aiming for reducing the dynamic part of the energy consumption of the network may raise the fixed part of the energy consumption meanwhile....

A Cluster-Based Dual-Adaptive Topology Control Approach in Wireless Sensor Networks.

Science.gov (United States)

Gui, Jinsong; Zhou, Kai; Xiong, Naixue

2016-09-25

Multi-Input Multi-Output (MIMO) can improve wireless network performance. Sensors are usually single-antenna devices due to the high hardware complexity and cost, so several sensors are used to form virtual MIMO array, which is a desirable approach to efficiently take advantage of MIMO gains. Also, in large Wireless Sensor Networks (WSNs), clustering can improve the network scalability, which is an effective topology control approach. The existing virtual MIMO-based clustering schemes do not either fully explore the benefits of MIMO or adaptively determine the clustering ranges. Also, clustering mechanism needs to be further improved to enhance the cluster structure life. In this paper, we propose an improved clustering scheme for virtual MIMO-based topology construction (ICV-MIMO), which can determine adaptively not only the inter-cluster transmission modes but also the clustering ranges. Through the rational division of cluster head function and the optimization of cluster head selection criteria and information exchange process, the ICV-MIMO scheme effectively reduces the network energy consumption and improves the lifetime of the cluster structure when compared with the existing typical virtual MIMO-based scheme. Moreover, the message overhead and time complexity are still in the same order of magnitude.

Network robustness assessed within a dual connectivity framework: joint dynamics of the Active and Idle Networks.

Science.gov (United States)

Tejedor, Alejandro; Longjas, Anthony; Zaliapin, Ilya; Ambroj, Samuel; Foufoula-Georgiou, Efi

2017-08-17

Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. But current definition of robustness is only accounting for half of the story: the connectivity of the nodes unaffected by the attack. Here we propose a new framework to assess network robustness, wherein the connectivity of the affected nodes is also taken into consideration, acknowledging that it plays a crucial role in properly evaluating the overall network robustness in terms of its future recovery from the attack. Specifically, we propose a dual perspective approach wherein at any instant in the network evolution under attack, two distinct networks are defined: (i) the Active Network (AN) composed of the unaffected nodes and (ii) the Idle Network (IN) composed of the affected nodes. The proposed robustness metric considers both the efficiency of destroying the AN and that of building-up the IN. We show, via analysis of well-known prototype networks and real world data, that trade-offs between the efficiency of Active and Idle Network dynamics give rise to surprising robustness crossovers and re-rankings, which can have significant implications for decision making.

Accelerated Distributed Dual Averaging Over Evolving Networks of Growing Connectivity

Science.gov (United States)

Liu, Sijia; Chen, Pin-Yu; Hero, Alfred O.

2018-04-01

We consider the problem of accelerating distributed optimization in multi-agent networks by sequentially adding edges. Specifically, we extend the distributed dual averaging (DDA) subgradient algorithm to evolving networks of growing connectivity and analyze the corresponding improvement in convergence rate. It is known that the convergence rate of DDA is influenced by the algebraic connectivity of the underlying network, where better connectivity leads to faster convergence. However, the impact of network topology design on the convergence rate of DDA has not been fully understood. In this paper, we begin by designing network topologies via edge selection and scheduling. For edge selection, we determine the best set of candidate edges that achieves the optimal tradeoff between the growth of network connectivity and the usage of network resources. The dynamics of network evolution is then incurred by edge scheduling. Further, we provide a tractable approach to analyze the improvement in the convergence rate of DDA induced by the growth of network connectivity. Our analysis reveals the connection between network topology design and the convergence rate of DDA, and provides quantitative evaluation of DDA acceleration for distributed optimization that is absent in the existing analysis. Lastly, numerical experiments show that DDA can be significantly accelerated using a sequence of well-designed networks, and our theoretical predictions are well matched to its empirical convergence behavior.

Network-level accident-mapping: Distance based pattern matching using artificial neural network.

Science.gov (United States)

Deka, Lipika; Quddus, Mohammed

2014-04-01

The objective of an accident-mapping algorithm is to snap traffic accidents onto the correct road segments. Assigning accidents onto the correct segments facilitate to robustly carry out some key analyses in accident research including the identification of accident hot-spots, network-level risk mapping and segment-level accident risk modelling. Existing risk mapping algorithms have some severe limitations: (i) they are not easily 'transferable' as the algorithms are specific to given accident datasets; (ii) they do not perform well in all road-network environments such as in areas of dense road network; and (iii) the methods used do not perform well in addressing inaccuracies inherent in and type of road environment. The purpose of this paper is to develop a new accident mapping algorithm based on the common variables observed in most accident databases (e.g. road name and type, direction of vehicle movement before the accident and recorded accident location). The challenges here are to: (i) develop a method that takes into account uncertainties inherent to the recorded traffic accident data and the underlying digital road network data, (ii) accurately determine the type and proportion of inaccuracies, and (iii) develop a robust algorithm that can be adapted for any accident set and road network of varying complexity. In order to overcome these challenges, a distance based pattern-matching approach is used to identify the correct road segment. This is based on vectors containing feature values that are common in the accident data and the network data. Since each feature does not contribute equally towards the identification of the correct road segments, an ANN approach using the single-layer perceptron is used to assist in "learning" the relative importance of each feature in the distance calculation and hence the correct link identification. The performance of the developed algorithm was evaluated based on a reference accident dataset from the UK confirming that

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.

Complex networks-based energy-efficient evolution model for wireless sensor networks

Energy Technology Data Exchange (ETDEWEB)

Zhu Hailin [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China)], E-mail: zhuhailin19@gmail.com; Luo Hong [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China); Peng Haipeng; Li Lixiang; Luo Qun [Information Secure Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China)

2009-08-30

Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.

Complex networks-based energy-efficient evolution model for wireless sensor networks

International Nuclear Information System (INIS)

Zhu Hailin; Luo Hong; Peng Haipeng; Li Lixiang; Luo Qun

2009-01-01

Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.

Nonbinary Tree-Based Phylogenetic Networks

NARCIS (Netherlands)

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

2018-01-01

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

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)

Resilience of Self-Organised and Top-Down Planned Cities--A Case Study on London and Beijing Street Networks.

Directory of Open Access Journals (Sweden)

Jiaqiu Wang

Full Text Available The success or failure of the street network depends on its reliability. In this article, using resilience analysis, the author studies how the shape and appearance of street networks in self-organised and top-down planned cities influences urban transport. Considering London and Beijing as proxies for self-organised and top-down planned cities, the structural properties of London and Beijing networks first are investigated based on their primal and dual representations of planar graphs. The robustness of street networks then is evaluated in primal space and dual space by deactivating road links under random and intentional attack scenarios. The results show that the reliability of London street network differs from that of Beijing, which seems to rely more on its architecture and connectivity. It is found that top-down planned Beijing with its higher average degree in the dual space and assortativity in the primal space is more robust than self-organised London using the measures of maximum and second largest cluster size and network efficiency. The article offers an insight, from a network perspective, into the reliability of street patterns in self-organised and top-down planned city systems.

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.

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

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 Cluster-Based Dual-Adaptive Topology Control Approach in Wireless Sensor Networks

Science.gov (United States)

Gui, Jinsong; Zhou, Kai; Xiong, Naixue

2016-01-01

Multi-Input Multi-Output (MIMO) can improve wireless network performance. Sensors are usually single-antenna devices due to the high hardware complexity and cost, so several sensors are used to form virtual MIMO array, which is a desirable approach to efficiently take advantage of MIMO gains. Also, in large Wireless Sensor Networks (WSNs), clustering can improve the network scalability, which is an effective topology control approach. The existing virtual MIMO-based clustering schemes do not either fully explore the benefits of MIMO or adaptively determine the clustering ranges. Also, clustering mechanism needs to be further improved to enhance the cluster structure life. In this paper, we propose an improved clustering scheme for virtual MIMO-based topology construction (ICV-MIMO), which can determine adaptively not only the inter-cluster transmission modes but also the clustering ranges. Through the rational division of cluster head function and the optimization of cluster head selection criteria and information exchange process, the ICV-MIMO scheme effectively reduces the network energy consumption and improves the lifetime of the cluster structure when compared with the existing typical virtual MIMO-based scheme. Moreover, the message overhead and time complexity are still in the same order of magnitude. PMID:27681731

A Cluster-Based Dual-Adaptive Topology Control Approach in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jinsong Gui

2016-09-01

Full Text Available Multi-Input Multi-Output (MIMO can improve wireless network performance. Sensors are usually single-antenna devices due to the high hardware complexity and cost, so several sensors are used to form virtual MIMO array, which is a desirable approach to efficiently take advantage of MIMO gains. Also, in large Wireless Sensor Networks (WSNs, clustering can improve the network scalability, which is an effective topology control approach. The existing virtual MIMO-based clustering schemes do not either fully explore the benefits of MIMO or adaptively determine the clustering ranges. Also, clustering mechanism needs to be further improved to enhance the cluster structure life. In this paper, we propose an improved clustering scheme for virtual MIMO-based topology construction (ICV-MIMO, which can determine adaptively not only the inter-cluster transmission modes but also the clustering ranges. Through the rational division of cluster head function and the optimization of cluster head selection criteria and information exchange process, the ICV-MIMO scheme effectively reduces the network energy consumption and improves the lifetime of the cluster structure when compared with the existing typical virtual MIMO-based scheme. Moreover, the message overhead and time complexity are still in the same order of magnitude.

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)

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.

A highly sensitive immunoassay for atrazine based on covalently linking the small molecule hapten to a urea-glutaraldehyde network on a polystyrene surface.

Science.gov (United States)

Sai, Na; Sun, Wenjing; Wu, Yuntang; Sun, Zhong; Yu, Guanggui; Huang, Guowei

2016-11-01

A new enzyme-linked immunosorbent assay (ELISA) for atrazine was developed based on covalent bonding of the small molecule hapten, 2-mercaptopropionic acid-4-ethylamino-6-isopropylamino-1,3,5-triazine (MPA-atrazine), to urea-glutaraldehyde (UGA)-treated microtiter plates. In this assay, the microtiter plate surface was treated with the UGA network to both introduce amino groups, which were used to cross-link with the hapten carboxylate groups, and efficiently prevent non-specific adsorption of antibodies, which successfully eliminated the time-consuming routine blocking step. Compared with HNO 3 -H 2 SO 4 -APTES-hapten coated ELISA (modified with a HNO 3 -H 2 SO 4 -APTES mixture and covalent-linked hapten) and conventional ELISA (coated with hapten-carrier protein conjugates), the novel ELISA format increased the sensitivity by approximately 3.5-fold and 7.5-fold, respectively, and saved 2.5h and 34h of coating hapten time, respectively. The method's 50% inhibition concentration for atrazine was 5.54ngmL -1 , and the limit of detection was 0.16ngmL -1 after optimization of reaction conditions. Furthermore, the ELISA was adapted for analysis of atrazine in corn, rice, and water samples, demonstrating recoveries of 90%-108%. Thus, the assay provides a convenient alternative to conventional, laborious immunoassays for routine supervision of residue detection in food and the environment. Copyright © 2016 Elsevier B.V. All rights reserved.

Rolling bearing fault diagnosis using adaptive deep belief network with dual-tree complex wavelet packet.

Science.gov (United States)

Shao, Haidong; Jiang, Hongkai; Wang, Fuan; Wang, Yanan

2017-07-01

Automatic and accurate identification of rolling bearing fault categories, especially for the fault severities and compound faults, is a challenge in rotating machinery fault diagnosis. For this purpose, a novel method called adaptive deep belief network (DBN) with dual-tree complex wavelet packet (DTCWPT) is developed in this paper. DTCWPT is used to preprocess the vibration signals to refine the fault characteristics information, and an original feature set is designed from each frequency-band signal of DTCWPT. An adaptive DBN is constructed to improve the convergence rate and identification accuracy with multiple stacked adaptive restricted Boltzmann machines (RBMs). The proposed method is applied to the fault diagnosis of rolling bearings. The results confirm that the proposed method is more effective than the existing methods. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

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

Leo satellite-based telecommunication network concepts

Science.gov (United States)

Aiken, John G.; Swan, Peter A.; Leopold, Ray J.

1991-01-01

Design considerations are discussed for Low Earth Orbit (LEO) satellite based telecommunications networks. The satellites are assumed to be connected to each other via intersatellite links. They are connected to the end user either directly or through gateways to other networks. Frequency reuse, circuit switching, packet switching, call handoff, and routing for these systems are discussed by analogy with terrestrial cellular (mobile radio) telecommunication systems.

NM-Net Gigabit-based Implementation on Core Network Facilities and Network Design Hierarchy

International Nuclear Information System (INIS)

Raja Murzaferi Raja Moktar; Mohd Fauzi Haris; Siti Nurbahyah Hamdan

2011-01-01

Nuclear Malaysia computing network or NM the main backbone of internet working on operational staffs. Main network operating center or NOC is situated in Block 15 and linkup via fiber cabling to adjacent main network blocks (18, 29, 11 connections. Pre 2009 infrastructure; together to form the core networking switch. of the core network infrastructure were limited by the up link between core switches that is the Pair (UTP) Category 6 Cable. Furthermore, majority of the networking infrastructure throughout the agency were mainly built with Fast Ethernet Based specifications to date. With current research and operational tasks highly dependent on IT infrastructure that is being enabled through NM-Net, the performance NM-Net implementing gigabit-based networking system achieve optimal performance of internet networking services in the agency thus catalyze initiative. (author)

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

Visualizing weighted networks: a performance comparison of adjacency matrices versus node-link diagrams

Science.gov (United States)

McIntire, John P.; Osesina, O. Isaac; Bartley, Cecilia; Tudoreanu, M. Eduard; Havig, Paul R.; Geiselman, Eric E.

2012-06-01

Ensuring the proper and effective ways to visualize network data is important for many areas of academia, applied sciences, the military, and the public. Fields such as social network analysis, genetics, biochemistry, intelligence, cybersecurity, neural network modeling, transit systems, communications, etc. often deal with large, complex network datasets that can be difficult to interact with, study, and use. There have been surprisingly few human factors performance studies on the relative effectiveness of different graph drawings or network diagram techniques to convey information to a viewer. This is particularly true for weighted networks which include the strength of connections between nodes, not just information about which nodes are linked to other nodes. We describe a human factors study in which participants performed four separate network analysis tasks (finding a direct link between given nodes, finding an interconnected node between given nodes, estimating link strengths, and estimating the most densely interconnected nodes) on two different network visualizations: an adjacency matrix with a heat-map versus a node-link diagram. The results should help shed light on effective methods of visualizing network data for some representative analysis tasks, with the ultimate goal of improving usability and performance for viewers of network data displays.

Optimum Layout for Sensors in Water Distribution Networks through Ant Colony Algorithm: A Dual Use Vision

Directory of Open Access Journals (Sweden)

Seyed Mehdi Miri

2014-07-01

Full Text Available The accidental or intentional entry of contaminants or self-deterioration of the water quality within the network itself can severely harm public health. Efficient water quality monitoring is one of the most important tools to guarantee a reliable potable water supply to consumers of drinking water distribution systems. Considering the high purchase, installation and maintenance cost of sensors in water distribution networks deploying two independent sensor networks within one distribution system is not only bounded by physical constraints but also is not a cost-effective approach. Therefore, need for combining different objectives and designing sensor network to simultaneity satisfying these objectives is felt. Sensors should comply with dual use benefits. Sensor locations and types should be integrated not only for achieving water security goals but also for accomplishing other water utility objectives, such as satisfying regulatory monitoring requirements or collecting information to solve water quality problems. In this study, a dual use vision for the sensor layout problem in the municipal water networks, is formulated and solved with the ant colony algorithm.

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 Design Of Feeding Network For A Dual-Linear Polarization, Stacked, Probe-Fed Microstrip Patch Antenna Array

DEFF Research Database (Denmark)

Jaworski, G.; Krozer, Viktor

2004-01-01

Components of multilayer feed network are presented for application in broad-band dual-linear polarized stacked C-band antenna. Measurement results of wide band matching circuits and different types of power divider networks constituting parts of BFN demonstrate wideband operation. Suitable...

Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication

Science.gov (United States)

Jakovetic, Dusan; Xavier, João; Moura, José M. F.

2011-08-01

We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual function. Dual variables are updated by the standard method of multipliers, at a slow time scale. To update the primal variables, we propose a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses unidirectional gossip communication, only between immediate neighbors in the network and is resilient to random link failures. For networks with reliable communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian broadcast gossiping) algorithm reduces communication, computation and data storage cost. We prove convergence for all proposed algorithms and demonstrate by simulations the effectiveness on two applications: l_1-regularized logistic regression for classification and cooperative spectrum sensing for cognitive radio networks.

Hybrid robust model based on an improved functional link neural network integrating with partial least square (IFLNN-PLS) and its application to predicting key process variables.

Science.gov (United States)

He, Yan-Lin; Xu, Yuan; Geng, Zhi-Qiang; Zhu, Qun-Xiong

2016-03-01

In this paper, a hybrid robust model based on an improved functional link neural network integrating with partial least square (IFLNN-PLS) is proposed. Firstly, an improved functional link neural network with small norm of expanded weights and high input-output correlation (SNEWHIOC-FLNN) was proposed for enhancing the generalization performance of FLNN. Unlike the traditional FLNN, the expanded variables of the original inputs are not directly used as the inputs in the proposed SNEWHIOC-FLNN model. The original inputs are attached to some small norm of expanded weights. As a result, the correlation coefficient between some of the expanded variables and the outputs is enhanced. The larger the correlation coefficient is, the more relevant the expanded variables tend to be. In the end, the expanded variables with larger correlation coefficient are selected as the inputs to improve the performance of the traditional FLNN. In order to test the proposed SNEWHIOC-FLNN model, three UCI (University of California, Irvine) regression datasets named Housing, Concrete Compressive Strength (CCS), and Yacht Hydro Dynamics (YHD) are selected. Then a hybrid model based on the improved FLNN integrating with partial least square (IFLNN-PLS) was built. In IFLNN-PLS model, the connection weights are calculated using the partial least square method but not the error back propagation algorithm. Lastly, IFLNN-PLS was developed as an intelligent measurement model for accurately predicting the key variables in the Purified Terephthalic Acid (PTA) process and the High Density Polyethylene (HDPE) process. Simulation results illustrated that the IFLNN-PLS could significant improve the prediction performance. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

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.

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

Energy Technology Data Exchange (ETDEWEB)

Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhou, Xinyang [University of Colorado; Liu, Zhiyuan [University of Colorado; Chen, Lijun [University of Colorado

2017-10-03

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together with pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.

On cooperative and efficient overlay network evolution based on a group selection pattern.

Science.gov (United States)

Nakao, Akihiro; Wang, Yufeng

2010-04-01

In overlay networks, the interplay between network structure and dynamics remains largely unexplored. In this paper, we study dynamic coevolution between individual rational strategies (cooperative or defect) and the overlay network structure, that is, the interaction between peer's local rational behaviors and the emergence of the whole network structure. We propose an evolutionary game theory (EGT)-based overlay topology evolution scheme to drive a given overlay into the small-world structure (high global network efficiency and average clustering coefficient). Our contributions are the following threefold: From the viewpoint of peers' local interactions, we explicitly consider the peer's rational behavior and introduce a link-formation game to characterize the social dilemma of forming links in an overlay network. Furthermore, in the evolutionary link-formation phase, we adopt a simple economic process: Each peer keeps one link to a cooperative neighbor in its neighborhood, which can slightly speed up the convergence of cooperation and increase network efficiency; from the viewpoint of the whole network structure, our simulation results show that the EGT-based scheme can drive an arbitrary overlay network into a fully cooperative and efficient small-world structure. Moreover, we compare our scheme with a search-based economic model of network formation and illustrate that our scheme can achieve the experimental and analytical results in the latter model. In addition, we also graphically illustrate the final overlay network structure; finally, based on the group selection model and evolutionary set theory, we theoretically obtain the approximate threshold of cost and draw the conclusion that the small value of the average degree and the large number of the total peers in an overlay network facilitate the evolution of cooperation.

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

Characterization of dual-polarization LTE radio over a free-space optical turbulence channel.

Science.gov (United States)

Bohata, J; Zvanovec, S; Korinek, T; Mansour Abadi, M; Ghassemlooy, Z

2015-08-10

A dual polarization (DP) radio over a free-space optical (FSO) communication link using a long-term evolution (LTE) radio signal is proposed and analyzed under different turbulence channel conditions. Radio signal transmission over the DP FSO channel is experimentally verified by means of error vector magnitude (EVM) statistics. We demonstrate that such a system, employing a 64 quadrature amplitude modulation at the frequency bands of 800 MHz and 2.6 GHz, evinces reliability with LTE signal over the FSO channel is a potential solution for last-mile access or backbone networks, when using multiple-input multiple-output based DP signals.

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

Software defined network architecture based research on load balancing strategy

Science.gov (United States)

You, Xiaoqian; Wu, Yang

2018-05-01

As a new type network architecture, software defined network has the key idea of separating the control place of the network from the transmission plane, to manage and control the network in a concentrated way; in addition, the network interface is opened on the control layer and the data layer, so as to achieve programmable control of the network. Considering that only the single shortest route is taken into the calculation of traditional network data flow transmission, and congestion and resource consumption caused by excessive load of link circuits are ignored, a link circuit load based flow media business QoS gurantee system is proposed in this article to divide the flow in the network into ordinary data flow and QoS flow. In this way, it supervises the link circuit load with the controller so as to calculate reasonable route rapidly and issue the flow table to the exchanger, to finish rapid data transmission. In addition, it establishes a simulation platform to acquire optimized result through simulation experiment.

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

Decentralized Group Sparse Beamforming for Multi-Cloud Radio Access Networks

KAUST Repository

Dhifallah, Oussama Najeeb

2015-12-06

Recent studies on cloud-radio access networks (CRANs) assume the availability of a single processor (cloud) capable of managing the entire network performance; inter-cloud interference is treated as background noise. This paper considers the more practical scenario of the downlink of a CRAN formed by multiple clouds, where each cloud is connected to a cluster of multiple-antenna base stations (BSs) via high-capacity wireline backhaul links. The network is composed of several disjoint BSs\\' clusters, each serving a pre-known set of single-antenna users. To account for both inter- cloud and intra-cloud interference, the paper considers the problem of minimizing the total network power consumption subject to quality of service constraints, by jointly determining the set of active BSs connected to each cloud and the beamforming vectors of every user across the network. The paper solves the problem using Lagrangian duality theory through a dual decomposition approach, which decouples the problem into multiple and independent subproblems, the solution of which depends on the dual optimization problem. The solution then proceeds in updating the dual variables and the active set of BSs at each cloud iteratively. The proposed approach leads to a distributed implementation across the multiple clouds through a reasonable exchange of information between adjacent clouds. The paper further proposes a centralized solution to the problem. Simulation results suggest that the proposed algorithms significantly outperform the conventional per-cloud update solution, especially at high signal-to-interference-plus- noise ratio (SINR) target.

Crosstalk cancellation on linearly and circularly polarized communications satellite links

Science.gov (United States)

Overstreet, W. P.; Bostian, C. W.

1979-01-01

The paper discusses the cancellation network approach for reducing crosstalk caused by depolarization on a dual-polarized communications satellite link. If the characteristics of rain depolarization are sufficiently well known, the cancellation network can be designed in a way that reduces system complexity, the most important parameter being the phase of the cross-polarized signal. Relevant theoretical calculations and experimental data are presented. The simplicity of the cancellation system proposed makes it ideal for use with small domestic or private earth terminals.

Investigation of naphthofuran moiety as potential dual inhibitor against BACE-1 and GSK-3β: molecular dynamics simulations, binding energy, and network analysis to identify first-in-class dual inhibitors against Alzheimer's disease.

Science.gov (United States)

Kumar, Akhil; Srivastava, Gaurava; Srivastava, Swati; Verma, Seema; Negi, Arvind S; Sharma, Ashok

2017-08-01

BACE-1 and GSK-3β are potential therapeutic drug targets for Alzheimer's disease. Recently, both the targets received attention for designing dual inhibitors for Alzheimer's disease. Until now, only two-scaffold triazinone and curcumin have been reported as BACE-1 and GSK-3β dual inhibitors. Docking, molecular dynamics, clustering, binding energy, and network analysis of triazinone derivatives with BACE-1 and GSK-3β was performed to get molecular insight into the first reported dual inhibitor. Further, we designed and evaluated a naphthofuran series for its ability to inhibit BACE-1 and GSK-3β with the computational approaches. Docking study of naphthofuran series showed a good binding affinity towards both the targets. Molecular dynamics, binding energy, and network analysis were performed to compare their binding with the targets and amino acids responsible for binding. Naphthofuran series derivatives showed good interaction within the active site residues of both of the targets. Hydrogen bond occupancy and binding energy suggested strong binding with the targets. Dual-inhibitor binding was mostly governed by the hydrophobic interactions for both of the targets. Per residue energy decomposition and network analysis identified the key residues involved in the binding and inhibiting BACE-1 and GSK-3β. The results indicated that naphthofuran series derivative 11 may be a promising first-in-class dual inhibitor against BACE-1 and GSK-3β. This naphthofuran series may be further explored to design better dual inhibitors. Graphical abstract Naphthofuran derivative as a dual inhibitor for BACE-1 and GSK-3β.

Linking the dual system with higher education in Denmark

DEFF Research Database (Denmark)

Jørgensen, Christian Helms

2013-01-01

As more than half of every new generation of youth enter higher education in Den-mark the strength of the dual system of vocational education is becoming its weakness. Completing a programme in the dual system doesn’t give access to higher ed-ucation, and the system is increasingly seen as a ‘blind...... alley’. This weakness is closely related to the strengths of the dual system. The dual system is successful in giving direct and fast access to employment for the students, and this contributes to a very low rate of youth unemployment in Denmark. Students who complete a programme in the dual system......, become well integrated into the labour market, but at the same time they are diverted from higher education. This has lately put the question of hybrid qualifications on the agenda in Denmark....

Virtual network embedding in cross-domain network based on topology and resource attributes

Science.gov (United States)

Zhu, Lei; Zhang, Zhizhong; Feng, Linlin; Liu, Lilan

2018-03-01

Aiming at the network architecture ossification and the diversity of access technologies issues, this paper researches the cross-domain virtual network embedding algorithm. By analysing the topological attribute from the local and global perspective of nodes in the virtual network and the physical network, combined with the local network resource property, we rank the embedding priority of the nodes with PCA and TOPSIS methods. Besides, the link load distribution is considered. Above all, We proposed an cross-domain virtual network embedding algorithm based on topology and resource attributes. The simulation results depicts that our algorithm increases the acceptance rate of multi-domain virtual network requests, compared with the existing virtual network embedding algorithm.

Simultaneous surface and depth neural activity recording with graphene transistor-based dual-modality probes.

Science.gov (United States)

Du, Mingde; Xu, Xianchen; Yang, Long; Guo, Yichuan; Guan, Shouliang; Shi, Jidong; Wang, Jinfen; Fang, Ying

2018-05-15

Subdural surface and penetrating depth probes are widely applied to record neural activities from the cortical surface and intracortical locations of the brain, respectively. Simultaneous surface and depth neural activity recording is essential to understand the linkage between the two modalities. Here, we develop flexible dual-modality neural probes based on graphene transistors. The neural probes exhibit stable electrical performance even under 90° bending because of the excellent mechanical properties of graphene, and thus allow multi-site recording from the subdural surface of rat cortex. In addition, finite element analysis was carried out to investigate the mechanical interactions between probe and cortex tissue during intracortical implantation. Based on the simulation results, a sharp tip angle of π/6 was chosen to facilitate tissue penetration of the neural probes. Accordingly, the graphene transistor-based dual-modality neural probes have been successfully applied for simultaneous surface and depth recording of epileptiform activity of rat brain in vivo. Our results show that graphene transistor-based dual-modality neural probes can serve as a facile and versatile tool to study tempo-spatial patterns of neural activities. Copyright © 2018 Elsevier B.V. All rights reserved.

Integration and analysis of neighbor discovery and link quality estimation in wireless sensor networks.

Science.gov (United States)

Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Abd Razak, Shukor

2014-01-01

Network connectivity and link quality information are the fundamental requirements of wireless sensor network protocols to perform their desired functionality. Most of the existing discovery protocols have only focused on the neighbor discovery problem, while a few number of them provide an integrated neighbor search and link estimation. As these protocols require a careful parameter adjustment before network deployment, they cannot provide scalable and accurate network initialization in large-scale dense wireless sensor networks with random topology. Furthermore, performance of these protocols has not entirely been evaluated yet. In this paper, we perform a comprehensive simulation study on the efficiency of employing adaptive protocols compared to the existing nonadaptive protocols for initializing sensor networks with random topology. In this regard, we propose adaptive network initialization protocols which integrate the initial neighbor discovery with link quality estimation process to initialize large-scale dense wireless sensor networks without requiring any parameter adjustment before network deployment. To the best of our knowledge, this work is the first attempt to provide a detailed simulation study on the performance of integrated neighbor discovery and link quality estimation protocols for initializing sensor networks. This study can help system designers to determine the most appropriate approach for different applications.

Integration and Analysis of Neighbor Discovery and Link Quality Estimation in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Marjan Radi

2014-01-01

Full Text Available Network connectivity and link quality information are the fundamental requirements of wireless sensor network protocols to perform their desired functionality. Most of the existing discovery protocols have only focused on the neighbor discovery problem, while a few number of them provide an integrated neighbor search and link estimation. As these protocols require a careful parameter adjustment before network deployment, they cannot provide scalable and accurate network initialization in large-scale dense wireless sensor networks with random topology. Furthermore, performance of these protocols has not entirely been evaluated yet. In this paper, we perform a comprehensive simulation study on the efficiency of employing adaptive protocols compared to the existing nonadaptive protocols for initializing sensor networks with random topology. In this regard, we propose adaptive network initialization protocols which integrate the initial neighbor discovery with link quality estimation process to initialize large-scale dense wireless sensor networks without requiring any parameter adjustment before network deployment. To the best of our knowledge, this work is the first attempt to provide a detailed simulation study on the performance of integrated neighbor discovery and link quality estimation protocols for initializing sensor networks. This study can help system designers to determine the most appropriate approach for different applications.

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.

Integrated service resource reservation using queueing networks theory

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Iversen, Villy Bæk; Kardaras, Georgios

2014-01-01

This study analyses multi-server multi-service queueing networks with service protection. To guarantee each service a certain quality-of-service and at the same time ensure high utilisation of servers, a minimum capacity is reserved each service. In addition, all services share the remaining non...

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

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 systems approach identifies networks and genes linking sleep and stress: implications for neuropsychiatric disorders.

Science.gov (United States)

Jiang, Peng; Scarpa, Joseph R; Fitzpatrick, Karrie; Losic, Bojan; Gao, Vance D; Hao, Ke; Summa, Keith C; Yang, He S; Zhang, Bin; Allada, Ravi; Vitaterna, Martha H; Turek, Fred W; Kasarskis, Andrew

2015-05-05

Sleep dysfunction and stress susceptibility are comorbid complex traits that often precede and predispose patients to a variety of neuropsychiatric diseases. Here, we demonstrate multilevel organizations of genetic landscape, candidate genes, and molecular networks associated with 328 stress and sleep traits in a chronically stressed population of 338 (C57BL/6J × A/J) F2 mice. We constructed striatal gene co-expression networks, revealing functionally and cell-type-specific gene co-regulations important for stress and sleep. Using a composite ranking system, we identified network modules most relevant for 15 independent phenotypic categories, highlighting a mitochondria/synaptic module that links sleep and stress. The key network regulators of this module are overrepresented with genes implicated in neuropsychiatric diseases. Our work suggests that the interplay among sleep, stress, and neuropathology emerges from genetic influences on gene expression and their collective organization through complex molecular networks, providing a framework for interrogating the mechanisms underlying sleep, stress susceptibility, and related neuropsychiatric disorders. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

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

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.

Resilient Disaster Network Based on Software Defined Cognitive Wireless Network Technology

Directory of Open Access Journals (Sweden)

Goshi Sato

2015-01-01

Full Text Available In order to temporally recover the information network infrastructure in disaster areas from the Great East Japan Earthquake in 2011, various wireless network technologies such as satellite IP network, 3G, and Wi-Fi were effectively used. However, since those wireless networks are individually introduced and installed but not totally integrated, some of networks were congested due to the sudden network traffic generation and unbalanced traffic distribution, and eventually the total network could not effectively function. In this paper, we propose a disaster resilient network which integrates various wireless networks into a cognitive wireless network that users can use as an access network to the Internet at the serious disaster occurrence. We designed and developed the disaster resilient network based on software defined network (SDN technology to automatically select the best network link and route among the possible access networks to the Internet by periodically monitoring their network states and evaluate those using extended AHP method. In order to verify the usefulness of our proposed system, a prototype system is constructed and its performance is evaluated.

Nash Equilibrium of an Energy Saving Strategy with Dual Rate Transmission in Wireless Regional Area Network

Directory of Open Access Journals (Sweden)

Zhanqiang Huo

2017-01-01

Full Text Available Wireless regional area network (WRAN adopts centralized network architecture and is currently one of the most typical cognitive radio networks. In order to reduce the energy consumption of the communication networks with the constraint of spectrum resource utilization, a working sleep mechanism is introduced into the base station (BS, and a novel energy saving strategy with dual rate transmission is proposed. Combining the multiple-vacation queue and priority queue, using the quasi-birth-death process and the matrix-geometric solution method, we assess the average latency and the forced termination probability of secondary user packets, as well as the energy saving ratio and the channel utilization of system. Based on the revenue-expenditure structure, a profit function is built, and then the Nash equilibrium behavior and the socially optimal behavior are investigated. With the help of the particle swarm optimization, an intelligent optimization algorithm to search the socially optimal arrival rate of secondary user packets is presented. In order to unify the arrival rates of secondary user packets with Nash equilibrium and social optimization, a reasonable pricing policy is formulated. In addition, system experiments are carried out to verify the effectiveness of the energy saving strategy and the rationality of the pricing policy.

Design of a search and rescue terminal based on the dual-mode satellite and CDMA network

Science.gov (United States)

Zhao, Junping; Zhang, Xuan; Zheng, Bing; Zhou, Yubin; Song, Hao; Song, Wei; Zhang, Meikui; Liu, Tongze; Zhou, Li

2010-12-01

The current goal is to create a set of portable terminals with GPS/BD2 dual-mode satellite positioning, vital signs monitoring and wireless transmission functions. The terminal depends on an ARM processor to collect and combine data related to vital signs and GPS/BD2 location information, and sends the message to headquarters through the military CDMA network. It integrates multiple functions as a whole. The satellite positioning and wireless transmission capabilities are integrated into the motherboard, and the vital signs sensors used in the form of belts communicate with the board through Bluetooth. It can be adjusted according to the headquarters' instructions. This kind of device is of great practical significance for operations during disaster relief, search and rescue of the wounded in wartime, non-war military operations and other special circumstances.

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.

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.

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.

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

Quantum dual signature scheme based on coherent states with entanglement swapping

International Nuclear Information System (INIS)

Liu Jia-Li; Shi Rong-Hua; Shi Jin-Jing; Lv Ge-Li; Guo Ying

2016-01-01

A novel quantum dual signature scheme, which combines two signed messages expected to be sent to two diverse receivers Bob and Charlie, is designed by applying entanglement swapping with coherent states. The signatory Alice signs two different messages with unitary operations (corresponding to the secret keys) and applies entanglement swapping to generate a quantum dual signature. The dual signature is firstly sent to the verifier Bob who extracts and verifies the signature of one message and transmits the rest of the dual signature to the verifier Charlie who verifies the signature of the other message. The transmission of the dual signature is realized with quantum teleportation of coherent states. The analysis shows that the security of secret keys and the security criteria of the signature protocol can be greatly guaranteed. An extensional multi-party quantum dual signature scheme which considers the case with more than three participants is also proposed in this paper and this scheme can remain secure. The proposed schemes are completely suited for the quantum communication network including multiple participants and can be applied to the e-commerce system which requires a secure payment among the customer, business and bank. (paper)

Multi-Functional Fibre-Optic Microwave Links

DEFF Research Database (Denmark)

Gliese, Ulrik Bo

1998-01-01

The multi-functionality of microwave links based on remote heterodyne detection of signals from a dual-frequency laser transmitter is discussed and experimentally demonstrated in this paper. Typically, direct detection in conjunction with optical intensity modulation is used to implement fibre......-optic microwave links. The resulting links are inherently transparent and mainly used for signal transmission. As opposed to direct detection links, remote heterodyne detection links can directly perform functionalities such as modulation, frequency conversion, and transparent signal recovery in addition...

Location-based restoration mechanism for multi-domain GMPLS networks

DEFF Research Database (Denmark)

Manolova, Anna Vasileva; Calle, Eusibi; Ruepp, Sarah Renée

2009-01-01

In this paper we propose and evaluate the efficiency of a location-based restoration mechanism in a dynamic multi-domain GMPLS network. We focus on inter-domain link failures and utilize the correlation between the actual position of a failed link along the path with the applied restoration...

Switched diversity strategies for dual-hop relaying systems

KAUST Repository

Gaaloul, Fakhreddine

2011-04-29

This paper investigates the effect of different switched diversity configurations on the implementation complexity and achieved performance of dual-hop amplify-and-forward (AF) relaying networks. A low-complexity model of the relay station is adopted, wherein single-input single-output antenna configuration is employed. Each of the transmitter and the receiver however employs multiple antennas to improve the overall link performance. Single-phase and two-phase based receive switching strategies are investigated assuming optimum first hop signal-to-noise ratio (SNR). Moreover, the simple scheme in which the switched diversity is applied independently over the two hops is studied using tight upper bounds. Thorough performance comparisons and switching thresholds optimization for the aforementioned strategies are presented. Simulation results are also provided to validate the mathematical development and to verify the numerical computations.

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.

High levels of time contraction in young children in dual tasks are related to their limited attention capacities.

Science.gov (United States)

Hallez, Quentin; Droit-Volet, Sylvie

2017-09-01

Numerous studies have shown that durations are judged shorter in a dual-task condition than in a simple-task condition. The resource-based theory of time perception suggests that this is due to the processing of temporal information, which is a demanding cognitive task that consumes limited attention resources. Our study investigated whether this time contraction in a dual-task condition is greater in younger children and, if so, whether this is specifically related to their limited attention capacities. Children aged 5-7years were given a temporal reproduction task in a simple-task condition and a dual-task condition. In addition, different neuropsychological tests were used to assess not only their attention capacities but also their capacities in terms of working memory and information processing speed. The results showed a shortening of perceived time in the dual task compared with the simple task, and this increased as age decreased. The extent of this shortening effect was directly linked to younger children's limited attentional capacities; the lower their attentional capacities, the greater the time contraction. This study demonstrated that children's errors in time judgments are linked to their cognitive capacities rather than to capacities that are specific to time. Copyright © 2017 Elsevier Inc. All rights reserved.

76 FR 19466 - Masco Builder Cabinet Group Including On-Site Leased Workers From Reserves Network, Reliable...

Science.gov (United States)

2011-04-07

... Builder Cabinet Group Including On-Site Leased Workers From Reserves Network, Reliable Staffing, and Third Dimension Waverly, OH; Masco Builder Cabinet Group Including On-Site Leased Workers From Reserves Network... Group including on-site leased workers from Reserves Network, Jackson, Ohio. The workers produce...

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

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.

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

Science.gov (United States)

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

2017-01-01

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

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)

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

Graph Regularized Meta-path Based Transductive Regression in Heterogeneous Information Network.

Science.gov (United States)

Wan, Mengting; Ouyang, Yunbo; Kaplan, Lance; Han, Jiawei

2015-01-01

A number of real-world networks are heterogeneous information networks, which are composed of different types of nodes and links. Numerical prediction in heterogeneous information networks is a challenging but significant area because network based information for unlabeled objects is usually limited to make precise estimations. In this paper, we consider a graph regularized meta-path based transductive regression model ( Grempt ), which combines the principal philosophies of typical graph-based transductive classification methods and transductive regression models designed for homogeneous networks. The computation of our method is time and space efficient and the precision of our model can be verified by numerical experiments.

A similarity based agglomerative clustering algorithm in networks

Science.gov (United States)

Liu, Zhiyuan; Wang, Xiujuan; Ma, Yinghong

2018-04-01

The detection of clusters is benefit for understanding the organizations and functions of networks. Clusters, or communities, are usually groups of nodes densely interconnected but sparsely linked with any other clusters. To identify communities, an efficient and effective community agglomerative algorithm based on node similarity is proposed. The proposed method initially calculates similarities between each pair of nodes, and form pre-partitions according to the principle that each node is in the same community as its most similar neighbor. After that, check each partition whether it satisfies community criterion. For the pre-partitions who do not satisfy, incorporate them with others that having the biggest attraction until there are no changes. To measure the attraction ability of a partition, we propose an attraction index that based on the linked node's importance in networks. Therefore, our proposed method can better exploit the nodes' properties and network's structure. To test the performance of our algorithm, both synthetic and empirical networks ranging in different scales are tested. Simulation results show that the proposed algorithm can obtain superior clustering results compared with six other widely used community detection algorithms.

Measuring urban rainfall using microwave links from commercial cellular communication networks

NARCIS (Netherlands)

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

2011-01-01

The estimation of rainfall using commercial microwave links is a new and promising measurement technique. Commercial link networks cover large parts of the land surface of the earth and have a high density, particularly in urban areas. Rainfall attenuates the electromagnetic signals transmitted

Machine learning-based dual-energy CT parametric mapping.

Science.gov (United States)

Su, Kuan-Hao; Kuo, Jung-Wen; Jordan, David W; Van Hedent, Steven; Klahr, Paul; Wei, Zhouping; Al Helo, Rose; Liang, Fan; Qian, Pengjiang; Pereira, Gisele C; Rassouli, Negin; Gilkeson, Robert C; Traughber, Bryan J; Cheng, Chee-Wai; Muzic, Raymond F

2018-05-22

The aim is to develop and evaluate machine learning methods for generating quantitative parametric maps of effective atomic number (Z_eff), relative electron density (ρ_e), mean excitation energy (I_x), and relative stopping power (RSP) from clinical dual-energy CT data. The maps could be used for material identification and radiation dose calculation. Machine learning methods of historical centroid (HC), random forest (RF), and artificial neural networks (ANN) were used to learn the relationship between dual-energy CT input data and ideal output parametric maps calculated for phantoms from the known compositions of 13 tissue substitutes. After training and model selection steps, the machine learning predictors were used to generate parametric maps from independent phantom and patient input data. Precision and accuracy were evaluated using the ideal maps. This process was repeated for a range of exposure doses, and performance was compared to that of the clinically-used dual-energy, physics-based method which served as the reference. The machine learning methods generated more accurate and precise parametric maps than those obtained using the reference method. Their performance advantage was particularly evident when using data from the lowest exposure, one-fifth of a typical clinical abdomen CT acquisition. The RF method achieved the greatest accuracy. In comparison, the ANN method was only 1% less accurate but had much better computational efficiency than RF, being able to produce parametric maps in 15 seconds. Machine learning methods outperformed the reference method in terms of accuracy and noise tolerance when generating parametric maps, encouraging further exploration of the techniques. Among the methods we evaluated, ANN is the most suitable for clinical use due to its combination of accuracy, excellent low-noise performance, and computational efficiency. . © 2018 Institute of Physics and Engineering in

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

DEFF Research Database (Denmark)

Gaiarin, Simone; Pang, Xiaodan; Ozolins, Oskars

2016-01-01

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

Developing an effective adaptive monitoring network to support integrated coastal management in a multiuser nature reserve

Directory of Open Access Journals (Sweden)

Pim Vugteveen

2015-03-01

Full Text Available We elaborate the necessary conceptual and strategic elements for developing an effective adaptive monitoring network to support Integrated Coastal Management (ICM in a multiuser nature reserve in the Dutch Wadden Sea Region. We discuss quality criteria and enabling actions essential to accomplish and sustain monitoring excellence to support ICM. The Wadden Sea Long-Term Ecosystem Research project (WaLTER was initiated to develop an adaptive monitoring network and online data portal to better understand and support ICM in the Dutch Wadden Sea Region. Our comprehensive approach integrates ecological and socioeconomic data and links research-driven and policy-driven monitoring for system analysis using indicators of pressures, state, benefits, and responses. The approach and concepts we elaborated are transferable to other coastal regions to accomplish ICM in complex social-ecological systems in which scientists, multisectoral stakeholders, resource managers, and governmental representatives seek to balance long-term ecological, economic, and social objectives within natural limits.

Time of arrival based location estimation for cooperative relay networks

KAUST Repository

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

2010-01-01

In this paper, we investigate the performance of a cooperative relay network performing location estimation through time of arrival (TOA). We derive Cramer-Rao lower bound (CRLB) for the location estimates using the relay network. The analysis is extended to obtain average CRLB considering the signal fluctuations in both relay and direct links. The effects of the channel fading of both relay and direct links and amplification factor and location of the relay node on average CRLB are investigated. Simulation results show that the channel fading of both relay and direct links and amplification factor and location of relay node affect the accuracy of TOA based location estimation. ©2010 IEEE.

Time of arrival based location estimation for cooperative relay networks

KAUST Repository

Çelebi, Hasari Burak

2010-09-01

In this paper, we investigate the performance of a cooperative relay network performing location estimation through time of arrival (TOA). We derive Cramer-Rao lower bound (CRLB) for the location estimates using the relay network. The analysis is extended to obtain average CRLB considering the signal fluctuations in both relay and direct links. The effects of the channel fading of both relay and direct links and amplification factor and location of the relay node on average CRLB are investigated. Simulation results show that the channel fading of both relay and direct links and amplification factor and location of relay node affect the accuracy of TOA based location estimation. ©2010 IEEE.

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

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

Link importance incorporated failure probability measuring solution for multicast light-trees in elastic optical networks

Science.gov (United States)

Li, Xin; Zhang, Lu; Tang, Ying; Huang, Shanguo

2018-03-01

The light-tree-based optical multicasting (LT-OM) scheme provides a spectrum- and energy-efficient method to accommodate emerging multicast services. Some studies focus on the survivability technologies for LTs against a fixed number of link failures, such as single-link failure. However, a few studies involve failure probability constraints when building LTs. It is worth noting that each link of an LT plays different important roles under failure scenarios. When calculating the failure probability of an LT, the importance of its every link should be considered. We design a link importance incorporated failure probability measuring solution (LIFPMS) for multicast LTs under independent failure model and shared risk link group failure model. Based on the LIFPMS, we put forward the minimum failure probability (MFP) problem for the LT-OM scheme. Heuristic approaches are developed to address the MFP problem in elastic optical networks. Numerical results show that the LIFPMS provides an accurate metric for calculating the failure probability of multicast LTs and enhances the reliability of the LT-OM scheme while accommodating multicast services.

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.

Improving the Reliability of Optimised Link State Routing in a Smart Grid Neighbour Area Network based Wireless Mesh Network Using Multiple Metrics

Directory of Open Access Journals (Sweden)

Yakubu Tsado

2017-02-01

Full Text Available Reliable communication is the backbone of advanced metering infrastructure (AMI. Within the AMI, the neighbourhood area network (NAN transports a multitude of traffic, each with unique requirements. In order to deliver an acceptable level of reliability and latency, the underlying network, such as the wireless mesh network(WMN, must provide or guarantee the quality-of-service (QoS level required by the respective application traffic. Existing WMN routing protocols, such as optimised link state routing (OLSR, typically utilise a single metric and do not consider the requirements of individual traffic; hence, packets are delivered on a best-effort basis. This paper presents a QoS-aware WMN routing technique that employs multiple metrics in OLSR optimal path selection for AMI applications. The problems arising from this approach are non deterministic polynomial time (NP-complete in nature, which were solved through the combined use of the analytical hierarchy process (AHP algorithm and pruning techniques. For smart meters transmitting Internet Protocol (IP packets of varying sizes at different intervals, the proposed technique considers the constraints of NAN and the applications’ traffic characteristics. The technique was developed by combining multiple OLSR path selection metrics with the AHP algorithminns-2. Compared with the conventional link metric in OLSR, the results show improvements of about 23% and 45% in latency and Packet Delivery Ratio (PDR, respectively, in a 25-node grid NAN.

Restoration in multi-domain GMPLS-based networks

DEFF Research Database (Denmark)

Manolova, Anna; Ruepp, Sarah Renée; Dittmann, Lars

2011-01-01

In this paper, we evaluate the efficiency of using restoration mechanisms in a dynamic multi-domain GMPLS network. Major challenges and solutions are introduced and two well-known restoration schemes (End-to-End and Local-to-End) are evaluated. Additionally, new restoration mechanisms are introdu......In this paper, we evaluate the efficiency of using restoration mechanisms in a dynamic multi-domain GMPLS network. Major challenges and solutions are introduced and two well-known restoration schemes (End-to-End and Local-to-End) are evaluated. Additionally, new restoration mechanisms...... are introduced: one based on the position of a failed link, called Location-Based, and another based on minimizing the additional resources consumed during restoration, called Shortest-New. A complete set of simulations in different network scenarios show where each mechanism is more efficient in terms, such as...

The Linked Dual Representation model of vocal perception and production

Directory of Open Access Journals (Sweden)

Sean eHutchins

2013-11-01

Full Text Available The voice is one of the most important media for communication, yet there is a wide range of abilities in both the perception and production of the voice. In this article, we review this range of abilities, focusing on pitch accuracy as a particularly informative case, and look at the factors underlying these abilities. Several classes of models have been posited describing the relationship between vocal perception and production, and we review the evidence for and against each class of model. We look at how the voice is different from other musical instruments and review evidence about both the association and the dissociation between vocal perception and production abilities. Finally, we introduce the Linked Dual Representation model, a new approach which can account for the broad patterns in prior findings, including trends in the data which might seem to be countervailing. We discuss how this model interacts with higher-order cognition and examine its predictions about several aspects of vocal perception and production.

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

(successfully) with the numerical simulations. Based on it, we estimated analytically the convergence of the ICP solution (as a function of the number of contagion histories observed), and found it to be in perfect agreement with simulation results. Finally, the most important insight we obtained is that SICP and WICP are have quite different properties: if one in interested only in the operational aspect of predicting how contagion will spread, the links which are most difficult to decide about are the least influential on contagion dynamics. In other words, the parts of the network which are harder to reconstruct are also least important for predicting the contagion dynamics, up to the point where a (large) constant number of false links in the network (i.e. non-convergence of the network reconstruction procedure) implies a zero rate of the node contagion prediction errors (perfect convergence of the WICP). Thus, the contagion prediction problem (WICP) difficulty is very different from the network reconstruction problem (SICP), in as far as links which are difficult to reconstruct are quite harmless in terms of contagion prediction capability (WICP).

A random spatial network model based on elementary postulates

Science.gov (United States)

Karlinger, Michael R.; Troutman, Brent M.

1989-01-01

A model for generating random spatial networks that is based on elementary postulates comparable to those of the random topology model is proposed. In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. For a preliminary model evaluation, scale-dependent network characteristics, such as geometric diameter and link length properties, and topologic characteristics, such as bifurcation ratio, are computed for sets of drainage networks generated on square and rectangular grids. Statistics of the bifurcation and length ratios fall within the range of values reported for natural drainage networks, but geometric diameters tend to be relatively longer than those for natural networks.

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

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

Detection of Hepatitis C core antibody by dual-affinity yeast chimera and smartphone-based electrochemical sensing.

Science.gov (United States)

Aronoff-Spencer, Eliah; Venkatesh, A G; Sun, Alex; Brickner, Howard; Looney, David; Hall, Drew A

2016-12-15

Yeast cell lines were genetically engineered to display Hepatitis C virus (HCV) core antigen linked to gold binding peptide (GBP) as a dual-affinity biobrick chimera. These multifunctional yeast cells adhere to the gold sensor surface while simultaneously acting as a "renewable" capture reagent for anti-HCV core antibody. This streamlined functionalization and detection strategy removes the need for traditional purification and immobilization techniques. With this biobrick construct, both optical and electrochemical immunoassays were developed. The optical immunoassays demonstrated detection of anti-HCV core antibody down to 12.3pM concentrations while the electrochemical assay demonstrated higher binding constants and dynamic range. The electrochemical format and a custom, low-cost smartphone-based potentiostat ($20 USD) yielded comparable results to assays performed on a state-of-the-art electrochemical workstation. We propose this combination of synthetic biology and scalable, point-of-care sensing has potential to provide low-cost, cutting edge diagnostic capability for many pathogens in a variety of settings. Copyright © 2016 Elsevier B.V. All rights reserved.

Quantum dual signature scheme based on coherent states with entanglement swapping

Science.gov (United States)

Liu, Jia-Li; Shi, Rong-Hua; Shi, Jin-Jing; Lv, Ge-Li; Guo, Ying

2016-08-01

A novel quantum dual signature scheme, which combines two signed messages expected to be sent to two diverse receivers Bob and Charlie, is designed by applying entanglement swapping with coherent states. The signatory Alice signs two different messages with unitary operations (corresponding to the secret keys) and applies entanglement swapping to generate a quantum dual signature. The dual signature is firstly sent to the verifier Bob who extracts and verifies the signature of one message and transmits the rest of the dual signature to the verifier Charlie who verifies the signature of the other message. The transmission of the dual signature is realized with quantum teleportation of coherent states. The analysis shows that the security of secret keys and the security criteria of the signature protocol can be greatly guaranteed. An extensional multi-party quantum dual signature scheme which considers the case with more than three participants is also proposed in this paper and this scheme can remain secure. The proposed schemes are completely suited for the quantum communication network including multiple participants and can be applied to the e-commerce system which requires a secure payment among the customer, business and bank. Project supported by the National Natural Science Foundation of China (Grant Nos. 61272495, 61379153, and 61401519) and the Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20130162110012).

The radio-on-fiber-wavelength-division-multiplexed-passive-optical network (WDM-RoF-PON) for wireless and wire layout with linearly-polarized dual-wavelength fiber laser and carrier reusing

Science.gov (United States)

Ji, Wei; Chang, Jun

2013-07-01

In this paper, we design a WDM-RoF-PON based on linearly-polarized dual-wavelength fiber laser and CSRZ-DPSK, which can achieve wire-line and wireless access synchronously. With the CSRZ-DPSK modulation, the wireless access in ONU can save RF source and the frequency of radio carrier can be controlled by OLT. The dual-wavelength fiber laser is the union light source of WDM-PON with polarization multiplexing. By the RSOA and downstream light source reusing, the ONU can save omit laser source and makes the WDM-PON to be colorless. The networking has the credible transmission property, including wireless access and fiber transmission. The networking also has excellent covering range.

A novel time series link prediction method: Learning automata approach

Science.gov (United States)

Moradabadi, Behnaz; Meybodi, Mohammad Reza

2017-09-01

Link prediction is a main social network challenge that uses the network structure to predict future links. The common link prediction approaches to predict hidden links use a static graph representation where a snapshot of the network is analyzed to find hidden or future links. For example, similarity metric based link predictions are a common traditional approach that calculates the similarity metric for each non-connected link and sort the links based on their similarity metrics and label the links with higher similarity scores as the future links. Because people activities in social networks are dynamic and uncertainty, and the structure of the networks changes over time, using deterministic graphs for modeling and analysis of the social network may not be appropriate. In the time-series link prediction problem, the time series link occurrences are used to predict the future links In this paper, we propose a new time series link prediction based on learning automata. In the proposed algorithm for each link that must be predicted there is one learning automaton and each learning automaton tries to predict the existence or non-existence of the corresponding link. To predict the link occurrence in time T, there is a chain consists of stages 1 through T - 1 and the learning automaton passes from these stages to learn the existence or non-existence of the corresponding link. Our preliminary link prediction experiments with co-authorship and email networks have provided satisfactory results when time series link occurrences are considered.

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.

Start-up story: IP and access challenges: introducing RedLink Network – a new community-based registry to create efficiencies for libraries

Directory of Open Access Journals (Sweden)

Kent Anderson

2017-03-01

Full Text Available A major pain point for librarians and publishers is the work involved in keeping authentication credentials (IP addresses, Shibboleth and link resolvers current and ensuring their accuracy. Yet, the infrastructure of the internet has solved similar problems like this before. RedLink Network is a free, community-driven platform, run by a public benefit company. It allows librarians to broadcast their access credentials and branding, track uptake across their publishers and platforms, and solve access issues collaboratively. It also enables mapping of hierarchies (consortia and subsidiaries. This article describes what inspired the creation of RedLink Network, how it benefits librarians and publishers and, ultimately, how it can help ensure access for students, researchers and knowledge workers.

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.

Change detection in multitemporal synthetic aperture radar images using dual-channel convolutional neural network

Science.gov (United States)

Liu, Tao; Li, Ying; Cao, Ying; Shen, Qiang

2017-10-01

This paper proposes a model of dual-channel convolutional neural network (CNN) that is designed for change detection in SAR images, in an effort to acquire higher detection accuracy and lower misclassification rate. This network model contains two parallel CNN channels, which can extract deep features from two multitemporal SAR images. For comparison and validation, the proposed method is tested along with other change detection algorithms on both simulated SAR images and real-world SAR images captured by different sensors. The experimental results demonstrate that the presented method outperforms the state-of-the-art techniques by a considerable margin.

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

Science.gov (United States)

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

2013-09-01

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

Network connectivity value.

Science.gov (United States)

Dragicevic, Arnaud; Boulanger, Vincent; Bruciamacchie, Max; Chauchard, Sandrine; Dupouey, Jean-Luc; Stenger, Anne

2017-04-21

In order to unveil the value of network connectivity, we formalize the construction of ecological networks in forest environments as an optimal control dynamic graph-theoretic problem. The network is based on a set of bioreserves and patches linked by ecological corridors. The node dynamics, built upon the consensus protocol, form a time evolutive Mahalanobis distance weighted by the opportunity costs of timber production. We consider a case of complete graph, where the ecological network is fully connected, and a case of incomplete graph, where the ecological network is partially connected. The results show that the network equilibrium depends on the size of the reception zone, while the network connectivity depends on the environmental compatibility between the ecological areas. Through shadow prices, we find that securing connectivity in partially connected networks is more expensive than in fully connected networks, but should be undertaken when the opportunity costs are significant. Copyright © 2017 Elsevier Ltd. All rights reserved.

Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks

Science.gov (United States)

Din, Der-Rong; Huang, Jen-Shen

2014-03-01

As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100% protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.

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.

Reading, writing, and reserve: Literacy activities are linked to hippocampal volume and memory in multiple sclerosis.

Science.gov (United States)

Sumowski, James F; Rocca, Maria A; Leavitt, Victoria M; Riccitelli, Gianna; Meani, Alessandro; Comi, Giancarlo; Filippi, Massimo

2016-10-01

Engagement in cognitive leisure activities during early adulthood has been linked to preserved memory and larger hippocampal volume in persons with multiple sclerosis (MS). To investigate which specific types of cognitive leisure activities contribute to hippocampal volume and memory. We investigated links between three types of cognitive activities (Reading-Writing, Art-Music, Games-Hobbies) and (a) hippocampal volume within independent samples of Italian (n=187) and American (n=55) MS patients and (b) memory in subsamples of Italian (n=97) and American (n=53) patients. Reading-Writing was the only predictor of hippocampal volume (rp=.204, p=.002), and the best predictor of memory (rp=.288, p=.001). Findings inform the development of targeted evidence-based enrichment programs aiming to bolster reserve against memory decline. © The Author(s), 2016.

The Prohibitive Link between Position-based Routing and Planarity

Directory of Open Access Journals (Sweden)

David Cairns

2013-12-01

Full Text Available Position-based routing is touted as an ideal routing strategy for resource-constrained wireless networks. One persistent barrier to adoption is due to its recovery phase, where messages are forwarded according to leftor right-hand rule (LHR. This is often referred to as face-routing. In this paper we investigate the limits of LHR with respect to planarity.We show that the gap between non-planarity and successful delivery is a single link within a single configuration. Our work begins with an analysis to enumerate all node configurations that cause intersections in the unit-disc graph. We find that left-hand rule is able to recover from all but a single case, the ‘umbrella’ configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the ‘bad’ links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of CLDP and GDSTR.

Probabilistic dual heuristic programming-based adaptive critic

Science.gov (United States)

Herzallah, Randa

2010-02-01

Adaptive critic (AC) methods have common roots as generalisations of dynamic programming for neural reinforcement learning approaches. Since they approximate the dynamic programming solutions, they are potentially suitable for learning in noisy, non-linear and non-stationary environments. In this study, a novel probabilistic dual heuristic programming (DHP)-based AC controller is proposed. Distinct to current approaches, the proposed probabilistic (DHP) AC method takes uncertainties of forward model and inverse controller into consideration. Therefore, it is suitable for deterministic and stochastic control problems characterised by functional uncertainty. Theoretical development of the proposed method is validated by analytically evaluating the correct value of the cost function which satisfies the Bellman equation in a linear quadratic control problem. The target value of the probabilistic critic network is then calculated and shown to be equal to the analytically derived correct value. Full derivation of the Riccati solution for this non-standard stochastic linear quadratic control problem is also provided. Moreover, the performance of the proposed probabilistic controller is demonstrated on linear and non-linear control examples.

Carbon dots based dual-emission silica nanoparticles as ratiometric fluorescent probe for nitrite determination in food samples.

Science.gov (United States)

Xiang, Guoqiang; Wang, Yule; Zhang, Heng; Fan, Huanhuan; Fan, Lu; He, Lijun; Jiang, Xiuming; Zhao, Wenjie

2018-09-15

In this work, a simple and effective strategy for designing a ratiometric fluorescent nanosensor was described. A carbon dots (CDs) based dual-emission nanosensor for nitrite was prepared by coating the CDs on to dye-doped silica nanoparticles. Dual-emission silica nanoparticles fluorescence was quenched in sulfuric acid using potassium bromate (KBrO 3 ). The nitrite present catalyzed the KBrO 3 oxidation, resulting in ratiometric fluorescence response of the dual-emission silica nanoparticles. Several important parameters affecting the performance of the nanosensor were investigated. Under optimized conditions, the limit of detection was 1.0 ng mL -1 and the linear range 10-160 ng mL -1 . Furthermore, the sensor was suitable for nitrite determination in different food samples. Copyright © 2018 Elsevier Ltd. All rights reserved.

Link-based quantitative methods to identify differentially coexpressed genes and gene Pairs

Directory of Open Access Journals (Sweden)

Ye Zhi-Qiang

2011-08-01

Full Text Available Abstract Background Differential coexpression analysis (DCEA is increasingly used for investigating the global transcriptional mechanisms underlying phenotypic changes. Current DCEA methods mostly adopt a gene connectivity-based strategy to estimate differential coexpression, which is characterized by comparing the numbers of gene neighbors in different coexpression networks. Although it simplifies the calculation, this strategy mixes up the identities of different coexpression neighbors of a gene, and fails to differentiate significant differential coexpression changes from those trivial ones. Especially, the correlation-reversal is easily missed although it probably indicates remarkable biological significance. Results We developed two link-based quantitative methods, DCp and DCe, to identify differentially coexpressed genes and gene pairs (links. Bearing the uniqueness of exploiting the quantitative coexpression change of each gene pair in the coexpression networks, both methods proved to be superior to currently popular methods in simulation studies. Re-mining of a publicly available type 2 diabetes (T2D expression dataset from the perspective of differential coexpression analysis led to additional discoveries than those from differential expression analysis. Conclusions This work pointed out the critical weakness of current popular DCEA methods, and proposed two link-based DCEA algorithms that will make contribution to the development of DCEA and help extend it to a broader spectrum.

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)

Performance of local information-based link prediction: a sampling perspective

Science.gov (United States)

Zhao, Jichang; Feng, Xu; Dong, Li; Liang, Xiao; Xu, Ke

2012-08-01

Link prediction is pervasively employed to uncover the missing links in the snapshots of real-world networks, which are usually obtained through different kinds of sampling methods. In the previous literature, in order to evaluate the performance of the prediction, known edges in the sampled snapshot are divided into the training set and the probe set randomly, without considering the underlying sampling approaches. However, different sampling methods might lead to different missing links, especially for the biased ways. For this reason, random partition-based evaluation of performance is no longer convincing if we take the sampling method into account. In this paper, we try to re-evaluate the performance of local information-based link predictions through sampling method governed division of the training set and the probe set. It is interesting that we find that for different sampling methods, each prediction approach performs unevenly. Moreover, most of these predictions perform weakly when the sampling method is biased, which indicates that the performance of these methods might have been overestimated in the prior works.

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

An Improved Ensemble of Random Vector Functional Link Networks Based on Particle Swarm Optimization with Double Optimization Strategy.

Science.gov (United States)

Ling, Qing-Hua; Song, Yu-Qing; Han, Fei; Yang, Dan; Huang, De-Shuang

2016-01-01

For ensemble learning, how to select and combine the candidate classifiers are two key issues which influence the performance of the ensemble system dramatically. Random vector functional link networks (RVFL) without direct input-to-output links is one of suitable base-classifiers for ensemble systems because of its fast learning speed, simple structure and good generalization performance. In this paper, to obtain a more compact ensemble system with improved convergence performance, an improved ensemble of RVFL based on attractive and repulsive particle swarm optimization (ARPSO) with double optimization strategy is proposed. In the proposed method, ARPSO is applied to select and combine the candidate RVFL. As for using ARPSO to select the optimal base RVFL, ARPSO considers both the convergence accuracy on the validation data and the diversity of the candidate ensemble system to build the RVFL ensembles. In the process of combining RVFL, the ensemble weights corresponding to the base RVFL are initialized by the minimum norm least-square method and then further optimized by ARPSO. Finally, a few redundant RVFL is pruned, and thus the more compact ensemble of RVFL is obtained. Moreover, in this paper, theoretical analysis and justification on how to prune the base classifiers on classification problem is presented, and a simple and practically feasible strategy for pruning redundant base classifiers on both classification and regression problems is proposed. Since the double optimization is performed on the basis of the single optimization, the ensemble of RVFL built by the proposed method outperforms that built by some single optimization methods. Experiment results on function approximation and classification problems verify that the proposed method could improve its convergence accuracy as well as reduce the complexity of the ensemble system.

Artificial neural networks based predictive model for worker ...

African Journals Online (AJOL)

... meet highly dynamic production conditions in terms of demand, processing times, ... network has been formulated on worker assignment for VCMS under dual ... to generate simulated datasets that drive the training process of proposed ANN ...

A Differentially Driven Dual-Polarized Dual-Wideband Complementary Antenna for 2G/3G/LTE Applications

Directory of Open Access Journals (Sweden)

Botao Feng

2014-01-01

Full Text Available A novel differentially driven dual-polarized dual-wideband complementary patch antenna with high isolation is proposed for 2G/3G/LTE applications. In order to generate dual-polarization and dual-wideband properties, a pair of biorthogonal dual-layer η-shaped tapered line feeding structures is utilized to feed two pairs of dual-layer U-shaped patches, respectively. The upper-layer U-shaped patches mainly serve the upper frequency band, while the lower-layer ones chiefly work for the lower frequency band. Besides, a horned reflector is introduced to improve radiation patterns and provide stable gain. The prototype antenna can achieve a bandwidth of 25.7% (0.78 GHz–1.01 GHz with a stable gain of 7.8±0.7 dBi for the lower band, and a bandwidth of 45.7% (1.69 GHz–2.69 GHz with a gain of 9.5±1.1 dBi for the upper band. Input isolation exceeding 30 dB has been obtained in the wide bandwidth. Thus, it can be potentially used as a base station antenna for 2G/3G/LTE networks.

User Preference-Based Dual-Memory Neural Model With Memory Consolidation Approach.

Science.gov (United States)

Nasir, Jauwairia; Yoo, Yong-Ho; Kim, Deok-Hwa; Kim, Jong-Hwan; Nasir, Jauwairia; Yong-Ho Yoo; Deok-Hwa Kim; Jong-Hwan Kim; Nasir, Jauwairia; Yoo, Yong-Ho; Kim, Deok-Hwa; Kim, Jong-Hwan

2018-06-01

Memory modeling has been a popular topic of research for improving the performance of autonomous agents in cognition related problems. Apart from learning distinct experiences correctly, significant or recurring experiences are expected to be learned better and be retrieved easier. In order to achieve this objective, this paper proposes a user preference-based dual-memory adaptive resonance theory network model, which makes use of a user preference to encode memories with various strengths and to learn and forget at various rates. Over a period of time, memories undergo a consolidation-like process at a rate proportional to the user preference at the time of encoding and the frequency of recall of a particular memory. Consolidated memories are easier to recall and are more stable. This dual-memory neural model generates distinct episodic memories and a flexible semantic-like memory component. This leads to an enhanced retrieval mechanism of experiences through two routes. The simulation results are presented to evaluate the proposed memory model based on various kinds of cues over a number of trials. The experimental results on Mybot are also presented. The results verify that not only are distinct experiences learned correctly but also that experiences associated with higher user preference and recall frequency are consolidated earlier. Thus, these experiences are recalled more easily relative to the unconsolidated experiences.

Dual-band dual-polarized array for WLAN applications

CSIR Research Space (South Africa)

Steyn, JM

2009-01-01

Full Text Available dual-band dual-polarized (DBDP) antenna design for WLAN applications. The antenna is in the form of an array consisting of four double-dipole radiators. The basic radiating element consists of a rhombus shaped dipole above a planar ground plane... the ground planes and the respective feedlines. Substrate cuts and difierent heights for the horizontal feedlines were necessary to achieve the latter. The 2nd conflguration (for vertical polarization) has a slightly difierent feeding network layout...

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

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.

Triple-Frequency GPS Precise Point Positioning Ambiguity Resolution Using Dual-Frequency Based IGS Precise Clock Products

Directory of Open Access Journals (Sweden)

Fei Liu

2017-01-01

Full Text Available With the availability of the third civil signal in the Global Positioning System, triple-frequency Precise Point Positioning ambiguity resolution methods have drawn increasing attention due to significantly reduced convergence time. However, the corresponding triple-frequency based precise clock products are not widely available and adopted by applications. Currently, most precise products are generated based on ionosphere-free combination of dual-frequency L1/L2 signals, which however are not consistent with the triple-frequency ionosphere-free carrier-phase measurements, resulting in inaccurate positioning and unstable float ambiguities. In this study, a GPS triple-frequency PPP ambiguity resolution method is developed using the widely used dual-frequency based clock products. In this method, the interfrequency clock biases between the triple-frequency and dual-frequency ionosphere-free carrier-phase measurements are first estimated and then applied to triple-frequency ionosphere-free carrier-phase measurements to obtain stable float ambiguities. After this, the wide-lane L2/L5 and wide-lane L1/L2 integer property of ambiguities are recovered by estimating the satellite fractional cycle biases. A test using a sparse network is conducted to verify the effectiveness of the method. The results show that the ambiguity resolution can be achieved in minutes even tens of seconds and the positioning accuracy is in decimeter level.

Coupling effect and control strategies of the maglev dual-stage inertially stabilization system based on frequency-domain analysis.

Science.gov (United States)

Lin, Zhuchong; Liu, Kun; Zhang, Li; Zeng, Delin

2016-09-01

Maglev dual-stage inertially stabilization (MDIS) system is a newly proposed system which combines a conventional two-axis gimbal assembly and a 5-DOF (degree of freedom) magnetic bearing with vernier tilting capacity to perform dual-stage stabilization for the LOS of the suspended optical instrument. Compared with traditional dual-stage system, maglev dual-stage system exhibits different characteristics due to the negative position stiffness of the magnetic forces, which introduces additional coupling in the dual stage control system. In this paper, the coupling effect on the system performance is addressed based on frequency-domain analysis, including disturbance rejection, fine stage saturation and coarse stage structural resonance suppression. The difference between various control strategies is also discussed, including pile-up(PU), stabilize-follow (SF) and stabilize-compensate (SC). A number of principles for the design of a maglev dual stage system are proposed. A general process is also suggested, which leads to a cost-effective design striking a balance between high performance and complexity. At last, a simulation example is presented to illustrate the arguments in the paper. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

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.

Wikipedias: Collaborative web-based encyclopedias as complex networks

Science.gov (United States)

Zlatić, V.; Božičević, M.; Štefančić, H.; Domazet, M.

2006-07-01

Wikipedia is a popular web-based encyclopedia edited freely and collaboratively by its users. In this paper we present an analysis of Wikipedias in several languages as complex networks. The hyperlinks pointing from one Wikipedia article to another are treated as directed links while the articles represent the nodes of the network. We show that many network characteristics are common to different language versions of Wikipedia, such as their degree distributions, growth, topology, reciprocity, clustering, assortativity, path lengths, and triad significance profiles. These regularities, found in the ensemble of Wikipedias in different languages and of different sizes, point to the existence of a unique growth process. We also compare Wikipedias to other previously studied networks.

Equipment Management for Sensor Networks: Linking Physical Infrastructure and Actions to Observational Data

Science.gov (United States)

Jones, A. S.; Horsburgh, J. S.; Matos, M.; Caraballo, J.

2015-12-01

Networks conducting long term monitoring using in situ sensors need the functionality to track physical equipment as well as deployments, calibrations, and other actions related to site and equipment maintenance. The observational data being generated by sensors are enhanced if direct linkages to equipment details and actions can be made. This type of information is typically recorded in field notebooks or in static files, which are rarely linked to observations in a way that could be used to interpret results. However, the record of field activities is often relevant to analysis or post-processing of the observational data. We have developed an underlying database schema and deployed a web interface for recording and retrieving information on physical infrastructure and related actions for observational networks. The database schema for equipment was designed as an extension to the Observations Data Model 2 (ODM2), a community-developed information model for spatially discrete, feature based earth observations. The core entities of ODM2 describe location, observed variable, and timing of observations, and the equipment extension contains entities to provide additional metadata specific to the inventory of physical infrastructure and associated actions. The schema is implemented in a relational database system for storage and management with an associated web interface. We designed the web-based tools for technicians to enter and query information on the physical equipment and actions such as site visits, equipment deployments, maintenance, and calibrations. These tools were implemented for the iUTAH (innovative Urban Transitions and Aridregion Hydrosustainability) ecohydrologic observatory, and we anticipate that they will be useful for similar large-scale monitoring networks desiring to link observing infrastructure to observational data to increase the quality of sensor-based data products.

A Novel Dedicated Route Protection Scheme for Survivability of Link Failure in Elastic Optical Networks

Directory of Open Access Journals (Sweden)

Sridhar Iyer

2017-11-01

Full Text Available The spectrally efficient transportation of the high bit rate(s data is achievable by the Elastic optical networks (EONs. However, in the EONs, owing to the failure occurrence even in an individual simple element, different service(s maybe interrupted. Hence, it is imperative that the schemes for survivability be developed so that the issues due to the possible failure(s can be overcome. In the current work, in view of survivability of the link failure(s in the EONs, we propose the Spectrum Continuity and Contiguity Established DRP (SCC-E-DRP algorithm which is a novel dedicated route protection (DRP scheme that attempts to avoid the problem of trap topology during its exploration for a pair of link disjoint path. Further, to evaluate the link disjoint paths, we resort to the use of the SCC Established Shortest Route (SCC-E-SR algorithm which is a modified Dijkstra’s algorithm based scheme that selects the path(s pair(s based on the end-toend SCC. We conduct extensive simulations considering realistic network topologies, and compare the performance of the SCCE-DRP scheme with the existing techniques. The obtained results show that, compared to the existing schemes, the SCC-E-DRP scheme achieves better results in terms of blocking probability.

Cloudification of mmwave-based and packet-based fronthaul for future heterogeneous mobile networks

DEFF Research Database (Denmark)

Artuso, Matteo; Marcano, Andrea; Christiansen, Henrik Lehrmann

2015-01-01

is seen as an enabler for next-generation heterogeneous mobile networks. This allows for simpler base stations and savings in deployment costs, but introduces challenges in the fronthaul network connecting the sites to the processing pool. The fronthaul needs to have very low latency and high capacity......, but the traditional architecture of this network uses point-to-point links between each site and the pool, thus making it impossible to share capacity as the demands change. To address these challenges, a flexible network architecture for the fronthaul is presented that is based on Ethernet to carry the baseband......Current deployments of mobile networks are seriously challenged by increasing capacity demands, and traditional solutions are no longer practical. The use of small cells is considered as a viable technique to meet these demands. In this context, the use of centralized signal processing in a pool...

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.

Dual-band plasmonic resonator based on Jerusalem cross-shaped nanoapertures

Science.gov (United States)

Cetin, Arif E.; Kaya, Sabri; Mertiri, Alket; Aslan, Ekin; Erramilli, Shyamsunder; Altug, Hatice; Turkmen, Mustafa

2015-06-01

In this paper, we both experimentally and numerically introduce a dual-resonant metamaterial based on subwavelength Jerusalem cross-shaped apertures. We numerically investigate the physical origin of the dual-resonant behavior, originating from the constituting aperture elements, through finite difference time domain calculations. Our numerical calculations show that at the dual-resonances, the aperture system supports large and easily accessible local electromagnetic fields. In order to experimentally realize the aperture system, we utilize a high-precision and lift-off free fabrication method based on electron-beam lithography. We also introduce a fine-tuning mechanism for controlling the dual-resonant spectral response through geometrical device parameters. Finally, we show the aperture system's highly advantageous far- and near-field characteristics through numerical calculations on refractive index sensitivity. The quantitative analyses on the availability of the local fields supported by the aperture system are employed to explain the grounds behind the sensitivity of each spectral feature within the dual-resonant behavior. Possessing dual-resonances with large and accessible electromagnetic fields, Jerusalem cross-shaped apertures can be highly advantageous for wide range of applications demanding multiple spectral features with strong nearfield characteristics.

Resting-State Connectivity of the Left Frontal Cortex to the Default Mode and Dorsal Attention Network Supports Reserve in Mild Cognitive Impairment

Directory of Open Access Journals (Sweden)

Nicolai Franzmeier

2017-08-01

Full Text Available Reserve refers to the phenomenon of relatively preserved cognition in disproportion to the extent of neuropathology, e.g., in Alzheimer’s disease. A putative functional neural substrate underlying reserve is global functional connectivity of the left lateral frontal cortex (LFC, Brodmann Area 6/44. Resting-state fMRI-assessed global LFC-connectivity is associated with protective factors (education and better maintenance of memory in mild cognitive impairment (MCI. Since the LFC is a hub of the fronto-parietal control network that regulates the activity of other networks, the question arises whether LFC-connectivity to specific networks rather than the whole-brain may underlie reserve. We assessed resting-state fMRI in 24 MCI and 16 healthy controls (HC and in an independent validation sample (23 MCI/32 HC. Seed-based LFC-connectivity to seven major resting-state networks (i.e., fronto-parietal, limbic, dorsal-attention, somatomotor, default-mode, ventral-attention, visual was computed, reserve was quantified as residualized memory performance after accounting for age and hippocampal atrophy. In both samples of MCI, LFC-activity was anti-correlated with the default-mode network (DMN, but positively correlated with the dorsal-attention network (DAN. Greater education predicted stronger LFC-DMN-connectivity (anti-correlation and LFC-DAN-connectivity. Stronger LFC-DMN and LFC-DAN-connectivity each predicted higher reserve, consistently in both MCI samples. No associations were detected for LFC-connectivity to other networks. These novel results extend our previous findings on global functional connectivity of the LFC, showing that LFC-connectivity specifically to the DAN and DMN, two core memory networks, enhances reserve in the memory domain in MCI.

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

Science.gov (United States)

Guo, Y.; Fujinoki, H.

2006-10-01

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

The Hidden Flow Structure and Metric Space of Network Embedding Algorithms Based on Random Walks.