Voice Communications over 802.11 Ad Hoc Networks: Modeling, Optimization and Call Admission Control

Science.gov (United States)

Xu, Changchun; Xu, Yanyi; Liu, Gan; Liu, Kezhong

Supporting quality-of-service (QoS) of multimedia communications over IEEE 802.11 based ad hoc networks is a challenging task. This paper develops a simple 3-D Markov chain model for queuing analysis of IEEE 802.11 MAC layer. The model is applied for performance analysis of voice communications over IEEE 802.11 single-hop ad hoc networks. By using the model, we finish the performance optimization of IEEE MAC layer and obtain the maximum number of voice calls in IEEE 802.11 ad hoc networks as well as the statistical performance bounds. Furthermore, we design a fully distributed call admission control (CAC) algorithm which can provide strict statistical QoS guarantee for voice communications over IEEE 802.11 ad hoc networks. Extensive simulations indicate the accuracy of the analytical model and the CAC scheme.

Mining Functional Modules in Heterogeneous Biological Networks Using Multiplex PageRank Approach.

Science.gov (United States)

Li, Jun; Zhao, Patrick X

2016-01-01

Identification of functional modules/sub-networks in large-scale biological networks is one of the important research challenges in current bioinformatics and systems biology. Approaches have been developed to identify functional modules in single-class biological networks; however, methods for systematically and interactively mining multiple classes of heterogeneous biological networks are lacking. In this paper, we present a novel algorithm (called mPageRank) that utilizes the Multiplex PageRank approach to mine functional modules from two classes of biological networks. We demonstrate the capabilities of our approach by successfully mining functional biological modules through integrating expression-based gene-gene association networks and protein-protein interaction networks. We first compared the performance of our method with that of other methods using simulated data. We then applied our method to identify the cell division cycle related functional module and plant signaling defense-related functional module in the model plant Arabidopsis thaliana. Our results demonstrated that the mPageRank method is effective for mining sub-networks in both expression-based gene-gene association networks and protein-protein interaction networks, and has the potential to be adapted for the discovery of functional modules/sub-networks in other heterogeneous biological networks. The mPageRank executable program, source code, the datasets and results of the presented two case studies are publicly and freely available at http://plantgrn.noble.org/MPageRank/.

Network Approach in Political Communication Studies

Directory of Open Access Journals (Sweden)

Нина Васильевна Опанасенко

2013-12-01

Full Text Available The article is devoted to issues of network approach application in political communication studies. The author considers communication in online and offline areas and gives the definition of rhizome, its characteristics, identifies links between rhizome and network approach. The author also analyses conditions and possibilities of the network approach in modern political communication. Both positive and negative features of the network approach are emphasized.

Analisis Unjuk Kerja Aplikasi VoIP Call Android di Jaringan MANET [Performance Analysis of VoIP Call Application Android in MANET (Mobile Ad Hoc Network

Directory of Open Access Journals (Sweden)

Ryan Ari Setyawan

2015-06-01

Full Text Available Penelitian ini bertujuan menganalisis kinerja aplikasi  VoIP call android di jaringan MANET (mobile ad hoc network.  Hasil pengujian menunjukan bahwa aplikasi VoIP call android dapat digunakan di jaringan MANET. Delay yang dihasilkan paling besar di pengujian indoor dengan jarak 11-15 meter yakni sebesar 0,014624811 seconds. Packet loss yang dihasilkan pada range 1%-2% sedangkan standar packet loss yang ditetapkan oleh CISCO untuk layanan aplikasi VoIP adalah < 5%. Jitter yang dihasilkan yakni antara 0,01-0,06 seconds sedangkan standar yang ditetapkan oleh CISCO adalah ≤ 30 ms atau 0,03 seconds. Throughput yang dihasilkan pada proses pengujian yakni antar 161 kbps-481 kbps. *****This study aims to analyze the performance of VOIP call android application in the MANET (mobile ad hoc network. The results showed that VoIP applications could be implemented in MANET network. The highest  delay is produced in indoor testing  with distance of 11-15 meters,  which is equal to 0.014624811 seconds. Packet loss is generated in the range of 1% -2%, while packet loss standards set by Cisco for VoIP application services are <5%. The jitter is between 0.01 to 0.06 seconds, while the standard set by CISCO is ≤ 30 ms or 0.03 seconds. Throughput generated in the testing process is between 161 kbps-481 kbps.

Legal Network report calls for decriminalization of prostitution in Canada.

Science.gov (United States)

Betteridge, Glenn

2005-12-01

In December 2005 the Canadian HIV/AIDS Legal Network released Sex, work, rights: reforming Canadian criminal laws on prostitution. The report examines the ways in which the prostitution-related provisions of the Criminal Code, and their enforcement, have criminalized many aspects of sex workers' lives and have promoted their social marginalization. Evidence indicates that the criminal law has contributed to health and safety risks, including the risk of HIV infection, faced by sex workers. The Legal Network calls for the decriminalization of prostitution in Canada, and for other legal and policy reforms that respect the human rights and promote the health of sex workers. Despite the report's Canadian focus, its human rights analysis is relevant to the situation of sex workers in other countries where prostitution is illegal and sex workers face rights abuses. In this article, Glenn Betteridge, the principal author of the report, briefly sets out the case for law reform.

Network-based Approaches in Pharmacology.

Science.gov (United States)

Boezio, Baptiste; Audouze, Karine; Ducrot, Pierre; Taboureau, Olivier

2017-10-01

In drug discovery, network-based approaches are expected to spotlight our understanding of drug action across multiple layers of information. On one hand, network pharmacology considers the drug response in the context of a cellular or phenotypic network. On the other hand, a chemical-based network is a promising alternative for characterizing the chemical space. Both can provide complementary support for the development of rational drug design and better knowledge of the mechanisms underlying the multiple actions of drugs. Recent progress in both concepts is discussed here. In addition, a network-based approach using drug-target-therapy data is introduced as an example. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.

Science.gov (United States)

Röhl, Annika; Bockmayr, Alexander

2017-01-03

Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement. Here we present an MILP approach for computing minimum subnetworks with the given properties. The minimality (with respect to the number of active reactions) is not guaranteed by NetworkReducer, while the method by Burgard et al. does not allow specifying the different biological requirements. Our procedure is about 5-10 times faster than NetworkReducer and can enumerate all minimum subnetworks in case there exist several ones. This allows identifying common reactions that are present in all subnetworks, and reactions appearing in alternative pathways. Applying complex analysis methods to genome-scale metabolic networks is often not possible in practice. Thus it may become necessary to reduce the size of the network while keeping important functionalities. We propose a MILP solution to this problem. Compared to previous work, our approach is more efficient and allows computing not only one, but even all minimum subnetworks satisfying the required properties.

Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks

Directory of Open Access Journals (Sweden)

Fapojuwo Abraham O

2007-01-01

Full Text Available We propose a two-level call admission control (CAC scheme for direct sequence code division multiple access (DS-CDMA wireless networks supporting multimedia traffic and evaluate its performance. The first-level admission control assigns higher priority to real-time calls (also referred to as class 0 calls in gaining access to the system resources. The second level admits nonreal-time calls (or class 1 calls based on the resources remaining after meeting the resource needs for real-time calls. However, to ensure some minimum level of performance for nonreal-time calls, the scheme reserves some resources for such calls. The proposed two-level CAC scheme utilizes the delay-tolerant characteristic of non-real-time calls by incorporating a queue to temporarily store those that cannot be assigned resources at the time of initial access. We analyze and evaluate the call blocking, outage probability, throughput, and average queuing delay performance of the proposed two-level CAC scheme using Markov chain theory. The analytic results are validated by simulation results. The numerical results show that the proposed two-level CAC scheme provides better performance than the single-level CAC scheme. Based on these results, it is concluded that the proposed two-level CAC scheme serves as a good solution for supporting multimedia applications in DS-CDMA wireless communication systems.

Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks

Directory of Open Access Journals (Sweden)

Abraham O. Fapojuwo

2007-11-01

Full Text Available We propose a two-level call admission control (CAC scheme for direct sequence code division multiple access (DS-CDMA wireless networks supporting multimedia traffic and evaluate its performance. The first-level admission control assigns higher priority to real-time calls (also referred to as class 0 calls in gaining access to the system resources. The second level admits nonreal-time calls (or class 1 calls based on the resources remaining after meeting the resource needs for real-time calls. However, to ensure some minimum level of performance for nonreal-time calls, the scheme reserves some resources for such calls. The proposed two-level CAC scheme utilizes the delay-tolerant characteristic of non-real-time calls by incorporating a queue to temporarily store those that cannot be assigned resources at the time of initial access. We analyze and evaluate the call blocking, outage probability, throughput, and average queuing delay performance of the proposed two-level CAC scheme using Markov chain theory. The analytic results are validated by simulation results. The numerical results show that the proposed two-level CAC scheme provides better performance than the single-level CAC scheme. Based on these results, it is concluded that the proposed two-level CAC scheme serves as a good solution for supporting multimedia applications in DS-CDMA wireless communication systems.

A framework of call admission control procedures for integrated services mobile wireless networks

International Nuclear Information System (INIS)

Mahmoud, Ashraf S. Hasan; Al-Qahtani, Salman A.

2007-01-01

This paper presents a general framework for a wide range of call admission control (CAC) algorithms. For several CAC schemes, which are a subset of this general framework, an analytical performance evaluation is presented for a multi-traffic mobile wireless network. These CAC algorithms consider a variety of mechanisms to prioritize traffic in an attempt to support different levels of quality of service (QoS) for different types of calls. These mechanisms include dividing the handoff traffic into more than one class and using guard channels or allowing channel splitting to admit more handoff calls. Other mechanisms aimed at adding priority for handoff calls consider employing queuing of handoff calls or dynamically reducing the number lower priority calls. Furthermore our analysis relaxes the typically used assumptions of equal channel holding time and equal resource usage for voice and data calls. The main contribution of this paper is the development of an analytical model for each of the three CAC algorithms specified in this study. In addition to the call blocking and termination probabilities which are usually cited as the performance metrics, in this work we derive and evaluate other metrics that not have be considered by the previous work such as the average queue length, the average queue residency, and the time-out probability for handoff calls. We also develop a simulation tool to test and verify our results. Finally, we present numerical examples to demonstrate the performance of the proposed CAG algorithms and we show that analytical and simulation results are in total agreement. (author)

External GSM phone calls now made simpler

CERN Multimedia

2007-01-01

On 2 July, the IT/CS Telecom Service introduced a new service making external calls from CERN GSM phones easier. A specific prefix is no longer needed for calls outside CERN. External calls from CERN GSM phones are to be simplified. It is no longer necessary to use a special prefix to call an external number from the CERN GSM network.The Telecom Section of the IT/CS Group is introducing a new system that will make life easier for GSM users. It is no longer necessary to use a special prefix (333) to call an external number from the CERN GSM network. Simply dial the number directly like any other Swiss GSM customer. CERN currently has its own private GSM network with the Swiss mobile operator, Sunrise, covering the whole of Switzerland. This network was initially intended exclusively for calls between CERN numbers (replacing the old beeper system). A special system was later introduced for external calls, allowing them to pass thr...

Learning Based Approach for Optimal Clustering of Distributed Program's Call Flow Graph

Science.gov (United States)

Abofathi, Yousef; Zarei, Bager; Parsa, Saeed

Optimal clustering of call flow graph for reaching maximum concurrency in execution of distributable components is one of the NP-Complete problems. Learning automatas (LAs) are search tools which are used for solving many NP-Complete problems. In this paper a learning based algorithm is proposed to optimal clustering of call flow graph and appropriate distributing of programs in network level. The algorithm uses learning feature of LAs to search in state space. It has been shown that the speed of reaching to solution increases remarkably using LA in search process, and it also prevents algorithm from being trapped in local minimums. Experimental results show the superiority of proposed algorithm over others.

Behavior-based network management: a unique model-based approach to implementing cyber superiority

Science.gov (United States)

Seng, Jocelyn M.

2016-05-01

Behavior-Based Network Management (BBNM) is a technological and strategic approach to mastering the identification and assessment of network behavior, whether human-driven or machine-generated. Recognizing that all five U.S. Air Force (USAF) mission areas rely on the cyber domain to support, enhance and execute their tasks, BBNM is designed to elevate awareness and improve the ability to better understand the degree of reliance placed upon a digital capability and the operational risk.2 Thus, the objective of BBNM is to provide a holistic view of the digital battle space to better assess the effects of security, monitoring, provisioning, utilization management, allocation to support mission sustainment and change control. Leveraging advances in conceptual modeling made possible by a novel advancement in software design and implementation known as Vector Relational Data Modeling (VRDM™), the BBNM approach entails creating a network simulation in which meaning can be inferred and used to manage network behavior according to policy, such as quickly detecting and countering malicious behavior. Initial research configurations have yielded executable BBNM models as combinations of conceptualized behavior within a network management simulation that includes only concepts of threats and definitions of "good" behavior. A proof of concept assessment called "Lab Rat," was designed to demonstrate the simplicity of network modeling and the ability to perform adaptation. The model was tested on real world threat data and demonstrated adaptive and inferential learning behavior. Preliminary results indicate this is a viable approach towards achieving cyber superiority in today's volatile, uncertain, complex and ambiguous (VUCA) environment.

Leaderless Covert Networks : A Quantitative Approach

NARCIS (Netherlands)

Husslage, B.G.M.; Lindelauf, R.; Hamers, H.J.M.

2012-01-01

Abstract: Lindelauf et al. (2009a) introduced a quantitative approach to investigate optimal structures of covert networks. This approach used an objective function which is based on the secrecy versus information trade-off these organizations face. Sageman (2008) hypothesized that covert networks

Computer Networks A Systems Approach

CERN Document Server

Peterson, Larry L

2011-01-01

This best-selling and classic book teaches you the key principles of computer networks with examples drawn from the real world of network and protocol design. Using the Internet as the primary example, the authors explain various protocols and networking technologies. Their systems-oriented approach encourages you to think about how individual network components fit into a larger, complex system of interactions. Whatever your perspective, whether it be that of an application developer, network administrator, or a designer of network equipment or protocols, you will come away with a "big pictur

Computer networking a top-down approach

CERN Document Server

Kurose, James

2017-01-01

Unique among computer networking texts, the Seventh Edition of the popular Computer Networking: A Top Down Approach builds on the author’s long tradition of teaching this complex subject through a layered approach in a “top-down manner.” The text works its way from the application layer down toward the physical layer, motivating readers by exposing them to important concepts early in their study of networking. Focusing on the Internet and the fundamentally important issues of networking, this text provides an excellent foundation for readers interested in computer science and electrical engineering, without requiring extensive knowledge of programming or mathematics. The Seventh Edition has been updated to reflect the most important and exciting recent advances in networking.

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

Science.gov (United States)

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

2013-09-01

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

A Bilevel Scheduling Approach for Modeling Energy Transaction of Virtual Power Plants in Distribution Networks

Directory of Open Access Journals (Sweden)

F. Nazari

2017-03-01

Full Text Available By increasing the use of distributed generation (DG in the distribution network operation, an entity called virtual power plant (VPP has been introduced to control, dispatch and aggregate the generation of DGs, enabling them to participate either in the electricity market or the distribution network operation. The participation of VPPs in the electricity market has made challenges to fairly allocate payments and benefits between VPPs and distribution network operator (DNO. This paper presents a bilevel scheduling approach to model the energy transaction between VPPs and DNO.  The upper level corresponds to the decision making of VPPs which bid their long- term contract prices so that their own profits are maximized and the lower level represents the DNO decision making to supply electricity demand of the network by minimizing its overall cost. The proposed bilevel scheduling approach is transformed to a single level optimizing problem using its Karush-Kuhn-Tucker (KKT optimality conditions. Several scenarios are applied to scrutinize the effectiveness and usefulness of the proposed model. 

A network-based approach to prioritize results from genome-wide association studies.

Directory of Open Access Journals (Sweden)

Nirmala Akula

Full Text Available Genome-wide association studies (GWAS are a valuable approach to understanding the genetic basis of complex traits. One of the challenges of GWAS is the translation of genetic association results into biological hypotheses suitable for further investigation in the laboratory. To address this challenge, we introduce Network Interface Miner for Multigenic Interactions (NIMMI, a network-based method that combines GWAS data with human protein-protein interaction data (PPI. NIMMI builds biological networks weighted by connectivity, which is estimated by use of a modification of the Google PageRank algorithm. These weights are then combined with genetic association p-values derived from GWAS, producing what we call 'trait prioritized sub-networks.' As a proof of principle, NIMMI was tested on three GWAS datasets previously analyzed for height, a classical polygenic trait. Despite differences in sample size and ancestry, NIMMI captured 95% of the known height associated genes within the top 20% of ranked sub-networks, far better than what could be achieved by a single-locus approach. The top 2% of NIMMI height-prioritized sub-networks were significantly enriched for genes involved in transcription, signal transduction, transport, and gene expression, as well as nucleic acid, phosphate, protein, and zinc metabolism. All of these sub-networks were ranked near the top across all three height GWAS datasets we tested. We also tested NIMMI on a categorical phenotype, Crohn's disease. NIMMI prioritized sub-networks involved in B- and T-cell receptor, chemokine, interleukin, and other pathways consistent with the known autoimmune nature of Crohn's disease. NIMMI is a simple, user-friendly, open-source software tool that efficiently combines genetic association data with biological networks, translating GWAS findings into biological hypotheses.

A Network-Based Approach to Prioritize Results from Genome-Wide Association Studies

Science.gov (United States)

Akula, Nirmala; Baranova, Ancha; Seto, Donald; Solka, Jeffrey; Nalls, Michael A.; Singleton, Andrew; Ferrucci, Luigi; Tanaka, Toshiko; Bandinelli, Stefania; Cho, Yoon Shin; Kim, Young Jin; Lee, Jong-Young; Han, Bok-Ghee; McMahon, Francis J.

2011-01-01

Genome-wide association studies (GWAS) are a valuable approach to understanding the genetic basis of complex traits. One of the challenges of GWAS is the translation of genetic association results into biological hypotheses suitable for further investigation in the laboratory. To address this challenge, we introduce Network Interface Miner for Multigenic Interactions (NIMMI), a network-based method that combines GWAS data with human protein-protein interaction data (PPI). NIMMI builds biological networks weighted by connectivity, which is estimated by use of a modification of the Google PageRank algorithm. These weights are then combined with genetic association p-values derived from GWAS, producing what we call ‘trait prioritized sub-networks.’ As a proof of principle, NIMMI was tested on three GWAS datasets previously analyzed for height, a classical polygenic trait. Despite differences in sample size and ancestry, NIMMI captured 95% of the known height associated genes within the top 20% of ranked sub-networks, far better than what could be achieved by a single-locus approach. The top 2% of NIMMI height-prioritized sub-networks were significantly enriched for genes involved in transcription, signal transduction, transport, and gene expression, as well as nucleic acid, phosphate, protein, and zinc metabolism. All of these sub-networks were ranked near the top across all three height GWAS datasets we tested. We also tested NIMMI on a categorical phenotype, Crohn’s disease. NIMMI prioritized sub-networks involved in B- and T-cell receptor, chemokine, interleukin, and other pathways consistent with the known autoimmune nature of Crohn’s disease. NIMMI is a simple, user-friendly, open-source software tool that efficiently combines genetic association data with biological networks, translating GWAS findings into biological hypotheses. PMID:21915301

A Deep Learning Network Approach to ab initio Protein Secondary Structure Prediction.

Science.gov (United States)

Spencer, Matt; Eickholt, Jesse; Jianlin Cheng

2015-01-01

Ab initio protein secondary structure (SS) predictions are utilized to generate tertiary structure predictions, which are increasingly demanded due to the rapid discovery of proteins. Although recent developments have slightly exceeded previous methods of SS prediction, accuracy has stagnated around 80 percent and many wonder if prediction cannot be advanced beyond this ceiling. Disciplines that have traditionally employed neural networks are experimenting with novel deep learning techniques in attempts to stimulate progress. Since neural networks have historically played an important role in SS prediction, we wanted to determine whether deep learning could contribute to the advancement of this field as well. We developed an SS predictor that makes use of the position-specific scoring matrix generated by PSI-BLAST and deep learning network architectures, which we call DNSS. Graphical processing units and CUDA software optimize the deep network architecture and efficiently train the deep networks. Optimal parameters for the training process were determined, and a workflow comprising three separately trained deep networks was constructed in order to make refined predictions. This deep learning network approach was used to predict SS for a fully independent test dataset of 198 proteins, achieving a Q3 accuracy of 80.7 percent and a Sov accuracy of 74.2 percent.

Analyzing energy consumption of wireless networks. A model-based approach

Energy Technology Data Exchange (ETDEWEB)

Yue, Haidi

2013-03-04

During the last decades, wireless networking has been continuously a hot topic both in academy and in industry. Many different wireless networks have been introduced like wireless local area networks, wireless personal networks, wireless ad hoc networks, and wireless sensor networks. If these networks want to have a long term usability, the power consumed by the wireless devices in each of these networks needs to be managed efficiently. Hence, a lot of effort has been carried out for the analysis and improvement of energy efficiency, either for a specific network layer (protocol), or new cross-layer designs. In this thesis, we apply model-based approach for the analysis of energy consumption of different wireless protocols. The protocols under consideration are: one leader election protocol, one routing protocol, and two medium access control protocols. By model-based approach we mean that all these four protocols are formalized as some formal models, more precisely, as discrete-time Markov chains (DTMCs), Markov decision processes (MDPs), or stochastic timed automata (STA). For the first two models, DTMCs and MDPs, we model them in PRISM, a prominent model checker for probabilistic model checking, and apply model checking technique to analyze them. Model checking belongs to the family of formal methods. It discovers exhaustively all possible (reachable) states of the models, and checks whether these models meet a given specification. Specifications are system properties that we want to study, usually expressed by some logics, for instance, probabilistic computer tree logic (PCTL). However, while model checking relies on rigorous mathematical foundations and automatically explores the entire state space of a model, its applicability is also limited by the so-called state space explosion problem -- even systems of moderate size often yield models with an exponentially larger state space that thwart their analysis. Hence for the STA models in this thesis, since there

Objective assessment of IP video calls with Asterisk

OpenAIRE

Kapičák, Lukáš; Nevlud, Pavel; Mikulec, Martin; Zdrálek, Jaroslav

2012-01-01

The paper deals with an objective assessment of IP video calls transmission over GSM and UMTS networks. Video transmission is affected by many factors in mobile network. Among these factors belong packet loss, latency and transmission rate of the mobile network. Network properties were simulated by Simena network simulator. Our team have developed a unique technique for finding defects in video appearing in video calls. This technique is built on modified Asterisk SW PBX with enabled video re...

A new approach for sizing stand alone photovoltaic systems based in neural networks

Energy Technology Data Exchange (ETDEWEB)

Hontoria, L.; Aguilera, J. [Universidad de Jaen, Dept. de Electronica, Jaen (Spain); Zufiria, P. [UPM Ciudad Universitaria, Dept. de Matematica Aplicada a las Tecnologias de la Informacion, Madrid (Spain)

2005-02-01

Several methods for sizing stand alone photovoltaic (pv) systems has been developed. The more simplistic are called intuitive methods. They are a useful tool for a first approach in sizing stand alone photovoltaic systems. Nevertheless they are very inaccurate. Analytical methods use equations to describe the pv system size as a function of reliability. These ones are more accurate than the previous ones but they are also not accurate enough for sizing of high reliability. In a third group there are methods which use system simulations. These ones are called numerical methods. Many of the analytical methods employ the concept of reliability of the system or the complementary term: loss of load probability (LOLP). In this paper an improvement for obtaining LOLP curves based on the neural network called Multilayer Perceptron (MLP) is presented. A unique MLP for many locations of Spain has been trained and after the training, the MLP is able to generate LOLP curves for any value and location. (Author)

Approaching human language with complex networks

Science.gov (United States)

Cong, Jin; Liu, Haitao

2014-12-01

The interest in modeling and analyzing human language with complex networks is on the rise in recent years and a considerable body of research in this area has already been accumulated. We survey three major lines of linguistic research from the complex network approach: 1) characterization of human language as a multi-level system with complex network analysis; 2) linguistic typological research with the application of linguistic networks and their quantitative measures; and 3) relationships between the system-level complexity of human language (determined by the topology of linguistic networks) and microscopic linguistic (e.g., syntactic) features (as the traditional concern of linguistics). We show that the models and quantitative tools of complex networks, when exploited properly, can constitute an operational methodology for linguistic inquiry, which contributes to the understanding of human language and the development of linguistics. We conclude our review with suggestions for future linguistic research from the complex network approach: 1) relationships between the system-level complexity of human language and microscopic linguistic features; 2) expansion of research scope from the global properties to other levels of granularity of linguistic networks; and 3) combination of linguistic network analysis with other quantitative studies of language (such as quantitative linguistics).

Northern emporia and maritime networks. Modelling past communication using archaeological network analysis

DEFF Research Database (Denmark)

Sindbæk, Søren Michael

2015-01-01

preserve patterns of thisinteraction. Formal network analysis and modelling holds the potential to identify anddemonstrate such patterns, where traditional methods often prove inadequate. Thearchaeological study of communication networks in the past, however, calls for radically different analytical...... this is not a problem of network analysis, but network synthesis: theclassic problem of cracking codes or reconstructing black-box circuits. It is proposedthat archaeological approaches to network synthesis must involve a contextualreading of network data: observations arising from individual contexts, morphologies...

Neural network based multiscale image restoration approach

Science.gov (United States)

de Castro, Ana Paula A.; da Silva, José D. S.

2007-02-01

This paper describes a neural network based multiscale image restoration approach. Multilayer perceptrons are trained with artificial images of degraded gray level circles, in an attempt to make the neural network learn inherent space relations of the degraded pixels. The present approach simulates the degradation by a low pass Gaussian filter blurring operation and the addition of noise to the pixels at pre-established rates. The training process considers the degraded image as input and the non-degraded image as output for the supervised learning process. The neural network thus performs an inverse operation by recovering a quasi non-degraded image in terms of least squared. The main difference of the approach to existing ones relies on the fact that the space relations are taken from different scales, thus providing relational space data to the neural network. The approach is an attempt to come up with a simple method that leads to an optimum solution to the problem. Considering different window sizes around a pixel simulates the multiscale operation. In the generalization phase the neural network is exposed to indoor, outdoor, and satellite degraded images following the same steps use for the artificial circle image.

What can we learn from the network approach in finance?

Science.gov (United States)

Janos, Kertesz

2005-03-01

Correlations between variations of stock prices reveal information about relationships between companies. Different methods of analysis have been applied to such data in order to uncover the taxonomy of the market. We use Mantegna's miminum spanning tree (MST) method for daily data in a dynamic way: By introducing a moving window we study the temporal changes in the structure of the network defined by this ``asset tree.'' The MST is scale free with a significantly changing exponent of the degree distribution for crash periods, which demonstrates the restructuring of the network due to the enhancement of correlations. This approach is compared to that based on what we call ``asset graphs:'' We start from an empty graph with no edges where the vertices correspond to stocks and then, one by one, we insert edges between the vertices according to the rank of their correlation strength. We study the properties of the creatred (weighted) networks, such as topologically different growth types, number and size of clusters and clustering coefficient. Furthermore, we define new tools like subgraph intensity and coherence to describe the role of the weights. We also investigate the time shifted cross correlation functions for high frequency data and find a characteristic time delay in many cases representing that some stocks lead the price changes while others follow them. These data can be used to construct a directed network of influence.

Call Duration Characteristics based on Customers Location

Directory of Open Access Journals (Sweden)

Žvinys Karolis

2014-05-01

Full Text Available Nowadays a lot of different researches are performed based on call duration distributions (CDD analysis. However, the majority of studies are linked with social relationships between the people. Therefore the scarcity of information, how the call duration is associated with a user's location, is appreciable. The goal of this paper is to reveal the ties between user's voice call duration and the location of call. For this reason we analyzed more than 5 million calls from real mobile network, which were made over the base stations located in rural areas, roads, small towns, business and entertainment centers, residential districts. According to these site types CDD’s and characteristic features for call durations are given and discussed. Submitted analysis presents the users habits and behavior as a group (not an individual. The research showed that CDD’s of customers being them in different locations are not equal. It has been found that users at entertainment, business centers are tend to talk much shortly, than people being at home. Even more CDD can be distorted strongly, when machinery calls are evaluated. Hence to apply a common CDD for a whole network it is not recommended. The study also deals with specific parameters of call duration for distinguished user groups, the influence of network technology for call duration is considered.

A Reinforcement Learning Approach to Call Admission Control in HAPS Communication System

Directory of Open Access Journals (Sweden)

Ni Shu Yan

2017-01-01

Full Text Available The large changing of link capacity and number of users caused by the movement of both platform and users in communication system based on high altitude platform station (HAPS will resulting in high dropping rate of handover and reduce resource utilization. In order to solve these problems, this paper proposes an adaptive call admission control strategy based on reinforcement learning approach. The goal of this strategy is to maximize long-term gains of system, with the introduction of cross-layer interaction and the service downgraded. In order to access different traffics adaptively, the access utility of handover traffics and new call traffics is designed in different state of communication system. Numerical simulation result shows that the proposed call admission control strategy can enhance bandwidth resource utilization and the performances of handover traffics.

Statistical and machine learning approaches for network analysis

CERN Document Server

Dehmer, Matthias

2012-01-01

Explore the multidisciplinary nature of complex networks through machine learning techniques Statistical and Machine Learning Approaches for Network Analysis provides an accessible framework for structurally analyzing graphs by bringing together known and novel approaches on graph classes and graph measures for classification. By providing different approaches based on experimental data, the book uniquely sets itself apart from the current literature by exploring the application of machine learning techniques to various types of complex networks. Comprised of chapters written by internation

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

Science.gov (United States)

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

2011-10-01

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

HIGH: A Hexagon-based Intelligent Grouping Approach in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

FAN, C.-S.

2016-02-01

Full Text Available In a random deployment or uniform deployment strategy, sensor nodes are scattered randomly or uniformly in the sensing field, respectively. Hence, the coverage ratio cannot be guaranteed. The coverage ratio of uniform deployment, in general, is larger than that of the random deployment strategy. However, a random deployment or uniform deployment strategy may cause unbalanced traffic pattern in wireless sensor networks (WSNs. Therefore, cluster heads (CHs around the sink have larger loads than those farther away from the sink. That is, CHs close to the sink exhaust their energy earlier. In order to overcome the above problem, we propose a Hexagon-based Intelligent Grouping approacH in WSNs (called HIGH. The coverage, energy consumption and data routing issues are well investigated and taken into consideration in the proposed HIGH scheme. The simulation results validate our theoretical analysis and show that the proposed HIGH scheme achieves a satisfactory coverage ratio, balances the energy consumption among sensor nodes, and extends network lifetime significantly.

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

Science.gov (United States)

Mohanasundaram, Ranganathan; Periasamy, Pappampalayam Sanmugam

2015-01-01

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

Base Station Ordering for Emergency Call Localization in Ultra-dense Cellular Networks

KAUST Repository

Elsawy, Hesham

2017-10-04

This paper proposes the base station ordering localization technique (BoLT) for emergency call localization in cellular networks. Exploiting the foreseen ultra-densification of the next-generation (5G and beyond) cellular networks, we utilize higher-order Voronoi tessellations to provide ubiquitous localization services that are in compliance to the public safety standards in cellular networks. The proposed localization algorithm runs at the base stations (BSs) and requires minimal operation from agents (i.e., mobile users). Particularly, BoLT requires each agent to feedback a neighbor cell list (NCL) that contains the order of neighboring BSs based on the received signal power in the pilots sent from these BSs. Moreover, this paper utilizes stochastic geometry to develop a tractable mathematical model to assess the performance of BoLT in a general network setting. The goal of this paper is to answer the following two fundamental questions: i) how many BSs should be ordered and reported by the agent to achieve a desirable localization accuracy? and ii) what is the localization error probability given that the pilot signals are subject to shadowing? Assuming that the BSs are deployed according to a Poisson point process (PPP), we answer these two questions via characterizing the tradeoff between the area of location region (ALR) and the localization error probability in terms of the number of BSs ordered by the agent. The results show that reporting the order of six neighboring BSs is sufficient to localize the agent within 10% of the cell area. Increasing the number of reported BSs to ten confines the location region to 1% of the cell area. This would translate to the range of a few meters to decimeters in the foreseen ultra-dense 5G networks.

Base Station Ordering for Emergency Call Localization in Ultra-dense Cellular Networks

KAUST Repository

Elsawy, Hesham; Dai, Wenhan; Alouini, Mohamed-Slim; Win, Moe Z.

2017-01-01

This paper proposes the base station ordering localization technique (BoLT) for emergency call localization in cellular networks. Exploiting the foreseen ultra-densification of the next-generation (5G and beyond) cellular networks, we utilize higher-order Voronoi tessellations to provide ubiquitous localization services that are in compliance to the public safety standards in cellular networks. The proposed localization algorithm runs at the base stations (BSs) and requires minimal operation from agents (i.e., mobile users). Particularly, BoLT requires each agent to feedback a neighbor cell list (NCL) that contains the order of neighboring BSs based on the received signal power in the pilots sent from these BSs. Moreover, this paper utilizes stochastic geometry to develop a tractable mathematical model to assess the performance of BoLT in a general network setting. The goal of this paper is to answer the following two fundamental questions: i) how many BSs should be ordered and reported by the agent to achieve a desirable localization accuracy? and ii) what is the localization error probability given that the pilot signals are subject to shadowing? Assuming that the BSs are deployed according to a Poisson point process (PPP), we answer these two questions via characterizing the tradeoff between the area of location region (ALR) and the localization error probability in terms of the number of BSs ordered by the agent. The results show that reporting the order of six neighboring BSs is sufficient to localize the agent within 10% of the cell area. Increasing the number of reported BSs to ten confines the location region to 1% of the cell area. This would translate to the range of a few meters to decimeters in the foreseen ultra-dense 5G networks.

Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks

Directory of Open Access Journals (Sweden)

Liang Jinghang

2012-08-01

network inferred from a T cell immune response dataset. An SBN can also implement the function of an asynchronous PBN and is potentially useful in a hybrid approach in combination with a continuous or single-molecule level stochastic model. Conclusions Stochastic Boolean networks (SBNs are proposed as an efficient approach to modelling gene regulatory networks (GRNs. The SBN approach is able to recover biologically-proven regulatory behaviours, such as the oscillatory dynamics of the p53-Mdm2 network and the dynamic attractors in a T cell immune response network. The proposed approach can further predict the network dynamics when the genes are under perturbation, thus providing biologically meaningful insights for a better understanding of the dynamics of GRNs. The algorithms and methods described in this paper have been implemented in Matlab packages, which are attached as Additional files.

Loss Performance Modeling for Hierarchical Heterogeneous Wireless Networks With Speed-Sensitive Call Admission Control

DEFF Research Database (Denmark)

Huang, Qian; Huang, Yue-Cai; Ko, King-Tim

2011-01-01

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

Adolescent pregnancy: networking and the interdisciplinary approach.

Science.gov (United States)

Canada, M J

1986-01-01

The networking approach to providing needed services to pregnant and parenting teenagers has numerous merits. An historical overview of the formation of the Brooklyn Teen Pregnancy Network highlights service agency need for information and resource sharing, and improved client referral systems as key factors in the genesis of the Network. The borough-wide approach and its spread as an agency model throughout New York City's other boroughs and several other northeastern cities is also attributed to its positive client impact, including: improved family communication and cooperation; early prenatal care with its concomitant improved pregnancy outcomes; financial support for teens; continued teen education; and parenting skills development. Resource information is provided regarding networks operating in the Greater New York metropolitan area. A planned Eastern Regional network initiative is under development.

Public management and policy networks: foundations of a network approach to governance

NARCIS (Netherlands)

E-H. Klijn (Erik-Hans); J.F.M. Koppenjan (Joop)

2006-01-01

markdownabstract__Abstract__ In this article we address the elaboratlon of the central concepts of a theory of networks and of network management. We suggest that the network approach builds on several theoretical traditions After this we clarify the theoretical concepts and axioms of the policy

Deterministic network interdiction optimization via an evolutionary approach

International Nuclear Information System (INIS)

Rocco S, Claudio M.; Ramirez-Marquez, Jose Emmanuel

2009-01-01

This paper introduces an evolutionary optimization approach that can be readily applied to solve deterministic network interdiction problems. The network interdiction problem solved considers the minimization of the maximum flow that can be transmitted between a source node and a sink node for a fixed network design when there is a limited amount of resources available to interdict network links. Furthermore, the model assumes that the nominal capacity of each network link and the cost associated with their interdiction can change from link to link. For this problem, the solution approach developed is based on three steps that use: (1) Monte Carlo simulation, to generate potential network interdiction strategies, (2) Ford-Fulkerson algorithm for maximum s-t flow, to analyze strategies' maximum source-sink flow and, (3) an evolutionary optimization technique to define, in probabilistic terms, how likely a link is to appear in the final interdiction strategy. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate the approach. In terms of computational effort, the results illustrate that solutions are obtained from a significantly restricted solution search space. Finally, the authors discuss the need for a reliability perspective to network interdiction, so that solutions developed address more realistic scenarios of such problem

Evolutionary approaches for the reverse-engineering of gene regulatory networks: A study on a biologically realistic dataset

Directory of Open Access Journals (Sweden)

Gidrol Xavier

2008-02-01

Full Text Available Abstract Background Inferring gene regulatory networks from data requires the development of algorithms devoted to structure extraction. When only static data are available, gene interactions may be modelled by a Bayesian Network (BN that represents the presence of direct interactions from regulators to regulees by conditional probability distributions. We used enhanced evolutionary algorithms to stochastically evolve a set of candidate BN structures and found the model that best fits data without prior knowledge. Results We proposed various evolutionary strategies suitable for the task and tested our choices using simulated data drawn from a given bio-realistic network of 35 nodes, the so-called insulin network, which has been used in the literature for benchmarking. We assessed the inferred models against this reference to obtain statistical performance results. We then compared performances of evolutionary algorithms using two kinds of recombination operators that operate at different scales in the graphs. We introduced a niching strategy that reinforces diversity through the population and avoided trapping of the algorithm in one local minimum in the early steps of learning. We show the limited effect of the mutation operator when niching is applied. Finally, we compared our best evolutionary approach with various well known learning algorithms (MCMC, K2, greedy search, TPDA, MMHC devoted to BN structure learning. Conclusion We studied the behaviour of an evolutionary approach enhanced by niching for the learning of gene regulatory networks with BN. We show that this approach outperforms classical structure learning methods in elucidating the original model. These results were obtained for the learning of a bio-realistic network and, more importantly, on various small datasets. This is a suitable approach for learning transcriptional regulatory networks from real datasets without prior knowledge.

A neural network approach to job-shop scheduling.

Science.gov (United States)

Zhou, D N; Cherkassky, V; Baldwin, T R; Olson, D E

1991-01-01

A novel analog computational network is presented for solving NP-complete constraint satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy cost function, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. The proposed approach is related to the linear programming network described by D.W. Tank and J.J. Hopfield (1985), which also uses a linear cost function for a simple optimization problem. It is shown how to map a difficult constraint-satisfaction problem onto a simple neural net in which the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the authors' approach produces better solutions than existing neural approaches to job-shop scheduling, i.e. the traveling salesman problem-type Hopfield approach and integer linear programming approach of J.P.S. Foo and Y. Takefuji (1988), in terms of the quality of the solution and the network complexity.

Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

Energy Technology Data Exchange (ETDEWEB)

Mohammadi, Shahin [Purdue Univ., West Lafayette, IN (United States); Gleich, David F. [Purdue Univ., West Lafayette, IN (United States); Kolda, Tamara G. [Sandia National Laboratories (SNL-CA), Livermore, CA (United States); Grama, Ananth [Purdue Univ., West Lafayette, IN (United States)

2015-11-01

Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangular AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.

SOCIOLOGICAL UNDERSTANDING OF INTERNET: THEORETICAL APPROACHES TO THE NETWORK ANALYSIS

Directory of Open Access Journals (Sweden)

D. E. Dobrinskaya

2016-01-01

Full Text Available The network is an efficient way of social structure analysis for contemporary sociologists. It gives broad opportunities for detailed and fruitful research of different patterns of ties and social relations by quantitative analytical methods and visualization of network models. The network metaphor is used as the most representative tool for description of a new type of society. This new type is characterized by flexibility, decentralization and individualization. Network organizational form became the dominant form in modern societies. The network is also used as a mode of inquiry. Actually three theoretical network approaches in the Internet research case are the most relevant: social network analysis, “network society” theory and actor-network theory. Every theoretical approach has got its own notion of network. Their special methodological and theoretical features contribute to the Internet studies in different ways. The article represents a brief overview of these network approaches. This overview demonstrates the absence of a unified semantic space of the notion of “network” category. This fact, in turn, points out the need for detailed analysis of these approaches to reveal their theoretical and empirical possibilities in application to the Internet studies. 

An individual-based approach to SIR epidemics in contact networks.

Science.gov (United States)

Youssef, Mina; Scoglio, Caterina

2011-08-21

Many approaches have recently been proposed to model the spread of epidemics on networks. For instance, the Susceptible/Infected/Recovered (SIR) compartmental model has successfully been applied to different types of diseases that spread out among humans and animals. When this model is applied on a contact network, the centrality characteristics of the network plays an important role in the spreading process. However, current approaches only consider an aggregate representation of the network structure, which can result in inaccurate analysis. In this paper, we propose a new individual-based SIR approach, which considers the whole description of the network structure. The individual-based approach is built on a continuous time Markov chain, and it is capable of evaluating the state probability for every individual in the network. Through mathematical analysis, we rigorously confirm the existence of an epidemic threshold below which an epidemic does not propagate in the network. We also show that the epidemic threshold is inversely proportional to the maximum eigenvalue of the network. Additionally, we study the role of the whole spectrum of the network, and determine the relationship between the maximum number of infected individuals and the set of eigenvalues and eigenvectors. To validate our approach, we analytically study the deviation with respect to the continuous time Markov chain model, and we show that the new approach is accurate for a large range of infection strength. Furthermore, we compare the new approach with the well-known heterogeneous mean field approach in the literature. Ultimately, we support our theoretical results through extensive numerical evaluations and Monte Carlo simulations. Published by Elsevier Ltd.

Optimizing Low Speed VoIP Network for Rural Next Generation Network (R-NGN

Directory of Open Access Journals (Sweden)

Yoanes Bandung

2007-11-01

Full Text Available In this research, we propose an optimization method based-on E-Model for designing an efficient low speed VoIP network for Rural Next Generation Network (R-NGN. We are choosing 128 kbps and 256 kbps bandwidth as the typical community link to be used in the designing of R-NGN infrastructure. The method is based on selection of some VoIP network parameters such as voice coder, communication protocol, packet loss level, network utilization and resource allocation. We draw analytic approach for achieving rating value (R of E-model that represent level of quality of service. In this approach, we focus on delay and packet loss calculation to find the rating value. We state the rating value = 70 as minimum level of quality of service for each call, equivalent to 3.6 of Mean Opinion Score (MOS. In our experiments, either G.723.1 5.3 kbps or G.729 is chosen for maximizing the number of VoIP calls, it depends on link utilization and level of packet loss.

Parametric motion control of robotic arms: A biologically based approach using neural networks

Science.gov (United States)

Bock, O.; D'Eleuterio, G. M. T.; Lipitkas, J.; Grodski, J. J.

1993-01-01

A neural network based system is presented which is able to generate point-to-point movements of robotic manipulators. The foundation of this approach is the use of prototypical control torque signals which are defined by a set of parameters. The parameter set is used for scaling and shaping of these prototypical torque signals to effect a desired outcome of the system. This approach is based on neurophysiological findings that the central nervous system stores generalized cognitive representations of movements called synergies, schemas, or motor programs. It has been proposed that these motor programs may be stored as torque-time functions in central pattern generators which can be scaled with appropriate time and magnitude parameters. The central pattern generators use these parameters to generate stereotypical torque-time profiles, which are then sent to the joint actuators. Hence, only a small number of parameters need to be determined for each point-to-point movement instead of the entire torque-time trajectory. This same principle is implemented for controlling the joint torques of robotic manipulators where a neural network is used to identify the relationship between the task requirements and the torque parameters. Movements are specified by the initial robot position in joint coordinates and the desired final end-effector position in Cartesian coordinates. This information is provided to the neural network which calculates six torque parameters for a two-link system. The prototypical torque profiles (one per joint) are then scaled by those parameters. After appropriate training of the network, our parametric control design allowed the reproduction of a trained set of movements with relatively high accuracy, and the production of previously untrained movements with comparable accuracy. We conclude that our approach was successful in discriminating between trained movements and in generalizing to untrained movements.

Considerations for Software Defined Networking (SDN): Approaches and use cases

Science.gov (United States)

Bakshi, K.

Software Defined Networking (SDN) is an evolutionary approach to network design and functionality based on the ability to programmatically modify the behavior of network devices. SDN uses user-customizable and configurable software that's independent of hardware to enable networked systems to expand data flow control. SDN is in large part about understanding and managing a network as a unified abstraction. It will make networks more flexible, dynamic, and cost-efficient, while greatly simplifying operational complexity. And this advanced solution provides several benefits including network and service customizability, configurability, improved operations, and increased performance. There are several approaches to SDN and its practical implementation. Among them, two have risen to prominence with differences in pedigree and implementation. This paper's main focus will be to define, review, and evaluate salient approaches and use cases of the OpenFlow and Virtual Network Overlay approaches to SDN. OpenFlow is a communication protocol that gives access to the forwarding plane of a network's switches and routers. The Virtual Network Overlay relies on a completely virtualized network infrastructure and services to abstract the underlying physical network, which allows the overlay to be mobile to other physical networks. This is an important requirement for cloud computing, where applications and associated network services are migrated to cloud service providers and remote data centers on the fly as resource demands dictate. The paper will discuss how and where SDN can be applied and implemented, including research and academia, virtual multitenant data center, and cloud computing applications. Specific attention will be given to the cloud computing use case, where automated provisioning and programmable overlay for scalable multi-tenancy is leveraged via the SDN approach.

Physical approach to quantum networks with massive particles

Science.gov (United States)

Andersen, Molte Emil Strange; Zinner, Nikolaj Thomas

2018-04-01

Assembling large-scale quantum networks is a key goal of modern physics research with applications in quantum information and computation. Quantum wires and waveguides in which massive particles propagate in tailored confinement is one promising platform for realizing a quantum network. In the literature, such networks are often treated as quantum graphs, that is, the wave functions are taken to live on graphs of one-dimensional edges meeting in vertices. Hitherto, it has been unclear what boundary conditions on the vertices produce the physical states one finds in nature. This paper treats a quantum network from a physical approach, explicitly finds the physical eigenstates and compares them to the quantum-graph description. The basic building block of a quantum network is an X-shaped potential well made by crossing two quantum wires, and we consider a massive particle in such an X well. The system is analyzed using a variational method based on an expansion into modes with fast convergence and it provides a very clear intuition for the physics of the problem. The particle is found to have a ground state that is exponentially localized to the center of the X well, and the other symmetric solutions are formed so to be orthogonal to the ground state. This is in contrast to the predictions of the conventionally used so-called Kirchoff boundary conditions in quantum graph theory that predict a different sequence of symmetric solutions that cannot be physically realized. Numerical methods have previously been the only source of information on the ground-state wave function and our results provide a different perspective with strong analytical insights. The ground-state wave function has a spatial profile that looks very similar to the shape of a solitonic solution to a nonlinear Schrödinger equation, enabling an analytical prediction of the wave number. When combining multiple X wells into a network or grid, each site supports a solitonlike localized state. These

Extending network approach to language dynamics and human cognition. Comment on "Approaching human language with complex networks" by Cong and Liu

Science.gov (United States)

Gong, Tao; Shuai, Lan; Wu, Yicheng

2014-12-01

By analyzing complex networks constructed from authentic language data, Cong and Liu [1] advance linguistics research into the big data era. The network approach has revealed many intrinsic generalities and crucial differences at both the macro and micro scales between human languages. The axiom behind this research is that language is a complex adaptive system [2]. Although many lexical, semantic, or syntactic features have been discovered by means of analyzing the static and dynamic linguistic networks of world languages, available network-based language studies have not explicitly addressed the evolutionary dynamics of language systems and the correlations between language and human cognition. This commentary aims to provide some insights on how to use the network approach to study these issues.

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.

Limnimeter and rain gauge FDI in sewer networks using an interval parity equations based detection approach and an enhanced isolation scheme

OpenAIRE

Puig Cayuela, Vicenç; Blesa Izquierdo, Joaquim

2013-01-01

In this paper, a methodology for limnimeter and rain-gauge fault detection and isolation (FDI) in sewer networks is presented. The proposed model based FDI approach uses interval parity equations for fault detection in order to enhance robustness against modelling errors and noise. They both are assumed unknown but bounded, following the so-called interval (or set-membership) approach. On the other hand, fault isolation relies on an algorithm that reasons using several fault signature matrice...

A game-theoretic approach to optimize ad hoc networks inspired by small-world network topology

Science.gov (United States)

Tan, Mian; Yang, Tinghong; Chen, Xing; Yang, Gang; Zhu, Guoqing; Holme, Petter; Zhao, Jing

2018-03-01

Nodes in ad hoc networks are connected in a self-organized manner. Limited communication radius makes information transmit in multi-hop mode, and each forwarding needs to consume the energy of nodes. Insufficient communication radius or exhaustion of energy may cause the absence of some relay nodes and links, further breaking network connectivity. On the other hand, nodes in the network may refuse to cooperate due to objective faulty or personal selfish, hindering regular communication in the network. This paper proposes a model called Repeated Game in Small World Networks (RGSWN). In this model, we first construct ad hoc networks with small-world feature by forming "communication shortcuts" between multiple-radio nodes. Small characteristic path length reduces average forwarding times in networks; meanwhile high clustering coefficient enhances network robustness. Such networks still maintain relative low global power consumption, which is beneficial to extend the network survival time. Then we use MTTFT strategy (Mend-Tolerance Tit-for-Tat) for repeated game as a rule for the interactions between neighbors in the small-world networks. Compared with other five strategies of repeated game, this strategy not only punishes the nodes' selfishness more reasonably, but also has the best tolerance to the network failure. This work is insightful for designing an efficient and robust ad hoc network.

BUSINESS MODELS FOR EXTENDING OF 112 EMERGENCY CALL CENTER CAPABILITIES WITH E-CALL FUNCTION INSERTION

Directory of Open Access Journals (Sweden)

Pop Dragos Paul

2010-12-01

Full Text Available The present article concerns present status of implementation in Romania and Europe of eCall service and the proposed business models regarding eCall function implementation in Romania. eCall system is used for reliable transmission in case of crush between In Vehicle System and Public Service Answering Point, via the voice channel of cellular and Public Switched Telephone Network (PSTN. eCall service could be initiated automatically or manual the driver. All data presented in this article are part of researches made by authors in the Sectorial Contract Implementation study regarding eCall system, having as partners ITS Romania and Electronic Solution, with the Romanian Ministry of Communication and Information Technology as beneficiary.

Calling vs Receiving Party Pays: Market Penetration and the Importance of the Call Externality

OpenAIRE

Tommaso Majer; Michele Pistollato

2010-01-01

In this paper we study how the access price affects the choice of the tariff regime taken by the network operators. We show that for high values of the access price, that is taken as a parameter by the firms, networks decide to charge only the callers. Otherwise, for low values of the access charge, networks charge also the receivers. Moreover, we compare market penetration and total welfare between the two price regimes. Our model suggests that, for high values of call externality, market pe...

Calling vs receiving party pays : market penetration and the importance of the call externality

OpenAIRE

Majer, Tommaso

2011-01-01

In this paper we study how the access price affects the choice of the tariff regime taken by the network operators. We show that for high values of the access price, that is taken as a parameter by the firms, networks decide to charge only the callers. Otherwise, for low values of the access charge, networks charge also the receivers. Moreover, we compare market penetration and total welfare between the two price regimes. Our model suggests that, for high values of call externality, market pe...

A HYBRID GENETIC ALGORITHM-NEURAL NETWORK APPROACH FOR PRICING CORES AND REMANUFACTURED CORES

Directory of Open Access Journals (Sweden)

M. Seidi

2012-01-01

Full Text Available

ENGLISH ABSTRACT:Sustainability has become a major issue in most economies, causing many leading companies to focus on product recovery and reverse logistics. Remanufacturing is an industrial process that makes used products reusable. One of the important aspects in both reverse logistics and remanufacturing is the pricing of returned and remanufactured products (called cores. In this paper, we focus on pricing the cores and remanufactured cores. First we present a mathematical model for this purpose. Since this model does not satisfy our requirements, we propose a simulation optimisation approach. This approach consists of a hybrid genetic algorithm based on a neural network employed as the fitness function. We use automata learning theory to obtain the learning rate required for training the neural network. Numerical results demonstrate that the optimal value of the acquisition price of cores and price of remanufactured cores is obtained by this approach.

AFRIKAANSE OPSOMMING: Volhoubaarheid het ‘n belangrike saak geword in die meeste ekonomieë, wat verskeie maatskappye genoop het om produkherwinning en omgekeerde logistiek te onder oë te neem. Hervervaardiging is ‘n industriële proses wat gebruikte produkte weer bruikbaar maak. Een van die belangrike aspekte in beide omgekeerde logistiek en hervervaardiging is die prysbepaling van herwinne en hervervaardigde produkte. Hierdie artikel fokus op die prysbepalingsaspekte by wyse van ‘n wiskundige model.

The Role of Qualitative Approaches to Research in CALL Contexts: Closing in on the Learner's Experience

Science.gov (United States)

Levy, Mike

2015-01-01

The article considers the role of qualitative research methods in CALL through describing a series of examples. These examples are used to highlight the importance and value of qualitative data in relation to a specific research objective in CALL. The use of qualitative methods in conjunction with other approaches as in mixed method research…

Contingent approach to Internet-based supply network integration

Science.gov (United States)

Ho, Jessica; Boughton, Nick; Kehoe, Dennis; Michaelides, Zenon

2001-10-01

The Internet is playing an increasingly important role in enhancing the operations of supply networks as many organizations begin to recognize the benefits of Internet- enabled supply arrangements. However, the developments and applications to-date do not extend significantly beyond the dyadic model, whereas the real advantages are to be made with the external and network models to support a coordinated and collaborative based approach. The DOMAIN research group at the University of Liverpool is currently defining new Internet- enabled approaches to enable greater collaboration across supply chains. Different e-business models and tools are focusing on different applications. Using inappropriate e- business models, tools or techniques will bring negative results instead of benefits to all the tiers in the supply network. Thus there are a number of issues to be considered before addressing Internet based supply network integration, in particular an understanding of supply chain management, the emergent business models and evaluating the effects of deploying e-business to the supply network or a particular tier. It is important to utilize a contingent approach to selecting the right e-business model to meet the specific supply chain requirements. This paper addresses the issues and provides a case study on the indirect materials supply networks.

The neural network approach to parton fitting

International Nuclear Information System (INIS)

Rojo, Joan; Latorre, Jose I.; Del Debbio, Luigi; Forte, Stefano; Piccione, Andrea

2005-01-01

We introduce the neural network approach to global fits of parton distribution functions. First we review previous work on unbiased parametrizations of deep-inelastic structure functions with faithful estimation of their uncertainties, and then we summarize the current status of neural network parton distribution fits

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

Science.gov (United States)

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

2017-05-01

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

Discovering the Network Topology: An Efficient Approach for SDN

Directory of Open Access Journals (Sweden)

Leonardo OCHOA-ADAY

2016-11-01

Full Text Available Network topology is a physical description of the overall resources in the network. Collecting this information using efficient mechanisms becomes a critical task for important network functions such as routing, network management, quality of service (QoS, among many others. Recent technologies like Software-Defined Networks (SDN have emerged as promising approaches for managing the next generation networks. In order to ensure a proficient topology discovery service in SDN, we propose a simple agents-based mechanism. This mechanism improves the overall efficiency of the topology discovery process. In this paper, an algorithm for a novel Topology Discovery Protocol (SD-TDP is described. This protocol will be implemented in each switch through a software agent. Thus, this approach will provide a distributed solution to solve the problem of network topology discovery in a more simple and efficient way.

Obtaining informedness in collaborative networks through automated information provisioning

DEFF Research Database (Denmark)

Thimm, Heiko; Rasmussen, Karsten Boye

2013-01-01

Successful collaboration in business networks calls for well-informed network participants. Members who know about the many aspects of the network are an effective vehicle to successfully resolve conflicts, build a prospering collaboration climate and promote trust within the network. The importa......Successful collaboration in business networks calls for well-informed network participants. Members who know about the many aspects of the network are an effective vehicle to successfully resolve conflicts, build a prospering collaboration climate and promote trust within the network...... provisioning service. This article presents a corresponding modelling framework and a rule-based approach for the active system capabilities required. Details of a prototype implementation building on concepts of the research area of active databases are also reported....

A Network Approach to Analyzing Highly Recombinant Malaria Parasite Genes

Science.gov (United States)

Larremore, Daniel B.; Clauset, Aaron; Buckee, Caroline O.

2013-01-01

The var genes of the human malaria parasite Plasmodium falciparum present a challenge to population geneticists due to their extreme diversity, which is generated by high rates of recombination. These genes encode a primary antigen protein called PfEMP1, which is expressed on the surface of infected red blood cells and elicits protective immune responses. Var gene sequences are characterized by pronounced mosaicism, precluding the use of traditional phylogenetic tools that require bifurcating tree-like evolutionary relationships. We present a new method that identifies highly variable regions (HVRs), and then maps each HVR to a complex network in which each sequence is a node and two nodes are linked if they share an exact match of significant length. Here, networks of var genes that recombine freely are expected to have a uniformly random structure, but constraints on recombination will produce network communities that we identify using a stochastic block model. We validate this method on synthetic data, showing that it correctly recovers populations of constrained recombination, before applying it to the Duffy Binding Like-α (DBLα) domain of var genes. We find nine HVRs whose network communities map in distinctive ways to known DBLα classifications and clinical phenotypes. We show that the recombinational constraints of some HVRs are correlated, while others are independent. These findings suggest that this micromodular structuring facilitates independent evolutionary trajectories of neighboring mosaic regions, allowing the parasite to retain protein function while generating enormous sequence diversity. Our approach therefore offers a rigorous method for analyzing evolutionary constraints in var genes, and is also flexible enough to be easily applied more generally to any highly recombinant sequences. PMID:24130474

A network approach to analyzing highly recombinant malaria parasite genes.

Science.gov (United States)

Larremore, Daniel B; Clauset, Aaron; Buckee, Caroline O

2013-01-01

The var genes of the human malaria parasite Plasmodium falciparum present a challenge to population geneticists due to their extreme diversity, which is generated by high rates of recombination. These genes encode a primary antigen protein called PfEMP1, which is expressed on the surface of infected red blood cells and elicits protective immune responses. Var gene sequences are characterized by pronounced mosaicism, precluding the use of traditional phylogenetic tools that require bifurcating tree-like evolutionary relationships. We present a new method that identifies highly variable regions (HVRs), and then maps each HVR to a complex network in which each sequence is a node and two nodes are linked if they share an exact match of significant length. Here, networks of var genes that recombine freely are expected to have a uniformly random structure, but constraints on recombination will produce network communities that we identify using a stochastic block model. We validate this method on synthetic data, showing that it correctly recovers populations of constrained recombination, before applying it to the Duffy Binding Like-α (DBLα) domain of var genes. We find nine HVRs whose network communities map in distinctive ways to known DBLα classifications and clinical phenotypes. We show that the recombinational constraints of some HVRs are correlated, while others are independent. These findings suggest that this micromodular structuring facilitates independent evolutionary trajectories of neighboring mosaic regions, allowing the parasite to retain protein function while generating enormous sequence diversity. Our approach therefore offers a rigorous method for analyzing evolutionary constraints in var genes, and is also flexible enough to be easily applied more generally to any highly recombinant sequences.

A network approach to analyzing highly recombinant malaria parasite genes.

Directory of Open Access Journals (Sweden)

Daniel B Larremore

Full Text Available The var genes of the human malaria parasite Plasmodium falciparum present a challenge to population geneticists due to their extreme diversity, which is generated by high rates of recombination. These genes encode a primary antigen protein called PfEMP1, which is expressed on the surface of infected red blood cells and elicits protective immune responses. Var gene sequences are characterized by pronounced mosaicism, precluding the use of traditional phylogenetic tools that require bifurcating tree-like evolutionary relationships. We present a new method that identifies highly variable regions (HVRs, and then maps each HVR to a complex network in which each sequence is a node and two nodes are linked if they share an exact match of significant length. Here, networks of var genes that recombine freely are expected to have a uniformly random structure, but constraints on recombination will produce network communities that we identify using a stochastic block model. We validate this method on synthetic data, showing that it correctly recovers populations of constrained recombination, before applying it to the Duffy Binding Like-α (DBLα domain of var genes. We find nine HVRs whose network communities map in distinctive ways to known DBLα classifications and clinical phenotypes. We show that the recombinational constraints of some HVRs are correlated, while others are independent. These findings suggest that this micromodular structuring facilitates independent evolutionary trajectories of neighboring mosaic regions, allowing the parasite to retain protein function while generating enormous sequence diversity. Our approach therefore offers a rigorous method for analyzing evolutionary constraints in var genes, and is also flexible enough to be easily applied more generally to any highly recombinant sequences.

WebScore: An Effective Page Scoring Approach for Uncertain Web Social Networks

Directory of Open Access Journals (Sweden)

Shaojie Qiao

2011-10-01

Full Text Available To effectively score pages with uncertainty in web social networks, we first proposed a new concept called transition probability matrix and formally defined the uncertainty in web social networks. Second, we proposed a hybrid page scoring algorithm, called WebScore, based on the PageRank algorithm and three centrality measures including degree, betweenness, and closeness. Particularly,WebScore takes into a full consideration of the uncertainty of web social networks by computing the transition probability from one page to another. The basic idea ofWebScore is to: (1 integrate uncertainty into PageRank in order to accurately rank pages, and (2 apply the centrality measures to calculate the importance of pages in web social networks. In order to verify the performance of WebScore, we developed a web social network analysis system which can partition web pages into distinct groups and score them in an effective fashion. Finally, we conducted extensive experiments on real data and the results show that WebScore is effective at scoring uncertain pages with less time deficiency than PageRank and centrality measures based page scoring algorithms.

Social-Driven Information Dissemination for Mobile Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Basim MAHMOOD

2015-06-01

Full Text Available As we move into the so-called Internet of Things (IoT, the boundary between sensor networks and social networks is likely to disappear. Moreover, previous works argue that mobility in sensor networks may become a consequence of human movement making the understanding of human mobility crucial to the design of sensor networks. When people carry sensors, they become able to use concepts from social networks in the design of sensor network infrastructures. However, to this date, the utilization of social networks in designing protocols for wireless sensor networks has not received much attention. In this paper, we focus on the concept of information dissemination in a framework where sensors are carried by people who, like most of us, are part of a social network. We propose two social-based forwarding approaches for what has been called Social Network of Sensors (SNoS. To this end, we exploit two important characteristics of ties in social networks, namely strong ties and weak ties. The former is used to achieve rapid dissemination to nearby sensors while the latter aims at dissemination to faraway sensors. We compared our results against two well-known approaches in the literature: Epidemic and PRoPHET protocols. We evaluate our approaches according to four criteria: information-dissemination distance, information-dissemination coverage area, the number of messages exchanged, and information delivery time. We believe this is the first work that investigates the issues of information-dissemination distance and information-dissemination coverage area using an approach inspired on social network concepts.

An Intelligent Approach to Observability of Distribution Networks

DEFF Research Database (Denmark)

Pokhrel, Basanta Raj; Nainar, Karthikeyan; Bak-Jensen, Birgitte

2018-01-01

This paper presents a novel intelligent observability approach for active distribution systems. Observability assessment of the measured power system network, which is a preliminary task in state estimation, is handled via an algebraic method that uses the triangular factors of singular, symmetric...... gain matrix accompanied by a minimum meter placement technique. In available literature, large numbers of pseudo measurements are used to cover the scarcity of sufficient real measurements in distribution systems; the values of these virtual meters are calculated value based on the available real...... measurements, network topology, and network parameters. However, since there are large margin of errors exist in the calculation phase, estimated states may be significantly differed from the actual values though network is classified as observable. Hence, an approach based on numerical observability analysis...

A Predictive Approach to Network Reverse-Engineering

Science.gov (United States)

Wiggins, Chris

2005-03-01

A central challenge of systems biology is the ``reverse engineering" of transcriptional networks: inferring which genes exert regulatory control over which other genes. Attempting such inference at the genomic scale has only recently become feasible, via data-intensive biological innovations such as DNA microrrays (``DNA chips") and the sequencing of whole genomes. In this talk we present a predictive approach to network reverse-engineering, in which we integrate DNA chip data and sequence data to build a model of the transcriptional network of the yeast S. cerevisiae capable of predicting the response of genes in unseen experiments. The technique can also be used to extract ``motifs,'' sequence elements which act as binding sites for regulatory proteins. We validate by a number of approaches and present comparison of theoretical prediction vs. experimental data, along with biological interpretations of the resulting model. En route, we will illustrate some basic notions in statistical learning theory (fitting vs. over-fitting; cross- validation; assessing statistical significance), highlighting ways in which physicists can make a unique contribution in data- driven approaches to reverse engineering.

Network attacks and defenses a hands-on approach

CERN Document Server

Trabelsi, Zouheir; Al Braiki, Arwa; Mathew, Sujith Samuel

2012-01-01

The attacks on computers and business networks are growing daily, and the need for security professionals who understand how malfeasants perform attacks and compromise networks is a growing requirement to counter the threat. Network security education generally lacks appropriate textbooks with detailed, hands-on exercises that include both offensive and defensive techniques. Using step-by-step processes to build and generate attacks using offensive techniques, Network Attacks and Defenses: A Hands-on Approach enables students to implement appropriate network security solutions within a laborat

Call Admission Scheme for Multidimensional Traffic Assuming Finite Handoff User

Directory of Open Access Journals (Sweden)

Md. Baitul Al Sadi

2017-01-01

Full Text Available Usually, the number of users within a cell in a mobile cellular network is considered infinite; hence, M/M/n/k model is appropriate for new originated traffic, but the number of ongoing calls around a cell is always finite. Hence, the traffic model of handoff call will be M/M/n/k/N. In this paper, a K-dimensional traffic model of a mobile cellular network is proposed using the combination of limited and unlimited users case. A new call admission scheme (CAS is proposed based on both thinning scheme and fading condition. The fading condition of the wireless channel access to a handoff call is prioritized compared to newly originated calls.

Collectivism as Potlatch in the Network Age

OpenAIRE

Iitaka, Toshikazu

2012-01-01

This paper is about collectivism in the network age. Many previous studies about network society consider collectivism to be an important factor for innovation in the network age. However, a few studies about seken focus on the negative effects of collectivism. Both approaches focus on the tradition of exchanging or giving gifts, called potlatch or gift culture, often observed in premodern communities. This tradition is considered a significant aspect for frequent networking, including inn...

An adaptive clustering approach to dynamic load balancing and energy efficiency in wireless sensor networks

International Nuclear Information System (INIS)

Gherbi, Chirihane; Aliouat, Zibouda; Benmohammed, Mohamed

2016-01-01

Clustering is a well known approach to cope with large nodes density and efficiently conserving energy in Wireless Sensor Networks (WSN). Load balancing is an effective approach for optimizing resources like channel bandwidth, the main objective of this paper is to combine these two valuable approaches in order to significantly improve the main WSN service such as information routing. So, our proposal is a routing protocol in which load traffic is shared among cluster members in order to reduce the dropping probability due to queue overflow at some nodes. To this end, a novel hierarchical approach, called Hierarchical Energy-Balancing Multipath routing protocol for Wireless Sensor Networks (HEBM) is proposed. The HEBM approach aims to fulfill the following purposes: decreasing the overall network energy consumption, balancing the energy dissipation among the sensor nodes and as direct consequence: extending the lifetime of the network. In fact, the cluster-heads are optimally determined and suitably distributed over the area of interest allowing the member nodes reaching them with adequate energy dissipation and appropriate load balancing utilization. In addition, nodes radio are turned off for fixed time duration according to sleeping control rules optimizing so their energy consumption. The performance evaluation of the proposed protocol is carried out through the well-known NS2 simulator and the exhibited results are convincing. Like this, the residual energy of sensor nodes was measured every 20 s throughout the duration of simulation, in order to calculate the total number of alive nodes. Based on the simulation results, we concluded that our proposed HEBM protocol increases the profit of energy, and prolongs the network lifetime duration from 32% to 40% compared to DEEAC reference protocol and from 25% to 28% compared to FEMCHRP protocol. The authors also note that the proposed protocol is 41.7% better than DEEAC with respect to FND (Fist node die), and 25

IPTV inter-destination synchronization: A network-based approach

NARCIS (Netherlands)

Stokking, H.M.; Deventer, M.O. van; Niamut, O.A.; Walraven, F.A.; Mekuria, R.N.

2010-01-01

This paper introduces a novel network-based approach to inter-destination media synchronization. The approach meets the need for synchronization in advanced TV concepts like social TV and offers high scalability, unlike conventional end-point based approaches. The solution for interdestination media

A Gaussian graphical model approach to climate networks

International Nuclear Information System (INIS)

Zerenner, Tanja; Friederichs, Petra; Hense, Andreas; Lehnertz, Klaus

2014-01-01

Distinguishing between direct and indirect connections is essential when interpreting network structures in terms of dynamical interactions and stability. When constructing networks from climate data the nodes are usually defined on a spatial grid. The edges are usually derived from a bivariate dependency measure, such as Pearson correlation coefficients or mutual information. Thus, the edges indistinguishably represent direct and indirect dependencies. Interpreting climate data fields as realizations of Gaussian Random Fields (GRFs), we have constructed networks according to the Gaussian Graphical Model (GGM) approach. In contrast to the widely used method, the edges of GGM networks are based on partial correlations denoting direct dependencies. Furthermore, GRFs can be represented not only on points in space, but also by expansion coefficients of orthogonal basis functions, such as spherical harmonics. This leads to a modified definition of network nodes and edges in spectral space, which is motivated from an atmospheric dynamics perspective. We construct and analyze networks from climate data in grid point space as well as in spectral space, and derive the edges from both Pearson and partial correlations. Network characteristics, such as mean degree, average shortest path length, and clustering coefficient, reveal that the networks posses an ordered and strongly locally interconnected structure rather than small-world properties. Despite this, the network structures differ strongly depending on the construction method. Straightforward approaches to infer networks from climate data while not regarding any physical processes may contain too strong simplifications to describe the dynamics of the climate system appropriately

A Gaussian graphical model approach to climate networks

Energy Technology Data Exchange (ETDEWEB)

Zerenner, Tanja, E-mail: tanjaz@uni-bonn.de [Meteorological Institute, University of Bonn, Auf dem Hügel 20, 53121 Bonn (Germany); Friederichs, Petra; Hense, Andreas [Meteorological Institute, University of Bonn, Auf dem Hügel 20, 53121 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brühler Straße 7, 53119 Bonn (Germany); Lehnertz, Klaus [Department of Epileptology, University of Bonn, Sigmund-Freud-Straße 25, 53105 Bonn (Germany); Helmholtz Institute for Radiation and Nuclear Physics, University of Bonn, Nussallee 14-16, 53115 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brühler Straße 7, 53119 Bonn (Germany)

2014-06-15

Distinguishing between direct and indirect connections is essential when interpreting network structures in terms of dynamical interactions and stability. When constructing networks from climate data the nodes are usually defined on a spatial grid. The edges are usually derived from a bivariate dependency measure, such as Pearson correlation coefficients or mutual information. Thus, the edges indistinguishably represent direct and indirect dependencies. Interpreting climate data fields as realizations of Gaussian Random Fields (GRFs), we have constructed networks according to the Gaussian Graphical Model (GGM) approach. In contrast to the widely used method, the edges of GGM networks are based on partial correlations denoting direct dependencies. Furthermore, GRFs can be represented not only on points in space, but also by expansion coefficients of orthogonal basis functions, such as spherical harmonics. This leads to a modified definition of network nodes and edges in spectral space, which is motivated from an atmospheric dynamics perspective. We construct and analyze networks from climate data in grid point space as well as in spectral space, and derive the edges from both Pearson and partial correlations. Network characteristics, such as mean degree, average shortest path length, and clustering coefficient, reveal that the networks posses an ordered and strongly locally interconnected structure rather than small-world properties. Despite this, the network structures differ strongly depending on the construction method. Straightforward approaches to infer networks from climate data while not regarding any physical processes may contain too strong simplifications to describe the dynamics of the climate system appropriately.

A Feedback-Based Secure Path Approach for Wireless Sensor Network Data Collection

Science.gov (United States)

Mao, Yuxin; Wei, Guiyi

2010-01-01

The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose. PMID:22163424

A feedback-based secure path approach for wireless sensor network data collection.

Science.gov (United States)

Mao, Yuxin; Wei, Guiyi

2010-01-01

The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose.

A Feedback-Based Secure Path Approach for Wireless Sensor Network Data Collection

Directory of Open Access Journals (Sweden)

Guiyi Wei

2010-10-01

Full Text Available The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose.

Maximizing lifetime of wireless sensor networks using genetic approach

DEFF Research Database (Denmark)

Wagh, Sanjeev; Prasad, Ramjee

2014-01-01

The wireless sensor networks are designed to install the smart network applications or network for emergency solutions, where human interaction is not possible. The nodes in wireless sensor networks have to self organize as per the users requirements through monitoring environments. As the sensor......-objective parameters are considered to solve the problem using genetic algorithm of evolutionary approach.......The wireless sensor networks are designed to install the smart network applications or network for emergency solutions, where human interaction is not possible. The nodes in wireless sensor networks have to self organize as per the users requirements through monitoring environments. As the sensor...

The AGING Initiative experience: a call for sustained support for team science networks.

Science.gov (United States)

Garg, Tullika; Anzuoni, Kathryn; Landyn, Valentina; Hajduk, Alexandra; Waring, Stephen; Hanson, Leah R; Whitson, Heather E

2018-05-18

Team science, defined as collaborative research efforts that leverage the expertise of diverse disciplines, is recognised as a critical means to address complex healthcare challenges, but the practical implementation of team science can be difficult. Our objective is to describe the barriers, solutions and lessons learned from our team science experience as applied to the complex and growing challenge of multiple chronic conditions (MCC). MCC is the presence of two or more chronic conditions that have a collective adverse effect on health status, function or quality of life, and that require complex healthcare management, decision-making or coordination. Due to the increasing impact on the United States society, MCC research has been identified as a high priority research area by multiple federal agencies. In response to this need, two national research entities, the Healthcare Systems Research Network (HCSRN) and the Claude D. Pepper Older Americans Independence Centers (OAIC), formed the Advancing Geriatrics Infrastructure and Network Growth (AGING) Initiative to build nationwide capacity for MCC team science. This article describes the structure, lessons learned and initial outcomes of the AGING Initiative. We call for funding mechanisms to sustain infrastructures that have demonstrated success in fostering team science and innovation in translating findings to policy change necessary to solve complex problems in healthcare.

Social network approaches to leadership: an integrative conceptual review.

Science.gov (United States)

Carter, Dorothy R; DeChurch, Leslie A; Braun, Michael T; Contractor, Noshir S

2015-05-01

Contemporary definitions of leadership advance a view of the phenomenon as relational, situated in specific social contexts, involving patterned emergent processes, and encompassing both formal and informal influence. Paralleling these views is a growing interest in leveraging social network approaches to study leadership. Social network approaches provide a set of theories and methods with which to articulate and investigate, with greater precision and rigor, the wide variety of relational perspectives implied by contemporary leadership theories. Our goal is to advance this domain through an integrative conceptual review. We begin by answering the question of why-Why adopt a network approach to study leadership? Then, we offer a framework for organizing prior research. Our review reveals 3 areas of research, which we term: (a) leadership in networks, (b) leadership as networks, and (c) leadership in and as networks. By clarifying the conceptual underpinnings, key findings, and themes within each area, this review serves as a foundation for future inquiry that capitalizes on, and programmatically builds upon, the insights of prior work. Our final contribution is to advance an agenda for future research that harnesses the confluent ideas at the intersection of leadership in and as networks. Leadership in and as networks represents a paradigm shift in leadership research-from an emphasis on the static traits and behaviors of formal leaders whose actions are contingent upon situational constraints, toward an emphasis on the complex and patterned relational processes that interact with the embedding social context to jointly constitute leadership emergence and effectiveness. (c) 2015 APA, all rights reserved.

Small "p" Publishing: A Networked Blogging Approach to Academic Discourse

Science.gov (United States)

Martin, Julia W.; Hughes, Brian

2012-01-01

This article highlights a middle ground for academic publishing between formal peer-reviewed journals and informal blogging that we call "Small "p" Publishing." Having implemented and tested a publishing network that illustrates this middle ground, we describe its unique contributions to scholars and learning communities. Three features that…

A network approach for distinguishing ethical issues in research and development.

Science.gov (United States)

Zwart, Sjoerd D; van de Poel, Ibo; van Mil, Harald; Brumsen, Michiel

2006-10-01

In this paper we report on our experiences with using network analysis to discern and analyse ethical issues in research into, and the development of, a new wastewater treatment technology. Using network analysis, we preliminarily interpreted some of our observations in a Group Decision Room (GDR) session where we invited important stakeholders to think about the risks of this new technology. We show how a network approach is useful for understanding the observations, and suggests some relevant ethical issues. We argue that a network approach is also useful for ethical analysis of issues in other fields of research and development. The abandoning of the overarching rationality assumption, which is central to network approaches, does not have to lead to ethical relativism.

Multi-modal Social Networks: A MRF Learning Approach

Science.gov (United States)

2016-06-20

Network forensics: random infection vs spreading epidemic , Proceedings of ACM Sigmetrics. 11-JUN-12, London, UK. : , TOTAL: 4 06/09/2016 Received Paper...Multi-modal Social Networks A MRF Learning Approach The work primarily focused on two lines of research. 1. We propose new greedy algorithms...Box 12211 Research Triangle Park, NC 27709-2211 social networks , learning and inference REPORT DOCUMENTATION PAGE 11. SPONSOR/MONITOR’S REPORT

Building a glaucoma interaction network using a text mining approach.

Science.gov (United States)

Soliman, Maha; Nasraoui, Olfa; Cooper, Nigel G F

2016-01-01

The volume of biomedical literature and its underlying knowledge base is rapidly expanding, making it beyond the ability of a single human being to read through all the literature. Several automated methods have been developed to help make sense of this dilemma. The present study reports on the results of a text mining approach to extract gene interactions from the data warehouse of published experimental results which are then used to benchmark an interaction network associated with glaucoma. To the best of our knowledge, there is, as yet, no glaucoma interaction network derived solely from text mining approaches. The presence of such a network could provide a useful summative knowledge base to complement other forms of clinical information related to this disease. A glaucoma corpus was constructed from PubMed Central and a text mining approach was applied to extract genes and their relations from this corpus. The extracted relations between genes were checked using reference interaction databases and classified generally as known or new relations. The extracted genes and relations were then used to construct a glaucoma interaction network. Analysis of the resulting network indicated that it bears the characteristics of a small world interaction network. Our analysis showed the presence of seven glaucoma linked genes that defined the network modularity. A web-based system for browsing and visualizing the extracted glaucoma related interaction networks is made available at http://neurogene.spd.louisville.edu/GlaucomaINViewer/Form1.aspx. This study has reported the first version of a glaucoma interaction network using a text mining approach. The power of such an approach is in its ability to cover a wide range of glaucoma related studies published over many years. Hence, a bigger picture of the disease can be established. To the best of our knowledge, this is the first glaucoma interaction network to summarize the known literature. The major findings were a set of

Why Failing Terrorist Groups Persist Revisited: A Social Network Approach to AQIM Network Resilience

Science.gov (United States)

2017-12-01

the approach and methods used in this analysis to organize, analyze, and explore the geospatial, statistical , and social network data...requirements for the degree of MASTER OF SCIENCE IN INFORMATION STRATEGY AND POLITICAL WARFARE from the NAVAL POSTGRADUATE SCHOOL December...research utilizes both descriptive statistics and regression analysis of social network data to explore the changes within the AQIM network 2012

Networks and social capital: a relational approach to primary healthcare reform

Directory of Open Access Journals (Sweden)

Scott Catherine

2007-09-01

Full Text Available Abstract Collaboration among health care providers and across systems is proposed as a strategy to improve health care delivery the world over. Over the past two decades, health care providers have been encouraged to work in partnership and build interdisciplinary teams. More recently, the notion of networks has entered this discourse but the lack of consensus and understanding about what is meant by adopting a network approach in health services limits its use. Also crucial to this discussion is the work of distinguishing the nature and extent of the impact of social relationships – generally referred to as social capital. In this paper, we review the rationale for collaboration in health care systems; provide an overview and synthesis of key concepts; dispel some common misconceptions of networks; and apply the theory to an example of primary healthcare network reform in Alberta (Canada. Our central thesis is that a relational approach to systems change, one based on a synthesis of network theory and social capital can provide the fodation for a multi-focal approach to primary healthcare reform. Action strategies are recommended to move from an awareness of 'networks' to fully translating knowledge from existing theory to guide planning and practice innovations. Decision-makers are encouraged to consider a multi-focal approach that effectively incorporates a network and social capital approach in planning and evaluating primary healthcare reform.

A Visual Analytics Approach for Extracting Spatio-Temporal Urban Mobility Information from Mobile Network Traffic

Directory of Open Access Journals (Sweden)

Euro Beinat

2012-11-01

Full Text Available In this paper we present a visual analytics approach for deriving spatio-temporal patterns of collective human mobility from a vast mobile network traffic data set. More than 88 million movements between pairs of radio cells—so-called handovers—served as a proxy for more than two months of mobility within four urban test areas in Northern Italy. In contrast to previous work, our approach relies entirely on visualization and mapping techniques, implemented in several software applications. We purposefully avoid statistical or probabilistic modeling and, nonetheless, reveal characteristic and exceptional mobility patterns. The results show, for example, surprising similarities and symmetries amongst the total mobility and people flows between the test areas. Moreover, the exceptional patterns detected can be associated to real-world events such as soccer matches. We conclude that the visual analytics approach presented can shed new light on large-scale collective urban mobility behavior and thus helps to better understand the “pulse” of dynamic urban systems.

Applications of a formal approach to decipher discrete genetic networks.

Science.gov (United States)

Corblin, Fabien; Fanchon, Eric; Trilling, Laurent

2010-07-20

A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant and applicable to address questions raised by biologists about such networks. The behaviour of these systems being complex, it is essential to exploit efficiently every bit of experimental information. In our approach, both the evolution rules and the partial knowledge about the structure and the behaviour of the network are formalized using a common constraint-based language. In this article our formal and declarative approach is applied to three biological applications. The software environment that we developed allows to specifically address each application through a new class of biologically relevant queries. We show that we can describe easily and in a formal manner the partial knowledge about a genetic network. Moreover we show that this environment, based on a constraint algorithmic approach, offers a wide variety of functionalities, going beyond simple simulations, such as proof of consistency, model revision, prediction of properties, search for minimal models relatively to specified criteria. The formal approach proposed here deeply changes the way to proceed in the exploration of genetic and biochemical networks, first by avoiding the usual trial-and-error procedure, and second by placing the emphasis on sets of solutions, rather than a single solution arbitrarily chosen among many others. Last, the constraint approach promotes an integration of model and experimental data in a single framework.

Call for Papers: Photonics in Switching

Science.gov (United States)

Wosinska, Lena; Glick, Madeleine

2006-04-01

Call for Papers: Photonics in Switching Guest Editors: Lena Wosinska, Royal Institute of Technology (KTH) / ICT Sweden Madeleine Glick, Intel Research, Cambridge, UK Technologies based on DWDM systems allow data transmission with bit rates of Tbit/s on a single fiber. To facilitate this enormous transmission volume, high-capacity and high-speed network nodes become inevitable in the optical network. Wideband switching, WDM switching, optical burst switching (OBS), and optical packet switching (OPS) are promising technologies for harnessing the bandwidth of WDM optical fiber networks in a highly flexible and efficient manner. As a number of key optical component technologies approach maturity, photonics in switching is becoming an increasingly attractive and practical solution for the next-generation of optical networks. The scope of this special issue is focused on the technology and architecture of optical switching nodes, including the architectural and algorithmic aspects of high-speed optical networks. Scope of Submission The scope of the papers includes, but is not limited to, the following topics: WDM node architectures Novel device technologies enabling photonics in switching, such as optical switch fabrics, optical memory, and wavelength conversion Routing protocols WDM switching and routing Quality of service Performance measurement and evaluation Next-generation optical networks: architecture, signaling, and control Traffic measurement and field trials Optical burst and packet switching OBS/OPS node architectures Burst/Packet scheduling and routing algorithms Contention resolution/avoidance strategies Services and applications for OBS/OPS (e.g., grid networks, storage-area networks, etc.) Burst assembly and ingress traffic shaping Hybrid OBS/TDM or OBS/wavelength routing Manuscript Submission To submit to this special issue, follow the normal procedure for submission to JON and select ``Photonics in Switching' in the features indicator of the online

Development of Novel Random Network Theory-Based Approaches to Identify Network Interactions among Nitrifying Bacteria

Energy Technology Data Exchange (ETDEWEB)

Shi, Cindy

2015-07-17

The interactions among different microbial populations in a community could play more important roles in determining ecosystem functioning than species numbers and their abundances, but very little is known about such network interactions at a community level. The goal of this project is to develop novel framework approaches and associated software tools to characterize the network interactions in microbial communities based on high throughput, large scale high-throughput metagenomics data and apply these approaches to understand the impacts of environmental changes (e.g., climate change, contamination) on network interactions among different nitrifying populations and associated microbial communities.

A Transdiagnostic Network Approach to Psychosis

NARCIS (Netherlands)

Wigman, Johanna T. W.; de Vos, Stijn; Wichers, Marieke; van Os, Jim; Bartels-Velthuis, Agna A.

Our ability to accurately predict development and outcome of early expression of psychosis is limited. To elucidate the mechanisms underlying psychopathology, a broader, transdiagnostic approach that acknowledges the complexity of mental illness is required. The upcoming network paradigm may be

Analysis of jitter due to call-level fluctuations

NARCIS (Netherlands)

M.R.H. Mandjes (Michel)

2005-01-01

textabstractIn communication networks used by constant bit rate applications, call-level dynamics (i.e., entering and leaving calls) lead to fluctuations in the load, and therefore also fluctuations in the delay (jitter). By intentionally delaying the packets at the destination, one can transform

Energy-efficient virtual optical network mapping approaches over converged flexible bandwidth optical networks and data centers.

Science.gov (United States)

Chen, Bowen; Zhao, Yongli; Zhang, Jie

2015-09-21

In this paper, we develop a virtual link priority mapping (LPM) approach and a virtual node priority mapping (NPM) approach to improve the energy efficiency and to reduce the spectrum usage over the converged flexible bandwidth optical networks and data centers. For comparison, the lower bound of the virtual optical network mapping is used for the benchmark solutions. Simulation results show that the LPM approach achieves the better performance in terms of power consumption, energy efficiency, spectrum usage, and the number of regenerators compared to the NPM approach.

A network approach for researching partnerships in health.

Science.gov (United States)

Lewis, Jenny M

2005-10-07

The last decade has witnessed a significant move towards new modes of governing that are based on coordination and collaboration. In particular, local level partnerships have been widely introduced around the world. There are few comprehensive approaches for researching the effects of these partnerships. The aim of this paper is to outline a network approach that combines structure and agency based explanations to research partnerships in health. Network research based on two Primary Care Partnerships (PCPs) in Victoria is used to demonstrate the utility of this approach. The paper examines multiple types of ties between people (structure), and the use and value of relationships to partners (agency), using interviews with the people involved in two PCPs--one in metropolitan Melbourne and one in a rural area. Network maps of ties based on work, strategic information and policy advice, show that there are many strong connections in both PCPs. Not surprisingly, PCP staff are central and highly connected. Of more interest are the ties that are dependent on these dedicated partnership staff, as they reveal which actors become weakly linked or disconnected without them. Network measures indicate that work ties are the most dispersed and strategic information ties are the most concentrated around fewer people. Divisions of general practice are weakly linked, while local government officials and Department of Human Services (DHS) regional staff appear to play important bridging roles. Finally, the relationships between partners have changed and improved, and most of those interviewed value their new or improved links with partners. Improving service coordination and health promotion planning requires engaging people and building strong relationships. Mapping ties is a useful means for assessing the strengths and weaknesses of partnerships, and network analysis indicates concentration and dispersion, the importance of particular individuals, and the points at which they

Extending Topological Approaches to Microseismic-Derived 3D Fracture Networks

Science.gov (United States)

Urbancic, T.; Bosman, K.; Baig, A.; Ardakani, E. P.

2017-12-01

Fracture topology is important for determining the fluid-flow characteristics of a fracture network. In most unconventional petroleum applications, flow through subsurface fracture networks is the primary source of production, as matrix permeability is often in the nanodarcy range. Typical models of reservoir discrete fracture networks (DFNs) are constructed using fracture orientation and average spacing, without consideration of how the connectivity of the fracture network aids the percolation of hydrocarbons back to the wellbore. Topological approaches to DFN characterization have been developed and extensively used in analysis of outcrop data and aerial photography. Such study of the surface expression of fracture networks is straight-forward, and the physical form of the observed fractures is directly reflected in the parameters used to describe the topology. However, this analysis largely ignores the three-dimensional nature of natural fracture networks, which is difficult to define accurately in geological studies. SMTI analysis of microseismic event distributions can produce DFNs, where each event is represented by a penny-shaped crack with radius and orientation determined from the frequency content of the waveforms and assessment of the slip instability of the potential fracture planes, respectively. Analysis of the geometric relationships between a set of fractures can provide details of intersections between fractures, and thus the topological characteristics of the fracture network. Extension of existing 2D topology approaches to 3D fracture networks is non-trivial. In the 2D case, a fracture intersection is a single point (node), and branches connect adjacent nodes along fractures. For the 3D case, intersection "nodes" become lines, and connecting nodes to find branches becomes more complicated. There are several parameters defined in 2D topology to quantify the connectivity of the fracture network. Equivalent quantities must be defined and calibrated

SAMNet: a network-based approach to integrate multi-dimensional high throughput datasets.

Science.gov (United States)

Gosline, Sara J C; Spencer, Sarah J; Ursu, Oana; Fraenkel, Ernest

2012-11-01

The rapid development of high throughput biotechnologies has led to an onslaught of data describing genetic perturbations and changes in mRNA and protein levels in the cell. Because each assay provides a one-dimensional snapshot of active signaling pathways, it has become desirable to perform multiple assays (e.g. mRNA expression and phospho-proteomics) to measure a single condition. However, as experiments expand to accommodate various cellular conditions, proper analysis and interpretation of these data have become more challenging. Here we introduce a novel approach called SAMNet, for Simultaneous Analysis of Multiple Networks, that is able to interpret diverse assays over multiple perturbations. The algorithm uses a constrained optimization approach to integrate mRNA expression data with upstream genes, selecting edges in the protein-protein interaction network that best explain the changes across all perturbations. The result is a putative set of protein interactions that succinctly summarizes the results from all experiments, highlighting the network elements unique to each perturbation. We evaluated SAMNet in both yeast and human datasets. The yeast dataset measured the cellular response to seven different transition metals, and the human dataset measured cellular changes in four different lung cancer models of Epithelial-Mesenchymal Transition (EMT), a crucial process in tumor metastasis. SAMNet was able to identify canonical yeast metal-processing genes unique to each commodity in the yeast dataset, as well as human genes such as β-catenin and TCF7L2/TCF4 that are required for EMT signaling but escaped detection in the mRNA and phospho-proteomic data. Moreover, SAMNet also highlighted drugs likely to modulate EMT, identifying a series of less canonical genes known to be affected by the BCR-ABL inhibitor imatinib (Gleevec), suggesting a possible influence of this drug on EMT.

A network approach to decentralized coordination of energy production-consumption grids.

Science.gov (United States)

Omodei, Elisa; Arenas, Alex

2018-01-01

Energy grids are facing a relatively new paradigm consisting in the formation of local distributed energy sources and loads that can operate in parallel independently from the main power grid (usually called microgrids). One of the main challenges in microgrid-like networks management is that of self-adapting to the production and demands in a decentralized coordinated way. Here, we propose a stylized model that allows to analytically predict the coordination of the elements in the network, depending on the network topology. Surprisingly, almost global coordination is attained when users interact locally, with a small neighborhood, instead of the obvious but more costly all-to-all coordination. We compute analytically the optimal value of coordinated users in random homogeneous networks. The methodology proposed opens a new way of confronting the analysis of energy demand-side management in networked systems.

An activities-based approach to network management: An explorative study

NARCIS (Netherlands)

Manser, K.; Hillebrand, B.; Klein Woolthuis, R.J.A.; Ziggers, G.W.; Driessen, P.H.; Bloemer, J.M.M.; Klein Woolthuis, R.

2016-01-01

Over the last few decades, the industrial marketing literature and the business network literature have promoted a holistic approach to marketing and provided a framework for understanding interorganizational networks. However, our understanding of how interorganizational networks govern themselves

An activities-based approach to network management : An explorative study

NARCIS (Netherlands)

Manser, Kristina; Hillebrand, Bas; Klein Woolthuis, R.J.A.; Ziggers, Gerrit Willem; Driessen, Paul H.; Bloemer, Josée

2016-01-01

Over the last few decades, the industrial marketing literature and the business network literature have promoted a holistic approach to marketing and provided a framework for understanding interorganizational networks. However, our understanding of how interorganizational networks govern themselves

The Approach to an Estimation of a Local Area Network Functioning Efficiency

Directory of Open Access Journals (Sweden)

M. M. Taraskin

2010-09-01

Full Text Available In the article authors call attention to a choice of system of metrics, which permits to take a qualitative assessment of local area network functioning efficiency in condition of computer attacks.

A variational approach to moment-closure approximations for the kinetics of biomolecular reaction networks

Science.gov (United States)

Bronstein, Leo; Koeppl, Heinz

2018-01-01

Approximate solutions of the chemical master equation and the chemical Fokker-Planck equation are an important tool in the analysis of biomolecular reaction networks. Previous studies have highlighted a number of problems with the moment-closure approach used to obtain such approximations, calling it an ad hoc method. In this article, we give a new variational derivation of moment-closure equations which provides us with an intuitive understanding of their properties and failure modes and allows us to correct some of these problems. We use mixtures of product-Poisson distributions to obtain a flexible parametric family which solves the commonly observed problem of divergences at low system sizes. We also extend the recently introduced entropic matching approach to arbitrary ansatz distributions and Markov processes, demonstrating that it is a special case of variational moment closure. This provides us with a particularly principled approximation method. Finally, we extend the above approaches to cover the approximation of multi-time joint distributions, resulting in a viable alternative to process-level approximations which are often intractable.

A Novel Text Clustering Approach Using Deep-Learning Vocabulary Network

Directory of Open Access Journals (Sweden)

Junkai Yi

2017-01-01

Full Text Available Text clustering is an effective approach to collect and organize text documents into meaningful groups for mining valuable information on the Internet. However, there exist some issues to tackle such as feature extraction and data dimension reduction. To overcome these problems, we present a novel approach named deep-learning vocabulary network. The vocabulary network is constructed based on related-word set, which contains the “cooccurrence” relations of words or terms. We replace term frequency in feature vectors with the “importance” of words in terms of vocabulary network and PageRank, which can generate more precise feature vectors to represent the meaning of text clustering. Furthermore, sparse-group deep belief network is proposed to reduce the dimensionality of feature vectors, and we introduce coverage rate for similarity measure in Single-Pass clustering. To verify the effectiveness of our work, we compare the approach to the representative algorithms, and experimental results show that feature vectors in terms of deep-learning vocabulary network have better clustering performance.

A simple network agreement-based approach for combining evidences in a heterogeneous sensor network

Directory of Open Access Journals (Sweden)

Raúl Eusebio-Grande

2015-12-01

Full Text Available In this research we investigate how the evidences provided by both static and mobile nodes that are part of a heterogenous sensor network can be combined to have trustworthy results. A solution relying on a network agreement-based approach was implemented and tested.

Formal Specification Based Automatic Test Generation for Embedded Network Systems

Directory of Open Access Journals (Sweden)

Eun Hye Choi

2014-01-01

Full Text Available Embedded systems have become increasingly connected and communicate with each other, forming large-scaled and complicated network systems. To make their design and testing more reliable and robust, this paper proposes a formal specification language called SENS and a SENS-based automatic test generation tool called TGSENS. Our approach is summarized as follows: (1 A user describes requirements of target embedded network systems by logical property-based constraints using SENS. (2 Given SENS specifications, test cases are automatically generated using a SAT-based solver. Filtering mechanisms to select efficient test cases are also available in our tool. (3 In addition, given a testing goal by the user, test sequences are automatically extracted from exhaustive test cases. We’ve implemented our approach and conducted several experiments on practical case studies. Through the experiments, we confirmed the efficiency of our approach in design and test generation of real embedded air-conditioning network systems.

Towards a networked governance approach in Danish hospitals?

DEFF Research Database (Denmark)

Brambini-Pedersen, Jan Vang; Brambini, Annalisa

2018-01-01

Hospitals across the globe are prone to numerous wicked problems. Wicked problems are difficult to solve and continue to negatively influence hospital systems. The proponents of the networked governance approach suggest that a new governance mode embracing a collaborative innovation approach to s...

Turchin's Relation for Call-by-Name Computations: A Formal Approach

OpenAIRE

Antonina Nepeivoda

2016-01-01

Supercompilation is a program transformation technique that was first described by V. F. Turchin in the 1970s. In supercompilation, Turchin's relation as a similarity relation on call-stack configurations is used both for call-by-value and call-by-name semantics to terminate unfolding of the program being transformed. In this paper, we give a formal grammar model of call-by-name stack behaviour. We classify the model in terms of the Chomsky hierarchy and then formally prove that Turchin's rel...

Sustainability in CALL Learning Environments: A Systemic Functional Grammar Approach

Directory of Open Access Journals (Sweden)

Peter McDonald

2014-09-01

Full Text Available This research aims to define a sustainable resource in Computer-Assisted Language Learning (CALL. In order for a CALL resource to be sustainable it must work within existing educational curricula. This feature is a necessary prerequisite of sustainability because, despite the potential for educational change that digitalization has offered since the nineteen nineties, curricula in traditional educational institutions have not fundamentally changed, even as we move from a pre-digital society towards a digital society. Curricula have failed to incorporate CALL resources because no agreed-upon pedagogical language enables teachers to discuss CALL classroom practices. Systemic Functional Grammar (SFG can help to provide this language and bridge the gap between the needs of the curriculum and the potentiality of CALL-based resources. This paper will outline how SFG principles can be used to create a pedagogical language for CALL and it will give practical examples of how this language can be used to create sustainable resources in classroom contexts.

An artificial neural network approach to laser-induced breakdown spectroscopy quantitative analysis

International Nuclear Information System (INIS)

D’Andrea, Eleonora; Pagnotta, Stefano; Grifoni, Emanuela; Lorenzetti, Giulia; Legnaioli, Stefano; Palleschi, Vincenzo; Lazzerini, Beatrice

2014-01-01

The usual approach to laser-induced breakdown spectroscopy (LIBS) quantitative analysis is based on the use of calibration curves, suitably built using appropriate reference standards. More recently, statistical methods relying on the principles of artificial neural networks (ANN) are increasingly used. However, ANN analysis is often used as a ‘black box’ system and the peculiarities of the LIBS spectra are not exploited fully. An a priori exploration of the raw data contained in the LIBS spectra, carried out by a neural network to learn what are the significant areas of the spectrum to be used for a subsequent neural network delegated to the calibration, is able to throw light upon important information initially unknown, although already contained within the spectrum. This communication will demonstrate that an approach based on neural networks specially taylored for dealing with LIBS spectra would provide a viable, fast and robust method for LIBS quantitative analysis. This would allow the use of a relatively limited number of reference samples for the training of the network, with respect to the current approaches, and provide a fully automatizable approach for the analysis of a large number of samples. - Highlights: • A methodological approach to neural network analysis of LIBS spectra is proposed. • The architecture of the network and the number of inputs are optimized. • The method is tested on bronze samples already analyzed using a calibration-free LIBS approach. • The results are validated, compared and discussed

An Intelligent Alternative Approach to the efficient Network Management

Directory of Open Access Journals (Sweden)

MARTÍN, A.

2012-12-01

Full Text Available Due to the increasing complexity and heterogeneity of networks and services, many efforts have been made to develop intelligent techniques for management. Network intelligent management is a key technology for operating large heterogeneous data transmission networks. This paper presents a proposal for an architecture that integrates management object specifications and the knowledge of expert systems. We present a new approach named Integrated Expert Management, for learning objects based on expert management rules and describe the design and implementation of an integrated intelligent management platform based on OSI and Internet management models. The main contributions of our approach is the integration of both expert system and managed models, so we can make use of them to construct more flexible intelligent management network. The prototype SONAP (Software for Network Assistant and Performance is accuracy-aware since it can control and manage a network. We have tested our system on real data to the fault diagnostic in a telecommunication system of a power utility. The results validate the model and show a significant improvement with respect to the number of rules and the error rate in others systems.

Inferring topologies of complex networks with hidden variables.

Science.gov (United States)

Wu, Xiaoqun; Wang, Weihan; Zheng, Wei Xing

2012-10-01

Network topology plays a crucial role in determining a network's intrinsic dynamics and function, thus understanding and modeling the topology of a complex network will lead to greater knowledge of its evolutionary mechanisms and to a better understanding of its behaviors. In the past few years, topology identification of complex networks has received increasing interest and wide attention. Many approaches have been developed for this purpose, including synchronization-based identification, information-theoretic methods, and intelligent optimization algorithms. However, inferring interaction patterns from observed dynamical time series is still challenging, especially in the absence of knowledge of nodal dynamics and in the presence of system noise. The purpose of this work is to present a simple and efficient approach to inferring the topologies of such complex networks. The proposed approach is called "piecewise partial Granger causality." It measures the cause-effect connections of nonlinear time series influenced by hidden variables. One commonly used testing network, two regular networks with a few additional links, and small-world networks are used to evaluate the performance and illustrate the influence of network parameters on the proposed approach. Application to experimental data further demonstrates the validity and robustness of our method.

An Approach to Ad-hoc Messaging Networks Using Time Shifted Propagation

Directory of Open Access Journals (Sweden)

Christoph Fuchß

2007-10-01

Full Text Available Many communication devices, like mobile phones and PDAs, are enabled for near field communication by using Bluetooth. Many approaches dealt so far with the attempt to transfer mobile ad-hoc networks (MANET to the mechanism of the “fixed internet” to mobile networks. In order to achieve liability and robustness of common TCP connections routing algorithm in near field communication based networks become more sophisticated and complex. These mechanisms often do not reflect on the application’s particularities.Our approach of an ad-hoc messaging network (AMNET uses simple store-and-forward message passing to spread data asynchronously. We do not aim at the reliability of common internet networks but focus on application specific needs that can be covered by simple message passing mechanism. In this paper we will portray a powerful network by using simple devices and communication protocols on the basis of AMNETs. Simulation results of our AMNET approach provide insights towards speeding up the network setup process and to enable the use of AMNETs even with few participants by introducing a hybrid structure of infrastructure and mobile nodes.

The Network Analysis of Urban Streets: A Dual Approach

OpenAIRE

Porta, Sergio; Crucitti, Paolo; Latora, Vito

2004-01-01

The application of the network approach to the urban case poses several questions in terms of how to deal with metric distances, what kind of graph representation to use, what kind of measures to investigate, how to deepen the correlation between measures of the structure of the network and measures of the dynamics on the network, what are the possible contributions from the GIS community. In this paper, the authors addresses a study of six cases of urban street networks characterised by diff...

Outline of a multilevel approach of the network society

NARCIS (Netherlands)

van Dijk, Johannes A.G.M.

2005-01-01

Social and media networks, the Internet in particular, increasingly link interpersonal, organizational and mass communication. It is argued that this gives a cause for an interdisciplinary and multilevel approach of the network society. This will have to link traditional micro- and meso-level

Turchin's Relation for Call-by-Name Computations: A Formal Approach

Directory of Open Access Journals (Sweden)

Antonina Nepeivoda

2016-07-01

Full Text Available Supercompilation is a program transformation technique that was first described by V. F. Turchin in the 1970s. In supercompilation, Turchin's relation as a similarity relation on call-stack configurations is used both for call-by-value and call-by-name semantics to terminate unfolding of the program being transformed. In this paper, we give a formal grammar model of call-by-name stack behaviour. We classify the model in terms of the Chomsky hierarchy and then formally prove that Turchin's relation can terminate all computations generated by the model.

A QCQP Approach for OPF in Multiphase Radial Networks with Wye and Delta Connections: Preprint

Energy Technology Data Exchange (ETDEWEB)

Zamzam, Ahmed, S.; Zhaoy, Changhong; Dall' Anesey, Emiliano; Sidiropoulos, Nicholas D.

2017-06-27

This paper examines the AC Optimal Power Flow (OPF) problem for multiphase distribution networks featuring renewable energy resources (RESs). We start by outlining a power flow model for radial multiphase systems that accommodates wye-connected and delta-connected RESs and non-controllable energy assets. We then formalize an AC OPF problem that accounts for both types of connections. Similar to various AC OPF renditions, the resultant problem is a non convex quadratically-constrained quadratic program. However, the so-called Feasible Point Pursuit-Successive Convex Approximation algorithm is leveraged to obtain a feasible and yet locally-optimal solution. The merits of the proposed solution approach are demonstrated using two unbalanced multiphase distribution feeders with both wye and delta connections.

Predictive model for determining the quality of a call

Science.gov (United States)

Voznak, M.; Rozhon, J.; Partila, P.; Safarik, J.; Mikulec, M.; Mehic, M.

2014-05-01

In this paper the predictive model for speech quality estimation is described. This model allows its user to gain the information about the speech quality in VoIP networks without the need of performing the actual call and the consecutive time consuming sound file evaluation. This rapidly increases usability of the speech quality measurement especially in high load networks, where the actual processing of all calls is rendered difficult or even impossible. This model can reach its results that are highly conformant with the PESQ algorithm only based on the network state parameters that are easily obtainable by the commonly used software tools. Experiments were carried out to investigate whether different languages (English, Czech) have an effect on perceived voice quality for the same network conditions and the language factor was incorporated directly into the model.

A biplex approach to PageRank centrality: From classic to multiplex networks.

Science.gov (United States)

Pedroche, Francisco; Romance, Miguel; Criado, Regino

2016-06-01

In this paper, we present a new view of the PageRank algorithm inspired by multiplex networks. This new approach allows to introduce a new centrality measure for classic complex networks and a new proposal to extend the usual PageRank algorithm to multiplex networks. We give some analytical relations between these new approaches and the classic PageRank centrality measure, and we illustrate the new parameters presented by computing them on real underground networks.

A biplex approach to PageRank centrality: From classic to multiplex networks

Science.gov (United States)

Pedroche, Francisco; Romance, Miguel; Criado, Regino

2016-06-01

In this paper, we present a new view of the PageRank algorithm inspired by multiplex networks. This new approach allows to introduce a new centrality measure for classic complex networks and a new proposal to extend the usual PageRank algorithm to multiplex networks. We give some analytical relations between these new approaches and the classic PageRank centrality measure, and we illustrate the new parameters presented by computing them on real underground networks.

On the Interplay between the Evolvability and Network Robustness in an Evolutionary Biological Network: A Systems Biology Approach

Science.gov (United States)

Chen, Bor-Sen; Lin, Ying-Po

2011-01-01

In the evolutionary process, the random transmission and mutation of genes provide biological diversities for natural selection. In order to preserve functional phenotypes between generations, gene networks need to evolve robustly under the influence of random perturbations. Therefore, the robustness of the phenotype, in the evolutionary process, exerts a selection force on gene networks to keep network functions. However, gene networks need to adjust, by variations in genetic content, to generate phenotypes for new challenges in the network’s evolution, ie, the evolvability. Hence, there should be some interplay between the evolvability and network robustness in evolutionary gene networks. In this study, the interplay between the evolvability and network robustness of a gene network and a biochemical network is discussed from a nonlinear stochastic system point of view. It was found that if the genetic robustness plus environmental robustness is less than the network robustness, the phenotype of the biological network is robust in evolution. The tradeoff between the genetic robustness and environmental robustness in evolution is discussed from the stochastic stability robustness and sensitivity of the nonlinear stochastic biological network, which may be relevant to the statistical tradeoff between bias and variance, the so-called bias/variance dilemma. Further, the tradeoff could be considered as an antagonistic pleiotropic action of a gene network and discussed from the systems biology perspective. PMID:22084563

Network reliability assessment using a cellular automata approach

International Nuclear Information System (INIS)

Rocco S, Claudio M.; Moreno, Jose Ali

2002-01-01

Two cellular automata (CA) models that evaluate the s-t connectedness and shortest path in a network are presented. CA based algorithms enhance the performance of classical algorithms, since they allow a more reliable and straightforward parallel implementation resulting in a dynamic network evaluation, where changes in the connectivity and/or link costs can readily be incorporated avoiding recalculation from scratch. The paper also demonstrates how these algorithms can be applied for network reliability evaluation (based on Monte-Carlo approach) and for finding s-t path with maximal reliability

Cross-Layer Design Approach for Power Control in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

A. Sarfaraz Ahmed

2015-03-01

Full Text Available In mobile ad hoc networks, communication among mobile nodes occurs through wireless medium The design of ad hoc network protocol, generally based on a traditional “layered approach”, has been found ineffective to deal with receiving signal strength (RSS-related problems, affecting the physical layer, the network layer and transport layer. This paper proposes a design approach, deviating from the traditional network design, toward enhancing the cross-layer interaction among different layers, namely physical, MAC and network. The Cross-Layer design approach for Power control (CLPC would help to enhance the transmission power by averaging the RSS values and to find an effective route between the source and the destination. This cross-layer design approach was tested by simulation (NS2 simulator and its performance over AODV was found to be better.

Metabolic Network Discovery by Top-Down and Bottom-Up Approaches and Paths for Reconciliation

Energy Technology Data Exchange (ETDEWEB)

Çakır, Tunahan, E-mail: tcakir@gyte.edu.tr [Computational Systems Biology Group, Department of Bioengineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey); Khatibipour, Mohammad Jafar [Computational Systems Biology Group, Department of Bioengineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey); Department of Chemical Engineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey)

2014-12-03

The primary focus in the network-centric analysis of cellular metabolism by systems biology approaches is to identify the active metabolic network for the condition of interest. Two major approaches are available for the discovery of the condition-specific metabolic networks. One approach starts from genome-scale metabolic networks, which cover all possible reactions known to occur in the related organism in a condition-independent manner, and applies methods such as the optimization-based Flux-Balance Analysis to elucidate the active network. The other approach starts from the condition-specific metabolome data, and processes the data with statistical or optimization-based methods to extract information content of the data such that the active network is inferred. These approaches, termed bottom-up and top-down, respectively, are currently employed independently. However, considering that both approaches have the same goal, they can both benefit from each other paving the way for the novel integrative analysis methods of metabolome data- and flux-analysis approaches in the post-genomic era. This study reviews the strengths of constraint-based analysis and network inference methods reported in the metabolic systems biology field; then elaborates on the potential paths to reconcile the two approaches to shed better light on how the metabolism functions.

Metabolic Network Discovery by Top-Down and Bottom-Up Approaches and Paths for Reconciliation

International Nuclear Information System (INIS)

Çakır, Tunahan; Khatibipour, Mohammad Jafar

2014-01-01

The primary focus in the network-centric analysis of cellular metabolism by systems biology approaches is to identify the active metabolic network for the condition of interest. Two major approaches are available for the discovery of the condition-specific metabolic networks. One approach starts from genome-scale metabolic networks, which cover all possible reactions known to occur in the related organism in a condition-independent manner, and applies methods such as the optimization-based Flux-Balance Analysis to elucidate the active network. The other approach starts from the condition-specific metabolome data, and processes the data with statistical or optimization-based methods to extract information content of the data such that the active network is inferred. These approaches, termed bottom-up and top-down, respectively, are currently employed independently. However, considering that both approaches have the same goal, they can both benefit from each other paving the way for the novel integrative analysis methods of metabolome data- and flux-analysis approaches in the post-genomic era. This study reviews the strengths of constraint-based analysis and network inference methods reported in the metabolic systems biology field; then elaborates on the potential paths to reconcile the two approaches to shed better light on how the metabolism functions.

Introduction to focus issue: quantitative approaches to genetic networks.

Science.gov (United States)

Albert, Réka; Collins, James J; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks

Innovation Networks New Approaches in Modelling and Analyzing

CERN Document Server

Pyka, Andreas

2009-01-01

The science of graphs and networks has become by now a well-established tool for modelling and analyzing a variety of systems with a large number of interacting components. Starting from the physical sciences, applications have spread rapidly to the natural and social sciences, as well as to economics, and are now further extended, in this volume, to the concept of innovations, viewed broadly. In an abstract, systems-theoretical approach, innovation can be understood as a critical event which destabilizes the current state of the system, and results in a new process of self-organization leading to a new stable state. The contributions to this anthology address different aspects of the relationship between innovation and networks. The various chapters incorporate approaches in evolutionary economics, agent-based modeling, social network analysis and econophysics and explore the epistemic tension between insights into economics and society-related processes, and the insights into new forms of complex dynamics.

Social network approaches to recruitment, HIV prevention, medical care, and medication adherence.

Science.gov (United States)

Latkin, Carl A; Davey-Rothwell, Melissa A; Knowlton, Amy R; Alexander, Kamila A; Williams, Chyvette T; Boodram, Basmattee

2013-06-01

This article reviews the current issues and advancements in social network approaches to HIV prevention and care. Social network analysis can provide a method to understand health disparities in HIV rates, treatment access, and outcomes. Social network analysis is a valuable tool to link social structural factors to individual behaviors. Social networks provide an avenue for low-cost and sustainable HIV prevention interventions that can be adapted and translated into diverse populations. Social networks can be utilized as a viable approach to recruitment for HIV testing and counseling, HIV prevention interventions, optimizing HIV medical care, and medication adherence. Social network interventions may be face-to-face or through social media. Key issues in designing social network interventions are contamination due to social diffusion, network stability, density, and the choice and training of network members. There are also ethical issues involved in the development and implementation of social network interventions. Social network analyses can also be used to understand HIV transmission dynamics.

Mobile telephones: a comparison of radiated power between 3G VoIP calls and 3G VoCS calls.

Science.gov (United States)

Jovanovic, Dragan; Bragard, Guillaume; Picard, Dominique; Chauvin, Sébastien

2015-01-01

The purpose of this study is to assess the mean RF power radiated by mobile telephones during voice calls in 3G VoIP (Voice over Internet Protocol) using an application well known to mobile Internet users, and to compare it with the mean power radiated during voice calls in 3G VoCS (Voice over Circuit Switch) on a traditional network. Knowing that the specific absorption rate (SAR) is proportional to the mean radiated power, the user's exposure could be clearly identified at the same time. Three 3G (High Speed Packet Access) smartphones from three different manufacturers, all dual-band for GSM (900 MHz, 1800 MHz) and dual-band for UMTS (900 MHz, 1950 MHz), were used between 28 July and 04 August 2011 in Paris (France) to make 220 two-minute calls on a mobile telephone network with national coverage. The places where the calls were made were selected in such a way as to describe the whole range of usage situations of the mobile telephone. The measuring equipment, called "SYRPOM", recorded the radiation power levels and the frequency bands used during the calls with a sampling rate of 20,000 per second. In the framework of this study, the mean normalised power radiated by a telephone in 3G VoIP calls was evaluated at 0.75% maximum power of the smartphone, compared with 0.22% in 3G VoCS calls. The very low average power levels associated with use of 3G devices with VoIP or VoCS support the view that RF exposure resulting from their use is far from exceeding the basic restrictions of current exposure limits in terms of SAR.

Optimizing Groundwater Monitoring Networks Using Integrated Statistical and Geostatistical Approaches

Directory of Open Access Journals (Sweden)

Jay Krishna Thakur

2015-08-01

Full Text Available The aim of this work is to investigate new approaches using methods based on statistics and geo-statistics for spatio-temporal optimization of groundwater monitoring networks. The formulated and integrated methods were tested with the groundwater quality data set of Bitterfeld/Wolfen, Germany. Spatially, the monitoring network was optimized using geo-statistical methods. Temporal optimization of the monitoring network was carried out using Sen’s method (1968. For geostatistical network optimization, a geostatistical spatio-temporal algorithm was used to identify redundant wells in 2- and 2.5-D Quaternary and Tertiary aquifers. Influences of interpolation block width, dimension, contaminant association, groundwater flow direction and aquifer homogeneity on statistical and geostatistical methods for monitoring network optimization were analysed. The integrated approach shows 37% and 28% redundancies in the monitoring network in Quaternary aquifer and Tertiary aquifer respectively. The geostatistical method also recommends 41 and 22 new monitoring wells in the Quaternary and Tertiary aquifers respectively. In temporal optimization, an overall optimized sampling interval was recommended in terms of lower quartile (238 days, median quartile (317 days and upper quartile (401 days in the research area of Bitterfeld/Wolfen. Demonstrated methods for improving groundwater monitoring network can be used in real monitoring network optimization with due consideration given to influencing factors.

FUSE: a profit maximization approach for functional summarization of biological networks.

Science.gov (United States)

Seah, Boon-Siew; Bhowmick, Sourav S; Dewey, C Forbes; Yu, Hanry

2012-03-21

The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein interaction network (PPI) using graph theoretic analysis. Despite the recent progress, systems level analysis of PPIS remains a daunting task as it is challenging to make sense out of the deluge of high-dimensional interaction data. Specifically, techniques that automatically abstract and summarize PPIS at multiple resolutions to provide high level views of its functional landscape are still lacking. We present a novel data-driven and generic algorithm called FUSE (Functional Summary Generator) that generates functional maps of a PPI at different levels of organization, from broad process-process level interactions to in-depth complex-complex level interactions, through a pro t maximization approach that exploits Minimum Description Length (MDL) principle to maximize information gain of the summary graph while satisfying the level of detail constraint. We evaluate the performance of FUSE on several real-world PPIS. We also compare FUSE to state-of-the-art graph clustering methods with GO term enrichment by constructing the biological process landscape of the PPIS. Using AD network as our case study, we further demonstrate the ability of FUSE to quickly summarize the network and identify many different processes and complexes that regulate it. Finally, we study the higher-order connectivity of the human PPI. By simultaneously evaluating interaction and annotation data, FUSE abstracts higher-order interaction maps by reducing the details of the underlying PPI to form a functional summary graph of interconnected functional clusters. Our results demonstrate its effectiveness and superiority over state-of-the-art graph clustering methods with GO term enrichment.

A network approach to orthodontic diagnosis.

Science.gov (United States)

Auconi, P; Caldarelli, G; Scala, A; Ierardo, G; Polimeni, A

2011-11-01

Network analysis, a recent advancement in complexity science, enables understanding of the properties of complex biological processes characterized by the interaction, adaptive regulation, and coordination of a large number of participating components. We applied network analysis to orthodontics to detect and visualize the most interconnected clinical, radiographic, and functional data pertaining to the orofacial system. The sample consisted of 104 individuals from 7 to 13 years of age in the mixed dentition phase without previous orthodontic intervention. The subjects were divided according to skeletal class; their clinical, radiographic, and functional features were represented as vertices (nodes) and links (edges) connecting them. Class II subjects exhibited few highly connected orthodontic features (hubs), while Class III patients showed a more compact network structure characterized by strong co-occurrence of normal and abnormal clinical, functional, and radiological features. Restricting our analysis to the highest correlations, we identified critical peculiarities of Class II and Class III malocclusions. The topology of the dentofacial system obtained by network analysis could allow orthodontists to visually evaluate and anticipate the co-occurrence of auxological anomalies during individual craniofacial growth and possibly localize reactive sites for a therapeutic approach to malocclusion. © 2011 John Wiley & Sons A/S.

Routing in Mobile Wireless Sensor Networks: A Leader-Based Approach.

Science.gov (United States)

Burgos, Unai; Amozarrain, Ugaitz; Gómez-Calzado, Carlos; Lafuente, Alberto

2017-07-07

This paper presents a leader-based approach to routing in Mobile Wireless Sensor Networks (MWSN). Using local information from neighbour nodes, a leader election mechanism maintains a spanning tree in order to provide the necessary adaptations for efficient routing upon the connectivity changes resulting from the mobility of sensors or sink nodes. We present two protocols following the leader election approach, which have been implemented using Castalia and OMNeT++. The protocols have been evaluated, besides other reference MWSN routing protocols, to analyse the impact of network size and node velocity on performance, which has demonstrated the validity of our approach.

Neural network approach to radiologic lesion detection

International Nuclear Information System (INIS)

Newman, F.D.; Raff, U.; Stroud, D.

1989-01-01

An area of artificial intelligence that has gained recent attention is the neural network approach to pattern recognition. The authors explore the use of neural networks in radiologic lesion detection with what is known in the literature as the novelty filter. This filter uses a linear model; images of normal patterns become training vectors and are stored as columns of a matrix. An image of an abnormal pattern is introduced and the abnormality or novelty is extracted. A VAX 750 was used to encode the novelty filter, and two experiments have been examined

A Network Coding Approach to Loss Tomography

DEFF Research Database (Denmark)

Sattari, Pegah; Markopoulou, Athina; Fragouli, Christina

2013-01-01

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

Phylogenetic diversity and biodiversity indices on phylogenetic networks.

Science.gov (United States)

Wicke, Kristina; Fischer, Mareike

2018-04-01

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

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.

78 FR 76257 - Rural Call Completion

Science.gov (United States)

2013-12-17

... must be held together with rubber bands or fasteners. Any envelopes must be disposed of before entering... Completion/Call Termination Handbook outlining standards and practices of the industry relevant to ensuring... telecommunications networks. Transmission facilities may be based on a single technology or a combination of...

Approach of Complex Networks for the Determination of Brain Death

Institute of Scientific and Technical Information of China (English)

SUN Wei-Gang; CAO Jian-Ting; WANG Ru-Bin

2011-01-01

In clinical practice, brain death is the irreversible end of all brain activity. Compared to current statistical methods for the determination of brain death, we focus on the approach of complex networks for real-world electroencephalography in its determination. Brain functional networks constructed by correlation analysis are derived, and statistical network quantities used for distinguishing the patients in coma or brain death state, such as average strength, clustering coefficient and average path length, are calculated. Numerical results show that the values of network quantities of patients in coma state are larger than those of patients in brain death state. Our Sndings might provide valuable insights on the determination of brain death.%@@ In clinical practice, brain death is the irreversible end of all brain activity.Compared to current statistical methods for the determination of brain death, we focus on the approach of complex networks for real-world electroencephalography in its determination.Brain functional networks constructed by correlation analysis axe derived, and statistical network quantities used for distinguishing the patients in coma or brain death state, such as average strength, clustering coefficient and average path length, are calculated.Numerical results show that the values of network quantities of patients in coma state are larger than those of patients in brain death state.Our findings might provide valuable insights on the determination of brain death.

Systems configured to distribute a telephone call, communication systems, communication methods and methods of routing a telephone call to a service representative

Science.gov (United States)

Harris, Scott H.; Johnson, Joel A.; Neiswanger, Jeffery R.; Twitchell, Kevin E.

2004-03-09

The present invention includes systems configured to distribute a telephone call, communication systems, communication methods and methods of routing a telephone call to a customer service representative. In one embodiment of the invention, a system configured to distribute a telephone call within a network includes a distributor adapted to connect with a telephone system, the distributor being configured to connect a telephone call using the telephone system and output the telephone call and associated data of the telephone call; and a plurality of customer service representative terminals connected with the distributor and a selected customer service representative terminal being configured to receive the telephone call and the associated data, the distributor and the selected customer service representative terminal being configured to synchronize, application of the telephone call and associated data from the distributor to the selected customer service representative terminal.

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

Science.gov (United States)

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

2013-01-01

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

A Constructive Neural-Network Approach to Modeling Psychological Development

Science.gov (United States)

Shultz, Thomas R.

2012-01-01

This article reviews a particular computational modeling approach to the study of psychological development--that of constructive neural networks. This approach is applied to a variety of developmental domains and issues, including Piagetian tasks, shift learning, language acquisition, number comparison, habituation of visual attention, concept…

A quantitative approach to measure road network information based on edge diversity

Science.gov (United States)

Wu, Xun; Zhang, Hong; Lan, Tian; Cao, Weiwei; He, Jing

2015-12-01

The measure of map information has been one of the key issues in assessing cartographic quality and map generalization algorithms. It is also important for developing efficient approaches to transfer geospatial information. Road network is the most common linear object in real world. Approximately describe road network information will benefit road map generalization, navigation map production and urban planning. Most of current approaches focused on node diversities and supposed that all the edges are the same, which is inconsistent to real-life condition, and thus show limitations in measuring network information. As real-life traffic flow are directed and of different quantities, the original undirected vector road map was first converted to a directed topographic connectivity map. Then in consideration of preferential attachment in complex network study and rich-club phenomenon in social network, the from and to weights of each edge are assigned. The from weight of a given edge is defined as the connectivity of its end node to the sum of the connectivities of all the neighbors of the from nodes of the edge. After getting the from and to weights of each edge, edge information, node information and the whole network structure information entropies could be obtained based on information theory. The approach has been applied to several 1 square mile road network samples. Results show that information entropies based on edge diversities could successfully describe the structural differences of road networks. This approach is a complementarity to current map information measurements, and can be extended to measure other kinds of geographical objects.

SNMP-SI: A Network Management Tool Based on Slow Intelligence System Approach

Science.gov (United States)

Colace, Francesco; de Santo, Massimo; Ferrandino, Salvatore

The last decade has witnessed an intense spread of computer networks that has been further accelerated with the introduction of wireless networks. Simultaneously with, this growth has increased significantly the problems of network management. Especially in small companies, where there is no provision of personnel assigned to these tasks, the management of such networks is often complex and malfunctions can have significant impacts on their businesses. A possible solution is the adoption of Simple Network Management Protocol. Simple Network Management Protocol (SNMP) is a standard protocol used to exchange network management information. It is part of the Transmission Control Protocol/Internet Protocol (TCP/IP) protocol suite. SNMP provides a tool for network administrators to manage network performance, find and solve network problems, and plan for network growth. SNMP has a big disadvantage: its simple design means that the information it deals with is neither detailed nor well organized enough to deal with the expanding modern networking requirements. Over the past years much efforts has been given to improve the lack of Simple Network Management Protocol and new frameworks has been developed: A promising approach involves the use of Ontology. This is the starting point of this paper where a novel approach to the network management based on the use of the Slow Intelligence System methodologies and Ontology based techniques is proposed. Slow Intelligence Systems is a general-purpose systems characterized by being able to improve performance over time through a process involving enumeration, propagation, adaptation, elimination and concentration. Therefore, the proposed approach aims to develop a system able to acquire, according to an SNMP standard, information from the various hosts that are in the managed networks and apply solutions in order to solve problems. To check the feasibility of this model first experimental results in a real scenario are showed.

A robust neural network-based approach for microseismic event detection

KAUST Repository

Akram, Jubran; Ovcharenko, Oleg; Peter, Daniel

2017-01-01

We present an artificial neural network based approach for robust event detection from low S/N waveforms. We use a feed-forward network with a single hidden layer that is tuned on a training dataset and later applied on the entire example dataset

"I'll See You on IM, Text, or Call You": A Social Network Approach of Adolescents' Use of Communication Media

Science.gov (United States)

Van Cleemput, Katrien

2010-01-01

This study explores some possibilities of social network analysis for studying adolescents' communication patterns. A full network analysis was conducted on third-grade high school students (15 year olds, 137 students) in Belgium. The results pointed out that face-to-face communication was still the most prominent way for information to flow…

A complex systems approach to planning, optimization and decision making for energy networks

International Nuclear Information System (INIS)

Beck, Jessica; Kempener, Ruud; Cohen, Brett; Petrie, Jim

2008-01-01

This paper explores a new approach to planning and optimization of energy networks, using a mix of global optimization and agent-based modeling tools. This approach takes account of techno-economic, environmental and social criteria, and engages explicitly with inherent network complexity in terms of the autonomous decision-making capability of individual agents within the network, who may choose not to act as economic rationalists. This is an important consideration from the standpoint of meeting sustainable development goals. The approach attempts to set targets for energy planning, by determining preferred network development pathways through multi-objective optimization. The viability of such plans is then explored through agent-based models. The combined approach is demonstrated for a case study of regional electricity generation in South Africa, with biomass as feedstock

Unified Approach to Modeling and Simulation of Space Communication Networks and Systems

Science.gov (United States)

Barritt, Brian; Bhasin, Kul; Eddy, Wesley; Matthews, Seth

2010-01-01

Network simulator software tools are often used to model the behaviors and interactions of applications, protocols, packets, and data links in terrestrial communication networks. Other software tools that model the physics, orbital dynamics, and RF characteristics of space systems have matured to allow for rapid, detailed analysis of space communication links. However, the absence of a unified toolset that integrates the two modeling approaches has encumbered the systems engineers tasked with the design, architecture, and analysis of complex space communication networks and systems. This paper presents the unified approach and describes the motivation, challenges, and our solution - the customization of the network simulator to integrate with astronautical analysis software tools for high-fidelity end-to-end simulation. Keywords space; communication; systems; networking; simulation; modeling; QualNet; STK; integration; space networks

Hierarchical brain networks active in approach and avoidance goal pursuit

Directory of Open Access Journals (Sweden)

Jeffrey Martin Spielberg

2013-06-01

Full Text Available Effective approach/avoidance goal pursuit is critical for attaining long-term health and well-being. Research on the neural correlates of key goal pursuit processes (e.g., motivation has long been of interest, with lateralization in prefrontal cortex being a particularly fruitful target of investigation. However, this literature has often been limited by a lack of spatial specificity and has not delineated the precise aspects of approach/avoidance motivation involved. Additionally, the relationships among brain regions (i.e., network connectivity vital to goal pursuit remain largely unexplored. Specificity in location, process, and network relationship is vital for moving beyond gross characterizations of function and identifying the precise cortical mechanisms involved in motivation. The present paper integrates research using more spatially specific methodologies (e.g., functional magnetic resonance imaging with the rich psychological literature on approach/avoidance to propose an integrative network model that takes advantage of the strengths of each of these literatures.

Hierarchical brain networks active in approach and avoidance goal pursuit.

Science.gov (United States)

Spielberg, Jeffrey M; Heller, Wendy; Miller, Gregory A

2013-01-01

Effective approach/avoidance goal pursuit is critical for attaining long-term health and well-being. Research on the neural correlates of key goal-pursuit processes (e.g., motivation) has long been of interest, with lateralization in prefrontal cortex being a particularly fruitful target of investigation. However, this literature has often been limited by a lack of spatial specificity and has not delineated the precise aspects of approach/avoidance motivation involved. Additionally, the relationships among brain regions (i.e., network connectivity) vital to goal-pursuit remain largely unexplored. Specificity in location, process, and network relationship is vital for moving beyond gross characterizations of function and identifying the precise cortical mechanisms involved in motivation. The present paper integrates research using more spatially specific methodologies (e.g., functional magnetic resonance imaging) with the rich psychological literature on approach/avoidance to propose an integrative network model that takes advantage of the strengths of each of these literatures.

Risk prediction model: Statistical and artificial neural network approach

Science.gov (United States)

Paiman, Nuur Azreen; Hariri, Azian; Masood, Ibrahim

2017-04-01

Prediction models are increasingly gaining popularity and had been used in numerous areas of studies to complement and fulfilled clinical reasoning and decision making nowadays. The adoption of such models assist physician's decision making, individual's behavior, and consequently improve individual outcomes and the cost-effectiveness of care. The objective of this paper is to reviewed articles related to risk prediction model in order to understand the suitable approach, development and the validation process of risk prediction model. A qualitative review of the aims, methods and significant main outcomes of the nineteen published articles that developed risk prediction models from numerous fields were done. This paper also reviewed on how researchers develop and validate the risk prediction models based on statistical and artificial neural network approach. From the review done, some methodological recommendation in developing and validating the prediction model were highlighted. According to studies that had been done, artificial neural network approached in developing the prediction model were more accurate compared to statistical approach. However currently, only limited published literature discussed on which approach is more accurate for risk prediction model development.

An SDN based approach for the ATLAS data acquisition network

CERN Document Server

Blikra, Espen; The ATLAS collaboration

2016-01-01

ATLAS is a high energy physics experiment in the Large Hadron Collider located at CERN. During the so called Long Shutdown 2 period scheduled for late 2019, ATLAS will undergo several modifications and upgrades on its data acquisition system in order to cope with the higher luminosity requirements. As part of these activities, a new read-out chain will be built for the New Small Wheel muon detector and the one of the Liquid Argon calorimeter will be upgraded. The subdetector specific electronic boards will be replaced with new commodity-server-based systems and instead of the custom serial-link-based communication, the new system will make use of a yet to be chosen commercial network technology. The new network will be used as a data acquisition network and at the same time it is intended to allow communication for the control, calibration and monitoring of the subdetectors. Therefore several types of traffic with different bandwidth requirements and different criticality will be competing for the same underl...

Impact of environmental inputs on reverse-engineering approach to network structures.

Science.gov (United States)

Wu, Jianhua; Sinfield, James L; Buchanan-Wollaston, Vicky; Feng, Jianfeng

2009-12-04

Uncovering complex network structures from a biological system is one of the main topic in system biology. The network structures can be inferred by the dynamical Bayesian network or Granger causality, but neither techniques have seriously taken into account the impact of environmental inputs. With considerations of natural rhythmic dynamics of biological data, we propose a system biology approach to reveal the impact of environmental inputs on network structures. We first represent the environmental inputs by a harmonic oscillator and combine them with Granger causality to identify environmental inputs and then uncover the causal network structures. We also generalize it to multiple harmonic oscillators to represent various exogenous influences. This system approach is extensively tested with toy models and successfully applied to a real biological network of microarray data of the flowering genes of the model plant Arabidopsis Thaliana. The aim is to identify those genes that are directly affected by the presence of the sunlight and uncover the interactive network structures associating with flowering metabolism. We demonstrate that environmental inputs are crucial for correctly inferring network structures. Harmonic causal method is proved to be a powerful technique to detect environment inputs and uncover network structures, especially when the biological data exhibit periodic oscillations.

Queueing networks a fundamental approach

CERN Document Server

Dijk, Nico

2011-01-01

This handbook aims to highlight fundamental, methodological and computational aspects of networks of queues to provide insights and to unify results that can be applied in a more general manner.  The handbook is organized into five parts: Part 1 considers exact analytical results such as of product form type. Topics include characterization of product forms by physical balance concepts and simple traffic flow equations, classes of service and queue disciplines that allow a product form, a unified description of product forms for discrete time queueing networks, insights for insensitivity, and aggregation and decomposition results that allow subnetworks to be aggregated into single nodes to reduce computational burden. Part 2 looks at monotonicity and comparison results such as for computational simplification by either of two approaches: stochastic monotonicity and ordering results based on the ordering of the proces generators, and comparison results and explicit error bounds based on an underlying Markov r...

Functional Interaction Network Construction and Analysis for Disease Discovery.

Science.gov (United States)

Wu, Guanming; Haw, Robin

2017-01-01

Network-based approaches project seemingly unrelated genes or proteins onto a large-scale network context, therefore providing a holistic visualization and analysis platform for genomic data generated from high-throughput experiments, reducing the dimensionality of data via using network modules and increasing the statistic analysis power. Based on the Reactome database, the most popular and comprehensive open-source biological pathway knowledgebase, we have developed a highly reliable protein functional interaction network covering around 60 % of total human genes and an app called ReactomeFIViz for Cytoscape, the most popular biological network visualization and analysis platform. In this chapter, we describe the detailed procedures on how this functional interaction network is constructed by integrating multiple external data sources, extracting functional interactions from human curated pathway databases, building a machine learning classifier called a Naïve Bayesian Classifier, predicting interactions based on the trained Naïve Bayesian Classifier, and finally constructing the functional interaction database. We also provide an example on how to use ReactomeFIViz for performing network-based data analysis for a list of genes.

Flowshop Scheduling Using a Network Approach | Oladeinde ...

African Journals Online (AJOL)

In this paper, a network based formulation of a permutation flow shop problem is presented. Two nuances of flow shop problems with different levels of complexity are solved using different approaches to the linear programming formulation. Key flow shop parameters inclosing makespan of the flow shop problems were ...

Towards Agent-Oriented Approach to a Call Management System

Science.gov (United States)

Ashamalla, Amir Nabil; Beydoun, Ghassan; Low, Graham

There is more chance of a completed sale if the end customers and relationship managers are suitably matched. This in turn can reduce the number of calls made by a call centre reducing operational costs such as working time and phone bills. This chapter is part of ongoing research aimed at helping a CMC to make better use of its personnel and equipment while maximizing the value of the service it offers to its client companies and end customers. This is accomplished by ensuring the optimal use of resources with appropriate real-time scheduling and load balancing and matching the end customers to appropriate relationship managers. In a globalized market, this may mean taking into account the cultural environment of the customer, as well as the appropriate profile and/or skill of the relationship manager to communicate effectively with the end customer. The chapter evaluates the suitability of a MAS to a call management system and illustrates the requirement analysis phase using i* models.

FUSE: a profit maximization approach for functional summarization of biological networks

Directory of Open Access Journals (Sweden)

Seah Boon-Siew

2012-03-01

Full Text Available Abstract Background The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein interaction network (PPI using graph theoretic analysis. Despite the recent progress, systems level analysis of PPIS remains a daunting task as it is challenging to make sense out of the deluge of high-dimensional interaction data. Specifically, techniques that automatically abstract and summarize PPIS at multiple resolutions to provide high level views of its functional landscape are still lacking. We present a novel data-driven and generic algorithm called FUSE (Functional Summary Generator that generates functional maps of a PPI at different levels of organization, from broad process-process level interactions to in-depth complex-complex level interactions, through a pro t maximization approach that exploits Minimum Description Length (MDL principle to maximize information gain of the summary graph while satisfying the level of detail constraint. Results We evaluate the performance of FUSE on several real-world PPIS. We also compare FUSE to state-of-the-art graph clustering methods with GO term enrichment by constructing the biological process landscape of the PPIS. Using AD network as our case study, we further demonstrate the ability of FUSE to quickly summarize the network and identify many different processes and complexes that regulate it. Finally, we study the higher-order connectivity of the human PPI. Conclusion By simultaneously evaluating interaction and annotation data, FUSE abstracts higher-order interaction maps by reducing the details of the underlying PPI to form a functional summary graph of interconnected functional clusters. Our results demonstrate its effectiveness and superiority over state-of-the-art graph clustering methods with GO term enrichment.

Artificial neuron-glia networks learning approach based on cooperative coevolution.

Science.gov (United States)

Mesejo, Pablo; Ibáñez, Oscar; Fernández-Blanco, Enrique; Cedrón, Francisco; Pazos, Alejandro; Porto-Pazos, Ana B

2015-06-01

Artificial Neuron-Glia Networks (ANGNs) are a novel bio-inspired machine learning approach. They extend classical Artificial Neural Networks (ANNs) by incorporating recent findings and suppositions about the way information is processed by neural and astrocytic networks in the most evolved living organisms. Although ANGNs are not a consolidated method, their performance against the traditional approach, i.e. without artificial astrocytes, was already demonstrated on classification problems. However, the corresponding learning algorithms developed so far strongly depends on a set of glial parameters which are manually tuned for each specific problem. As a consequence, previous experimental tests have to be done in order to determine an adequate set of values, making such manual parameter configuration time-consuming, error-prone, biased and problem dependent. Thus, in this paper, we propose a novel learning approach for ANGNs that fully automates the learning process, and gives the possibility of testing any kind of reasonable parameter configuration for each specific problem. This new learning algorithm, based on coevolutionary genetic algorithms, is able to properly learn all the ANGNs parameters. Its performance is tested on five classification problems achieving significantly better results than ANGN and competitive results with ANN approaches.

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.

Analysis of Drop Call Probability in Well Established Cellular ...

African Journals Online (AJOL)

Technology in Africa has increased over the past decade. The increase in modern cellular networks requires stringent quality of service (QoS). Drop call probability is one of the most important indices of QoS evaluation in a large scale well-established cellular network. In this work we started from an accurate statistical ...

Application of Game Theory Approaches in Routing Protocols for Wireless Networks

Science.gov (United States)

Javidi, Mohammad M.; Aliahmadipour, Laya

2011-09-01

An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that applied game theory approaches for various wireless networks such as ad hoc networks, mobile ad hoc networks and sensor networks that all of them lead to improve the network performance.

A novel approach for voltage secure operation using Probabilistic Neural Network in transmission network

Directory of Open Access Journals (Sweden)

Santi Behera

2016-05-01

Full Text Available This work proposes a unique approach for improving voltage stability limit using a Probabilistic Neural Network (PNN classifier that gives corrective controls available in the system in the scenario of contingencies. The sensitivity of system is analyzed to identify weak buses with ENVCI evaluation approaching zero. The input to the classifier, termed as voltage stability enhancing neural network (VSENN classifier, for training are line flows and bus voltages near the notch point of the P–V curve and the output of the VSENN is a control variable. For various contingencies the control action that improves the voltage profile as well as stability index is identified and trained accordingly. The trained VSENN is finally tested for its robustness to improve load margin and ENVCI as well, apart from trained set of operating condition of the system along with contingencies. The proposed approach is verified in IEEE 39-bus test system.

Practical Calling Approach for Exome Array-Based Genome-Wide Association Studies in Korean Population

Directory of Open Access Journals (Sweden)

Tae-Joon Park

2015-01-01

Full Text Available Exome-based genotyping arrays are cost-effective and have recently been used as alternative platforms to whole-exome sequencing. However, the automated clustering algorithm in an exome array has a genotype calling problem in accuracy for identifying rare and low-frequency variants. To address these shortcomings, we present a practical approach for accurate genotype calling using the Illumina Infinium HumanExome BeadChip. We present comparison results and a statistical summary of our genotype data sets. Our data set comprises 14,647 Korean samples. To solve the limitation of automated clustering, we performed manual genotype clustering for the targeted identification of 46,076 variants that were identified using GenomeStudio software. To evaluate the effects of applying custom cluster files, we tested cluster files using 804 independent Korean samples and the same platform. Our study firstly suggests practical guidelines for exome chip quality control in Asian populations and provides valuable insight into an association study using exome chip.

Sustainability in CALL Learning Environments: A Systemic Functional Grammar Approach

Science.gov (United States)

McDonald, Peter

2014-01-01

This research aims to define a sustainable resource in Computer-Assisted Language Learning (CALL). In order for a CALL resource to be sustainable it must work within existing educational curricula. This feature is a necessary prerequisite of sustainability because, despite the potential for educational change that digitalization has offered since…

Call Arrival Rate Prediction and Blocking Probability Estimation for Infrastructure based Mobile Cognitive Radio Personal Area Network

Directory of Open Access Journals (Sweden)

Neeta Nathani

2017-08-01

Full Text Available The Cognitive Radio usage has been estimated as non-emergency service with low volume traffic. Present work proposes an infrastructure based Cognitive Radio network and probability of success of CR traffic in licensed band. The Cognitive Radio nodes will form cluster. The cluster nodes will communicate on Industrial, Scientific and Medical band using IPv6 over Low-Power Wireless Personal Area Network based protocol from sensor to Gateway Cluster Head. For Cognitive Radio-Media Access Control protocol for Gateway to Cognitive Radio-Base Station communication, it will use vacant channels of licensed band. Standalone secondary users of Cognitive Radio Network shall be considered as a Gateway with one user. The Gateway will handle multi-channel multi radio for communication with Base Station. Cognitive Radio Network operators shall define various traffic data accumulation counters at Base Station for storing signal strength, Carrier-to-Interference and Noise Ratio, etc. parameters and record channel occupied/vacant status. The researches has been done so far using hour as interval is too long for parameters like holding time expressed in minutes and hence channel vacant/occupied status time is only probabilistically calculated. In the present work, an infrastructure based architecture has been proposed which polls channel status each minute in contrary to hourly polling of data. The Gateways of the Cognitive Radio Network shall monitor status of each Primary User periodically inside its working range and shall inform to Cognitive Radio- Base Station for preparation of minutewise database. For simulation, the occupancy data for all primary user channels were pulled in one minute interval from a live mobile network. Hourly traffic data and minutewise holding times has been analyzed to optimize the parameters of Seasonal Auto Regressive Integrated Moving Average prediction model. The blocking probability of an incoming Cognitive Radio call has been

Heat exchanger networks design with constraints

International Nuclear Information System (INIS)

Amidpur, M.; Zoghi, A.; Nasiri, N.

2000-01-01

So far there have been two approaches to the problem of heat recovery system design where stream matching constraints exist. The first approach involves mathematical techniques for solving the combinational problem taking due recognition of the constraints. These methodologies are now efficient, still suffer from the problem of taking a significant amount of control and direction away from the designer. The second approach based upon so called pinch technology and involves the use of adaptation of standard problem table algorithm. Unfortunately, the proposed methodologies are not very easy to understand, therefore they fail to provide the insight and generally associated with these approaches. Here, a new pinch based methodology is presented. In this method, we modified the traditional numerical targeting procedure-problem table algorithm which is stream cascade table. Unconstrained groups are established by using of artificial intelligence method such that they have minimum utility consumption among different alternatives. Each group is an individual network, therefore, traditional optimization, used in pinch technology, should be employed. By transferring energy between groups heat recovery can be maximized, then each group designs individually and finally networks combine together. One of the advantages of using this method is simple targeting and easy networks-design. Besides the approach has the potential using of new network design methods such as dual temperature approach, flexible pinch design, pseudo pinch design. It is hoped that this methodology provides insight easy network design

A brain network instantiating approach and avoidance motivation.

Science.gov (United States)

Spielberg, Jeffrey M; Miller, Gregory A; Warren, Stacie L; Engels, Anna S; Crocker, Laura D; Banich, Marie T; Sutton, Bradley P; Heller, Wendy

2012-09-01

Research indicates that dorsolateral prefrontal cortex (DLPFC) is important for pursuing goals, and areas of DLPFC are differentially involved in approach and avoidance motivation. Given the complexity of the processes involved in goal pursuit, DLPFC is likely part of a network that includes orbitofrontal cortex (OFC), cingulate, amygdala, and basal ganglia. This hypothesis was tested with regard to one component of goal pursuit, the maintenance of goals in the face of distraction. Examination of connectivity with motivation-related areas of DLPFC supported the network hypothesis. Differential patterns of connectivity suggest a distinct role for DLPFC areas, with one involved in selecting approach goals, one in selecting avoidance goals, and one in selecting goal pursuit strategies. Finally, differences in trait motivation moderated connectivity between DLPFC and OFC, suggesting that this connectivity is important for instantiating motivation. Copyright © 2012 Society for Psychophysiological Research.

Theory of spatial networks

Energy Technology Data Exchange (ETDEWEB)

Watanabe, T

1983-01-01

A new framework of synchronous parallel processing systems called spatial networks is examined, in which the family of all cellular automata is included perfectly. This framework is free from the two restrictions of cellular automata of which one is the finiteness of the set of states of a cell and the other is the countability of an array space. Throughout this article, the relationships between function and structure of spatial networks are considered. First, the necessary and sufficient condition for spatial networks to be uniformly interconnected is given. That for spatial networks to be finitely interconnected is also given with a topological approach. The characterization theorem of cellular automata comes from these results. Second, it is shown that finitely and uniformly interconnected linear spatial networks can be characterized by the convolution form. Last, the conditions for their global mappings to be injective or surjective are discussed. 10 references.

Novel approach for all-optical packet switching in wide-area networks

Science.gov (United States)

Chlamtac, Imrich; Fumagalli, Andrea F.; Wedzinga, Gosse

1998-09-01

All-optical Wavelength Division Multiplexing (WDM) networks are believed to be a fundamental component in future high speed backbones. However, while wavelength routing made circuit switching in WDM feasible the reality of extant optical technology does not yet provide the necessary devices to achieve individual optical packet switching. This paper proposes to achieve all-optical packet switching in WDM Wide Area Networks (WANs) via a novel technique, called slot routing. Using slot routing, entire slots, each carrying multiple packets on distinct wavelengths, are switched transparently and individually. As a result packets can be optically transmitted and switched in the network using available fast and wavelength non-sensitive devices. The proposed routing technique leads to an optical packet switching solution, that is simple, practical, and unique as it makes it possible to build a WDM all-optical WAN with optical devices based on proven technologies.

Detecting Malicious Nodes in Medical Smartphone Networks Through Euclidean Distance-Based Behavioral Profiling

DEFF Research Database (Denmark)

Meng, Weizhi; Li, Wenjuan; Wang, Yu

2017-01-01

and healthcare personnel. The underlying network architecture to support such devices is also referred to as medical smartphone networks (MSNs). Similar to other networks, MSNs also suffer from various attacks like insider attacks (e.g., leakage of sensitive patient information by a malicious insider......). In this work, we focus on MSNs and design a trust-based intrusion detection approach through Euclidean distance-based behavioral profiling to detect malicious devices (or called nodes). In the evaluation, we collaborate with healthcare organizations and implement our approach in a real simulated MSN...

A neural network approach to the orienteering problem

Energy Technology Data Exchange (ETDEWEB)

Golden, B.; Wang, Q.; Sun, X.; Jia, J.

1994-12-31

In the orienteering problem, we are given a transportation network in which a start point and an end point are specified. Other points have associated scores. Given a fixed amount of time, the goal is to determine a path from start to end through a subset of locations in order to maximize the total path score. This problem has received a considerable amount of attention in the last ten years. The TSP is a variant of the orienteering problem. This paper applies a modified, continuous Hopfield neural network to attack this NP-hard optimization problem. In it, we design an effective energy function and learning algorithm. Unlike some applications of neural networks to optimization problems, this approach is shown to perform quite well.

A generic service interfacing approach for home networking

NARCIS (Netherlands)

Chen, S.; Lukkien, J.J.; Bosman, R.P.; Verhoeven, R.

2010-01-01

This paper presents a generic service interfacing approach which enables the interoperability of networked devices and the reusability of services. Services are specified through a set of interfaces which are language and deployment platform independent. External service orchestration is applied to

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

OpenAIRE

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

2015-01-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 over...

MrTADFinder: A network modularity based approach to identify topologically associating domains in multiple resolutions.

Directory of Open Access Journals (Sweden)

Koon-Kiu Yan

2017-07-01

Full Text Available Genome-wide proximity ligation based assays such as Hi-C have revealed that eukaryotic genomes are organized into structural units called topologically associating domains (TADs. From a visual examination of the chromosomal contact map, however, it is clear that the organization of the domains is not simple or obvious. Instead, TADs exhibit various length scales and, in many cases, a nested arrangement. Here, by exploiting the resemblance between TADs in a chromosomal contact map and densely connected modules in a network, we formulate TAD identification as a network optimization problem and propose an algorithm, MrTADFinder, to identify TADs from intra-chromosomal contact maps. MrTADFinder is based on the network-science concept of modularity. A key component of it is deriving an appropriate background model for contacts in a random chain, by numerically solving a set of matrix equations. The background model preserves the observed coverage of each genomic bin as well as the distance dependence of the contact frequency for any pair of bins exhibited by the empirical map. Also, by introducing a tunable resolution parameter, MrTADFinder provides a self-consistent approach for identifying TADs at different length scales, hence the acronym "Mr" standing for Multiple Resolutions. We then apply MrTADFinder to various Hi-C datasets. The identified domain boundaries are marked by characteristic signatures in chromatin marks and transcription factors (TF that are consistent with earlier work. Moreover, by calling TADs at different length scales, we observe that boundary signatures change with resolution, with different chromatin features having different characteristic length scales. Furthermore, we report an enrichment of HOT (high-occupancy target regions near TAD boundaries and investigate the role of different TFs in determining boundaries at various resolutions. To further explore the interplay between TADs and epigenetic marks, as tumor mutational

Evaluation of Voltage Control Approaches for Future Smart Distribution Networks

Directory of Open Access Journals (Sweden)

Pengfei Wang

2017-08-01

Full Text Available This paper evaluates meta-heuristic and deterministic approaches for distribution network voltage control. As part of this evaluation, a novel meta-heuristic algorithm, Cuckoo Search, is applied for distribution network voltage control and compared with a deterministic voltage control algorithm, the oriented discrete coordinate decent method (ODCDM. ODCDM has been adopted in a state-of-the-art industrial product and applied in real distribution networks. These two algorithms have been evaluated under a set of test cases, which were generated to represent the voltage control problems in current and future distribution networks. Sampled test results have been presented, and findings have been discussed regarding the adoption of different optimization algorithms for current and future distribution networks.

Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach

Science.gov (United States)

Burns, J. E.; Ott, Teunis J.; de Kock, Johan M.; Krzesinski, Anthony E.

2001-07-01

Multi-protocol Label Switching extends the IPv4 destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the network quality of service. The optimization is based upon the minimization of a non-linear objective function which under light load simplifies to OSPF routing with link metrics equal to the link propagation delays. The behavior under heavy load depends on the choice of certain parameters: It can essentially be made to minimize maximal expected utilization, or to maximize minimal expected weighted slacks (both over all links). Under certain circumstances it can be made to minimize the probability that a link has an instantaneous offered load larger than its transmission capacity. We present a model of an MPLS network and an algorithm to find and capacitate optimal LSPs. The algorithm is an improvement of the well-known flow deviation non-linear programming method. The algorithm is applied to compute optimal LSPs for several test networks carrying a single traffic class.

Social Network Analysis and Nutritional Behavior: An Integrated Modeling Approach.

Science.gov (United States)

Senior, Alistair M; Lihoreau, Mathieu; Buhl, Jerome; Raubenheimer, David; Simpson, Stephen J

2016-01-01

Animals have evolved complex foraging strategies to obtain a nutritionally balanced diet and associated fitness benefits. Recent research combining state-space models of nutritional geometry with agent-based models (ABMs), show how nutrient targeted foraging behavior can also influence animal social interactions, ultimately affecting collective dynamics and group structures. Here we demonstrate how social network analyses can be integrated into such a modeling framework and provide a practical analytical tool to compare experimental results with theory. We illustrate our approach by examining the case of nutritionally mediated dominance hierarchies. First we show how nutritionally explicit ABMs that simulate the emergence of dominance hierarchies can be used to generate social networks. Importantly the structural properties of our simulated networks bear similarities to dominance networks of real animals (where conflicts are not always directly related to nutrition). Finally, we demonstrate how metrics from social network analyses can be used to predict the fitness of agents in these simulated competitive environments. Our results highlight the potential importance of nutritional mechanisms in shaping dominance interactions in a wide range of social and ecological contexts. Nutrition likely influences social interactions in many species, and yet a theoretical framework for exploring these effects is currently lacking. Combining social network analyses with computational models from nutritional ecology may bridge this divide, representing a pragmatic approach for generating theoretical predictions for nutritional experiments.

Parallel Void Thread in Long-Reach Ethernet Passive Optical Networks

KAUST Repository

Elrasad, Amr; Shihada, Basem

2015-01-01

This work investigates void filling (idle periods) in long-reach Ethernet passive optical networks. We focus on reducing grant delays and hence reducing the average packet delay. We introduce a novel approach called parallel void thread (PVT), which

A new approach in development of data flow control and investigation system for computer networks

International Nuclear Information System (INIS)

Frolov, I.; Vaguine, A.; Silin, A.

1992-01-01

This paper describes a new approach in development of data flow control and investigation system for computer networks. This approach was developed and applied in the Moscow Radiotechnical Institute for control and investigations of Institute computer network. It allowed us to solve our network current problems successfully. Description of our approach is represented below along with the most interesting results of our work. (author)

A robust neural network-based approach for microseismic event detection

KAUST Repository

Akram, Jubran

2017-08-17

We present an artificial neural network based approach for robust event detection from low S/N waveforms. We use a feed-forward network with a single hidden layer that is tuned on a training dataset and later applied on the entire example dataset for event detection. The input features used include the average of absolute amplitudes, variance, energy-ratio and polarization rectilinearity. These features are calculated in a moving-window of same length for the entire waveform. The output is set as a user-specified relative probability curve, which provides a robust way of distinguishing between weak and strong events. An optimal network is selected by studying the weight-based saliency and effect of number of neurons on the predicted results. Using synthetic data examples, we demonstrate that this approach is effective in detecting weaker events and reduces the number of false positives.

Methodological Approaches to Locating Outlets of the Franchise Retail Network

Directory of Open Access Journals (Sweden)

Grygorenko Tetyana M.

2016-08-01

Full Text Available Methodical approaches to selecting strategic areas of managing the future location of franchise retail network outlets are presented. The main stages in the assessment of strategic areas of managing the future location of franchise retail network outlets have been determined and the evaluation criteria have been suggested. Since such selection requires consideration of a variety of indicators and directions of the assessment, the author proposes a scale of evaluation, which allows generalizing and organizing the research data and calculations of the previous stages of the analysis. The most important criteria and sequence of the selection of the potential franchisees for the franchise retail network have been identified, the technique for their evaluation has been proposed. The use of the suggested methodological approaches will allow the franchiser making sound decisions on the selection of potential target markets, minimizing expenditures of time and efforts on the selection of franchisees and hence optimizing the process of development of the franchise retail network, which will contribute to the formation of its structure.

Approaches in anomaly-based network intrusion detection systems

NARCIS (Netherlands)

Bolzoni, D.; Etalle, S.; Di Pietro, R.; Mancini, L.V.

2008-01-01

Anomaly-based network intrusion detection systems (NIDSs) can take into consideration packet headers, the payload, or a combination of both. We argue that payload-based approaches are becoming the most effective methods to detect attacks. Nowadays, attacks aim mainly to exploit vulnerabilities at

Approaches in Anomaly-based Network Intrusion Detection Systems

NARCIS (Netherlands)

Bolzoni, D.; Etalle, Sandro

Anomaly-based network intrusion detection systems (NIDSs) can take into consideration packet headers, the payload, or a combination of both. We argue that payload-based approaches are becoming the most effective methods to detect attacks. Nowadays, attacks aim mainly to exploit vulnerabilities at

A Network Thermodynamic Approach to Compartmental Analysis

Science.gov (United States)

Mikulecky, D. C.; Huf, E. G.; Thomas, S. R.

1979-01-01

We introduce a general network thermodynamic method for compartmental analysis which uses a compartmental model of sodium flows through frog skin as an illustrative example (Huf and Howell, 1974a). We use network thermodynamics (Mikulecky et al., 1977b) to formulate the problem, and a circuit simulation program (ASTEC 2, SPICE2, or PCAP) for computation. In this way, the compartment concentrations and net fluxes between compartments are readily obtained for a set of experimental conditions involving a square-wave pulse of labeled sodium at the outer surface of the skin. Qualitative features of the influx at the outer surface correlate very well with those observed for the short circuit current under another similar set of conditions by Morel and LeBlanc (1975). In related work, the compartmental model is used as a basis for simulation of the short circuit current and sodium flows simultaneously using a two-port network (Mikulecky et al., 1977a, and Mikulecky et al., A network thermodynamic model for short circuit current transients in frog skin. Manuscript in preparation; Gary-Bobo et al., 1978). The network approach lends itself to computation of classic compartmental problems in a simple manner using circuit simulation programs (Chua and Lin, 1975), and it further extends the compartmental models to more complicated situations involving coupled flows and non-linearities such as concentration dependencies, chemical reaction kinetics, etc. PMID:262387

A novel approach to error function minimization for feedforward neural networks

International Nuclear Information System (INIS)

Sinkus, R.

1995-01-01

Feedforward neural networks with error backpropagation are widely applied to pattern recognition. One general problem encountered with this type of neural networks is the uncertainty, whether the minimization procedure has converged to a global minimum of the cost function. To overcome this problem a novel approach to minimize the error function is presented. It allows to monitor the approach to the global minimum and as an outcome several ambiguities related to the choice of free parameters of the minimization procedure are removed. (orig.)

Analysis of complex networks using aggressive abstraction.

Energy Technology Data Exchange (ETDEWEB)

Colbaugh, Richard; Glass, Kristin.; Willard, Gerald

2008-10-01

This paper presents a new methodology for analyzing complex networks in which the network of interest is first abstracted to a much simpler (but equivalent) representation, the required analysis is performed using the abstraction, and analytic conclusions are then mapped back to the original network and interpreted there. We begin by identifying a broad and important class of complex networks which admit abstractions that are simultaneously dramatically simplifying and property preserving we call these aggressive abstractions -- and which can therefore be analyzed using the proposed approach. We then introduce and develop two forms of aggressive abstraction: 1.) finite state abstraction, in which dynamical networks with uncountable state spaces are modeled using finite state systems, and 2.) onedimensional abstraction, whereby high dimensional network dynamics are captured in a meaningful way using a single scalar variable. In each case, the property preserving nature of the abstraction process is rigorously established and efficient algorithms are presented for computing the abstraction. The considerable potential of the proposed approach to complex networks analysis is illustrated through case studies involving vulnerability analysis of technological networks and predictive analysis for social processes.

Evaluating airline energy efficiency: An integrated approach with Network Epsilon-based Measure and Network Slacks-based Measure

International Nuclear Information System (INIS)

Xu, Xin; Cui, Qiang

2017-01-01

This paper focuses on evaluating airline energy efficiency, which is firstly divided into four stages: Operations Stage, Fleet Maintenance Stage, Services Stage and Sales Stage. The new four-stage network structure of airline energy efficiency is a modification of existing models. A new approach, integrated with Network Epsilon-based Measure and Network Slacks-based Measure, is applied to assess the overall energy efficiency and divisional efficiency of 19 international airlines from 2008 to 2014. The influencing factors of airline energy efficiency are analyzed through the regression analysis. The results indicate the followings: 1. The integrated model can identify the benchmarking airlines in the overall system and stages. 2. Most airlines' energy efficiencies keep steady during the period, except for some sharply fluctuations. The efficiency decreases mainly centralized in the year 2008–2011, affected by the financial crisis in the USA. 3. The average age of fleet is positively correlated with the overall energy efficiency, and each divisional efficiency has different significant influencing factors. - Highlights: • An integrated approach with Network Epsilon-based Measure and Network Slacks-based Measure is developed. • 19 airlines' energy efficiencies are evaluated. • Garuda Indonesia has the highest overall energy efficiency.

A model-guided symbolic execution approach for network protocol implementations and vulnerability detection.

Science.gov (United States)

Wen, Shameng; Meng, Qingkun; Feng, Chao; Tang, Chaojing

2017-01-01

Formal techniques have been devoted to analyzing whether network protocol specifications violate security policies; however, these methods cannot detect vulnerabilities in the implementations of the network protocols themselves. Symbolic execution can be used to analyze the paths of the network protocol implementations, but for stateful network protocols, it is difficult to reach the deep states of the protocol. This paper proposes a novel model-guided approach to detect vulnerabilities in network protocol implementations. Our method first abstracts a finite state machine (FSM) model, then utilizes the model to guide the symbolic execution. This approach achieves high coverage of both the code and the protocol states. The proposed method is implemented and applied to test numerous real-world network protocol implementations. The experimental results indicate that the proposed method is more effective than traditional fuzzing methods such as SPIKE at detecting vulnerabilities in the deep states of network protocol implementations.

A computational approach to extinction events in chemical reaction networks with discrete state spaces.

Science.gov (United States)

Johnston, Matthew D

2017-12-01

Recent work of Johnston et al. has produced sufficient conditions on the structure of a chemical reaction network which guarantee that the corresponding discrete state space system exhibits an extinction event. The conditions consist of a series of systems of equalities and inequalities on the edges of a modified reaction network called a domination-expanded reaction network. In this paper, we present a computational implementation of these conditions written in Python and apply the program on examples drawn from the biochemical literature. We also run the program on 458 models from the European Bioinformatics Institute's BioModels Database and report our results. Copyright © 2017 Elsevier Inc. All rights reserved.

An Architectural Modelfor Intelligent Network Management

Institute of Scientific and Technical Information of China (English)

罗军舟; 顾冠群; 费翔

2000-01-01

Traditional network management approach involves the management of each vendor's equipment and network segment in isolation through its own proprietary element management system. It is necessary to set up a new network management architecture that calls for operation consolidation across vendor and technology boundaries. In this paper, an architectural model for Intelligent Network Management (INM) is presented. The INM system includes a manager system, which controls all subsystems and coordinates different management tasks; an expert system, which is responsible for handling particularly difficult problems, and intelligent agents, which bring the management closer to applications and user requirements by spreading intelligent agents through network segments or domain. In the expert system model proposed, especially an intelligent fault management system is given.The architectural model is to build the INM system to meet the need of managing modern network systems.

System Biology Approach: Gene Network Analysis for Muscular Dystrophy.

Science.gov (United States)

Censi, Federica; Calcagnini, Giovanni; Mattei, Eugenio; Giuliani, Alessandro

2018-01-01

Phenotypic changes at different organization levels from cell to entire organism are associated to changes in the pattern of gene expression. These changes involve the entire genome expression pattern and heavily rely upon correlation patterns among genes. The classical approach used to analyze gene expression data builds upon the application of supervised statistical techniques to detect genes differentially expressed among two or more phenotypes (e.g., normal vs. disease). The use of an a posteriori, unsupervised approach based on principal component analysis (PCA) and the subsequent construction of gene correlation networks can shed a light on unexpected behaviour of gene regulation system while maintaining a more naturalistic view on the studied system.In this chapter we applied an unsupervised method to discriminate DMD patient and controls. The genes having the highest absolute scores in the discrimination between the groups were then analyzed in terms of gene expression networks, on the basis of their mutual correlation in the two groups. The correlation network structures suggest two different modes of gene regulation in the two groups, reminiscent of important aspects of DMD pathogenesis.

Learning about knowledge: A complex network approach

International Nuclear Information System (INIS)

Fontoura Costa, Luciano da

2006-01-01

An approach to modeling knowledge acquisition in terms of walks along complex networks is described. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of edges are considered, corresponding to free and conditional transitions. The latter case implies that a node can only be reached after visiting previously a set of nodes (the required conditions). The process of knowledge acquisition can then be simulated by considering the number of nodes visited as a single agent moves along the network, starting from its lowest layer. It is shown that hierarchical networks--i.e., networks composed of successive interconnected layers--are related to compositions of the prerequisite relationships between the nodes. In order to avoid deadlocks--i.e., unreachable nodes--the subnetwork in each layer is assumed to be a connected component. Several configurations of such hierarchical knowledge networks are simulated and the performance of the moving agent quantified in terms of the percentage of visited nodes after each movement. The Barabasi-Albert and random models are considered for the layer and interconnecting subnetworks. Although all subnetworks in each realization have the same number of nodes, several interconnectivities, defined by the average node degree of the interconnection networks, have been considered. Two visiting strategies are investigated: random choice among the existing edges and preferential choice to so far untracked edges. A series of interesting results are obtained, including the identification of a series of plateaus of knowledge stagnation in the case of the preferential movement strategy in the presence of conditional edges

The Islands Approach to Nearest Neighbor Querying in Spatial Networks

DEFF Research Database (Denmark)

Huang, Xuegang; Jensen, Christian Søndergaard; Saltenis, Simonas

2005-01-01

, and versatile approach to k nearest neighbor computation that obviates the need for using several k nearest neighbor approaches for supporting a single service scenario. The experimental comparison with the existing techniques uses real-world road network data and considers both I/O and CPU performance...

Activity-Driven Influence Maximization in Social Networks

DEFF Research Database (Denmark)

Kumar, Rohit; Saleem, Muhammad Aamir; Calders, Toon

2017-01-01

-driven approach based on the identification of influence propagation patterns. In the first work, we identify so-called information-channels to model potential pathways for information spread, while the second work exploits how users in a location-based social network check in to locations in order to identify...... influential locations. To make our algorithms scalable, approximate versions based on sketching techniques from the data streams domain have been developed. Experiments show that in this way it is possible to efficiently find good seed sets for influence propagation in social networks.......Interaction networks consist of a static graph with a timestamped list of edges over which interaction took place. Examples of interaction networks are social networks whose users interact with each other through messages or location-based social networks where people interact by checking...

Diffusion of innovation: a social network and organizational learning approach to governance of a districtwide leadership team

Directory of Open Access Journals (Sweden)

Yi-Hwa Liou

2016-04-01

Full Text Available District and school leaders play particularly important roles in leading districtwide improvement, as they are increasingly held accountable for bringing about change and improvement for educational innovation and excellence.  While conventional districtwide governance places much of its focus on technical and administrative matters such as policy development, supervision, and monitoring progress. This technical focus often overlooks the fundamental aspect that drives the progress of improvement—the social infrastructure shaped by interpersonal relationship. Responding to recent scholarships that calls for a networked approach to governance, this study examined the change effort of a districtwide leadership team over three points in time drawing on social network theory and analysis focused on district governance.  Specifically, we focused on the type of interpersonal relationship in which leaders engaged with each other in sharing and exchanging innovative ideas as these efforts may support better governance. Additionally, we explored organizational learning as a way to examine climate in support of districtwide innovative efforts during change process. Our findings from leaders indicated increased innovative behaviors and perceived climate on organizational learning over time. The findings suggested that leaders increased connections around risk taking, regardless of their work level over time. This increased connectedness around innovation was coupled with an increase in leaders’ perception of the district’s learning climate, suggesting a cohesive approach to governance and improvement.

A Hybrid Heuristic Optimization Approach for Leak Detection in Pipe Networks Using Ordinal Optimization Approach and the Symbiotic Organism Search

Directory of Open Access Journals (Sweden)

Chao-Chih Lin

2017-10-01

Full Text Available A new transient-based hybrid heuristic approach is developed to optimize a transient generation process and to detect leaks in pipe networks. The approach couples the ordinal optimization approach (OOA and the symbiotic organism search (SOS to solve the optimization problem by means of iterations. A pipe network analysis model (PNSOS is first used to determine steady-state head distribution and pipe flow rates. The best transient generation point and its relevant valve operation parameters are optimized by maximizing the objective function of transient energy. The transient event is created at the chosen point, and the method of characteristics (MOC is used to analyze the transient flow. The OOA is applied to sift through the candidate pipes and the initial organisms with leak information. The SOS is employed to determine the leaks by minimizing the sum of differences between simulated and computed head at the observation points. Two synthetic leaking scenarios, a simple pipe network and a water distribution network (WDN, are chosen to test the performance of leak detection ordinal symbiotic organism search (LDOSOS. Leak information can be accurately identified by the proposed approach for both of the scenarios. The presented technique makes a remarkable contribution to the success of leak detection in the pipe networks.

A model-guided symbolic execution approach for network protocol implementations and vulnerability detection.

Directory of Open Access Journals (Sweden)

Shameng Wen

Full Text Available Formal techniques have been devoted to analyzing whether network protocol specifications violate security policies; however, these methods cannot detect vulnerabilities in the implementations of the network protocols themselves. Symbolic execution can be used to analyze the paths of the network protocol implementations, but for stateful network protocols, it is difficult to reach the deep states of the protocol. This paper proposes a novel model-guided approach to detect vulnerabilities in network protocol implementations. Our method first abstracts a finite state machine (FSM model, then utilizes the model to guide the symbolic execution. This approach achieves high coverage of both the code and the protocol states. The proposed method is implemented and applied to test numerous real-world network protocol implementations. The experimental results indicate that the proposed method is more effective than traditional fuzzing methods such as SPIKE at detecting vulnerabilities in the deep states of network protocol implementations.

A Systems’ Biology Approach to Study MicroRNA-Mediated Gene Regulatory Networks

Directory of Open Access Journals (Sweden)

Xin Lai

2013-01-01

Full Text Available MicroRNAs (miRNAs are potent effectors in gene regulatory networks where aberrant miRNA expression can contribute to human diseases such as cancer. For a better understanding of the regulatory role of miRNAs in coordinating gene expression, we here present a systems biology approach combining data-driven modeling and model-driven experiments. Such an approach is characterized by an iterative process, including biological data acquisition and integration, network construction, mathematical modeling and experimental validation. To demonstrate the application of this approach, we adopt it to investigate mechanisms of collective repression on p21 by multiple miRNAs. We first construct a p21 regulatory network based on data from the literature and further expand it using algorithms that predict molecular interactions. Based on the network structure, a detailed mechanistic model is established and its parameter values are determined using data. Finally, the calibrated model is used to study the effect of different miRNA expression profiles and cooperative target regulation on p21 expression levels in different biological contexts.

Network approaches for understanding rainwater management from a social-ecological systems perspective

Directory of Open Access Journals (Sweden)

Steven D. Prager

2015-12-01

Full Text Available The premise of this research is to better understand how approaches to implementing rainwater management practices can be informed by understanding how the people living and working in agroecosystems are connected to one another. Because these connections are via both social interactions and functional characteristics of the landscape, a social-ecological network emerges. Using social-ecological network theory, we ask how understanding the structure of interactions can lead to improved rainwater management interventions. Using a case study situated within a small sub-basin in the Fogera area of the Blue Nile Basin of Ethiopia, we build networks of smallholders based both on the biophysical and social-institutional landscapes present in the study site, with the smallholders themselves as the common element between the networks. In turn we explore how structures present in the networks may serve to guide decision making regarding both where and with whom rainwater management interventions could be developed. This research thus illustrates an approach for constructing a social-ecological network and demonstrates how the structures of the network yield insights for tailoring the implementation of rainwater management practices to the social and ecological setting.

A Holistic Approach to Networked Information Systems Design and Analysis

Science.gov (United States)

2016-04-15

attain quite substantial savings. 11. Optimal algorithms for energy harvesting in wireless networks. We use a Markov- decision-process (MDP) based...approach to obtain optimal policies for transmissions . The key advantage of our approach is that it holistically considers information and energy in a...Coding technique to minimize delays and the number of transmissions in Wireless Systems. As we approach an era of ubiquitous computing with information

A probabilistic approach to identify putative drug targets in biochemical networks.

NARCIS (Netherlands)

Murabito, E.; Smalbone, K.; Swinton, J.; Westerhoff, H.V.; Steuer, R.

2011-01-01

Network-based drug design holds great promise in clinical research as a way to overcome the limitations of traditional approaches in the development of drugs with high efficacy and low toxicity. This novel strategy aims to study how a biochemical network as a whole, rather than its individual

Intelligent Resource Management for Local Area Networks: Approach and Evolution

Science.gov (United States)

Meike, Roger

1988-01-01

The Data Management System network is a complex and important part of manned space platforms. Its efficient operation is vital to crew, subsystems and experiments. AI is being considered to aid in the initial design of the network and to augment the management of its operation. The Intelligent Resource Management for Local Area Networks (IRMA-LAN) project is concerned with the application of AI techniques to network configuration and management. A network simulation was constructed employing real time process scheduling for realistic loads, and utilizing the IEEE 802.4 token passing scheme. This simulation is an integral part of the construction of the IRMA-LAN system. From it, a causal model is being constructed for use in prediction and deep reasoning about the system configuration. An AI network design advisor is being added to help in the design of an efficient network. The AI portion of the system is planned to evolve into a dynamic network management aid. The approach, the integrated simulation, project evolution, and some initial results are described.

Social network approaches to recruitment, HIV prevention, medical care, and medication adherence

OpenAIRE

Latkin, Carl A.; Davey-Rothwell, Melissa A.; Knowlton, Amy R.; Alexander, Kamila A.; Williams, Chyvette T.; Boodram, Basmattee

2013-01-01

This article reviews current issues and advancements in social network approaches to HIV prevention and care. Social network analysis can provide a method to understand health disparities in HIV rates and treatment access and outcomes. Social network analysis is a value tool to link social structural factors to individual behaviors. Social networks provide an avenue for low cost and sustainable HIV prevention interventions that can be adapted and translated into diverse populations. Social ne...

Optimal and robust control of a class of nonlinear systems using dynamically re-optimised single network adaptive critic design

Science.gov (United States)

Tiwari, Shivendra N.; Padhi, Radhakant

2018-01-01

Following the philosophy of adaptive optimal control, a neural network-based state feedback optimal control synthesis approach is presented in this paper. First, accounting for a nominal system model, a single network adaptive critic (SNAC) based multi-layered neural network (called as NN1) is synthesised offline. However, another linear-in-weight neural network (called as NN2) is trained online and augmented to NN1 in such a manner that their combined output represent the desired optimal costate for the actual plant. To do this, the nominal model needs to be updated online to adapt to the actual plant, which is done by synthesising yet another linear-in-weight neural network (called as NN3) online. Training of NN3 is done by utilising the error information between the nominal and actual states and carrying out the necessary Lyapunov stability analysis using a Sobolev norm based Lyapunov function. This helps in training NN2 successfully to capture the required optimal relationship. The overall architecture is named as 'Dynamically Re-optimised single network adaptive critic (DR-SNAC)'. Numerical results for two motivating illustrative problems are presented, including comparison studies with closed form solution for one problem, which clearly demonstrate the effectiveness and benefit of the proposed approach.

Distributed scheduling to support a call center: A cooperative multiagent approach

NARCIS (Netherlands)

Brazier, F.M.T.; Jonker, C.M.; Jüngen, F.J.; Treur, J.

1999-01-01

This article describes a multiagent system architecture to increase the value of 24-hour-a day call center service. This system supports call centers in making appointments with clients on the basis ofknowledge ofemployees and their schedules. Relevant activities are scheduled for employees in

An approach of community evolution based on gravitational relationship refactoring in dynamic networks

International Nuclear Information System (INIS)

Yin, Guisheng; Chi, Kuo; Dong, Yuxin; Dong, Hongbin

2017-01-01

In this paper, an approach of community evolution based on gravitational relationship refactoring between the nodes in a dynamic network is proposed, and it can be used to simulate the process of community evolution. A static community detection algorithm and a dynamic community evolution algorithm are included in the approach. At first, communities are initialized by constructing the core nodes chains, the nodes can be iteratively searched and divided into corresponding communities via the static community detection algorithm. For a dynamic network, an evolutionary process is divided into three phases, and behaviors of community evolution can be judged according to the changing situation of the core nodes chain in each community. Experiments show that the proposed approach can achieve accuracy and availability in the synthetic and real world networks. - Highlights: • The proposed approach considers both the static community detection and dynamic community evolution. • The approach of community evolution can identify the whole 6 common evolution events. • The proposed approach can judge the evolutionary events according to the variations of the core nodes chains.

Sources of Segregation in Social Networks : A Novel Approach Using Facebook

NARCIS (Netherlands)

Hofstra, B.; Corten, R.; van Tubergen, F.A.; Ellison, Nicole

2017-01-01

Most research on segregation in social networks considers small circles of strong ties, and little is known about segregation among the much larger number of weaker ties. This article proposes a novel approach to the study of these more extended networks, through the use of data on personal ties in

Call Forecasting for Inbound Call Center

Directory of Open Access Journals (Sweden)

Peter Vinje

2009-01-01

Full Text Available In a scenario of inbound call center customer service, the ability to forecast calls is a key element and advantage. By forecasting the correct number of calls a company can predict staffing needs, meet service level requirements, improve customer satisfaction, and benefit from many other optimizations. This project will show how elementary statistics can be used to predict calls for a specific company, forecast the rate at which calls are increasing/decreasing, and determine if the calls may stop at some point.

Network structure exploration in networks with node attributes

Science.gov (United States)

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

2016-05-01

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

Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics.

Directory of Open Access Journals (Sweden)

István A Kovács

Full Text Available BACKGROUND: Network communities help the functional organization and evolution of complex networks. However, the development of a method, which is both fast and accurate, provides modular overlaps and partitions of a heterogeneous network, has proven to be rather difficult. METHODOLOGY/PRINCIPAL FINDINGS: Here we introduce the novel concept of ModuLand, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases. As various adaptations of the method family, we developed several algorithms, which provide an efficient analysis of weighted and directed networks, and (1 determine persvasively overlapping modules with high resolution; (2 uncover a detailed hierarchical network structure allowing an efficient, zoom-in analysis of large networks; (3 allow the determination of key network nodes and (4 help to predict network dynamics. CONCLUSIONS/SIGNIFICANCE: The concept opens a wide range of possibilities to develop new approaches and applications including network routing, classification, comparison and prediction.

PROACTIVE APPROACH TO THE INCIDENT AND PROBLEM MANAGEMENT IN COMMUNICATION NETWORKS

Directory of Open Access Journals (Sweden)

Vjeran Strahonja

2007-06-01

Full Text Available Proactive approach to communication network maintenance has the capability of enhancing the integrity and reliability of communication networks, as well as of reducing maintenance costs and overall number of incidents. This paper presents approaches to problem and incident prevention with the help of root-cause analysis, aligning that with the goal to foresee software performance. Implementation of proactive approach requires recognition of enterprise's current level of maintenance better insights into available approaches and tools, as well as their comparison, interoperability, integration and further development. The approach we are proposing and elaborating in this paper lies on the construction of a metamodel of the problem management of information technology, particularly the proactive problem management. The metamodel is derived from the original ITIL specification and presented in an object-oriented fashion by using structure (class diagrams conform to UML notation. Based on current research, appropriate metrics based on the concept of Key Performance Indicators is suggested.

A Network Approach for Distinguishing Ethical Issues in Research and Development

OpenAIRE

Zwart, S.D.; Van de Poel, I.; Van Mil, H.; Brumsen, M.

2006-01-01

In this paper we report on our experiences with using network analysis to discern and analyse ethical issues in research into, and the development of, a new wastewater treatment technology. Using network analysis, we preliminarily interpreted some of our observations in a Group Decision Room (GDR) session where we invited important stakeholders to think about the risks of this new technology. We show how a network approach is useful for understanding the observations, and suggests some releva...

Meeting fronthaul challenges of future mobile network deployments — The HARP approach

DEFF Research Database (Denmark)

Dittmann, Lars; Christiansen, Henrik Lehrmann; Checko, Aleksandra

2014-01-01

In future mobile networks aggregation at different levels is necessary but at the same time imposes challenges that mandate looking into new architectures. This paper presents the design consideration approach for a C-RAN based mobile aggregation network used in the EU HARP project....... With this architecture fronthaul aggregation is performed which might be an option for future generation of mobile networks....

A Fault Diagnosis Approach for the Hydraulic System by Artificial Neural Networks

OpenAIRE

Xiangyu He; Shanghong He

2014-01-01

Based on artificial neural networks, a fault diagnosis approach for the hydraulic system was proposed in this paper. Normal state samples were used as the training data to develop a dynamic general regression neural network (DGRNN) model. The trained DGRNN model then served as the fault determinant to diagnose test faults and the work condition of the hydraulic system was identified. Several typical faults of the hydraulic system were used to verify the fault diagnosis approach. Experiment re...

Identifying interactions in the time and frequency domains in local and global networks - A Granger Causality Approach.

Science.gov (United States)

Zou, Cunlu; Ladroue, Christophe; Guo, Shuixia; Feng, Jianfeng

2010-06-21

Reverse-engineering approaches such as Bayesian network inference, ordinary differential equations (ODEs) and information theory are widely applied to deriving causal relationships among different elements such as genes, proteins, metabolites, neurons, brain areas and so on, based upon multi-dimensional spatial and temporal data. There are several well-established reverse-engineering approaches to explore causal relationships in a dynamic network, such as ordinary differential equations (ODE), Bayesian networks, information theory and Granger Causality. Here we focused on Granger causality both in the time and frequency domain and in local and global networks, and applied our approach to experimental data (genes and proteins). For a small gene network, Granger causality outperformed all the other three approaches mentioned above. A global protein network of 812 proteins was reconstructed, using a novel approach. The obtained results fitted well with known experimental findings and predicted many experimentally testable results. In addition to interactions in the time domain, interactions in the frequency domain were also recovered. The results on the proteomic data and gene data confirm that Granger causality is a simple and accurate approach to recover the network structure. Our approach is general and can be easily applied to other types of temporal data.

Identifying interactions in the time and frequency domains in local and global networks - A Granger Causality Approach

Directory of Open Access Journals (Sweden)

Guo Shuixia

2010-06-01

Full Text Available Abstract Background Reverse-engineering approaches such as Bayesian network inference, ordinary differential equations (ODEs and information theory are widely applied to deriving causal relationships among different elements such as genes, proteins, metabolites, neurons, brain areas and so on, based upon multi-dimensional spatial and temporal data. There are several well-established reverse-engineering approaches to explore causal relationships in a dynamic network, such as ordinary differential equations (ODE, Bayesian networks, information theory and Granger Causality. Results Here we focused on Granger causality both in the time and frequency domain and in local and global networks, and applied our approach to experimental data (genes and proteins. For a small gene network, Granger causality outperformed all the other three approaches mentioned above. A global protein network of 812 proteins was reconstructed, using a novel approach. The obtained results fitted well with known experimental findings and predicted many experimentally testable results. In addition to interactions in the time domain, interactions in the frequency domain were also recovered. Conclusions The results on the proteomic data and gene data confirm that Granger causality is a simple and accurate approach to recover the network structure. Our approach is general and can be easily applied to other types of temporal data.

Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.

Science.gov (United States)

Yang, S; Wang, D

2000-01-01

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.

Network Management Services Based On The Openflow Environment

Directory of Open Access Journals (Sweden)

Paweł Wilk

2014-01-01

Full Text Available The subject of this article is network management through web service calls, which allows software applications to exert an influence on network traffic. In this manner, software can make independent decisions concerning the direction of requests so that they can be served as soon as possible. This is important because only proper cooperation including all architecture layers can ensure the best performance, especially when software that largely depends on computer networks and utilizes them heavily is involved. To demonstrate that the approach described above is feasible and can be useful at the same time, this article presents a switch-level load balancer developed using OpenFlow. Client software communicates with the balancer through REST web service calls, which are used to provide information on current machine load and its ability to serve incoming requests. The result is a cheap, highly customizable and extremely fast load balancer with considerable potential for further development.

Methodological Approaches to Locating Outlets of the Franchise Retail Network

OpenAIRE

Grygorenko Tetyana M.

2016-01-01

Methodical approaches to selecting strategic areas of managing the future location of franchise retail network outlets are presented. The main stages in the assessment of strategic areas of managing the future location of franchise retail network outlets have been determined and the evaluation criteria have been suggested. Since such selection requires consideration of a variety of indicators and directions of the assessment, the author proposes a scale of evaluation, which ...

NLP model and stochastic multi-start optimization approach for heat exchanger networks

International Nuclear Information System (INIS)

Núñez-Serna, Rosa I.; Zamora, Juan M.

2016-01-01

Highlights: • An NLP model for the optimal design of heat exchanger networks is proposed. • The NLP model is developed from a stage-wise grid diagram representation. • A two-phase stochastic multi-start optimization methodology is utilized. • Improved network designs are obtained with different heat load distributions. • Structural changes and reductions in the number of heat exchangers are produced. - Abstract: Heat exchanger network synthesis methodologies frequently identify good network structures, which nevertheless, might be accompanied by suboptimal values of design variables. The objective of this work is to develop a nonlinear programming (NLP) model and an optimization approach that aim at identifying the best values for intermediate temperatures, sub-stream flow rate fractions, heat loads and areas for a given heat exchanger network topology. The NLP model that minimizes the total annual cost of the network is constructed based on a stage-wise grid diagram representation. To improve the possibilities of obtaining global optimal designs, a two-phase stochastic multi-start optimization algorithm is utilized for the solution of the developed model. The effectiveness of the proposed optimization approach is illustrated with the optimization of two network designs proposed in the literature for two well-known benchmark problems. Results show that from the addressed base network topologies it is possible to achieve improved network designs, with redistributions in exchanger heat loads that lead to reductions in total annual costs. The results also show that the optimization of a given network design sometimes leads to structural simplifications and reductions in the total number of heat exchangers of the network, thereby exposing alternative viable network topologies initially not anticipated.

Scatter networks: a new approach for analysing information scatter

International Nuclear Information System (INIS)

Adamic, Lada A; Suresh, K; Shi Xiaolin

2007-01-01

Information on any given topic is often scattered across the Web. Previously this scatter has been characterized through the inequality of distribution of facts (i.e. pieces of information) across webpages. Such an approach conceals how specific facts (e.g. rare facts) occur in specific types of pages (e.g. fact-rich pages). To reveal such regularities, we construct bipartite networks, consisting of two types of vertices: the facts contained in webpages and the webpages themselves. Such a representation enables the application of a series of network analysis techniques, revealing structural features such as connectivity, robustness and clustering. Not only does network analysis yield new insights into information scatter, but we also illustrate the benefit of applying new and existing analysis techniques directly to a bipartite network as opposed to its one-mode projection. We discuss the implications of each network feature to the users' ability to find comprehensive information online. Finally, we compare the bipartite graph structure of webpages and facts with the hyperlink structure between the webpages

A Balancing Algorithm in Wireless Sensor Network Based on the Assistance of Approaching Nodes

Directory of Open Access Journals (Sweden)

Chengpei Tang

2013-03-01

Full Text Available Sensor node in wireless sensor network is a micro-embedded system with limited memory, energy and communication capabilities. Some nodes will run out of energy and exit the network earlier than other nodes because of the uneven energy consumption. This will lead to partial or complete paralysis of the whole wireless sensor network. A balancing algorithm based on the assistance of approaching nodes is proposed. Via the set theory, notes are divided into neighbor nodes set and approaching nodes set. Approaching nodes will help weaker nodes forward part of massages to balance energy consumption. Simulation result has verified the rationality and feasibility of the balancing algorithm.

Brain networks, structural realism, and local approaches to the scientific realism debate.

Science.gov (United States)

Yan, Karen; Hricko, Jonathon

2017-08-01

We examine recent work in cognitive neuroscience that investigates brain networks. Brain networks are characterized by the ways in which brain regions are functionally and anatomically connected to one another. Cognitive neuroscientists use various noninvasive techniques (e.g., fMRI) to investigate these networks. They represent them formally as graphs. And they use various graph theoretic techniques to analyze them further. We distinguish between knowledge of the graph theoretic structure of such networks (structural knowledge) and knowledge of what instantiates that structure (nonstructural knowledge). And we argue that this work provides structural knowledge of brain networks. We explore the significance of this conclusion for the scientific realism debate. We argue that our conclusion should not be understood as an instance of a global structural realist claim regarding the structure of the unobservable part of the world, but instead, as a local structural realist attitude towards brain networks in particular. And we argue that various local approaches to the realism debate, i.e., approaches that restrict realist commitments to particular theories and/or entities, are problematic insofar as they don't allow for the possibility of such a local structural realist attitude. Copyright © 2017 Elsevier Ltd. All rights reserved.

A Multilayer Network Approach for Guiding Drug Repositioning in Neglected Diseases.

Directory of Open Access Journals (Sweden)

Ariel José Berenstein

2016-01-01

Full Text Available Drug development for neglected diseases has been historically hampered due to lack of market incentives. The advent of public domain resources containing chemical information from high throughput screenings is changing the landscape of drug discovery for these diseases. In this work we took advantage of data from extensively studied organisms like human, mouse, E. coli and yeast, among others, to develop a novel integrative network model to prioritize and identify candidate drug targets in neglected pathogen proteomes, and bioactive drug-like molecules. We modeled genomic (proteins and chemical (bioactive compounds data as a multilayer weighted network graph that takes advantage of bioactivity data across 221 species, chemical similarities between 1.7 105 compounds and several functional relations among 1.67 105 proteins. These relations comprised orthology, sharing of protein domains, and shared participation in defined biochemical pathways. We showcase the application of this network graph to the problem of prioritization of new candidate targets, based on the information available in the graph for known compound-target associations. We validated this strategy by performing a cross validation procedure for known mouse and Trypanosoma cruzi targets and showed that our approach outperforms classic alignment-based approaches. Moreover, our model provides additional flexibility as two different network definitions could be considered, finding in both cases qualitatively different but sensible candidate targets. We also showcase the application of the network to suggest targets for orphan compounds that are active against Plasmodium falciparum in high-throughput screens. In this case our approach provided a reduced prioritization list of target proteins for the query molecules and showed the ability to propose new testable hypotheses for each compound. Moreover, we found that some predictions highlighted by our network model were supported by

A Multilayer Network Approach for Guiding Drug Repositioning in Neglected Diseases.

Science.gov (United States)

Berenstein, Ariel José; Magariños, María Paula; Chernomoretz, Ariel; Agüero, Fernán

2016-01-01

Drug development for neglected diseases has been historically hampered due to lack of market incentives. The advent of public domain resources containing chemical information from high throughput screenings is changing the landscape of drug discovery for these diseases. In this work we took advantage of data from extensively studied organisms like human, mouse, E. coli and yeast, among others, to develop a novel integrative network model to prioritize and identify candidate drug targets in neglected pathogen proteomes, and bioactive drug-like molecules. We modeled genomic (proteins) and chemical (bioactive compounds) data as a multilayer weighted network graph that takes advantage of bioactivity data across 221 species, chemical similarities between 1.7 105 compounds and several functional relations among 1.67 105 proteins. These relations comprised orthology, sharing of protein domains, and shared participation in defined biochemical pathways. We showcase the application of this network graph to the problem of prioritization of new candidate targets, based on the information available in the graph for known compound-target associations. We validated this strategy by performing a cross validation procedure for known mouse and Trypanosoma cruzi targets and showed that our approach outperforms classic alignment-based approaches. Moreover, our model provides additional flexibility as two different network definitions could be considered, finding in both cases qualitatively different but sensible candidate targets. We also showcase the application of the network to suggest targets for orphan compounds that are active against Plasmodium falciparum in high-throughput screens. In this case our approach provided a reduced prioritization list of target proteins for the query molecules and showed the ability to propose new testable hypotheses for each compound. Moreover, we found that some predictions highlighted by our network model were supported by independent

Approach of Complex Networks for the Determination of Brain Death

International Nuclear Information System (INIS)

Sun Wei-Gang; Cao Jian-Ting; Wang Ru-Bin

2011-01-01

In clinical practice, brain death is the irreversible end of all brain activity. Compared to current statistical methods for the determination of brain death, we focus on the approach of complex networks for real-world electroencephalography in its determination. Brain functional networks constructed by correlation analysis are derived, and statistical network quantities used for distinguishing the patients in coma or brain death state, such as average strength, clustering coefficient and average path length, are calculated. Numerical results show that the values of network quantities of patients in coma state are larger than those of patients in brain death state. Our findings might provide valuable insights on the determination of brain death. (cross-disciplinary physics and related areas of science and technology)

A Belief-Space Approach to Integrated Intelligence - Research Area 10.3: Intelligent Networks

Science.gov (United States)

2017-12-05

A Belief-Space Approach to Integrated Intelligence- Research Area 10.3: Intelligent Networks The views, opinions and/or findings contained in this...Technology (MIT) Title: A Belief-Space Approach to Integrated Intelligence- Research Area 10.3: Intelligent Networks Report Term: 0-Other Email: tlp...students presented progress and received feedback from the research group . o wrote papers on their research and submitted them to leading conferences

Assessing call centers’ success:

Directory of Open Access Journals (Sweden)

Hesham A. Baraka

2013-07-01

This paper introduces a model to evaluate the performance of call centers based on the Delone and McLean Information Systems success model. A number of indicators are identified to track the call center’s performance. Mapping of the proposed indicators to the six dimensions of the D&M model is presented. A Weighted Call Center Performance Index is proposed to assess the call center performance; the index is used to analyze the effect of the identified indicators. Policy-Weighted approach was used to assume the weights with an analysis of different weights for each dimension. The analysis of the different weights cases gave priority to the User satisfaction and net Benefits dimension as the two outcomes from the system. For the input dimensions, higher priority was given to the system quality and the service quality dimension. Call centers decision makers can use the tool to tune the different weights in order to reach the objectives set by the organization. Multiple linear regression analysis was used in order to provide a linear formula for the User Satisfaction dimension and the Net Benefits dimension in order to be able to forecast the values for these two dimensions as function of the other dimensions

ADHD classification using bag of words approach on network features

Science.gov (United States)

Solmaz, Berkan; Dey, Soumyabrata; Rao, A. Ravishankar; Shah, Mubarak

2012-02-01

Attention Deficit Hyperactivity Disorder (ADHD) is receiving lots of attention nowadays mainly because it is one of the common brain disorders among children and not much information is known about the cause of this disorder. In this study, we propose to use a novel approach for automatic classification of ADHD conditioned subjects and control subjects using functional Magnetic Resonance Imaging (fMRI) data of resting state brains. For this purpose, we compute the correlation between every possible voxel pairs within a subject and over the time frame of the experimental protocol. A network of voxels is constructed by representing a high correlation value between any two voxels as an edge. A Bag-of-Words (BoW) approach is used to represent each subject as a histogram of network features; such as the number of degrees per voxel. The classification is done using a Support Vector Machine (SVM). We also investigate the use of raw intensity values in the time series for each voxel. Here, every subject is represented as a combined histogram of network and raw intensity features. Experimental results verified that the classification accuracy improves when the combined histogram is used. We tested our approach on a highly challenging dataset released by NITRC for ADHD-200 competition and obtained promising results. The dataset not only has a large size but also includes subjects from different demography and edge groups. To the best of our knowledge, this is the first paper to propose BoW approach in any functional brain disorder classification and we believe that this approach will be useful in analysis of many brain related conditions.

Entropy of dynamical social networks

Science.gov (United States)

Zhao, Kun; Karsai, Marton; Bianconi, Ginestra

2012-02-01

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

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Science.gov (United States)

Niu, Jianjun; Deng, Zhidong

2009-01-01

Energy constraints restrict the lifetime of wireless sensor networks (WSNs) with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs) based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes' energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs. PMID:22408491

Energy Efficient Network Protocols for Wireless and Mobile Networks

National Research Council Canada - National Science Library

Sivalingam, Krishna

2001-01-01

... (also called power aware) network protocols for wireless and mobile networks. Battery power limitations are a very serious concern, and it is essential to study energy efficient protocol design at different layers of the network protocol stack...

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

Modified multiblock partial least squares path modeling algorithm with backpropagation neural networks approach

Science.gov (United States)

Yuniarto, Budi; Kurniawan, Robert

2017-03-01

PLS Path Modeling (PLS-PM) is different from covariance based SEM, where PLS-PM use an approach based on variance or component, therefore, PLS-PM is also known as a component based SEM. Multiblock Partial Least Squares (MBPLS) is a method in PLS regression which can be used in PLS Path Modeling which known as Multiblock PLS Path Modeling (MBPLS-PM). This method uses an iterative procedure in its algorithm. This research aims to modify MBPLS-PM with Back Propagation Neural Network approach. The result is MBPLS-PM algorithm can be modified using the Back Propagation Neural Network approach to replace the iterative process in backward and forward step to get the matrix t and the matrix u in the algorithm. By modifying the MBPLS-PM algorithm using Back Propagation Neural Network approach, the model parameters obtained are relatively not significantly different compared to model parameters obtained by original MBPLS-PM algorithm.

Restoration of lost connectivity of partitioned wireless sensor networks

Directory of Open Access Journals (Sweden)

Virender Ranga

2016-05-01

Full Text Available The lost connectivity due to failure of large scale nodes plays major role to degrade the system performance by generating unnecessary overhead or sometimes totally collapse the active network. There are many issues and challenges to restore the lost connectivity in an unattended scenario, i.e. how many recovery nodes will be sufficient and on which locations these recovery nodes have to be placed. A very few centralized and distributed approaches have been proposed till now. The centralized approaches are good for a scenario where information about the disjoint network, i.e. number of disjoint segments and their locations are well known in advance. However, for a scenario where such information is unknown due to the unattended harsh environment, a distributed approach is a better solution to restore the partitioned network. In this paper, we have proposed and implemented a semi-distributed approach called Relay node Placement using Fermat Point (RPFP. The proposed approach is capable of restoring lost connectivity with small number of recovery relay nodes and it works for any number of disjoint segments. The simulation experiment results show effectiveness of our approach as compared to existing benchmark approaches.

A computational geometry approach to pore network construction for granular packings

Science.gov (United States)

van der Linden, Joost H.; Sufian, Adnan; Narsilio, Guillermo A.; Russell, Adrian R.; Tordesillas, Antoinette

2018-03-01

Pore network construction provides the ability to characterize and study the pore space of inhomogeneous and geometrically complex granular media in a range of scientific and engineering applications. Various approaches to the construction have been proposed, however subtle implementational details are frequently omitted, open access to source code is limited, and few studies compare multiple algorithms in the context of a specific application. This study presents, in detail, a new pore network construction algorithm, and provides a comprehensive comparison with two other, well-established Delaunay triangulation-based pore network construction methods. Source code is provided to encourage further development. The proposed algorithm avoids the expensive non-linear optimization procedure in existing Delaunay approaches, and is robust in the presence of polydispersity. Algorithms are compared in terms of structural, geometrical and advanced connectivity parameters, focusing on the application of fluid flow characteristics. Sensitivity of the various networks to permeability is assessed through network (Stokes) simulations and finite-element (Navier-Stokes) simulations. Results highlight strong dependencies of pore volume, pore connectivity, throat geometry and fluid conductance on the degree of tetrahedra merging and the specific characteristics of the throats targeted by the merging algorithm. The paper concludes with practical recommendations on the applicability of the three investigated algorithms.

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.

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

Science.gov (United States)

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

2016-10-13

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

Mutual Connectivity Analysis (MCA) Using Generalized Radial Basis Function Neural Networks for Nonlinear Functional Connectivity Network Recovery in Resting-State Functional MRI.

Science.gov (United States)

DSouza, Adora M; Abidin, Anas Zainul; Nagarajan, Mahesh B; Wismüller, Axel

2016-03-29

We investigate the applicability of a computational framework, called mutual connectivity analysis (MCA), for directed functional connectivity analysis in both synthetic and resting-state functional MRI data. This framework comprises of first evaluating non-linear cross-predictability between every pair of time series prior to recovering the underlying network structure using community detection algorithms. We obtain the non-linear cross-prediction score between time series using Generalized Radial Basis Functions (GRBF) neural networks. These cross-prediction scores characterize the underlying functionally connected networks within the resting brain, which can be extracted using non-metric clustering approaches, such as the Louvain method. We first test our approach on synthetic models with known directional influence and network structure. Our method is able to capture the directional relationships between time series (with an area under the ROC curve = 0.92 ± 0.037) as well as the underlying network structure (Rand index = 0.87 ± 0.063) with high accuracy. Furthermore, we test this method for network recovery on resting-state fMRI data, where results are compared to the motor cortex network recovered from a motor stimulation sequence, resulting in a strong agreement between the two (Dice coefficient = 0.45). We conclude that our MCA approach is effective in analyzing non-linear directed functional connectivity and in revealing underlying functional network structure in complex systems.

Effective network inference through multivariate information transfer estimation

Science.gov (United States)

Dahlqvist, Carl-Henrik; Gnabo, Jean-Yves

2018-06-01

Network representation has steadily gained in popularity over the past decades. In many disciplines such as finance, genetics, neuroscience or human travel to cite a few, the network may not directly be observable and needs to be inferred from time-series data, leading to the issue of separating direct interactions between two entities forming the network from indirect interactions coming through its remaining part. Drawing on recent contributions proposing strategies to deal with this problem such as the so-called "global silencing" approach of Barzel and Barabasi or "network deconvolution" of Feizi et al. (2013), we propose a novel methodology to infer an effective network structure from multivariate conditional information transfers. Its core principal is to test the information transfer between two nodes through a step-wise approach by conditioning the transfer for each pair on a specific set of relevant nodes as identified by our algorithm from the rest of the network. The methodology is model free and can be applied to high-dimensional networks with both inter-lag and intra-lag relationships. It outperforms state-of-the-art approaches for eliminating the redundancies and more generally retrieving simulated artificial networks in our Monte-Carlo experiments. We apply the method to stock market data at different frequencies (15 min, 1 h, 1 day) to retrieve the network of US largest financial institutions and then document how bank's centrality measurements relate to bank's systemic vulnerability.

Structural identifiability of cyclic graphical models of biological networks with latent variables.

Science.gov (United States)

Wang, Yulin; Lu, Na; Miao, Hongyu

2016-06-13

Graphical models have long been used to describe biological networks for a variety of important tasks such as the determination of key biological parameters, and the structure of graphical model ultimately determines whether such unknown parameters can be unambiguously obtained from experimental observations (i.e., the identifiability problem). Limited by resources or technical capacities, complex biological networks are usually partially observed in experiment, which thus introduces latent variables into the corresponding graphical models. A number of previous studies have tackled the parameter identifiability problem for graphical models such as linear structural equation models (SEMs) with or without latent variables. However, the limited resolution and efficiency of existing approaches necessarily calls for further development of novel structural identifiability analysis algorithms. An efficient structural identifiability analysis algorithm is developed in this study for a broad range of network structures. The proposed method adopts the Wright's path coefficient method to generate identifiability equations in forms of symbolic polynomials, and then converts these symbolic equations to binary matrices (called identifiability matrix). Several matrix operations are introduced for identifiability matrix reduction with system equivalency maintained. Based on the reduced identifiability matrices, the structural identifiability of each parameter is determined. A number of benchmark models are used to verify the validity of the proposed approach. Finally, the network module for influenza A virus replication is employed as a real example to illustrate the application of the proposed approach in practice. The proposed approach can deal with cyclic networks with latent variables. The key advantage is that it intentionally avoids symbolic computation and is thus highly efficient. Also, this method is capable of determining the identifiability of each single parameter and

An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol

Directory of Open Access Journals (Sweden)

Nidhi Lal

2014-12-01

Full Text Available Mobile ad hoc network (MANET is now days become very famous due to their fixed infrastructure-less quality and dynamic nature. They contain a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because they do not contain any infrastructure. Nodes of the MANET use radio wave for communication and having limited resources and limited computational power. The Topology of this network is changing very frequently because they are distributed in nature and self-configurable. Due to its wireless nature and lack of any central authority in the background, Mobile ad hoc networks are always vulnerable to some security issues and performance issues. The security imposes a huge impact on the performance of any network. Some of the security issues are black hole attack, flooding, wormhole attack etc. In this paper, we will discuss issues regarding low performance of Watchdog protocol used in the MANET and proposed an improved Watchdog mechanism, which is called by I-Watchdog protocol that overcomes the limitations of Watchdog protocol and gives high performance in terms of throughput, delay.

A Network Traffic Control Enhancement Approach over Bluetooth Networks

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

2003-01-01

This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated solu...... as capacity limitations and flow requirements in the network. Simulation shows that the performance of Bluetooth networks could be improved by applying the adaptive distributed network traffic control scheme...... solution of the stated optimization problem that satisfies quality of service requirements and topologically induced constraints in Bluetooth networks, such as link capacity and node resource limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well......This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated...

Environmental investment and firm performance: A network approach

International Nuclear Information System (INIS)

Bostian, Moriah; Färe, Rolf; Grosskopf, Shawna; Lundgren, Tommy

2016-01-01

This study examines the role of investment in environmental production practices for both environmental performance and energy efficiency over time. We employ a network DEA approach that links successive production technologies through intertemporal investment decisions with a period by period estimation. This allows us to estimate energy efficiency and environmental performance separately, as well as productivity change and its associated decompositions into efficiency change and technology change. Incorporating a network model also allows us to account for both short-term environmental management practices and long-term environmental investments in each of our productivity measures. We apply this framework to a panel of detailed plant-level production data for Swedish manufacturing firms covering the years 2002–2008. - Highlights: • We use a network DEA model to account for intertemporal environmental investment decisionsin measures of firm productivity. • We apply our network technology model to a panel of firms in Sweden's pulp and paperindustry for the years 2002 - 2008. • We model environmental investments and expenditures separately from other productionoriented inputs. • We find evidence of positive relationships between energy efficiency, environmental performance, and firm productivity.

Game Theoretical Approaches for Transport-Aware Channel Selection in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Chen Shih-Ho

2010-01-01

Full Text Available Effectively sharing channels among secondary users (SUs is one of the greatest challenges in cognitive radio network (CRN. In the past, many studies have proposed channel selection schemes at the physical or the MAC layer that allow SUs swiftly respond to the spectrum states. However, they may not lead to enhance performance due to slow response of the transport layer flow control mechanism. This paper presents a cross-layer design framework called Transport Aware Channel Selection (TACS scheme to optimize the transport throughput based on states, such as RTT and congestion window size, of TCP flow control mechanism. We formulate the TACS problem as two different game theoretic approaches: Selfish Spectrum Sharing Game (SSSG and Cooperative Spectrum Sharing Game (CSSG and present novel distributed heuristic algorithms to optimize TCP throughput. Computer simulations show that SSSG and CSSG could double the SUs throughput of current MAC-based scheme when primary users (PUs use their channel infrequently, and with up to 12% to 100% throughput increase when PUs are more active. The simulation results also illustrated that CSSG performs up to 20% better than SSSG in terms of the throughput.

Structural Approaches to Sequence Evolution Molecules, Networks, Populations

CERN Document Server

Bastolla, Ugo; Roman, H. Eduardo; Vendruscolo, Michele

2007-01-01

Structural requirements constrain the evolution of biological entities at all levels, from macromolecules to their networks, right up to populations of biological organisms. Classical models of molecular evolution, however, are focused at the level of the symbols - the biological sequence - rather than that of their resulting structure. Now recent advances in understanding the thermodynamics of macromolecules, the topological properties of gene networks, the organization and mutation capabilities of genomes, and the structure of populations make it possible to incorporate these key elements into a broader and deeply interdisciplinary view of molecular evolution. This book gives an account of such a new approach, through clear tutorial contributions by leading scientists specializing in the different fields involved.

An integrative -omics approach to identify functional sub-networks in human colorectal cancer.

Directory of Open Access Journals (Sweden)

Rod K Nibbe

2010-01-01

Full Text Available Emerging evidence indicates that gene products implicated in human cancers often cluster together in "hot spots" in protein-protein interaction (PPI networks. Additionally, small sub-networks within PPI networks that demonstrate synergistic differential expression with respect to tumorigenic phenotypes were recently shown to be more accurate classifiers of disease progression when compared to single targets identified by traditional approaches. However, many of these studies rely exclusively on mRNA expression data, a useful but limited measure of cellular activity. Proteomic profiling experiments provide information at the post-translational level, yet they generally screen only a limited fraction of the proteome. Here, we demonstrate that integration of these complementary data sources with a "proteomics-first" approach can enhance the discovery of candidate sub-networks in cancer that are well-suited for mechanistic validation in disease. We propose that small changes in the mRNA expression of multiple genes in the neighborhood of a protein-hub can be synergistically associated with significant changes in the activity of that protein and its network neighbors. Further, we hypothesize that proteomic targets with significant fold change between phenotype and control may be used to "seed" a search for small PPI sub-networks that are functionally associated with these targets. To test this hypothesis, we select proteomic targets having significant expression changes in human colorectal cancer (CRC from two independent 2-D gel-based screens. Then, we use random walk based models of network crosstalk and develop novel reference models to identify sub-networks that are statistically significant in terms of their functional association with these proteomic targets. Subsequently, using an information-theoretic measure, we evaluate synergistic changes in the activity of identified sub-networks based on genome-wide screens of mRNA expression in CRC

An Adaptive Learning Based Network Selection Approach for 5G Dynamic Environments

Directory of Open Access Journals (Sweden)

Xiaohong Li

2018-03-01

Full Text Available Networks will continue to become increasingly heterogeneous as we move toward 5G. Meanwhile, the intelligent programming of the core network makes the available radio resource be more changeable rather than static. In such a dynamic and heterogeneous network environment, how to help terminal users select optimal networks to access is challenging. Prior implementations of network selection are usually applicable for the environment with static radio resources, while they cannot handle the unpredictable dynamics in 5G network environments. To this end, this paper considers both the fluctuation of radio resources and the variation of user demand. We model the access network selection scenario as a multiagent coordination problem, in which a bunch of rationally terminal users compete to maximize their benefits with incomplete information about the environment (no prior knowledge of network resource and other users’ choices. Then, an adaptive learning based strategy is proposed, which enables users to adaptively adjust their selections in response to the gradually or abruptly changing environment. The system is experimentally shown to converge to Nash equilibrium, which also turns out to be both Pareto optimal and socially optimal. Extensive simulation results show that our approach achieves significantly better performance compared with two learning and non-learning based approaches in terms of load balancing, user payoff and the overall bandwidth utilization efficiency. In addition, the system has a good robustness performance under the condition with non-compliant terminal users.

From gene networks to drugs: systems pharmacology approaches for AUD.

Science.gov (United States)

Ferguson, Laura B; Harris, R Adron; Mayfield, Roy Dayne

2018-06-01

The alcohol research field has amassed an impressive number of gene expression datasets spanning key brain areas for addiction, species (humans as well as multiple animal models), and stages in the addiction cycle (binge/intoxication, withdrawal/negative effect, and preoccupation/anticipation). These data have improved our understanding of the molecular adaptations that eventually lead to dysregulation of brain function and the chronic, relapsing disorder of addiction. Identification of new medications to treat alcohol use disorder (AUD) will likely benefit from the integration of genetic, genomic, and behavioral information included in these important datasets. Systems pharmacology considers drug effects as the outcome of the complex network of interactions a drug has rather than a single drug-molecule interaction. Computational strategies based on this principle that integrate gene expression signatures of pharmaceuticals and disease states have shown promise for identifying treatments that ameliorate disease symptoms (called in silico gene mapping or connectivity mapping). In this review, we suggest that gene expression profiling for in silico mapping is critical to improve drug repurposing and discovery for AUD and other psychiatric illnesses. We highlight studies that successfully apply gene mapping computational approaches to identify or repurpose pharmaceutical treatments for psychiatric illnesses. Furthermore, we address important challenges that must be overcome to maximize the potential of these strategies to translate to the clinic and improve healthcare outcomes.

A PSO based Artificial Neural Network approach for short term unit commitment problem

Directory of Open Access Journals (Sweden)

AFTAB AHMAD

2010-10-01

Full Text Available Unit commitment (UC is a non-linear, large scale, complex, mixed-integer combinatorial constrained optimization problem. This paper proposes, a new hybrid approach for generating unit commitment schedules using swarm intelligence learning rule based neural network. The training data has been generated using dynamic programming for machines without valve point effects and using genetic algorithm for machines with valve point effects. A set of load patterns as inputs and the corresponding unit generation schedules as outputs are used to train the network. The neural network fine tunes the best results to the desired targets. The proposed approach has been validated for three thermal machines with valve point effects and without valve point effects. The results are compared with the approaches available in the literature. The PSO-ANN trained model gives better results which show the promise of the proposed methodology.

An improved advertising CTR prediction approach based on the fuzzy deep neural network.

Science.gov (United States)

Jiang, Zilong; Gao, Shu; Li, Mingjiang

2018-01-01

Combining a deep neural network with fuzzy theory, this paper proposes an advertising click-through rate (CTR) prediction approach based on a fuzzy deep neural network (FDNN). In this approach, fuzzy Gaussian-Bernoulli restricted Boltzmann machine (FGBRBM) is first applied to input raw data from advertising datasets. Next, fuzzy restricted Boltzmann machine (FRBM) is used to construct the fuzzy deep belief network (FDBN) with the unsupervised method layer by layer. Finally, fuzzy logistic regression (FLR) is utilized for modeling the CTR. The experimental results show that the proposed FDNN model outperforms several baseline models in terms of both data representation capability and robustness in advertising click log datasets with noise.

A fuzzy genetic approach for network reconfiguration to enhance voltage stability in radial distribution systems

International Nuclear Information System (INIS)

Sahoo, N.C.; Prasad, K.

2006-01-01

This paper presents a fuzzy genetic approach for reconfiguration of radial distribution systems (RDS) so as to maximize the voltage stability of the network for a specific set of loads. The network reconfiguration involves a mechanism for selection of the best set of branches to be opened, one from each loop, such that the reconfigured RDS possesses desired performance characteristics. This discrete solution space is better handled by the proposed scheme, which maximizes a suitable optimizing function (computed using two different approaches). In the first approach, this function is chosen as the average of a voltage stability index of all the buses in the RDS, while in the second approach, the complete RDS is reduced to a two bus equivalent system and the optimizing function is the voltage stability index of this reduced two bus system. The fuzzy genetic algorithm uses a suitable coding and decoding scheme for maintaining the radial nature of the network at every stage of genetic evolution, and it also uses a fuzzy rule based mutation controller for efficient search of the solution space. This method, tested on 69 bus and 33 bus RDSs, shows promising results for the both approaches. It is also observed that the network losses are reduced when the voltage stability is enhanced by the network reconfiguration

A Hybrid Energy Efficient Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Niranjan Kumar Ray

2016-01-01

Full Text Available We proposed an energy conservation technique called Location Based Topology Control with Sleep Scheduling for ad hoc networks. It uses the feature of both topology control approach and power management approach. Like the topology control approach, it attempts to reduce the transmission power of a node, which is determined from its neighborhood location information. A node goes to sleep state based on the traffic condition as that of power management approach. In the proposed scheme, a node goes to sleep state only when its absence does not create local partition in its neighborhood. We preformed extensive simulation to compare the proposed scheme with existing ones. Simulation results show that the energy consumption is lower with increase in the network lifetime and higher throughput in the proposed scheme.

Dialogue and Connectivism: A New Approach to Understanding and Promoting Dialogue-Rich Networked Learning

Directory of Open Access Journals (Sweden)

Andrew Ravenscroft

2011-03-01

Full Text Available Connectivism offers a theory of learning for the digital age that is usually understood as contrasting with traditional behaviourist, cognitivist, and constructivist approaches. This article will provide an original and significant development of this theory through arguing and demonstrating how it can benefit from social constructivist perspectives and a focus on dialogue. Similarly, I argue that we need to ask whether networked social media is, essentially, a new landscape for dialogue and therefore should be conceived and investigated based on this premise, through considering dialogue as the primary means to develop and exploit connections for learning. A key lever in this argument is the increasingly important requirement for greater criticality on the Internet in relation to our assessment and development of connections with people and resources. The open, participative, and social Web actually requires a greater emphasis on higher order cognitive and social competencies that are realised predominantly through dialogue and discourse. Or, as Siemens (2005 implies in his call to rethink the fundamental precepts of learning, we need to shift our focus to promoting core evaluative skills for flexible learning that will, for example, allow us to actuate the knowledge we need at the point that we need it. A corollary of this is the need to reorient educational experiences to ensure that we develop in our learners the ability “to think, reason, and analyse.” In considering how we can achieve these aims this article will review the principles of connectivism from a dialogue perspective; propose some social constructivist approaches based on dialectic and dialogic dimensions of dialogue, which can act as levers in realising connectivist learning dialogue; demonstrate how dialogue games can link the discussed theories to the design and performance of networked dialogue processes; and consider the broader implications of this work for designing

Abductive networks applied to electronic combat

Science.gov (United States)

Montgomery, Gerard J.; Hess, Paul; Hwang, Jong S.

1990-08-01

A practical approach to dealing with combinatorial decision problems and uncertainties associated with electronic combat through the use of networks of high-level functional elements called abductive networks is presented. It describes the application of the Abductory Induction Mechanism (AIMTM) a supervised inductive learning tool for synthesizing polynomial abductive networks to the electronic combat problem domain. From databases of historical expert-generated or simulated combat engagements AIM can often induce compact and robust network models for making effective real-time electronic combat decisions despite significant uncertainties or a combinatorial explosion of possible situations. The feasibility of applying abductive networks to realize advanced combat decision aiding capabilities was demonstrated by applying AIM to a set of electronic combat simulations. The networks synthesized by AIM generated accurate assessments of the intent lethality and overall risk associated with a variety of simulated threats and produced reasonable estimates of the expected effectiveness of a group of electronic countermeasures for a large number of simulated combat scenarios. This paper presents the application of abductive networks to electronic combat summarizes the results of experiments performed using AIM discusses the benefits and limitations of applying abductive networks to electronic combat and indicates why abductive networks can often result in capabilities not attainable using alternative approaches. 1. ELECTRONIC COMBAT. UNCERTAINTY. AND MACHINE LEARNING Electronic combat has become an essential part of the ability to make war and has become increasingly complex since

Towards a model-based development approach for wireless sensor-actuator network protocols

DEFF Research Database (Denmark)

Kumar S., A. Ajith; Simonsen, Kent Inge

2014-01-01

Model-Driven Software Engineering (MDSE) is a promising approach for the development of applications, and has been well adopted in the embedded applications domain in recent years. Wireless Sensor Actuator Networks consisting of resource constrained hardware and platformspecific operating system...... induced due to manual translations. With the use of formal semantics in the modeling approach, we can further ensure the correctness of the source model by means of verification. Also, with the use of network simulators and formal modeling tools, we obtain a verified and validated model to be used...

An iterative approach for the optimization of pavement maintenance management at the network level.

Science.gov (United States)

Torres-Machí, Cristina; Chamorro, Alondra; Videla, Carlos; Pellicer, Eugenio; Yepes, Víctor

2014-01-01

Pavement maintenance is one of the major issues of public agencies. Insufficient investment or inefficient maintenance strategies lead to high economic expenses in the long term. Under budgetary restrictions, the optimal allocation of resources becomes a crucial aspect. Two traditional approaches (sequential and holistic) and four classes of optimization methods (selection based on ranking, mathematical optimization, near optimization, and other methods) have been applied to solve this problem. They vary in the number of alternatives considered and how the selection process is performed. Therefore, a previous understanding of the problem is mandatory to identify the most suitable approach and method for a particular network. This study aims to assist highway agencies, researchers, and practitioners on when and how to apply available methods based on a comparative analysis of the current state of the practice. Holistic approach tackles the problem considering the overall network condition, while the sequential approach is easier to implement and understand, but may lead to solutions far from optimal. Scenarios defining the suitability of these approaches are defined. Finally, an iterative approach gathering the advantages of traditional approaches is proposed and applied in a case study. The proposed approach considers the overall network condition in a simpler and more intuitive manner than the holistic approach.

An Iterative Approach for the Optimization of Pavement Maintenance Management at the Network Level

Directory of Open Access Journals (Sweden)

Cristina Torres-Machí

2014-01-01

Full Text Available Pavement maintenance is one of the major issues of public agencies. Insufficient investment or inefficient maintenance strategies lead to high economic expenses in the long term. Under budgetary restrictions, the optimal allocation of resources becomes a crucial aspect. Two traditional approaches (sequential and holistic and four classes of optimization methods (selection based on ranking, mathematical optimization, near optimization, and other methods have been applied to solve this problem. They vary in the number of alternatives considered and how the selection process is performed. Therefore, a previous understanding of the problem is mandatory to identify the most suitable approach and method for a particular network. This study aims to assist highway agencies, researchers, and practitioners on when and how to apply available methods based on a comparative analysis of the current state of the practice. Holistic approach tackles the problem considering the overall network condition, while the sequential approach is easier to implement and understand, but may lead to solutions far from optimal. Scenarios defining the suitability of these approaches are defined. Finally, an iterative approach gathering the advantages of traditional approaches is proposed and applied in a case study. The proposed approach considers the overall network condition in a simpler and more intuitive manner than the holistic approach.

Dynamics of domain wall networks with junctions

International Nuclear Information System (INIS)

Avelino, P. P.; Oliveira, J. C. R. E.; Martins, C. J. A. P.; Menezes, J.; Menezes, R.

2008-01-01

We use a combination of analytic tools and an extensive set of the largest and most accurate three-dimensional field theory numerical simulations to study the dynamics of domain wall networks with junctions. We build upon our previous work and consider a class of models which, in the limit of large number N of coupled scalar fields, approaches the so-called ''ideal'' model (in terms of its potential to lead to network frustration). We consider values of N between N=2 and N=20, and a range of cosmological epochs, and we also compare this class of models with other toy models used in the past. In all cases we find compelling evidence for a gradual approach to scaling, strongly supporting our no-frustration conjecture. We also discuss the various possible types of junctions (including cases where there is a hierarchy of them) and their roles in the dynamics of the network. Finally, we provide a cosmological Zel'dovich-type bound on the energy scale of this kind of defect network: it must be lower than 10 keV.

A Service-Oriented Approach for Dynamic Chaining of Virtual Network Functions over Multi-Provider Software-Defined Networks

Directory of Open Access Journals (Sweden)

Barbara Martini

2016-06-01

Full Text Available Emerging technologies such as Software-Defined Networks (SDN and Network Function Virtualization (NFV promise to address cost reduction and flexibility in network operation while enabling innovative network service delivery models. However, operational network service delivery solutions still need to be developed that actually exploit these technologies, especially at the multi-provider level. Indeed, the implementation of network functions as software running over a virtualized infrastructure and provisioned on a service basis let one envisage an ecosystem of network services that are dynamically and flexibly assembled by orchestrating Virtual Network Functions even across different provider domains, thereby coping with changeable user and service requirements and context conditions. In this paper we propose an approach that adopts Service-Oriented Architecture (SOA technology-agnostic architectural guidelines in the design of a solution for orchestrating and dynamically chaining Virtual Network Functions. We discuss how SOA, NFV, and SDN may complement each other in realizing dynamic network function chaining through service composition specification, service selection, service delivery, and placement tasks. Then, we describe the architecture of a SOA-inspired NFV orchestrator, which leverages SDN-based network control capabilities to address an effective delivery of elastic chains of Virtual Network Functions. Preliminary results of prototype implementation and testing activities are also presented. The benefits for Network Service Providers are also described that derive from the adaptive network service provisioning in a multi-provider environment through the orchestration of computing and networking services to provide end users with an enhanced service experience.

Traffic measurement for big network data

CERN Document Server

Chen, Shigang; Xiao, Qingjun

2017-01-01

This book presents several compact and fast methods for online traffic measurement of big network data. It describes challenges of online traffic measurement, discusses the state of the field, and provides an overview of the potential solutions to major problems. The authors introduce the problem of per-flow size measurement for big network data and present a fast and scalable counter architecture, called Counter Tree, which leverages a two-dimensional counter sharing scheme to achieve far better memory efficiency and significantly extend estimation range. Unlike traditional approaches to cardinality estimation problems that allocate a separated data structure (called estimator) for each flow, this book takes a different design path by viewing all the flows together as a whole: each flow is allocated with a virtual estimator, and these virtual estimators share a common memory space. A framework of virtual estimators is designed to apply the idea of sharing to an array of cardinality estimation solutions, achi...

Systems approach to modeling the Token Bucket algorithm in computer networks

Directory of Open Access Journals (Sweden)

Ahmed N. U.

2002-01-01

Full Text Available In this paper, we construct a new dynamic model for the Token Bucket (TB algorithm used in computer networks and use systems approach for its analysis. This model is then augmented by adding a dynamic model for a multiplexor at an access node where the TB exercises a policing function. In the model, traffic policing, multiplexing and network utilization are formally defined. Based on the model, we study such issues as (quality of service QoS, traffic sizing and network dimensioning. Also we propose an algorithm using feedback control to improve QoS and network utilization. Applying MPEG video traces as the input traffic to the model, we verify the usefulness and effectiveness of our model.

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

Science.gov (United States)

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

A Dependence between Average Call Duration and Voice Transmission Quality: Measurement and applications

NARCIS (Netherlands)

Holub, J.; Beerends, J.G.; Smid, R.

2004-01-01

This contribution deals with the estimation of the relation between speech transmission quality and average call duration for a given network and portfolio of customers. It uses non-intrusive speech quality measurements on live speech calls. The basic idea behind this analysis is an expectation that

A Cluster-based Approach Towards Detecting and Modeling Network Dictionary Attacks

Directory of Open Access Journals (Sweden)

A. Tajari Siahmarzkooh

2016-12-01

Full Text Available In this paper, we provide an approach to detect network dictionary attacks using a data set collected as flows based on which a clustered graph is resulted. These flows provide an aggregated view of the network traffic in which the exchanged packets in the network are considered so that more internally connected nodes would be clustered. We show that dictionary attacks could be detected through some parameters namely the number and the weight of clusters in time series and their evolution over the time. Additionally, the Markov model based on the average weight of clusters,will be also created. Finally, by means of our suggested model, we demonstrate that artificial clusters of the flows are created for normal and malicious traffic. The results of the proposed approach on CAIDA 2007 data set suggest a high accuracy for the model and, therefore, it provides a proper method for detecting the dictionary attack.

A Flexible Approach for Human Activity Recognition Using Artificial Hydrocarbon Networks.

Science.gov (United States)

Ponce, Hiram; Miralles-Pechuán, Luis; Martínez-Villaseñor, María de Lourdes

2016-10-25

Physical activity recognition based on sensors is a growing area of interest given the great advances in wearable sensors. Applications in various domains are taking advantage of the ease of obtaining data to monitor personal activities and behavior in order to deliver proactive and personalized services. Although many activity recognition systems have been developed for more than two decades, there are still open issues to be tackled with new techniques. We address in this paper one of the main challenges of human activity recognition: Flexibility. Our goal in this work is to present artificial hydrocarbon networks as a novel flexible approach in a human activity recognition system. In order to evaluate the performance of artificial hydrocarbon networks based classifier, experimentation was designed for user-independent, and also for user-dependent case scenarios. Our results demonstrate that artificial hydrocarbon networks classifier is flexible enough to be used when building a human activity recognition system with either user-dependent or user-independent approaches.

Improving the throughput of cognitive radio networks using the broadcast approach

KAUST Repository

Sboui, Lokman; Rezki, Zouheir; Alouini, Mohamed-Slim

2013-01-01

We study the impact of adopting a multi layer coding (MLC) strategy, i.e., the so-called broadcast approach (BA) on the throughput of Cognitive Radio (CR) spectrum sharing systems for general fading channels. First, we consider a scenario where

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Zhidong Deng

2009-10-01

Full Text Available Energy constraints restrict the lifetime of wireless sensor networks (WSNs with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes’ energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs.

A multi-criteria decision analysis approach for importance identification and ranking of network components

International Nuclear Information System (INIS)

Almoghathawi, Yasser; Barker, Kash; Rocco, Claudio M.; Nicholson, Charles D.

2017-01-01

Analyzing network vulnerability is a key element of network planning in order to be prepared for any disruptive event that might impact the performance of the network. Hence, many importance measures have been proposed to identify the important components in a network with respect to vulnerability and rank them accordingly based on individual importance measure. However, in this paper, we propose a new approach to identify the most important network components based on multiple importance measures using a multi criteria decision making (MCDM) method, namely the technique for order performance by similarity to ideal solution (TOPSIS), able to take into account the preferences of decision-makers. We consider multiple edge-specific flow-based importance measures provided as the multiple criteria of a network where the alternatives are the edges. Accordingly, TOPSIS is used to rank the edges of the network based on their importance considering multiple different importance measures. The proposed approach is illustrated through different networks with different densities along with the effects of weighs. - Highlights: • We integrate several perspectives on network vulnerability to generate a component importance ranking. • We apply these measures to determine the importance of edges after disruptions. • Networks of varying size and density are explored.

A Network Biology Approach to Discover the Molecular Biomarker Associated with Hepatocellular Carcinoma

Directory of Open Access Journals (Sweden)

Liwei Zhuang

2014-01-01

Full Text Available In recent years, high throughput technologies such as microarray platform have provided a new avenue for hepatocellular carcinoma (HCC investigation. Traditionally, gene sets enrichment analysis of survival related genes is commonly used to reveal the underlying functional mechanisms. However, this approach usually produces too many candidate genes and cannot discover detailed signaling transduction cascades, which greatly limits their clinical application such as biomarker development. In this study, we have proposed a network biology approach to discover novel biomarkers from multidimensional omics data. This approach effectively combines clinical survival data with topological characteristics of human protein interaction networks and patients expression profiling data. It can produce novel network based biomarkers together with biological understanding of molecular mechanism. We have analyzed eighty HCC expression profiling arrays and identified that extracellular matrix and programmed cell death are the main themes related to HCC progression. Compared with traditional enrichment analysis, this approach can provide concrete and testable hypothesis on functional mechanism. Furthermore, the identified subnetworks can potentially be used as suitable targets for therapeutic intervention in HCC.

A SYSTEM APPROACH TO ORGANISING PROTECTION FROM TARGETED INFORMATION IN SOCIAL NETWORKS

Directory of Open Access Journals (Sweden)

Marina V. Tumbinskaya

2017-01-01

Full Text Available Abstract. Objectives The aim of the study is to formalise a generalised algorithm for the distribution of targeted information in social networks, serving as the basis for a methodology for increasing personal information security. Method The research is based on the methodology of protection from unwanted information distributed across social network systems. Results The article presents the formalisation of an algorithm for the distribution of targeted information across social networks: input and output parameters are defined and the algorithm’s internal conditions are described, consisting of parameters for implementing attack scenarios, which variation would allow them to be detailed. A technique for protection from targeted information distributed across social networks is proposed, allowing the level of protection of personal data and information of social networks users to be enhanced, as well as the reliability of information increased. Conclusion The results of the research will help to prevent threats to information security, counteract attacks by intruders who often use methods of competitive intelligence and social engineering through the use of countermeasures. A model for protection against targeted information and implement special software for its integration into online social network social information systems is developed. The system approach will allow external monitoring of events in social networks to be carried out and vulnerabilities identified in the mechanisms of instant messaging, which provide opportunities for attacks by intruders. The results of the research make it possible to apply a network approach to the study of informal communities, which are actively developing today, at a new level. 

Establishment of a hydrological monitoring network in a tropical African catchment: An integrated participatory approach

Science.gov (United States)

Gomani, M. C.; Dietrich, O.; Lischeid, G.; Mahoo, H.; Mahay, F.; Mbilinyi, B.; Sarmett, J.

Sound decision making for water resources management has to be based on good knowledge of the dominant hydrological processes of a catchment. This information can only be obtained through establishing suitable hydrological monitoring networks. Research catchments are typically established without involving the key stakeholders, which results in instruments being installed at inappropriate places as well as at high risk of theft and vandalism. This paper presents an integrated participatory approach for establishing a hydrological monitoring network. We propose a framework with six steps beginning with (i) inception of idea; (ii) stakeholder identification; (iii) defining the scope of the network; (iv) installation; (v) monitoring; and (vi) feedback mechanism integrated within the participatory framework. The approach is illustrated using an example of the Ngerengere catchment in Tanzania. In applying the approach, the concept of establishing the Ngerengere catchment monitoring network was initiated in 2008 within the Resilient Agro-landscapes to Climate Change in Tanzania (ReACCT) research program. The main stakeholders included: local communities; Sokoine University of Agriculture; Wami Ruvu Basin Water Office and the ReACCT Research team. The scope of the network was based on expert experience in similar projects and lessons learnt from literature review of similar projects from elsewhere integrated with local expert knowledge. The installations involved reconnaissance surveys, detailed surveys, and expert consultations to identify best sites. First, a Digital Elevation Model, land use, and soil maps were used to identify potential monitoring sites. Local and expert knowledge was collected on flow regimes, indicators of shallow groundwater plant species, precipitation pattern, vegetation, and soil types. This information was integrated and used to select sites for installation of an automatic weather station, automatic rain gauges, river flow gauging stations

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

OpenAIRE

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

2014-01-01

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

A study of brain networks associated with swallowing using graph-theoretical approaches.

Directory of Open Access Journals (Sweden)

Bo Luan

Full Text Available Functional connectivity between brain regions during swallowing tasks is still not well understood. Understanding these complex interactions is of great interest from both a scientific and a clinical perspective. In this study, functional magnetic resonance imaging (fMRI was utilized to study brain functional networks during voluntary saliva swallowing in twenty-two adult healthy subjects (all females, [Formula: see text] years of age. To construct these functional connections, we computed mean partial correlation matrices over ninety brain regions for each participant. Two regions were determined to be functionally connected if their correlation was above a certain threshold. These correlation matrices were then analyzed using graph-theoretical approaches. In particular, we considered several network measures for the whole brain and for swallowing-related brain regions. The results have shown that significant pairwise functional connections were, mostly, either local and intra-hemispheric or symmetrically inter-hemispheric. Furthermore, we showed that all human brain functional network, although varying in some degree, had typical small-world properties as compared to regular networks and random networks. These properties allow information transfer within the network at a relatively high efficiency. Swallowing-related brain regions also had higher values for some of the network measures in comparison to when these measures were calculated for the whole brain. The current results warrant further investigation of graph-theoretical approaches as a potential tool for understanding the neural basis of dysphagia.

Flow Regime Identification of Co-Current Downward Two-Phase Flow With Neural Network Approach

International Nuclear Information System (INIS)

Hiroshi Goda; Seungjin Kim; Ye Mi; Finch, Joshua P.; Mamoru Ishii; Jennifer Uhle

2002-01-01

Flow regime identification for an adiabatic vertical co-current downward air-water two-phase flow in the 25.4 mm ID and the 50.8 mm ID round tubes was performed by employing an impedance void meter coupled with the neural network classification approach. This approach minimizes the subjective judgment in determining the flow regimes. The signals obtained by an impedance void meter were applied to train the self-organizing neural network to categorize these impedance signals into a certain number of groups. The characteristic parameters set into the neural network classification included the mean, standard deviation and skewness of impedance signals in the present experiment. The classification categories adopted in the present investigation were four widely accepted flow regimes, viz. bubbly, slug, churn-turbulent, and annular flows. These four flow regimes were recognized based upon the conventional flow visualization approach by a high-speed motion analyzer. The resulting flow regime maps classified by the neural network were compared with the results obtained through the flow visualization method, and consequently the efficiency of the neural network classification for flow regime identification was demonstrated. (authors)

State network approach to characteristics of financial crises

Science.gov (United States)

Qiu, Lu; Gu, Changgui; Xiao, Qin; Yang, Huijie; Wu, Guolin

2018-02-01

Extensive works have reported that a financial crisis can induce significant changes to topological structure of a stock network constructed with cross-correlations between stocks. But there are still some problems to be answered, such as what is the relationship between different crises in history and how to classify them? In the present work, we propose a new network-based solution to extract and display the relationships between the crises. The Dow Jones stock market is investigated as a typical example. The cross-correlation matrix between stocks is used to measure the state of stock market, called state matrix. All the states cluster into six sub-categories. A state network is constructed further to display the relationships between all the states, which contains a total of nine communities. It is found that three crises C , D and E (refer to the Lehman's bankruptcy in 2008, the Euro-zone and International Monetary Fund decide the first bailout for Greece in 2010, and the European sovereign debt crisis in 2011, respectively) belong to a specific sub-category and cluster in a single community. The mid-stage of C is closely linked with E, while the other stages with D. The other two crises A and B (refer to the financial crisis in Asia in 1997, and the burst of "dot-com bubble" in 2002, respectively) belong to another sub-category and gather in a corner of another single community. A and B are linked directly with C and D by two edges. By this way, we give a clear picture of the relationships between the crises.

A fuzzy genetic approach for network reconfiguration to enhance voltage stability in radial distribution systems

Energy Technology Data Exchange (ETDEWEB)

Sahoo, N.C. [Faculty of Engineering and Technology, Multimedia University, Jalan Ayer Keroh Lama, Bukit Beruang, 75450 Melaka (Malaysia); Prasad, K. [Faculty of Information Science and Technology, Multimedia University, Jalan Ayer Keroh Lama, Bukit Beruang, 75450 Melaka (Malaysia)

2006-11-15

This paper presents a fuzzy genetic approach for reconfiguration of radial distribution systems (RDS) so as to maximize the voltage stability of the network for a specific set of loads. The network reconfiguration involves a mechanism for selection of the best set of branches to be opened, one from each loop, such that the reconfigured RDS possesses desired performance characteristics. This discrete solution space is better handled by the proposed scheme, which maximizes a suitable optimizing function (computed using two different approaches). In the first approach, this function is chosen as the average of a voltage stability index of all the buses in the RDS, while in the second approach, the complete RDS is reduced to a two bus equivalent system and the optimizing function is the voltage stability index of this reduced two bus system. The fuzzy genetic algorithm uses a suitable coding and decoding scheme for maintaining the radial nature of the network at every stage of genetic evolution, and it also uses a fuzzy rule based mutation controller for efficient search of the solution space. This method, tested on 69 bus and 33 bus RDSs, shows promising results for the both approaches. It is also observed that the network losses are reduced when the voltage stability is enhanced by the network reconfiguration. (author)

A Robust Approach for Clock Offset Estimation in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Kim Jang-Sub

2010-01-01

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

A complex network approach for nanoparticle agglomeration analysis in nanoscale images

Energy Technology Data Exchange (ETDEWEB)

Machado, Bruno Brandoli, E-mail: bruno.brandoli@ufms.br; Scabini, Leonardo Felipe, E-mail: leo.scabini@ufms.br; Margarido Orue, Jonatan Patrick, E-mail: jonatan.orue@ufms.br; Arruda, Mauro Santos de, E-mail: m.arruda@ufms.br; Goncalves, Diogo Nunes, E-mail: diogo.goncalves@ufms.br; Goncalves, Wesley Nunes, E-mail: wesley.goncalves@ufms.br [Federal University of Mato Grosso do Sul, CS Department (Brazil); Moreira, Raphaell, E-mail: moreira.raphaell@fu-berlin.de [Freie Universitat BerlinTakustr 3 (Germany); Rodrigues-Jr, Jose F, E-mail: junio@usp.br [University of Sao Paulo, CS Department (Brazil)

2017-02-15

Complex networks have been widely used in science and technology because of their ability to represent several systems. One of these systems is found in Biochemistry, in which the synthesis of new nanoparticles is a hot topic. However, the interpretation of experimental results in the search of new nanoparticles poses several challenges. This is due to the characteristics of nanoparticle images and due to their multiple intricate properties; one property of recurrent interest is the agglomeration of particles. Addressing this issue, this paper introduces an approach that uses complex networks to detect and describe nanoparticle agglomerates so to foster easier and more insightful analyses. In this approach, each detected particle in an image corresponds to a vertice and the distances between the particles define a criterion for creating edges. Edges are created if the distance is smaller than a radius of interest. Once this network is set, we calculate several discrete measures able to reveal the most outstanding agglomerates in a nanoparticle image. Experimental results using images of scanning tunneling microscopy (STM) of gold nanoparticles demonstrated the effectiveness of the proposed approach over several samples, as reflected by the separability between particles in three usual settings. The results also demonstrated efficacy for both convex and non-convex agglomerates.

New approach for simulating groundwater flow in discrete fracture network

Science.gov (United States)

Fang, H.; Zhu, J.

2017-12-01

In this study, we develop a new approach to calculate groundwater flowrate and hydraulic head distribution in two-dimensional discrete fracture network (DFN) where both laminar and turbulent flows co-exist in individual fractures. The cubic law is used to calculate hydraulic head distribution and flow behaviors in fractures where flow is laminar, while the Forchheimer's law is used to quantify turbulent flow behaviors. Reynolds number is used to distinguish flow characteristics in individual fractures. The combination of linear and non-linear equations is solved iteratively to determine flowrates in all fractures and hydraulic heads at all intersections. We examine potential errors in both flowrate and hydraulic head from the approach of uniform flow assumption. Applying the cubic law in all fractures regardless of actual flow conditions overestimates the flowrate when turbulent flow may exist while applying the Forchheimer's law indiscriminately underestimate the flowrate when laminar flows exist in the network. The contrast of apertures of large and small fractures in the DFN has significant impact on the potential errors of using only the cubic law or the Forchheimer's law. Both the cubic law and Forchheimer's law simulate similar hydraulic head distributions as the main difference between these two approaches lies in predicting different flowrates. Fracture irregularity does not significantly affect the potential errors from using only the cubic law or the Forchheimer's law if network configuration remains similar. Relative density of fractures does not significantly affect the relative performance of the cubic law and Forchheimer's law.

International network competition

OpenAIRE

Tangerås, Thomas P.; Tåg, Joacim

2014-01-01

We analyse network competition in a market with international calls. National regulatory agencies (NRAs) have incentives to set regulated termination rates above marginal cost to extract rent from international call termination. International network ownership and deregulation are alternatives to combat the incentives of NRAs to distort termination rates. We provide conditions under which each of these policies increase efficiency and aggregate welfare. Our findings provide theoretical suppor...

Patterns of work attitudes: A neural network approach

Science.gov (United States)

Mengov, George D.; Zinovieva, Irina L.; Sotirov, George R.

2000-05-01

In this paper we introduce a neural networks based approach to analyzing empirical data and models from work and organizational psychology (WOP), and suggest possible implications for the practice of managers and business consultants. With this method it becomes possible to have quantitative answers to a bunch of questions like: What are the characteristics of an organization in terms of its employees' motivation? What distinct attitudes towards the work exist? Which pattern is most desirable from the standpoint of productivity and professional achievement? What will be the dynamics of behavior as quantified by our method, during an ongoing organizational change or consultancy intervention? Etc. Our investigation is founded on the theoretical achievements of Maslow (1954, 1970) in human motivation, and of Hackman & Oldham (1975, 1980) in job diagnostics, and applies the mathematical algorithm of the dARTMAP variation (Carpenter et al., 1998) of the Adaptive Resonance Theory (ART) neural networks introduced by Grossberg (1976). We exploit the ART capabilities to visualize the knowledge accumulated in the network's long-term memory in order to interpret the findings in organizational research.

Controlling centrality in complex networks

Science.gov (United States)

Nicosia, V.; Criado, R.; Romance, M.; Russo, G.; Latora, V.

2012-01-01

Spectral centrality measures allow to identify influential individuals in social groups, to rank Web pages by popularity, and even to determine the impact of scientific researches. The centrality score of a node within a network crucially depends on the entire pattern of connections, so that the usual approach is to compute node centralities once the network structure is assigned. We face here with the inverse problem, that is, we study how to modify the centrality scores of the nodes by acting on the structure of a given network. We show that there exist particular subsets of nodes, called controlling sets, which can assign any prescribed set of centrality values to all the nodes of a graph, by cooperatively tuning the weights of their out-going links. We found that many large networks from the real world have surprisingly small controlling sets, containing even less than 5 – 10% of the nodes. PMID:22355732

Green mobile networks a networking perspective

CERN Document Server

Ansari, Nirwan

2016-01-01

Combines the hot topics of energy efficiency and next generation mobile networking, examining techniques and solutions. Green communications is a very hot topic. Ever increasing mobile network bandwidth rates significantly impacts on operating costs due to aggregate network energy consumption. As such, design on 4G networks and beyond has increasingly started to focus on 'energy efficiency' or so-called 'green' networks. Many techniques and solutions have been proposed to enhance the energy efficiency of mobile networks, yet no book has provided an in-depth analysis of the energy consumption issues in mobile networks nor offers detailed theories, tools and solutions for solving the energy efficiency problems.

Hybrid Neural Network Approach Based Tool for the Modelling of Photovoltaic Panels

Directory of Open Access Journals (Sweden)

Antonino Laudani

2015-01-01

Full Text Available A hybrid neural network approach based tool for identifying the photovoltaic one-diode model is presented. The generalization capabilities of neural networks are used together with the robustness of the reduced form of one-diode model. Indeed, from the studies performed by the authors and the works present in the literature, it was found that a direct computation of the five parameters via multiple inputs and multiple outputs neural network is a very difficult task. The reduced form consists in a series of explicit formulae for the support to the neural network that, in our case, is aimed at predicting just two parameters among the five ones identifying the model: the other three parameters are computed by reduced form. The present hybrid approach is efficient from the computational cost point of view and accurate in the estimation of the five parameters. It constitutes a complete and extremely easy tool suitable to be implemented in a microcontroller based architecture. Validations are made on about 10000 PV panels belonging to the California Energy Commission database.

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

Energy Technology Data Exchange (ETDEWEB)

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

2016-04-01

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

Towards a synthesised network approach: An analysis of UK nuclear and renewable (wave) energy programme 1939-1985

International Nuclear Information System (INIS)

Watt, R.N.

1998-05-01

This thesis is concerned with two broad areas of interest: network interpretations of policy processes and alternative sources of energy. All three network interpretations examined (policy networks, actor networks and advocacy coalitions) stress different variables when examining policy processes. Equally, each can be criticised for over-emphasising their chosen variable. However, I shall argue that these flaws do not constitute grounds for dismissing any of these approaches. Several authors have suggested that we combine the merits of these network approaches but so far this has not been attempted. A central aim of this thesis is to develop a synthesis of the merits of each network approach which I argue offers a more robust means of interpreting policy processes. These ideas are then applied to an examination of the relationship between the UK civil nuclear programme (1939-1985) and the UK wave energy programme (1974-1985). Existing literature argues that the nuclear establishment used its considerable influence to undermine the wave energy programme. With the aid of a synthesised network approach, I argue that the nuclear conspiracy narrative is an over-simplification of this particular policy process. (author)

Substrate independent approach for synthesis of graphene platelet networks

Science.gov (United States)

Shashurin, A.; Fang, X.; Zemlyanov, D.; Keidar, M.

2017-06-01

Graphene platelet networks (GPNs) comprised of randomly oriented graphene flakes two to three atomic layers thick are synthesized using a novel plasma-based approach. The approach uses a substrate capable of withstanding synthesis temperatures around 800 °C, but is fully independent of the substrate material. The synthesis occurs directly on the substrate surface without the necessity of any additional steps. GPNs were synthesized on various substrate materials including silicon (Si), thermally oxidized Si (SiO2), molybdenum (Mo), nickel (Ni) and copper (Cu), nickel-chromium (NiCr) alloy and alumina ceramics (Al2O3). The mismatch between the atomic structures of sp2 honeycomb carbon networks and the substrate material is fully eliminated shortly after the synthesis initiation, namely when about 100 nm thick deposits are formed on the substrate. GPN structures synthesized on a substrate at a temperature of about 800 °C are significantly more porous in comparison to the much denser packed amorphous carbon deposits synthesized at lower temperatures. The method proposed here can potentially revolutionize the area of electrochemical energy storage by offering a single-step direct approach for the manufacture of graphene-based electrodes for non-Faradaic supercapacitors. Mass production can be achieved using this method if a roll-to-roll system is utilized.

Adaptive approach to global synchronization of directed networks with fast switching topologies

International Nuclear Information System (INIS)

Qin Buzhi; Lu Xinbiao

2010-01-01

Global synchronization of directed networks with switching topologies is investigated. It is found that if there exists at least one directed spanning tree in the network with the fixed time-average topology and the time-average topology is achieved sufficiently fast, the network will reach global synchronization for appreciate coupling strength. Furthermore, this appreciate coupling strength may be obtained by local adaptive approach. A sufficient condition about the global synchronization is given. Numerical simulations verify the effectiveness of the adaptive strategy.

Analysis of sound data streamed over the network

Directory of Open Access Journals (Sweden)

Jiří Fejfar

2013-01-01

Full Text Available In this paper we inspect a difference between original sound recording and signal captured after streaming this original recording over a network loaded with a heavy traffic. There are several kinds of failures occurring in the captured recording caused by network congestion. We try to find a method how to evaluate correctness of streamed audio. Usually there are metrics based on a human perception of a signal such as “signal is clear, without audible failures”, “signal is having some failures but it is understandable”, or “signal is inarticulate”. These approaches need to be statistically evaluated on a broad set of respondents, which is time and resource consuming. We try to propose some metrics based on signal properties allowing us to compare the original and captured recording. We use algorithm called Dynamic Time Warping (Müller, 2007 commonly used for time series comparison in this paper. Some other time series exploration approaches can be found in (Fejfar, 2011 and (Fejfar, 2012. The data was acquired in our network laboratory simulating network traffic by downloading files, streaming audio and video simultaneously. Our former experiment inspected Quality of Service (QoS and its impact on failures of received audio data stream. This experiment is focused on the comparison of sound recordings rather than network mechanism.We focus, in this paper, on a real time audio stream such as a telephone call, where it is not possible to stream audio in advance to a “pool”. Instead it is necessary to achieve as small delay as possible (between speaker voice recording and listener voice replay. We are using RTP protocol for streaming audio.

A Hybrid Satellite-Terrestrial Approach to Aeronautical Communication Networks

Science.gov (United States)

Kerczewski, Robert J.; Chomos, Gerald J.; Griner, James H.; Mainger, Steven W.; Martzaklis, Konstantinos S.; Kachmar, Brian A.

2000-01-01

Rapid growth in air travel has been projected to continue for the foreseeable future. To maintain a safe and efficient national and global aviation system, significant advances in communications systems supporting aviation are required. Satellites will increasingly play a critical role in the aeronautical communications network. At the same time, current ground-based communications links, primarily very high frequency (VHF), will continue to be employed due to cost advantages and legacy issues. Hence a hybrid satellite-terrestrial network, or group of networks, will emerge. The increased complexity of future aeronautical communications networks dictates that system-level modeling be employed to obtain an optimal system fulfilling a majority of user needs. The NASA Glenn Research Center is investigating the current and potential future state of aeronautical communications, and is developing a simulation and modeling program to research future communications architectures for national and global aeronautical needs. This paper describes the primary requirements, the current infrastructure, and emerging trends of aeronautical communications, including a growing role for satellite communications. The need for a hybrid communications system architecture approach including both satellite and ground-based communications links is explained. Future aeronautical communication network topologies and key issues in simulation and modeling of future aeronautical communications systems are described.

Exploring trade-offs between VMAT dose quality and delivery efficiency using a network optimization approach

International Nuclear Information System (INIS)

Salari, Ehsan; Craft, David; Wala, Jeremiah

2012-01-01

To formulate and solve the fluence-map merging procedure of the recently-published VMAT treatment-plan optimization method, called vmerge, as a bi-criteria optimization problem. Using an exact merging method rather than the previously-used heuristic, we are able to better characterize the trade-off between the delivery efficiency and dose quality. vmerge begins with a solution of the fluence-map optimization problem with 180 equi-spaced beams that yields the ‘ideal’ dose distribution. Neighboring fluence maps are then successively merged, meaning that they are added together and delivered as a single map. The merging process improves the delivery efficiency at the expense of deviating from the initial high-quality dose distribution. We replace the original merging heuristic by considering the merging problem as a discrete bi-criteria optimization problem with the objectives of maximizing the treatment efficiency and minimizing the deviation from the ideal dose. We formulate this using a network-flow model that represents the merging problem. Since the problem is discrete and thus non-convex, we employ a customized box algorithm to characterize the Pareto frontier. The Pareto frontier is then used as a benchmark to evaluate the performance of the standard vmerge algorithm as well as two other similar heuristics. We test the exact and heuristic merging approaches on a pancreas and a prostate cancer case. For both cases, the shape of the Pareto frontier suggests that starting from a high-quality plan, we can obtain efficient VMAT plans through merging neighboring fluence maps without substantially deviating from the initial dose distribution. The trade-off curves obtained by the various heuristics are contrasted and shown to all be equally capable of initial plan simplifications, but to deviate in quality for more drastic efficiency improvements. This work presents a network optimization approach to the merging problem. Contrasting the trade-off curves of the

Exploring trade-offs between VMAT dose quality and delivery efficiency using a network optimization approach.

Science.gov (United States)

Salari, Ehsan; Wala, Jeremiah; Craft, David

2012-09-07

To formulate and solve the fluence-map merging procedure of the recently-published VMAT treatment-plan optimization method, called VMERGE, as a bi-criteria optimization problem. Using an exact merging method rather than the previously-used heuristic, we are able to better characterize the trade-off between the delivery efficiency and dose quality. VMERGE begins with a solution of the fluence-map optimization problem with 180 equi-spaced beams that yields the 'ideal' dose distribution. Neighboring fluence maps are then successively merged, meaning that they are added together and delivered as a single map. The merging process improves the delivery efficiency at the expense of deviating from the initial high-quality dose distribution. We replace the original merging heuristic by considering the merging problem as a discrete bi-criteria optimization problem with the objectives of maximizing the treatment efficiency and minimizing the deviation from the ideal dose. We formulate this using a network-flow model that represents the merging problem. Since the problem is discrete and thus non-convex, we employ a customized box algorithm to characterize the Pareto frontier. The Pareto frontier is then used as a benchmark to evaluate the performance of the standard VMERGE algorithm as well as two other similar heuristics. We test the exact and heuristic merging approaches on a pancreas and a prostate cancer case. For both cases, the shape of the Pareto frontier suggests that starting from a high-quality plan, we can obtain efficient VMAT plans through merging neighboring fluence maps without substantially deviating from the initial dose distribution. The trade-off curves obtained by the various heuristics are contrasted and shown to all be equally capable of initial plan simplifications, but to deviate in quality for more drastic efficiency improvements. This work presents a network optimization approach to the merging problem. Contrasting the trade-off curves of the merging

Genetic algorithm and neural network hybrid approach for job-shop scheduling

OpenAIRE

Zhao, Kai; Yang, Shengxiang; Wang, Dingwei

1998-01-01

Copyright @ 1998 ACTA Press This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach for job-shop scheduling with respect to the quality of solutions and ...

Kaolin Quality Prediction from Samples: A Bayesian Network Approach

International Nuclear Information System (INIS)

Rivas, T.; Taboada, J.; Ordonez, C.; Matias, J. M.

2009-01-01

We describe the results of an expert system applied to the evaluation of samples of kaolin for industrial use in paper or ceramic manufacture. Different machine learning techniques - classification trees, support vector machines and Bayesian networks - were applied with the aim of evaluating and comparing their interpretability and prediction capacities. The predictive capacity of these models for the samples analyzed was highly satisfactory, both for ceramic quality and paper quality. However, Bayesian networks generally proved to be the most useful technique for our study, as this approach combines good predictive capacity with excellent interpretability of the kaolin quality structure, as it graphically represents relationships between variables and facilitates what-if analyses.

A Synchro-Diachro Approach to Question the Development of a Human and Organizational Factors (HOF) Network

International Nuclear Information System (INIS)

Vautier, J.-F.; Dutillieu, S.; Quiblier, S.; Sylvestre, C.; Lévêque, F.; Barnabé, I.; Baussart, N.; Paulus, V.; Lipart, C.; Barrière, V.; Dupont, M.

2016-01-01

First, this communication presents a dual approach to question the development of a HOF network. Next, an illustration of this approach is proposed: the development of the HOF network of the CEA. The dual approach is based on a synchronic way and a diachronic one, hence the name: “synchro-diachro”. The illustration presents elements which come from our experience feedback at CEA. The synchro-diachro approach: The synchronic point of view focuses on the development of a HOF network at one moment of its development. It is like taking a picture. The objective is here to point out some characteristics of the functioning of a HOF network. They are related to the complex systems theory, and especially to the concept of dialogical principle, proposed by Edgar Morin. These characteristics are dialogical pairs. The elements of this kind of pair are both complementary and antagonist to one another.

Algorithmic PON/P2P FTTH Access Network Design for CAPEX Minimization

DEFF Research Database (Denmark)

Papaefthimiou, Kostantinos; Tefera, Yonas; Mihylov, Dimitar

2013-01-01

one. It provides an obvious advantage for the end users in terms of high achievable data rates. On the other hand, the high initial deployment cost required exists as the heaviest impediment. The main goal of this paper is to study different approaches when designing a fiber access network. More......Due to the emergence of high bandwidth-requiring services, telecommunication operators (telcos) are called to upgrade their fixed access network. In order to keep up with the competition, they must consider different optical access network solutions with Fiber To The Home (FTTH) as the prevailing...

BELIEF dashboard - a web-based curation interface to support generation of BEL networks

OpenAIRE

Madan, Sumit; Hodapp, Sven; Fluck, Juliane

2015-01-01

The relevance of network-based approaches in systems biology to achieve a better understanding of biological mechanisms has increased enormously. The Biological Expression Language (BEL) is well designed to collate findings from scientific literature into biological network models. To facilitate encoding and biocuration of such findings in BEL, a free and user-friendly web-based curation interface called BELIEF Dashboard has been developed. The interface incorporates an information extraction...

From Microactions to Macrostructure and Back : A Structurational Approach to the Evolution of Organizational Networks

NARCIS (Netherlands)

Whitbred, Robert; Fonti, Fabio; Steglich, Christian; Contractor, Noshir

Structuration theory (ST) and network analysis are promising approaches for studying the emergence of communication networks. We offer a model that integrates the conceptual richness of structuration with the precision of relevant concepts and mechanisms offered from communication network research.

Adapting Mobile Beacon-Assisted Localization in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Wei Dong

2009-04-01

Full Text Available The ability to automatically locate sensor nodes is essential in many Wireless Sensor Network (WSN applications. To reduce the number of beacons, many mobile-assisted approaches have been proposed. Current mobile-assisted approaches for localization require special hardware or belong to centralized localization algorithms involving some deterministic approaches due to the fact that they explicitly consider the impreciseness of location estimates. In this paper, we first propose a range-free, distributed and probabilistic Mobile Beacon-assisted Localization (MBL approach for static WSNs. Then, we propose another approach based on MBL, called Adapting MBL (A-MBL, to increase the efficiency and accuracy of MBL by adapting the size of sample sets and the parameter of the dynamic model during the estimation process. Evaluation results show that the accuracy of MBL and A-MBL outperform both Mobile and Static sensor network Localization (MSL and Arrival and Departure Overlap (ADO when both of them use only a single mobile beacon for localization in static WSNs.

Adapting mobile beacon-assisted localization in wireless sensor networks.

Science.gov (United States)

Teng, Guodong; Zheng, Kougen; Dong, Wei

2009-01-01

The ability to automatically locate sensor nodes is essential in many Wireless Sensor Network (WSN) applications. To reduce the number of beacons, many mobile-assisted approaches have been proposed. Current mobile-assisted approaches for localization require special hardware or belong to centralized localization algorithms involving some deterministic approaches due to the fact that they explicitly consider the impreciseness of location estimates. In this paper, we first propose a range-free, distributed and probabilistic Mobile Beacon-assisted Localization (MBL) approach for static WSNs. Then, we propose another approach based on MBL, called Adapting MBL (A-MBL), to increase the efficiency and accuracy of MBL by adapting the size of sample sets and the parameter of the dynamic model during the estimation process. Evaluation results show that the accuracy of MBL and A-MBL outperform both Mobile and Static sensor network Localization (MSL) and Arrival and Departure Overlap (ADO) when both of them use only a single mobile beacon for localization in static WSNs.

A Passive Testing Approach for Protocols in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Xiaoping Che

2015-11-01

Full Text Available Smart systems are today increasingly developed with the number of wireless sensor devices drastically increasing. They are implemented within several contexts throughout our environment. Thus, sensed data transported in ubiquitous systems are important, and the way to carry them must be efficient and reliable. For that purpose, several routing protocols have been proposed for wireless sensor networks (WSN. However, one stage that is often neglected before their deployment is the conformance testing process, a crucial and challenging step. Compared to active testing techniques commonly used in wired networks, passive approaches are more suitable to the WSN environment. While some works propose to specify the protocol with state models or to analyze them with simulators and emulators, we here propose a logic-based approach for formally specifying some functional requirements of a novel WSN routing protocol. We provide an algorithm to evaluate these properties on collected protocol execution traces. Further, we demonstrate the efficiency and suitability of our approach by its application into common WSN functional properties, as well as specific ones designed from our own routing protocol. We provide relevant testing verdicts through a real indoor testbed and the implementation of our protocol. Furthermore, the flexibility, genericity and practicability of our approach have been proven by the experimental results.

A social network analysis of alcohol-impaired drivers in Maryland : an egocentric approach.

Science.gov (United States)

2011-04-01

This study examined the personal, household, and social structural attributes of alcoholimpaired : drivers in Maryland. The study used an egocentric approach of social network : analysis. This approach concentrated on specific actors (alcohol-impaire...

A Network-Based Approach to Modeling and Predicting Product Coconsideration Relations

Directory of Open Access Journals (Sweden)

Zhenghui Sha

2018-01-01

Full Text Available Understanding customer preferences in consideration decisions is critical to choice modeling in engineering design. While existing literature has shown that the exogenous effects (e.g., product and customer attributes are deciding factors in customers’ consideration decisions, it is not clear how the endogenous effects (e.g., the intercompetition among products would influence such decisions. This paper presents a network-based approach based on Exponential Random Graph Models to study customers’ consideration behaviors according to engineering design. Our proposed approach is capable of modeling the endogenous effects among products through various network structures (e.g., stars and triangles besides the exogenous effects and predicting whether two products would be conisdered together. To assess the proposed model, we compare it against the dyadic network model that only considers exogenous effects. Using buyer survey data from the China automarket in 2013 and 2014, we evaluate the goodness of fit and the predictive power of the two models. The results show that our model has a better fit and predictive accuracy than the dyadic network model. This underscores the importance of the endogenous effects on customers’ consideration decisions. The insights gained from this research help explain how endogenous effects interact with exogeous effects in affecting customers’ decision-making.

Passenger flow analysis of Beijing urban rail transit network using fractal approach

Science.gov (United States)

Li, Xiaohong; Chen, Peiwen; Chen, Feng; Wang, Zijia

2018-04-01

To quantify the spatiotemporal distribution of passenger flow and the characteristics of an urban rail transit network, we introduce four radius fractal dimensions and two branch fractal dimensions by combining a fractal approach with passenger flow assignment model. These fractal dimensions can numerically describe the complexity of passenger flow in the urban rail transit network and its change characteristics. Based on it, we establish a fractal quantification method to measure the fractal characteristics of passenger follow in the rail transit network. Finally, we validate the reasonability of our proposed method by using the actual data of Beijing subway network. It has been shown that our proposed method can effectively measure the scale-free range of the urban rail transit network, network development and the fractal characteristics of time-varying passenger flow, which further provides a reference for network planning and analysis of passenger flow.

Data reliability in complex directed networks

Science.gov (United States)

Sanz, Joaquín; Cozzo, Emanuele; Moreno, Yamir

2013-12-01

The availability of data from many different sources and fields of science has made it possible to map out an increasing number of networks of contacts and interactions. However, quantifying how reliable these data are remains an open problem. From Biology to Sociology and Economics, the identification of false and missing positives has become a problem that calls for a solution. In this work we extend one of the newest, best performing models—due to Guimerá and Sales-Pardo in 2009—to directed networks. The new methodology is able to identify missing and spurious directed interactions with more precision than previous approaches, which renders it particularly useful for analyzing data reliability in systems like trophic webs, gene regulatory networks, communication patterns and several social systems. We also show, using real-world networks, how the method can be employed to help search for new interactions in an efficient way.

Data reliability in complex directed networks

International Nuclear Information System (INIS)

Sanz, Joaquín; Cozzo, Emanuele; Moreno, Yamir

2013-01-01

The availability of data from many different sources and fields of science has made it possible to map out an increasing number of networks of contacts and interactions. However, quantifying how reliable these data are remains an open problem. From Biology to Sociology and Economics, the identification of false and missing positives has become a problem that calls for a solution. In this work we extend one of the newest, best performing models—due to Guimerá and Sales-Pardo in 2009—to directed networks. The new methodology is able to identify missing and spurious directed interactions with more precision than previous approaches, which renders it particularly useful for analyzing data reliability in systems like trophic webs, gene regulatory networks, communication patterns and several social systems. We also show, using real-world networks, how the method can be employed to help search for new interactions in an efficient way. (paper)

Mapping Koch curves into scale-free small-world networks

International Nuclear Information System (INIS)

Zhang Zhongzhi; Gao Shuyang; Zhou Shuigeng; Chen Lichao; Zhang Hongjuan; Guan Jihong

2010-01-01

The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping technique converting Koch fractals into a family of deterministic networks called Koch networks. This novel class of networks incorporates some key properties characterizing a majority of real-life networked systems-a power-law distribution with exponent in the range between 2 and 3, a high clustering coefficient, a small diameter and average path length and degree correlations. Besides, we enumerate the exact numbers of spanning trees, spanning forests and connected spanning subgraphs in the networks. All these features are obtained exactly according to the proposed generation algorithm of the networks considered. The network representation approach could be used to investigate the complexity of some real-world systems from the perspective of complex networks.

An Improved Dynamic Programming Decomposition Approach for Network Revenue Management

OpenAIRE

Dan Zhang

2011-01-01

We consider a nonlinear nonseparable functional approximation to the value function of a dynamic programming formulation for the network revenue management (RM) problem with customer choice. We propose a simultaneous dynamic programming approach to solve the resulting problem, which is a nonlinear optimization problem with nonlinear constraints. We show that our approximation leads to a tighter upper bound on optimal expected revenue than some known bounds in the literature. Our approach can ...

Multiscale Embedded Gene Co-expression Network Analysis.

Directory of Open Access Journals (Sweden)

Won-Min Song

2015-11-01

Full Text Available Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3, the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA by: i introducing quality control of co-expression similarities, ii parallelizing embedded network construction, and iii developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs. We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA. MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma.

Multiscale Embedded Gene Co-expression Network Analysis.

Science.gov (United States)

Song, Won-Min; Zhang, Bin

2015-11-01

Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma.

An Investigation of a New Social Networks Contact Suggestion Based on Face Recognition Algorithm

Directory of Open Access Journals (Sweden)

Ivan Zelinka

2016-01-01

Full Text Available Automated comparison of faces in the photographs is a well established discipline. The main aim of this paper is to describe an approach whereby face recognition can be used in suggestion of a new contacts. The new contact suggestion is a common technique used across all main social networks. Our approach uses a freely available face comparison called "Betaface" together with our automated processig of the user´s Facebook profile. The research´s main point of interest is the comparison of friend´s facial images in a social network itself, how to process such a great amount of photos and what additional sources of data should be used. In this approach we used our automated processing algorithm Betaface in the social network Facebook and for the additional data, the Flickr social network was used. The results and their quality are discussed at the end.

Informal networks and resilience to climate change impacts: A collective approach to index insurance

DEFF Research Database (Denmark)

Trærup, Sara Lærke Meltofte

2012-01-01

This article contributes to the understanding of how to proceed with the development of index-insurance in order to reach extended population coverage with the insurance. The approach is applied to an example from a region in Tanzania. One of the main coping strategies that resource-poor households...... networks become insufficient since the majority of risk-sharers will be affected by the shock at the same time. This paper proposes a collective approach to index-insurance in which the members of an informal network will be insured as one insurance taker. The paper raises a conceptual argument...... that targeting households through existing informal networks will remove a number of prevailing barriers to the takeup of insurance and consequently the approach has the potential to increase households’ resilience to climate change impacts. The policy implications of the conclusions are significant since...

A review of active learning approaches to experimental design for uncovering biological networks

Science.gov (United States)

2017-01-01

Various types of biological knowledge describe networks of interactions among elementary entities. For example, transcriptional regulatory networks consist of interactions among proteins and genes. Current knowledge about the exact structure of such networks is highly incomplete, and laboratory experiments that manipulate the entities involved are conducted to test hypotheses about these networks. In recent years, various automated approaches to experiment selection have been proposed. Many of these approaches can be characterized as active machine learning algorithms. Active learning is an iterative process in which a model is learned from data, hypotheses are generated from the model to propose informative experiments, and the experiments yield new data that is used to update the model. This review describes the various models, experiment selection strategies, validation techniques, and successful applications described in the literature; highlights common themes and notable distinctions among methods; and identifies likely directions of future research and open problems in the area. PMID:28570593

Network analysis: A new way of understanding psychopathology?

Science.gov (United States)

Fonseca-Pedrero, Eduardo

Current taxonomic systems are based on a descriptive and categorical approach where psychopathological symptoms and signs are caused by a hypothetical underlying mental disorder. In order to circumvent the limitations of classification systems, it is necessary to incorporate new conceptual and psychometric models that allow to understand, analyze and intervene in psychopathological phenomena from another perspective. The main goal was to present a new approach called network analysis for its application in the field of psychopathology. First of all, a brief introduction where psychopathological disorders are conceived as complex dynamic systems was carried out. Key concepts, as well as the different types of networks and the procedures for their estimation, are discussed. Following this, centrality measures, important for the understanding of the network as well as to examine the relevance of the variables within the network were addressed. These factors were then exemplified by estimating a network of self-reported psychopathological symptoms in a representative sample of adolescents. Finally, a brief recapitulation is made and future lines of research are discussed. Copyright © 2017 SEP y SEPB. Publicado por Elsevier España, S.L.U. All rights reserved.

Quantitative analysis of access strategies to remoteinformation in network services

DEFF Research Database (Denmark)

Olsen, Rasmus Løvenstein; Schwefel, Hans-Peter; Hansen, Martin Bøgsted

2006-01-01

of analytic models to compute different performance metrics for these approaches, with special focus on the so-called mismatch probability. The results of the analytic models allow for design decisions on which strategy to implement for specific input parameters (change rate of the information element......Remote access to dynamically changing information elements is a required functionality for various network services, including routing and instances of context-sensitive networking. Three fundamentally different strategies for such access are investigated in this paper: (1) a reactive approach...... initiated by the requesting entity, and two versions of proactive approaches in which the entity that contains the information element actively propagates its changes to potential requesters, either (2) periodically or triggered by changes of the information element (3). This paper first develops a set...

An enhanced performance through agent-based secure approach for mobile ad hoc networks

Science.gov (United States)

Bisen, Dhananjay; Sharma, Sanjeev

2018-01-01

This paper proposes an agent-based secure enhanced performance approach (AB-SEP) for mobile ad hoc network. In this approach, agent nodes are selected through optimal node reliability as a factor. This factor is calculated on the basis of node performance features such as degree difference, normalised distance value, energy level, mobility and optimal hello interval of node. After selection of agent nodes, a procedure of malicious behaviour detection is performed using fuzzy-based secure architecture (FBSA). To evaluate the performance of the proposed approach, comparative analysis is done with conventional schemes using performance parameters such as packet delivery ratio, throughput, total packet forwarding, network overhead, end-to-end delay and percentage of malicious detection.

A mathematical programming approach for sequential clustering of dynamic networks

Science.gov (United States)

Silva, Jonathan C.; Bennett, Laura; Papageorgiou, Lazaros G.; Tsoka, Sophia

2016-02-01

A common analysis performed on dynamic networks is community structure detection, a challenging problem that aims to track the temporal evolution of network modules. An emerging area in this field is evolutionary clustering, where the community structure of a network snapshot is identified by taking into account both its current state as well as previous time points. Based on this concept, we have developed a mixed integer non-linear programming (MINLP) model, SeqMod, that sequentially clusters each snapshot of a dynamic network. The modularity metric is used to determine the quality of community structure of the current snapshot and the historical cost is accounted for by optimising the number of node pairs co-clustered at the previous time point that remain so in the current snapshot partition. Our method is tested on social networks of interactions among high school students, college students and members of the Brazilian Congress. We show that, for an adequate parameter setting, our algorithm detects the classes that these students belong more accurately than partitioning each time step individually or by partitioning the aggregated snapshots. Our method also detects drastic discontinuities in interaction patterns across network snapshots. Finally, we present comparative results with similar community detection methods for time-dependent networks from the literature. Overall, we illustrate the applicability of mathematical programming as a flexible, adaptable and systematic approach for these community detection problems. Contribution to the Topical Issue "Temporal Network Theory and Applications", edited by Petter Holme.

A network approach to leadership

DEFF Research Database (Denmark)

Lewis, Jenny; Ricard, Lykke Margot

Leaders’ ego-networks within an organization are pivotal as focal points that point to other organizational factors such as innovation capacity and leadership effectiveness. The aim of the paper is to provide a framework for exploring leaders’ ego-networks within the boundary of an organization. We...... a survey of senior administrators and politicians from Copenhagen municipality, we examine strategic information networks. Whole network analysis is used first to identify important individuals on the basis of centrality measures. The ego-networks of these individuals are then analysed to examine...

Multiplex visibility graphs to investigate recurrent neural network dynamics

Science.gov (United States)

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

2017-03-01

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

Designing synthetic networks in silico: a generalised evolutionary algorithm approach.

Science.gov (United States)

Smith, Robert W; van Sluijs, Bob; Fleck, Christian

2017-12-02

Evolution has led to the development of biological networks that are shaped by environmental signals. Elucidating, understanding and then reconstructing important network motifs is one of the principal aims of Systems & Synthetic Biology. Consequently, previous research has focused on finding optimal network structures and reaction rates that respond to pulses or produce stable oscillations. In this work we present a generalised in silico evolutionary algorithm that simultaneously finds network structures and reaction rates (genotypes) that can satisfy multiple defined objectives (phenotypes). The key step to our approach is to translate a schema/binary-based description of biological networks into systems of ordinary differential equations (ODEs). The ODEs can then be solved numerically to provide dynamic information about an evolved networks functionality. Initially we benchmark algorithm performance by finding optimal networks that can recapitulate concentration time-series data and perform parameter optimisation on oscillatory dynamics of the Repressilator. We go on to show the utility of our algorithm by finding new designs for robust synthetic oscillators, and by performing multi-objective optimisation to find a set of oscillators and feed-forward loops that are optimal at balancing different system properties. In sum, our results not only confirm and build on previous observations but we also provide new designs of synthetic oscillators for experimental construction. In this work we have presented and tested an evolutionary algorithm that can design a biological network to produce desired output. Given that previous designs of synthetic networks have been limited to subregions of network- and parameter-space, the use of our evolutionary optimisation algorithm will enable Synthetic Biologists to construct new systems with the potential to display a wider range of complex responses.

Inter-organisational communication networks in healthcare: centralised versus decentralised approaches.

Science.gov (United States)

Pirnejad, Habibollah; Bal, Roland; Stoop, Arjen P; Berg, Marc

2007-05-16

To afford efficient and high quality care, healthcare providers increasingly need to exchange patient data. The existence of a communication network amongst care providers will help them to exchange patient data more efficiently. Information and communication technology (ICT) has much potential to facilitate the development of such a communication network. Moreover, in order to offer integrated care interoperability of healthcare organizations based upon the exchanged data is of crucial importance. However, complications around such a development are beyond technical impediments. To determine the challenges and complexities involved in building an Inter-organisational Communication network (IOCN) in healthcare and the appropriations in the strategies. Interviews, literature review, and document analysis were conducted to analyse the developments that have taken place toward building a countrywide electronic patient record and its challenges in The Netherlands. Due to the interrelated nature of technical and non-technical problems, a socio-technical approach was used to analyse the data and define the challenges. Organisational and cultural changes are necessary before technical solutions can be applied. There are organisational, financial, political, and ethicolegal challenges that have to be addressed appropriately. Two different approaches, one "centralised" and the other "decentralised" have been used by Dutch healthcare providers to adopt the necessary changes and cope with these challenges. The best solutions in building an IOCN have to be drawn from both the centralised and the decentralised approaches. Local communication initiatives have to be supervised and supported centrally and incentives at the organisations' interest level have to be created to encourage the stakeholder organisations to adopt the necessary changes.

THE INCREASE OF ENTERPRISES’ INNOVATIVE DEVELOPMENT BASED ON THE NETWORK APPROACH

Directory of Open Access Journals (Sweden)

Olena Gudz

2018-01-01

Full Text Available The purpose of the paper is studying the role and problems of the innovative development of domestic enterprises, discovering the factors that influence these processes. Methodology. The methodology for the study was based on logical and historical methods, methods of the system-functional approach, methods of scientific abstraction, systematization, grouping, generalization and formalization, analysis and synthesis, economic and statistical methods, and method of questioning and peer review. Results. It is studied the essence and substantiated the expediency of the network approach use, it is outlined its capabilities and limitations, determined the effectiveness of network innovation structures, and developed the proposals for activating the innovative development of enterprises in new dimensions of the economic space based on the network approach. Practical implications. The proposed measures will promote the activation of innovative development for domestic enterprises, improve the quality of business chains, competitiveness and management structures, and provide the development of new market segments. Value/originality. The information background for the paper was the official data of the State Statistics Service of Ukraine, statistical and financial statements of enterprises, rating estimates by the international agency Bloomberg Rankings, analytical report “Global Innovation Index” (World Intellectual Property Organization, WIPO, the report of the European Innovation Scoreboard, scientific publications of domestic and foreign researchers, normative reference literature, analytical and logical generalizations and observations of authors, Internet information resources.

Bayesian approach for the reliability assessment of corroded interdependent pipe networks

International Nuclear Information System (INIS)

Ait Mokhtar, El Hassene; Chateauneuf, Alaa; Laggoune, Radouane

2016-01-01

Pipelines under corrosion are subject to various environment conditions, and consequently it becomes difficult to build realistic corrosion models. In the present work, a Bayesian methodology is proposed to allow for updating the corrosion model parameters according to the evolution of environmental conditions. For reliability assessment of dependent structures, Bayesian networks are used to provide interesting qualitative and quantitative description of the information in the system. The qualitative contribution lies in the modeling of complex system, composed by dependent pipelines, as a Bayesian network. The quantitative one lies in the evaluation of the dependencies between pipelines by the use of a new method for the generation of conditional probability tables. The effectiveness of Bayesian updating is illustrated through an application where the new reliability of degraded (corroded) pipe networks is assessed. - Highlights: • A methodology for Bayesian network modeling of pipe networks is proposed. • Bayesian approach based on Metropolis - Hastings algorithm is conducted for corrosion model updating. • The reliability of corroded pipe network is assessed by considering the interdependencies between the pipelines.

Using Call Detail Records for Modeling Coastal Recreation Behavior

Science.gov (United States)

Call data records (CDR) are data from cellular phone networks that can be used to understand human mobility or where people go spatially. They can be used to estimate visitation to an area such as a coastal access point for a given time window, as well as provide information on t...

FEM-based neural-network approach to nonlinear modeling with application to longitudinal vehicle dynamics control.

Science.gov (United States)

Kalkkuhl, J; Hunt, K J; Fritz, H

1999-01-01

An finite-element methods (FEM)-based neural-network approach to Nonlinear AutoRegressive with eXogenous input (NARX) modeling is presented. The method uses multilinear interpolation functions on C0 rectangular elements. The local and global structure of the resulting model is analyzed. It is shown that the model can be interpreted both as a local model network and a single layer feedforward neural network. The main aim is to use the model for nonlinear control design. The proposed FEM NARX description is easily accessible to feedback linearizing control techniques. Its use with a two-degrees of freedom nonlinear internal model controller is discussed. The approach is applied to modeling of the nonlinear longitudinal dynamics of an experimental lorry, using measured data. The modeling results are compared with local model network and multilayer perceptron approaches. A nonlinear speed controller was designed based on the identified FEM model. The controller was implemented in a test vehicle, and several experimental results are presented.

A Multimetric Approach for Handoff Decision in Heterogeneous Wireless Networks

Science.gov (United States)

Kustiawan, I.; Purnama, W.

2018-02-01

Seamless mobility and service continuity anywhere at any time are an important issue in the wireless Internet. This research proposes a scheme to make handoff decisions effectively in heterogeneous wireless networks using a fuzzy system. Our design lies in an inference engine which takes RSS (received signal strength), data rate, network latency, and user preference as strategic determinants. The logic of our engine is realized on a UE (user equipment) side in faster reaction to network dynamics while roaming across different radio access technologies. The fuzzy system handles four metrics jointly to deduce a moderate decision about when to initiate handoff. The performance of our design is evaluated by simulating move-out mobility scenarios. Simulation results show that our scheme outperforms other approaches in terms of reducing unnecessary handoff.

An approach to the interpretation of backpropagation neural network models in QSAR studies.

Science.gov (United States)

Baskin, I I; Ait, A O; Halberstam, N M; Palyulin, V A; Zefirov, N S

2002-03-01

An approach to the interpretation of backpropagation neural network models for quantitative structure-activity and structure-property relationships (QSAR/QSPR) studies is proposed. The method is based on analyzing the first and second moments of distribution of the values of the first and the second partial derivatives of neural network outputs with respect to inputs calculated at data points. The use of such statistics makes it possible not only to obtain actually the same characteristics as for the case of traditional "interpretable" statistical methods, such as the linear regression analysis, but also to reveal important additional information regarding the non-linear character of QSAR/QSPR relationships. The approach is illustrated by an example of interpreting a backpropagation neural network model for predicting position of the long-wave absorption band of cyane dyes.

A Regularizer Approach for RBF Networks Under the Concurrent Weight Failure Situation.

Science.gov (United States)

Leung, Chi-Sing; Wan, Wai Yan; Feng, Ruibin

2017-06-01

Many existing results on fault-tolerant algorithms focus on the single fault source situation, where a trained network is affected by one kind of weight failure. In fact, a trained network may be affected by multiple kinds of weight failure. This paper first studies how the open weight fault and the multiplicative weight noise degrade the performance of radial basis function (RBF) networks. Afterward, we define the objective function for training fault-tolerant RBF networks. Based on the objective function, we then develop two learning algorithms, one batch mode and one online mode. Besides, the convergent conditions of our online algorithm are investigated. Finally, we develop a formula to estimate the test set error of faulty networks trained from our approach. This formula helps us to optimize some tuning parameters, such as RBF width.

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.

Analysis of a large-scale weighted network of one-to-one human communication

International Nuclear Information System (INIS)

Onnela, Jukka-Pekka; Saramaeki, Jari; Hyvoenen, Joerkki; Szabo, Gabor; Menezes, M Argollo de; Kaski, Kimmo; Barabasi, Albert-Laszlo; Kertesz, Janos

2007-01-01

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks

Analysis of a large-scale weighted network of one-to-one human communication

Science.gov (United States)

Onnela, Jukka-Pekka; Saramäki, Jari; Hyvönen, Jörkki; Szabó, Gábor; Argollo de Menezes, M.; Kaski, Kimmo; Barabási, Albert-László; Kertész, János

2007-06-01

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

Analysis of a large-scale weighted network of one-to-one human communication

Energy Technology Data Exchange (ETDEWEB)

Onnela, Jukka-Pekka [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Saramaeki, Jari [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Hyvoenen, Joerkki [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Szabo, Gabor [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Menezes, M Argollo de [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Kaski, Kimmo [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Barabasi, Albert-Laszlo [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Kertesz, Janos [Laboratory of Computational Engineering, Helsinki University of Technology (Finland)

2007-06-15

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

Distress Calls of a Fast-Flying Bat (Molossus molossus Provoke Inspection Flights but Not Cooperative Mobbing.

Directory of Open Access Journals (Sweden)

Gerald Carter

Full Text Available Many birds and mammals produce distress calls when captured. Bats often approach speakers playing conspecific distress calls, which has led to the hypothesis that bat distress calls promote cooperative mobbing. An alternative explanation is that approaching bats are selfishly assessing predation risk. Previous playback studies on bat distress calls involved species with highly maneuverable flight, capable of making close passes and tight circles around speakers, which can look like mobbing. We broadcast distress calls recorded from the velvety free-tailed bat, Molossus molossus, a fast-flying aerial-hawker with relatively poor maneuverability. Based on their flight behavior, we predicted that, in response to distress call playbacks, M. molossus would make individual passing inspection flights but would not approach in groups or approach within a meter of the distress call source. By recording responses via ultrasonic recording and infrared video, we found that M. molossus, and to a lesser extent Saccopteryx bilineata, made more flight passes during distress call playbacks compared to noise. However, only the more maneuverable S. bilineata made close approaches to the speaker, and we found no evidence of mobbing in groups. Instead, our findings are consistent with the hypothesis that single bats approached distress calls simply to investigate the situation. These results suggest that approaches by bats to distress calls should not suffice as clear evidence for mobbing.

Distress Calls of a Fast-Flying Bat (Molossus molossus) Provoke Inspection Flights but Not Cooperative Mobbing

Science.gov (United States)

Carter, Gerald; Schoeppler, Diana; Manthey, Marie; Knörnschild, Mirjam; Denzinger, Annette

2015-01-01

Many birds and mammals produce distress calls when captured. Bats often approach speakers playing conspecific distress calls, which has led to the hypothesis that bat distress calls promote cooperative mobbing. An alternative explanation is that approaching bats are selfishly assessing predation risk. Previous playback studies on bat distress calls involved species with highly maneuverable flight, capable of making close passes and tight circles around speakers, which can look like mobbing. We broadcast distress calls recorded from the velvety free-tailed bat, Molossus molossus, a fast-flying aerial-hawker with relatively poor maneuverability. Based on their flight behavior, we predicted that, in response to distress call playbacks, M. molossus would make individual passing inspection flights but would not approach in groups or approach within a meter of the distress call source. By recording responses via ultrasonic recording and infrared video, we found that M. molossus, and to a lesser extent Saccopteryx bilineata, made more flight passes during distress call playbacks compared to noise. However, only the more maneuverable S. bilineata made close approaches to the speaker, and we found no evidence of mobbing in groups. Instead, our findings are consistent with the hypothesis that single bats approached distress calls simply to investigate the situation. These results suggest that approaches by bats to distress calls should not suffice as clear evidence for mobbing. PMID:26353118

Distress Calls of a Fast-Flying Bat (Molossus molossus) Provoke Inspection Flights but Not Cooperative Mobbing.

Science.gov (United States)

Carter, Gerald; Schoeppler, Diana; Manthey, Marie; Knörnschild, Mirjam; Denzinger, Annette

2015-01-01

Many birds and mammals produce distress calls when captured. Bats often approach speakers playing conspecific distress calls, which has led to the hypothesis that bat distress calls promote cooperative mobbing. An alternative explanation is that approaching bats are selfishly assessing predation risk. Previous playback studies on bat distress calls involved species with highly maneuverable flight, capable of making close passes and tight circles around speakers, which can look like mobbing. We broadcast distress calls recorded from the velvety free-tailed bat, Molossus molossus, a fast-flying aerial-hawker with relatively poor maneuverability. Based on their flight behavior, we predicted that, in response to distress call playbacks, M. molossus would make individual passing inspection flights but would not approach in groups or approach within a meter of the distress call source. By recording responses via ultrasonic recording and infrared video, we found that M. molossus, and to a lesser extent Saccopteryx bilineata, made more flight passes during distress call playbacks compared to noise. However, only the more maneuverable S. bilineata made close approaches to the speaker, and we found no evidence of mobbing in groups. Instead, our findings are consistent with the hypothesis that single bats approached distress calls simply to investigate the situation. These results suggest that approaches by bats to distress calls should not suffice as clear evidence for mobbing.

A Collaborative Approach for Monitoring Nodes Behavior during Spectrum Sensing to Mitigate Multiple Attacks in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Mahmoud Khasawneh

2017-01-01

Full Text Available Spectrum sensing is the first step to overcome the spectrum scarcity problem in Cognitive Radio Networks (CRNs wherein all unutilized subbands in the radio environment are explored for better spectrum utilization. Adversary nodes can threaten these spectrum sensing results by launching passive and active attacks that prevent legitimate nodes from using the spectrum efficiently. Securing the spectrum sensing process has become an important issue in CRNs in order to ensure reliable and secure spectrum sensing and fair management of resources. In this paper, a novel collaborative approach during spectrum sensing process is proposed. It monitors the behavior of sensing nodes and identifies the malicious and misbehaving sensing nodes. The proposed approach measures the node’s sensing reliability using a value called belief level. All the sensing nodes are grouped into a specific number of clusters. In each cluster, a sensing node is selected as a cluster head that is responsible for collecting sensing-reputation reports from different cognitive nodes about each node in the same cluster. The cluster head analyzes information to monitor and judge the nodes’ behavior. By simulating the proposed approach, we showed its importance and its efficiency for achieving better spectrum security by mitigating multiple passive and active attacks.

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

The SF3M approach to 3-D photo-reconstruction for non-expert users: application to a gully network

Science.gov (United States)

Castillo, C.; James, M. R.; Redel-Macías, M. D.; Pérez, R.; Gómez, J. A.

2015-04-01

3-D photo-reconstruction (PR) techniques have been successfully used to produce high resolution elevation models for different applications and over different spatial scales. However, innovative approaches are required to overcome some limitations that this technique may present in challenging scenarios. Here, we evaluate SF3M, a new graphical user interface for implementing a complete PR workflow based on freely available software (including external calls to VisualSFM and CloudCompare), in combination with a low-cost survey design for the reconstruction of a several-hundred-meters-long gully network. SF3M provided a semi-automated workflow for 3-D reconstruction requiring ~ 49 h (of which only 17% required operator assistance) for obtaining a final gully network model of > 17 million points over a gully plan area of 4230 m2. We show that a walking itinerary along the gully perimeter using two light-weight automatic cameras (1 s time-lapse mode) and a 6 m-long pole is an efficient method for 3-D monitoring of gullies, at a low cost (about EUR 1000 budget for the field equipment) and time requirements (~ 90 min for image collection). A mean error of 6.9 cm at the ground control points was found, mainly due to model deformations derived from the linear geometry of the gully and residual errors in camera calibration. The straightforward image collection and processing approach can be of great benefit for non-expert users working on gully erosion assessment.

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

Directory of Open Access Journals (Sweden)

A.R. Touzene

2014-12-01

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

A Probability-based Evolutionary Algorithm with Mutations to Learn Bayesian Networks

Directory of Open Access Journals (Sweden)

Sho Fukuda

2014-12-01

Full Text Available Bayesian networks are regarded as one of the essential tools to analyze causal relationship between events from data. To learn the structure of highly-reliable Bayesian networks from data as quickly as possible is one of the important problems that several studies have been tried to achieve. In recent years, probability-based evolutionary algorithms have been proposed as a new efficient approach to learn Bayesian networks. In this paper, we target on one of the probability-based evolutionary algorithms called PBIL (Probability-Based Incremental Learning, and propose a new mutation operator. Through performance evaluation, we found that the proposed mutation operator has a good performance in learning Bayesian networks

A cloud-based data network approach for translational cancer research.

Science.gov (United States)

Xing, Wei; Tsoumakos, Dimitrios; Ghanem, Moustafa

2015-01-01

We develop a new model and associated technology for constructing and managing self-organizing data to support translational cancer research studies. We employ a semantic content network approach to address the challenges of managing cancer research data. Such data is heterogeneous, large, decentralized, growing and continually being updated. Moreover, the data originates from different information sources that may be partially overlapping, creating redundancies as well as contradictions and inconsistencies. Building on the advantages of elasticity of cloud computing, we deploy the cancer data networks on top of the CELAR Cloud platform to enable more effective processing and analysis of Big cancer data.

Network Science for Deterrence: Sheathing the Sword of the Terrorism/Nuclear Horseman

Science.gov (United States)

Carley, Kathleen

2010-03-01

After 9/11, network analysis became popular as a way to connect and disconnect the dots. It was heralded as the new science with intrinsic value for understanding and breaking up terrorist groups, insurgencies and hostile foreign governments. The limit of the initially forwarded approach was that it focused on only the social network -- who talked to whom. However ,the networks of war, terror or nuclear or cyber, are complex networks composed of people, organizations, resources, and capabilities connected in a geo-temporal web that constrains and enables activities that are ``hidden'' in the web of everyday life. Identifying these networks requires extraction and fusion of information from cyber-mediated realms resulting in a network map of the hostile groups and their relations to the populations in which they are embedded. These data are at best a sample, albeit a very large sample, replete with missing and incomplete data. Geo-temporal considerations in addition to information loss and error called into question the value of traditional network approaches. In this talk, a new approaches and associated technologies that integrate scientific advances in machine learning, network statistics, and the social and organizational science with traditional graph theoretic approaches to social networks are presented. Then, examples, of how these technologies can be used as part of a deterrence strategy are described. Examples related to terrorism and groups such as al-Qaida and Hamas, cyber and nuclear deterrence are described. By taking this meta-network approach, embracing the complexity and simultaneously examining not just one network, but the connections among networks, it is possible to identify emergent leaders, locate changes in activities, and forecast the potential impact of various interventions. Key challenges, such as data-streaming and deception, that need to be addressed scientifically are referenced.

Structure and organization of drug-target networks: insights from genomic approaches for drug discovery.

Science.gov (United States)

Janga, Sarath Chandra; Tzakos, Andreas

2009-12-01

Recent years have seen an explosion in the amount of "omics" data and the integration of several disciplines, which has influenced all areas of life sciences including that of drug discovery. Several lines of evidence now suggest that the traditional notion of "one drug-one protein" for one disease does not hold any more and that treatment for most complex diseases can best be attempted using polypharmacological approaches. In this review, we formalize the definition of a drug-target network by decomposing it into drug, target and disease spaces and provide an overview of our understanding in recent years about its structure and organizational principles. We discuss advances made in developing promiscuous drugs following the paradigm of polypharmacology and reveal their advantages over traditional drugs for targeting diseases such as cancer. We suggest that drug-target networks can be decomposed to be studied at a variety of levels and argue that such network-based approaches have important implications in understanding disease phenotypes and in accelerating drug discovery. We also discuss the potential and scope network pharmacology promises in harnessing the vast amount of data from high-throughput approaches for therapeutic advantage.

Airbnb: the future of networked hospitality businesses

Directory of Open Access Journals (Sweden)

Jeroen Oskam

2016-03-01

Full Text Available Purpose – Although networked hospitality businesses as Airbnb are a recent phenomenon, a rapid growth has made them a serious competitor for the hospitality industry with important consequences for tourism and for tourist destinations. The purpose of this paper is to analyse the nature of the phenomenon, its potential further development in the next five years and the impact this developments will have on tourism, on hotels and on city destinations. Design/methodology/approach – A literature study, combined with scenario workshops and a Delphi panel, were used to map current trends and uncertainties. With this input, future scenarios were elaborated using the Global Business Network (“scenario cross” method. Findings – Network platforms as Airbnb are often classified under something called the “Sharing Economy”, a denomination that obscures their true nature. Airbnb is a challenging innovation to which traditional hospitality will have to respond. Its impact has at the same time led to a call for regulatory policies. The definition of these policies and the evolution of tourism are variables that determine future scenarios. Attempts to ban the phenomenon mean a disincentive to innovation and protect oligopolistic markets; more receptive policies may have the desired results if tourism grows moderately but in booming destinations they may lead to a harmful commercialization. Originality/value – Until now, Airbnb has been described in conceptual studies about the so-called “Sharing economy”, or more recently in empirical studies about isolated effects of holiday rentals. This paper contextualizes the evolution of networked hospitality and seeks to synthesize the sum of its impacts, thus enabling businesses and local governments to define positions and strategies.

Wireless Sensor Networks Approach

Science.gov (United States)

Perotti, Jose M.

2003-01-01

This viewgraph presentation provides information on hardware and software configurations for a network architecture for sensors. The hardware configuration uses a central station and remote stations. The software configuration uses the 'lost station' software algorithm. The presentation profiles a couple current examples of this network architecture in use.

Social entrepreneurship and social networks

OpenAIRE

Dufays, Frédéric

2013-01-01

In this presentation, we argue that the sociology of social networks may provide interesting insights with regard to the emergence of social entrepreneurship both at micro and macro levels. There have already been several calls for research on social networks in the context of social entrepreneurship (Certo & Miller 2008; Gedajlovic, et al. 2013; Haugh 2007; Mair & Marti 2006; Short, et al. 2009). These calls often address the differences in structure and effects of social networks in a socia...

Network Coding to Enhance Standard Routing Protocols in Wireless Mesh Networks

DEFF Research Database (Denmark)

Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank

2013-01-01

This paper introduces a design and simulation of a locally optimized network coding protocol, called PlayNCool, for wireless mesh networks. PlayN-Cool is easy to implement and compatible with existing routing protocols and devices. This allows the system to gain from network coding capabilities i...

THE NETWORKS IN TOURISM: A THEORETICAL APPROACH

Directory of Open Access Journals (Sweden)

Maria TĂTĂRUȘANU

2016-12-01

Full Text Available The economic world in which tourism companies act today is in a continuous changing process. The most important factor of these changes is the globalization of their environment, both in economic, social, natural and cultural aspects. The tourism companies can benefit from the opportunities brought by globalization, but also could be menaced by the new context. How could react the companies to these changes in order to create and maintain long term competitive advantage for their business? In the present paper we make a literature review of the new tourism companies´ business approach: the networks - a result and/or a reason for exploiting the opportunities or, on the contrary, for keeping their actual position on the market. It’s a qualitative approach and the research methods used are analyses, synthesis, abstraction, which are considered the most appropriate to achieve the objective of the paper.

Identifying the optimal supply temperature in district heating networks - A modelling approach

DEFF Research Database (Denmark)

Mohammadi, Soma; Bojesen, Carsten

2014-01-01

of this study is to develop a model for thermo-hydraulic calculation of low temperature DH system. The modelling is performed with emphasis on transient heat transfer in pipe networks. The pseudo-dynamic approach is adopted to model the District Heating Network [DHN] behaviour which estimates the temperature...... dynamically while the flow and pressure are calculated on the basis of steady state conditions. The implicit finite element method is applied to simulate the transient temperature behaviour in the network. Pipe network heat losses, pressure drop in the network and return temperature to the plant...... are calculated in the developed model. The model will serve eventually as a basis to find out the optimal supply temperature in an existing DHN in later work. The modelling results are used as decision support for existing DHN; proposing possible modifications to operate at optimal supply temperature....

Computer Assisted Language Learning (CALL): Using Internet for Effective Language Learning

NARCIS (Netherlands)

Kremenska, Anelly

2006-01-01

Please, cite this publication as: Kremenska, A. (2006). Computer Assisted Language Learning (CALL): Using Internet for Effective Language Learning. Proceedings of International Workshop in Learning Networks for Lifelong Competence Development, TENCompetence Conference. March 30th-31st, Sofia,

Inter-organisational communication networks in healthcare: centralised versus decentralised approaches

Directory of Open Access Journals (Sweden)

Habibollah Pirnejad

2007-05-01

Full Text Available Background: To afford efficient and high quality care, healthcare providers increasingly need to exchange patient data. The existence of a communication network amongst care providers will help them to exchange patient data more efficiently. Information and communication technology (ICT has much potential to facilitate the development of such a communication network. Moreover, in order to offer integrated care interoperability of healthcare organizations based upon the exchanged data is of crucial importance. However, complications around such a development are beyond technical impediments. Objectives: To determine the challenges and complexities involved in building an Inter-organisational Communication network (IOCN in healthcare and the appropriations in the strategies. Case study: Interviews, literature review, and document analysis were conducted to analyse the developments that have taken place toward building a countrywide electronic patient record and its challenges in The Netherlands. Due to the interrelated nature of technical and non-technical problems, a socio-technical approach was used to analyse the data and define the challenges. Results: Organisational and cultural changes are necessary before technical solutions can be applied. There are organisational, financial, political, and ethicolegal challenges that have to be addressed appropriately. Two different approaches, one “centralised” and the other “decentralised” have been used by Dutch healthcare providers to adopt the necessary changes and cope with these challenges. Conclusion: The best solutions in building an IOCN have to be drawn from both the centralised and the decentralised approaches. Local communication initiatives have to be supervised and supported centrally and incentives at the organisations' interest level have to be created to encourage the stakeholder organisations to adopt the necessary changes.

Who's calling? Social networks and mobile phone use among motorcyclists.

Science.gov (United States)

De Gruyter, Chris; Truong, Long T; Nguyen, Hang T T

2017-06-01

Mobile phone use while riding a motorcycle poses a key safety risk, particularly among younger people who have been found to be more susceptible to distracted driving. While previous research has examined the influence of social networks on mobile phone use while driving a car, no research has explored this association in the context of motorcycle use. Using a survey of university students in Vietnam, this research explores the association between social networks and mobile phone use among motorcyclists and the links this has to reported crashes/falls. Results show that the majority of students are most likely to use a mobile phone to communicate with a friend while riding, either through talking (56.5%) or text messaging (62.0%). However, respondents who frequently talk to a girlfriend/boyfriend or spouse while riding were more likely to experience a crash/fall than those who frequently talk with others while riding (e.g. parent, brother/sister). In addition, those who frequently text message a friend while riding were more likely to experience a crash/fall than those who frequently text message others while riding. The results highlight a clear association between social networks and mobile phone use while riding a motorcycle. Developing a culture of societal norms, where mobile phone use while riding a motorcycle is considered socially unacceptable, will help to reduce the prevalence and ultimate crash risk associated with mobile phone use while riding. Copyright © 2017 Elsevier Ltd. All rights reserved.

Consensus-based methodology for detection communities in multilayered networks

Science.gov (United States)

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

2018-03-01

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

Prediction Approach of Critical Node Based on Multiple Attribute Decision Making for Opportunistic Sensor Networks

Directory of Open Access Journals (Sweden)

Qifan Chen

2016-01-01

Full Text Available Predicting critical nodes of Opportunistic Sensor Network (OSN can help us not only to improve network performance but also to decrease the cost in network maintenance. However, existing ways of predicting critical nodes in static network are not suitable for OSN. In this paper, the conceptions of critical nodes, region contribution, and cut-vertex in multiregion OSN are defined. We propose an approach to predict critical node for OSN, which is based on multiple attribute decision making (MADM. It takes RC to present the dependence of regions on Ferry nodes. TOPSIS algorithm is employed to find out Ferry node with maximum comprehensive contribution, which is a critical node. The experimental results show that, in different scenarios, this approach can predict the critical nodes of OSN better.

Organization of Multi-controller Interaction in Software Defined Networks

Directory of Open Access Journals (Sweden)

Sergey V. Morzhov

2018-01-01

Full Text Available Software Defined Networking (SDN is a promising paradigm for network management. It is a centralized network intelligence on a dedicated server, which runs network operating system, and is called SDN controller. It was assumed that such an architecture should have an improved network performance and monitoring. However, the centralized control architecture of the SDNs brings novel challenges to reliability, scalability, fault tolerance and interoperability. These problems are especially acute for large data center networks and can be solved by combining SDN controllers into clusters, called multi-controllers. Multi-controller architecture became very important for SDN-enabled networks nowadays. This paper gives a comprehensive overview of SDN multi-controller architectures. The authors review several most popular distributed controllers in order to indicate their strengths and weaknesses. They also investigate and classify approaches used. This paper explains in details the difference among various types of multi-controller architectures, the distribution method and the communication system. Furthermore, it provides already implemented architectures and some examples of architectures under consideration by describing their design, communication process, and performance results. In this paper, the authors show their own classification of multi-controllers and claim that, despite the existence of undeniable advantages, all reviewed controllers have serious drawbacks, which must be eliminated. These drawbacks hamper the development of multi-controllers and their widespread adoption in corporate networks. In the end, the authors conclude that now it is impossible to find a solution capable to solve all the tasks assigned to it adequately and fully. The article is published in the authors’ wording.

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

Science.gov (United States)

Bouchard, M

2001-01-01

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

Combined Simulated Annealing and Genetic Algorithm Approach to Bus Network Design

Science.gov (United States)

Liu, Li; Olszewski, Piotr; Goh, Pong-Chai

A new method - combined simulated annealing (SA) and genetic algorithm (GA) approach is proposed to solve the problem of bus route design and frequency setting for a given road network with fixed bus stop locations and fixed travel demand. The method involves two steps: a set of candidate routes is generated first and then the best subset of these routes is selected by the combined SA and GA procedure. SA is the main process to search for a better solution to minimize the total system cost, comprising user and operator costs. GA is used as a sub-process to generate new solutions. Bus demand assignment on two alternative paths is performed at the solution evaluation stage. The method was implemented on four theoretical grid networks of different size and a benchmark network. Several GA operators (crossover and mutation) were utilized and tested for their effectiveness. The results show that the proposed method can efficiently converge to the optimal solution on a small network but computation time increases significantly with network size. The method can also be used for other transport operation management problems.

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.

A network pharmacology approach to investigate the pharmacological effects of Guizhi Fuling Wan on uterine fibroids.

Science.gov (United States)

Zeng, Liuting; Yang, Kailin; Liu, Huiping; Zhang, Guomin

2017-11-01

To investigate the pharmacological mechanism of Guizhi Fuling Wan (GFW) in the treatment of uterine fibroids, a network pharmacology approach was used. Information on GFW compounds was collected from traditional Chinese medicine (TCM) databases, and input into PharmMapper to identify the compound targets. Genes associated with uterine fibroids genes were then obtained from the GeneCards and Online Mendelian Inheritance in Man databases. The interaction data of the targets and other human proteins was also collected from the STRING and IntAct databases. The target data were input into the Database for Annotation, Visualization and Integrated Discovery for gene ontology (GO) and pathway enrichment analyses. Networks of the above information were constructed and analyzed using Cytoscape. The following networks were compiled: A compound-compound target network of GFW; a herb-compound target-uterine fibroids target network of GWF; and a compound target-uterine fibroids target-other human proteins protein-protein interaction network, which were subjected to GO and pathway enrichment analyses. According to this approach, a number of novel signaling pathways and biological processes underlying the effects of GFW on uterine fibroids were identified, including the negative regulation of smooth muscle cell proliferation, apoptosis, and the Ras, wingless-type, epidermal growth factor and insulin-like growth factor-1 signaling pathways. This network pharmacology approach may aid the systematical study of herbal formulae and make TCM drug discovery more predictable.

Facilitating Attuned Interactions: Using the FAN Approach to Family Engagement

Science.gov (United States)

Gilkerson, Linda

2015-01-01

Erikson Institute's Fussy Baby Network® (FBN) is a national model prevention program known for its approach to family engagement called the FAN (Gilkerson & Gray, 2014; Gilkerson et al., 2012). The FAN is both a conceptual framework and a practical tool to facilitate attunement in helping relationships and promote reflective practice. This…

A distributed predictive control approach for periodic flow-based networks: application to drinking water systems

Science.gov (United States)

Grosso, Juan M.; Ocampo-Martinez, Carlos; Puig, Vicenç

2017-10-01

This paper proposes a distributed model predictive control approach designed to work in a cooperative manner for controlling flow-based networks showing periodic behaviours. Under this distributed approach, local controllers cooperate in order to enhance the performance of the whole flow network avoiding the use of a coordination layer. Alternatively, controllers use both the monolithic model of the network and the given global cost function to optimise the control inputs of the local controllers but taking into account the effect of their decisions over the remainder subsystems conforming the entire network. In this sense, a global (all-to-all) communication strategy is considered. Although the Pareto optimality cannot be reached due to the existence of non-sparse coupling constraints, the asymptotic convergence to a Nash equilibrium is guaranteed. The resultant strategy is tested and its effectiveness is shown when applied to a large-scale complex flow-based network: the Barcelona drinking water supply system.

Distributed Scheduling to Support a Call Centre: a Co-operative Multi-Agent Approach

NARCIS (Netherlands)

Brazier, F.M.; Jonker, C.M.; Jungen, F.J.; Treur, J.; Nwana, H.S.

1998-01-01

This paper describes a multi-agent system architecture to increase the value of 24 hour a day call centre service. This system supports call centres in making appointments with clients on the basis of knowledge of employees and their schedules. Relevant activities of employees are scheduled for

Analysis and control of Boolean networks a semi-tensor product approach

CERN Document Server

Cheng, Daizhan; Li, Zhiqiang

2010-01-01

This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.

Applying a social network analysis (SNA) approach to understanding radiologists' performance in reading mammograms

Science.gov (United States)

Tavakoli Taba, Seyedamir; Hossain, Liaquat; Heard, Robert; Brennan, Patrick; Lee, Warwick; Lewis, Sarah

2017-03-01

Rationale and objectives: Observer performance has been widely studied through examining the characteristics of individuals. Applying a systems perspective, while understanding of the system's output, requires a study of the interactions between observers. This research explains a mixed methods approach to applying a social network analysis (SNA), together with a more traditional approach of examining personal/ individual characteristics in understanding observer performance in mammography. Materials and Methods: Using social networks theories and measures in order to understand observer performance, we designed a social networks survey instrument for collecting personal and network data about observers involved in mammography performance studies. We present the results of a study by our group where 31 Australian breast radiologists originally reviewed 60 mammographic cases (comprising of 20 abnormal and 40 normal cases) and then completed an online questionnaire about their social networks and personal characteristics. A jackknife free response operating characteristic (JAFROC) method was used to measure performance of radiologists. JAFROC was tested against various personal and network measures to verify the theoretical model. Results: The results from this study suggest a strong association between social networks and observer performance for Australian radiologists. Network factors accounted for 48% of variance in observer performance, in comparison to 15.5% for the personal characteristics for this study group. Conclusion: This study suggest a strong new direction for research into improving observer performance. Future studies in observer performance should consider social networks' influence as part of their research paradigm, with equal or greater vigour than traditional constructs of personal characteristics.

A network dynamics approach to chemical reaction networks

Science.gov (United States)

van der Schaft, A. J.; Rao, S.; Jayawardhana, B.

2016-04-01

A treatment of a chemical reaction network theory is given from the perspective of nonlinear network dynamics, in particular of consensus dynamics. By starting from the complex-balanced assumption, the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a very simple derivation of a number of key results in the chemical reaction network theory, and which directly relates to the thermodynamics and port-Hamiltonian formulation of the system. Central in this formulation is the definition of a balanced Laplacian matrix on the graph of chemical complexes together with a resulting fundamental inequality. This immediately leads to the characterisation of the set of equilibria and their stability. Furthermore, the assumption of complex balancedness is revisited from the point of view of Kirchhoff's matrix tree theorem. Both the form of the dynamics and the deduced behaviour are very similar to consensus dynamics, and provide additional perspectives to the latter. Finally, using the classical idea of extending the graph of chemical complexes by a 'zero' complex, a complete steady-state stability analysis of mass action kinetics reaction networks with constant inflows and mass action kinetics outflows is given, and a unified framework is provided for structure-preserving model reduction of this important class of open reaction networks.

An Approach for Designing and Implementing Middleware in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Ronald Beaubrun

2012-03-01

Full Text Available In this paper, we propose an approach for designing and implementing a middleware for data dissemination in Wireless Sensor Networks (WSNs. The designing aspect considers three perspectives: device, network and application. Each application layer is implemented as an independent Component Object Model (COM Project which offers portability, security, reusability and domain expertise encapsulation. For result analysis, the percentage of success is used as performance parameter. Such analysis reveals that the middleware enables to greatly increase the percentage of success of the messages disseminated in a WSN.

A network dynamics approach to chemical reaction networks

NARCIS (Netherlands)

van der Schaft, Abraham; Rao, S.; Jayawardhana, B.

2016-01-01

A treatment of chemical reaction network theory is given from the perspective of nonlinear network dynamics, in particular of consensus dynamics. By starting from the complex-balanced assumption the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a

Integrative analysis of many weighted co-expression networks using tensor computation.

Directory of Open Access Journals (Sweden)

Wenyuan Li

2011-06-01

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

Periodic oscillatory solution in delayed competitive-cooperative neural networks: A decomposition approach

International Nuclear Information System (INIS)

Yuan Kun; Cao Jinde

2006-01-01

In this paper, the problems of exponential convergence and the exponential stability of the periodic solution for a general class of non-autonomous competitive-cooperative neural networks are analyzed via the decomposition approach. The idea is to divide the connection weights into inhibitory or excitatory types and thereby to embed a competitive-cooperative delayed neural network into an augmented cooperative delay system through a symmetric transformation. Some simple necessary and sufficient conditions are derived to ensure the componentwise exponential convergence and the exponential stability of the periodic solution of the considered neural networks. These results generalize and improve the previous works, and they are easy to check and apply in practice

Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches

Directory of Open Access Journals (Sweden)

Omar M. Zakaria

2016-01-01

Full Text Available Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.

A Neural Network Approach to Fluid Quantity Measurement in Dynamic Environments

CERN Document Server

Terzic, Edin; Nagarajah, Romesh; Alamgir, Muhammad

2012-01-01

Sloshing causes liquid to fluctuate, making accurate level readings difficult to obtain in dynamic environments. The measurement system described uses a single-tube capacitive sensor to obtain an instantaneous level reading of the fluid surface, thereby accurately determining the fluid quantity in the presence of slosh. A neural network based classification technique has been applied to predict the actual quantity of the fluid contained in a tank under sloshing conditions.   In A neural network approach to fluid quantity measurement in dynamic environments, effects of temperature variations and contamination on the capacitive sensor are discussed, and the authors propose that these effects can also be eliminated with the proposed neural network based classification system. To examine the performance of the classification system, many field trials were carried out on a running vehicle at various tank volume levels that range from 5 L to 50 L. The effectiveness of signal enhancement on the neural network base...

A Self-Organizing Spatial Clustering Approach to Support Large-Scale Network RTK Systems.

Science.gov (United States)

Shen, Lili; Guo, Jiming; Wang, Lei

2018-06-06

The network real-time kinematic (RTK) technique can provide centimeter-level real time positioning solutions and play a key role in geo-spatial infrastructure. With ever-increasing popularity, network RTK systems will face issues in the support of large numbers of concurrent users. In the past, high-precision positioning services were oriented towards professionals and only supported a few concurrent users. Currently, precise positioning provides a spatial foundation for artificial intelligence (AI), and countless smart devices (autonomous cars, unmanned aerial-vehicles (UAVs), robotic equipment, etc.) require precise positioning services. Therefore, the development of approaches to support large-scale network RTK systems is urgent. In this study, we proposed a self-organizing spatial clustering (SOSC) approach which automatically clusters online users to reduce the computational load on the network RTK system server side. The experimental results indicate that both the SOSC algorithm and the grid algorithm can reduce the computational load efficiently, while the SOSC algorithm gives a more elastic and adaptive clustering solution with different datasets. The SOSC algorithm determines the cluster number and the mean distance to cluster center (MDTCC) according to the data set, while the grid approaches are all predefined. The side-effects of clustering algorithms on the user side are analyzed with real global navigation satellite system (GNSS) data sets. The experimental results indicate that 10 km can be safely used as the cluster radius threshold for the SOSC algorithm without significantly reducing the positioning precision and reliability on the user side.

Simulation and evaluation of urban rail transit network based on multi-agent approach

Directory of Open Access Journals (Sweden)

Xiangming Yao

2013-03-01

Full Text Available Purpose: Urban rail transit is a complex and dynamic system, which is difficult to be described in a global mathematical model for its scale and interaction. In order to analyze the spatial and temporal characteristics of passenger flow distribution and evaluate the effectiveness of transportation strategies, a new and comprehensive method depicted such dynamic system should be given. This study therefore aims at using simulation approach to solve this problem for subway network. Design/methodology/approach: In this thesis a simulation model based on multi-agent approach has been proposed, which is a well suited method to design complex systems. The model includes the specificities of passengers’ travelling behaviors and takes into account of interactions between travelers and trains. Findings: Research limitations/implications: We developed an urban rail transit simulation tool for verification of the validity and accuracy of this model, using real passenger flow data of Beijing subway network to take a case study, results show that our simulation tool can be used to analyze the characteristic of passenger flow distribution and evaluate operation strategies well. Practical implications: The main implications of this work are to provide decision support for traffic management, making train operation plan and dispatching measures in emergency. Originality/value: A new and comprehensive method to analyze and evaluate subway network is presented, accuracy and computational efficiency of the model has been confirmed and meet with the actual needs for large-scale network.