WorldWideScience

Sample records for structured p2p network

  1. Managing Network Partitions in Structured P2P Networks

    Science.gov (United States)

    Shafaat, Tallat M.; Ghodsi, Ali; Haridi, Seif

    Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Consequently, the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems. This makes it a crucial requirement for building any structured peer-to-peer systems to be resilient to network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. Structured overlays have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this chapter, we motivate the problem of network partitions and mergers in structured overlays. We discuss how a structured overlay can automatically detect a network partition and merger. We present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.

  2. A Measurement Study of the Structured Overlay Network in P2P File-Sharing Systems

    Directory of Open Access Journals (Sweden)

    Mo Zhou

    2007-01-01

    Full Text Available The architecture of P2P file-sharing applications has been developing to meet the needs of large scale demands. The structured overlay network, also known as DHT, has been used in these applications to improve the scalability, and robustness of the system, and to make it free from single-point failure. We believe that the measurement study of the overlay network used in the real file-sharing P2P systems can provide guidance for the designing of such systems, and improve the performance of the system. In this paper, we perform the measurement in two different aspects. First, a modified client is designed to provide view to the overlay network from a single-user vision. Second, the instances of crawler programs deployed in many nodes managed to crawl the user information of the overlay network as much as possible. We also find a vulnerability in the overlay network, combined with the character of the DNS service, a more serious DDoS attack can be launched.

  3. Network-Aware DHT-Based P2P Systems

    Science.gov (United States)

    Fayçal, Marguerite; Serhrouchni, Ahmed

    P2P networks lay over existing IP networks and infrastructure. This chapter investigates the relation between both layers, details the motivations for network awareness in P2P systems, and elucidates the requirements P2P systems have to meet for efficient network awareness. Since new P2P systems are mostly based on DHTs, we also present and analyse DHT-based architectures. And after a brief presentation of different existing network-awareness solutions, the chapter goes on effective cooperation between P2P traffic and network providers' business agreements, and introduces emerging DHT-based P2P systems that are network aware through a semantic defined for resource sharing. These new systems ensure also a certain context-awareness. So, they are analyzed and compared before an open end on prospects of network awareness in P2P systems.

  4. Cryptocurrency Networks: A New P2P Paradigm

    Directory of Open Access Journals (Sweden)

    Sergi Delgado-Segura

    2018-01-01

    Full Text Available P2P networks are the mechanism used by cryptocurrencies to disseminate system information while keeping the whole system as much decentralized as possible. Cryptocurrency P2P networks have new characteristics that propose new challenges and avoid some problems of existing P2P networks. By characterizing the most relevant cryptocurrency network, Bitcoin, we provide details on different properties of cryptocurrency networks and their similarities and differences with standard P2P network paradigms. Our study allows us to conclude that cryptocurrency networks present a new paradigm of P2P networks due to the mechanisms they use to achieve high resilience and security. With this new paradigm, interesting research lines can be further developed, both in the focused field of P2P cryptocurrency networks and also when such networks are combined with other distributed scenarios.

  5. Controlling P2P File-Sharing Networks Traffic

    OpenAIRE

    García Pineda, Miguel; HAMMOUMI, MOHAMMED; Canovas Solbes, Alejandro; Lloret, Jaime

    2011-01-01

    Since the appearance of Peer-To-Peer (P2P) file-sharing networks some time ago, many Internet users have chosen this technology to share and search programs, videos, music, documents, etc. The total number of P2P file-sharing users has been increasing and decreasing in the last decade depending on the creation or end of some well known P2P file-sharing systems. P2P file-sharing networks traffic is currently overloading some data networks and it is a major headache for netw...

  6. P2P Data Management in Mobile Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Nida Sahar Sayeda

    2013-04-01

    Full Text Available The rapid growth in wireless technologies has made wireless communication an important source for transporting data across different domains. In the same way, there are possibilities of many potential applications that can be deployed using WSNs (Wireless Sensor Networks. However, very limited applications are deployed in real life due to the uncertainty and dynamics of the environment and scare resources. This makes data management in WSN a challenging area to find an approach that suits its characteristics. Currently, the trend is to find efficient data management schemes using evolving technologies, i.e. P2P (Peer-to-Peer systems. Many P2P approaches have been applied in WSNs to carry out the data management due to similarities between WSN and P2P. With the similarities, there are differences too that makes P2P protocols inefficient in WSNs. Furthermore, to increase the efficiency and to exploit the delay tolerant nature of WSNs, where ever possible, the mobile WSNs are gaining importance. Thus, creating a three dimensional problem space to consider, i.e. mobility, WSNs and P2P. In this paper, an efficient algorithm is proposed for data management using P2P techniques for mobile WSNs. The real world implementation and deployment of proposed algorithm is also presented

  7. Detecting P2P Botnet in Software Defined Networks

    Directory of Open Access Journals (Sweden)

    Shang-Chiuan Su

    2018-01-01

    Full Text Available Software Defined Network separates the control plane from network equipment and has great advantage in network management as compared with traditional approaches. With this paradigm, the security issues persist to exist and could become even worse because of the flexibility on handling the packets. In this paper we propose an effective framework by integrating SDN and machine learning to detect and categorize P2P network traffics. This work provides experimental evidence showing that our approach can automatically analyze network traffic and flexibly change flow entries in OpenFlow switches through the SDN controller. This can effectively help the network administrators manage related security problems.

  8. Improved Degree Search Algorithms in Unstructured P2P Networks

    Directory of Open Access Journals (Sweden)

    Guole Liu

    2012-01-01

    Full Text Available Searching and retrieving the demanded correct information is one important problem in networks; especially, designing an efficient search algorithm is a key challenge in unstructured peer-to-peer (P2P networks. Breadth-first search (BFS and depth-first search (DFS are the current two typical search methods. BFS-based algorithms show the perfect performance in the aspect of search success rate of network resources, while bringing the huge search messages. On the contrary, DFS-based algorithms reduce the search message quantity and also cause the dropping of search success ratio. To address the problem that only one of performances is excellent, we propose two memory function degree search algorithms: memory function maximum degree algorithm (MD and memory function preference degree algorithm (PD. We study their performance including the search success rate and the search message quantity in different networks, which are scale-free networks, random graph networks, and small-world networks. Simulations show that the two performances are both excellent at the same time, and the performances are improved at least 10 times.

  9. P2P-based botnets: structural analysis, monitoring, and mitigation

    Energy Technology Data Exchange (ETDEWEB)

    Yan, Guanhua [Los Alamos National Laboratory; Eidenbenz, Stephan [Los Alamos National Laboratory; Ha, Duc T [UNIV AT BUFFALO; Ngo, Hung Q [UNIV AT BUFFALO

    2008-01-01

    Botnets, which are networks of compromised machines that are controlled by one or a group of attackers, have emerged as one of the most serious security threats on the Internet. With an army of bots at the scale of tens of thousands of hosts or even as large as 1.5 million PCs, the computational power of botnets can be leveraged to launch large-scale DDoS (Distributed Denial of Service) attacks, sending spamming emails, stealing identities and financial information, etc. As detection and mitigation techniques against botnets have been stepped up in recent years, attackers are also constantly improving their strategies to operate these botnets. The first generation of botnets typically employ IRC (Internet Relay Chat) channels as their command and control (C&C) centers. Though simple and easy to deploy, the centralized C&C mechanism of such botnets has made them prone to being detected and disabled. Against this backdrop, peer-to-peer (P2P) based botnets have emerged as a new generation of botnets which can conceal their C&C communication. Recently, P2P networks have emerged as a covert communication platform for malicious programs known as bots. As popular distributed systems, they allow bots to communicate easily while protecting the botmaster from being discovered. Existing work on P2P-based hotnets mainly focuses on measurement of botnet sizes. In this work, through simulation, we study extensively the structure of P2P networks running Kademlia, one of a few widely used P2P protocols in practice. Our simulation testbed incorporates the actual code of a real Kademlia client software to achieve great realism, and distributed event-driven simulation techniques to achieve high scalability. Using this testbed, we analyze the scaling, reachability, clustering, and centrality properties of P2P-based botnets from a graph-theoretical perspective. We further demonstrate experimentally and theoretically that monitoring bot activities in a P2P network is difficult

  10. P2P Network Lending, Loss Given Default and Credit Risks

    Directory of Open Access Journals (Sweden)

    Guangyou Zhou

    2018-03-01

    Full Text Available Peer-to-peer (P2P network lending is a new mode of internet finance that still holds credit risk as its main risk. According to the internal rating method of the New Basel Accord, in addition to the probability of default, loss given default is also one of the important indicators of evaluation credit risks. Proceeding from the perspective of loss given default (LGD, this paper conducts an empirical study on the probability distribution of LGDs of P2P as well as its influencing factors with the transaction data of Lending Club. The results show that: (1 the LGDs of P2P loans presents an obvious unimodal distribution, the peak value is relatively high and tends to concentrate with the decrease of the borrower’s credit rating, indicating that the distribution of LGDs of P2P lending is similar to that of unsecured bonds; (2 The total asset of the borrower has no significant impact on LGD, the credit rating and the debt-to-income ratio exert a significant negative impact, while the term and amount of the loan produce a relatively strong positive impact. Therefore, when evaluating the borrower’s repayment ability, it is required to pay more attention to its assets structure rather than the size of its total assets. When carrying out risk control for the P2P platform, it is necessary to give priority to the control of default rate.

  11. Streaming layered video over P2P networks

    NARCIS (Netherlands)

    Alhaisoni, M.; Ghanbari, M.; Liotta, A.

    2009-01-01

    Peer-to-Peer streaming has been increasingly deployed recently. This comes out from its ability to convey the stream over the IP network to a large number of end-users (or peers). However, due to the heterogeneous nature among the peers, some of them will not be capable to relay or upload the

  12. Distributing Workflows over a Ubiquitous P2P Network

    Directory of Open Access Journals (Sweden)

    Eddie Al-Shakarchi

    2007-01-01

    Full Text Available This paper discusses issues in the distribution of bundled workflows across ubiquitous peer-to-peer networks for the application of music information retrieval. The underlying motivation for this work is provided by the DART project, which aims to develop a novel music recommendation system by gathering statistical data using collaborative filtering techniques and the analysis of the audio itsel, in order to create a reliable and comprehensive database of the music that people own and which they listen to. To achieve this, the DART scientists creating the algorithms need the ability to distribute the Triana workflows they create, representing the analysis to be performed, across the network on a regular basis (perhaps even daily in order to update the network as a whole with new workflows to be executed for the analysis. DART uses a similar approach to BOINC but differs in that the workers receive input data in the form of a bundled Triana workflow, which is executed in order to process any MP3 files that they own on their machine. Once analysed, the results are returned to DART's distributed database that collects and aggregates the resulting information. DART employs the use of package repositories to decentralise the distribution of such workflow bundles and this approach is validated in this paper through simulations that show that suitable scalability is maintained through the system as the number of participants increases. The results clearly illustrate the effectiveness of the approach.

  13. Research of using mobile agents for information discovery in P2P networks

    International Nuclear Information System (INIS)

    Lan Yan; Yao Qing

    2003-01-01

    The technology of P2P is a new network-computing model that has great value of commerce and technology. After analyzing the current information discovery technology in P2P network, a new solution that is based on mobile agent is proposed. The mobile agent solution can reduce the need of bandwidth, be adapt to the dynamic of P2P network, and be asynchronous and be very fault tolerant. (authors)

  14. Multilevel Bloom Filters for P2P Flows Identification Based on Cluster Analysis in Wireless Mesh Network

    Directory of Open Access Journals (Sweden)

    Xia-an Bi

    2015-01-01

    Full Text Available With the development of wireless mesh networks and distributed computing, lots of new P2P services have been deployed and enrich the Internet contents and applications. The rapid growth of P2P flows brings great pressure to the regular network operation. So the effective flow identification and management of P2P applications become increasingly urgent. In this paper, we build a multilevel bloom filters data structure to identify the P2P flows through researches on the locality characteristics of P2P flows. Different level structure stores different numbers of P2P flow rules. According to the characteristics values of the P2P flows, we adjust the parameters of the data structure of bloom filters. The searching steps of the scheme traverse from the first level to the last level. Compared with the traditional algorithms, our method solves the drawbacks of previous schemes. The simulation results demonstrate that our algorithm effectively enhances the performance of P2P flows identification. Then we deploy our flow identification algorithm in the traffic monitoring sensors which belong to the network traffic monitoring system at the export link in the campus network. In the real environment, the experiment results demonstrate that our algorithm has a fast speed and high accuracy to identify the P2P flows; therefore, it is suitable for actual deployment.

  15. Fuzzy-rule-based Adaptive Resource Control for Information Sharing in P2P Networks

    Science.gov (United States)

    Wu, Zhengping; Wu, Hao

    With more and more peer-to-peer (P2P) technologies available for online collaboration and information sharing, people can launch more and more collaborative work in online social networks with friends, colleagues, and even strangers. Without face-to-face interactions, the question of who can be trusted and then share information with becomes a big concern of a user in these online social networks. This paper introduces an adaptive control service using fuzzy logic in preference definition for P2P information sharing control, and designs a novel decision-making mechanism using formal fuzzy rules and reasoning mechanisms adjusting P2P information sharing status following individual users' preferences. Applications of this adaptive control service into different information sharing environments show that this service can provide a convenient and accurate P2P information sharing control for individual users in P2P networks.

  16. A distributed incentive compatible pricing mechanism for P2P networks

    Science.gov (United States)

    Zhang, Jie; Zhao, Zheng; Xiong, Xiao; Shi, Qingwei

    2007-09-01

    Peer-to-Peer (P2P) systems are currently receiving considerable interest. However, as experience with P2P networks shows, the selfish behaviors of peers may lead to serious problems of P2P network, such as free-riding and white-washing. In order to solve these problems, there are increasing considerations on reputation system design in the study of P2P networks. Most of the existing works is concerning probabilistic estimation or social networks to evaluate the trustworthiness for a peer to others. However, these models can not be efficient all the time. In this paper, our aim is to provide a general mechanism that can maximize P2P networks social welfare in a way of Vickrey-Clarke-Groves family, while assuming every peer in P2P networks is rational and selfish, which means they only concern about their own outcome. This mechanism has some desirable properties using an O(n) algorithm: (1) incentive compatibility, every peer truly report its connection type; (2) individually rationality; and (3) fully decentralized, we design a multiple-principal multiple-agent model, concerning about the service provider and service requester individually.

  17. G-ROME : semantic-driven capacity sharing among P2P networks

    NARCIS (Netherlands)

    Exarchakos, G.; Antonopoulos, N.; Salter, J.

    2007-01-01

    Purpose – The purpose of this paper is to propose a model for sharing network capacity on demand among different underloaded and overloaded P2P ROME-enabled networks. The paper aims to target networks of nodes with highly dynamic workload fluctuations that may experience a burst of traffic and/or

  18. Folksonomical P2P File Sharing Networks Using Vectorized KANSEI Information as Search Tags

    Science.gov (United States)

    Ohnishi, Kei; Yoshida, Kaori; Oie, Yuji

    We present the concept of folksonomical peer-to-peer (P2P) file sharing networks that allow participants (peers) to freely assign structured search tags to files. These networks are similar to folksonomies in the present Web from the point of view that users assign search tags to information distributed over a network. As a concrete example, we consider an unstructured P2P network using vectorized Kansei (human sensitivity) information as structured search tags for file search. Vectorized Kansei information as search tags indicates what participants feel about their files and is assigned by the participant to each of their files. A search query also has the same form of search tags and indicates what participants want to feel about files that they will eventually obtain. A method that enables file search using vectorized Kansei information is the Kansei query-forwarding method, which probabilistically propagates a search query to peers that are likely to hold more files having search tags that are similar to the query. The similarity between the search query and the search tags is measured in terms of their dot product. The simulation experiments examine if the Kansei query-forwarding method can provide equal search performance for all peers in a network in which only the Kansei information and the tendency with respect to file collection are different among all of the peers. The simulation results show that the Kansei query forwarding method and a random-walk-based query forwarding method, for comparison, work effectively in different situations and are complementary. Furthermore, the Kansei query forwarding method is shown, through simulations, to be superior to or equal to the random-walk based one in terms of search speed.

  19. Strategies for P2P connectivity in reconfigurable converged wired/wireless access networks.

    Science.gov (United States)

    Puerto, Gustavo; Mora, José; Ortega, Beatriz; Capmany, José

    2010-12-06

    This paper presents different strategies to define the architecture of a Radio-Over-Fiber (RoF) Access networks enabling Peer-to-Peer (P2P) functionalities. The architectures fully exploit the flexibility of a wavelength router based on the feedback configuration of an Arrayed Waveguide Grating (AWG) and an optical switch to broadcast P2P services among diverse infrastructures featuring dynamic channel allocation and enabling an optical platform for 3G and beyond wireless backhaul requirements. The first architecture incorporates a tunable laser to generate a dedicated wavelength for P2P purposes and the second architecture takes advantage of reused wavelengths to enable the P2P connectivity among Optical Network Units (ONUs) or Base Stations (BS). While these two approaches allow the P2P connectivity in a one at a time basis (1:1), the third architecture enables the broadcasting of P2P sessions among different ONUs or BSs at the same time (1:M). Experimental assessment of the proposed architecture shows approximately 0.6% Error Vector Magnitude (EVM) degradation for wireless services and 1 dB penalty in average for 1 x 10(-12) Bit Error Rate (BER) for wired baseband services.

  20. Testing a Cloud Provider Network for Hybrid P2P and Cloud Streaming Architectures

    OpenAIRE

    Cerviño Arriba, Javier; Rodríguez, Pedro; Trajkovska, Irena; Mozo Velasco, Alberto; Salvachúa Rodríguez, Joaquín

    2011-01-01

    The number of online real-time streaming services deployed over network topologies like P2P or centralized ones has remarkably increased in the recent years. This has revealed the lack of networks that are well prepared to respond to this kind of traffic. A hybrid distribution network can be an efficient solution for real-time streaming services. This paper contains the experimental results of streaming distribution in a hybrid architecture that consist of mixed connections among P2P and Clou...

  1. SNMS: an intelligent transportation system network architecture based on WSN and P2P network

    Institute of Scientific and Technical Information of China (English)

    LI Li; LIU Yuan-an; TANG Bi-hua

    2007-01-01

    With the development of city road networks, the question of how to obtain information about the roads is becoming more and more important. In this article, sensor network with mobile station (SNMS), a novel two-tiered intelligent transportation system (ITS) network architecture based on wireless sensor network (WSN) and peer-to-peer (P2P) network, is proposed to provide significant traffic information about the road and thereby, assist travelers to take optimum decisions when they are driving. A detailed explanation with regard to the strategy of each level as well as the design of two main components in the network, sensor unit (SU) and mobile station (MS), is presented. Finally, a representative scenario is described to display the operation of the system.

  2. Data transport and management in P2P Data Management in Mobile Wireless Sensor Network

    International Nuclear Information System (INIS)

    Sahar, S.; Shaikh, F.K.

    2013-01-01

    The rapid growth in wireless technologies has made wireless communication an important source for transporting data across different domains. In the same way, there are possibilities of many potential applications that can be deployed using WSNs (Wireless Sensor Networks). However, very limited applications are deployed in real life due to the uncertainty and dynamics of the environment and scare resources. This makes data management in WSN a challenging area to find an approach that suits its characteristics. Currently, the trend is to find efficient data management schemes using evolving technologies, i.e. P2P (Peer-to-Peer) systems. Many P2P approaches have been applied in WSNs to carry out the data management due to similarities between WSN and P2P. With the similarities, there are differences too that makes P2P protocols inefficient in WSNs. Furthermore, to increase the efficiency and to exploit the delay tolerant nature of WSNs, where ever possible, the mobile WSNs are gaining importance. Thus, creating a three dimensional problem space to consider, i.e. mobility, WSNs and P2P. In this paper, an efficient algorithm is proposed for data management using P2P techniques for mobile WSNs. The real world implementation and deployment of proposed algorithm is also presented. (author)

  3. A Hybrid P2P Overlay Network for Non-strictly Hierarchically Categorized Content

    Science.gov (United States)

    Wan, Yi; Asaka, Takuya; Takahashi, Tatsuro

    In P2P content distribution systems, there are many cases in which the content can be classified into hierarchically organized categories. In this paper, we propose a hybrid overlay network design suitable for such content called Pastry/NSHCC (Pastry for Non-Strictly Hierarchically Categorized Content). The semantic information of classification hierarchies of the content can be utilized regardless of whether they are in a strict tree structure or not. By doing so, the search scope can be restrained to any granularity, and the number of query messages also decreases while maintaining keyword searching availability. Through simulation, we showed that the proposed method provides better performance and lower overhead than unstructured overlays exploiting the same semantic information.

  4. Scaling laws for file dissemination in P2P networks with random contacts

    NARCIS (Netherlands)

    Nunez-Queija, R.; Prabhu, B.

    2008-01-01

    In this paper we obtain the scaling law for the mean broadcast time of a file in a P2P network with an initial population of N nodes. In the model, at Poisson rate λ a node initiates a contact with another node chosen uniformly at random. This contact is said to be successful if the contacted node

  5. Scaling laws for file dissemination in P2P networks with random contacts

    NARCIS (Netherlands)

    Núñez-Queija, R.; Prabhu, B.

    2008-01-01

    In this paper we obtain the scaling law for the mean broadcast time of a file in a P2P network with an initial population of N nodes. In the model, at Poisson rate lambda a node initiates a contact with another node chosen uniformly at random. This contact is said to be successful if the contacted

  6. P2P Lending Risk Contagion Analysis Based on a Complex Network Model

    Directory of Open Access Journals (Sweden)

    Qi Wei

    2016-01-01

    Full Text Available This paper analyzes two major channels of P2P lending risk contagion in China—direct risk contagion between platforms and indirect risk contagion with other financial organizations as the contagion medium. Based on this analysis, the current study constructs a complex network model of P2P lending risk contagion in China and performs dynamics analogue simulations in order to analyze general characteristics of direct risk contagion among China’s online P2P lending platforms. The assumed conditions are that other financial organizations act as the contagion medium, with variations in the risk contagion characteristics set under the condition of significant information asymmetry in Internet lending. It is indicated that, compared to direct risk contagion among platforms, both financial organizations acting as the contagion medium and information asymmetry magnify the effect of risk contagion. It is also found that the superposition of media effects and information asymmetry is more likely to magnify the risk contagion effect.

  7. End-to-End Key Exchange through Disjoint Paths in P2P Networks

    Directory of Open Access Journals (Sweden)

    Daouda Ahmat

    2015-01-01

    Full Text Available Due to their inherent features, P2P networks have proven to be effective in the exchange of data between autonomous peers. Unfortunately, these networks are subject to various security threats that cannot be addressed readily since traditional security infrastructures, which are centralized, cannot be applied to them. Furthermore, communication reliability across the Internet is threatened by various attacks, including usurpation of identity, eavesdropping or traffic modification. Thus, in order to overcome these security issues and allow peers to securely exchange data, we propose a new key management scheme over P2P networks. Our approach introduces a new method that enables a secret key exchange through disjoint paths in the absence of a trusted central coordination point which would be required in traditional centralized security systems.

  8. ATLAAS-P2P: a two layer network solution for easing the resource discovery process in unstructured networks

    OpenAIRE

    Baraglia, Ranieri; Dazzi, Patrizio; Mordacchini, Matteo; Ricci, Laura

    2013-01-01

    ATLAAS-P2P is a two-layered P2P architecture for developing systems providing resource aggregation and approximated discovery in P2P networks. Such systems allow users to search the desired resources by specifying their requirements in a flexible and easy way. From the point of view of resource providers, this system makes available an effective solution supporting providers in being reached by resource requests.

  9. Minimizing Redundant Messages and Improving Search Efficiency under Highly Dynamic Mobile P2P Network

    Directory of Open Access Journals (Sweden)

    Ajay Arunachalam

    2016-02-01

    Full Text Available Resource Searching is one of the key functional tasks in large complex networks. With the P2P architecture, millions of peers connect together instantly building a communication pattern. Searching in mobile networks faces additional limitations and challenges. Flooding technique can cope up with the churn and searches aggressively by visiting almost all the nodes. But it exponentially increases the network traffic and thus does not scale well. Further the duplicated query messages consume extra battery power and network bandwidth. The blind flooding also suffers from long delay problem in P2P networks. In this paper, we propose optimal density based flooding resource discovery schemes. Our first model takes into account local graph topology information to supplement the resource discovery process while in our extended version we also consider the neighboring node topology information along with the local node information to further effectively use the mobile and network resources. Our proposed method reduces collision at the same time minimizes effect of redundant messages and failures. Overall the methods reduce network overhead, battery power consumption, query delay, routing load, MAC load and bandwidth usage while also achieving good success rate in comparison to the other techniques. We also perform a comprehensive analysis of the resource discovery schemes to verify the impact of varying node speed and different network conditions.

  10. A multi-state reliability evaluation model for P2P networks

    International Nuclear Information System (INIS)

    Fan Hehong; Sun Xiaohan

    2010-01-01

    The appearance of new service types and the convergence tendency of the communication networks have endowed the networks more and more P2P (peer to peer) properties. These networks can be more robust and tolerant for a series of non-perfect operational states due to the non-deterministic server-client distributions. Thus a reliability model taking into account of the multi-state and non-deterministic server-client distribution properties is needed for appropriate evaluation of the networks. In this paper, two new performance measures are defined to quantify the overall and local states of the networks. A new time-evolving state-transition Monte Carlo (TEST-MC) simulation model is presented for the reliability analysis of P2P networks in multiple states. The results show that the model is not only valid for estimating the traditional binary-state network reliability parameters, but also adequate for acquiring the parameters in a series of non-perfect operational states, with good efficiencies, especially for highly reliable networks. Furthermore, the model is versatile for the reliability and maintainability analyses in that both the links and the nodes can be failure-prone with arbitrary life distributions, and various maintainability schemes can be applied.

  11. Using of P2P Networks for Acceleration of RTE Tasks Solving

    Directory of Open Access Journals (Sweden)

    Adrian Iftene

    2008-07-01

    Full Text Available In the last years the computational Grids have become an important research area in large-scale scientific and engineering research. Our approach is based on Peer-to-peer (P2P networks, which are recognized as one of most used architectures in order to achieve scalability in key components of Grid systems. The main scope in using of a computational Grid was to improve the computational speed of systems that solve complex problems from Natural Language processing field. We will see how can be implemented a computational Grid using the P2P model, and how can be used SMB protocol for file transfer. After that we will see how we can use this computational Grid, in order to improve the computational speed of a system used in RTE competition [1], a new complex challenge from Natural Language processing field.

  12. WebVR——Web Virtual Reality Engine Based on P2P network

    OpenAIRE

    zhihan LV; Tengfei Yin; Yong Han; Yong Chen; Ge Chen

    2011-01-01

    WebVR, a multi-user online virtual reality engine, is introduced. The main contributions are mapping the geographical space and virtual space to the P2P overlay network space, and dividing the three spaces by quad-tree method. The geocoding is identified with Hash value, which is used to index the user list, terrain data, and the model object data. Sharing of data through improved Kademlia network model is designed and implemented. In this model, XOR algorithm is used to calculate the distanc...

  13. A P2P Botnet detection scheme based on decision tree and adaptive multilayer neural networks.

    Science.gov (United States)

    Alauthaman, Mohammad; Aslam, Nauman; Zhang, Li; Alasem, Rafe; Hossain, M A

    2018-01-01

    In recent years, Botnets have been adopted as a popular method to carry and spread many malicious codes on the Internet. These malicious codes pave the way to execute many fraudulent activities including spam mail, distributed denial-of-service attacks and click fraud. While many Botnets are set up using centralized communication architecture, the peer-to-peer (P2P) Botnets can adopt a decentralized architecture using an overlay network for exchanging command and control data making their detection even more difficult. This work presents a method of P2P Bot detection based on an adaptive multilayer feed-forward neural network in cooperation with decision trees. A classification and regression tree is applied as a feature selection technique to select relevant features. With these features, a multilayer feed-forward neural network training model is created using a resilient back-propagation learning algorithm. A comparison of feature set selection based on the decision tree, principal component analysis and the ReliefF algorithm indicated that the neural network model with features selection based on decision tree has a better identification accuracy along with lower rates of false positives. The usefulness of the proposed approach is demonstrated by conducting experiments on real network traffic datasets. In these experiments, an average detection rate of 99.08 % with false positive rate of 0.75 % was observed.

  14. Incentive Mechanism for P2P Content Sharing over Heterogenous Access Networks

    Science.gov (United States)

    Sato, Kenichiro; Hashimoto, Ryo; Yoshino, Makoto; Shinkuma, Ryoichi; Takahashi, Tatsuro

    In peer-to-peer (P2P) content sharing, users can share their content by contributing their own resources to one another. However, since there is no incentive for contributing contents or resources to others, users may attempt to obtain content without any contribution. To motivate users to contribute their resources to the service, incentive-rewarding mechanisms have been proposed. On the other hand, emerging wireless technologies, such as IEEE 802.11 wireless local area networks, beyond third generation (B3G) cellular networks and mobile WiMAX, provide high-speed Internet access for wireless users. Using these high-speed wireless access, wireless users can use P2P services and share their content with other wireless users and with fixed users. However, this diversification of access networks makes it difficult to appropriately assign rewards to each user according to their contributions. This is because the cost necessary for contribution is different in different access networks. In this paper, we propose a novel incentive-rewarding mechanism called EMOTIVER that can assign rewards to users appropriately. The proposed mechanism uses an external evaluator and interactive learning agents. We also investigate a way of appropriately controlling rewards based on the system service's quality and managing policy.

  15. Structured P2P overlay of mobile brokers for realizing publish/subscribe communication in VANET.

    Science.gov (United States)

    Pandey, Tulika; Garg, Deepak; Gore, Manoj Madhava

    2014-01-01

    Publish/subscribe communication paradigm provides asynchrony and decoupling, making it an elegant alternative for designing applications in distributed and dynamic environment such as vehicular ad hoc networks (VANETs). In this paradigm, the broker is the most important component that decouples other two components, namely, publisher and subscriber. Previous research efforts have either utilized the deployment of distributed brokers on stationary road side info-stations or have assigned the role of broker to any moving vehicle on ad hoc basis. In one approach, lots of preinstalled infrastructures are needed whereas, in another, the quality of service is not guaranteed due to unpredictable moving and stopping patterns of vehicles. In this paper, we present the architecture of distributed mobile brokers which are dynamically reconfigurable in the form of structured P2P overlay and act as rendezvous points for matching publications and subscriptions. We have taken city buses in urban settings to act as mobile brokers whereas other vehicles are considered to be in role of publishers and subscribers. These mobile brokers also assist in locating a vehicle for successful and timely transfer of notifications. We have performed an extensive simulation study to compare our approach with previously proposed approaches. Simulation results establish the applicability of our approach.

  16. Structured P2P Overlay of Mobile Brokers for Realizing Publish/Subscribe Communication in VANET

    Directory of Open Access Journals (Sweden)

    Tulika Pandey

    2014-01-01

    Full Text Available Publish/subscribe communication paradigm provides asynchrony and decoupling, making it an elegant alternative for designing applications in distributed and dynamic environment such as vehicular ad hoc networks (VANETs. In this paradigm, the broker is the most important component that decouples other two components, namely, publisher and subscriber. Previous research efforts have either utilized the deployment of distributed brokers on stationary road side info-stations or have assigned the role of broker to any moving vehicle on ad hoc basis. In one approach, lots of preinstalled infrastructures are needed whereas, in another, the quality of service is not guaranteed due to unpredictable moving and stopping patterns of vehicles. In this paper, we present the architecture of distributed mobile brokers which are dynamically reconfigurable in the form of structured P2P overlay and act as rendezvous points for matching publications and subscriptions. We have taken city buses in urban settings to act as mobile brokers whereas other vehicles are considered to be in role of publishers and subscribers. These mobile brokers also assist in locating a vehicle for successful and timely transfer of notifications. We have performed an extensive simulation study to compare our approach with previously proposed approaches. Simulation results establish the applicability of our approach.

  17. A P2P Query Algorithm for Opportunistic Networks Utilizing betweenness Centrality Forwarding

    Directory of Open Access Journals (Sweden)

    Jianwei Niu

    2013-01-01

    Full Text Available With the proliferation of high-end mobile devices that feature wireless interfaces, many promising applications are enabled in opportunistic networks. In contrary to traditional networks, opportunistic networks utilize the mobility of nodes to relay messages in a store-carry-forward paradigm. Thus, the relay process in opportunistic networks faces several practical challenges in terms of delay and delivery rate. In this paper, we propose a novel P2P Query algorithm, namely Betweenness Centrality Forwarding (PQBCF, for opportunistic networking. PQBCF adopts a forwarding metric called Betweenness Centrality (BC, which is borrowed from social network, to quantify the active degree of nodes in the networks. In PQBCF, nodes with a higher BC are preferable to serve as relays, leading to higher query success rate and lower query delay. A comparison with the state-of-the-art algorithms reveals that PQBCF can provide better performance on both the query success Ratio and query delay, and approaches the performance of Epidemic Routing (ER with much less resource consumption.

  18. Performance Evaluation of an Object Management Policy Approach for P2P Networks

    Directory of Open Access Journals (Sweden)

    Dario Vieira

    2012-01-01

    Full Text Available The increasing popularity of network-based multimedia applications poses many challenges for content providers to supply efficient and scalable services. Peer-to-peer (P2P systems have been shown to be a promising approach to provide large-scale video services over the Internet since, by nature, these systems show high scalability and robustness. In this paper, we propose and analyze an object management policy approach for video web cache in a P2P context, taking advantage of object's metadata, for example, video popularity, and object's encoding techniques, for example, scalable video coding (SVC. We carry out trace-driven simulations so as to evaluate the performance of our approach and compare it against traditional object management policy approaches. In addition, we study as well the impact of churn on our approach and on other object management policies that implement different caching strategies. A YouTube video collection which records over 1.6 million video's log was used in our experimental studies. The experiment results have showed that our proposed approach can improve the performance of the cache substantially. Moreover, we have found that neither the simply enlargement of peers' storage capacity nor a zero replicating strategy is effective actions to improve performance of an object management policy.

  19. Coalition-based multimedia peer matching strategies for P2P networks

    Science.gov (United States)

    Park, Hyunggon; van der Schaar, Mihaela

    2008-01-01

    In this paper, we consider the problem of matching users for multimedia transmission in peer-to-peer (P2P) networks and identify strategies for fair resource division among the matched multimedia peers. We propose a framework for coalition formation, which enables users to form a group of matched peers where they can interact cooperatively and negotiate resources based on their satisfaction with the coalition, determined by explicitly considering the peer's multimedia attributes. In addition, our proposed approach goes a step further by introducing the concept of marginal contribution, which is the value improvement of the coalition induced by an incoming peer. We show that the best way for a peer to select a coalition is to choose the coalition that provides the largest division of marginal contribution given a deployed value-division scheme. Moreover, we model the utility function by explicitly considering each peer's attributes as well as the cost for uploading content. To quantify the benefit that users derive from a coalition, we define the value of a coalition based on the total utility that all peers can achieve jointly in the coalition. Based on this definition of the coalition value, we use an axiomatic bargaining solution in order to fairly negotiate the value division of the upload bandwidth given each peer's attributes.

  20. A Local Scalable Distributed EM Algorithm for Large P2P Networks

    Data.gov (United States)

    National Aeronautics and Space Administration — his paper describes a local and distributed expectation maximization algorithm for learning parameters of Gaussian mixture models (GMM) in large peer-to-peer (P2P)...

  1. Towards the Engineering of Dependable P2P-Based Network Control — The Case of Timely Routing Control Messages

    Science.gov (United States)

    Tutschku, Kurt; Nakao, Akihiro

    This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.

  2. Efficient File Sharing by Multicast - P2P Protocol Using Network Coding and Rank Based Peer Selection

    Science.gov (United States)

    Stoenescu, Tudor M.; Woo, Simon S.

    2009-01-01

    In this work, we consider information dissemination and sharing in a distributed peer-to-peer (P2P highly dynamic communication network. In particular, we explore a network coding technique for transmission and a rank based peer selection method for network formation. The combined approach has been shown to improve information sharing and delivery to all users when considering the challenges imposed by the space network environments.

  3. Temporal Patterns of Pedophile Activity in a P2P Network: First Insights about User Profiles from Big Data

    OpenAIRE

    Fournier , Raphaël; Latapy , Matthieu

    2015-01-01

    International audience; Recent studies have shown that child abuse material is shared through peer-to-peer (P2P) networks, which allow users to exchange files without a central server. Obtaining knowledge on the extent of this activity has major consequences for child protection, policy making and Internet regulation. Previous works have developed tools and analyses to provide overall figures in temporally-limited measurements. Offenders' behavior is mostly studied through small-scale intervi...

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

  5. AmbientDB: relational query processing in a P2P network

    NARCIS (Netherlands)

    P.A. Boncz (Peter); C. Treijtel

    2003-01-01

    textabstractA new generation of applications running on a network of nodes, that share data on an ad-hoc basis, will benefit from data management services including powerful querying facilities. In this paper, we introduce the goals, assumptions and architecture of AmbientDB, a new peer-to-peer

  6. AmbientDB : relational query processing in a P2P network

    NARCIS (Netherlands)

    P.A. Boncz (Peter); C. Treijtel

    2003-01-01

    textabstractA new generation of applications running on a network of nodes, that share data on an ad-hoc basis, will benefit from data management services including powerful querying facilities. In this paper, we introduce the goals, assumptions and architecture of AmbientDB, a new peer-to-peer

  7. Cellular Controlled Short-Range Communication for Cooperative P2P Networking

    DEFF Research Database (Denmark)

    Fitzek, Frank H. P.; Katz, Marcos; Zhang, Qi

    2009-01-01

    -range communication network among cooperating mobile and wireless devices. The role of the mobile device will change, from being an agnostic entity in respect to the surrounding world to a cognitive device. This cognitive device is capable of being aware of the neighboring devices as well as on the possibility......This article advocates a novel communication architecture and associated collaborative framework for future wireless communication systems. In contrast to the dominating cellular architecture and the upcoming peer-to-peer architecture, the new approach envisions a cellular controlled short...... to establish cooperation with them. The novel architecture together with several possible cooperative strategies will bring clear benefits for the network and service providers, mobile device manufacturers and also end users....

  8. Nature-Inspired Dissemination of Information in P2P Networks

    Science.gov (United States)

    Guéret, Christophe

    After having first been used as a means to publish content, the Web is now widely used as a social tool for sharing information. It is an easy task to subscribe to a social network, join one of the Web-based communities according to some personal interests and start to share content with all the people who do the same. It is easy once you solve two basic problems: select the network to join (go to hi5, facebook, myspace,…? join all of them?) and find/pick up the right communities (i.e., find a strict label to match non-strict centers of interest). An error of appreciation would result in getting too much of useless/non-relevant information. This chapter provides a study on the dissemination of information within groups of people and aim at answering one question: can we find an effortless way of sharing information on the Web? Ideally, such a solution would require neither the definition of a profile nor the selection of communities to join. Publishing information should also not be the result of an active decision but be performed in an automatic way. A nature-inspired framework is introduced as an answer to this question. This framework features artificial ants taking care of the dissemination of information items within the network. Centers of interest of the users are reflected by artificial pheromones laid down on connections between peers. Another part of the framework uses those pheromone trails to detect shared interests and creates communities.

  9. TinCan: User-Defined P2P Virtual Network Overlays for Ad-hoc Collaboration

    Directory of Open Access Journals (Sweden)

    Pierre St Juste

    2014-10-01

    Full Text Available Virtual private networking (VPN has become an increasingly important component of a collaboration environment because it ensures private, authenticated communication among participants, using existing collaboration tools, where users are distributed across multiple institutions and can be mobile. The majority of current VPN solutions are based on a centralized VPN model, where all IP traffic is tunneled through a VPN gateway. Nonetheless, there are several use case scenarios that require a model where end-to-end VPN links are tunneled upon existing Internet infrastructure in a peer-to-peer (P2P fashion, removing the bottleneck of a centralized VPN gateway. We propose a novel virtual network — TinCan — based on peerto-peer private network tunnels. It reuses existing standards and implementations of services for discovery notification (XMPP, reflection (STUN and relaying (TURN, facilitating configuration. In this approach, trust relationships maintained by centralized (or federated services are automatically mapped to TinCan links. In one use scenario, TinCan allows unstructured P2P overlays connecting trusted end-user devices — while only requiring VPN software on user devices and leveraging online social network (OSN infrastructure already widely deployed. This paper describes the architecture and design of TinCan and presents an experimental evaluation of a prototype supporting Windows, Linux, and Android mobile devices. Results quantify the overhead introduced by the network virtualization layer, and the resource requirements imposed on services needed to bootstrap TinCan links.

  10. Efficient data replication for the delivery of high-quality video content over P2P VoD advertising networks

    Science.gov (United States)

    Ho, Chien-Peng; Yu, Jen-Yu; Lee, Suh-Yin

    2011-12-01

    Recent advances in modern television systems have had profound consequences for the scalability, stability, and quality of transmitted digital data signals. This is of particular significance for peer-to-peer (P2P) video-on-demand (VoD) related platforms, faced with an immediate and growing demand for reliable service delivery. In response to demands for high-quality video, the key objectives in the construction of the proposed framework were user satisfaction with perceived video quality and the effective utilization of available resources on P2P VoD networks. This study developed a peer-based promoter to support online advertising in P2P VoD networks based on an estimation of video distortion prior to the replication of data stream chunks. The proposed technology enables the recovery of lost video using replicated stream chunks in real time. Load balance is achieved by adjusting the replication level of each candidate group according to the degree-of-distortion, thereby enabling a significant reduction in server load and increased scalability in the P2P VoD system. This approach also promotes the use of advertising as an efficient tool for commercial promotion. Results indicate that the proposed system efficiently satisfies the given fault tolerances.

  11. Feasibility study of P2P-type system architecture with 3D medical image data support for medical integrated network systems

    International Nuclear Information System (INIS)

    Noji, Tamotsu; Arino, Masashi; Suto, Yasuzo

    2010-01-01

    We are investigating an integrated medical network system with an electronic letter of introduction function and a 3D image support function operating in the Internet environment. However, the problems with current C/S (client/server)-type systems are inadequate security countermeasures and insufficient transmission availability. In this report, we propose a medical information cooperation system architecture that employs a P2P (peer-to-peer)-type communication method rather than a C/S-type method, which helps to prevent a reduction in processing speed when large amounts of data (such as 3D images) are transferred. In addition, a virtual clinic was created and a feasibility study was conducted to evaluate the P2P-type system. The results showed that efficiency was improved by about 77% in real-time transmission, suggesting that this system may be suitable for practical application. (author)

  12. Anonymity in P2P Systems

    Science.gov (United States)

    Manzanares-Lopez, Pilar; Muñoz-Gea, Juan Pedro; Malgosa-Sanahuja, Josemaria; Sanchez-Aarnoutse, Juan Carlos

    In the last years, the use of peer-to-peer (P2P) applications to share and exchange knowledge among people around the world has experienced an exponential growth. Therefore, it is understandable that, like in any successful communication mechanism used by a lot of humans being, the anonymity can be a desirable characteristic in this scenario. Anonymity in P2P networks can be obtained by means of different methods, although the most significant ones are broadcast protocols, dining-cryptographer (DC) nets and multiple-hop paths. Each of these methods can be tunable in order to build a real anonymity P2P application. In addition, there is a mathematical tool called entropy that can be used in some scenarios to quantify anonymity in communication networks. In some cases, it can be calculated analytically but in others it is necessary to use simulation to obtain the network entropy.

  13. Modelling of P2P-Based Video Sharing Performance for Content-Oriented Community-Based VoD Systems in Wireless Mobile Networks

    Directory of Open Access Journals (Sweden)

    Shijie Jia

    2016-01-01

    Full Text Available The video sharing performance is a key factor for scalability and quality of service of P2P VoD systems in wireless mobile networks. There are some impact factors for the video sharing performance, such as available upload bandwidth, resource distribution in overlay networks, and mobility of mobile nodes. In this paper, we firstly model user behaviors: joining, playback, and departure for the content-oriented community-based VoD systems in wireless mobile networks and construct a resource assignment model by the analysis of transition of node state: suspend, wait, and playback. We analyze the influence of the above three factors: upload bandwidth, startup delay, and resource distribution for the sharing performance and QoS of systems. We further propose the improved resource sharing strategies from the perspectives of community architecture, resource distribution, and data transmission for the systems. Extensive tests show how the improved strategies achieve much better performance results in comparison with original strategies.

  14. Measurement of the hyperfine structure of the 4d2D3/2,5/2 levels and isotope shifts of the 4p2P3/2->4d2D3/2 and 4p2P3/2->4d2D5/2 transitions in gallium 69 and 71

    International Nuclear Information System (INIS)

    Rehse, Steven J.; Fairbank, William M.; Lee, Siu Au

    2001-01-01

    The hyperfine structure of the 4d 2 D 3/2,5/2 levels of 69,71 Ga is determined. The 4p 2 P 3/2 ->4d 2 D 3/2 (294.50-nm) and 4p 2 P 3/2 ->4d 2 D 5/2 (294.45-nm) transitions are studied by laser-induced fluorescence in an atomic Ga beam. The hyperfine A constant measured for the 4d 2 D 5/2 level is 77.3±0.9 MHz for 69 Ga and 97.9± 0.7 MHz for 71 Ga (3σ errors). The A constant measured for the 4d 2 D 3/2 level is -36.3±2.2 MHz for 69 Ga and -46.2±3.8 MHz for 71 Ga. These measurements correct sign errors in the previous determination of these constants. For 69 Ga the hyperfine B constants measured for the 4d 2 D 5/2 and the 4d 2 D 3/2 levels are 5.3±4.1 MHz and 4.6±4.2 MHz, respectively. The isotope shift is determined to be 114±8 MHz for the 4p 2 P 3/2 ->4d 2 D 3/2 transition and 115±7 MHz for the 4p 2 P 3/2 ->4d 2 D 5/2 transition. The lines of 71 Ga are shifted to the blue. This is in agreement with previous measurement. [copyright] 2001 Optical Society of America

  15. Supporting Collaboration and Creativity Through Mobile P2P Computing

    Science.gov (United States)

    Wierzbicki, Adam; Datta, Anwitaman; Żaczek, Łukasz; Rzadca, Krzysztof

    Among many potential applications of mobile P2P systems, collaboration applications are among the most prominent. Examples of applications such as Groove (although not intended for mobile networks), collaboration tools for disaster recovery (the WORKPAD project), and Skype's collaboration extensions, all demonstrate the potential of P2P collaborative applications. Yet, the development of such applications for mobile P2P systems is still difficult because of the lack of middleware.

  16. Towards P2P XML Database Technology

    NARCIS (Netherlands)

    Y. Zhang (Ying)

    2007-01-01

    textabstractTo ease the development of data-intensive P2P applications, we envision a P2P XML Database Management System (P2P XDBMS) that acts as a database middle-ware, providing a uniform database abstraction on top of a dynamic set of distributed data sources. In this PhD work, we research which

  17. Comparing Pedophile Activity in Different P2P Systems

    OpenAIRE

    Raphaël Fournier; Thibault Cholez; Matthieu Latapy; Isabelle Chrisment; Clémence Magnien; Olivier Festor; Ivan Daniloff

    2014-01-01

    International audience; Peer-to-peer (P2P) systems are widely used to exchange content over the Internet. Knowledge of pedophile activity in such networks remains limited, despite having important social consequences. Moreover, though there are different P2P systems in use, previous academic works on this topic focused on one system at a time and their results are not directly comparable. We design a methodology for comparing KAD and eDonkey, two P2P systems among the most prominent ones and ...

  18. 一种基于Cloud-P2P计算模型的恶意代码联合防御网络%Malicious code united-defense network based on Cloud-P2P model

    Institute of Scientific and Technical Information of China (English)

    徐小龙; 吴家兴; 杨庚

    2012-01-01

    The current anti-virus systems are usually unable io respond to endless emerging malicious codes in time. To sohe this problem, this paper proposed and constructed a new malicious code united-defense network based on the Cloud-P2P computing model. The Cloud-P2P model integrated the cloud computing and the P2P computing systems together organically. Servers and user terminals in the malicious code united-defense network carry out their own duties, forming a high-security collaborative defense network against malicious cooes and obtaining the whole group immunity quickly. It also proposed two kinds of hierarchical network topology, C-DHT and D-DHT, which were based on the distributed hash table technology and suitable for the Cloud-P2P computing model. By the introduction of mobile agent technology, realized vaccine agent and patrol agent of the malicious code defense united-network. The malicious code united-defense network based on the Cloud-P2P computing model has ideal performances, such as the network load balance, the rapid response, the comprehensive defense and the good compatibility.%针对目前的反病毒系统在应对恶意代码时通常具有的滞后性,提出并构建了一种新颖的基于CloudP2P计算模型的恶意代码联合防御网络.Cloud-P2P计算模型将云计算与对等计算进行有机融合.恶意代码联合防御网络系统中的集群服务器与用户终端群体联合组成了一个高安全防御网,协同防御恶意代码,并快速产生群体免疫力.为了提高系统的性能表现,提出适用于Cloud-P2P融合计算环境的两种基于分布式哈希表的层次式网络结构C-DHT和D-DHT,并通过引入移动agent技术实现了恶意代码联合防御网络中的疫苗agent和巡警agent.基于Cloud-P2P计算模型的恶意代码联合防御网络具有负载均衡、反应快捷、防御全面和兼容性良好等性能表现.

  19. Mobile P2P Web Services Using SIP

    Directory of Open Access Journals (Sweden)

    Guido Gehlen

    2007-01-01

    Full Text Available Telecommunication networks and the Internet are growing together. Peer-to-Peer (P2P services which are originally offered by network providers, like telephony and messaging, are provided through VoIP and Instant Messaging (IM by Internet service providers, too. The IP Multimedia Subsystem (IMS is the answer of the telecommunication industry to this trend and aims at providing Internet P2P and multimedia services controlled by the network operators. The IMS provides mobility and session management as well as message routing, security, and billing.

  20. Unexpectedly large difference of the electron density at the nucleus in the 4p ^2{P}_{{1}/{2},{3}/{2}} fine-structure doublet of Ca^+

    Science.gov (United States)

    Shi, C.; Gebert, F.; Gorges, C.; Kaufmann, S.; Nörtershäuser, W.; Sahoo, B. K.; Surzhykov, A.; Yerokhin, V. A.; Berengut, J. C.; Wolf, F.; Heip, J. C.; Schmidt, P. O.

    2017-01-01

    We measured the isotope shift in the ^2{S}_{{1}/{2}} → ^2{P}_{{3}/{2}} (D2) transition in singly ionized calcium ions using photon recoil spectroscopy. The high accuracy of the technique enables us to compare the difference between the isotope shifts of this transition to the previously measured isotopic shifts of the ^2{S}_{{1}/{2}} → ^2{P}_{{1}/{2}} (D1) line. This so-called splitting isotope shift is extracted and exhibits a clear signature of field shift contributions. From the data, we were able to extract the small difference of the field shift coefficient and mass shifts between the two transitions with high accuracy. This J-dependence is of relativistic origin and can be used to benchmark atomic structure calculations. As a first step, we use several ab initio atomic structure calculation methods to provide more accurate values for the field shift constants and their ratio. Remarkably, the high-accuracy value for the ratio of the field shift constants extracted from the experimental data is larger than all available theoretical predictions.

  1. Music2Share - Copyright-Compliant Music Sharing in P2P Systems

    NARCIS (Netherlands)

    Kalker, Ton; Epema, Dick H.J.; Hartel, Pieter H.; Lagendijk, R. (Inald) L.; van Steen, Martinus Richardus; van Steen, Maarten

    Peer-to-Peer (P2P) networks are generally considered to be free havens for pirated content, in particular with respect to music. We describe a solution for the problem of copyright infringement in P2P networks for music sharing. In particular, we propose a P2P protocol that integrates the functions

  2. Music2Share --- Copyright-Compliant Music Sharing in P2P Systems

    NARCIS (Netherlands)

    Kalker, T.; Epema, D.; Hartel, P.; Lagendijk, I.; van Steen, M.R.

    2004-01-01

    Peer-to-peer (P2P) networks are generally considered to be free havens for pirated content, in particular with respect to music. We describe a solution for the problem of copyright infringement in P2P networks for music sharing. In particular, we propose a P2P protocol that integrates the functions

  3. Design of novel HIV-1 protease inhibitors incorporating isophthalamide-derived P2-P3 ligands: Synthesis, biological evaluation and X-ray structural studies of inhibitor-HIV-1 protease complex

    Energy Technology Data Exchange (ETDEWEB)

    Ghosh, Arun K.; Brindisi, Margherita; Nyalapatla, Prasanth R.; Takayama, Jun; Ella-Menye, Jean-Rene; Yashchuk, Sofiya; Agniswamy, Johnson; Wang, Yuan-Fang; Aoki, Manabu; Amano, Masayuki; Weber, Irene T.; Mitsuya, Hiroaki

    2017-10-01

    Based upon molecular insights from the X-ray structures of inhibitor-bound HIV-1 protease complexes, we have designed a series of isophthalamide-derived inhibitors incorporating substituted pyrrolidines, piperidines and thiazolidines as P2-P3 ligands for specific interactions in the S2-S3 extended site. Compound 4b has shown an enzyme Ki of 0.025 nM and antiviral IC50 of 69 nM. An X-ray crystal structure of inhibitor 4b-HIV-1 protease complex was determined at 1.33 Å resolution. We have also determined X-ray structure of 3b-bound HIV-1 protease at 1.27 Å resolution. These structures revealed important molecular insight into the inhibitor–HIV-1 protease interactions in the active site.

  4. Comparing Pedophile Activity in Different P2P Systems

    Directory of Open Access Journals (Sweden)

    Raphaël Fournier

    2014-07-01

    Full Text Available Peer-to-peer (P2P systems are widely used to exchange content over the Internet. Knowledge of pedophile activity in such networks remains limited, despite having important social consequences. Moreover, though there are different P2P systems in use, previous academic works on this topic focused on one system at a time and their results are not directly comparable. We design a methodology for comparing KAD and eDonkey, two P2P systems among the most prominent ones and with different anonymity levels. We monitor two eDonkey servers and the KAD network during several days and record hundreds of thousands of keyword-based queries. We detect pedophile-related queries with a previously validated tool and we propose, for the first time, a large-scale comparison of pedophile activity in two different P2P systems. We conclude that there are significantly fewer pedophile queries in KAD than in eDonkey (approximately 0.09% vs. 0.25%.

  5. Supporting seamless mobility for P2P live streaming.

    Science.gov (United States)

    Kim, Eunsam; Kim, Sangjin; Lee, Choonhwa

    2014-01-01

    With advent of various mobile devices with powerful networking and computing capabilities, the users' demand to enjoy live video streaming services such as IPTV with mobile devices has been increasing rapidly. However, it is challenging to get over the degradation of service quality due to data loss caused by the handover. Although many handover schemes were proposed at protocol layers below the application layer, they inherently suffer from data loss while the network is being disconnected during the handover. We therefore propose an efficient application-layer handover scheme to support seamless mobility for P2P live streaming. By simulation experiments, we show that the P2P live streaming system with our proposed handover scheme can improve the playback continuity significantly compared to that without our scheme.

  6. Supporting Seamless Mobility for P2P Live Streaming

    Directory of Open Access Journals (Sweden)

    Eunsam Kim

    2014-01-01

    Full Text Available With advent of various mobile devices with powerful networking and computing capabilities, the users' demand to enjoy live video streaming services such as IPTV with mobile devices has been increasing rapidly. However, it is challenging to get over the degradation of service quality due to data loss caused by the handover. Although many handover schemes were proposed at protocol layers below the application layer, they inherently suffer from data loss while the network is being disconnected during the handover. We therefore propose an efficient application-layer handover scheme to support seamless mobility for P2P live streaming. By simulation experiments, we show that the P2P live streaming system with our proposed handover scheme can improve the playback continuity significantly compared to that without our scheme.

  7. Managing P2P services via the IMS

    NARCIS (Netherlands)

    Liotta, A.; Lin, L.

    2007-01-01

    The key aim of our work was to illustrate the benefits and means to deploy P2P services via the IMS. Having demonstrated the technical viability of P2P-IMS we have also found a way to add a new management dimension to existing P2P systems. P2P-IMS comes with a natural "data management" mechanism,

  8. Cooperation enhanced by indirect reciprocity in spatial prisoner's dilemma games for social P2P systems

    Science.gov (United States)

    Tian, Lin-Lin; Li, Ming-Chu; Wang, Zhen

    2016-11-01

    With the growing interest in social Peer-to-Peer (P2P) applications, relationships of individuals are further exploited to improve the performances of reputation systems. It is an on-going challenge to investigate how spatial reciprocity aids indirect reciprocity in sustaining cooperation in practical P2P environments. This paper describes the construction of an extended prisoner's dilemma game on square lattice networks with three strategies, i.e., defection, unconditional cooperation, and reciprocal cooperation. Reciprocators discriminate partners according to their reputations based on image scoring, where mistakes in judgment of reputations may occur. The independent structures of interaction and learning neighborhood are discussed, with respect to the situation in which learning environments differ from interaction networks. The simulation results have indicated that the incentive mechanism enhances cooperation better in structured peers than among a well-mixed population. Given the realistic condition of inaccurate reputation scores, defection is still successfully held down when the players interact and learn within the unified neighborhoods. Extensive simulations have further confirmed the positive impact of spatial structure on cooperation with different sizes of lattice neighborhoods. And similar conclusions can also be drawn on regular random networks and scale-free networks. Moreover, for the separated structures of the neighborhoods, the interaction network has a critical effect on the evolution dynamics of cooperation and learning environments only have weaker impacts on the process. Our findings further provide some insights concerning the evolution of collective behaviors in social systems.

  9. Evolutionary Game Theory-Based Evaluation of P2P File-Sharing Systems in Heterogeneous Environments

    Directory of Open Access Journals (Sweden)

    Yusuke Matsuda

    2010-01-01

    Full Text Available Peer-to-Peer (P2P file sharing is one of key technologies for achieving attractive P2P multimedia social networking. In P2P file-sharing systems, file availability is improved by cooperative users who cache and share files. Note that file caching carries costs such as storage consumption and processing load. In addition, users have different degrees of cooperativity in file caching and they are in different surrounding environments arising from the topological structure of P2P networks. With evolutionary game theory, this paper evaluates the performance of P2P file sharing systems in such heterogeneous environments. Using micro-macro dynamics, we analyze the impact of the heterogeneity of user selfishness on the file availability and system stability. Further, through simulation experiments with agent-based dynamics, we reveal how other aspects, for example, synchronization among nodes and topological structure, affect the system performance. Both analytical and simulation results show that the environmental heterogeneity contributes to the file availability and system stability.

  10. Risk Management of P2P Internet Financing Service Platform

    Science.gov (United States)

    Yalei, Li

    2017-09-01

    Since 2005, the world’s first P2P Internet financing service platform Zopa in UK was introduced, in the development of “Internet +” trend, P2P Internet financing service platform has been developed rapidly. In 2007, China’s first P2P platform “filming loan” was established, marking the P2P Internet financing service platform to enter China and the rapid development. At the same time, China’s P2P Internet financing service platform also appeared in different forms of risk. This paper focuses on the analysis of the causes of risk of P2P Internet financing service platform and the performance of risk management process. It provides a solution to the Internet risk management plan, and explains the risk management system of the whole P2P Internet financing service platform and the future development direction.

  11. (p,2p) experiments at the University of Maryland cyclotron

    International Nuclear Information System (INIS)

    Roos, P.G.

    1976-11-01

    Some of the (p,2p) work which has been carried out at the Maryland Cyclotron is discussed. A brief introduction to the (p,2p) reaction is presented, and the types of experimental techniques utilized in (p,2p) studies are discussed. A brief introduction is given to the various theoretical treatments presently available to analyze (p,2p) reaction data. Secondly, experimental and theoretical studies of (p,2p) on d, 3 He, and 4 He carried out by the Maryland group are presented. Thirdly, (p,2p) results are discussed for 6 Li, 7 Li, and 12 C at 100 MeV. Fourthly, the effects of distortion on the experimental data are considered by presenting theoretical calculations for 12 C and 40 Ca at various bombarding energies

  12. Convergence of Internet and TV: The Commercial Viability of P2P Content Delivery

    Science.gov (United States)

    de Boever, Jorn

    The popularity of (illegal) P2P (peer-to-peer) file sharing has a disruptive impact on Internet traffic and business models of content providers. In addition, several studies have found an increasing demand for bandwidth consuming content, such as video, on the Internet. Although P2P systems have been put forward as a scalable and inexpensive model to deliver such content, there has been relatively little economic analysis of the potentials and obstacles of P2P systems as a legal and commercial content distribution model. Many content providers encounter uncertainties regarding the adoption or rejection of P2P networks to spread content over the Internet. The recent launch of several commercial, legal P2P content distribution platforms increases the importance of an integrated analysis of the Strengths, Weaknesses, Opportunities and Threats (SWOT).

  13. Bandwidth Reduction via Localized Peer-to-Peer (P2P Video

    Directory of Open Access Journals (Sweden)

    Ken Kerpez

    2010-01-01

    Full Text Available This paper presents recent research into P2P distribution of video that can be highly localized, preferably sharing content among users on the same access network and Central Office (CO. Models of video demand and localized P2P serving areas are presented. Detailed simulations of passive optical networks (PON are run, and these generate statistics of P2P video localization. Next-Generation PON (NG-PON is shown to fully enable P2P video localization, but the lower rates of Gigabit-PON (GPON restrict performance. Results here show that nearly all of the traffic volume of unicast video could be delivered via localized P2P. Strong growth in video delivery via localized P2P could lower overall future aggregation and core network bandwidth of IP video traffic by 58.2%, and total consumer Internet traffic by 43.5%. This assumes aggressive adoption of technologies and business practices that enable highly localized P2P video.

  14. Resource trade-off in P2P streaming

    NARCIS (Netherlands)

    Alhaisoni, M.; Liotta, A.; Ghanbari, M.

    2009-01-01

    P2P TV has emerged as a powerful alternative solution for multimedia streaming over the traditional client-server paradigm. It has proven to be a valid substitute for online applications which offer video-on-demand and real-time video. This is mainly due to the scalability and resiliency that P2P

  15. Data Sharing in DHT Based P2P Systems

    Science.gov (United States)

    Roncancio, Claudia; Del Pilar Villamil, María; Labbé, Cyril; Serrano-Alvarado, Patricia

    The evolution of peer-to-peer (P2P) systems triggered the building of large scale distributed applications. The main application domain is data sharing across a very large number of highly autonomous participants. Building such data sharing systems is particularly challenging because of the “extreme” characteristics of P2P infrastructures: massive distribution, high churn rate, no global control, potentially untrusted participants... This article focuses on declarative querying support, query optimization and data privacy on a major class of P2P systems, that based on Distributed Hash Table (P2P DHT). The usual approaches and the algorithms used by classic distributed systems and databases for providing data privacy and querying services are not well suited to P2P DHT systems. A considerable amount of work was required to adapt them for the new challenges such systems present. This paper describes the most important solutions found. It also identifies important future research trends in data management in P2P DHT systems.

  16. Determinants of Default in P2P Lending.

    Directory of Open Access Journals (Sweden)

    Carlos Serrano-Cinca

    Full Text Available This paper studies P2P lending and the factors explaining loan default. This is an important issue because in P2P lending individual investors bear the credit risk, instead of financial institutions, which are experts in dealing with this risk. P2P lenders suffer a severe problem of information asymmetry, because they are at a disadvantage facing the borrower. For this reason, P2P lending sites provide potential lenders with information about borrowers and their loan purpose. They also assign a grade to each loan. The empirical study is based on loans' data collected from Lending Club (N = 24,449 from 2008 to 2014 that are first analyzed by using univariate means tests and survival analysis. Factors explaining default are loan purpose, annual income, current housing situation, credit history and indebtedness. Secondly, a logistic regression model is developed to predict defaults. The grade assigned by the P2P lending site is the most predictive factor of default, but the accuracy of the model is improved by adding other information, especially the borrower's debt level.

  17. Determinants of Default in P2P Lending.

    Science.gov (United States)

    Serrano-Cinca, Carlos; Gutiérrez-Nieto, Begoña; López-Palacios, Luz

    2015-01-01

    This paper studies P2P lending and the factors explaining loan default. This is an important issue because in P2P lending individual investors bear the credit risk, instead of financial institutions, which are experts in dealing with this risk. P2P lenders suffer a severe problem of information asymmetry, because they are at a disadvantage facing the borrower. For this reason, P2P lending sites provide potential lenders with information about borrowers and their loan purpose. They also assign a grade to each loan. The empirical study is based on loans' data collected from Lending Club (N = 24,449) from 2008 to 2014 that are first analyzed by using univariate means tests and survival analysis. Factors explaining default are loan purpose, annual income, current housing situation, credit history and indebtedness. Secondly, a logistic regression model is developed to predict defaults. The grade assigned by the P2P lending site is the most predictive factor of default, but the accuracy of the model is improved by adding other information, especially the borrower's debt level.

  18. Characterizing Economic and Social Properties of Trust and Reputation Systems in P2P Environment

    Institute of Scientific and Technical Information of China (English)

    Yu-Feng Wang; Yoshiaki Hori; Kouichi Sakurai

    2008-01-01

    Considering the fact that P2P (Peer-to-Peer) systems are self-organized and autonomous, social-control mechanism (like trust and reputation) is essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest and malicious peer behaviors. So, naturally, we advocate that P2P systems that gradually act as an important information infrastructure should be multi-disciplinary research topic, and reflect certain features of our society. So, from economic and social perspective, this paper designs the incentive-compatible reputation feedback scheme based on well-known economic model, and characterizes the social features of trust network in terms of efficiency and cost. Specifically, our framework has two distinctive purposes: first, from high-level perspective, we argue trust system is a special kind of social network, and an accurate characterization of the structural properties of the network can be of fundamental importance to understand the dynamics of the system. Thus, inspired by the concept of weighted small-world, this paper proposes new measurements to characterize the social properties of trust system, that is, highg lobal and local efficiency, and low cost; then, from relative low-level perspective, we argue that reputation feedback is a special kind of information, and it is not free. So, based on economic model, VCG (Vickrey-Clarke-Grove)-like reputation remuneration mechanism is proposed to stimulate rational peers not only to provide reputation feedback, but truthfully offer feedback. Furthermore, considering that trust and reputation is subjective, we classify the trust into functional trust and referral trust, and extend the referral trust to include two factors: similarity and truthfulness, which can efficiently reduce the trust inference error. The preliminary simulation results show the benefits of our proposal and the emergence of certain social properties in trust network.

  19. The P2P approach to interorganizational workflows

    NARCIS (Netherlands)

    Aalst, van der W.M.P.; Weske, M.H.; Dittrich, K.R.; Geppert, A.; Norrie, M.C.

    2001-01-01

    This paper describes in an informal way the Public-To-Private (P2P) approach to interorganizational workflows, which is based on a notion of inheritance. The approach consists of three steps: (1) create a common understanding of the interorganizational workflow by specifying a shared public

  20. Measurement and Analysis of P2P IPTV Program Resource

    Directory of Open Access Journals (Sweden)

    Wenxian Wang

    2014-01-01

    Full Text Available With the rapid development of P2P technology, P2P IPTV applications have received more and more attention. And program resource distribution is very important to P2P IPTV applications. In order to collect IPTV program resources, a distributed multi-protocol crawler is proposed. And the crawler has collected more than 13 million pieces of information of IPTV programs from 2009 to 2012. In addition, the distribution of IPTV programs is independent and incompact, resulting in chaos of program names, which obstructs searching and organizing programs. Thus, we focus on characteristic analysis of program resources, including the distributions of length of program names, the entropy of the character types, and hierarchy depth of programs. These analyses reveal the disorderly naming conventions of P2P IPTV programs. The analysis results can help to purify and extract useful information from chaotic names for better retrieval and accelerate automatic sorting of program and establishment of IPTV repository. In order to represent popularity of programs and to predict user behavior and popularity of hot programs over a period, we also put forward an analytical model of hot programs.

  1. Measurement and analysis of P2P IPTV program resource.

    Science.gov (United States)

    Wang, Wenxian; Chen, Xingshu; Wang, Haizhou; Zhang, Qi; Wang, Cheng

    2014-01-01

    With the rapid development of P2P technology, P2P IPTV applications have received more and more attention. And program resource distribution is very important to P2P IPTV applications. In order to collect IPTV program resources, a distributed multi-protocol crawler is proposed. And the crawler has collected more than 13 million pieces of information of IPTV programs from 2009 to 2012. In addition, the distribution of IPTV programs is independent and incompact, resulting in chaos of program names, which obstructs searching and organizing programs. Thus, we focus on characteristic analysis of program resources, including the distributions of length of program names, the entropy of the character types, and hierarchy depth of programs. These analyses reveal the disorderly naming conventions of P2P IPTV programs. The analysis results can help to purify and extract useful information from chaotic names for better retrieval and accelerate automatic sorting of program and establishment of IPTV repository. In order to represent popularity of programs and to predict user behavior and popularity of hot programs over a period, we also put forward an analytical model of hot programs.

  2. A New Caching Technique to Support Conjunctive Queries in P2P DHT

    Science.gov (United States)

    Kobatake, Koji; Tagashira, Shigeaki; Fujita, Satoshi

    P2P DHT (Peer-to-Peer Distributed Hash Table) is one of typical techniques for realizing an efficient management of shared resources distributed over a network and a keyword search over such networks in a fully distributed manner. In this paper, we propose a new method for supporting conjunctive queries in P2P DHT. The basic idea of the proposed technique is to share a global information on past trials by conducting a local caching of search results for conjunctive queries and by registering the fact to the global DHT. Such a result caching is expected to significantly reduce the amount of transmitted data compared with conventional schemes. The effect of the proposed method is experimentally evaluated by simulation. The result of experiments indicates that by using the proposed method, the amount of returned data is reduced by 60% compared with conventional P2P DHT which does not support conjunctive queries.

  3. P2P systems in a regulated environment : challenges and opportunities for the operator

    NARCIS (Netherlands)

    Liotta, A.

    2008-01-01

    P2P networks, systems, and applications have been the subject of intensive studies in recent years. They have created new business opportunities, providing a low-cost mechanism for communication and for online content distribution. They have also sparked a spate of legal disputes with adverse

  4. Towards secure mobile P2P applications using JXME

    OpenAIRE

    Domingo Prieto, Marc; Prieto Blázquez, Josep; Herrera Joancomartí, Jordi; Arnedo Moreno, Joan

    2014-01-01

    Mobile devices have become ubiquitous, allowing the integration of new information from a large range of devices. However, the development of new applications requires a powerful framework which simplifies their construction. JXME is the JXTA implementation for mobile devices using J2ME, its main value being its simplicity when creating peer-to-peer (P2P) applications on limited devices. On that regard, an issue that is becoming very important in the recent times is being able to provide ...

  5. Exploring the Feasibility of Reputation Models for Improving P2P Routing under Churn

    Science.gov (United States)

    Sànchez-Artigas, Marc; García-López, Pedro; Herrera, Blas

    Reputation mechanisms help peer-to-peer (P2P) networks to detect and avoid unreliable or uncooperative peers. Recently, it has been discussed that routing protocols can be improved by conditioning routing decisions to the past behavior of forwarding peers. However, churn — the continuous process of node arrival and departure — may severely hinder the applicability of rating mechanisms. In particular, short lifetimes mean that reputations are often generated from a small number of transactions.

  6. The Measurement and Modeling of a P2P Streaming Video Service

    Science.gov (United States)

    Gao, Peng; Liu, Tao; Chen, Yanming; Wu, Xingyao; El-Khatib, Yehia; Edwards, Christopher

    Most of the work on grid technology in video area has been generally restricted to aspects of resource scheduling and replica management. The traffic of such service has a lot of characteristics in common with that of the traditional video service. However the architecture and user behavior in Grid networks are quite different from those of traditional Internet. Considering the potential of grid networks and video sharing services, measuring and analyzing P2P IPTV traffic are important and fundamental works in the field grid networks.

  7. Load Balancing Scheme on the Basis of Huffman Coding for P2P Information Retrieval

    Science.gov (United States)

    Kurasawa, Hisashi; Takasu, Atsuhiro; Adachi, Jun

    Although a distributed index on a distributed hash table (DHT) enables efficient document query processing in Peer-to-Peer information retrieval (P2P IR), the index costs a lot to construct and it tends to be an unfair management because of the unbalanced term frequency distribution. We devised a new distributed index, named Huffman-DHT, for P2P IR. The new index uses an algorithm similar to Huffman coding with a modification to the DHT structure based on the term distribution. In a Huffman-DHT, a frequent term is assigned to a short ID and allocated a large space in the node ID space in DHT. Throuth ID management, the Huffman-DHT balances the index registration accesses among peers and reduces load concentrations. Huffman-DHT is the first approach to adapt concepts of coding theory and term frequency distribution to load balancing. We evaluated this approach in experiments using a document collection and assessed its load balancing capabilities in P2P IR. The experimental results indicated that it is most effective when the P2P system consists of about 30, 000 nodes and contains many documents. Moreover, we proved that we can construct a Huffman-DHT easily by estimating the probability distribution of the term occurrence from a small number of sample documents.

  8. Manejo de Identidades en Sistemas P2P Basado en DHT

    Directory of Open Access Journals (Sweden)

    Ricardo Villanueva

    2016-01-01

    Full Text Available Este artículo presenta las redes P2P, donde se analizara la manera en la cual los nodos se relacionan entre sí y de que forma en la cual se distribuyen al entrar a la red.  Cada nodo al crear una red o unirse a una ya existente posee un identificador el cual da origen a la manera en la que se distribuyen los siguientes nodos que se unirán a la red, la falla radica en que uno de los nodos ya enlazados a la red existente pueden ser maliciosos y originar puntos de ataque a la red afectando la confidencialidad de la información distribuida entre los demás nodos de la red o modificar el enrutamiento de la información suministrada a través de la capa de aplicación, ya que estos nodos solo con el hecho de estar en la red son responsables de la comunicación que se realiza entre ciertos nodos localizados en el anillo. Se indicaran detalladamente los procesos de conexión, comunicación y estabilización de los nodos por medio de la simulación de las redes P2P en ovelay weaver, mostrando consigo las características y resultados de la simulación.   Abstract This paper contains information relating to what concerns the networks P2P, there was analyzed the way in which the nodes relate between yes and of which it forms the organization in which they are distributed on having entered to the network. Every node on having created a network or to join the already existing one possesses an identifier which gives origin to the way in which there are distributed the following nodes that will join the network, The fault takes root in that one of the nodes already connected to the existing network they can be malicious and in originating points of assault to the network affecting the confidentiality of the information distributed between other nodes of the network or to modify the routing of the information supplied across the cap of application, since these nodes only with the fact of being in the network are responsible for the communication that is

  9. Enhanced P2P Services Providing Multimedia Content

    Directory of Open Access Journals (Sweden)

    E. Ardizzone

    2007-01-01

    To address this major limitation, we propose an original image and video sharing system, in which a user is able to interactively search interesting resources by means of content-based image and video retrieval techniques. In order to limit the network traffic load, maximizing the usefulness of each peer contacted in the query process, we also propose the adoption of an adaptive overlay routing algorithm, exploiting compact representations of the multimedia resources shared by each peer. Experimental results confirm the validity of the proposed approach, that is capable of dynamically adapting the network topology to peer interests, on the basis of query interactions among users.

  10. A P2P Service Discovery Strategy Based on Content Catalogues

    Directory of Open Access Journals (Sweden)

    Lican Huang

    2007-08-01

    Full Text Available This paper presents a framework for distributed service discovery based on VIRGO P2P technologies. The services are classified as multi-layer, hierarchical catalogue domains according to their contents. The service providers, which have their own service registries such as UDDIs, register the services they provide and establish a virtual tree in a VIRGO network according to the domain of their service. The service location done by the proposed strategy is effective and guaranteed. This paper also discusses the primary implementation of service discovery based on Tomcat/Axis and jUDDI.

  11. Towards Accurate Node-Based Detection of P2P Botnets

    Directory of Open Access Journals (Sweden)

    Chunyong Yin

    2014-01-01

    Full Text Available Botnets are a serious security threat to the current Internet infrastructure. In this paper, we propose a novel direction for P2P botnet detection called node-based detection. This approach focuses on the network characteristics of individual nodes. Based on our model, we examine node’s flows and extract the useful features over a given time period. We have tested our approach on real-life data sets and achieved detection rates of 99-100% and low false positives rates of 0–2%. Comparison with other similar approaches on the same data sets shows that our approach outperforms the existing approaches.

  12. Group Clustering Mechanism for P2P Large Scale Data Sharing Collaboration

    Institute of Scientific and Technical Information of China (English)

    DENGQianni; LUXinda; CHENLi

    2005-01-01

    Research shows that P2P scientific collaboration network will exhibit small-world topology, as do a large number of social networks for which the same pattern has been documented. In this paper we propose a topology building protocol to benefit from the small world feature. We find that the idea of Freenet resembles the dynamic pattern of social interactions in scientific data sharing and the small world characteristic of Freenet is propitious to improve the file locating performance in scientificdata sharing. But the LRU (Least recently used) datas-tore cache replacement scheme of Freenet is not suitableto be used in scientific data sharing network. Based onthe group locality of scientific collaboration, we proposean enhanced group clustering cache replacement scheme.Simulation shows that this scheme improves the request hitratio dramatically while keeping the small average hops per successful request comparable to LRU.

  13. A Distributed Dynamic Super Peer Selection Method Based on Evolutionary Game for Heterogeneous P2P Streaming Systems

    Directory of Open Access Journals (Sweden)

    Jing Chen

    2013-01-01

    Full Text Available Due to high efficiency and good scalability, hierarchical hybrid P2P architecture has drawn more and more attention in P2P streaming research and application fields recently. The problem about super peer selection, which is the key problem in hybrid heterogeneous P2P architecture, is becoming highly challenging because super peers must be selected from a huge and dynamically changing network. A distributed super peer selection (SPS algorithm for hybrid heterogeneous P2P streaming system based on evolutionary game is proposed in this paper. The super peer selection procedure is modeled based on evolutionary game framework firstly, and its evolutionarily stable strategies are analyzed. Then a distributed Q-learning algorithm (ESS-SPS according to the mixed strategies by analysis is proposed for the peers to converge to the ESSs based on its own payoff history. Compared to the traditional randomly super peer selection scheme, experiments results show that the proposed ESS-SPS algorithm achieves better performance in terms of social welfare and average upload rate of super peers and keeps the upload capacity of the P2P streaming system increasing steadily with the number of peers increasing.

  14. Research of trust model base on P2P and grid system

    International Nuclear Information System (INIS)

    Jiang Zhuoming; Wu Huan; Xu Rongsheng

    2009-01-01

    Orienting to the characteristic of P2P and Grid system in architecture and service, a trust management model (PG-TM) based on cluster partition is presented. In this model, the protocol is described that trustworthiness is computed before service interaction, and recommendation values will be fed back after interaction. About the trustworthiness, some arithmetic is compared and geometric mean is brought up for the non-linear trust principle. In addition, it is also considered that the trustworthiness is adjusted by the produce contribution rate,network stability and history accumulation. Finally, the factors of maintaining management server and cluster are discussed. PG-TM model can ensure the security and availability in computation and storage of high energy physics experiments. (authors)

  15. Relay discovery and selection for large-scale P2P streaming.

    Directory of Open Access Journals (Sweden)

    Chengwei Zhang

    Full Text Available In peer-to-peer networks, application relays have been commonly used to provide various networking services. The service performance often improves significantly if a relay is selected appropriately based on its network location. In this paper, we studied the location-aware relay discovery and selection problem for large-scale P2P streaming networks. In these large-scale and dynamic overlays, it incurs significant communication and computation cost to discover a sufficiently large relay candidate set and further to select one relay with good performance. The network location can be measured directly or indirectly with the tradeoffs between timeliness, overhead and accuracy. Based on a measurement study and the associated error analysis, we demonstrate that indirect measurements, such as King and Internet Coordinate Systems (ICS, can only achieve a coarse estimation of peers' network location and those methods based on pure indirect measurements cannot lead to a good relay selection. We also demonstrate that there exists significant error amplification of the commonly used "best-out-of-K" selection methodology using three RTT data sets publicly available. We propose a two-phase approach to achieve efficient relay discovery and accurate relay selection. Indirect measurements are used to narrow down a small number of high-quality relay candidates and the final relay selection is refined based on direct probing. This two-phase approach enjoys an efficient implementation using the Distributed-Hash-Table (DHT. When the DHT is constructed, the node keys carry the location information and they are generated scalably using indirect measurements, such as the ICS coordinates. The relay discovery is achieved efficiently utilizing the DHT-based search. We evaluated various aspects of this DHT-based approach, including the DHT indexing procedure, key generation under peer churn and message costs.

  16. Evaluating Application-Layer Traffic Optimization Cost Metrics for P2P Multimedia Streaming

    DEFF Research Database (Denmark)

    Poderys, Justas; Soler, José

    2017-01-01

    To help users of P2P communication systems perform better-than-random selection of communication peers, Internet Engineering Task Force standardized the Application Layer Traffic Optimization (ALTO) protocol. The ALTO provided data-routing cost metric, can be used to rank peers in P2P communicati...

  17. P2P XQuery and the StreetTiVo application

    NARCIS (Netherlands)

    P.A. Boncz (Peter); Y. Zhang (Ying)

    2007-01-01

    textabstractIn the AmbientDB project, we are building MonetDB/XQuery, an open-source XML DBMS (XDBMS) with support for distributed querying and P2P services. Our work is motivated by the hypothesis that P2P is a disruptive paradigm that should change the nature of database technology. Most of the

  18. A Simple FSPN Model of P2P Live Video Streaming System

    OpenAIRE

    Kotevski, Zoran; Mitrevski, Pece

    2011-01-01

    Peer to Peer (P2P) live streaming is relatively new paradigm that aims at streaming live video to large number of clients at low cost. Many such applications already exist in the market, but, prior to creating such system it is necessary to analyze its performance via representative model that can provide good insight in the system’s behavior. Modeling and performance analysis of P2P live video streaming systems is challenging task which requires addressing many properties and issues of P2P s...

  19. P2P-Based Data System for the EAST Experiment

    Science.gov (United States)

    Shu, Yantai; Zhang, Liang; Zhao, Weifeng; Chen, Haiming; Luo, Jiarong

    2006-06-01

    A peer-to-peer (P2P)-based EAST Data System is being designed to provide data acquisition and analysis support for the EAST superconducting tokamak. Instead of transferring data to the servers, all collected data are stored in the data acquisition subsystems locally and the PC clients can access the raw data directly using the P2P architecture. Both online and offline systems are based on Napster-like P2P architecture. This allows the peer (PC) to act both as a client and as a server. A simulation-based method and a steady-state operational analysis technique are used for performance evaluation. These analyses show that the P2P technique can significantly reduce the completion time of raw data display and real-time processing on the online system, and raise the workload capacity and reduce the delay on the offline system.

  20. The Comparison of Distributed P2P Trust Models Based on Quantitative Parameters in the File Downloading Scenarios

    Directory of Open Access Journals (Sweden)

    Jingpei Wang

    2016-01-01

    Full Text Available Varied P2P trust models have been proposed recently; it is necessary to develop an effective method to evaluate these trust models to resolve the commonalities (guiding the newly generated trust models in theory and individuality (assisting a decision maker in choosing an optimal trust model to implement in specific context issues. A new method for analyzing and comparing P2P trust models based on hierarchical parameters quantization in the file downloading scenarios is proposed in this paper. Several parameters are extracted from the functional attributes and quality feature of trust relationship, as well as requirements from the specific network context and the evaluators. Several distributed P2P trust models are analyzed quantitatively with extracted parameters modeled into a hierarchical model. The fuzzy inferring method is applied to the hierarchical modeling of parameters to fuse the evaluated values of the candidate trust models, and then the relative optimal one is selected based on the sorted overall quantitative values. Finally, analyses and simulation are performed. The results show that the proposed method is reasonable and effective compared with the previous algorithms.

  1. 11th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

    CERN Document Server

    Barolli, Leonard; Amato, Flora

    2017-01-01

    P2P, Grid, Cloud and Internet computing technologies have been very fast established as breakthrough paradigms for solving complex problems by enabling aggregation and sharing of an increasing variety of distributed computational resources at large scale. The aim of this volume is to provide latest research findings, innovative research results, methods and development techniques from both theoretical and practical perspectives related to P2P, Grid, Cloud and Internet computing as well as to reveal synergies among such large scale computing paradigms. This proceedings volume presents the results of the 11th International Conference on P2P, Parallel, Grid, Cloud And Internet Computing (3PGCIC-2016), held November 5-7, 2016, at Soonchunhyang University, Asan, Korea.

  2. Integrating XQuery and P2P in MonetDB/XQuery*

    NARCIS (Netherlands)

    Y. Zhang (Ying); P.A. Boncz (Peter); M. Arenas (Marcelo); J. Hidders

    2007-01-01

    textabstractMonetDB/XQuery* is a fully functional publicly available XML DBMS that has been extended with distributed and P2P data management functionality. Our (minimal) XQuery language extension XRPC adds the concept of RPC to XQuery, and exploits the set-at-a-time database processing model to

  3. The "P2P" Educational Model Providing Innovative Learning by Linking Technology, Business and Research

    Science.gov (United States)

    Dickinson, Paul Gordon

    2017-01-01

    This paper evaluates the effect and potential of a new educational learning model called Peer to Peer (P2P). The study was focused on Laurea, Hyvinkaa's Finland campus and its response to bridging the gap between traditional educational methods and working reality, where modern technology plays an important role. The study describes and evaluates…

  4. Comparing manually-developed and data-driven rules for P2P learning

    CSIR Research Space (South Africa)

    Loots, L

    2009-11-01

    Full Text Available Phoneme-to-phoneme (P2P) learning provides a mechanism for predicting the pronunciation of a word based on its pronunciation in a different accent, dialect or language. The authors evaluate the effectiveness of manually-developed as well...

  5. analysis of the probability of channel satisfactory state in p2p live

    African Journals Online (AJOL)

    userpc

    churn and bits flow was modelled as fluid flow. The applicability of the theory of probability was deduced from Kelly (1991). Section II of the paper provides the model of. P2P live streaming systems taking into account peer behaviour and expression was obtained for the computation of the probability of channel- satisfactory ...

  6. Enabling Co-located Learning over Mobile Ad Hoc P2P with LightPeers

    DEFF Research Database (Denmark)

    Christensen, Bent Guldbjerg; Kristensen, Mads Darø; Hansen, Frank Allan

    2008-01-01

    This paper presents LightPeers – a new mobile P2P framework specifically tailored for use in a nomadic learning environment. A set of key requirements for the framework is identified based on nomadic learning, and these requirements are used as outset for designing and implementing the architectu...

  7. Analysis of the probability of channel satisfactory state in P2P live ...

    African Journals Online (AJOL)

    In this paper a model based on user behaviour of P2P live streaming systems was developed in order to analyse one of the key QoS parameter of such systems, i.e. the probability of channel-satisfactory state, the impact of upload bandwidths and channels' popularity on the probability of channel-satisfactory state was also ...

  8. Extending an Afrikaans pronunciation dictionary using Dutch resources and P2P/GP2P

    CSIR Research Space (South Africa)

    Loots, L

    2010-11-01

    Full Text Available . This is compared to the more common approach of extending the Afrikaans dictionary by means of graphemeto-phoneme (G2P) conversion. The results indicate that the Afrikaans pronunciations obtained by P2P and GP2P from the Dutch dictionary are more accurate than...

  9. Photoionization from the 6p 2P3/2 state of neutral cesium

    International Nuclear Information System (INIS)

    Haq, S. U.; Nadeem, Ali

    2010-01-01

    We report the photoionization studies of cesium from the 6p 2 P 3/2 excited state to measure the photoionization cross section at and above the first ionization threshold, oscillator strength of the highly excited transitions, and extension in the Rydberg series. The photoionization cross section at the first ionization threshold is measured as 25 (4) Mb and at excess energies 0.02, 0.04, 0.07, and 0.09 eV as 21, 19, 17, and 16 Mb, respectively. Oscillator strength of the 6p 2 P 3/2 → nd 2 D 5/2 (23 ≤ n ≤ 60) Rydberg transitions has been extracted utilizing the threshold value of photoionization cross section and the recorded nd 2 D 5/2 photoionization spectra.

  10. n-p Short-Range Correlations from (p,2p+n) Measurements

    Science.gov (United States)

    Tang, A.; Watson, J. W.; Aclander, J.; Alster, J.; Asryan, G.; Averichev, Y.; Barton, D.; Baturin, V.; Bukhtoyarova, N.; Carroll, A.; Gushue, S.; Heppelmann, S.; Leksanov, A.; Makdisi, Y.; Malki, A.; Minina, E.; Navon, I.; Nicholson, H.; Ogawa, A.; Panebratsev, Yu.; Piasetzky, E.; Schetkovsky, A.; Shimanskiy, S.; Zhalov, D.

    2003-01-01

    We studied the 12C(p,2p+n) reaction at beam momenta of 5.9, 8.0, and 9.0 GeV/c. For quasielastic (p,2p) events pf, the momentum of the knocked-out proton before the reaction, was compared (event by event) with pn, the coincident neutron momentum. For |pn|>kF=0.220 GeV/c (the Fermi momentum) a strong back-to-back directional correlation between pf and pn was observed, indicative of short-range n-p correlations. From pn and pf we constructed the distributions of c.m. and relative motion in the longitudinal direction for correlated pairs. We also determined that 49±13% of events with |pf|>kF had directionally correlated neutrons with |pn|>kF.

  11. JXTA: A Technology Facilitating Mobile P2P Health Management System

    OpenAIRE

    Rajkumar, Rajasekaran; Iyengar, Nallani Chackravatula Sriman Naraya

    2012-01-01

    Objectives Mobile JXTA (Juxtapose) gaining momentum and has attracted the interest of doctors and patients through P2P service that transmits messages. Audio and video can also be transmitted through JXTA. The use of mobile streaming mechanism with the support of mobile hospital management and healthcare system would enable better interaction between doctors, nurses, and the hospital. Experimental results demonstrate good performance in comparison with conventional systems. This study evaluat...

  12. Emergence of Financial Intermediaries in Electronic Markets: The Case of Online P2P Lending

    OpenAIRE

    Sven C. Berger; Fabian Gleisner

    2009-01-01

    We analyze the role of intermediaries in electronic markets using detailed data of more than 14,000 originated loans on an electronic P2P (peer-to-peer) lending platform. In such an electronic credit market, lenders bid to supply a private loan. Screening of potential borrowers and the monitoring of loan repayment can be delegated to designated group leaders. We find that these market participants act as financial intermediaries and significantly improve borrowers' credit conditions by reduci...

  13. Personalized Trust Management for Open and Flat P2P Communities

    Institute of Scientific and Technical Information of China (English)

    ZUO Min; LI Jian-hua

    2008-01-01

    A personalized trust management scheme is proposed to help peers build up trust between each other in open and flat P2P communities. This scheme totally abandons the attempt to achieve a global view. It evaluates trust from a subjective point of view and gives personalized decision support to each peer. Simulation experiments prove its three advantages: free of central control, stronger immunity to misleading recommendations, and limited traffic overload.

  14. A decision support model for investment on P2P lending platform.

    Science.gov (United States)

    Zeng, Xiangxiang; Liu, Li; Leung, Stephen; Du, Jiangze; Wang, Xun; Li, Tao

    2017-01-01

    Peer-to-peer (P2P) lending, as a novel economic lending model, has triggered new challenges on making effective investment decisions. In a P2P lending platform, one lender can invest N loans and a loan may be accepted by M investors, thus forming a bipartite graph. Basing on the bipartite graph model, we built an iteration computation model to evaluate the unknown loans. To validate the proposed model, we perform extensive experiments on real-world data from the largest American P2P lending marketplace-Prosper. By comparing our experimental results with those obtained by Bayes and Logistic Regression, we show that our computation model can help borrowers select good loans and help lenders make good investment decisions. Experimental results also show that the Logistic classification model is a good complement to our iterative computation model, which motivates us to integrate the two classification models. The experimental results of the hybrid classification model demonstrate that the logistic classification model and our iteration computation model are complementary to each other. We conclude that the hybrid model (i.e., the integration of iterative computation model and Logistic classification model) is more efficient and stable than the individual model alone.

  15. A decision support model for investment on P2P lending platform.

    Directory of Open Access Journals (Sweden)

    Xiangxiang Zeng

    Full Text Available Peer-to-peer (P2P lending, as a novel economic lending model, has triggered new challenges on making effective investment decisions. In a P2P lending platform, one lender can invest N loans and a loan may be accepted by M investors, thus forming a bipartite graph. Basing on the bipartite graph model, we built an iteration computation model to evaluate the unknown loans. To validate the proposed model, we perform extensive experiments on real-world data from the largest American P2P lending marketplace-Prosper. By comparing our experimental results with those obtained by Bayes and Logistic Regression, we show that our computation model can help borrowers select good loans and help lenders make good investment decisions. Experimental results also show that the Logistic classification model is a good complement to our iterative computation model, which motivates us to integrate the two classification models. The experimental results of the hybrid classification model demonstrate that the logistic classification model and our iteration computation model are complementary to each other. We conclude that the hybrid model (i.e., the integration of iterative computation model and Logistic classification model is more efficient and stable than the individual model alone.

  16. Theoretical investigation of the Omega(g,u)(+/-) states of K2 dissociating adiabatically up to K(4p 2P(3/2)) + K(4p 2P(3/2)).

    Science.gov (United States)

    Jraij, A; Allouche, A R; Magnier, S; Aubert-Frécon, M

    2009-06-28

    A theoretical investigation of the electronic structure of the K(2) molecule, including spin-orbit effects, has been performed. Potential energies have been calculated over a large range of R up to 75a(0) for the 88 Omega(g,u)(+/-) states dissociating adiabatically into the limits up to K(4p (2)P(3/2))+K(4p (2)P(3/2)). Equilibrium distances, transition energies, harmonic frequencies, as well as depths for wells and heights for barriers are reported for all of the bound Omega(g,u)(+/-) states. Present ab initio calculations are shown to be able to reproduce quite accurately the small structures (wells and barrier) displayed at very long-range (R>50a(0)) by the (2,3)1(u) and (2)0(g)(-) purely long-range states. As the present data could help experimentalists, we make available extensive tables of energy values versus internuclear distances in our database at the web address http://www-lasim.univ-lyon1.fr/spip.php?rubrique99.

  17. Design and Evaluation of IP Header Compression for Cellular-Controlled P2P Networks

    DEFF Research Database (Denmark)

    Madsen, T.K.; Zhang, Qi; Fitzek, F.H.P.

    2007-01-01

    In this paper we advocate to exploit terminal cooperation to stabilize IP communication using header compression. The terminal cooperation is based on direct communication between terminals using short range communication and simultaneously being connected to the cellular service access point....... The short range link is than used to provide first aid information to heal the decompressor state of the neighboring node in case of a packet loss on the cellular link. IP header compression schemes are used to increase the spectral and power efficiency loosing robustness of the communication compared...

  18. AGNO: An Adaptive Group Communication Scheme for Unstructured P2P Networks

    National Research Council Canada - National Science Library

    Tsoumakos, Dimitrios; Roussopoulos, Nick

    2004-01-01

    .... Utilizing search indices, together with a small number of soft-state shortcuts, AGNO achieves effective and bandwidth-efficient content dissemination, without the cost and restrictions of a membership protocol or a DHT...

  19. Ontology driven framework for multimedia information retrieval in P2P network

    CERN Document Server

    Sokhn, Maria

    During the last decade we have witnessed an exponential growth of digital documents and multimedia resources, including a vast amount of video resources. Videos are becoming one of the most popular media thanks to the rich audio, visual and textual content they may convey. The recent technological advances have made this large amount of multimedia resources available to users in a variety of areas, including the academic and scientific realms. However, without adequate techniques for effective content based multimedia retrieval, this large and valuable body of data is barely accessible and remains in effect unusable. This thesis explores semantic approaches to content based management browsing and visualization of the multimedia resources generated for and during scientific conferences. Indeed, a so-called semantic gap exists between the explicit knowledge representation required by users who search the multimedia resources and the implicit knowledge conveyed within a conference life cycle. The aim of this wo...

  20. (p,2p) study of high-momentum components at 2.1 GeV

    International Nuclear Information System (INIS)

    Treuhaft, R.N.

    1982-07-01

    A (p,2p) experiment designed to isolate interactions with small numbers of fast nuclear constituents is described. Special attention is paid to the experimental manifestation and description of a correlated pair of nucleons in the nucleus. Phase space calculations are presented for the proton-pair three-body final state and for final states with larger number of particles. The Two Armed Spectrometer System (TASS) is described in detail. The data suggest the possibility of isolating an interaction with one or two nucleons in the nucleus which may have momenta far in excess of those described in a Fermi gas model

  1. Emergence of Financial Intermediaries in Electronic Markets: The Case of Online P2P Lending

    Directory of Open Access Journals (Sweden)

    Sven C. Berger

    2009-05-01

    Full Text Available We analyze the role of intermediaries in electronic markets using detailed data of more than 14,000 originated loans on an electronic P2P (peer-to-peer lending platform. In such an electronic credit market, lenders bid to supply a private loan. Screening of potential borrowers and the monitoring of loan repayment can be delegated to designated group leaders. We find that these market participants act as financial intermediaries and significantly improve borrowers' credit conditions by reducing information asymmetries, predominantly for borrowers with less attractive risk characteristics. Our findings may be surprising given the replacement of a bank by an electronic marketplace.

  2. Nuclear transparency in 90 deg.c.m. quasielastic A(p,2p) reactions

    International Nuclear Information System (INIS)

    Aclander, J.; Alster, J.; Kosonovsky, I.; Malki, A.; Mardor, I.; Mardor, Y.; Navon, I.; Piasetzky, E.; Asryan, G.; Barton, D.S.; Buktoyarova, N.; Bunce, G.; Carroll, A.S.; Gushue, S.; Makdisi, Y.I.; Roser, T.; Tanaka, M.; Averiche, Y.; Panebratsev, Y.; Shimanskiy, S.

    2004-01-01

    We summarize the results of two experimental programs at the Alternating Gradient Synchrotron of BNL to measure the nuclear transparency of nuclei measured in the A(p,2p) quasielastic scattering process near 90 deg. in the pp center of mass. The incident momenta varied from 5.9 to 14.4 GeV/c, corresponding to 4.8 2 2 . Taking into account the motion of the target proton in the nucleus, the effective incident momenta extended from 5.0 to 15.8 GeV/c. First, we describe the measurements with the newer experiment, E850, which had more complete kinematic definition of quasielastic events. E850 covered a larger range of incident momenta, and thus provided more information regarding the nature of the energy dependence of the nuclear transparency. In E850 the angular dependence of the nuclear transparency near 90 deg. and the nuclear transparency deuterons were studied. Second, we review the techniques used in an earlier experiment, E834, and show that the two experiments are consistent for the carbon data. E834 also determines the nuclear transparencies for lithium, aluminum, copper, and lead nuclei as well as for carbon. A determination of the (π + ,π + p) transparencies is also reported. We find for both E850 and E834 that the A(p,2p) nuclear transparency, unlike that for A(e,e ' p) nuclear transparency, is incompatible with a constant value versus energy as predicted by Glauber calculations. The A(p,2p) nuclear transparency for carbon and aluminum increases by a factor of two between 5.9 and 9.5 GeV/c incident proton momentum. At its peak the A(p,2p) nuclear transparency is ∼80% of the constant A(e,e ' p) nuclear transparency. Then the nuclear transparency falls back to a value at least as small as that at 5.9 GeV/c, and is compatible with the Glauber level again. This oscillating behavior is generally interpreted as an interplay between two components of the pN scattering amplitude; one short ranged and perturbative, and the other long ranged and strongly absorbed

  3. (p,2p) study of high-momentum components at 2. 1 GeV

    Energy Technology Data Exchange (ETDEWEB)

    Treuhaft, R.N.

    1982-07-01

    A (p,2p) experiment designed to isolate interactions with small numbers of fast nuclear constituents is described. Special attention is paid to the experimental manifestation and description of a correlated pair of nucleons in the nucleus. Phase space calculations are presented for the proton-pair three-body final state and for final states with larger number of particles. The Two Armed Spectrometer System (TASS) is described in detail. The data suggest the possibility of isolating an interaction with one or two nucleons in the nucleus which may have momenta far in excess of those described in a Fermi gas model.

  4. Determinants of default in p2p lending: the Mexican case

    Directory of Open Access Journals (Sweden)

    Carlos Eduardo Canfield

    2018-03-01

    Full Text Available P2P lending is a new method of informal finance that uses the internet to directly connect borrowers with on-line communities. With a unique dataset provided by Prestadero, the largest on-line lending platform with national presence in Mexico, this research explores the effect of credit scores and other variables related to loan and borrower´s traits, in determining default behavior in P2P lending. Moreover, using a logistic regression model, it tested whether investors might benefit from screening loan applicants by gender after controlling for loan quality. The results showed that information provided by the platform is relevant for analyzing credit risk, yet not conclusive. In congruence with the literature, on a scale going from the safest to the riskiest, loan quality is positively associated with default behavior. Other determinants for increasing the odds of default are the payment-to-income ratio and refinancing on the same platform. On the contrary loan purpose and being a female applicant reduce such odds. No categorical evidence for differential default behavior was found for gender´s case-discrimination, under equal credit conditions. However it was found that controlling for loan quality, women have longer loan survival times than men. This is one of the first studies about debt crowdfunding in Latin America and Mexico. Implications for lenders, researchers and policy-makers are also discussed.

  5. A P2P Framework for Developing Bioinformatics Applications in Dynamic Cloud Environments

    Directory of Open Access Journals (Sweden)

    Chun-Hung Richard Lin

    2013-01-01

    Full Text Available Bioinformatics is advanced from in-house computing infrastructure to cloud computing for tackling the vast quantity of biological data. This advance enables large number of collaborative researches to share their works around the world. In view of that, retrieving biological data over the internet becomes more and more difficult because of the explosive growth and frequent changes. Various efforts have been made to address the problems of data discovery and delivery in the cloud framework, but most of them suffer the hindrance by a MapReduce master server to track all available data. In this paper, we propose an alternative approach, called PRKad, which exploits a Peer-to-Peer (P2P model to achieve efficient data discovery and delivery. PRKad is a Kademlia-based implementation with Round-Trip-Time (RTT as the associated key, and it locates data according to Distributed Hash Table (DHT and XOR metric. The simulation results exhibit that our PRKad has the low link latency to retrieve data. As an interdisciplinary application of P2P computing for bioinformatics, PRKad also provides good scalability for servicing a greater number of users in dynamic cloud environments.

  6. Characterizing the Global Impact of P2P Overlays on the AS-Level Underlay

    Science.gov (United States)

    Rasti, Amir Hassan; Rejaie, Reza; Willinger, Walter

    This paper examines the problem of characterizing and assessing the global impact of the load imposed by a Peer-to-Peer (P2P) overlay on the AS-level underlay. In particular, we capture Gnutella snapshots for four consecutive years, obtain the corresponding AS-level topology snapshots of the Internet and infer the AS-paths associated with each overlay connection. Assuming a simple model of overlay traffic, we analyze the observed load imposed by these Gnutella snapshots on the AS-level underlay using metrics that characterize the load seen on individual AS-paths and by the transit ASes, illustrate the churn among the top transit ASes during this 4-year period, and describe the propagation of traffic within the AS-level hierarchy.

  7. Energy Dependence of Nuclear Transparency in C (p,2p) Scattering

    Science.gov (United States)

    Leksanov, A.; Alster, J.; Asryan, G.; Averichev, Y.; Barton, D.; Baturin, V.; Bukhtoyarova, N.; Carroll, A.; Heppelmann, S.; Kawabata, T.; Makdisi, Y.; Malki, A.; Minina, E.; Navon, I.; Nicholson, H.; Ogawa, A.; Panebratsev, Yu.; Piasetzky, E.; Schetkovsky, A.; Shimanskiy, S.; Tang, A.; Watson, J. W.; Yoshida, H.; Zhalov, D.

    2001-11-01

    The transparency of carbon for (p,2p) quasielastic events was measured at beam momenta ranging from 5.9 to 14.5 GeV/c at 90° c.m. The four-momentum transfer squared (Q2) ranged from 4.7 to 12.7 (GeV/c)2. We present the observed beam momentum dependence of the ratio of the carbon to hydrogen cross sections. We also apply a model for the nuclear momentum distribution of carbon to obtain the nuclear transparency. We find a sharp rise in transparency as the beam momentum is increased to 9 GeV/c and a reduction to approximately the Glauber level at higher energies.

  8. Quasifree (p , 2 p ) Reactions on Oxygen Isotopes: Observation of Isospin Independence of the Reduced Single-Particle Strength

    Science.gov (United States)

    Atar, L.; Paschalis, S.; Barbieri, C.; Bertulani, C. A.; Díaz Fernández, P.; Holl, M.; Najafi, M. A.; Panin, V.; Alvarez-Pol, H.; Aumann, T.; Avdeichikov, V.; Beceiro-Novo, S.; Bemmerer, D.; Benlliure, J.; Boillos, J. M.; Boretzky, K.; Borge, M. J. G.; Caamaño, M.; Caesar, C.; Casarejos, E.; Catford, W.; Cederkall, J.; Chartier, M.; Chulkov, L.; Cortina-Gil, D.; Cravo, E.; Crespo, R.; Dillmann, I.; Elekes, Z.; Enders, J.; Ershova, O.; Estrade, A.; Farinon, F.; Fraile, L. M.; Freer, M.; Galaviz Redondo, D.; Geissel, H.; Gernhäuser, R.; Golubev, P.; Göbel, K.; Hagdahl, J.; Heftrich, T.; Heil, M.; Heine, M.; Heinz, A.; Henriques, A.; Hufnagel, A.; Ignatov, A.; Johansson, H. T.; Jonson, B.; Kahlbow, J.; Kalantar-Nayestanaki, N.; Kanungo, R.; Kelic-Heil, A.; Knyazev, A.; Kröll, T.; Kurz, N.; Labiche, M.; Langer, C.; Le Bleis, T.; Lemmon, R.; Lindberg, S.; Machado, J.; Marganiec-Gałązka, J.; Movsesyan, A.; Nacher, E.; Nikolskii, E. Y.; Nilsson, T.; Nociforo, C.; Perea, A.; Petri, M.; Pietri, S.; Plag, R.; Reifarth, R.; Ribeiro, G.; Rigollet, C.; Rossi, D. M.; Röder, M.; Savran, D.; Scheit, H.; Simon, H.; Sorlin, O.; Syndikus, I.; Taylor, J. T.; Tengblad, O.; Thies, R.; Togano, Y.; Vandebrouck, M.; Velho, P.; Volkov, V.; Wagner, A.; Wamers, F.; Weick, H.; Wheldon, C.; Wilson, G. L.; Winfield, J. S.; Woods, P.; Yakorev, D.; Zhukov, M.; Zilges, A.; Zuber, K.; R3B Collaboration

    2018-01-01

    Quasifree one-proton knockout reactions have been employed in inverse kinematics for a systematic study of the structure of stable and exotic oxygen isotopes at the R3B /LAND setup with incident beam energies in the range of 300 - 450 MeV /u . The oxygen isotopic chain offers a large variation of separation energies that allows for a quantitative understanding of single-particle strength with changing isospin asymmetry. Quasifree knockout reactions provide a complementary approach to intermediate-energy one-nucleon removal reactions. Inclusive cross sections for quasifree knockout reactions of the type O A (p ,2 p )N-1A have been determined and compared to calculations based on the eikonal reaction theory. The reduction factors for the single-particle strength with respect to the independent-particle model were obtained and compared to state-of-the-art ab initio predictions. The results do not show any significant dependence on proton-neutron asymmetry.

  9. Las simulaciones, una alternativa para el estudio de los protocolos P2P

    Directory of Open Access Journals (Sweden)

    Armando de Jesús Ruiz Calderón

    2015-12-01

    Full Text Available La arquitectura y funcionalidad de las redes P2P hacen que sean atractivas para ser utilizadas en ambientes distribuidos locales y aplicaciones de amplia distribución, el análisis de sus protocolos de ruteo bajo diferentes ataques como son los de negación de existencia y de servicio, así como su análisis estadístico, hacen que las simulaciones cobren gran importancia, y sean una alternativa adecuada para su estudio, pues existen varios protocolos de esta categoría como Pastry o Chord, los cuales son de gran importancia dada su amplia utilización en diferentes aplicaciones para el envío y recuperación satisfactoria de información tanto en la nube como en aplicaciones distribuidas, razón por la cual su análisis es importante, este trabajo se centra en Pastry dado que es utilizado en la versión Azure de Microsoft Windows.

  10. Measurement of color transparency by C(p,2p) reactions at large momentum transfer

    International Nuclear Information System (INIS)

    Carroll, A.S.

    1997-12-01

    The subject of color transparency, the enhancement of the ability of hadrons to penetrate nuclear matter by kinematic selection, is both interesting and controversial. The description of the collision of hadrons with nucleons inside nuclei, and the connection with initial and final state interactions involve fundamental questions of quantum mechanics, and nuclear and particle physics. Interest in color transparency was greatly increased by AGS Experiment 834 which observed dramatic changes with incident momentum for a variety of nuclei. A new experiment, E850, has studied the (p,2p) quasi-elastic reaction near 90 degree cm for momenta between 5.9 and 9 GeV/c. The quasi-elastic reaction was compared to the elastic reaction on free protons to determine the transparency. With limited statistics, but with better kinematic definition in a new detector, the authors have confirmed the rise in Carbon transparency ratio seen in Expt 834. The Tr(D/H) for deuterium is consistent with no energy dependence. Unlike the free dσ/dt for hydrogen, the dσ/dt from protons in a nucleus is consistent with the exact s -10 scaling. This suggests two components to the pp scattering amplitude; one small and perturbative, the other spatially large and varying, but filtered away by the nuclear matter in the Carbon nucleus. The plan is to complete the repairs of the superconducting solenoid early this fall, reassemble the detector, and collect data starting next spring

  11. Enhancing Scalability in On-Demand Video Streaming Services for P2P Systems

    Directory of Open Access Journals (Sweden)

    R. Arockia Xavier Annie

    2012-01-01

    Full Text Available Recently, many video applications like video telephony, video conferencing, Video-on-Demand (VoD, and so forth have produced heterogeneous consumers in the Internet. In such a scenario, media servers play vital role when a large number of concurrent requests are sent by heterogeneous users. Moreover, the server and distributed client systems participating in the Internet communication have to provide suitable resources to heterogeneous users to meet their requirements satisfactorily. The challenges in providing suitable resources are to analyze the user service pattern, bandwidth and buffer availability, nature of applications used, and Quality of Service (QoS requirements for the heterogeneous users. Therefore, it is necessary to provide suitable techniques to handle these challenges. In this paper, we propose a framework for peer-to-peer- (P2P- based VoD service in order to provide effective video streaming. It consists of four functional modules, namely, Quality Preserving Multivariate Video Model (QPMVM for efficient server management, tracker for efficient peer management, heuristic-based content distribution, and light weight incentivized sharing mechanism. The first two of these modules are confined to a single entity of the framework while the other two are distributed across entities. Experimental results show that the proposed framework avoids overloading the server, increases the number of clients served, and does not compromise on QoS, irrespective of the fact that the expected framework is slightly reduced.

  12. Review of Brookhaven nuclear transparency measurements in (p, 2p) reactions at large Q2

    International Nuclear Information System (INIS)

    Carroll, Alan S.

    2003-01-01

    In this contribution we summarize the results of two experiments to measure the transparency of nuclei in the (p, 2p) quasi-elastic scattering process near 90 deg in the pp center-of-mass. The incident momenta went from 6 to 14.4 GeV/c, corresponding to 4.8 2 2 . First, we describe the measurements with the newer experiment, E850, which has more complete kinematic definition of quasi-elastic events. E850 covers a larger range of incident momenta, and thus provides more information regarding the nature of the unexpected fall in the transparency above 9 GeV/c. Second, we review the techniques used in an earlier experiment, E834, and show that the two experiments are consistent for the carbon data. We use the transparencies measured in the five nuclei from Li to Pb to set limits on the rate of expansion for protons involved in quasi-elastic scattering at large momentum transfer. (author)

  13. Advanced Polymer Network Structures

    Science.gov (United States)

    2016-02-01

    attractive interaction (n = 2.0) and a neutral interaction (n = 1.0); n is equal to unity for self-interactions among the monomers of first network and...... Network Structures by Robert Lambeth, Joseph Lenhart, and Tim Sirk Weapons and Materials Research Directorate, ARL Yelena Sliozberg TKC Global

  14. Quasifree (p, 2p) Reactions on Oxygen Isotopes: Observation of Isospin Independence of the Reduced Single-Particle Strength.

    Science.gov (United States)

    Atar, L; Paschalis, S; Barbieri, C; Bertulani, C A; Díaz Fernández, P; Holl, M; Najafi, M A; Panin, V; Alvarez-Pol, H; Aumann, T; Avdeichikov, V; Beceiro-Novo, S; Bemmerer, D; Benlliure, J; Boillos, J M; Boretzky, K; Borge, M J G; Caamaño, M; Caesar, C; Casarejos, E; Catford, W; Cederkall, J; Chartier, M; Chulkov, L; Cortina-Gil, D; Cravo, E; Crespo, R; Dillmann, I; Elekes, Z; Enders, J; Ershova, O; Estrade, A; Farinon, F; Fraile, L M; Freer, M; Galaviz Redondo, D; Geissel, H; Gernhäuser, R; Golubev, P; Göbel, K; Hagdahl, J; Heftrich, T; Heil, M; Heine, M; Heinz, A; Henriques, A; Hufnagel, A; Ignatov, A; Johansson, H T; Jonson, B; Kahlbow, J; Kalantar-Nayestanaki, N; Kanungo, R; Kelic-Heil, A; Knyazev, A; Kröll, T; Kurz, N; Labiche, M; Langer, C; Le Bleis, T; Lemmon, R; Lindberg, S; Machado, J; Marganiec-Gałązka, J; Movsesyan, A; Nacher, E; Nikolskii, E Y; Nilsson, T; Nociforo, C; Perea, A; Petri, M; Pietri, S; Plag, R; Reifarth, R; Ribeiro, G; Rigollet, C; Rossi, D M; Röder, M; Savran, D; Scheit, H; Simon, H; Sorlin, O; Syndikus, I; Taylor, J T; Tengblad, O; Thies, R; Togano, Y; Vandebrouck, M; Velho, P; Volkov, V; Wagner, A; Wamers, F; Weick, H; Wheldon, C; Wilson, G L; Winfield, J S; Woods, P; Yakorev, D; Zhukov, M; Zilges, A; Zuber, K

    2018-02-02

    Quasifree one-proton knockout reactions have been employed in inverse kinematics for a systematic study of the structure of stable and exotic oxygen isotopes at the R^{3}B/LAND setup with incident beam energies in the range of 300-450  MeV/u. The oxygen isotopic chain offers a large variation of separation energies that allows for a quantitative understanding of single-particle strength with changing isospin asymmetry. Quasifree knockout reactions provide a complementary approach to intermediate-energy one-nucleon removal reactions. Inclusive cross sections for quasifree knockout reactions of the type ^{A}O(p,2p)^{A-1}N have been determined and compared to calculations based on the eikonal reaction theory. The reduction factors for the single-particle strength with respect to the independent-particle model were obtained and compared to state-of-the-art ab initio predictions. The results do not show any significant dependence on proton-neutron asymmetry.

  15. Analysis and Implementation of Gossip-Based P2P Streaming with Distributed Incentive Mechanisms for Peer Cooperation

    Directory of Open Access Journals (Sweden)

    Sachin Agarwal

    2007-10-01

    Full Text Available Peer-to-peer (P2P systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute bandwidth to other peers. We prove that an incentive mechanism can be created for a live streaming P2P protocol while preserving the asymptotic properties of randomized gossip-based streaming. In order to show the utility of our result, we adapt a distributed incentive scheme from P2P file storage literature to the live streaming scenario. We provide simulation results that confirm the ability to achieve a constant download rate (in time, per peer that is needed for streaming applications on peers. The incentive scheme fairly differentiates peers' download rates according to the amount of useful bandwidth they contribute back to the P2P system, thus creating a powerful quality-of-service incentive for peers to contribute bandwidth to other peers. We propose a functional architecture and protocol format for a gossip-based streaming system with incentive mechanisms, and present evaluation data from a real implementation of a P2P streaming application.

  16. A 2-layer and P2P-based architecture on resource location in future grid environment

    International Nuclear Information System (INIS)

    Pei Erming; Sun Gongxin; Zhang Weiyi; Pang Yangguang; Gu Ming; Ma Nan

    2004-01-01

    Grid and Peer-to-Peer computing are two distributed resource sharing environments developing rapidly in recent years. The final objective of Grid, as well as that of P2P technology, is to pool large sets of resources effectively to be used in a more convenient, fast and transparent way. We can speculate that, though many difference exists, Grid and P2P environments will converge into a large scale resource sharing environment that combines the characteristics of the two environments: large diversity, high heterogeneity (of resources), dynamism, and lack of central control. Resource discovery in this future Grid environment is a basic however, important problem. In this article. We propose a two-layer and P2P-based architecture for resource discovery and design a detailed algorithm for resource request propagation in the computing environment discussed above. (authors)

  17. An Effective Interval-Valued Intuitionistic Fuzzy Entropy to Evaluate Entrepreneurship Orientation of Online P2P Lending Platforms

    Directory of Open Access Journals (Sweden)

    Xiaohong Chen

    2013-01-01

    Full Text Available This paper describes an approach to measure the entrepreneurship orientation of online P2P lending platforms. The limitations of existing methods for calculating entropy of interval-valued intuitionistic fuzzy sets (IVIFSs are significantly improved by a new entropy measure of IVIFS considered in this paper, and then the essential properties of the proposed entropy are introduced. Moreover, an evaluation procedure is proposed to measure entrepreneurship orientation of online P2P lending platforms. Finally, a case is used to demonstrate the effectiveness of this method.

  18. Crossed molecular beam-tunable laser determination of velocity dependence of intramultiplet mixing: K(4p2P1/2)+He →K(4p2P3/2)+He

    International Nuclear Information System (INIS)

    Anderson, R.W.; Goddard, T.P.; Parravano, C.; Warner, J.

    1976-01-01

    The velocity dependence of intramultiplet mixing, K(4p 2 P 1 / 2 ) +He→K(4p 2 P 3 / 2 )+He, has been measured over the relative velocity range v=1.3--3.4 km/sec. The cross section appears to fit a linear function Q (v) =A (v-v 0 ), where a=6.3 x 10 -4 A 2 and v 0 = 7.9 x 10 4 cm/sec. The value of A is obtained by normalization to the literature thermal average cross section. The intramultiplet mixing theory of Nikitin is modified to yield Q (v) for the process. The modified theory correctly exhibits detailed balancing, and it is normalized to provide a very good fit to the observed Q (v). The magnitude of the normalization factor, however, is larger than that predicted from recent pseudopotential calculations of the excited state potentials. The temperature dependence of intramultiplet mixing is predicted. The use of laser polarization to determine the m/subj/ dependence of the process K(4p 2 P 3 / 2 +He→K(4p 2 P 1 / 2 )+He and other collision processes of excited 2 P 3 / 2 states is examined

  19. Evolving production network structures

    DEFF Research Database (Denmark)

    Grunow, Martin; Gunther, H.O.; Burdenik, H.

    2007-01-01

    When deciding about future production network configurations, the current structures have to be taken into account. Further, core issues such as the maturity of the products and the capacity requirements for test runs and ramp-ups must be incorporated. Our approach is based on optimization...... modelling and assigns products and capacity expansions to production sites under the above constraints. It also considers the production complexity at the individual sites and the flexibility of the network. Our implementation results for a large manufacturing network reveal substantial possible cost...

  20. StreetTiVo: Using a P2P XML Database System to Manage Multimedia Data in Your Living Room

    NARCIS (Netherlands)

    Zhang, Ying; de Vries, A.P.; Boncz, P.; Hiemstra, Djoerd; Ordelman, Roeland J.F.; Li, Qing; Feng, Ling; Pei, Jian; Wang, Sean X.

    StreetTiVo is a project that aims at bringing research results into the living room; in particular, a mix of current results in the areas of Peer-to-Peer XML Database Management System (P2P XDBMS), advanced multimedia analysis techniques, and advanced information re- trieval techniques. The project

  1. ChordMR: A P2P-based Job Management Scheme in Cloud

    OpenAIRE

    Jiagao Wu; Hang Yuan; Ying He; Zhiqiang Zou

    2014-01-01

    MapReduce is a programming model and an associated implementation for processing parallel data, which is widely used in Cloud computing environments. However, the traditional MapReduce system is based on a centralized master-slave structure. While, along with the increase of the number of MapReduce jobs submitted and system scale, the master node will become the bottleneck of the system. To improve this problem, we have proposed a new MapReduce system named ChordMR, which is designed to use a...

  2. KaZaA and similar Peer-to-Peer (P2P) file-sharing applications

    CERN Multimedia

    2003-01-01

    Personal use of Peer-to-Peer (P2P) file sharing applications is NOT permitted at CERN. A non-exhaustive list of such applications, popular for exchanging music, videos, software etc, is: KaZaA, Napster, Gnutella, Edonkey2000, Napigator, Limewire, Bearshare, WinMX, Aimster, Morpheus, BitTorrent, ... You are reminded that use of CERN's Computing Facilities is governed by CERN's Computing Rules (Operational Circular No 5). They require that all users of CERN's Computing Facilities respect copyright, license and confidentiality agreements for data of any form (software, music, videos, etc). Sanctions are applicable in case of non-respect of the Computing Rules. Further details on restrictions for P2P applications are at: http://cern.ch/security/file-sharing CERN's Computing Rules are at: http://cern.ch/ComputingRules Denise Heagerty, CERN Computer Security Officer, Computer.Security@cern.ch

  3. Bottomonium spectroscopy and radiative transitions involving the chi(bJ)(1P, 2P) states at BABAR

    NARCIS (Netherlands)

    Lees, J. P.; Poireau, V.; Tisserand, V.; Grauges, E.; Palano, A.; Eigen, G.; Stugu, B.; Brown, D. N.; Kerth, L. T.; Kolomensky, Yu. G.; Lynch, G.; Schroeder, T.; Hearty, C.; Mattison, T. S.; McKenna, J. A.; So, R. Y.; Khan, A.; Blinov, V. E.; Buzykaev, A. R.; Druzhinin, V. P.; Golubev, V. B.; Kravchenko, E. A.; Onuchin, A. P.; Serednyakov, S. I.; Skovpen, Yu. I.; Solodov, E. P.; Todyshev, K. Yu.; Lankford, A. J.; Mandelkern, M.; Dey, B.; Gary, J. W.; Long, O.; Campagnari, C.; Sevilla, M. Franco; Hong, T. M.; Kovalskyi, D.; Richman, J. D.; West, C. A.; Eisner, A. M.; Lockman, W. S.; Vazquez, W. Panduro; Schumm, B. A.; Seiden, A.; Chao, D. S.; Echenard, B.; Flood, K. T.; Hitlin, D. G.; Miyashita, T. S.; Ongmongkolkul, P.; Roehrken, M.; Andreassen, R.; Huard, Z.; Meadows, B. T.; Pushpawela, B. G.; Sokoloff, M. D.; Sun, L.; Bloom, P. C.; Ford, W. T.; Gaz, A.; Smith, J. G.; Wagner, S. R.; Ayad, R.; Toki, W. H.; Spaan, B.; Bernard, D.; Verderi, M.; Playfer, S.; Bettoni, D.; Bozzi, C.; Calabrese, R.; Cibinetto, G.; Fioravanti, E.; Garzia, I.; Luppi, E.; Piemontese, L.; Santoro, V.; Calcaterra, A.; de Sangro, R.; Finocchiaro, G.; Martellotti, S.; Patteri, P.; Peruzzi, I. M.; Piccolo, M.; Rama, M.; Zallo, A.; Contri, R.; Lo Vetere, M.; Monge, M. R.; Passaggio, S.; Patrignani, C.; Robutti, E.; Bhuyan, B.; Prasad, V.; Adametz, A.; Uwer, U.; Lacker, M.; Dauncey, P. D.; Mallik, U.; Cochran, J.; Prell, S.; Ahmed, H.; Gritsan, A. V.; Arnaud, N.; Davier, M.; Derkach, D.; Grosdidier, G.; Le Diberder, F.; Lutz, A. M.; Malaescu, B.; Roudeau, P.; Stocchi, A.; Wormser, G.; Lange, D. J.; Wright, D. M.; Coleman, J. P.; Fry, J. R.; Gabathuler, E.; Hutchcroft, D. E.; Payne, D. J.; Touramanis, C.; Bevan, A. J.; Di Lodovico, F.; Sacco, R.; Cowan, G.; Bougher, J.; Brown, D. N.; Davis, C. L.; Denig, A. G.; Fritsch, M.; Gradl, W.; Griessinger, K.; Hafner, A.; Schubert, K. R.; Barlow, R. J.; Lafferty, G. D.; Cenci, R.; Hamilton, B.; Jawahery, A.; Roberts, D. A.; Cowan, R.; Sciolla, G.; Cheaib, R.; Patel, P. M.; Robertson, S. H.; Neri, N.; Palombo, F.; Cremaldi, L.; Godang, R.; Sonnek, P.; Summers, D. J.; Simard, M.; Taras, P.; De Nardo, G.; Onorato, G.; Sciacca, C.; Martinelli, M.; Raven, G.; Jessop, C. P.; LoSecco, J. M.; Honscheid, K.; Kass, R.; Feltresi, E.; Margoni, M.; Morandin, M.; Posocco, M.; Rotondo, M.; Simi, G.; Simonetto, F.; Stroili, R.; Akar, S.; Ben-Haim, E.; Bomben, M.; Bonneaud, G. R.; Briand, H.; Calderini, G.; Chauveau, J.; Leruste, Ph.; Marchiori, G.; Ocariz, J.; Biasini, M.; Manoni, E.; Pacetti, S.; Rossi, A.; Angelini, C.; Batignani, G.; Bettarini, S.; Carpinelli, M.; Casarosa, G.; Cervelli, A.; Chrzaszcz, M.; Forti, F.; Giorgi, M. A.; Lusiani, A.; Oberhof, B.; Paoloni, E.; Perez, A.; Rizzo, G.; Walsh, J. J.; Pegna, D. Lopes; Olsen, J.; Smith, A. J. S.; Faccini, R.; Ferrarotto, F.; Ferroni, F.; Gaspero, M.; Gioi, L. Li; Pilloni, A.; Piredda, G.; Buenger, C.; Dittrich, S.; Gruenber, O.; Hess, M.; Leddig, T.; Voss, C.; Waldi, R.; Adye, T.; Olaiya, E. O.; Wilson, F. F.; Emery, S.; Vasseur, G.; Anulli, F.; Aston, D.; Bard, D. J.; Cartaro, C.; Convery, M. R.; Dorfan, J.; Dubois-Felsmann, G. P.; Dunwoodie, W.; Ebert, M.; Field, R. C.; Fulsom, B. G.; Graham, M. T.; Hast, C.; Innes, W. R.; Kim, P.; Leith, D. W. G. S.; Lewis, P.; Lindemann, D.; Luitz, S.; Luth, V.; Lynch, H. L.; MacFarlane, D. B.; Muller, D. R.; Neal, H.; Perl, M.; Pulliam, T.; Ratcliff, B. N.; Roodman, A.; Salnikov, A. A.; Schindler, R. H.; Snyder, A.; Su, D.; Sullivan, M. K.; Va'vra, J.; Wisniewski, W. J.; Wulsin, H. W.; Purohit, M. V.; White, R. M.; Wilson, J. R.; Randle-Conde, A.; Sekula, S. J.; Bellis, M.; Burchat, P. R.; Puccio, E. M. T.; Alam, M. S.; Ernst, J. A.; Gorodeisky, R.; Guttman, N.; Peimer, D. R.; Soffer, A.; Spanier, S. M.; Ritchie, J. L.; Ruland, A. M.; Schwitters, R. F.; Wray, B. C.; Izen, J. M.; Lou, X. C.; Bianchi, F.; De Mori, F.; Filippi, A.; Gamba, D.; Lanceri, L.; Vitale, L.; Martinez-Vidal, F.; Oyanguren, A.; Villanueva-Perez, P.; Albert, J.; Banerjee, Sw.; Beaulieu, A.; Bernlochner, F. U.; Choi, H. H. F.; Kowalewski, R.; Lewczuk, M. J.; Lueck, T.; Nugent, I. M.; Roney, J. M.; Sobie, R. J.; Tasneem, N.; Gershon, T. J.; Harrison, P. F.; Latham, T. E.; Band, H. R.; Dasu, S.; Pan, Y.; Prepost, R.

    2014-01-01

    We use (121±1) million Υ(3S) and (98±1) million Υ(2S) mesons recorded by the BABAR detector at the PEP-II e+e− collider at SLAC to perform a study of radiative transitions involving the χbJ(1P,2P) states in exclusive decays with μ+μ−γγ final states. We reconstruct twelve channels in four cascades

  4. How signaling and search costs affect information asymmetry in P2P lending: the economics of big data

    OpenAIRE

    Yan, Jiaqi; Yu, Wayne; Zhao, J. Leon

    2015-01-01

    In the past decade, online Peer-to-Peer (P2P) lending platforms have transformed the lending industry, which has been historically dominated by commercial banks. Information technology breakthroughs such as big data-based financial technologies (Fintech) have been identified as important disruptive driving forces for this paradigm shift. In this paper, we take an information economics perspective to investigate how big data affects the transformation of the lending industry. By identifying ho...

  5. Patchworking Network Structures

    DEFF Research Database (Denmark)

    Norus, Jesper

    2004-01-01

    analyzes fourdifferent managerial strategies of how to create network structures to deal with theinterfaces between industry, university and public institutions. The research-orientedstrategy, the incubator strategy, the industrial-partnering strategy, and the policyorientedstrategy. The research...... groups has been treated as a contingent factor.However, little attention has been given to the managerial efforts that entrepreneurshave make to establish the fit between small firms, university research, and publicpolicies such as regulatory policies and R&D policies through network-type structures.......New biotechnology organizations are perfect objects to study these relationshipsbecause new biotechnologies and techniques predominantly come from the universitysector (Kenney, 1986; Yoxen; 1984; Zucker & Darby, 1997; Robbins-Roth, 2001).From the perspective of the small biotechnology firms (SBFs,) this paper...

  6. Absolute emission cross sections for electron-impact excitation of Zn+(4p 2P) and (5s 2S) terms

    International Nuclear Information System (INIS)

    Rogers, W.T.; Dunn, G.H.; Olsen, J.O.; Reading, M.; Stefani, G.

    1982-01-01

    Absolute emission cross sections for electron-impact excitation of the 3d 10 4p 2 P and 3d 10 5s 2 S terms of Zn + have been measured from below threshold to about 790 eV 2 P and 390 eV 2 S using the crossed-charged-beams technique. Both transitions have the abrupt onset at threshold characteristic of positive-ion excitation. The 2 P cross section shows considerable structure in the interval from threshold to near 20 eV, above which it falls off smoothly. Agreement with five-state close-coupling theory is excellent below 100 eV when cascading is included in the theory. Above 100 eV, the data lie above the theory. The peak value of the 2 P cross section is 9.4 x 10 -16 cm 2 essentially at threshold, while the peak value of the 2 S cross section is about 0.47 x 10 -16 cm 2 . The net linear polarization of the 3d 10 4p 2 P emission was measured (unresolved from the 3d 10 4d 2 D→3d 10 4p 2 P cascading transition), and these data were used to correct the cross-section data for anisotropy of the emitted light. The effective lifetime of the 3d 9 4s 2 2 D/sub 3/2/ level was measured by observing exponential decay of the 589.6-nm photons resulting from its decay

  7. [Network structures in biological systems].

    Science.gov (United States)

    Oleskin, A V

    2013-01-01

    Network structures (networks) that have been extensively studied in the humanities are characterized by cohesion, a lack of a central control unit, and predominantly fractal properties. They are contrasted with structures that contain a single centre (hierarchies) as well as with those whose elements predominantly compete with one another (market-type structures). As far as biological systems are concerned, their network structures can be subdivided into a number of types involving different organizational mechanisms. Network organization is characteristic of various structural levels of biological systems ranging from single cells to integrated societies. These networks can be classified into two main subgroups: (i) flat (leaderless) network structures typical of systems that are composed of uniform elements and represent modular organisms or at least possess manifest integral properties and (ii) three-dimensional, partly hierarchical structures characterized by significant individual and/or intergroup (intercaste) differences between their elements. All network structures include an element that performs structural, protective, and communication-promoting functions. By analogy to cell structures, this element is denoted as the matrix of a network structure. The matrix includes a material and an immaterial component. The material component comprises various structures that belong to the whole structure and not to any of its elements per se. The immaterial (ideal) component of the matrix includes social norms and rules regulating network elements' behavior. These behavioral rules can be described in terms of algorithms. Algorithmization enables modeling the behavior of various network structures, particularly of neuron networks and their artificial analogs.

  8. vhv supply networks, problems of network structure

    Energy Technology Data Exchange (ETDEWEB)

    Raimbault, J

    1966-04-01

    The present and future power requirements of the Paris area and the structure of the existing networks are discussed. The various limitations that will have to be allowed for to lay down the structure of a regional transmission network leading in the power of the large national transmission network to within the Paris built up area are described. The theoretical solution that has been adopted, and the features of its final achievement, which is planned for about the year 2000, and the intermediate stages are given. The problem of the structure of the National Power Transmission network which is to supply the regional network was studied. To solve this problem, a 730 kV voltage network will have to be introduced.

  9. Can I trust you? : The importance of trust when doing business on P2P online platforms

    OpenAIRE

    Andersson, David; Kobaslic, Bojan

    2016-01-01

    This report has focused on how important a buyers eWOM is compared to his/her visual information when sellers decide if they can trust this buyer. A focus company was Airbnb, an online P2P platform where private individuals can rent out their living quarters to other private persons. The method involved sending out online web surveys to approximately 200 students in Högskolan Kristianstad. Results from these surveys suggests that a buyer’s eWOM and visual information had little or no impact u...

  10. Study of fission barriers in neutron-rich nuclei using the (p,2p) reaction. Status of SAMURAI-experiment NP1306 SAMURAI14

    Energy Technology Data Exchange (ETDEWEB)

    Reichert, Sebastian [TU Munich (Germany); Collaboration: NP1306-SAMURAI14-Collaboration

    2015-07-01

    Violent stellar processes are currently assumed to be a major origin of the elements beyond iron and their abundances. The conditions during stellar explosions lead to the so called r-process in which the rapid capture of neutrons and subsequent β decays form heavier elements. This extension of the nuclei stops at the point when the repulsive Coulomb energy induces fission. Its recycling is one key aspect to describe the macroscopic structure of the r-process and the well known elemental abundance pattern. The RIBF at RIKEN is able to provide such neutron rich heavy element beams and a first test with the primary beam {sup 238}U was performed to understand the response of the SAMURAI spectrometer and detectors for heavy beams. The final goal is the definition of the fission barrier height with a resolution of 1 MeV (in σ) using the missing mass method using (p,2p) reactions in inverse kinematics.

  11. Los nuevos modelos: una solución equilibrada a la problemática del P2P

    Directory of Open Access Journals (Sweden)

    Santiago Piñeros Durán

    2013-11-01

    Full Text Available Con la llegada de los intercambios ilegales de contenidos ocasionados por las redes P2P en internet, el derecho de autor ha demostrado debilidades sustanciales y procesales para proteger las prestaciones de los titulares de derechos en las redes digitales. Por esta razón se dio un desequilibrio en las economías de mercado de las industrias del entretenimiento a nivel mundial, quienes han optado por impulsar el reforzamiento de los esquemas de responsabilidad en contra de usuarios e IPS infractores, sin importar las implicaciones que ello supone para los consumidores de contenidos en la red y sus derechos fundamentales. Se prevé un esquema donde los nuevos modelos de negocio, licenciamiento y compensación, otorgados por las redes digitales y la cultura colectiva, demuestran que el derecho de autor puede servir como punto de balance para proteger los derechos de los titulares afectados, mientras prima la libertad de mercado en la red para difundir la cultura y la educación. Esto se concreta en un modelo de compensación alternativa que establece los parámetros en que debe funcionar el libre intercambio de contenidos con control y vigilancia estatales, a saber, el modelo Fisher.

  12. The 2H(p,2p)n reaction at 508 MeV. Part I

    International Nuclear Information System (INIS)

    Punjabi, V.; Perdrisat, C.F.; Aniol, K.A.; Epstein, M.B.; Huber, J.P.; Margaziotis, D.J.; Bracco, A.; Davis, C.A.; Gubler, H.P.; Lee, W.P.; Poffenberger, P.R.; van Oers, W.T.H.; Postma, H.; Sebel, H.J.; Stetz, A.W.

    1988-09-01

    Differential cross sections for the reaction 2 H(p,2p)n at T p = 507 and 508 MeV are presented. The proton angle pairs chosen were 41.5 degrees with 41.4 and 50.0, 30.1 degrees with 44.0, 53,75, 61.0, and 68.0, 38.1 degrees -38.0 degrees, 44.1 degrees - 44.0 degrees, 47.1 degrees - 47.0 degrees and 50.0 degrees - 50.0 degrees. The data range over an energy window 100 MeV wide on one of the proton energies, the second energy being defined by the kinematic condition of a single neutron recoiling. The data are compared with the impulse approximation (IA) prediction and with the results of a nonrelativistic calculation of the six lowest-order Feynman diagrams describing the reaction. A previously known missing strength for the reaction in the small neutron recoil region is confirmed with much smaller experimental uncertainty; the missing strength persists up to 150 MeV/c neutron recoil. The onset of a systematic section excess relative to the IA near neutron recoil momentum 200 MeV is explored in detail. (Author) (37 refs., 17 figs.)

  13. Metagovernance, network structure, and legitimacy

    DEFF Research Database (Denmark)

    Daugbjerg, Carsten; Fawcett, Paul

    2017-01-01

    This article develops a heuristic for comparative governance analysis. The heuristic depicts four network types by combining network structure with the state’s capacity to metagovern. It suggests that each network type produces a particular combination of input and output legitimacy. We illustrate...... the heuristic and its utility using a comparative study of agri-food networks (organic farming and land use) in four countries, which each exhibit different combinations of input and output legitimacy respectively. The article concludes by using a fifth case study to illustrate what a network type that produces...... high levels of input and output legitimacy might look like....

  14. Detecting Hierarchical Structure in Networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard

    2012-01-01

    Many real-world networks exhibit hierarchical organization. Previous models of hierarchies within relational data has focused on binary trees; however, for many networks it is unknown whether there is hierarchical structure, and if there is, a binary tree might not account well for it. We propose...... a generative Bayesian model that is able to infer whether hierarchies are present or not from a hypothesis space encompassing all types of hierarchical tree structures. For efficient inference we propose a collapsed Gibbs sampling procedure that jointly infers a partition and its hierarchical structure....... On synthetic and real data we demonstrate that our model can detect hierarchical structure leading to better link-prediction than competing models. Our model can be used to detect if a network exhibits hierarchical structure, thereby leading to a better comprehension and statistical account the network....

  15. Collective network for computer structures

    Science.gov (United States)

    Blumrich, Matthias A [Ridgefield, CT; Coteus, Paul W [Yorktown Heights, NY; Chen, Dong [Croton On Hudson, NY; Gara, Alan [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Hoenicke, Dirk [Ossining, NY; Takken, Todd E [Brewster, NY; Steinmacher-Burow, Burkhard D [Wernau, DE; Vranas, Pavlos M [Bedford Hills, NY

    2011-08-16

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

  16. European networks in structural integrity

    International Nuclear Information System (INIS)

    Crutzen, S.; Davies, M.; Hemsworth, B.; Hurst, R.; Kussmaul, K.

    1994-01-01

    Several institutions and electrical utilities in Europe, including the Joint Research Centre (JRC) have the capability to deal problems posed by the operation and ageing of structural components and with their structural integrity assessment. These institutions and the JRC have developed cooperative programmes now organised in networks. They include utilities, engineering companies, R and D laboratories and Regulatory Bodies. Networks are organised and managed like the successful PISC programme: The Institute for Advanced Materials of JRC plays the role of Operating Agent and Manager of these networks: ENIQ, AMES, NESC, each of them dealing with a specific aspect of fitness for purpose of materials in structural components. There exist strong links between the networks and EC Working Groups on Structural Integrity Codes and Standards. (orig.)

  17. Inferring network structure from cascades

    Science.gov (United States)

    Ghonge, Sushrut; Vural, Dervis Can

    2017-07-01

    Many physical, biological, and social phenomena can be described by cascades taking place on a network. Often, the activity can be empirically observed, but not the underlying network of interactions. In this paper we offer three topological methods to infer the structure of any directed network given a set of cascade arrival times. Our formulas hold for a very general class of models where the activation probability of a node is a generic function of its degree and the number of its active neighbors. We report high success rates for synthetic and real networks, for several different cascade models.

  18. Structural principles in network glasses

    International Nuclear Information System (INIS)

    Boolchand, P.

    1986-01-01

    Substantial progress in decoding the structure of network glasses has taken place in the past few years. Crucial insights into the molecular structure of glasses have emerged by application of Raman bond and Moessbauer site spectroscopy. In this context, the complimentary role of each spectroscopy as a check on the interpretation of the other, is perhaps one of the more significant developments in the field. New advances in the theory of the subject have also taken place. It is thus appropriate to inquire what general principles if any, have emerged on the structure of real glasses. The author reviews some of the principal ideas on the structure of inorganic network glasses with the aid of specific examples. (Auth.)

  19. Communication on the structure of biological networks

    Indian Academy of Sciences (India)

    Introduction. Over the past few years, network science has drawn attention from a large number of ... The qualitative properties of biological networks cannot ... Here, we study the underlying undirected structure of empirical biological networks.

  20. From network structure to network reorganization: implications for adult neurogenesis

    International Nuclear Information System (INIS)

    Schneider-Mizell, Casey M; Zochowski, Michal R; Sander, Leonard M; Parent, Jack M; Ben-Jacob, Eshel

    2010-01-01

    Networks can be dynamical systems that undergo functional and structural reorganization. One example of such a process is adult hippocampal neurogenesis, in which new cells are continuously born and incorporate into the existing network of the dentate gyrus region of the hippocampus. Many of these introduced cells mature and become indistinguishable from established neurons, joining the existing network. Activity in the network environment is known to promote birth, survival and incorporation of new cells. However, after epileptogenic injury, changes to the connectivity structure around the neurogenic niche are known to correlate with aberrant neurogenesis. The possible role of network-level changes in the development of epilepsy is not well understood. In this paper, we use a computational model to investigate how the structural and functional outcomes of network reorganization, driven by addition of new cells during neurogenesis, depend on the original network structure. We find that there is a stable network topology that allows the network to incorporate new neurons in a manner that enhances activity of the persistently active region, but maintains global network properties. In networks having other connectivity structures, new cells can greatly alter the distribution of firing activity and destroy the initial activity patterns. We thus find that new cells are able to provide focused enhancement of network only for small-world networks with sufficient inhibition. Network-level deviations from this topology, such as those caused by epileptogenic injury, can set the network down a path that develops toward pathological dynamics and aberrant structural integration of new cells

  1. Structural constraints in complex networks

    International Nuclear Information System (INIS)

    Zhou, S; Mondragon, R J

    2007-01-01

    We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich-club connectivity are preserved. We consider three real networks, the autonomous system (AS)-Internet, protein interaction and scientific collaboration. We show that for a given degree distribution, the rich-club connectivity is sensitive to the degree-degree correlation, and on the other hand the degree-degree correlation is constrained by the rich-club connectivity. In particular, in the case of the Internet, the assortative coefficient is always negative and a minor change in its value can reverse the network's rich-club structure completely; while fixing the degree distribution and the rich-club connectivity restricts the assortative coefficient to such a narrow range, that a reasonable model of the Internet can be produced by considering mainly the degree distribution and the rich-club connectivity. We also comment on the suitability of using the maximal random network as a null model to assess the rich-club connectivity in real networks

  2. Structural Analysis of Complex Networks

    CERN Document Server

    Dehmer, Matthias

    2011-01-01

    Filling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Applications to biology, chemistry, linguistics, and data analysis are emphasized. The book is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science,

  3. Isotope shift of 40,42,44,48Ca in the 4s 2S1/2 → 4p 2P3/2 transition

    Science.gov (United States)

    Gorges, C.; Blaum, K.; Frömmgen, N.; Geppert, Ch; Hammen, M.; Kaufmann, S.; Krämer, J.; Krieger, A.; Neugart, R.; Sánchez, R.; Nörtershäuser, W.

    2015-12-01

    We report on improved isotope shift measurements of the isotopes {}{40,42,{44,48}}Ca in the 4{{s}}{ }2{{{S}}}1/2\\to 4{{p}}{ }2{{{P}}}3/2 (D2) transition using collinear laser spectroscopy. Accurately known isotope shifts in the 4{{s}}{ }2{{{S}}}1/2\\to 4{{p}}{ }2{{{P}}}1/2(D1) transition were used to calibrate the ion beam energy with an uncertainty of {{Δ }}U≈ +/- 0.25 {{V}}. The accuracy in the D2 transition was improved by a factor of 5-10. A King-plot analysis of the two transitions revealed that the field shift factor in the D2 line is about 1.8(13)% larger than in the D1 transition which is ascribed to relativistic contributions of the 4{{{p}}}1/2 wave function.

  4. Analysis and Implementation of Particle-to-Particle (P2P) Graphics Processor Unit (GPU) Kernel for Black-Box Adaptive Fast Multipole Method

    Science.gov (United States)

    2015-06-01

    implementation of the direct interaction called particle-to-particle kernel for a shared-memory single GPU device using the Compute Unified Device Architecture ...GPU-defined P2P kernel we developed using the Compute Unified Device Architecture (CUDA).9 A brief outline of the rest of this work follows. The...Employed The computing environment used for this work is a 64-node heterogeneous cluster consisting of 48 IBM dx360M4 nodes, each with one Intel Phi

  5. Energy-Crossing and Its Effect on Lifetime of the 4s24p 2P3/2 Level for Highly Charged Ga-Like Ions

    International Nuclear Information System (INIS)

    Fan Jian-Zhong; Zhang Deng-Hong; Chang Zhi-Wei; Shi Ying-Long; Dong Chen-Zhong

    2012-01-01

    The multi-configuration Dirac—Fock method is employed to calculate the energy levels and transition probabilities for the electric dipole allowed (E1) and forbidden (M1, E2) lines for the 4s 2 4p, 4s4p 2 and 4s 2 4d configurations of highly charged Ga-like ions from Z = 68–95. The lifetimes of the 4s 2 4p 2 P 3/2 level of the ground configuration are also derived. Based on our calculations, it is found that the energy level of the 4s 2 4p 2 P 3/2 is higher than that of the 4s4p 2 4 P 1/2 for the high-Z Ga-like ions with Z ≥ 74, so as to generate an energy crossing at Z = 74. The effect of the energy crossing is important to the calculation of the 4s 2 4p 2 P 3/2 level lifetime for Ga-like ions with Z ≥ 74. (atomic and molecular physics)

  6. Social structure of Facebook networks

    Science.gov (United States)

    Traud, Amanda L.; Mucha, Peter J.; Porter, Mason A.

    2012-08-01

    We study the social structure of Facebook “friendship” networks at one hundred American colleges and universities at a single point in time, and we examine the roles of user attributes-gender, class year, major, high school, and residence-at these institutions. We investigate the influence of common attributes at the dyad level in terms of assortativity coefficients and regression models. We then examine larger-scale groupings by detecting communities algorithmically and comparing them to network partitions based on user characteristics. We thereby examine the relative importance of different characteristics at different institutions, finding for example that common high school is more important to the social organization of large institutions and that the importance of common major varies significantly between institutions. Our calculations illustrate how microscopic and macroscopic perspectives give complementary insights on the social organization at universities and suggest future studies to investigate such phenomena further.

  7. Network structure exploration via Bayesian nonparametric models

    International Nuclear Information System (INIS)

    Chen, Y; Wang, X L; Xiang, X; Tang, B Z; Bu, J Z

    2015-01-01

    Complex networks provide a powerful mathematical representation of complex systems in nature and society. To understand complex networks, it is crucial to explore their internal structures, also called structural regularities. The task of network structure exploration is to determine how many groups there are in a complex network and how to group the nodes of the network. Most existing structure exploration methods need to specify either a group number or a certain type of structure when they are applied to a network. In the real world, however, the group number and also the certain type of structure that a network has are usually unknown in advance. To explore structural regularities in complex networks automatically, without any prior knowledge of the group number or the certain type of structure, we extend a probabilistic mixture model that can handle networks with any type of structure but needs to specify a group number using Bayesian nonparametric theory. We also propose a novel Bayesian nonparametric model, called the Bayesian nonparametric mixture (BNPM) model. Experiments conducted on a large number of networks with different structures show that the BNPM model is able to explore structural regularities in networks automatically with a stable, state-of-the-art performance. (paper)

  8. An evolving network model with community structure

    International Nuclear Information System (INIS)

    Li Chunguang; Maini, Philip K

    2005-01-01

    Many social and biological networks consist of communities-groups of nodes within which connections are dense, but between which connections are sparser. Recently, there has been considerable interest in designing algorithms for detecting community structures in real-world complex networks. In this paper, we propose an evolving network model which exhibits community structure. The network model is based on the inner-community preferential attachment and inter-community preferential attachment mechanisms. The degree distributions of this network model are analysed based on a mean-field method. Theoretical results and numerical simulations indicate that this network model has community structure and scale-free properties

  9. Communication on the structure of biological networks

    Indian Academy of Sciences (India)

    Networks are widely used to represent interaction pattern among the components in complex systems. Structures of real networks from different domains may vary quite significantly. As there is an interplay between network architecture and dynamics, structure plays an important role in communication and spreading of ...

  10. True Nature of Supply Network Communication Structure

    Directory of Open Access Journals (Sweden)

    Lokhman Hakim bin Osman

    2016-04-01

    Full Text Available Globalization of world economy has altered the definition of organizational structure. Global supply chain can no longer be viewed as an arm-length structure. It has become more complex. The complexity demands deeper research and understanding. This research analyzed a structure of supply network in an attempt to elucidate the true structure of the supply network. Using the quantitative Social Network Analysis methodology, findings of this study indicated that, the structure of the supply network differs depending on the types of network relations. An important implication of these findings would be a more focus resource management upon network relationship development that is based on firms’ positions in the different network structure. This research also contributes to the various strategies of effective and efficient supply chain management.

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

  12. Global Electricity Trade Network: Structures and Implications

    Science.gov (United States)

    Ji, Ling; Jia, Xiaoping; Chiu, Anthony S. F.; Xu, Ming

    2016-01-01

    Nations increasingly trade electricity, and understanding the structure of the global power grid can help identify nations that are critical for its reliability. This study examines the global grid as a network with nations as nodes and international electricity trade as links. We analyze the structure of the global electricity trade network and find that the network consists of four sub-networks, and provide a detailed analysis of the largest network, Eurasia. Russia, China, Ukraine, and Azerbaijan have high betweenness measures in the Eurasian sub-network, indicating the degrees of centrality of the positions they hold. The analysis reveals that the Eurasian sub-network consists of seven communities based on the network structure. We find that the communities do not fully align with geographical proximity, and that the present international electricity trade in the Eurasian sub-network causes an approximately 11 million additional tons of CO2 emissions. PMID:27504825

  13. Isoelectronic comparison of the Al-like 3s23p 2P-3s3p24P transitions in the ions P III-Mo XXX

    International Nuclear Information System (INIS)

    Jupen, C.; Curtis, L.J.

    1996-01-01

    New observations of the 3s 2 3p 2 P-3s3p 2 4 P intercombination transitions in Al-like ions have been made for Cl V from spark spectra recorded at Lund and for Kr XXIV and Mo XXX from spectra obtained at the JET tokamak. The new results have been combined with other identifications of these transitions along the sequence and empirically systematized and compared with theoretical calculations. A set of smoothed and interpolated values for the excitation energies of the 3s3p 2 4 P levels in P III-Mo XXX is presented. (orig.)

  14. Optical frequency measurements of 6s 2S1/2-6p 2P3/2 transition in a 133Cs atomic beam using a femtosecond laser frequency comb

    International Nuclear Information System (INIS)

    Gerginov, V.; Tanner, C.E.; Diddams, S.; Bartels, A.; Hollberg, L.

    2004-01-01

    Optical frequencies of the hyperfine components of the D 2 line in 133 Cs are determined using high-resolution spectroscopy and a femtosecond laser frequency comb. A narrow-linewidth probe laser excites the 6s 2 S 1/2 (F=3,4)→6p 2 P 3/2 (F=2,3,4,5) transition in a highly collimated atomic beam. Fluorescence spectra are taken by scanning the laser frequency over the excited-state hyperfine structure. The laser optical frequency is referenced to a Cs fountain clock via a reference laser and a femtosecond laser frequency comb. A retroreflected laser beam is used to estimate and minimize the Doppler shift due to misalignment between the probe laser and the atomic beam. We achieve an angular resolution on the order of 5x10 -6 rad. The final uncertainties (∼±5 kHz) in the frequencies of the optical transitions are a factor of 20 better than previous results [T. Udem et al., Phys. Rev. A 62, 031801 (2000).]. We find the centroid of the 6s 2 S 1/2 →6p 2 P 3/2 transition to be f D2 =351 725 718.4744(51) MHz

  15. Robustness and structure of complex networks

    Science.gov (United States)

    Shao, Shuai

    This dissertation covers the two major parts of my PhD research on statistical physics and complex networks: i) modeling a new type of attack -- localized attack, and investigating robustness of complex networks under this type of attack; ii) discovering the clustering structure in complex networks and its influence on the robustness of coupled networks. Complex networks appear in every aspect of our daily life and are widely studied in Physics, Mathematics, Biology, and Computer Science. One important property of complex networks is their robustness under attacks, which depends crucially on the nature of attacks and the structure of the networks themselves. Previous studies have focused on two types of attack: random attack and targeted attack, which, however, are insufficient to describe many real-world damages. Here we propose a new type of attack -- localized attack, and study the robustness of complex networks under this type of attack, both analytically and via simulation. On the other hand, we also study the clustering structure in the network, and its influence on the robustness of a complex network system. In the first part, we propose a theoretical framework to study the robustness of complex networks under localized attack based on percolation theory and generating function method. We investigate the percolation properties, including the critical threshold of the phase transition pc and the size of the giant component Pinfinity. We compare localized attack with random attack and find that while random regular (RR) networks are more robust against localized attack, Erdoḧs-Renyi (ER) networks are equally robust under both types of attacks. As for scale-free (SF) networks, their robustness depends crucially on the degree exponent lambda. The simulation results show perfect agreement with theoretical predictions. We also test our model on two real-world networks: a peer-to-peer computer network and an airline network, and find that the real-world networks

  16. Immunization of networks with community structure

    International Nuclear Information System (INIS)

    Masuda, Naoki

    2009-01-01

    In this study, an efficient method to immunize modular networks (i.e. networks with community structure) is proposed. The immunization of networks aims at fragmenting networks into small parts with a small number of removed nodes. Its applications include prevention of epidemic spreading, protection against intentional attacks on networks, and conservation of ecosystems. Although preferential immunization of hubs is efficient, good immunization strategies for modular networks have not been established. On the basis of an immunization strategy based on eigenvector centrality, we develop an analytical framework for immunizing modular networks. To this end, we quantify the contribution of each node to the connectivity in a coarse-grained network among modules. We verify the effectiveness of the proposed method by applying it to model and real networks with modular structure.

  17. Epidemics in adaptive networks with community structure

    Science.gov (United States)

    Shaw, Leah; Tunc, Ilker

    2010-03-01

    Models for epidemic spread on static social networks do not account for changes in individuals' social interactions. Recent studies of adaptive networks have modeled avoidance behavior, as non-infected individuals try to avoid contact with infectives. Such models have not generally included realistic social structure. Here we study epidemic spread on an adaptive network with community structure. We model the effect of heterogeneous communities on infection levels and epidemic extinction. We also show how an epidemic can alter the community structure.

  18. Airline network structure in competitive market

    Directory of Open Access Journals (Sweden)

    Babić Danica D.

    2014-01-01

    Full Text Available Airline's network is the key element of its business strategy and selected network structure will not have influence only on the airline's costs but could gain some advantage in revenues, too. Network designing implies that an airline has to make decisions about markets that it will serve and how to serve those markets. Network choice raises the following questions for an airline: a what markets to serve, b how to serve selected markets, c what level of service to offer, d what are the benefits/cost of the that decisions and e what is the influence of the competition. We analyzed the existing airline business models and corresponding network structure. The paper highlights the relationship between the network structures and the airline business strategies. Using a simple model we examine the relationship between the network structure and service quality in deregulated market.

  19. Pinning Control Strategy of Multicommunity Structure Networks

    Directory of Open Access Journals (Sweden)

    Chao Ding

    2017-01-01

    Full Text Available In order to investigate the effects of community structure on synchronization, a pinning control strategy is researched in a class of complex networks with community structure in this paper. A feedback control law is designed based on the network community structure information. The stability condition is given and proved by using Lyapunov stability theory. Our research shows that as to community structure networks, there being a threshold hT≈5, when coupling strength bellows this threshold, the stronger coupling strength corresponds to higher synchronizability; vice versa, the stronger coupling strength brings lower synchronizability. In addition the synchronizability of overlapping and nonoverlapping community structure networks was simulated and analyzed; while the nodes were controlled randomly and intensively, the results show that intensive control strategy is better than the random one. The network will reach synchronization easily when the node with largest betweenness was controlled. Furthermore, four difference networks’ synchronizability, such as Barabási-Albert network, Watts-Strogatz network, Erdös-Rényi network, and community structure network, are simulated; the research shows that the community structure network is more easily synchronized under the same control strength.

  20. Learning and structure of neuronal networks

    Indian Academy of Sciences (India)

    structures, protein–protein interaction networks, social interactions, the Internet, and so on can be described by complex networks [1–5]. Recent developments in the understanding of complex networks has led to deeper insights about their origin and other properties [1–5]. One common realization that emerges from these ...

  1. An unusual presentation of a customs importation seizure containing amphetamine, possibly synthesized by the APAAN-P2P-Leuckart route.

    Science.gov (United States)

    Power, John D; Barry, Michael G; Scott, Kenneth R; Kavanagh, Pierce V

    2014-01-01

    During the analysis of an Irish customs seizure (14 packages each containing approximately one kilogram of a white wet paste) were analysed for the suspected presence of controlled drugs. The samples were found to contain amphetamine and also characteristic by-products including benzyl cyanide, phenylacetone (P2P), methyl-phenyl-pyrimidines, N-formylamphetamine, naphthalene derivatives and amphetamine dimers. The analytical results corresponded with the impurity profile observed and recently reported for the synthesis of 4-methylamphetamine from 4-methylphenylacetoacetonitrile [1]. The synthesis of amphetamine from alpha-phenylacetoacetonitrile (APAAN) was performed (via an acid hydrolysis and subsequent Leuckart reaction) and the impurity profile of the product obtained was compared to those observed in the customs seizure. Observations are made regarding the route specificity of these by-products. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

  2. Exploring biological network structure with clustered random networks

    Directory of Open Access Journals (Sweden)

    Bansal Shweta

    2009-12-01

    Full Text Available Abstract Background Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions and the extent of clustering (the tendency for a set of three nodes to be interconnected are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Results Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. Conclusion ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in

  3. STRUCTURE AND COOPTATION IN ORGANIZATION NETWORK

    Directory of Open Access Journals (Sweden)

    Valéria Riscarolli

    2007-10-01

    Full Text Available Business executive are rethinking business concept, based on horizontalization principles. As so, most organizational functions are outsourced, leading the enterprise to build business through a network of organizations. Here we study the case of Cia Hering’s network of organizations, a leader in knit apparel segment in Latin America (IEMI, 2004, looking at the network’s structure and levels of cooptation. A theoretical model was used using Quinn et al. (2001 “sun ray” network structure as basis to analyze the case study. Main results indicate higher degree of structural conformity, but incipient degree of coopetation in the network.

  4. Cross-linked structure of network evolution

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-03-15

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

  5. Cross-linked structure of network evolution

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  6. Network structure and travel time perception.

    Science.gov (United States)

    Parthasarathi, Pavithra; Levinson, David; Hochmair, Hartwig

    2013-01-01

    The purpose of this research is to test the systematic variation in the perception of travel time among travelers and relate the variation to the underlying street network structure. Travel survey data from the Twin Cities metropolitan area (which includes the cities of Minneapolis and St. Paul) is used for the analysis. Travelers are classified into two groups based on the ratio of perceived and estimated commute travel time. The measures of network structure are estimated using the street network along the identified commute route. T-test comparisons are conducted to identify statistically significant differences in estimated network measures between the two traveler groups. The combined effect of these estimated network measures on travel time is then analyzed using regression models. The results from the t-test and regression analyses confirm the influence of the underlying network structure on the perception of travel time.

  7. Neural Networks for protein Structure Prediction

    DEFF Research Database (Denmark)

    Bohr, Henrik

    1998-01-01

    This is a review about neural network applications in bioinformatics. Especially the applications to protein structure prediction, e.g. prediction of secondary structures, prediction of surface structure, fold class recognition and prediction of the 3-dimensional structure of protein backbones...

  8. Learning Latent Structure in Complex Networks

    DEFF Research Database (Denmark)

    Mørup, Morten; Hansen, Lars Kai

    such as the Modularity, it has recently been shown that latent structure in complex networks is learnable by Bayesian generative link distribution models (Airoldi et al., 2008, Hofman and Wiggins, 2008). In this paper we propose a new generative model that allows representation of latent community structure......Latent structure in complex networks, e.g., in the form of community structure, can help understand network dynamics, identify heterogeneities in network properties, and predict ‘missing’ links. While most community detection algorithms are based on optimizing heuristic clustering objectives...... as in the previous Bayesian approaches and in addition allows learning of node specific link properties similar to that in the modularity objective. We employ a new relaxation method for efficient inference in these generative models that allows us to learn the behavior of very large networks. We compare the link...

  9. Network Structure, Collaborative Context, and Individual Creativity

    DEFF Research Database (Denmark)

    Stea, Diego; Soda, Giuseppe; Pedersen, Torben

    2016-01-01

    Network research has yet to determine whether bonding ties or bridging ties are more beneficial for individual creativity, but the debate has mostly overlooked the organizational context in which such ties are formed. In particular, the causal chain connecting network structures and individual...... with the network’s organizational context. Thus, actors in dense network structures acquire more knowledge and eventually become more creative in organizational contexts where collaboration is high. Conversely, brokers who arbitrage information across disconnected network contacts acquire more valuable knowledge...

  10. Information transfer in community structured multiplex networks

    Directory of Open Access Journals (Sweden)

    Albert eSolé Ribalta

    2015-08-01

    Full Text Available The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.. The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

  11. Information transfer in community structured multiplex networks

    Science.gov (United States)

    Solé Ribalta, Albert; Granell, Clara; Gómez, Sergio; Arenas, Alex

    2015-08-01

    The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.). The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

  12. Network Ecology and Adolescent Social Structure.

    Science.gov (United States)

    McFarland, Daniel A; Moody, James; Diehl, David; Smith, Jeffrey A; Thomas, Reuben J

    2014-12-01

    Adolescent societies-whether arising from weak, short-term classroom friendships or from close, long-term friendships-exhibit various levels of network clustering, segregation, and hierarchy. Some are rank-ordered caste systems and others are flat, cliquish worlds. Explaining the source of such structural variation remains a challenge, however, because global network features are generally treated as the agglomeration of micro-level tie-formation mechanisms, namely balance, homophily, and dominance. How do the same micro-mechanisms generate significant variation in global network structures? To answer this question we propose and test a network ecological theory that specifies the ways features of organizational environments moderate the expression of tie-formation processes, thereby generating variability in global network structures across settings. We develop this argument using longitudinal friendship data on schools (Add Health study) and classrooms (Classroom Engagement study), and by extending exponential random graph models to the study of multiple societies over time.

  13. Industrial entrepreneurial network: Structural and functional analysis

    Science.gov (United States)

    Medvedeva, M. A.; Davletbaev, R. H.; Berg, D. B.; Nazarova, J. J.; Parusheva, S. S.

    2016-12-01

    Structure and functioning of two model industrial entrepreneurial networks are investigated in the present paper. One of these networks is forming when implementing an integrated project and consists of eight agents, which interact with each other and external environment. The other one is obtained from the municipal economy and is based on the set of the 12 real business entities. Analysis of the networks is carried out on the basis of the matrix of mutual payments aggregated over the certain time period. The matrix is created by the methods of experimental economics. Social Network Analysis (SNA) methods and instruments were used in the present research. The set of basic structural characteristics was investigated: set of quantitative parameters such as density, diameter, clustering coefficient, different kinds of centrality, and etc. They were compared with the random Bernoulli graphs of the corresponding size and density. Discovered variations of random and entrepreneurial networks structure are explained by the peculiarities of agents functioning in production network. Separately, were identified the closed exchange circuits (cyclically closed contours of graph) forming an autopoietic (self-replicating) network pattern. The purpose of the functional analysis was to identify the contribution of the autopoietic network pattern in its gross product. It was found that the magnitude of this contribution is more than 20%. Such value allows using of the complementary currency in order to stimulate economic activity of network agents.

  14. Alignment of Ar+ [3P]4p2P03/2 satellite state from the polarization analysis of fluorescent radiation after photoionization

    International Nuclear Information System (INIS)

    Yenen, O.; McLaughlin, K.W.; Jaecks, D.H.

    1997-01-01

    The measurement of the polarization of radiation from satellite states of Ar + formed after the photoionization of Ar provides detailed information about the nature of doubly excited states, magnetic sublevel cross sections and partial wave ratios of the photo-ejected electrons. Since the formation of these satellite states is a weak process, it is necessary to use a high flux beam of incoming photons. In addition, in order to resolve the many narrow doubly excited Ar resonances, the incoming photons must have a high resolution. The characteristics of the beam line 9.0.1 of the Advanced Light Source fulfill these requirements. The authors determined the polarization of 4765 Angstrom fluorescence from the Ar + [ 3 P] 4p 2 P 3/2 0 satellite state formed after photoionization of Ar by photons from the 9.0.1 beam line of ALS in the 35.620-38.261 eV energy range using a resolution of approximately 12,700. This is accomplished by measuring the intensities of the fluorescent light polarized parallel (I parallel) and perpendicular (I perpendicular) to the polarization axis of the incident synchrotron radiation using a Sterling Optics 105MB polarizing filter. The optical system placed at 90 degrees with respect to the polarization axis of the incident light had a narrow band interference filter (δλ=0.3 nm) to isolate the fluorescent radiation

  15. The Structure of Online Consumer Communication Networks

    NARCIS (Netherlands)

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

    2006-01-01

    textabstractIn this paper we study the structure of the bilateral communication links within Online Consumer Communication Networks (OCCNs), such as virtual communities. Compared to the offline world, consumers in online networks are highly flexible to choose their communication partners and little

  16. The global structure of knowledge network

    NARCIS (Netherlands)

    Angelopoulos, Spyros; Lomi, Alessandro

    2017-01-01

    In this paper, we treat patent citations as knowledge networks connecting pieces of formalized knowledge and people, and focus on how ideas are connected, rather than how they are protected. We focus on the global structural properties of formalized knowledge network, and more specifically on the

  17. Network Centric Information Structure - Crisis Information Management

    National Research Council Canada - National Science Library

    Aarholt, Eldar; Berg, Olav

    2004-01-01

    This paper presents a generic Network Centric Information Structure (NCIS) that can be used by civilian, military and public sectors, and that supports information handling applied to crises management and emergency response...

  18. NCI National Clinical Trials Network Structure

    Science.gov (United States)

    Learn about how the National Clinical Trials Network (NCTN) is structured. The NCTN is a program of the National Cancer Institute that gives funds and other support to cancer research organizations to conduct cancer clinical trials.

  19. Nonparametric inference of network structure and dynamics

    Science.gov (United States)

    Peixoto, Tiago P.

    The network structure of complex systems determine their function and serve as evidence for the evolutionary mechanisms that lie behind them. Despite considerable effort in recent years, it remains an open challenge to formulate general descriptions of the large-scale structure of network systems, and how to reliably extract such information from data. Although many approaches have been proposed, few methods attempt to gauge the statistical significance of the uncovered structures, and hence the majority cannot reliably separate actual structure from stochastic fluctuations. Due to the sheer size and high-dimensionality of many networks, this represents a major limitation that prevents meaningful interpretations of the results obtained with such nonstatistical methods. In this talk, I will show how these issues can be tackled in a principled and efficient fashion by formulating appropriate generative models of network structure that can have their parameters inferred from data. By employing a Bayesian description of such models, the inference can be performed in a nonparametric fashion, that does not require any a priori knowledge or ad hoc assumptions about the data. I will show how this approach can be used to perform model comparison, and how hierarchical models yield the most appropriate trade-off between model complexity and quality of fit based on the statistical evidence present in the data. I will also show how this general approach can be elegantly extended to networks with edge attributes, that are embedded in latent spaces, and that change in time. The latter is obtained via a fully dynamic generative network model, based on arbitrary-order Markov chains, that can also be inferred in a nonparametric fashion. Throughout the talk I will illustrate the application of the methods with many empirical networks such as the internet at the autonomous systems level, the global airport network, the network of actors and films, social networks, citations among

  20. Nuclear Structure and Decay Data (NSDD) network

    International Nuclear Information System (INIS)

    Pronyaev, V.G.

    2001-02-01

    This report provides a brief description of the Nuclear Structure and Decay Data (NSDD) Network in response to a request from the Advisory Group Meeting on ''Co-ordination of the International Network of Nuclear Structure and Decay Data Evaluators'' (IAEA, Vienna, 14-17 December 1998, report IAEA(NDS)-399 (1999)). This report supersedes the special issue of the Nuclear Data Newsletter No. 20 published in November 1994. (author)

  1. Modelling the structure of complex networks

    DEFF Research Database (Denmark)

    Herlau, Tue

    networks has been independently studied as mathematical objects in their own right. As such, there has been both an increased demand for statistical methods for complex networks as well as a quickly growing mathematical literature on the subject. In this dissertation we explore aspects of modelling complex....... The next chapters will treat some of the various symmetries, representer theorems and probabilistic structures often deployed in the modelling complex networks, the construction of sampling methods and various network models. The introductory chapters will serve to provide context for the included written...

  2. The Deep Structure of Organizational Online Networking

    DEFF Research Database (Denmark)

    Trier, Matthias; Richter, Alexander

    2015-01-01

    While research on organizational online networking recently increased significantly, most studies adopt quantitative research designs with a focus on the consequences of social network configurations. Very limited attention is paid to comprehensive theoretical conceptions of the complex phenomenon...... of organizational online networking. We address this gap by adopting a theoretical framework of the deep structure of organizational online networking with a focus on their emerging meaning for the employees. We apply and assess the framework in a qualitative case study of a large-scale implementation...... of a corporate social network site (SNS) in a global organization. We reveal organizational online networking as a multi-dimensional phenomenon with multiplex relationships that are unbalanced, primarily consist of weak ties and are subject to temporal change. Further, we identify discourse drivers...

  3. On Adding Structure to Unstructured Overlay Networks

    Science.gov (United States)

    Leitão, João; Carvalho, Nuno A.; Pereira, José; Oliveira, Rui; Rodrigues, Luís

    Unstructured peer-to-peer overlay networks are very resilient to churn and topology changes, while requiring little maintenance cost. Therefore, they are an infrastructure to build highly scalable large-scale services in dynamic networks. Typically, the overlay topology is defined by a peer sampling service that aims at maintaining, in each process, a random partial view of peers in the system. The resulting random unstructured topology is suboptimal when a specific performance metric is considered. On the other hand, structured approaches (for instance, a spanning tree) may optimize a given target performance metric but are highly fragile. In fact, the cost for maintaining structures with strong constraints may easily become prohibitive in highly dynamic networks. This chapter discusses different techniques that aim at combining the advantages of unstructured and structured networks. Namely we focus on two distinct approaches, one based on optimizing the overlay and another based on optimizing the gossip mechanism itself.

  4. Network structure of subway passenger flows

    Science.gov (United States)

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

    2016-03-01

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

  5. How structure determines correlations in neuronal networks.

    Directory of Open Access Journals (Sweden)

    Volker Pernice

    2011-05-01

    Full Text Available Networks are becoming a ubiquitous metaphor for the understanding of complex biological systems, spanning the range between molecular signalling pathways, neural networks in the brain, and interacting species in a food web. In many models, we face an intricate interplay between the topology of the network and the dynamics of the system, which is generally very hard to disentangle. A dynamical feature that has been subject of intense research in various fields are correlations between the noisy activity of nodes in a network. We consider a class of systems, where discrete signals are sent along the links of the network. Such systems are of particular relevance in neuroscience, because they provide models for networks of neurons that use action potentials for communication. We study correlations in dynamic networks with arbitrary topology, assuming linear pulse coupling. With our novel approach, we are able to understand in detail how specific structural motifs affect pairwise correlations. Based on a power series decomposition of the covariance matrix, we describe the conditions under which very indirect interactions will have a pronounced effect on correlations and population dynamics. In random networks, we find that indirect interactions may lead to a broad distribution of activation levels with low average but highly variable correlations. This phenomenon is even more pronounced in networks with distance dependent connectivity. In contrast, networks with highly connected hubs or patchy connections often exhibit strong average correlations. Our results are particularly relevant in view of new experimental techniques that enable the parallel recording of spiking activity from a large number of neurons, an appropriate interpretation of which is hampered by the currently limited understanding of structure-dynamics relations in complex networks.

  6. Beyond E-business : towards networked structures

    NARCIS (Netherlands)

    Grefen, P.W.P.J.

    2015-01-01

    In Beyond E-Business: Towards Networked Structures Paul Grefen returns with his tried and tested BOAT framework for e-business, now fully expanded and updated with the very latest overview of digitally connected business; from business models, organization structures and architecture, to information

  7. Structural Connectivity Networks of Transgender People

    NARCIS (Netherlands)

    Hahn, Andreas; Kranz, Georg S.; Küblböck, Martin; Kaufmann, Ulrike; Ganger, Sebastian; Hummer, Allan; Seiger, Rene; Spies, Marie; Winkler, Dietmar; Kasper, Siegfried; Windischberger, Christian; Swaab, Dick F.; Lanzenberger, Rupert

    2015-01-01

    Although previous investigations of transsexual people have focused on regional brain alterations, evaluations on a network level, especially those structural in nature, are largely missing. Therefore, we investigated the structural connectome of 23 female-to-male (FtM) and 21 male-to-female (MtF)

  8. Network Structure, Collaborative Context, and Individual Creativity

    DEFF Research Database (Denmark)

    Soda, Giuseppe; Stea, Diego; Pedersen, Torben

    2017-01-01

    The debate on whether bonding or bridging ties are more beneficial for acquiring knowledge that is conducive to individual creativity has mostly overlooked the context in which such ties are formed. We challenge the widespread assumption that closed, heavily bonded networks imply a collaborative...... attitude on the part of the embedded actors and propose that the level of collaboration in a network can be independent from that network’s structural characteristics, such that it moderates the effects of closed and brokering network positions on the acquisition of knowledge that supports creativity....... Individuals embedded in closed networks acquire more knowledge and become more creative when the level of collaboration in their network is high. Brokers who arbitrage information across disconnected contacts acquire more knowledge and become more creative when collaboration is low. An analysis of employee...

  9. NAPS: Network Analysis of Protein Structures

    Science.gov (United States)

    Chakrabarty, Broto; Parekh, Nita

    2016-01-01

    Traditionally, protein structures have been analysed by the secondary structure architecture and fold arrangement. An alternative approach that has shown promise is modelling proteins as a network of non-covalent interactions between amino acid residues. The network representation of proteins provide a systems approach to topological analysis of complex three-dimensional structures irrespective of secondary structure and fold type and provide insights into structure-function relationship. We have developed a web server for network based analysis of protein structures, NAPS, that facilitates quantitative and qualitative (visual) analysis of residue–residue interactions in: single chains, protein complex, modelled protein structures and trajectories (e.g. from molecular dynamics simulations). The user can specify atom type for network construction, distance range (in Å) and minimal amino acid separation along the sequence. NAPS provides users selection of node(s) and its neighbourhood based on centrality measures, physicochemical properties of amino acids or cluster of well-connected residues (k-cliques) for further analysis. Visual analysis of interacting domains and protein chains, and shortest path lengths between pair of residues are additional features that aid in functional analysis. NAPS support various analyses and visualization views for identifying functional residues, provide insight into mechanisms of protein folding, domain-domain and protein–protein interactions for understanding communication within and between proteins. URL:http://bioinf.iiit.ac.in/NAPS/. PMID:27151201

  10. Structure and growth of weighted networks

    Energy Technology Data Exchange (ETDEWEB)

    Riccaboni, Massimo [Department of Computer and Management Sciences, University of Trento, Trento (Italy); Schiavo, Stefano [Department of Economics, University of Trento, Trento (Italy)], E-mail: massimo.riccaboni@unitn.it, E-mail: stefano.schiavo@unitn.it

    2010-02-15

    We develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In our framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. Our model is verified by means of simulations and real-world trade data. We show that the model correctly predicts the intensity and growth distribution of links, the size-variance relationship of the growth of link weights, the relationship between the degree and strength of nodes, and the scale-free structure of the network.

  11. Polarized DIS Structure Functions from Neural Networks

    International Nuclear Information System (INIS)

    Del Debbio, L.; Guffanti, A.; Piccione, A.

    2007-01-01

    We present a parametrization of polarized Deep-Inelastic-Scattering (DIS) structure functions based on Neural Networks. The parametrization provides a bias-free determination of the probability measure in the space of structure functions, which retains information on experimental errors and correlations. As an example we discuss the application of this method to the study of the structure function g 1 p (x,Q 2 )

  12. Community Structure in Online Collegiate Social Networks

    Science.gov (United States)

    Traud, Amanda; Kelsic, Eric; Mucha, Peter; Porter, Mason

    2009-03-01

    Online social networking sites have become increasingly popular with college students. The networks we studied are defined through ``friendships'' indicated by Facebook users from UNC, Oklahoma, Caltech, Georgetown, and Princeton. We apply the tools of network science to study the Facebook networks from these five different universities at a single point in time. We investigate each single-institution network's community structure, which we obtain through partitioning the graph using an eigenvector method. We use both graphical and quantitative tools, including pair-counting methods, which we interpret through statistical analysis and permutation tests to measure the correlations between the network communities and a set of characteristics given by each user (residence, class year, major, and high school). We also analyze the single gender subsets of these networks, and the impact of missing demographical data. Our study allows us to compare the online social networks for the five schools as well as infer differences in offline social interactions. At the schools studied, we were able to define which characteristics of the Facebook users correlate best with friendships.

  13. Networks: structure and action : steering in and steering by policy networks

    NARCIS (Netherlands)

    Dassen, A.

    2010-01-01

    This thesis explores the opportunities to build a structural policy network model that is rooted in social network theories. By making a distinction between a process of steering in networks, and a process of steering by networks, it addresses the effects of network structures on network dynamics as

  14. Structural health monitoring using wireless sensor networks

    Science.gov (United States)

    Sreevallabhan, K.; Nikhil Chand, B.; Ramasamy, Sudha

    2017-11-01

    Monitoring and analysing health of large structures like bridges, dams, buildings and heavy machinery is important for safety, economical, operational, making prior protective measures, and repair and maintenance point of view. In recent years there is growing demand for such larger structures which in turn make people focus more on safety. By using Microelectromechanical Systems (MEMS) Accelerometer we can perform Structural Health Monitoring by studying the dynamic response through measure of ambient vibrations and strong motion of such structures. By using Wireless Sensor Networks (WSN) we can embed these sensors in wireless networks which helps us to transmit data wirelessly thus we can measure the data wirelessly at any remote location. This in turn reduces heavy wiring which is a cost effective as well as time consuming process to lay those wires. In this paper we developed WSN based MEMS-accelerometer for Structural to test the results in the railway bridge near VIT University, Vellore campus.

  15. Structural covariance networks in the mouse brain.

    Science.gov (United States)

    Pagani, Marco; Bifone, Angelo; Gozzi, Alessandro

    2016-04-01

    The presence of networks of correlation between regional gray matter volume as measured across subjects in a group of individuals has been consistently described in several human studies, an approach termed structural covariance MRI (scMRI). Complementary to prevalent brain mapping modalities like functional and diffusion-weighted imaging, the approach can provide precious insights into the mutual influence of trophic and plastic processes in health and pathological states. To investigate whether analogous scMRI networks are present in lower mammal species amenable to genetic and experimental manipulation such as the laboratory mouse, we employed high resolution morphoanatomical MRI in a large cohort of genetically-homogeneous wild-type mice (C57Bl6/J) and mapped scMRI networks using a seed-based approach. We show that the mouse brain exhibits robust homotopic scMRI networks in both primary and associative cortices, a finding corroborated by independent component analyses of cortical volumes. Subcortical structures also showed highly symmetric inter-hemispheric correlations, with evidence of distributed antero-posterior networks in diencephalic regions of the thalamus and hypothalamus. Hierarchical cluster analysis revealed six identifiable clusters of cortical and sub-cortical regions corresponding to previously described neuroanatomical systems. Our work documents the presence of homotopic cortical and subcortical scMRI networks in the mouse brain, thus supporting the use of this species to investigate the elusive biological and neuroanatomical underpinnings of scMRI network development and its derangement in neuropathological states. The identification of scMRI networks in genetically homogeneous inbred mice is consistent with the emerging view of a key role of environmental factors in shaping these correlational networks. Copyright © 2016 Elsevier Inc. All rights reserved.

  16. Robustness and modular structure in networks

    DEFF Research Database (Denmark)

    Bagrow, James P.; Lehmann, Sune; Ahn, Yong-Yeol

    2015-01-01

    -12]. Many complex systems, from power grids and the Internet to the brain and society [13-15], can be modeled using modular networks comprised of small, densely connected groups of nodes [16, 17]. These modules often overlap, with network elements belonging to multiple modules [18, 19]. Yet existing work...... on robustness has not considered the role of overlapping, modular structure. Here we study the robustness of these systems to the failure of elements. We show analytically and empirically that it is possible for the modules themselves to become uncoupled or non-overlapping well before the network disintegrates....... If overlapping modular organization plays a role in overall functionality, networks may be far more vulnerable than predicted by conventional percolation theory....

  17. Social Network Structures among Groundnut Farmers

    Science.gov (United States)

    Thuo, Mary; Bell, Alexandra A.; Bravo-Ureta, Boris E.; Okello, David K.; Okoko, Evelyn Nasambu; Kidula, Nelson L.; Deom, C. Michael; Puppala, Naveen

    2013-01-01

    Purpose: Groundnut farmers in East Africa have experienced declines in production despite research and extension efforts to increase productivity. This study examined how social network structures related to acquisition of information about new seed varieties and productivity among groundnut farmers in Uganda and Kenya.…

  18. Decentralized Networked Control of Building Structures

    Czech Academy of Sciences Publication Activity Database

    Bakule, Lubomír; Rehák, Branislav; Papík, Martin

    2016-01-01

    Roč. 31, č. 11 (2016), s. 871-886 ISSN 1093-9687 R&D Projects: GA ČR GA13-02149S Institutional support: RVO:67985556 Keywords : decentralized control * networked control * building structures Subject RIV: BC - Control Systems Theory Impact factor: 5.786, year: 2016

  19. Network structure shapes spontaneous functional connectivity dynamics.

    Science.gov (United States)

    Shen, Kelly; Hutchison, R Matthew; Bezgin, Gleb; Everling, Stefan; McIntosh, Anthony R

    2015-04-08

    The structural organization of the brain constrains the range of interactions between different regions and shapes ongoing information processing. Therefore, it is expected that large-scale dynamic functional connectivity (FC) patterns, a surrogate measure of coordination between brain regions, will be closely tied to the fiber pathways that form the underlying structural network. Here, we empirically examined the influence of network structure on FC dynamics by comparing resting-state FC (rsFC) obtained using BOLD-fMRI in macaques (Macaca fascicularis) to structural connectivity derived from macaque axonal tract tracing studies. Consistent with predictions from simulation studies, the correspondence between rsFC and structural connectivity increased as the sample duration increased. Regions with reciprocal structural connections showed the most stable rsFC across time. The data suggest that the transient nature of FC is in part dependent on direct underlying structural connections, but also that dynamic coordination can occur via polysynaptic pathways. Temporal stability was found to be dependent on structural topology, with functional connections within the rich-club core exhibiting the greatest stability over time. We discuss these findings in light of highly variable functional hubs. The results further elucidate how large-scale dynamic functional coordination exists within a fixed structural architecture. Copyright © 2015 the authors 0270-6474/15/355579-10$15.00/0.

  20. Epidemic spreading on complex networks with community structures

    NARCIS (Netherlands)

    Stegehuis, C.; van der Hofstad, R.W.; van Leeuwaarden, J.S.H.

    2016-01-01

    Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities

  1. Modeling Insurgent Network Structure and Dynamics

    Science.gov (United States)

    Gabbay, Michael; Thirkill-Mackelprang, Ashley

    2010-03-01

    We present a methodology for mapping insurgent network structure based on their public rhetoric. Indicators of cooperative links between insurgent groups at both the leadership and rank-and-file levels are used, such as joint policy statements or joint operations claims. In addition, a targeting policy measure is constructed on the basis of insurgent targeting claims. Network diagrams which integrate these measures of insurgent cooperation and ideology are generated for different periods of the Iraqi and Afghan insurgencies. The network diagrams exhibit meaningful changes which track the evolution of the strategic environment faced by insurgent groups. Correlations between targeting policy and network structure indicate that insurgent targeting claims are aimed at establishing a group identity among the spectrum of rank-and-file insurgency supporters. A dynamical systems model of insurgent alliance formation and factionalism is presented which evolves the relationship between insurgent group dyads as a function of their ideological differences and their current relationships. The ability of the model to qualitatively and quantitatively capture insurgent network dynamics observed in the data is discussed.

  2. Information diffusion in structured online social networks

    Science.gov (United States)

    Li, Pei; Zhang, Yini; Qiao, Fengcai; Wang, Hui

    2015-05-01

    Nowadays, due to the word-of-mouth effect, online social networks have been considered to be efficient approaches to conduct viral marketing, which makes it of great importance to understand the diffusion dynamics in online social networks. However, most research on diffusion dynamics in epidemiology and existing social networks cannot be applied directly to characterize online social networks. In this paper, we propose models to characterize the information diffusion in structured online social networks with push-based forwarding mechanism. We introduce the term user influence to characterize the average number of times that messages are browsed which is incurred by a given type user generating a message, and study the diffusion threshold, above which the user influence of generating a message will approach infinity. We conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of use in understanding the diffusion dynamics in online social networks and also critical for advertisers in viral marketing who want to estimate the user influence before posting an advertisement.

  3. Network structure of multivariate time series.

    Science.gov (United States)

    Lacasa, Lucas; Nicosia, Vincenzo; Latora, Vito

    2015-10-21

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

  4. An examination of a reciprocal relationship between network governance and network structure

    DEFF Research Database (Denmark)

    Bergenholtz, Carsten; Goduscheit, René Chester

    2011-01-01

    In the present article, we examine the network structure and governance of inter-organisational innovation networks over time. Network governance refers to the issue of how to manage and coordinate the relational activities and processes in the network while research on network structure deals...

  5. Self-Healing Networks: Redundancy and Structure

    Science.gov (United States)

    Quattrociocchi, Walter; Caldarelli, Guido; Scala, Antonio

    2014-01-01

    We introduce the concept of self-healing in the field of complex networks modelling; in particular, self-healing capabilities are implemented through distributed communication protocols that exploit redundant links to recover the connectivity of the system. We then analyze the effect of the level of redundancy on the resilience to multiple failures; in particular, we measure the fraction of nodes still served for increasing levels of network damages. Finally, we study the effects of redundancy under different connectivity patterns—from planar grids, to small-world, up to scale-free networks—on healing performances. Small-world topologies show that introducing some long-range connections in planar grids greatly enhances the resilience to multiple failures with performances comparable to the case of the most resilient (and least realistic) scale-free structures. Obvious applications of self-healing are in the important field of infrastructural networks like gas, power, water, oil distribution systems. PMID:24533065

  6. Structure of the human chromosome interaction network.

    Directory of Open Access Journals (Sweden)

    Sergio Sarnataro

    Full Text Available New Hi-C technologies have revealed that chromosomes have a complex network of spatial contacts in the cell nucleus of higher organisms, whose organisation is only partially understood. Here, we investigate the structure of such a network in human GM12878 cells, to derive a large scale picture of nuclear architecture. We find that the intensity of intra-chromosomal interactions is power-law distributed. Inter-chromosomal interactions are two orders of magnitude weaker and exponentially distributed, yet they are not randomly arranged along the genomic sequence. Intra-chromosomal contacts broadly occur between epigenomically homologous regions, whereas inter-chromosomal contacts are especially associated with regions rich in highly expressed genes. Overall, genomic contacts in the nucleus appear to be structured as a network of networks where a set of strongly individual chromosomal units, as envisaged in the 'chromosomal territory' scenario derived from microscopy, interact with each other via on average weaker, yet far from random and functionally important interactions.

  7. Characteristic imsets for learning Bayesian network structure

    Czech Academy of Sciences Publication Activity Database

    Hemmecke, R.; Lindner, S.; Studený, Milan

    2012-01-01

    Roč. 53, č. 9 (2012), s. 1336-1349 ISSN 0888-613X R&D Projects: GA MŠk(CZ) 1M0572; GA ČR GA201/08/0539 Institutional support: RVO:67985556 Keywords : learning Bayesian network structure * essential graph * standard imset * characteristic imset * LP relaxation of a polytope Subject RIV: BA - General Mathematics Impact factor: 1.729, year: 2012 http://library.utia.cas.cz/separaty/2012/MTR/studeny-0382596.pdf

  8. An examination of a reciprocal relationship between network governance and network structure

    DEFF Research Database (Denmark)

    Bergenholtz, Carsten; Goduscheit, René Chester

    The present article examines the network structure and governance of inter-organisational innovation networks. Network governance refers to the issue of how to manage and coordinate the relational activities and processes in the network while research on network structure deals with the overall...... structural relations between the actors in the network. These streams of research do contain references to each other but mostly rely on a static conception of the relationship between network structure and the applied network governance. The paper is based on a primarily qualitative case study of a loosely...... coupled Danish inter-organisational innovation network. The proposition is that a reciprocal relation between network governance and network structure can be identified....

  9. Measuring structural similarity in large online networks.

    Science.gov (United States)

    Shi, Yongren; Macy, Michael

    2016-09-01

    Structural similarity based on bipartite graphs can be used to detect meaningful communities, but the networks have been tiny compared to massive online networks. Scalability is important in applications involving tens of millions of individuals with highly skewed degree distributions. Simulation analysis holding underlying similarity constant shows that two widely used measures - Jaccard index and cosine similarity - are biased by the distribution of out-degree in web-scale networks. However, an alternative measure, the Standardized Co-incident Ratio (SCR), is unbiased. We apply SCR to members of Congress, musical artists, and professional sports teams to show how massive co-following on Twitter can be used to map meaningful affiliations among cultural entities, even in the absence of direct connections to one another. Our results show how structural similarity can be used to map cultural alignments and demonstrate the potential usefulness of social media data in the study of culture, politics, and organizations across the social and behavioral sciences. Copyright © 2016 Elsevier Inc. All rights reserved.

  10. Adaptation of coordination mechanisms to network structures

    Directory of Open Access Journals (Sweden)

    Herwig Mittermayer

    2008-12-01

    Full Text Available The coordination efficiency of Supply Chain Management is determined by two opposite poles: benefit from improved planning results and associated coordination cost. The centralization grade, applied coordination mechanisms and IT support have influence on both categories. Therefore three reference types are developed and subsequently detailed in business process models for different network structures. In a simulation study the performance of these organization forms are compared in a process plant network. Coordination benefit is observed if the planning mode is altered by means of a demand planning IT tool. Coordination cost is divided into structural and activity-dependent cost. The activity level rises when reactive planning iterations become necessary as a consequence of inconsistencies among planning levels. Some characteristic influence factors are considered to be a reason for uninfeasible planning. In this study the effect of capacity availability and stochastic machine downtimes is investigated in an uncertain demand situation. Results that if the network runs with high overcapacity, central planning is less likely to increase benefit enough to outweigh associated cost. Otherwise, if capacity constraints are crucial, a central planning mode is recommendable. When also unforeseen machine downtimes are low, the use of sophisticated IT tools is most profitable.

  11. Structure Learning in Power Distribution Networks

    Energy Technology Data Exchange (ETDEWEB)

    Deka, Deepjyoti [Univ. of Texas, Austin, TX (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Backhaus, Scott N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-01-13

    Traditionally power distribution networks are either not observable or only partially observable. This complicates development and implementation of new smart grid technologies, such as these related to demand response, outage detection and management, and improved load-monitoring. Here, inspired by proliferation of the metering technology, we discuss statistical estimation problems in structurally loopy but operationally radial distribution grids consisting in learning operational layout of the network from measurements, e.g. voltage data, which are either already available or can be made available with a relatively minor investment. Our newly suggested algorithms apply to a wide range of realistic scenarios. The algorithms are also computationally efficient – polynomial in time – which is proven theoretically and illustrated computationally on a number of test cases. The technique developed can be applied to detect line failures in real time as well as to understand the scope of possible adversarial attacks on the grid.

  12. The network structure of human personality according to the NEO-PI-R: matching network community structure to factor structure.

    Directory of Open Access Journals (Sweden)

    Rutger Goekoop

    Full Text Available INTRODUCTION: Human personality is described preferentially in terms of factors (dimensions found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. AIM: To directly compare the ability of network community detection (NCD and principal component factor analysis (PCA to examine modularity in multidimensional datasets such as the neuroticism-extraversion-openness personality inventory revised (NEO-PI-R. METHODS: 434 healthy subjects were tested on the NEO-PI-R. PCA was performed to extract factor structures (FS of the current dataset using both item scores and facet scores. Correlational network graphs were constructed from univariate correlation matrices of interactions between both items and facets. These networks were pruned in a link-by-link fashion while calculating the network community structure (NCS of each resulting network using the Wakita Tsurumi clustering algorithm. NCSs were matched against FS and networks of best matches were kept for further analysis. RESULTS: At facet level, NCS showed a best match (96.2% with a 'confirmatory' 5-FS. At item level, NCS showed a best match (80% with the standard 5-FS and involved a total of 6 network clusters. Lesser matches were found with 'confirmatory' 5-FS and 'exploratory' 6-FS of the current dataset. Network analysis did not identify facets as a separate level of organization in between items and clusters. A small-world network structure was found in both item- and facet level networks. CONCLUSION: We present the first optimized network graph of personality traits according to the NEO-PI-R: a 'Personality Web'. Such a web may represent the possible routes that subjects can take during personality development. NCD outperforms PCA by producing plausible modularity at item level in non-standard datasets, and can identify the key roles of individual items and clusters in the network.

  13. Diseño y desarrollo de una aplicación p2p de mensajería para la ESPOL, usando tecnología jxta

    OpenAIRE

    Calle Peña, Xavier Fernando; Cedeño Mieles, Vanessa Ines; Abad Robalino, Cristina Lucia

    2009-01-01

    Este resumen presenta una aplicación de mensajería instantánea par-a-par (P2P) para la ESPOL. Como las políticas de la institución impiden la utilización de aplicaciones de comunicación en las salas de cómputo, decidimos presentar nuestra aplicación desarrollada en JXTA como una alternativa. La tecnología JXTA es un grupo de protocolos que permite a cualquier dispositivo conectado a la red comunicarse y colaborar de una manera P2P. Los nodos de JXTA, también llamados peers, crean una red vir...

  14. Inteligência estratégica antecipativa coletiva e crowdfunding: aplicação do método L.E.SCAnning em empresa social de economia peer-to-peer (P2P

    Directory of Open Access Journals (Sweden)

    Mery Blanck

    2014-03-01

    Full Text Available Neste artigo, apresentam-se os resultados de pesquisa qualitativa em que se objetivou investigar a aplicabilidade do método L.E.SCAnning em empresas sociais de economia peer-to-peer (P2P. A motivação partiu da ideia de a autossustentabilidade ser, a longo prazo, um dos maiores desafios das organizações, especialmente aquelas lastreadas na economia social, dentre elas, as empresas P2P. No entanto, empresas sociais são potencialmente negócios dinâmicos e progressistas com os quais o mercado empresarial poderia aprender, uma vez que experimentam e inovam. Partindo exatamente desse espírito inovador, muitas empresas sociais voltaram-se para o modelo crowdfunding de economia P2P, que se configura como tendência emergente de organização colaborativa de recursos na Web. Sob esse prisma, um dos novos desenvolvimentos em gestão que se aplicam à atividade de organizações com enfoque sistêmico é a prática da Inteligência Estratégica Antecipativa Coletiva (IEAc. Nesse sentido, no estudo de caso investigou-se a empresa social francesa Babyloan para compreender de que maneira a organização busca, monitora e utiliza a informação captada do meio externo para sua atuação, prototipando, com base nesse diagnóstico, a aplicação de um ciclo do método L.E.SCAnning. Os resultados deste estudo sugerem que o entendimento pragmático do cenário externo, por meio da IEAc, favorece decisões que trazem uma marca de empreendedorismo e inovação, e tem no universo da economia social P2P, ambiente fortemente baseado em percepção, um impacto potencial significativo.

  15. Community detection for networks with unipartite and bipartite structure

    Science.gov (United States)

    Chang, Chang; Tang, Chao

    2014-09-01

    Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite network consists of one set of nodes and a bipartite network consists of two nonoverlapping sets of nodes with only links joining the nodes in different sets. However, a third type of network exists, defined here as the mixture network. Just like a bipartite network, a mixture network also consists of two sets of nodes, but some nodes may simultaneously belong to two sets, which breaks the nonoverlapping restriction of a bipartite network. The mixture network can be considered as a general case, with unipartite and bipartite networks viewed as its limiting cases. A mixture network can represent not only all the unipartite and bipartite networks, but also a wide range of real-world networks that cannot be properly represented as either unipartite or bipartite networks in fields such as biology and social science. Based on this observation, we first propose a probabilistic model that can find modules in unipartite, bipartite, and mixture networks in a unified framework based on the link community model for a unipartite undirected network [B Ball et al (2011 Phys. Rev. E 84 036103)]. We test our algorithm on synthetic networks (both overlapping and nonoverlapping communities) and apply it to two real-world networks: a southern women bipartite network and a human transcriptional regulatory mixture network. The results suggest that our model performs well for all three types of networks, is competitive with other algorithms for unipartite or bipartite networks, and is applicable to real-world networks.

  16. Identification of Non-Linear Structures using Recurrent Neural Networks

    DEFF Research Database (Denmark)

    Kirkegaard, Poul Henning; Nielsen, Søren R. K.; Hansen, H. I.

    Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure.......Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure....

  17. Identification of Non-Linear Structures using Recurrent Neural Networks

    DEFF Research Database (Denmark)

    Kirkegaard, Poul Henning; Nielsen, Søren R. K.; Hansen, H. I.

    1995-01-01

    Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure.......Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure....

  18. Towards structural controllability of local-world networks

    International Nuclear Information System (INIS)

    Sun, Shiwen; Ma, Yilin; Wu, Yafang; Wang, Li; Xia, Chengyi

    2016-01-01

    Controlling complex networks is of vital importance in science and engineering. Meanwhile, local-world effect is an important ingredient which should be taken into consideration in the complete description of real-world complex systems. In this letter, structural controllability of a class of local-world networks is investigated. Through extensive numerical simulations, firstly, effects of local world size M and network size N on structural controllability are examined. For local-world networks with sparse topological configuration, compared to network size, local-world size can induce stronger influence on controllability, however, for dense networks, controllability is greatly affected by network size and local-world effect can be neglected. Secondly, relationships between controllability and topological properties are analyzed. Lastly, the robustness of local-world networks under targeted attacks regarding structural controllability is discussed. These results can help to deepen the understanding of structural complexity and connectivity patterns of complex systems. - Highlights: • Structural controllability of a class of local-world networks is investigated. • For sparse local-world networks, compared to network size, local-world size can bring stronger influence on controllability. • For dense networks, controllability is greatly affected by network size and the effect of local-world size can be neglected. • Structural controllability against targeted node attacks is discussed.

  19. Towards structural controllability of local-world networks

    Energy Technology Data Exchange (ETDEWEB)

    Sun, Shiwen, E-mail: sunsw80@126.com [Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384 (China); Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384 (China); Ma, Yilin; Wu, Yafang; Wang, Li; Xia, Chengyi [Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384 (China); Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384 (China)

    2016-05-20

    Controlling complex networks is of vital importance in science and engineering. Meanwhile, local-world effect is an important ingredient which should be taken into consideration in the complete description of real-world complex systems. In this letter, structural controllability of a class of local-world networks is investigated. Through extensive numerical simulations, firstly, effects of local world size M and network size N on structural controllability are examined. For local-world networks with sparse topological configuration, compared to network size, local-world size can induce stronger influence on controllability, however, for dense networks, controllability is greatly affected by network size and local-world effect can be neglected. Secondly, relationships between controllability and topological properties are analyzed. Lastly, the robustness of local-world networks under targeted attacks regarding structural controllability is discussed. These results can help to deepen the understanding of structural complexity and connectivity patterns of complex systems. - Highlights: • Structural controllability of a class of local-world networks is investigated. • For sparse local-world networks, compared to network size, local-world size can bring stronger influence on controllability. • For dense networks, controllability is greatly affected by network size and the effect of local-world size can be neglected. • Structural controllability against targeted node attacks is discussed.

  20. Phase synchronization on small-world networks with community structure

    International Nuclear Information System (INIS)

    Xiao-Hua, Wang; Li-Cheng, Jiao; Jian-She, Wu

    2010-01-01

    In this paper, we propose a simple model that can generate small-world network with community structure. The network is introduced as a tunable community organization with parameter r, which is directly measured by the ratio of inter- to intra-community connectivity, and a smaller r corresponds to a stronger community structure. The structure properties, including the degree distribution, clustering, the communication efficiency and modularity are also analysed for the network. In addition, by using the Kuramoto model, we investigated the phase synchronization on this network, and found that increasing the fuzziness of community structure will markedly enhance the network synchronizability; however, in an abnormal region (r ≤ 0.001), the network has even worse synchronizability than the case of isolated communities (r = 0). Furthermore, this network exhibits a remarkable synchronization behaviour in topological scales: the oscillators of high densely interconnected communities synchronize more easily, and more rapidly than the whole network. (general)

  1. Social inheritance can explain the structure of animal social networks

    Science.gov (United States)

    Ilany, Amiyaal; Akçay, Erol

    2016-01-01

    The social network structure of animal populations has major implications for survival, reproductive success, sexual selection and pathogen transmission of individuals. But as of yet, no general theory of social network structure exists that can explain the diversity of social networks observed in nature, and serve as a null model for detecting species and population-specific factors. Here we propose a simple and generally applicable model of social network structure. We consider the emergence of network structure as a result of social inheritance, in which newborns are likely to bond with maternal contacts, and via forming bonds randomly. We compare model output with data from several species, showing that it can generate networks with properties such as those observed in real social systems. Our model demonstrates that important observed properties of social networks, including heritability of network position or assortative associations, can be understood as consequences of social inheritance. PMID:27352101

  2. PROSPECTS OF REGIONAL NETWORK STRUCTURES IN THE SOUTHERN FEDERAL DISTRICT

    Directory of Open Access Journals (Sweden)

    I. V. Morozov

    2014-01-01

    Full Text Available The article reveals the possibility of the Southern Federal District to form regional network structures. The prospects for the formation of networks in the region in relation to the Olympic Winter Games Sochi 2014.

  3. A Decomposition Algorithm for Learning Bayesian Network Structures from Data

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Cordero Hernandez, Jorge

    2008-01-01

    It is a challenging task of learning a large Bayesian network from a small data set. Most conventional structural learning approaches run into the computational as well as the statistical problems. We propose a decomposition algorithm for the structure construction without having to learn...... the complete network. The new learning algorithm firstly finds local components from the data, and then recover the complete network by joining the learned components. We show the empirical performance of the decomposition algorithm in several benchmark networks....

  4. The effect of aging on network structure

    OpenAIRE

    Zhu, Han; Wang, Xin-Ran; Zhu, Jian-Yang

    2003-01-01

    In network evolution, the effect of aging is universal: in scientific collaboration network, scientists have a finite time span of being active; in movie actors network, once popular stars are retiring from stage; devices on the Internet may become outmoded with techniques developing so rapidly. Here we find in citation networks that this effect can be represented by an exponential decay factor, $e^{-\\beta \\tau}$, where $\\tau $ is the node age, while other evolving networks (the Internet for ...

  5. Structural equation models from paths to networks

    CERN Document Server

    Westland, J Christopher

    2015-01-01

    This compact reference surveys the full range of available structural equation modeling (SEM) methodologies.  It reviews applications in a broad range of disciplines, particularly in the social sciences where many key concepts are not directly observable.  This is the first book to present SEM’s development in its proper historical context–essential to understanding the application, strengths and weaknesses of each particular method.  This book also surveys the emerging path and network approaches that complement and enhance SEM, and that will grow in importance in the near future.  SEM’s ability to accommodate unobservable theory constructs through latent variables is of significant importance to social scientists.  Latent variable theory and application are comprehensively explained, and methods are presented for extending their power, including guidelines for data preparation, sample size calculation, and the special treatment of Likert scale data.  Tables of software, methodologies and fit st...

  6. Clustering coefficient and community structure of bipartite networks

    Science.gov (United States)

    Zhang, Peng; Wang, Jinliang; Li, Xiaojia; Li, Menghui; Di, Zengru; Fan, Ying

    2008-12-01

    Many real-world networks display natural bipartite structure, where the basic cycle is a square. In this paper, with the similar consideration of standard clustering coefficient in binary networks, a definition of the clustering coefficient for bipartite networks based on the fraction of squares is proposed. In order to detect community structures in bipartite networks, two different edge clustering coefficients LC4 and LC3 of bipartite networks are defined, which are based on squares and triples respectively. With the algorithm of cutting the edge with the least clustering coefficient, communities in artificial and real world networks are identified. The results reveal that investigating bipartite networks based on the original structure can show the detailed properties that is helpful to get deep understanding about the networks.

  7. Developing a network-level structural capacity index for structural evaluation of pavements.

    Science.gov (United States)

    2013-03-01

    The objective of this project was to develop a structural index for use in network-level pavement evaluation to facilitate : the inclusion of the pavements structural condition in pavement management applications. The primary goal of network-level...

  8. Distance metric learning for complex networks: Towards size-independent comparison of network structures

    Science.gov (United States)

    Aliakbary, Sadegh; Motallebi, Sadegh; Rashidian, Sina; Habibi, Jafar; Movaghar, Ali

    2015-02-01

    Real networks show nontrivial topological properties such as community structure and long-tail degree distribution. Moreover, many network analysis applications are based on topological comparison of complex networks. Classification and clustering of networks, model selection, and anomaly detection are just some applications of network comparison. In these applications, an effective similarity metric is needed which, given two complex networks of possibly different sizes, evaluates the amount of similarity between the structural features of the two networks. Traditional graph comparison approaches, such as isomorphism-based methods, are not only too time consuming but also inappropriate to compare networks with different sizes. In this paper, we propose an intelligent method based on the genetic algorithms for integrating, selecting, and weighting the network features in order to develop an effective similarity measure for complex networks. The proposed similarity metric outperforms state of the art methods with respect to different evaluation criteria.

  9. The prisoner's dilemma in structured scale-free networks

    International Nuclear Information System (INIS)

    Li Xing; Wu Yonghui; Zhang Zhongzhi; Zhou Shuigeng; Rong Zhihai

    2009-01-01

    The conventional wisdom is that scale-free networks are prone to cooperation spreading. In this paper we investigate the cooperative behavior on the structured scale-free network. In contrast to the conventional wisdom that scale-free networks are prone to cooperation spreading, the evolution of cooperation is inhibited on the structured scale-free network when the prisoner's dilemma (PD) game is modeled. First, we demonstrate that neither the scale-free property nor the high clustering coefficient is responsible for the inhibition of cooperation spreading on the structured scale-free network. Then we provide one heuristic method to argue that the lack of age correlations and its associated 'large-world' behavior in the structured scale-free network inhibit the spread of cooperation. These findings may help enlighten further studies on the evolutionary dynamics of the PD game in scale-free networks

  10. Combining neural networks for protein secondary structure prediction

    DEFF Research Database (Denmark)

    Riis, Søren Kamaric

    1995-01-01

    In this paper structured neural networks are applied to the problem of predicting the secondary structure of proteins. A hierarchical approach is used where specialized neural networks are designed for each structural class and then combined using another neural network. The submodels are designed...... by using a priori knowledge of the mapping between protein building blocks and the secondary structure and by using weight sharing. Since none of the individual networks have more than 600 adjustable weights over-fitting is avoided. When ensembles of specialized experts are combined the performance...

  11. Joint Modelling of Structural and Functional Brain Networks

    DEFF Research Database (Denmark)

    Andersen, Kasper Winther; Herlau, Tue; Mørup, Morten

    -parametric Bayesian network model which allows for joint modelling and integration of multiple networks. We demonstrate the model’s ability to detect vertices that share structure across networks jointly in functional MRI (fMRI) and diffusion MRI (dMRI) data. Using two fMRI and dMRI scans per subject, we establish...

  12. Influence of degree correlations on network structure and stability in protein-protein interaction networks

    Directory of Open Access Journals (Sweden)

    Zimmer Ralf

    2007-08-01

    Full Text Available Abstract Background The existence of negative correlations between degrees of interacting proteins is being discussed since such negative degree correlations were found for the large-scale yeast protein-protein interaction (PPI network of Ito et al. More recent studies observed no such negative correlations for high-confidence interaction sets. In this article, we analyzed a range of experimentally derived interaction networks to understand the role and prevalence of degree correlations in PPI networks. We investigated how degree correlations influence the structure of networks and their tolerance against perturbations such as the targeted deletion of hubs. Results For each PPI network, we simulated uncorrelated, positively and negatively correlated reference networks. Here, a simple model was developed which can create different types of degree correlations in a network without changing the degree distribution. Differences in static properties associated with degree correlations were compared by analyzing the network characteristics of the original PPI and reference networks. Dynamics were compared by simulating the effect of a selective deletion of hubs in all networks. Conclusion Considerable differences between the network types were found for the number of components in the original networks. Negatively correlated networks are fragmented into significantly less components than observed for positively correlated networks. On the other hand, the selective deletion of hubs showed an increased structural tolerance to these deletions for the positively correlated networks. This results in a lower rate of interaction loss in these networks compared to the negatively correlated networks and a decreased disintegration rate. Interestingly, real PPI networks are most similar to the randomly correlated references with respect to all properties analyzed. Thus, although structural properties of networks can be modified considerably by degree

  13. Ames and other European networks in integrity of ageing structures

    International Nuclear Information System (INIS)

    Davies, L.M.; Von Estorff, U.; Crutzen, S.

    1996-01-01

    Several European institutions and organisations and the Joint Research Centre have developed co-operative programmes now organised into Networks for mutual benefit. They include utilities, engineering companies, Research and Development laboratories and regulatory bodies. Networks are organised and managed like the successful Programme for the Inspection of Steel Components (PISC). The JRC's Institute for Advanced Materials of the European Commission plays the role of Operating Agent and manager of these Networks: ENIQ. AMES, NESC, each of them dealing with specific aspect of fitness for purpose of materials in structural components. This paper describes the structure and the objectives of these networks. Particular emphasis is given to the network AMES

  14. Structural factoring approach for analyzing stochastic networks

    Science.gov (United States)

    Hayhurst, Kelly J.; Shier, Douglas R.

    1991-01-01

    The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

  15. Structural Behavioral Study on the General Aviation Network Based on Complex Network

    Science.gov (United States)

    Zhang, Liang; Lu, Na

    2017-12-01

    The general aviation system is an open and dissipative system with complex structures and behavioral features. This paper has established the system model and network model for general aviation. We have analyzed integral attributes and individual attributes by applying the complex network theory and concluded that the general aviation network has influential enterprise factors and node relations. We have checked whether the network has small world effect, scale-free property and network centrality property which a complex network should have by applying degree distribution of functions and proved that the general aviation network system is a complex network. Therefore, we propose to achieve the evolution process of the general aviation industrial chain to collaborative innovation cluster of advanced-form industries by strengthening network multiplication effect, stimulating innovation performance and spanning the structural hole path.

  16. Structural analysis of behavioral networks from the Internet

    International Nuclear Information System (INIS)

    Meiss, M R; Menczer, F; Vespignani, A

    2008-01-01

    In spite of the Internet's phenomenal growth and social impact, many aspects of the collective communication behavior of its users are largely unknown. Understanding the structure and dynamics of the behavioral networks that connect users with each other and with services across the Internet is key to modeling the network and designing future applications. We present a characterization of the properties of the behavioral networks generated by several million users of the Abilene (Internet2) network. Structural features of these networks offer new insights into scaling properties of network activity and ways of distinguishing particular patterns of traffic. For example, we find that the structure of the behavioral network associated with Web activity is characterized by such extreme heterogeneity as to challenge any simple attempt to model Web server traffic

  17. Structural analysis of behavioral networks from the Internet

    Energy Technology Data Exchange (ETDEWEB)

    Meiss, M R; Menczer, F [Department of Computer Science, Indiana University, Bloomington, IN 47405 (United States); Vespignani, A [Department of Informatics, Indiana University, Bloomington, IN 47408 (United States)], E-mail: mmeiss@indiana.edu

    2008-06-06

    In spite of the Internet's phenomenal growth and social impact, many aspects of the collective communication behavior of its users are largely unknown. Understanding the structure and dynamics of the behavioral networks that connect users with each other and with services across the Internet is key to modeling the network and designing future applications. We present a characterization of the properties of the behavioral networks generated by several million users of the Abilene (Internet2) network. Structural features of these networks offer new insights into scaling properties of network activity and ways of distinguishing particular patterns of traffic. For example, we find that the structure of the behavioral network associated with Web activity is characterized by such extreme heterogeneity as to challenge any simple attempt to model Web server traffic.

  18. A new hierarchical method to find community structure in networks

    Science.gov (United States)

    Saoud, Bilal; Moussaoui, Abdelouahab

    2018-04-01

    Community structure is very important to understand a network which represents a context. Many community detection methods have been proposed like hierarchical methods. In our study, we propose a new hierarchical method for community detection in networks based on genetic algorithm. In this method we use genetic algorithm to split a network into two networks which maximize the modularity. Each new network represents a cluster (community). Then we repeat the splitting process until we get one node at each cluster. We use the modularity function to measure the strength of the community structure found by our method, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our method are highly effective at discovering community structure in both computer-generated and real-world network data.

  19. Dynamical community structure of populations evolving on genotype networks

    International Nuclear Information System (INIS)

    Capitán, José A.; Aguirre, Jacobo; Manrubia, Susanna

    2015-01-01

    Neutral evolutionary dynamics of replicators occurs on large and heterogeneous networks of genotypes. These networks, formed by all genotypes that yield the same phenotype, have a complex architecture that conditions the molecular composition of populations and their movements on genome spaces. Here we consider as an example the case of populations evolving on RNA secondary structure neutral networks and study the community structure of the network revealed through dynamical properties of the population at equilibrium and during adaptive transients. We unveil a rich hierarchical community structure that, eventually, can be traced back to the non-trivial relationship between RNA secondary structure and sequence composition. We demonstrate that usual measures of modularity that only take into account the static, topological structure of networks, cannot identify the community structure disclosed by population dynamics

  20. A Hierarchical Dispatch Structure for Distribution Network Pricing

    OpenAIRE

    Yuan, Zhao; Hesamzadeh, Mohammad Reza

    2015-01-01

    This paper presents a hierarchical dispatch structure for efficient distribution network pricing. The dispatch coordination problem in the context of hierarchical network operators are addressed. We formulate decentralized generation dispatch into a bilevel optimization problem in which main network operator and the connected distribution network operator optimize their costs in two levels. By using Karush-Kuhn-Tucker conditions and Fortuny-Amat McCarl linearization, the bilevel optimization ...

  1. Influence of choice of null network on small-world parameters of structural correlation networks.

    Directory of Open Access Journals (Sweden)

    S M Hadi Hosseini

    Full Text Available In recent years, coordinated variations in brain morphology (e.g., volume, thickness have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1 networks constructed by topology randomization (TOP, 2 networks matched to the distributional properties of the observed covariance matrix (HQS, and 3 networks generated from correlation of randomized input data (COR. The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures.

  2. Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks

    Science.gov (United States)

    Hosseini, S. M. Hadi; Kesler, Shelli R.

    2013-01-01

    In recent years, coordinated variations in brain morphology (e.g., volume, thickness) have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1) networks constructed by topology randomization (TOP), 2) networks matched to the distributional properties of the observed covariance matrix (HQS), and 3) networks generated from correlation of randomized input data (COR). The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures. PMID:23840672

  3. Peer-to-peer over mobile ad hoc networks (Chapter 11)

    NARCIS (Netherlands)

    Qadri, N.N.; Liotta, A.; Pierre, S.

    2010-01-01

    In this chapter we review various approaches for the convergence of Peer-to-Peer (P2P) and Mobile Ad hoc Networks (MANETs), identifying strengths and weaknesses, and putting things in perspective. P2P and MANETs are among the most active research topics in pervasive computing. The convergence of P2P

  4. Wireless sensor networks for structural health monitoring

    CERN Document Server

    Cao, Jiannong

    2016-01-01

    This brief covers the emerging area of wireless sensor network (WSN)-based structural health monitoring (SHM) systems, and introduces the authors’ WSN-based platform called SenetSHM. It helps the reader differentiate specific requirements of SHM applications from other traditional WSN applications, and demonstrates how these requirements are addressed by using a series of systematic approaches. The brief serves as a practical guide, explaining both the state-of-the-art technologies in domain-specific applications of WSNs, as well as the methodologies used to address the specific requirements for a WSN application. In particular, the brief offers instruction for problem formulation and problem solving based on the authors’ own experiences implementing SenetSHM. Seven concise chapters cover the development of hardware and software design of SenetSHM, as well as in-field experiments conducted while testing the platform. The brief’s exploration of the SenetSHM platform is a valuable feature for civil engine...

  5. Network versus portfolio structure in financial systems

    Science.gov (United States)

    Kobayashi, Teruyoshi

    2013-10-01

    The question of how to stabilize financial systems has attracted considerable attention since the global financial crisis of 2007-2009. Recently, Beale et al. [Proc. Natl. Acad. Sci. USA 108, 12647 (2011)] demonstrated that higher portfolio diversity among banks would reduce systemic risk by decreasing the risk of simultaneous defaults at the expense of a higher likelihood of individual defaults. In practice, however, a bank default has an externality in that it undermines other banks’ balance sheets. This paper explores how each of these different sources of risk, simultaneity risk and externality, contributes to systemic risk. The results show that the allocation of external assets that minimizes systemic risk varies with the topology of the financial network as long as asset returns have negative correlations. In the model, a well-known centrality measure, PageRank, reflects an appropriately defined “infectiveness” of a bank. An important result is that the most infective bank needs not always to be the safest bank. Under certain circumstances, the most infective node should act as a firewall to prevent large-scale collective defaults. The introduction of a counteractive portfolio structure will significantly reduce systemic risk.

  6. Exploring network structure, dynamics, and function using networkx

    Energy Technology Data Exchange (ETDEWEB)

    Hagberg, Aric [Los Alamos National Laboratory; Swart, Pieter [Los Alamos National Laboratory; S Chult, Daniel [COLGATE UNIV

    2008-01-01

    NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.

  7. Optimal neural networks for protein-structure prediction

    International Nuclear Information System (INIS)

    Head-Gordon, T.; Stillinger, F.H.

    1993-01-01

    The successful application of neural-network algorithms for prediction of protein structure is stymied by three problem areas: the sparsity of the database of known protein structures, poorly devised network architectures which make the input-output mapping opaque, and a global optimization problem in the multiple-minima space of the network variables. We present a simplified polypeptide model residing in two dimensions with only two amino-acid types, A and B, which allows the determination of the global energy structure for all possible sequences of pentamer, hexamer, and heptamer lengths. This model simplicity allows us to compile a complete structural database and to devise neural networks that reproduce the tertiary structure of all sequences with absolute accuracy and with the smallest number of network variables. These optimal networks reveal that the three problem areas are convoluted, but that thoughtful network designs can actually deconvolute these detrimental traits to provide network algorithms that genuinely impact on the ability of the network to generalize or learn the desired mappings. Furthermore, the two-dimensional polypeptide model shows sufficient chemical complexity so that transfer of neural-network technology to more realistic three-dimensional proteins is evident

  8. Complex network perspective on structure and function of ...

    Indian Academy of Sciences (India)

    of community social networks, which are dense node–node links within modules, but have sparser links between ... 3.2 Bow tie structure. The whole metabolic network of S. aureus is then decomposed into four parts based on the 'bow tie' structure (figure 2, table 2). It should be noted that most nodes in S, P and IS parts are ...

  9. Changing organizational structures of jihadist networks in the Netherlands

    NARCIS (Netherlands)

    de Bie, Jasper L.; de Poot, Christianne J.; Freilich, Joshua D.; Chermak, Steven M.

    2017-01-01

    This paper uses Social Network Analysis to study and compare the organizational structures and division of roles of three jihadist networks in the Netherlands. It uses unique longitudinal Dutch police data covering the 2000–2013 period. This study demonstrates how the organizational structures

  10. Online Social Networks: Essays on Membership, Privacy, and Structure

    NARCIS (Netherlands)

    Hofstra, B.

    2017-01-01

    The structure of social networks is crucial for obtaining social support, for meaningful connections to unknown social groups, and to overcome prejudice. Yet, we know little about the structure of social networks beyond those contacts that stand closest to us. This lack of knowledge results from a

  11. Reconstructing consensus Bayesian network structures with application to learning molecular interaction networks

    NARCIS (Netherlands)

    Fröhlich, H.; Klau, G.W.

    2013-01-01

    Bayesian Networks are an established computational approach for data driven network inference. However, experimental data is limited in its availability and corrupted by noise. This leads to an unavoidable uncertainty about the correct network structure. Thus sampling or bootstrap based strategies

  12. Functional clustering in hippocampal cultures: relating network structure and dynamics

    International Nuclear Information System (INIS)

    Feldt, S; Dzakpasu, R; Olariu, E; Żochowski, M; Wang, J X; Shtrahman, E

    2010-01-01

    In this work we investigate the relationship between gross anatomic structural network properties, neuronal dynamics and the resultant functional structure in dissociated rat hippocampal cultures. Specifically, we studied cultures as they developed under two conditions: the first supporting glial cell growth (high glial group), and the second one inhibiting it (low glial group). We then compared structural network properties and the spatio-temporal activity patterns of the neurons. Differences in dynamics between the two groups could be linked to the impact of the glial network on the neuronal network as the cultures developed. We also implemented a recently developed algorithm called the functional clustering algorithm (FCA) to obtain the resulting functional network structure. We show that this new algorithm is useful for capturing changes in functional network structure as the networks evolve over time. The FCA detects changes in functional structure that are consistent with expected dynamical differences due to the impact of the glial network. Cultures in the high glial group show an increase in global synchronization as the cultures age, while those in the low glial group remain locally synchronized. We additionally use the FCA to quantify the amount of synchronization present in the cultures and show that the total level of synchronization in the high glial group is stronger than in the low glial group. These results indicate an interdependence between the glial and neuronal networks present in dissociated cultures

  13. Learning Networks Distributed Environment

    NARCIS (Netherlands)

    Martens, Harrie; Vogten, Hubert; Koper, Rob; Tattersall, Colin; Van Rosmalen, Peter; Sloep, Peter; Van Bruggen, Jan; Spoelstra, Howard

    2005-01-01

    Learning Networks Distributed Environment is a prototype of an architecture that allows the sharing and modification of learning materials through a number of transport protocols. The prototype implements a p2p protcol using JXTA.

  14. Learning and structure of neuronal networks

    Indian Academy of Sciences (India)

    We study the effect of learning dynamics on network topology. Firstly, a network of discrete dynamical systems is considered for this purpose and the coupling strengths are made to evolve according to a temporal learning rule that is based on the paradigm of spike-time-dependent plasticity (STDP). This incorporates ...

  15. Wireless Sensor Networks : Structure and Algorithms

    NARCIS (Netherlands)

    van Dijk, T.C.

    2014-01-01

    In this thesis we look at various problems in wireless networking. First we consider two problems in physical-model networks. We introduce a new model for localisation. The model is based on a range-free model of radio transmissions. The first scheme is randomised and we analyse its expected

  16. Fundamental structures of dynamic social networks

    DEFF Research Database (Denmark)

    Sekara, Vedran; Stopczynski, Arkadiusz; Jørgensen, Sune Lehmann

    2016-01-01

    Social systems are in a constant state of flux, with dynamics spanning from minute-by-minute changes to patterns present on the timescale of years. Accurate models of social dynamics are important for understanding the spreading of influence or diseases, formation of friendships...... and their interactions in the network of real-world person-to-person proximity measured via Bluetooth, as well as their telecommunication networks, online social media contacts, geolocation, and demographic data. These high-resolution data allow us to observe social groups directly, rendering community detection......, and the productivity of teams. Although there has been much progress on understanding complex networks over the past decade, little is known about the regularities governing the microdynamics of social networks. Here, we explore the dynamic social network of a densely-connected population of ∼1,000 individuals...

  17. Structural and robustness properties of smart-city transportation networks

    Science.gov (United States)

    Zhang, Zhen-Gang; Ding, Zhuo; Fan, Jing-Fang; Meng, Jun; Ding, Yi-Min; Ye, Fang-Fu; Chen, Xiao-Song

    2015-09-01

    The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. Project supported by the Major Projects of the China National Social Science Fund (Grant No. 11 & ZD154).

  18. Structural and robustness properties of smart-city transportation networks

    International Nuclear Information System (INIS)

    Zhang Zhen-Gang; Ding Zhuo; Fan Jing-Fang; Chen Xiao-Song; Meng Jun; Ye Fang-Fu; Ding Yi-Min

    2015-01-01

    The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. (rapid communication)

  19. Adapting Bayes Network Structures to Non-stationary Domains

    DEFF Research Database (Denmark)

    Nielsen, Søren Holbech; Nielsen, Thomas Dyhre

    2008-01-01

    When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit a sequential stream of observations, we call the process structural adaptation. Structural adaptation is useful when the learner is set to work in an unknown environment, where a BN is gradu...

  20. Resolving structural variability in network models and the brain.

    Directory of Open Access Journals (Sweden)

    Florian Klimm

    2014-03-01

    Full Text Available Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known in general about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar graph metrics, but presented here in a more complete statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus specifically on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling--in addition to several summary statistics, including the mean clustering coefficient, the shortest path-length, and the network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be physically embedded in anatomical brain regions tend to produce distributions that are most similar to the corresponding measurements for the brain. We also find that network models hardcoded to display one network property (e.g., assortativity do not in general simultaneously display a second (e.g., hierarchy. This relative independence of network properties suggests that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful

  1. Covariance, correlation matrix, and the multiscale community structure of networks.

    Science.gov (United States)

    Shen, Hua-Wei; Cheng, Xue-Qi; Fang, Bin-Xing

    2010-07-01

    Empirical studies show that real world networks often exhibit multiple scales of topological descriptions. However, it is still an open problem how to identify the intrinsic multiple scales of networks. In this paper, we consider detecting the multiscale community structure of network from the perspective of dimension reduction. According to this perspective, a covariance matrix of network is defined to uncover the multiscale community structure through the translation and rotation transformations. It is proved that the covariance matrix is the unbiased version of the well-known modularity matrix. We then point out that the translation and rotation transformations fail to deal with the heterogeneous network, which is very common in nature and society. To address this problem, a correlation matrix is proposed through introducing the rescaling transformation into the covariance matrix. Extensive tests on real world and artificial networks demonstrate that the correlation matrix significantly outperforms the covariance matrix, identically the modularity matrix, as regards identifying the multiscale community structure of network. This work provides a novel perspective to the identification of community structure and thus various dimension reduction methods might be used for the identification of community structure. Through introducing the correlation matrix, we further conclude that the rescaling transformation is crucial to identify the multiscale community structure of network, as well as the translation and rotation transformations.

  2. Structural and Infrastructural Underpinnings of International R&D Networks

    DEFF Research Database (Denmark)

    Niang, Mohamed; Sørensen, Brian Vejrum

    2009-01-01

    This paper explores the process of globally distributing R&D activities with an emphasis on the effects of network maturity. It discusses emerging configurations by asking how the structure and infrastructure of international R&D networks evolve along with the move from a strong R&D center...... to dispersed development. Drawing from case studies of two international R&D networks, it presents a capability maturity model and argues that understanding the interaction between new structures and infrastructures of the dispersed networks has become a key requirement for developing organizational...

  3. Conversation practices and network structure in Twitter

    DEFF Research Database (Denmark)

    Rossi, Luca; Magnani, Matteo

    2012-01-01

    that this double nature of Twitter is widely recognized among scholars there is still little literature facing the relationships between these two networks. This paper presents the results of an empirical research aimed at discovering how the Twitter network is affected by what happens on the topical network. Does...... the participation in the same hashtag based conversation change the follower list of the participants? Is it possible to point out specific social behaviors that would produce a major gain of followers? Our conclusions are based on real data concerning the popular TV show Xfactor, that largely used Twitter...

  4. Implications of network structure on public health collaboratives.

    Science.gov (United States)

    Retrum, Jessica H; Chapman, Carrie L; Varda, Danielle M

    2013-10-01

    Interorganizational collaboration is an essential function of public health agencies. These partnerships form social networks that involve diverse types of partners and varying levels of interaction. Such collaborations are widely accepted and encouraged, yet very little comparative research exists on how public health partnerships develop and evolve, specifically in terms of how subsequent network structures are linked to outcomes. A systems science approach, that is, one that considers the interdependencies and nested features of networks, provides the appropriate methods to examine the complex nature of these networks. Applying Mays and Scutchfields's categorization of "structural signatures" (breadth, density, and centralization), this research examines how network structure influences the outcomes of public health collaboratives. Secondary data from the Program to Analyze, Record, and Track Networks to Enhance Relationships (www.partnertool.net) data set are analyzed. This data set consists of dyadic (N = 12,355), organizational (N = 2,486), and whole network (N = 99) data from public health collaborations around the United States. Network data are used to calculate structural signatures and weighted least squares regression is used to examine how network structures can predict selected intermediary outcomes (resource contributions, overall value and trust rankings, and outcomes) in public health collaboratives. Our findings suggest that network structure may have an influence on collaborative-related outcomes. The structural signature that had the most significant relationship to outcomes was density, with higher density indicating more positive outcomes. Also significant was the finding that more breadth creates new challenges such as difficulty in reaching consensus and creating ties with other members. However, assumptions that these structural components lead to improved outcomes for public health collaboratives may be slightly premature. Implications of

  5. Conversation practices and network structure in Twitter

    DEFF Research Database (Denmark)

    Rossi, Luca; Magnani, Matteo

    2012-01-01

    The public by default nature of Twitter messages, together with the adoption of the #hashtag convention led, in few years, to the creation of a digital space able to host worldwide conversation on almost every kind of topic. From major TV shows to Natural disasters there is no contemporary event...... that does not have its own #hashtag to gather together the ongoing Twitter conversation. These topical discussions take place outside of the Twitter network made of followers and friends. Nevertheless this topical network is where many of the most studied phenomena take place. Therefore Twitter based...... communication exists on two almost autonomous levels: the Twitter network made of followers and friends that shows a certain level of stability and the topical network, characterized by a high level of contingency, that appears and disappears following the rhythm of a worldwide conversation. Despite the fact...

  6. Electron-impact excitation of multiply-charged ions using energy loss in merged beams: e + Si3+(3s2S1/2) → e + Si3+(3p2P1/2,3/2)

    International Nuclear Information System (INIS)

    Wahlin, E.K.; Thompson, J.S.; Dunn, G.H.; Phaneuf, R.A.; Gregory, D.C.; Smith, A.C.H.

    1990-01-01

    For the first time absolute total cross sections for electron-impact excitation of a multiply-charged ion have been measured using an electron-energy-loss technique. Measurements were made near threshold for the process e + Si 3+ (3s 2 S 1/2 ) → e + Si 3+ (3p 2 P 1/2 , 3/2 ) -- 8.88 eV. The 10 -15 cm 2 measured cross section agrees with results of 7-state close coupling calculations to better than the ±20% (90% CL) total uncertainty of the measurements. Convoluting the theoretical curve with a Gaussian energy distribution indicates an energy width of 0.15 approx-lt ΔE approx-lt 0.20 eV. 12 refs., 2 figs

  7. Network Properties of the Ensemble of RNA Structures

    Science.gov (United States)

    Clote, Peter; Bayegan, Amir

    2015-01-01

    We describe the first dynamic programming algorithm that computes the expected degree for the network, or graph G = (V, E) of all secondary structures of a given RNA sequence a = a 1, …, a n. Here, the nodes V correspond to all secondary structures of a, while an edge exists between nodes s, t if the secondary structure t can be obtained from s by adding, removing or shifting a base pair. Since secondary structure kinetics programs implement the Gillespie algorithm, which simulates a random walk on the network of secondary structures, the expected network degree may provide a better understanding of kinetics of RNA folding when allowing defect diffusion, helix zippering, and related conformation transformations. We determine the correlation between expected network degree, contact order, conformational entropy, and expected number of native contacts for a benchmarking dataset of RNAs. Source code is available at http://bioinformatics.bc.edu/clotelab/RNAexpNumNbors. PMID:26488894

  8. Structure of Retail Services in the Brazilian Hosting Network

    Directory of Open Access Journals (Sweden)

    Claudio Zancan

    2015-08-01

    Full Text Available this research has identified Brazilian hosting networks through infrastructure services indicators that it was sold to tourists in organizations that form these networks. The theory consulted the discussion of structural techniques present in Social Network Analysis. The study has three stages: documental research, creation of Tourism database and interviews. The results identified three networks with the highest expression in Brazil formed by hotels, lodges, and resorts. Different char-acteristics of infrastructure and services were observed between hosting networks. Future studies suggest a comparative analysis of structural indicators present in other segments of tourism services, as well as the existing international influ-ence on the development of the Brazilian hosting networks.

  9. Displacement and deformation measurement for large structures by camera network

    Science.gov (United States)

    Shang, Yang; Yu, Qifeng; Yang, Zhen; Xu, Zhiqiang; Zhang, Xiaohu

    2014-03-01

    A displacement and deformation measurement method for large structures by a series-parallel connection camera network is presented. By taking the dynamic monitoring of a large-scale crane in lifting operation as an example, a series-parallel connection camera network is designed, and the displacement and deformation measurement method by using this series-parallel connection camera network is studied. The movement range of the crane body is small, and that of the crane arm is large. The displacement of the crane body, the displacement of the crane arm relative to the body and the deformation of the arm are measured. Compared with a pure series or parallel connection camera network, the designed series-parallel connection camera network can be used to measure not only the movement and displacement of a large structure but also the relative movement and deformation of some interesting parts of the large structure by a relatively simple optical measurement system.

  10. Synchronization in complex networks with a modular structure.

    Science.gov (United States)

    Park, Kwangho; Lai, Ying-Cheng; Gupte, Saurabh; Kim, Jong-Won

    2006-03-01

    Networks with a community (or modular) structure arise in social and biological sciences. In such a network individuals tend to form local communities, each having dense internal connections. The linkage among the communities is, however, much more sparse. The dynamics on modular networks, for instance synchronization, may be of great social or biological interest. (Here by synchronization we mean some synchronous behavior among the nodes in the network, not, for example, partially synchronous behavior in the network or the synchronizability of the network with some external dynamics.) By using a recent theoretical framework, the master-stability approach originally introduced by Pecora and Carroll in the context of synchronization in coupled nonlinear oscillators, we address synchronization in complex modular networks. We use a prototype model and develop scaling relations for the network synchronizability with respect to variations of some key network structural parameters. Our results indicate that random, long-range links among distant modules is the key to synchronization. As an application we suggest a viable strategy to achieve synchronous behavior in social networks.

  11. Structuring evolution: biochemical networks and metabolic diversification in birds.

    Science.gov (United States)

    Morrison, Erin S; Badyaev, Alexander V

    2016-08-25

    Recurrence and predictability of evolution are thought to reflect the correspondence between genomic and phenotypic dimensions of organisms, and the connectivity in deterministic networks within these dimensions. Direct examination of the correspondence between opportunities for diversification imbedded in such networks and realized diversity is illuminating, but is empirically challenging because both the deterministic networks and phenotypic diversity are modified in the course of evolution. Here we overcome this problem by directly comparing the structure of a "global" carotenoid network - comprising of all known enzymatic reactions among naturally occurring carotenoids - with the patterns of evolutionary diversification in carotenoid-producing metabolic networks utilized by birds. We found that phenotypic diversification in carotenoid networks across 250 species was closely associated with enzymatic connectivity of the underlying biochemical network - compounds with greater connectivity occurred the most frequently across species and were the hotspots of metabolic pathway diversification. In contrast, we found no evidence for diversification along the metabolic pathways, corroborating findings that the utilization of the global carotenoid network was not strongly influenced by history in avian evolution. The finding that the diversification in species-specific carotenoid networks is qualitatively predictable from the connectivity of the underlying enzymatic network points to significant structural determinism in phenotypic evolution.

  12. Information Propagation in Complex Networks : Structures and Dynamics

    NARCIS (Netherlands)

    Märtens, M.

    2018-01-01

    This thesis is a contribution to a deeper understanding of how information propagates and what this process entails. At its very core is the concept of the network: a collection of nodes and links, which describes the structure of the systems under investigation. The network is a mathematical model

  13. Structural dimensions of knowledge-action networks for sustainability

    Science.gov (United States)

    Tischa A. Munoz; B.B. Cutts

    2016-01-01

    Research on the influence of social network structure over flows of knowledge in support of sustainability governance and action has recently flourished. These studies highlight three challenges to evaluating knowledge-action networks: first, defining boundaries; second, characterizing power distributions; and third, identifying obstacles to knowledge sharing and...

  14. The macroecology of phylogenetically structured hummingbird-plant networks

    DEFF Research Database (Denmark)

    González, Ana M. Martín; Dalsgaard, Bo; Nogues, David Bravo

    2015-01-01

    Aim To investigate the association between hummingbird–plant network structure and species richness, phylogenetic signal on species' interaction pattern, insularity and historical and current climate. Location Fifty-four communities along a c. 10,000 km latitudinal gradient across the Americas (39...... approach, we examined the influence of species richness, phylogenetic signal, insularity and current and historical climate conditions on network structure (null-model-corrected specialization and modularity). Results Phylogenetically related species, especially plants, showed a tendency to interact...... with a similar array of mutualistic partners. The spatial variation in network structure exhibited a constant association with species phylogeny (R2 = 0.18–0.19); however, network structure showed the strongest association with species richness and environmental factors (R2 = 0.20–0.44 and R2 = 0...

  15. Mesoscopic structure conditions the emergence of cooperation on social networks.

    Directory of Open Access Journals (Sweden)

    Sergi Lozano

    Full Text Available BACKGROUND: We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. METHODOLOGY/PRINCIPAL FINDINGS: We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. CONCLUSION: Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

  16. Mesoscopic structure conditions the emergence of cooperation on social networks

    Energy Technology Data Exchange (ETDEWEB)

    Lozano, S.; Arenas, A.; Sanchez, A.

    2008-12-01

    We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

  17. Structural Changes in Online Discussion Networks

    DEFF Research Database (Denmark)

    Yang, Yang; Medaglia, Rony

    2014-01-01

    Social networking platforms in China provide a hugely interesting and relevant source for understanding dynamics of online discussions in a unique socio-cultural and institutional environment. This paper investigates the evolution of patterns of similar-minded and different-minded interactions ov...

  18. Structural network heterogeneities and network dynamics: a possible dynamical mechanism for hippocampal memory reactivation.

    Science.gov (United States)

    Jablonski, Piotr; Poe, Gina; Zochowski, Michal

    2007-03-01

    The hippocampus has the capacity for reactivating recently acquired memories and it is hypothesized that one of the functions of sleep reactivation is the facilitation of consolidation of novel memory traces. The dynamic and network processes underlying such a reactivation remain, however, unknown. We show that such a reactivation characterized by local, self-sustained activity of a network region may be an inherent property of the recurrent excitatory-inhibitory network with a heterogeneous structure. The entry into the reactivation phase is mediated through a physiologically feasible regulation of global excitability and external input sources, while the reactivated component of the network is formed through induced network heterogeneities during learning. We show that structural changes needed for robust reactivation of a given network region are well within known physiological parameters.

  19. Structural stability of interaction networks against negative external fields

    Science.gov (United States)

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

    2018-04-01

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

  20. Disentangling bipartite and core-periphery structure in financial networks

    International Nuclear Information System (INIS)

    Barucca, Paolo; Lillo, Fabrizio

    2016-01-01

    A growing number of systems are represented as networks whose architecture conveys significant information and determines many of their properties. Examples of network architecture include modular, bipartite, and core-periphery structures. However inferring the network structure is a non trivial task and can depend sometimes on the chosen null model. Here we propose a method for classifying network structures and ranking its nodes in a statistically well-grounded fashion. The method is based on the use of Belief Propagation for learning through Entropy Maximization on both the Stochastic Block Model (SBM) and the degree-corrected Stochastic Block Model (dcSBM). As a specific application we show how the combined use of the two ensembles—SBM and dcSBM—allows to disentangle the bipartite and the core-periphery structure in the case of the e-MID interbank network. Specifically we find that, taking into account the degree, this interbank network is better described by a bipartite structure, while using the SBM the core-periphery structure emerges only when data are aggregated for more than a week.

  1. Cognitive and Social Structure of the Elite Collaboration Network of Astrophysics: A Case Study on Shifting Network Structures

    Science.gov (United States)

    Heidler, Richard

    2011-01-01

    Scientific collaboration can only be understood along the epistemic and cognitive grounding of scientific disciplines. New scientific discoveries in astrophysics led to a major restructuring of the elite network of astrophysics. To study the interplay of the epistemic grounding and the social network structure of a discipline, a mixed-methods…

  2. Approximating spectral impact of structural perturbations in large networks

    CERN Document Server

    Milanese, A; Nishikawa, Takashi; Sun, Jie

    2010-01-01

    Determining the effect of structural perturbations on the eigenvalue spectra of networks is an important problem because the spectra characterize not only their topological structures, but also their dynamical behavior, such as synchronization and cascading processes on networks. Here we develop a theory for estimating the change of the largest eigenvalue of the adjacency matrix or the extreme eigenvalues of the graph Laplacian when small but arbitrary set of links are added or removed from the network. We demonstrate the effectiveness of our approximation schemes using both real and artificial networks, showing in particular that we can accurately obtain the spectral ranking of small subgraphs. We also propose a local iterative scheme which computes the relative ranking of a subgraph using only the connectivity information of its neighbors within a few links. Our results may not only contribute to our theoretical understanding of dynamical processes on networks, but also lead to practical applications in ran...

  3. Exponential random graph models for networks with community structure.

    Science.gov (United States)

    Fronczak, Piotr; Fronczak, Agata; Bujok, Maksymilian

    2013-09-01

    Although the community structure organization is an important characteristic of real-world networks, most of the traditional network models fail to reproduce the feature. Therefore, the models are useless as benchmark graphs for testing community detection algorithms. They are also inadequate to predict various properties of real networks. With this paper we intend to fill the gap. We develop an exponential random graph approach to networks with community structure. To this end we mainly built upon the idea of blockmodels. We consider both the classical blockmodel and its degree-corrected counterpart and study many of their properties analytically. We show that in the degree-corrected blockmodel, node degrees display an interesting scaling property, which is reminiscent of what is observed in real-world fractal networks. A short description of Monte Carlo simulations of the models is also given in the hope of being useful to others working in the field.

  4. Community structures and role detection in music networks

    Science.gov (United States)

    Teitelbaum, T.; Balenzuela, P.; Cano, P.; Buldú, Javier M.

    2008-12-01

    We analyze the existence of community structures in two different social networks using data obtained from similarity and collaborative features between musical artists. Our analysis reveals some characteristic organizational patterns and provides information about the driving forces behind the growth of the networks. In the similarity network, we find a strong correlation between clusters of artists and musical genres. On the other hand, the collaboration network shows two different kinds of communities: rather small structures related to music bands and geographic zones, and much bigger communities built upon collaborative clusters with a high number of participants related through the period the artists were active. Finally, we detect the leading artists inside their corresponding communities and analyze their roles in the network by looking at a few topological properties of the nodes.

  5. Structural and functional networks in complex systems with delay.

    Science.gov (United States)

    Eguíluz, Víctor M; Pérez, Toni; Borge-Holthoefer, Javier; Arenas, Alex

    2011-05-01

    Functional networks of complex systems are obtained from the analysis of the temporal activity of their components, and are often used to infer their unknown underlying connectivity. We obtain the equations relating topology and function in a system of diffusively delay-coupled elements in complex networks. We solve exactly the resulting equations in motifs (directed structures of three nodes) and in directed networks. The mean-field solution for directed uncorrelated networks shows that the clusterization of the activity is dominated by the in-degree of the nodes, and that the locking frequency decreases with increasing average degree. We find that the exponent of a power law degree distribution of the structural topology γ is related to the exponent of the associated functional network as α=(2-γ)(-1) for γ<2. © 2011 American Physical Society

  6. Modeling Temporal Evolution and Multiscale Structure in Networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard

    2013-01-01

    Many real-world networks exhibit both temporal evolution and multiscale structure. We propose a model for temporally correlated multifurcating hierarchies in complex networks which jointly capture both effects. We use the Gibbs fragmentation tree as prior over multifurcating trees and a change......-point model to account for the temporal evolution of each vertex. We demonstrate that our model is able to infer time-varying multiscale structure in synthetic as well as three real world time-evolving complex networks. Our modeling of the temporal evolution of hierarchies brings new insights...

  7. The structure of complex networks theory and applications

    CERN Document Server

    Estrada, Ernesto

    2012-01-01

    This book deals with the analysis of the structure of complex networks by combining results from graph theory, physics, and pattern recognition. The book is divided into two parts. 11 chapters are dedicated to the development of theoretical tools for the structural analysis of networks, and 7 chapters are illustrating, in a critical way, applications of these tools to real-world scenarios. The first chapters provide detailed coverage of adjacency and metric and topologicalproperties of networks, followed by chapters devoted to the analysis of individual fragments and fragment-based global inva

  8. Structure and Evolution of the Foreign Exchange Networks

    Science.gov (United States)

    Kwapień, J.; Gworek, S.; Drożdż, S.

    2009-01-01

    We investigate topology and temporal evolution of the foreign currency exchange market viewed from a weighted network perspective. Based on exchange rates for a set of 46 currencies (including precious metals), we construct different representations of the FX network depending on a choice of the base currency. Our results show that the network structure is not stable in time, but there are main clusters of currencies, which persist for a long period of time despite the fact that their size and content are variable. We find a long-term trend in the network's evolution which affects the USD and EUR nodes. In all the network representations, the USD node gradually loses its centrality, while, on contrary, the EUR node has become slightly more central than it used to be in its early years. Despite this directional trend, the overall evolution of the network is noisy.

  9. Imaging structural and functional brain networks in temporal lobe epilepsy

    Science.gov (United States)

    Bernhardt, Boris C.; Hong, SeokJun; Bernasconi, Andrea; Bernasconi, Neda

    2013-01-01

    Early imaging studies in temporal lobe epilepsy (TLE) focused on the search for mesial temporal sclerosis, as its surgical removal results in clinically meaningful improvement in about 70% of patients. Nevertheless, a considerable subgroup of patients continues to suffer from post-operative seizures. Although the reasons for surgical failure are not fully understood, electrophysiological and imaging data suggest that anomalies extending beyond the temporal lobe may have negative impact on outcome. This hypothesis has revived the concept of human epilepsy as a disorder of distributed brain networks. Recent methodological advances in non-invasive neuroimaging have led to quantify structural and functional networks in vivo. While structural networks can be inferred from diffusion MRI tractography and inter-regional covariance patterns of structural measures such as cortical thickness, functional connectivity is generally computed based on statistical dependencies of neurophysiological time-series, measured through functional MRI or electroencephalographic techniques. This review considers the application of advanced analytical methods in structural and functional connectivity analyses in TLE. We will specifically highlight findings from graph-theoretical analysis that allow assessing the topological organization of brain networks. These studies have provided compelling evidence that TLE is a system disorder with profound alterations in local and distributed networks. In addition, there is emerging evidence for the utility of network properties as clinical diagnostic markers. Nowadays, a network perspective is considered to be essential to the understanding of the development, progression, and management of epilepsy. PMID:24098281

  10. Imaging structural and functional brain networks in temporal lobe epilepsy

    Directory of Open Access Journals (Sweden)

    Boris eBernhardt

    2013-10-01

    Full Text Available Early imaging studies in temporal lobe epilepsy (TLE focused on the search for mesial temporal sclerosis, as its surgical removal results in clinically meaningful improvement in about 70% of patients. Nevertheless, a considerable subgroup of patients continues to suffer from post-operative seizures. Although the reasons for surgical failure are not fully understood, electrophysiological and imaging data suggest that anomalies extending beyond the temporal lobe may have negative impact on outcome. This hypothesis has revived the concept of human epilepsy as a disorder of distributed brain networks. Recent methodological advances in non-invasive neuroimaging have led to quantify structural and functional networks in vivo. While structural networks can be inferred from diffusion MRI tractography and inter-regional covariance patterns of structural measures such as cortical thickness, functional connectivity is generally computed based on statistical dependencies of neurophysiological time-series, measured through functional MRI or electroencephalographic techniques. This review considers the application of advanced analytical methods in structural and functional connectivity analyses in TLE. We will specifically highlight findings from graph-theoretical analysis that allow assessing topological organization of brain networks. These studies have provided compelling evidence that TLE is a system disorder with profound alterations in local and distributed networks. In addition, there is emerging evidence for the utility of network properties as clinical diagnostic markers. Nowadays, a network perspective is considered to be essential to the understanding of the development, progression, and management of epilepsy.

  11. Imaging structural and functional brain networks in temporal lobe epilepsy.

    Science.gov (United States)

    Bernhardt, Boris C; Hong, Seokjun; Bernasconi, Andrea; Bernasconi, Neda

    2013-10-01

    Early imaging studies in temporal lobe epilepsy (TLE) focused on the search for mesial temporal sclerosis, as its surgical removal results in clinically meaningful improvement in about 70% of patients. Nevertheless, a considerable subgroup of patients continues to suffer from post-operative seizures. Although the reasons for surgical failure are not fully understood, electrophysiological and imaging data suggest that anomalies extending beyond the temporal lobe may have negative impact on outcome. This hypothesis has revived the concept of human epilepsy as a disorder of distributed brain networks. Recent methodological advances in non-invasive neuroimaging have led to quantify structural and functional networks in vivo. While structural networks can be inferred from diffusion MRI tractography and inter-regional covariance patterns of structural measures such as cortical thickness, functional connectivity is generally computed based on statistical dependencies of neurophysiological time-series, measured through functional MRI or electroencephalographic techniques. This review considers the application of advanced analytical methods in structural and functional connectivity analyses in TLE. We will specifically highlight findings from graph-theoretical analysis that allow assessing the topological organization of brain networks. These studies have provided compelling evidence that TLE is a system disorder with profound alterations in local and distributed networks. In addition, there is emerging evidence for the utility of network properties as clinical diagnostic markers. Nowadays, a network perspective is considered to be essential to the understanding of the development, progression, and management of epilepsy.

  12. Fragmented Romanian sociology: growth and structure of the collaboration network.

    Science.gov (United States)

    Hâncean, Marian-Gabriel; Perc, Matjaž; Vlăsceanu, Lazăr

    2014-01-01

    Structural patterns in collaboration networks are essential for understanding how new ideas, research practices, innovation or cooperation circulate and develop within academic communities and between and within university departments. In our research, we explore and investigate the structure of the collaboration network formed by the academics working full-time within all the 17 sociology departments across Romania. We show that the collaboration network is sparse and fragmented, and that it constitutes an environment that does not promote the circulation of new ideas and innovation within the field. Although recent years have witnessed an increase in the productivity of Romanian sociologists, there is still ample room for improvement in terms of the interaction infrastructure that ought to link individuals together so that they could maximize their potentials. We also fail to discern evidence in favor of the Matthew effect governing the growth of the network, which suggests scientific success and productivity are not rewarded. Instead, the structural properties of the collaboration network are partly those of a core-periphery network, where the spread of innovation and change can be explained by structural equivalence rather than by interpersonal influence models. We also provide support for the idea that, within the observed network, collaboration is the product of homophily rather than prestige effects. Further research on the subject based on data from other countries in the region is needed to place our results in a comparative framework, in particular to discern whether the behavior of the Romanian sociologist community is unique or rather common.

  13. Unifying Inference of Meso-Scale Structures in Networks.

    Science.gov (United States)

    Tunç, Birkan; Verma, Ragini

    2015-01-01

    Networks are among the most prevalent formal representations in scientific studies, employed to depict interactions between objects such as molecules, neuronal clusters, or social groups. Studies performed at meso-scale that involve grouping of objects based on their distinctive interaction patterns form one of the main lines of investigation in network science. In a social network, for instance, meso-scale structures can correspond to isolated social groupings or groups of individuals that serve as a communication core. Currently, the research on different meso-scale structures such as community and core-periphery structures has been conducted via independent approaches, which precludes the possibility of an algorithmic design that can handle multiple meso-scale structures and deciding which structure explains the observed data better. In this study, we propose a unified formulation for the algorithmic detection and analysis of different meso-scale structures. This facilitates the investigation of hybrid structures that capture the interplay between multiple meso-scale structures and statistical comparison of competing structures, all of which have been hitherto unavailable. We demonstrate the applicability of the methodology in analyzing the human brain network, by determining the dominant organizational structure (communities) of the brain, as well as its auxiliary characteristics (core-periphery).

  14. Unifying Inference of Meso-Scale Structures in Networks.

    Directory of Open Access Journals (Sweden)

    Birkan Tunç

    Full Text Available Networks are among the most prevalent formal representations in scientific studies, employed to depict interactions between objects such as molecules, neuronal clusters, or social groups. Studies performed at meso-scale that involve grouping of objects based on their distinctive interaction patterns form one of the main lines of investigation in network science. In a social network, for instance, meso-scale structures can correspond to isolated social groupings or groups of individuals that serve as a communication core. Currently, the research on different meso-scale structures such as community and core-periphery structures has been conducted via independent approaches, which precludes the possibility of an algorithmic design that can handle multiple meso-scale structures and deciding which structure explains the observed data better. In this study, we propose a unified formulation for the algorithmic detection and analysis of different meso-scale structures. This facilitates the investigation of hybrid structures that capture the interplay between multiple meso-scale structures and statistical comparison of competing structures, all of which have been hitherto unavailable. We demonstrate the applicability of the methodology in analyzing the human brain network, by determining the dominant organizational structure (communities of the brain, as well as its auxiliary characteristics (core-periphery.

  15. Validation of network communicability metrics for the analysis of brain structural networks.

    Directory of Open Access Journals (Sweden)

    Jennifer Andreotti

    Full Text Available Computational network analysis provides new methods to analyze the brain's structural organization based on diffusion imaging tractography data. Networks are characterized by global and local metrics that have recently given promising insights into diagnosis and the further understanding of psychiatric and neurologic disorders. Most of these metrics are based on the idea that information in a network flows along the shortest paths. In contrast to this notion, communicability is a broader measure of connectivity which assumes that information could flow along all possible paths between two nodes. In our work, the features of network metrics related to communicability were explored for the first time in the healthy structural brain network. In addition, the sensitivity of such metrics was analysed using simulated lesions to specific nodes and network connections. Results showed advantages of communicability over conventional metrics in detecting densely connected nodes as well as subsets of nodes vulnerable to lesions. In addition, communicability centrality was shown to be widely affected by the lesions and the changes were negatively correlated with the distance from lesion site. In summary, our analysis suggests that communicability metrics that may provide an insight into the integrative properties of the structural brain network and that these metrics may be useful for the analysis of brain networks in the presence of lesions. Nevertheless, the interpretation of communicability is not straightforward; hence these metrics should be used as a supplement to the more standard connectivity network metrics.

  16. Improving the Reliability of Network Metrics in Structural Brain Networks by Integrating Different Network Weighting Strategies into a Single Graph

    Directory of Open Access Journals (Sweden)

    Stavros I. Dimitriadis

    2017-12-01

    Full Text Available Structural brain networks estimated from diffusion MRI (dMRI via tractography have been widely studied in healthy controls and patients with neurological and psychiatric diseases. However, few studies have addressed the reliability of derived network metrics both node-specific and network-wide. Different network weighting strategies (NWS can be adopted to weight the strength of connection between two nodes yielding structural brain networks that are almost fully-weighted. Here, we scanned five healthy participants five times each, using a diffusion-weighted MRI protocol and computed edges between 90 regions of interest (ROI from the Automated Anatomical Labeling (AAL template. The edges were weighted according to nine different methods. We propose a linear combination of these nine NWS into a single graph using an appropriate diffusion distance metric. We refer to the resulting weighted graph as an Integrated Weighted Structural Brain Network (ISWBN. Additionally, we consider a topological filtering scheme that maximizes the information flow in the brain network under the constraint of the overall cost of the surviving connections. We compared each of the nine NWS and the ISWBN based on the improvement of: (a intra-class correlation coefficient (ICC of well-known network metrics, both node-wise and per network level; and (b the recognition accuracy of each subject compared to the remainder of the cohort, as an attempt to access the uniqueness of the structural brain network for each subject, after first applying our proposed topological filtering scheme. Based on a threshold where the network level ICC should be >0.90, our findings revealed that six out of nine NWS lead to unreliable results at the network level, while all nine NWS were unreliable at the node level. In comparison, our proposed ISWBN performed as well as the best performing individual NWS at the network level, and the ICC was higher compared to all individual NWS at the node

  17. Structure of a randomly grown 2-d network

    DEFF Research Database (Denmark)

    Ajazi, Fioralba; Napolitano, George M.; Turova, Tatyana

    2015-01-01

    We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes in...... in time different phases of the structure. We conclude with a possible explanation of some empirical data on the connections between neurons.......We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes...

  18. Structural Quality of Service in Large-Scale Networks

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup

    , telephony and data. To meet the requirements of the different applications, and to handle the increased vulnerability to failures, the ability to design robust networks providing good Quality of Service is crucial. However, most planning of large-scale networks today is ad-hoc based, leading to highly...... complex networks lacking predictability and global structural properties. The thesis applies the concept of Structural Quality of Service to formulate desirable global properties, and it shows how regular graph structures can be used to obtain such properties.......Digitalization has created the base for co-existence and convergence in communications, leading to an increasing use of multi service networks. This is for example seen in the Fiber To The Home implementations, where a single fiber is used for virtually all means of communication, including TV...

  19. Detecting the overlapping and hierarchical community structure in complex networks

    International Nuclear Information System (INIS)

    Lancichinetti, Andrea; Fortunato, Santo; Kertesz, Janos

    2009-01-01

    Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that are only weakly linked to each other. Uncovering this community structure is one of the most important problems in the field of complex networks. Networks often show a hierarchical organization, with communities embedded within other communities; moreover, nodes can be shared between different communities. Here, we present the first algorithm that finds both overlapping communities and the hierarchical structure. The method is based on the local optimization of a fitness function. Community structure is revealed by peaks in the fitness histogram. The resolution can be tuned by a parameter enabling different hierarchical levels of organization to be investigated. Tests on real and artificial networks give excellent results.

  20. Global tree network for computing structures enabling global processing operations

    Science.gov (United States)

    Blumrich; Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    2010-01-19

    A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

  1. Road Network Selection Based on Road Hierarchical Structure Control

    Directory of Open Access Journals (Sweden)

    HE Haiwei

    2015-04-01

    Full Text Available A new road network selection method based on hierarchical structure is studied. Firstly, road network is built as strokes which are then classified into hierarchical collections according to the criteria of betweenness centrality value (BC value. Secondly, the hierarchical structure of the strokes is enhanced using structural characteristic identification technique. Thirdly, the importance calculation model was established according to the relationships among the hierarchical structure of the strokes. Finally, the importance values of strokes are got supported with the model's hierarchical calculation, and with which the road network is selected. Tests are done to verify the advantage of this method by comparing it with other common stroke-oriented methods using three kinds of typical road network data. Comparision of the results show that this method had few need to semantic data, and could eliminate the negative influence of edge strokes caused by the criteria of BC value well. So, it is better to maintain the global hierarchical structure of road network, and suitable to meet with the selection of various kinds of road network at the same time.

  2. Study of the quasi-free scattering at the reaction 2H(p,2p)n at Esub(p)0 = 14.1 MeV

    International Nuclear Information System (INIS)

    Helten, H.J.

    1980-01-01

    The breakup reaction 2 H(p,2p)n was studied at Ep = 14.1 MeV in complete coincidence experiments on quasifree pp scattering in a systematic range of cinematic situations of the pp-subsystem for c.m. production angles between 90 0 and 140 0 and different violation of the quasifree condition as well on interferences with final-state interaction processes. The absolute differential breakup cross section was compared with approximate solutions of the Faddeev equations with separable s-wave potentials without explicite Coulomb interaction according to Ebenhoeh. The agreement is generally good referring to the form of the spectra, but the theoretical amplitude is in the mean 20% to high. The permanent independence of the quasifree breakup from the scattering parameter asub(pp) doesn't suggest to use this process for the determination of nn-scattering lengths from the mirror reaction 2 H(n,2n)p. (orig.)

  3. Acción pública y consumo colaborativo. Regulación de las viviendas de uso turístico en el contexto p2p

    Directory of Open Access Journals (Sweden)

    Nicolás Alejandro Guillén Navarro

    2016-01-01

    Full Text Available En el marco del denominado turismo colaborativo, las viviendas de uso turístico están revolucionando el modelo de alojamiento a nivel mundial. Apoyadas por su comercialización a través de los entornos p2p y el vacío legal al respecto, en los últimos años han adquirido tal importancia que por parte de los poderes públicos se ha visto necesario su regulación y así poner freno a aspectos tan problemáticos como la economía sumergida que genera dicha actividad o la competencia desleal sobre otros establecimientos de alojamiento turístico reglados. Propietarios, turistas, sector hotelero y Administraciones públicas han generado un interesante debate acerca de las implicaciones y repercusiones asociadas a las viviendas de uso turístico y hasta qué punto debe ejercerse un control sobre ellas. De ahí que este estudio trate de analizar todos estos puntos de vista y dé a conocer cómo se está haciendo frente a este fenómeno en España.

  4. Structure of Small World Innovation Network and Learning Performance

    Directory of Open Access Journals (Sweden)

    Shuang Song

    2014-01-01

    Full Text Available This paper examines the differences of learning performance of 5 MNCs (multinational corporations that filed the largest number of patents in China. We establish the innovation network with the patent coauthorship data by these 5 MNCs and classify the networks by the tail of distribution curve of connections. To make a comparison of the learning performance of these 5 MNCs with differing network structures, we develop an organization learning model by regarding the reality as having m dimensions, which denotes the heterogeneous knowledge about the reality. We further set n innovative individuals that are mutually interactive and own unique knowledge about the reality. A longer (shorter distance between the knowledge of the individual and the reality denotes a lower (higher knowledge level of that individual. Individuals interact with and learn from each other within the small-world network. By making 1,000 numerical simulations and averaging the simulated results, we find that the differing structure of the small-world network leads to the differences of learning performance between these 5 MNCs. The network monopolization negatively impacts and network connectivity positively impacts learning performance. Policy implications in the conclusion section suggest that to improve firm learning performance, it is necessary to establish a flat and connective network.

  5. Impact of constrained rewiring on network structure and node dynamics

    Science.gov (United States)

    Rattana, P.; Berthouze, L.; Kiss, I. Z.

    2014-11-01

    In this paper, we study an adaptive spatial network. We consider a susceptible-infected-susceptible (SIS) epidemic on the network, with a link or contact rewiring process constrained by spatial proximity. In particular, we assume that susceptible nodes break links with infected nodes independently of distance and reconnect at random to susceptible nodes available within a given radius. By systematically manipulating this radius we investigate the impact of rewiring on the structure of the network and characteristics of the epidemic. We adopt a step-by-step approach whereby we first study the impact of rewiring on the network structure in the absence of an epidemic, then with nodes assigned a disease status but without disease dynamics, and finally running network and epidemic dynamics simultaneously. In the case of no labeling and no epidemic dynamics, we provide both analytic and semianalytic formulas for the value of clustering achieved in the network. Our results also show that the rewiring radius and the network's initial structure have a pronounced effect on the endemic equilibrium, with increasingly large rewiring radiuses yielding smaller disease prevalence.

  6. An automated approach to network features of protein structure ensembles

    Science.gov (United States)

    Bhattacharyya, Moitrayee; Bhat, Chanda R; Vishveshwara, Saraswathi

    2013-01-01

    Network theory applied to protein structures provides insights into numerous problems of biological relevance. The explosion in structural data available from PDB and simulations establishes a need to introduce a standalone-efficient program that assembles network concepts/parameters under one hood in an automated manner. Herein, we discuss the development/application of an exhaustive, user-friendly, standalone program package named PSN-Ensemble, which can handle structural ensembles generated through molecular dynamics (MD) simulation/NMR studies or from multiple X-ray structures. The novelty in network construction lies in the explicit consideration of side-chain interactions among amino acids. The program evaluates network parameters dealing with topological organization and long-range allosteric communication. The introduction of a flexible weighing scheme in terms of residue pairwise cross-correlation/interaction energy in PSN-Ensemble brings in dynamical/chemical knowledge into the network representation. Also, the results are mapped on a graphical display of the structure, allowing an easy access of network analysis to a general biological community. The potential of PSN-Ensemble toward examining structural ensemble is exemplified using MD trajectories of an ubiquitin-conjugating enzyme (UbcH5b). Furthermore, insights derived from network parameters evaluated using PSN-Ensemble for single-static structures of active/inactive states of β2-adrenergic receptor and the ternary tRNA complexes of tyrosyl tRNA synthetases (from organisms across kingdoms) are discussed. PSN-Ensemble is freely available from http://vishgraph.mbu.iisc.ernet.in/PSN-Ensemble/psn_index.html. PMID:23934896

  7. Comparison and validation of community structures in complex networks

    Science.gov (United States)

    Gustafsson, Mika; Hörnquist, Michael; Lombardi, Anna

    2006-07-01

    The issue of partitioning a network into communities has attracted a great deal of attention recently. Most authors seem to equate this issue with the one of finding the maximum value of the modularity, as defined by Newman. Since the problem formulated this way is believed to be NP-hard, most effort has gone into the construction of search algorithms, and less to the question of other measures of community structures, similarities between various partitionings and the validation with respect to external information. Here we concentrate on a class of computer generated networks and on three well-studied real networks which constitute a bench-mark for network studies; the karate club, the US college football teams and a gene network of yeast. We utilize some standard ways of clustering data (originally not designed for finding community structures in networks) and show that these classical methods sometimes outperform the newer ones. We discuss various measures of the strength of the modular structure, and show by examples features and drawbacks. Further, we compare different partitions by applying some graph-theoretic concepts of distance, which indicate that one of the quality measures of the degree of modularity corresponds quite well with the distance from the true partition. Finally, we introduce a way to validate the partitionings with respect to external data when the nodes are classified but the network structure is unknown. This is here possible since we know everything of the computer generated networks, as well as the historical answer to how the karate club and the football teams are partitioned in reality. The partitioning of the gene network is validated by use of the Gene Ontology database, where we show that a community in general corresponds to a biological process.

  8. Developing a robust wireless sensor network structure for environmental sensing

    Science.gov (United States)

    Zhang, Z.; Oroza, C.; Glaser, S. D.; Bales, R. C.; Conklin, M. H.

    2013-12-01

    The American River Hydrologic Observatory is being strategically deployed as a real-time ground-based measurement network that delivers accurate and timely information on snow conditions and other hydrologic attributes with a previously unheard of granularity of time and space. The basin-scale network involves 18 sub-networks set out at physiographically representative locations spanning the seasonally snow-covered half of the 5000 km2 American river basin. Each sub-network, covering about a 1-km2 area, consists of 10 wirelessly networked sensing nodes that continuously measure and telemeter temperature, and snow depth; plus selected locations are equipped with sensors for relative humidity, solar radiation, and soil moisture at several depths. The sensor locations were chosen to maximize the variance sampled for snow depth within the basin. Network design and deployment involves an iterative but efficient process. After sensor-station locations are determined, a robust network of interlinking sensor stations and signal repeaters must be constructed to route sensor data to a central base station with a two-way communicable data uplink. Data can then be uploaded from site to remote servers in real time through satellite and cell modems. Signal repeaters are placed for robustness of a self-healing network with redundant signal paths to the base station. Manual, trial-and-error heuristic approaches for node placement are inefficient and labor intensive. In that approach field personnel must restructure the network in real time and wait for new network statistics to be calculated at the base station before finalizing a placement, acting without knowledge of the global topography or overall network structure. We show how digital elevation plus high-definition aerial photographs to give foliage coverage can optimize planning of signal repeater placements and guarantee a robust network structure prior to the physical deployment. We can also 'stress test' the final network

  9. Dynamics of Networks if Everyone Strives for Structural Holes

    NARCIS (Netherlands)

    Buskens, Vincent; Rijt, Arnout van de

    2008-01-01

    When entrepreneurs enter structural holes in networks, they can exploit the related benefits. Evidence for these benefits has steadily accumulated. The authors ask whether those who strive for such structural advantages can maintain them if others follow their example. Burt speculates that they

  10. A Mapping Between Structural and Functional Brain Networks.

    Science.gov (United States)

    Meier, Jil; Tewarie, Prejaas; Hillebrand, Arjan; Douw, Linda; van Dijk, Bob W; Stufflebeam, Steven M; Van Mieghem, Piet

    2016-05-01

    The relationship between structural and functional brain networks is still highly debated. Most previous studies have used a single functional imaging modality to analyze this relationship. In this work, we use multimodal data, from functional MRI, magnetoencephalography, and diffusion tensor imaging, and assume that there exists a mapping between the connectivity matrices of the resting-state functional and structural networks. We investigate this mapping employing group averaged as well as individual data. We indeed find a significantly high goodness of fit level for this structure-function mapping. Our analysis suggests that a functional connection is shaped by all walks up to the diameter in the structural network in both modality cases. When analyzing the inverse mapping, from function to structure, longer walks in the functional network also seem to possess minor influence on the structural connection strengths. Even though similar overall properties for the structure-function mapping are found for different functional modalities, our results indicate that the structure-function relationship is modality dependent.

  11. Peer-to-Peer Networking -RE-SONANCE

    Indian Academy of Sciences (India)

    networking, operating systems and embedded systems. Peer-to-Peer (P2P) networking in recent times has been touted as .... Gnutella (General file sharing) P2P service at the same time. 2. .... The data processing does not occur in 'real time' ...

  12. Structural parameter identifiability analysis for dynamic reaction networks

    DEFF Research Database (Denmark)

    Davidescu, Florin Paul; Jørgensen, Sten Bay

    2008-01-01

    method based on Lie derivatives. The proposed systematic two phase methodology is illustrated on a mass action based model for an enzymatically catalyzed reaction pathway network where only a limited set of variables is measured. The methodology clearly pinpoints the structurally identifiable parameters...... where for a given set of measured variables it is desirable to investigate which parameters may be estimated prior to spending computational effort on the actual estimation. This contribution addresses the structural parameter identifiability problem for the typical case of reaction network models....... The proposed analysis is performed in two phases. The first phase determines the structurally identifiable reaction rates based on reaction network stoichiometry. The second phase assesses the structural parameter identifiability of the specific kinetic rate expressions using a generating series expansion...

  13. The overlapping community structure of structural brain network in young healthy individuals.

    Directory of Open Access Journals (Sweden)

    Kai Wu

    2011-05-01

    Full Text Available Community structure is a universal and significant feature of many complex networks in biology, society, and economics. Community structure has also been revealed in human brain structural and functional networks in previous studies. However, communities overlap and share many edges and nodes. Uncovering the overlapping community structure of complex networks remains largely unknown in human brain networks. Here, using regional gray matter volume, we investigated the structural brain network among 90 brain regions (according to a predefined anatomical atlas in 462 young, healthy individuals. Overlapped nodes between communities were defined by assuming that nodes (brain regions can belong to more than one community. We demonstrated that 90 brain regions were organized into 5 overlapping communities associated with several well-known brain systems, such as the auditory/language, visuospatial, emotion, decision-making, social, control of action, memory/learning, and visual systems. The overlapped nodes were mostly involved in an inferior-posterior pattern and were primarily related to auditory and visual perception. The overlapped nodes were mainly attributed to brain regions with higher node degrees and nodal efficiency and played a pivotal role in the flow of information through the structural brain network. Our results revealed fuzzy boundaries between communities by identifying overlapped nodes and provided new insights into the understanding of the relationship between the structure and function of the human brain. This study provides the first report of the overlapping community structure of the structural network of the human brain.

  14. Effects of Neuromodulation on Excitatory-Inhibitory Neural Network Dynamics Depend on Network Connectivity Structure

    Science.gov (United States)

    Rich, Scott; Zochowski, Michal; Booth, Victoria

    2018-01-01

    Acetylcholine (ACh), one of the brain's most potent neuromodulators, can affect intrinsic neuron properties through blockade of an M-type potassium current. The effect of ACh on excitatory and inhibitory cells with this potassium channel modulates their membrane excitability, which in turn affects their tendency to synchronize in networks. Here, we study the resulting changes in dynamics in networks with inter-connected excitatory and inhibitory populations (E-I networks), which are ubiquitous in the brain. Utilizing biophysical models of E-I networks, we analyze how the network connectivity structure in terms of synaptic connectivity alters the influence of ACh on the generation of synchronous excitatory bursting. We investigate networks containing all combinations of excitatory and inhibitory cells with high (Type I properties) or low (Type II properties) modulatory tone. To vary network connectivity structure, we focus on the effects of the strengths of inter-connections between excitatory and inhibitory cells (E-I synapses and I-E synapses), and the strengths of intra-connections among excitatory cells (E-E synapses) and among inhibitory cells (I-I synapses). We show that the presence of ACh may or may not affect the generation of network synchrony depending on the network connectivity. Specifically, strong network inter-connectivity induces synchronous excitatory bursting regardless of the cellular propensity for synchronization, which aligns with predictions of the PING model. However, when a network's intra-connectivity dominates its inter-connectivity, the propensity for synchrony of either inhibitory or excitatory cells can determine the generation of network-wide bursting.

  15. Brain networks that track musical structure.

    Science.gov (United States)

    Janata, Petr

    2005-12-01

    As the functional neuroimaging literature grows, it becomes increasingly apparent that music and musical activities engage diverse regions of the brain. In this paper I discuss two studies to illustrate that exactly which brain areas are observed to be responsive to musical stimuli and tasks depends on the tasks and the methods used to describe the tasks and the stimuli. In one study, subjects listened to polyphonic music and were asked to either orient their attention selectively to individual instruments or in a divided or holistic manner across multiple instruments. The network of brain areas that was recruited changed subtly with changes in the task instructions. The focus of the second study was to identify brain regions that follow the pattern of movement of a continuous melody through the tonal space defined by the major and minor keys of Western tonal music. Such an area was identified in the rostral medial prefrontal cortex. This observation is discussed in the context of other neuroimaging studies that implicate this region in inwardly directed mental states involving decisions about the self, autobiographical memory, the cognitive regulation of emotion, affective responses to musical stimuli, and familiarity judgments about musical stimuli. Together with observations that these regions are among the last to atrophy in Alzheimer disease, and that these patients appear to remain responsive to autobiographically salient musical stimuli, very early evidence is emerging from the literature for the hypothesis that the rostral medial prefrontal cortex is a node that is important for binding music with memories within a broader music-responsive network.

  16. Structure-based control of complex networks with nonlinear dynamics.

    Science.gov (United States)

    Zañudo, Jorge Gomez Tejeda; Yang, Gang; Albert, Réka

    2017-07-11

    What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system toward any of its natural long-term dynamic behaviors, regardless of the specific functional forms and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of structural controllability in control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case but not in specific model instances.

  17. Modeling structure and resilience of the dark network.

    Science.gov (United States)

    De Domenico, Manlio; Arenas, Alex

    2017-02-01

    While the statistical and resilience properties of the Internet are no longer changing significantly across time, the Darknet, a network devoted to keep anonymous its traffic, still experiences rapid changes to improve the security of its users. Here we study the structure of the Darknet and find that its topology is rather peculiar, being characterized by a nonhomogeneous distribution of connections, typical of scale-free networks; very short path lengths and high clustering, typical of small-world networks; and lack of a core of highly connected nodes. We propose a model to reproduce such features, demonstrating that the mechanisms used to improve cybersecurity are responsible for the observed topology. Unexpectedly, we reveal that its peculiar structure makes the Darknet much more resilient than the Internet (used as a benchmark for comparison at a descriptive level) to random failures, targeted attacks, and cascade failures, as a result of adaptive changes in response to the attempts of dismantling the network across time.

  18. Offspring social network structure predicts fitness in families.

    Science.gov (United States)

    Royle, Nick J; Pike, Thomas W; Heeb, Philipp; Richner, Heinz; Kölliker, Mathias

    2012-12-22

    Social structures such as families emerge as outcomes of behavioural interactions among individuals, and can evolve over time if families with particular types of social structures tend to leave more individuals in subsequent generations. The social behaviour of interacting individuals is typically analysed as a series of multiple dyadic (pair-wise) interactions, rather than a network of interactions among multiple individuals. However, in species where parents feed dependant young, interactions within families nearly always involve more than two individuals simultaneously. Such social networks of interactions at least partly reflect conflicts of interest over the provision of costly parental investment. Consequently, variation in family network structure reflects variation in how conflicts of interest are resolved among family members. Despite its importance in understanding the evolution of emergent properties of social organization such as family life and cooperation, nothing is currently known about how selection acts on the structure of social networks. Here, we show that the social network structure of broods of begging nestling great tits Parus major predicts fitness in families. Although selection at the level of the individual favours large nestlings, selection at the level of the kin-group primarily favours families that resolve conflicts most effectively.

  19. Resistance and Security Index of Networks: Structural Information Perspective of Network Security

    Science.gov (United States)

    Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

    2016-01-01

    Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks. PMID:27255783

  20. Resistance and Security Index of Networks: Structural Information Perspective of Network Security.

    Science.gov (United States)

    Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

    2016-06-03

    Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

  1. Resistance and Security Index of Networks: Structural Information Perspective of Network Security

    Science.gov (United States)

    Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

    2016-06-01

    Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

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

    Science.gov (United States)

    Carnegie, Nicole Bohme

    2018-01-30

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

  3. Robust Learning of Fixed-Structure Bayesian Networks

    OpenAIRE

    Diakonikolas, Ilias; Kane, Daniel; Stewart, Alistair

    2016-01-01

    We investigate the problem of learning Bayesian networks in an agnostic model where an $\\epsilon$-fraction of the samples are adversarially corrupted. Our agnostic learning model is similar to -- in fact, stronger than -- Huber's contamination model in robust statistics. In this work, we study the fully observable Bernoulli case where the structure of the network is given. Even in this basic setting, previous learning algorithms either run in exponential time or lose dimension-dependent facto...

  4. Structural controllability and controlling centrality of temporal networks.

    Science.gov (United States)

    Pan, Yujian; Li, Xiang

    2014-01-01

    Temporal networks are such networks where nodes and interactions may appear and disappear at various time scales. With the evidence of ubiquity of temporal networks in our economy, nature and society, it's urgent and significant to focus on its structural controllability as well as the corresponding characteristics, which nowadays is still an untouched topic. We develop graphic tools to study the structural controllability as well as its characteristics, identifying the intrinsic mechanism of the ability of individuals in controlling a dynamic and large-scale temporal network. Classifying temporal trees of a temporal network into different types, we give (both upper and lower) analytical bounds of the controlling centrality, which are verified by numerical simulations of both artificial and empirical temporal networks. We find that the positive relationship between aggregated degree and controlling centrality as well as the scale-free distribution of node's controlling centrality are virtually independent of the time scale and types of datasets, meaning the inherent robustness and heterogeneity of the controlling centrality of nodes within temporal networks.

  5. Sampling from complex networks with high community structures.

    Science.gov (United States)

    Salehi, Mostafa; Rabiee, Hamid R; Rajabi, Arezo

    2012-06-01

    In this paper, we propose a novel link-tracing sampling algorithm, based on the concepts from PageRank vectors, to sample from networks with high community structures. Our method has two phases; (1) Sampling the closest nodes to the initial nodes by approximating personalized PageRank vectors and (2) Jumping to a new community by using PageRank vectors and unknown neighbors. Empirical studies on several synthetic and real-world networks show that the proposed method improves the performance of network sampling compared to the popular link-based sampling methods in terms of accuracy and visited communities.

  6. Completely random measures for modelling block-structured sparse networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Schmidt, Mikkel Nørgaard; Mørup, Morten

    2016-01-01

    Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks...... have a power-law distribution of the vertices which in turn implies the number of edges scale slower than quadratically in the number of vertices. These assumptions are fundamentally irreconcilable as the Aldous-Hoover theorem implies quadratic scaling of the number of edges. Recently Caron and Fox...

  7. Mapping human whole-brain structural networks with diffusion MRI.

    Directory of Open Access Journals (Sweden)

    Patric Hagmann

    Full Text Available Understanding the large-scale structural network formed by neurons is a major challenge in system neuroscience. A detailed connectivity map covering the entire brain would therefore be of great value. Based on diffusion MRI, we propose an efficient methodology to generate large, comprehensive and individual white matter connectional datasets of the living or dead, human or animal brain. This non-invasive tool enables us to study the basic and potentially complex network properties of the entire brain. For two human subjects we find that their individual brain networks have an exponential node degree distribution and that their global organization is in the form of a small world.

  8. Structure and Cooptition in Urban Networks

    NARCIS (Netherlands)

    M.J. Burger (Martijn)

    2011-01-01

    textabstractOver the past decades, demographic changes, advances in transportation and communication technology, and the growth of the services sector have had a significant impact on the spatial structure of regions. Monocentric cities are disappearing and developing into polycentric metropolitan

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

  10. Topological structure and mechanics of glassy polymer networks.

    Science.gov (United States)

    Elder, Robert M; Sirk, Timothy W

    2017-11-22

    The influence of chain-level network architecture (i.e., topology) on mechanics was explored for unentangled polymer networks using a blend of coarse-grained molecular simulations and graph-theoretic concepts. A simple extension of the Watts-Strogatz model is proposed to control the graph properties of the network such that the corresponding physical properties can be studied with simulations. The architecture of polymer networks assembled with a dynamic curing approach were compared with the extended Watts-Strogatz model, and found to agree surprisingly well. The final cured structures of the dynamically-assembled networks were nearly an intermediate between lattice and random connections due to restrictions imposed by the finite length of the chains. Further, the uni-axial stress response, character of the bond breaking, and non-affine displacements of fully-cured glassy networks were analyzed as a function of the degree of disorder in the network architecture. It is shown that the architecture strongly affects the network stability, flow stress, onset of bond breaking, and ultimate stress while leaving the modulus and yield point nearly unchanged. The results show that internal restrictions imposed by the network architecture alter the chain-level response through changes to the crosslink dynamics in the flow regime and through the degree of coordinated chain failure at the ultimate stress. The properties considered here are shown to be sensitive to even incremental changes to the architecture and, therefore, the overall network architecture, beyond simple defects, is predicted to be a meaningful physical parameter in the mechanics of glassy polymer networks.

  11. Complex modular structure of large-scale brain networks

    Science.gov (United States)

    Valencia, M.; Pastor, M. A.; Fernández-Seara, M. A.; Artieda, J.; Martinerie, J.; Chavez, M.

    2009-06-01

    Modular structure is ubiquitous among real-world networks from related proteins to social groups. Here we analyze the modular organization of brain networks at a large scale (voxel level) extracted from functional magnetic resonance imaging signals. By using a random-walk-based method, we unveil the modularity of brain webs and show modules with a spatial distribution that matches anatomical structures with functional significance. The functional role of each node in the network is studied by analyzing its patterns of inter- and intramodular connections. Results suggest that the modular architecture constitutes the structural basis for the coexistence of functional integration of distant and specialized brain areas during normal brain activities at rest.

  12. Coevolution of game and network structure with adjustable linking

    Science.gov (United States)

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

    2009-12-01

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

  13. Topological properties of complex networks in protein structures

    Science.gov (United States)

    Kim, Kyungsik; Jung, Jae-Won; Min, Seungsik

    2014-03-01

    We study topological properties of networks in structural classification of proteins. We model the native-state protein structure as a network made of its constituent amino-acids and their interactions. We treat four structural classes of proteins composed predominantly of α helices and β sheets and consider several proteins from each of these classes whose sizes range from amino acids of the Protein Data Bank. Particularly, we simulate and analyze the network metrics such as the mean degree, the probability distribution of degree, the clustering coefficient, the characteristic path length, the local efficiency, and the cost. This work was supported by the KMAR and DP under Grant WISE project (153-3100-3133-302-350).

  14. Research on Community Structure in Bus Transport Networks

    International Nuclear Information System (INIS)

    Yang Xuhua; Wang Bo; Sun Youxian

    2009-01-01

    We abstract the bus transport networks (BTNs) to two kinds of complex networks with space L and space P methods respectively. Using improved community detecting algorithm (PKM agglomerative algorithm), we analyze the community property of two kinds of BTNs graphs. The results show that the BTNs graph described with space L method have obvious community property, but the other kind of BTNs graph described with space P method have not. The reason is that the BTNs graph described with space P method have the intense overlapping community property and general community division algorithms can not identify this kind of community structure. To overcome this problem, we propose a novel community structure called N-depth community and present a corresponding community detecting algorithm, which can detect overlapping community. Applying the novel community structure and detecting algorithm to a BTN evolution model described with space P, whose network property agrees well with real BTNs', we get obvious community property. (general)

  15. Development of human brain structural networks through infancy and childhood.

    Science.gov (United States)

    Huang, Hao; Shu, Ni; Mishra, Virendra; Jeon, Tina; Chalak, Lina; Wang, Zhiyue J; Rollins, Nancy; Gong, Gaolang; Cheng, Hua; Peng, Yun; Dong, Qi; He, Yong

    2015-05-01

    During human brain development through infancy and childhood, microstructural and macrostructural changes take place to reshape the brain's structural networks and better adapt them to sophisticated functional and cognitive requirements. However, structural topological configuration of the human brain during this specific development period is not well understood. In this study, diffusion magnetic resonance image (dMRI) of 25 neonates, 13 toddlers, and 25 preadolescents were acquired to characterize network dynamics at these 3 landmark cross-sectional ages during early childhood. dMRI tractography was used to construct human brain structural networks, and the underlying topological properties were quantified by graph-theory approaches. Modular organization and small-world attributes are evident at birth with several important topological metrics increasing monotonically during development. Most significant increases of regional nodes occur in the posterior cingulate cortex, which plays a pivotal role in the functional default mode network. Positive correlations exist between nodal efficiencies and fractional anisotropy of the white matter traced from these nodes, while correlation slopes vary among the brain regions. These results reveal substantial topological reorganization of human brain structural networks through infancy and childhood, which is likely to be the outcome of both heterogeneous strengthening of the major white matter tracts and pruning of other axonal fibers. © The Author 2013. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  16. Romanian network for structural integrity assessment of nuclear components

    International Nuclear Information System (INIS)

    Roth, Maria; Constantinescu, Dan Mihai; Brad, Sebastian; Ducu, Catalin

    2008-01-01

    Full text: Based of the Romanian option to develop and operate nuclear facilities, using as model the networks created at European level and taking into account the international importance of the structural integrity assessments for lifetime extension of the nuclear components, a national Project started since 2005 in the framework of the National Program 'Research of Excellence', Modulus I 2006-2008, managed by the Ministry of Education and Research. Entitled 'Integrated Network for Structural Integrity Monitoring of Critical Components in Nuclear Facilities', with the acronym RIMIS, the Project had two main objectives: - to elaborate a procedure applicable to the structural integrity assessment of the critical components used in Romanian nuclear facilities; - to integrate the national networking in a similar one, at European level, to enhance the scientific significance of Romanian R and D organizations as well as to increase the contribution to solving one of the major issue of the nuclear field. The paper aimed to present the activities performed in the Romanian institutes, involved in the Project, the final results obtained as part of the R and D activities, including experimental, theoretical and modeling ones regarding structural integrity assessment of nuclear components employed in CANDU type reactors. Also the activity carried out in the framework of the NULIFE network, created at European level of the FP6 Program and sustained by the RIMIS network will be described. (authors)

  17. Structural covariance networks across healthy young adults and their consistency.

    Science.gov (United States)

    Guo, Xiaojuan; Wang, Yan; Guo, Taomei; Chen, Kewei; Zhang, Jiacai; Li, Ke; Jin, Zhen; Yao, Li

    2015-08-01

    To investigate structural covariance networks (SCNs) as measured by regional gray matter volumes with structural magnetic resonance imaging (MRI) from healthy young adults, and to examine their consistency and stability. Two independent cohorts were included in this study: Group 1 (82 healthy subjects aged 18-28 years) and Group 2 (109 healthy subjects aged 20-28 years). Structural MRI data were acquired at 3.0T and 1.5T using a magnetization prepared rapid-acquisition gradient echo sequence for these two groups, respectively. We applied independent component analysis (ICA) to construct SCNs and further applied the spatial overlap ratio and correlation coefficient to evaluate the spatial consistency of the SCNs between these two datasets. Seven and six independent components were identified for Group 1 and Group 2, respectively. Moreover, six SCNs including the posterior default mode network, the visual and auditory networks consistently existed across the two datasets. The overlap ratios and correlation coefficients of the visual network reached the maximums of 72% and 0.71. This study demonstrates the existence of consistent SCNs corresponding to general functional networks. These structural covariance findings may provide insight into the underlying organizational principles of brain anatomy. © 2014 Wiley Periodicals, Inc.

  18. Development of Human Brain Structural Networks Through Infancy and Childhood

    Science.gov (United States)

    Huang, Hao; Shu, Ni; Mishra, Virendra; Jeon, Tina; Chalak, Lina; Wang, Zhiyue J.; Rollins, Nancy; Gong, Gaolang; Cheng, Hua; Peng, Yun; Dong, Qi; He, Yong

    2015-01-01

    During human brain development through infancy and childhood, microstructural and macrostructural changes take place to reshape the brain's structural networks and better adapt them to sophisticated functional and cognitive requirements. However, structural topological configuration of the human brain during this specific development period is not well understood. In this study, diffusion magnetic resonance image (dMRI) of 25 neonates, 13 toddlers, and 25 preadolescents were acquired to characterize network dynamics at these 3 landmark cross-sectional ages during early childhood. dMRI tractography was used to construct human brain structural networks, and the underlying topological properties were quantified by graph-theory approaches. Modular organization and small-world attributes are evident at birth with several important topological metrics increasing monotonically during development. Most significant increases of regional nodes occur in the posterior cingulate cortex, which plays a pivotal role in the functional default mode network. Positive correlations exist between nodal efficiencies and fractional anisotropy of the white matter traced from these nodes, while correlation slopes vary among the brain regions. These results reveal substantial topological reorganization of human brain structural networks through infancy and childhood, which is likely to be the outcome of both heterogeneous strengthening of the major white matter tracts and pruning of other axonal fibers. PMID:24335033

  19. Network dynamics and its relationships to topology and coupling structure in excitable complex networks

    International Nuclear Information System (INIS)

    Zhang Li-Sheng; Mi Yuan-Yuan; Gu Wei-Feng; Hu Gang

    2014-01-01

    All dynamic complex networks have two important aspects, pattern dynamics and network topology. Discovering different types of pattern dynamics and exploring how these dynamics depend on network topologies are tasks of both great theoretical importance and broad practical significance. In this paper we study the oscillatory behaviors of excitable complex networks (ECNs) and find some interesting dynamic behaviors of ECNs in oscillatory probability, the multiplicity of oscillatory attractors, period distribution, and different types of oscillatory patterns (e.g., periodic, quasiperiodic, and chaotic). In these aspects, we further explore strikingly sharp differences among network dynamics induced by different topologies (random or scale-free topologies) and different interaction structures (symmetric or asymmetric couplings). The mechanisms behind these differences are explained physically. (interdisciplinary physics and related areas of science and technology)

  20. Network structure detection and analysis of Shanghai stock market

    Directory of Open Access Journals (Sweden)

    Sen Wu

    2015-04-01

    Full Text Available Purpose: In order to investigate community structure of the component stocks of SSE (Shanghai Stock Exchange 180-index, a stock correlation network is built to find the intra-community and inter-community relationship. Design/methodology/approach: The stock correlation network is built taking the vertices as stocks and edges as correlation coefficients of logarithm returns of stock price. It is built as undirected weighted at first. GN algorithm is selected to detect community structure after transferring the network into un-weighted with different thresholds. Findings: The result of the network community structure analysis shows that the stock market has obvious industrial characteristics. Most of the stocks in the same industry or in the same supply chain are assigned to the same community. The correlation of the internal stock prices’ fluctuation is closer than in different communities. The result of community structure detection also reflects correlations among different industries. Originality/value: Based on the analysis of the community structure in Shanghai stock market, the result reflects some industrial characteristics, which has reference value to relationship among industries or sub-sectors of listed companies.

  1. Sensitivity analysis of human brain structural network construction

    Directory of Open Access Journals (Sweden)

    Kuang Wei

    2017-12-01

    Full Text Available Network neuroscience leverages diffusion-weighted magnetic resonance imaging and tractography to quantify structural connectivity of the human brain. However, scientists and practitioners lack a clear understanding of the effects of varying tractography parameters on the constructed structural networks. With diffusion images from the Human Connectome Project (HCP, we characterize how structural networks are impacted by the spatial resolution of brain atlases, total number of tractography streamlines, and grey matter dilation with various graph metrics. We demonstrate how injudicious combinations of highly refined brain parcellations and low numbers of streamlines may inadvertently lead to disconnected network models with isolated nodes. Furthermore, we provide solutions to significantly reduce the likelihood of generating disconnected networks. In addition, for different tractography parameters, we investigate the distributions of values taken by various graph metrics across the population of HCP subjects. Analyzing the ranks of individual subjects within the graph metric distributions, we find that the ranks of individuals are affected differently by atlas scale changes. Our work serves as a guideline for researchers to optimize the selection of tractography parameters and illustrates how biological characteristics of the brain derived in network neuroscience studies can be affected by the choice of atlas parcellation schemes. Diffusion tractography has been proven to be a promising noninvasive technique to study the network properties of the human brain. However, how various tractography and network construction parameters affect network properties has not been studied using a large cohort of high-quality data. We utilize data provided by the Human Connectome Project to characterize the changes to network properties induced by varying the brain parcellation atlas scales, the number of reconstructed tractography tracks, and the degree of grey

  2. The structure and resilience of financial market networks.

    Science.gov (United States)

    Peron, Thomas Kaue Dal'Maso; Costa, Luciano da Fontoura; Rodrigues, Francisco A

    2012-03-01

    Financial markets can be viewed as a highly complex evolving system that is very sensitive to economic instabilities. The complex organization of the market can be represented in a suitable fashion in terms of complex networks, which can be constructed from stock prices such that each pair of stocks is connected by a weighted edge that encodes the distance between them. In this work, we propose an approach to analyze the topological and dynamic evolution of financial networks based on the stock correlation matrices. An entropy-related measurement is adopted to quantify the robustness of the evolving financial market organization. It is verified that the network topological organization suffers strong variation during financial instabilities and the networks in such periods become less robust. A statistical robust regression model is proposed to quantity the relationship between the network structure and resilience. The obtained coefficients of such model indicate that the average shortest path length is the measurement most related to network resilience coefficient. This result indicates that a collective behavior is observed between stocks during financial crisis. More specifically, stocks tend to synchronize their price evolution, leading to a high correlation between pair of stock prices, which contributes to the increase in distance between them and, consequently, decrease the network resilience.

  3. Global network structure of dominance hierarchy of ant workers.

    Science.gov (United States)

    Shimoji, Hiroyuki; Abe, Masato S; Tsuji, Kazuki; Masuda, Naoki

    2014-10-06

    Dominance hierarchy among animals is widespread in various species and believed to serve to regulate resource allocation within an animal group. Unlike small groups, however, detection and quantification of linear hierarchy in large groups of animals are a difficult task. Here, we analyse aggression-based dominance hierarchies formed by worker ants in Diacamma sp. as large directed networks. We show that the observed dominance networks are perfect or approximate directed acyclic graphs, which are consistent with perfect linear hierarchy. The observed networks are also sparse and random but significantly different from networks generated through thinning of the perfect linear tournament (i.e. all individuals are linearly ranked and dominance relationship exists between every pair of individuals). These results pertain to global structure of the networks, which contrasts with the previous studies inspecting frequencies of different types of triads. In addition, the distribution of the out-degree (i.e. number of workers that the focal worker attacks), not in-degree (i.e. number of workers that attack the focal worker), of each observed network is right-skewed. Those having excessively large out-degrees are located near the top, but not the top, of the hierarchy. We also discuss evolutionary implications of the discovered properties of dominance networks. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

  4. The structure and resilience of financial market networks

    Science.gov (United States)

    Kauê Dal'Maso Peron, Thomas; da Fontoura Costa, Luciano; Rodrigues, Francisco A.

    2012-03-01

    Financial markets can be viewed as a highly complex evolving system that is very sensitive to economic instabilities. The complex organization of the market can be represented in a suitable fashion in terms of complex networks, which can be constructed from stock prices such that each pair of stocks is connected by a weighted edge that encodes the distance between them. In this work, we propose an approach to analyze the topological and dynamic evolution of financial networks based on the stock correlation matrices. An entropy-related measurement is adopted to quantify the robustness of the evolving financial market organization. It is verified that the network topological organization suffers strong variation during financial instabilities and the networks in such periods become less robust. A statistical robust regression model is proposed to quantity the relationship between the network structure and resilience. The obtained coefficients of such model indicate that the average shortest path length is the measurement most related to network resilience coefficient. This result indicates that a collective behavior is observed between stocks during financial crisis. More specifically, stocks tend to synchronize their price evolution, leading to a high correlation between pair of stock prices, which contributes to the increase in distance between them and, consequently, decrease the network resilience.

  5. Learning Orthographic Structure With Sequential Generative Neural Networks.

    Science.gov (United States)

    Testolin, Alberto; Stoianov, Ivilin; Sperduti, Alessandro; Zorzi, Marco

    2016-04-01

    Learning the structure of event sequences is a ubiquitous problem in cognition and particularly in language. One possible solution is to learn a probabilistic generative model of sequences that allows making predictions about upcoming events. Though appealing from a neurobiological standpoint, this approach is typically not pursued in connectionist modeling. Here, we investigated a sequential version of the restricted Boltzmann machine (RBM), a stochastic recurrent neural network that extracts high-order structure from sensory data through unsupervised generative learning and can encode contextual information in the form of internal, distributed representations. We assessed whether this type of network can extract the orthographic structure of English monosyllables by learning a generative model of the letter sequences forming a word training corpus. We show that the network learned an accurate probabilistic model of English graphotactics, which can be used to make predictions about the letter following a given context as well as to autonomously generate high-quality pseudowords. The model was compared to an extended version of simple recurrent networks, augmented with a stochastic process that allows autonomous generation of sequences, and to non-connectionist probabilistic models (n-grams and hidden Markov models). We conclude that sequential RBMs and stochastic simple recurrent networks are promising candidates for modeling cognition in the temporal domain. Copyright © 2015 Cognitive Science Society, Inc.

  6. Age structure and cooperation in coevolutionary games on dynamic network

    Science.gov (United States)

    Qin, Zilong; Hu, Zhenhua; Zhou, Xiaoping; Yi, Jingzhang

    2015-04-01

    Our proposed model imitates the growth of a population and describes the age structure and the level of cooperation in games on dynamic network with continuous changes of structure and topology. The removal of nodes and links caused by age-dependent attack, together with the nodes addition standing for the newborns of population, badly ruins Matthew effect in this coevolutionary process. Though the network is generated by growth and preferential attachment, it degenerates into random network and it is no longer heterogeneous. When the removal of nodes and links is equal to the addition of nodes and links, the size of dynamic network is maintained in steady-state, so is the low level of cooperation. Severe structure variation, homogeneous topology and continuous invasion of new defection jointly make dynamic network unsuitable for the survival of cooperator even when the probability with which the newborn players initially adopt the strategy cooperation is high, while things change slightly when the connections of newborn players are restricted. Fortunately, moderate interactions in a generation trigger an optimal recovering process to encourage cooperation. The model developed in this paper outlines an explanation of the cohesion changes in the development process of an organization. Some suggestions for cooperative behavior improvement are given in the end.

  7. Brain Structure Network Analysis in Patients with Obstructive Sleep Apnea.

    Directory of Open Access Journals (Sweden)

    Yun-Gang Luo

    Full Text Available Childhood obstructive sleep apnea (OSA is a sleeping disorder commonly affecting school-aged children and is characterized by repeated episodes of blockage of the upper airway during sleep. In this study, we performed a graph theoretical analysis on the brain morphometric correlation network in 25 OSA patients (OSA group; 5 female; mean age, 10.1 ± 1.8 years and investigated the topological alterations in global and regional properties compared with 20 healthy control individuals (CON group; 6 females; mean age, 10.4 ± 1.8 years. A structural correlation network based on regional gray matter volume was constructed respectively for each group. Our results revealed a significantly decreased mean local efficiency in the OSA group over the density range of 0.32-0.44 (p < 0.05. Regionally, the OSAs showed a tendency of decreased betweenness centrality in the left angular gyrus, and a tendency of decreased degree in the right lingual and inferior frontal (orbital part gyrus (p < 0.005, uncorrected. We also found that the network hubs in OSA and controls were distributed differently. To the best of our knowledge, this is the first study that characterizes the brain structure network in OSA patients and invests the alteration of topological properties of gray matter volume structural network. This study may help to provide new evidence for understanding the neuropathophysiology of OSA from a topological perspective.

  8. Brain Structure Network Analysis in Patients with Obstructive Sleep Apnea.

    Science.gov (United States)

    Luo, Yun-Gang; Wang, Defeng; Liu, Kai; Weng, Jian; Guan, Yuefeng; Chan, Kate C C; Chu, Winnie C W; Shi, Lin

    2015-01-01

    Childhood obstructive sleep apnea (OSA) is a sleeping disorder commonly affecting school-aged children and is characterized by repeated episodes of blockage of the upper airway during sleep. In this study, we performed a graph theoretical analysis on the brain morphometric correlation network in 25 OSA patients (OSA group; 5 female; mean age, 10.1 ± 1.8 years) and investigated the topological alterations in global and regional properties compared with 20 healthy control individuals (CON group; 6 females; mean age, 10.4 ± 1.8 years). A structural correlation network based on regional gray matter volume was constructed respectively for each group. Our results revealed a significantly decreased mean local efficiency in the OSA group over the density range of 0.32-0.44 (p gyrus, and a tendency of decreased degree in the right lingual and inferior frontal (orbital part) gyrus (p < 0.005, uncorrected). We also found that the network hubs in OSA and controls were distributed differently. To the best of our knowledge, this is the first study that characterizes the brain structure network in OSA patients and invests the alteration of topological properties of gray matter volume structural network. This study may help to provide new evidence for understanding the neuropathophysiology of OSA from a topological perspective.

  9. The structural and functional brain networks that support human social networks.

    Science.gov (United States)

    Noonan, M P; Mars, R B; Sallet, J; Dunbar, R I M; Fellows, L K

    2018-02-20

    Social skills rely on a specific set of cognitive processes, raising the possibility that individual differences in social networks are related to differences in specific brain structural and functional networks. Here, we tested this hypothesis with multimodality neuroimaging. With diffusion MRI (DMRI), we showed that differences in structural integrity of particular white matter (WM) tracts, including cingulum bundle, extreme capsule and arcuate fasciculus were associated with an individual's social network size (SNS). A voxel-based morphology analysis demonstrated correlations between gray matter (GM) volume and SNS in limbic and temporal lobe regions. These structural changes co-occured with functional network differences. As a function of SNS, dorsomedial and dorsolateral prefrontal cortex showed altered resting-state functional connectivity with the default mode network (DMN). Finally, we integrated these three complementary methods, interrogating the relationship between social GM clusters and specific WM and resting-state networks (RSNs). Probabilistic tractography seeded in these GM nodes utilized the SNS-related WM pathways. Further, the spatial and functional overlap between the social GM clusters and the DMN was significantly closer than other control RSNs. These integrative analyses provide convergent evidence of the role of specific circuits in SNS, likely supporting the adaptive behavior necessary for success in extensive social environments. Crown Copyright © 2018. Published by Elsevier B.V. All rights reserved.

  10. Direct Adaptive Aircraft Control Using Dynamic Cell Structure Neural Networks

    Science.gov (United States)

    Jorgensen, Charles C.

    1997-01-01

    A Dynamic Cell Structure (DCS) Neural Network was developed which learns topology representing networks (TRNS) of F-15 aircraft aerodynamic stability and control derivatives. The network is integrated into a direct adaptive tracking controller. The combination produces a robust adaptive architecture capable of handling multiple accident and off- nominal flight scenarios. This paper describes the DCS network and modifications to the parameter estimation procedure. The work represents one step towards an integrated real-time reconfiguration control architecture for rapid prototyping of new aircraft designs. Performance was evaluated using three off-line benchmarks and on-line nonlinear Virtual Reality simulation. Flight control was evaluated under scenarios including differential stabilator lock, soft sensor failure, control and stability derivative variations, and air turbulence.

  11. Mass media influence spreading in social networks with community structure

    Science.gov (United States)

    Candia, Julián; Mazzitello, Karina I.

    2008-07-01

    We study an extension of Axelrod's model for social influence, in which cultural drift is represented as random perturbations, while mass media are introduced by means of an external field. In this scenario, we investigate how the modular structure of social networks affects the propagation of mass media messages across a society. The community structure of social networks is represented by coupled random networks, in which two random graphs are connected by intercommunity links. Considering inhomogeneous mass media fields, we study the conditions for successful message spreading and find a novel phase diagram in the multidimensional parameter space. These findings show that social modularity effects are of paramount importance for designing successful, cost-effective advertising campaigns.

  12. Analyzing the multilevel structure of the European airport network

    Directory of Open Access Journals (Sweden)

    Oriol Lordan

    2017-04-01

    Full Text Available The multilayered structure of the European airport network (EAN, composed of connections and flights between European cities, is analyzed through the k-core decomposition of the connections network. This decomposition allows to identify the core, bridge and periphery layers of the EAN. The core layer includes the best-connected cities, which include important business air traffic destinations. The periphery layer includes cities with lesser connections, which serve low populated areas where air travel is an economic alternative. The remaining cities form the bridge of the EAN, including important leisure travel origins and destinations. The multilayered structure of the EAN affects network robustness, as the EAN is more robust to isolation of nodes of the core, than to the isolation of a combination of core and bridge nodes.

  13. Finding the core : Network structure in interbank markets

    NARCIS (Netherlands)

    in 't Veld, Daan; van Lelyveld, Iman

    2014-01-01

    This paper investigates the network structure of interbank markets. Using a dataset of interbank exposures in the Netherlands, we corroborate the recent hypothesis that the core periphery model is a 'stylised fact' of interbank markets. We find a core of highly connected banks intermediating between

  14. Refining a Heuristic for Constructing Bayesian Networks from Structured Arguments

    NARCIS (Netherlands)

    Wieten, G.M.; Bex, F.J.; van der Gaag, L.C.; Prakken, H.; Renooij, S.

    2018-01-01

    Recently, a heuristic was proposed for constructing Bayesian networks (BNs) from structured arguments. This heuristic helps domain experts who are accustomed to argumentation to transform their reasoning into a BN and subsequently weigh their case evidence in a probabilistic manner. While the

  15. Discussion Tool Effects on Collaborative Learning and Social Network Structure

    Science.gov (United States)

    Tomsic, Astrid; Suthers, Daniel D.

    2006-01-01

    This study investigated the social network structure of booking officers at the Honolulu Police Department and how the introduction of an online discussion tool affected knowledge about operation of a booking module. Baseline data provided evidence for collaboration among officers in the same district using e-mail, telephone and face-to-face media…

  16. The structural, connectomic and network covariance of the human brain.

    Science.gov (United States)

    Irimia, Andrei; Van Horn, John D

    2013-02-01

    Though it is widely appreciated that complex structural, functional and morphological relationships exist between distinct areas of the human cerebral cortex, the extent to which such relationships coincide remains insufficiently appreciated. Here we determine the extent to which correlations between brain regions are modulated by either structural, connectomic or network-theoretic properties using a structural neuroimaging data set of magnetic resonance imaging (MRI) and diffusion tensor imaging (DTI) volumes acquired from N=110 healthy human adults. To identify the linear relationships between all available pairs of regions, we use canonical correlation analysis to test whether a statistically significant correlation exists between each pair of cortical parcels as quantified via structural, connectomic or network-theoretic measures. In addition to this, we investigate (1) how each group of canonical variables (whether structural, connectomic or network-theoretic) contributes to the overall correlation and, additionally, (2) whether each individual variable makes a significant contribution to the test of the omnibus null hypothesis according to which no correlation between regions exists across subjects. We find that, although region-to-region correlations are extensively modulated by structural and connectomic measures, there are appreciable differences in how these two groups of measures drive inter-regional correlation patterns. Additionally, our results indicate that the network-theoretic properties of the cortex are strong modulators of region-to-region covariance. Our findings are useful for understanding the structural and connectomic relationship between various parts of the brain, and can inform theoretical and computational models of cortical information processing. Published by Elsevier Inc.

  17. Automated analysis of Physarum network structure and dynamics

    Science.gov (United States)

    Fricker, Mark D.; Akita, Dai; Heaton, Luke LM; Jones, Nick; Obara, Boguslaw; Nakagaki, Toshiyuki

    2017-06-01

    We evaluate different ridge-enhancement and segmentation methods to automatically extract the network architecture from time-series of Physarum plasmodia withdrawing from an arena via a single exit. Whilst all methods gave reasonable results, judged by precision-recall analysis against a ground-truth skeleton, the mean phase angle (Feature Type) from intensity-independent, phase-congruency edge enhancement and watershed segmentation was the most robust to variation in threshold parameters. The resultant single pixel-wide segmented skeleton was converted to a graph representation as a set of weighted adjacency matrices containing the physical dimensions of each vein, and the inter-vein regions. We encapsulate the complete image processing and network analysis pipeline in a downloadable software package, and provide an extensive set of metrics that characterise the network structure, including hierarchical loop decomposition to analyse the nested structure of the developing network. In addition, the change in volume for each vein and intervening plasmodial sheet was used to predict the net flow across the network. The scaling relationships between predicted current, speed and shear force with vein radius were consistent with predictions from Murray’s law. This work was presented at PhysNet 2015.

  18. Hemispheric lateralization of topological organization in structural brain networks.

    Science.gov (United States)

    Caeyenberghs, Karen; Leemans, Alexander

    2014-09-01

    The study on structural brain asymmetries in healthy individuals plays an important role in our understanding of the factors that modulate cognitive specialization in the brain. Here, we used fiber tractography to reconstruct the left and right hemispheric networks of a large cohort of 346 healthy participants (20-86 years) and performed a graph theoretical analysis to investigate this brain laterality from a network perspective. Findings revealed that the left hemisphere is significantly more "efficient" than the right hemisphere, whereas the right hemisphere showed higher values of "betweenness centrality" and "small-worldness." In particular, left-hemispheric networks displayed increased nodal efficiency in brain regions related to language and motor actions, whereas the right hemisphere showed an increase in nodal efficiency in brain regions involved in memory and visuospatial attention. In addition, we found that hemispheric networks decrease in efficiency with age. Finally, we observed significant gender differences in measures of global connectivity. By analyzing the structural hemispheric brain networks, we have provided new insights into understanding the neuroanatomical basis of lateralized brain functions. Copyright © 2014 Wiley Periodicals, Inc.

  19. Automated analysis of Physarum network structure and dynamics

    International Nuclear Information System (INIS)

    Fricker, Mark D; Heaton, Luke LM; Akita, Dai; Jones, Nick; Obara, Boguslaw; Nakagaki, Toshiyuki

    2017-01-01

    We evaluate different ridge-enhancement and segmentation methods to automatically extract the network architecture from time-series of Physarum plasmodia withdrawing from an arena via a single exit. Whilst all methods gave reasonable results, judged by precision-recall analysis against a ground-truth skeleton, the mean phase angle (Feature Type) from intensity-independent, phase-congruency edge enhancement and watershed segmentation was the most robust to variation in threshold parameters. The resultant single pixel-wide segmented skeleton was converted to a graph representation as a set of weighted adjacency matrices containing the physical dimensions of each vein, and the inter-vein regions. We encapsulate the complete image processing and network analysis pipeline in a downloadable software package, and provide an extensive set of metrics that characterise the network structure, including hierarchical loop decomposition to analyse the nested structure of the developing network. In addition, the change in volume for each vein and intervening plasmodial sheet was used to predict the net flow across the network. The scaling relationships between predicted current, speed and shear force with vein radius were consistent with predictions from Murray’s law. This work was presented at PhysNet 2015. (paper)

  20. Probabilistic diffusion tractography reveals improvement of structural network in musicians.

    Directory of Open Access Journals (Sweden)

    Jianfu Li

    Full Text Available PURPOSE: Musicians experience a large amount of information transfer and integration of complex sensory, motor, and auditory processes when training and playing musical instruments. Therefore, musicians are a useful model in which to investigate neural adaptations in the brain. METHODS: Here, based on diffusion-weighted imaging, probabilistic tractography was used to determine the architecture of white matter anatomical networks in musicians and non-musicians. Furthermore, the features of the white matter networks were analyzed using graph theory. RESULTS: Small-world properties of the white matter network were observed in both groups. Compared with non-musicians, the musicians exhibited significantly increased connectivity strength in the left and right supplementary motor areas, the left calcarine fissure and surrounding cortex and the right caudate nucleus, as well as a significantly larger weighted clustering coefficient in the right olfactory cortex, the left medial superior frontal gyrus, the right gyrus rectus, the left lingual gyrus, the left supramarginal gyrus, and the right pallidum. Furthermore, there were differences in the node betweenness centrality in several regions. However, no significant differences in topological properties were observed at a global level. CONCLUSIONS: We illustrated preliminary findings to extend the network level understanding of white matter plasticity in musicians who have had long-term musical training. These structural, network-based findings may indicate that musicians have enhanced information transmission efficiencies in local white matter networks that are related to musical training.

  1. Structure and evolution of the global seafood trade network

    Science.gov (United States)

    Gephart, Jessica A.; Pace, Michael L.

    2015-12-01

    The food production system is increasingly global and seafood is among the most highly traded commodities. Global trade can improve food security by providing access to a greater variety of foods, increasing wealth, buffering against local supply shocks, and benefit the environment by increasing overall use efficiency for some resources. However, global trade can also expose countries to external supply shocks and degrade the environment by increasing resource demand and loosening feedbacks between consumers and the impacts of food production. As a result, changes in global food trade can have important implications for both food security and the environmental impacts of production. Measurements of globalization and the environmental impacts of food production require data on both total trade and the origin and destination of traded goods (the network structure). While the global trade network of agricultural and livestock products has previously been studied, seafood products have been excluded. This study describes the structure and evolution of the global seafood trade network, including metrics quantifying the globalization of seafood, shifts in bilateral trade flows, changes in centrality and comparisons of seafood to agricultural and industrial trade networks. From 1994 to 2012 the number of countries trading in the network remained relatively constant, while the number of trade partnerships increased by over 65%. Over this same period, the total quantity of seafood traded increased by 58% and the value increased 85% in real terms. These changes signify the increasing globalization of seafood products. Additionally, the trade patterns in the network indicate: increased influence of Thailand and China, strengthened intraregional trade, and increased exports from South America and Asia. In addition to characterizing these network changes, this study identifies data needs in order to connect seafood trade with environmental impacts and food security outcomes.

  2. Distributed Data Mining in Peer-to-Peer Networks

    Data.gov (United States)

    National Aeronautics and Space Administration — Peer-to-peer (P2P) networks are gaining popularity in many applications such as file sharing, e-commerce, and social networking, many of which deal with rich,...

  3. Protein enriched pasta: structure and digestibility of its protein network.

    Science.gov (United States)

    Laleg, Karima; Barron, Cécile; Santé-Lhoutellier, Véronique; Walrand, Stéphane; Micard, Valérie

    2016-02-01

    Wheat (W) pasta was enriched in 6% gluten (G), 35% faba (F) or 5% egg (E) to increase its protein content (13% to 17%). The impact of the enrichment on the multiscale structure of the pasta and on in vitro protein digestibility was studied. Increasing the protein content (W- vs. G-pasta) strengthened pasta structure at molecular and macroscopic scales but reduced its protein digestibility by 3% by forming a higher covalently linked protein network. Greater changes in the macroscopic and molecular structure of the pasta were obtained by varying the nature of protein used for enrichment. Proteins in G- and E-pasta were highly covalently linked (28-32%) resulting in a strong pasta structure. Conversely, F-protein (98% SDS-soluble) altered the pasta structure by diluting gluten and formed a weak protein network (18% covalent link). As a result, protein digestibility in F-pasta was significantly higher (46%) than in E- (44%) and G-pasta (39%). The effect of low (55 °C, LT) vs. very high temperature (90 °C, VHT) drying on the protein network structure and digestibility was shown to cause greater molecular changes than pasta formulation. Whatever the pasta, a general strengthening of its structure, a 33% to 47% increase in covalently linked proteins and a higher β-sheet structure were observed. However, these structural differences were evened out after the pasta was cooked, resulting in identical protein digestibility in LT and VHT pasta. Even after VHT drying, F-pasta had the best amino acid profile with the highest protein digestibility, proof of its nutritional interest.

  4. Algorithmic Complexity and Reprogrammability of Chemical Structure Networks

    KAUST Repository

    Zenil, Hector; Kiani, Narsis A.; Shang, Ming-mei; Tegner, Jesper

    2018-01-01

    Here we address the challenge of profiling causal properties and tracking the transformation of chemical compounds from an algorithmic perspective. We explore the potential of applying a computational interventional calculus based on the principles of algorithmic probability to chemical structure networks. We profile the sensitivity of the elements and covalent bonds in a chemical structure network algorithmically, asking whether reprogrammability affords information about thermodynamic and chemical processes involved in the transformation of different compound classes. We arrive at numerical results suggesting a correspondence between some physical, structural and functional properties. Our methods are capable of separating chemical classes that reflect functional and natural differences without considering any information about atomic and molecular properties. We conclude that these methods, with their links to chemoinformatics via algorithmic, probability hold promise for future research.

  5. Algorithmic Complexity and Reprogrammability of Chemical Structure Networks

    KAUST Repository

    Zenil, Hector

    2018-04-02

    Here we address the challenge of profiling causal properties and tracking the transformation of chemical compounds from an algorithmic perspective. We explore the potential of applying a computational interventional calculus based on the principles of algorithmic probability to chemical structure networks. We profile the sensitivity of the elements and covalent bonds in a chemical structure network algorithmically, asking whether reprogrammability affords information about thermodynamic and chemical processes involved in the transformation of different compound classes. We arrive at numerical results suggesting a correspondence between some physical, structural and functional properties. Our methods are capable of separating chemical classes that reflect functional and natural differences without considering any information about atomic and molecular properties. We conclude that these methods, with their links to chemoinformatics via algorithmic, probability hold promise for future research.

  6. Algorithmic Complexity and Reprogrammability of Chemical Structure Networks

    KAUST Repository

    Zenil, Hector

    2018-02-16

    Here we address the challenge of profiling causal properties and tracking the transformation of chemical compounds from an algorithmic perspective. We explore the potential of applying a computational interventional calculus based on the principles of algorithmic probability to chemical structure networks. We profile the sensitivity of the elements and covalent bonds in a chemical structure network algorithmically, asking whether reprogrammability affords information about thermodynamic and chemical processes involved in the transformation of different compound classes. We arrive at numerical results suggesting a correspondence between some physical, structural and functional properties. Our methods are capable of separating chemical classes that reflect functional and natural differences without considering any information about atomic and molecular properties. We conclude that these methods, with their links to chemoinformatics via algorithmic, probability hold promise for future research.

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

  8. Memory functions reveal structural properties of gene regulatory networks

    Science.gov (United States)

    Perez-Carrasco, Ruben

    2018-01-01

    Gene regulatory networks (GRNs) control cellular function and decision making during tissue development and homeostasis. Mathematical tools based on dynamical systems theory are often used to model these networks, but the size and complexity of these models mean that their behaviour is not always intuitive and the underlying mechanisms can be difficult to decipher. For this reason, methods that simplify and aid exploration of complex networks are necessary. To this end we develop a broadly applicable form of the Zwanzig-Mori projection. By first converting a thermodynamic state ensemble model of gene regulation into mass action reactions we derive a general method that produces a set of time evolution equations for a subset of components of a network. The influence of the rest of the network, the bulk, is captured by memory functions that describe how the subnetwork reacts to its own past state via components in the bulk. These memory functions provide probes of near-steady state dynamics, revealing information not easily accessible otherwise. We illustrate the method on a simple cross-repressive transcriptional motif to show that memory functions not only simplify the analysis of the subnetwork but also have a natural interpretation. We then apply the approach to a GRN from the vertebrate neural tube, a well characterised developmental transcriptional network composed of four interacting transcription factors. The memory functions reveal the function of specific links within the neural tube network and identify features of the regulatory structure that specifically increase the robustness of the network to initial conditions. Taken together, the study provides evidence that Zwanzig-Mori projections offer powerful and effective tools for simplifying and exploring the behaviour of GRNs. PMID:29470492

  9. Structure constrained by metadata in networks of chess players.

    Science.gov (United States)

    Almeira, Nahuel; Schaigorodsky, Ana L; Perotti, Juan I; Billoni, Orlando V

    2017-11-09

    Chess is an emblematic sport that stands out because of its age, popularity and complexity. It has served to study human behavior from the perspective of a wide number of disciplines, from cognitive skills such as memory and learning, to aspects like innovation and decision-making. Given that an extensive documentation of chess games played throughout history is available, it is possible to perform detailed and statistically significant studies about this sport. Here we use one of the most extensive chess databases in the world to construct two networks of chess players. One of the networks includes games that were played over-the-board and the other contains games played on the Internet. We study the main topological characteristics of the networks, such as degree distribution and correlations, transitivity and community structure. We complement the structural analysis by incorporating players' level of play as node metadata. Although both networks are topologically different, we show that in both cases players gather in communities according to their expertise and that an emergent rich-club structure, composed by the top-rated players, is also present.

  10. Linking structure and activity in nonlinear spiking networks.

    Directory of Open Access Journals (Sweden)

    Gabriel Koch Ocker

    2017-06-01

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

  11. Linking structure and activity in nonlinear spiking networks.

    Science.gov (United States)

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

    2017-06-01

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

  12. A key heterogeneous structure of fractal networks based on inverse renormalization scheme

    Science.gov (United States)

    Bai, Yanan; Huang, Ning; Sun, Lina

    2018-06-01

    Self-similarity property of complex networks was found by the application of renormalization group theory. Based on this theory, network topologies can be classified into universality classes in the space of configurations. In return, through inverse renormalization scheme, a given primitive structure can grow into a pure fractal network, then adding different types of shortcuts, it exhibits different characteristics of complex networks. However, the effect of primitive structure on networks structural property has received less attention. In this paper, we introduce a degree variance index to measure the dispersion of nodes degree in the primitive structure, and investigate the effect of the primitive structure on network structural property quantified by network efficiency. Numerical simulations and theoretical analysis show a primitive structure is a key heterogeneous structure of generated networks based on inverse renormalization scheme, whether or not adding shortcuts, and the network efficiency is positively correlated with degree variance of the primitive structure.

  13. Deep Convolutional Neural Networks: Structure, Feature Extraction and Training

    Directory of Open Access Journals (Sweden)

    Namatēvs Ivars

    2017-12-01

    Full Text Available Deep convolutional neural networks (CNNs are aimed at processing data that have a known network like topology. They are widely used to recognise objects in images and diagnose patterns in time series data as well as in sensor data classification. The aim of the paper is to present theoretical and practical aspects of deep CNNs in terms of convolution operation, typical layers and basic methods to be used for training and learning. Some practical applications are included for signal and image classification. Finally, the present paper describes the proposed block structure of CNN for classifying crucial features from 3D sensor data.

  14. Genomic analysis of the hierarchical structure of regulatory networks

    Science.gov (United States)

    Yu, Haiyuan; Gerstein, Mark

    2006-01-01

    A fundamental question in biology is how the cell uses transcription factors (TFs) to coordinate the expression of thousands of genes in response to various stimuli. The relationships between TFs and their target genes can be modeled in terms of directed regulatory networks. These relationships, in turn, can be readily compared with commonplace “chain-of-command” structures in social networks, which have characteristic hierarchical layouts. Here, we develop algorithms for identifying generalized hierarchies (allowing for various loop structures) and use these approaches to illuminate extensive pyramid-shaped hierarchical structures existing in the regulatory networks of representative prokaryotes (Escherichia coli) and eukaryotes (Saccharomyces cerevisiae), with most TFs at the bottom levels and only a few master TFs on top. These masters are situated near the center of the protein–protein interaction network, a different type of network from the regulatory one, and they receive most of the input for the whole regulatory hierarchy through protein interactions. Moreover, they have maximal influence over other genes, in terms of affecting expression-level changes. Surprisingly, however, TFs at the bottom of the regulatory hierarchy are more essential to the viability of the cell. Finally, one might think master TFs achieve their wide influence through directly regulating many targets, but TFs with most direct targets are in the middle of the hierarchy. We find, in fact, that these midlevel TFs are “control bottlenecks” in the hierarchy, and this great degree of control for “middle managers” has parallels in efficient social structures in various corporate and governmental settings. PMID:17003135

  15. CAN Tree Routing for Content-Addressable Network

    Directory of Open Access Journals (Sweden)

    Zhongtao LI

    2014-01-01

    Full Text Available We propose a novel topology to improve the routing performance of Content- Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree by means of equipping each node with a few long links towards some distant nodes. The long links enhance routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is O(log n, which is much better than a uniform greedy routing, while each node maintains two long links in average.

  16. Disentangling the co-structure of multilayer interaction networks: degree distribution and module composition in two-layer bipartite networks.

    Science.gov (United States)

    Astegiano, Julia; Altermatt, Florian; Massol, François

    2017-11-13

    Species establish different interactions (e.g. antagonistic, mutualistic) with multiple species, forming multilayer ecological networks. Disentangling network co-structure in multilayer networks is crucial to predict how biodiversity loss may affect the persistence of multispecies assemblages. Existing methods to analyse multilayer networks often fail to consider network co-structure. We present a new method to evaluate the modular co-structure of multilayer networks through the assessment of species degree co-distribution and network module composition. We focus on modular structure because of its high prevalence among ecological networks. We apply our method to two Lepidoptera-plant networks, one describing caterpillar-plant herbivory interactions and one representing adult Lepidoptera nectaring on flowers, thereby possibly pollinating them. More than 50% of the species established either herbivory or visitation interactions, but not both. These species were over-represented among plants and lepidopterans, and were present in most modules in both networks. Similarity in module composition between networks was high but not different from random expectations. Our method clearly delineates the importance of interpreting multilayer module composition similarity in the light of the constraints imposed by network structure to predict the potential indirect effects of species loss through interconnected modular networks.

  17. Detailed temporal structure of communication networks in groups of songbirds.

    Science.gov (United States)

    Stowell, Dan; Gill, Lisa; Clayton, David

    2016-06-01

    Animals in groups often exchange calls, in patterns whose temporal structure may be influenced by contextual factors such as physical location and the social network structure of the group. We introduce a model-based analysis for temporal patterns of animal call timing, originally developed for networks of firing neurons. This has advantages over cross-correlation analysis in that it can correctly handle common-cause confounds and provides a generative model of call patterns with explicit parameters for the influences between individuals. It also has advantages over standard Markovian analysis in that it incorporates detailed temporal interactions which affect timing as well as sequencing of calls. Further, a fitted model can be used to generate novel synthetic call sequences. We apply the method to calls recorded from groups of domesticated zebra finch (Taeniopygia guttata) individuals. We find that the communication network in these groups has stable structure that persists from one day to the next, and that 'kernels' reflecting the temporal range of influence have a characteristic structure for a calling individual's effect on itself, its partner and on others in the group. We further find characteristic patterns of influences by call type as well as by individual. © 2016 The Authors.

  18. Developmental changes in organization of structural brain networks.

    Science.gov (United States)

    Khundrakpam, Budhachandra S; Reid, Andrew; Brauer, Jens; Carbonell, Felix; Lewis, John; Ameis, Stephanie; Karama, Sherif; Lee, Junki; Chen, Zhang; Das, Samir; Evans, Alan C

    2013-09-01

    Recent findings from developmental neuroimaging studies suggest that the enhancement of cognitive processes during development may be the result of a fine-tuning of the structural and functional organization of brain with maturation. However, the details regarding the developmental trajectory of large-scale structural brain networks are not yet understood. Here, we used graph theory to examine developmental changes in the organization of structural brain networks in 203 normally growing children and adolescents. Structural brain networks were constructed using interregional correlations in cortical thickness for 4 age groups (early childhood: 4.8-8.4 year; late childhood: 8.5-11.3 year; early adolescence: 11.4-14.7 year; late adolescence: 14.8-18.3 year). Late childhood showed prominent changes in topological properties, specifically a significant reduction in local efficiency, modularity, and increased global efficiency, suggesting a shift of topological organization toward a more random configuration. An increase in number and span of distribution of connector hubs was found in this age group. Finally, inter-regional connectivity analysis and graph-theoretic measures indicated early maturation of primary sensorimotor regions and protracted development of higher order association and paralimbic regions. Our finding reveals a time window of plasticity occurring during late childhood which may accommodate crucial changes during puberty and the new developmental tasks that an adolescent faces.

  19. [Challenges of implementing a geriatric trauma network : A regional structure].

    Science.gov (United States)

    Schoeneberg, Carsten; Hussmann, Bjoern; Wesemann, Thomas; Pientka, Ludger; Vollmar, Marie-Christin; Bienek, Christine; Steinmann, Markus; Buecking, Benjamin; Lendemans, Sven

    2018-04-01

    At present, there is a high percentage and increasing tendency of patients presenting with orthogeriatric injuries. Moreover, significant comorbidities often exist, requiring increased interdisciplinary treatment. These developments have led the German Society of Trauma Surgery, in cooperation with the German Society of Geriatrics, to establish geriatric trauma centers. As a conglomerate hospital at two locations, we are cooperating with two external geriatric clinics. In 2015, a geriatric trauma center certification in the form of a conglomerate network structure was agreed upon for the first time in Germany. For this purpose, the requirements for certification were observed. Both structure and organization were defined in a manual according to DIN EN ISO 9001:2015. Between 2008 and 2016, an increase of 70% was seen in geriatric trauma cases in our hospital, with a rise of up to 360% in specific diagnoses. The necessary standards and regulations were compiled and evaluated from our hospitals. After successful certification, improvements were necessary, followed by a planned re-audit. These were prepared by multiprofessional interdisciplinary teams and implemented at all locations. A network structure can be an alternative to classical cooperation between trauma and geriatric units in one clinic and help reduce possible staffing shortage. Due to the lack of scientific evidence, future evaluations of the geriatric trauma register should reveal whether network structures in geriatric trauma surgery lead to a valid improvement in medical care.

  20. Hierarchical Data Distribution Scheme for Peer-to-Peer Networks

    Science.gov (United States)

    Bhushan, Shashi; Dave, M.; Patel, R. B.

    2010-11-01

    In the past few years, peer-to-peer (P2P) networks have become an extremely popular mechanism for large-scale content sharing. P2P systems have focused on specific application domains (e.g. music files, video files) or on providing file system like capabilities. P2P is a powerful paradigm, which provides a large-scale and cost-effective mechanism for data sharing. P2P system may be used for storing data globally. Can we implement a conventional database on P2P system? But successful implementation of conventional databases on the P2P systems is yet to be reported. In this paper we have presented the mathematical model for the replication of the partitions and presented a hierarchical based data distribution scheme for the P2P networks. We have also analyzed the resource utilization and throughput of the P2P system with respect to the availability, when a conventional database is implemented over the P2P system with variable query rate. Simulation results show that database partitions placed on the peers with higher availability factor perform better. Degradation index, throughput, resource utilization are the parameters evaluated with respect to the availability factor.

  1. The Network Structure Underlying the Earth Observation Assessment

    Science.gov (United States)

    Vitkin, S.; Doane, W. E. J.; Mary, J. C.

    2017-12-01

    The Earth Observations Assessment (EOA 2016) is a multiyear project designed to assess the effectiveness of civil earth observation data sources (instruments, sensors, models, etc.) on societal benefit areas (SBAs) for the United States. Subject matter experts (SMEs) provided input and scored how data sources inform products, product groups, key objectives, SBA sub-areas, and SBAs in an attempt to quantify the relationships between data sources and SBAs. The resulting data were processed by Integrated Applications Incorporated (IAI) using MITRE's PALMA software to create normalized relative impact scores for each of these relationships. However, PALMA processing obscures the natural network representation of the data. Any network analysis that might identify patterns of interaction among data sources, products, and SBAs is therefore impossible. Collaborating with IAI, we cleaned and recreated a network from the original dataset. Using R and Python we explore the underlying structure of the network and apply frequent itemset mining algorithms to identify groups of data sources and products that interact. We reveal interesting patterns and relationships in the EOA dataset that were not immediately observable from the EOA 2016 report and provide a basis for further exploration of the EOA network dataset.

  2. Novel indexes based on network structure to indicate financial market

    Science.gov (United States)

    Zhong, Tao; Peng, Qinke; Wang, Xiao; Zhang, Jing

    2016-02-01

    There have been various achievements to understand and to analyze the financial market by complex network model. However, current studies analyze the financial network model but seldom present quantified indexes to indicate or forecast the price action of market. In this paper, the stock market is modeled as a dynamic network, in which the vertices refer to listed companies and edges refer to their rank-based correlation based on price series. Characteristics of the network are analyzed and then novel indexes are introduced into market analysis, which are calculated from maximum and fully-connected subnets. The indexes are compared with existing ones and the results confirm that our indexes perform better to indicate the daily trend of market composite index in advance. Via investment simulation, the performance of our indexes is analyzed in detail. The results indicate that the dynamic complex network model could not only serve as a structural description of the financial market, but also work to predict the market and guide investment by indexes.

  3. Global and local targeted immunization in networks with community structure

    International Nuclear Information System (INIS)

    Yan, Shu; Tang, Shaoting; Pei, Sen; Zheng, Zhiming; Fang, Wenyi

    2015-01-01

    Immunization plays an important role in the field of epidemic spreading in complex networks. In previous studies, targeted immunization has been proved to be an effective strategy. However, when extended to networks with community structure, it is unknown whether the superior strategy is to vaccinate the nodes who have the most connections in the entire network (global strategy), or those in the original community where epidemic starts to spread (local strategy). In this work, by using both analytic approaches and simulations, we observe that the answer depends on the closeness between communities. If communities are tied closely, the global strategy is superior to the local strategy. Otherwise, the local targeted immunization is advantageous. The existence of a transitional value of closeness implies that we should adopt different strategies. Furthermore, we extend our investigation from two-community networks to multi-community networks. We consider the mode of community connection and the location of community where epidemic starts to spread. Both simulation results and theoretical predictions show that local strategy is a better option for immunization in most cases. But if the epidemic begins from a core community, global strategy is superior in some cases. (paper)

  4. Structure, function, and control of the human musculoskeletal network.

    Directory of Open Access Journals (Sweden)

    Andrew C Murphy

    2018-01-01

    Full Text Available The human body is a complex organism, the gross mechanical properties of which are enabled by an interconnected musculoskeletal network controlled by the nervous system. The nature of musculoskeletal interconnection facilitates stability, voluntary movement, and robustness to injury. However, a fundamental understanding of this network and its control by neural systems has remained elusive. Here we address this gap in knowledge by utilizing medical databases and mathematical modeling to reveal the organizational structure, predicted function, and neural control of the musculoskeletal system. We constructed a highly simplified whole-body musculoskeletal network in which single muscles connect to multiple bones via both origin and insertion points. We demonstrated that, using this simplified model, a muscle's role in this network could offer a theoretical prediction of the susceptibility of surrounding components to secondary injury. Finally, we illustrated that sets of muscles cluster into network communities that mimic the organization of control modules in primary motor cortex. This novel formalism for describing interactions between the muscular and skeletal systems serves as a foundation to develop and test therapeutic responses to injury, inspiring future advances in clinical treatments.

  5. Structural properties of the Chinese air transportation multilayer network

    International Nuclear Information System (INIS)

    Hong, Chen; Zhang, Jun; Cao, Xian-Bin; Du, Wen-Bo

    2016-01-01

    Highlights: • We investigate the structural properties of the Chinese air transportation multilayer network (ATMN). • We compare two main types of layers corresponding to major and low-cost airlines. • It is found that small-world property and rich-club effect of the Chinese ATMN are mainly caused by major airlines. - Abstract: Recently multilayer networks are attracting great attention because the properties of many real-world systems cannot be well understood without considering their different layers. In this paper, we investigate the structural properties of the Chinese air transportation multilayer network (ATMN) by progressively merging layers together, where each commercial airline (company) defines a layer. The results show that the high clustering coefficient, short characteristic path length and large collection of reachable destinations of the Chinese ATMN can only emerge when several layers are merged together. Moreover, we compare two main types of layers corresponding to major and low-cost airlines. It is found that the small-world property and the rich-club effect of the Chinese ATMN are mainly caused by those layers corresponding to major airlines. Our work will highlight a better understanding of the Chinese air transportation network.

  6. Epidemic spreading on dual-structure networks with mobile agents

    Science.gov (United States)

    Yao, Yiyang; Zhou, Yinzuo

    2017-02-01

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

  7. Information Propagation in Peer-to-Peer Networking : Modeling and Empirical Studies

    NARCIS (Netherlands)

    Tang, S.

    2010-01-01

    Although being a young technology, peer-to-peer (P2P) networking has spurred dramatic evolution on the Internet over the recent twenty years. Unlike traditional server-client mode, P2P networking applications are user-centric. Users (peers) generate their own content and share it with others across

  8. An Algebraic Approach to Inference in Complex Networked Structures

    Science.gov (United States)

    2015-07-09

    44], [45],[46] where the shift is the elementary non-trivial filter that generates, under an appropriate notion of shift invariance, all linear ... elementary filter, and its output is a graph signal with the value at vertex n of the graph given approximately by a weighted linear combination of...AFRL-AFOSR-VA-TR-2015-0265 An Algebraic Approach to Inference in Complex Networked Structures Jose Moura CARNEGIE MELLON UNIVERSITY Final Report 07

  9. Bayesian Computational Sensor Networks for Aircraft Structural Health Monitoring

    Science.gov (United States)

    2016-02-02

    Virginia 22203 Air Force Research Laboratory Air Force Materiel Command 1 Final Performance Report: AFOSR T.C. Henderson , V.J. Mathews, and D...AFRL-AFOSR-VA-TR-2016-0094 Bayesian Computational Sensor Networks for Aircraft Structural Health Monitoring. Thomas Henderson UNIVERSITY OF UTAH SALT...The people who worked on this project include: Thomas C. Henderson , John Mathews, Jingru Zhou, Daimei Zhij, Ahmad Zoubi, Sabita Nahata, Dan Adams

  10. Fracture network topology and characterization of structural permeability

    Science.gov (United States)

    Hansberry, Rowan; King, Rosalind; Holford, Simon

    2017-04-01

    There are two fundamental requirements for successful geothermal development: elevated temperatures at accessible depths, and a reservoir from which fluids can be extracted. The Australian geothermal sector has successfully targeted shallow heat, however, due in part to the inherent complexity of targeting permeability, obtaining adequate flow rates for commercial production has been problematic. Deep sedimentary aquifers are unlikely to be viable geothermal resources due to the effects of diagenetic mineral growth on rock permeability. Therefore, it is likely structural permeability targets, exploiting natural or induced fracture networks will provide the primary means for fluid flow in geothermal, as well as unconventional gas, reservoirs. Recent research has focused on the pattern and generation of crustal stresses across Australia, while less is known about the resultant networks of faults, joints, and veins that can constitute interconnected sub-surface permeability pathways. The ability of a fracture to transmit fluid is controlled by the orientation and magnitude of the in-situ stress field that acts on the fracture walls, rock strength, and pore pressure, as well as fracture properties such as aperture, orientation, and roughness. Understanding the distribution, orientation and character of fractures is key to predicting structural permeability. This project focuses on extensive mapping of fractures over various scales in four key Australian basins (Cooper, Otway, Surat and Perth) with the potential to host geothermal resources. Seismic attribute analysis is used in concert with image logs from petroleum wells, and field mapping to identify fracture networks that are usually not resolved in traditional seismic interpretation. We use fracture network topology to provide scale-invariant characterisation of fracture networks from multiple data sources to assess similarity between data sources, and fracture network connectivity. These results are compared with

  11. Parallel protein secondary structure prediction based on neural networks.

    Science.gov (United States)

    Zhong, Wei; Altun, Gulsah; Tian, Xinmin; Harrison, Robert; Tai, Phang C; Pan, Yi

    2004-01-01

    Protein secondary structure prediction has a fundamental influence on today's bioinformatics research. In this work, binary and tertiary classifiers of protein secondary structure prediction are implemented on Denoeux belief neural network (DBNN) architecture. Hydrophobicity matrix, orthogonal matrix, BLOSUM62 and PSSM (position specific scoring matrix) are experimented separately as the encoding schemes for DBNN. The experimental results contribute to the design of new encoding schemes. New binary classifier for Helix versus not Helix ( approximately H) for DBNN produces prediction accuracy of 87% when PSSM is used for the input profile. The performance of DBNN binary classifier is comparable to other best prediction methods. The good test results for binary classifiers open a new approach for protein structure prediction with neural networks. Due to the time consuming task of training the neural networks, Pthread and OpenMP are employed to parallelize DBNN in the hyperthreading enabled Intel architecture. Speedup for 16 Pthreads is 4.9 and speedup for 16 OpenMP threads is 4 in the 4 processors shared memory architecture. Both speedup performance of OpenMP and Pthread is superior to that of other research. With the new parallel training algorithm, thousands of amino acids can be processed in reasonable amount of time. Our research also shows that hyperthreading technology for Intel architecture is efficient for parallel biological algorithms.

  12. Scalable, ultra-resistant structural colors based on network metamaterials

    KAUST Repository

    Galinski, Henning

    2017-05-05

    Structural colors have drawn wide attention for their potential as a future printing technology for various applications, ranging from biomimetic tissues to adaptive camouflage materials. However, an efficient approach to realize robust colors with a scalable fabrication technique is still lacking, hampering the realization of practical applications with this platform. Here, we develop a new approach based on large-scale network metamaterials that combine dealloyed subwavelength structures at the nanoscale with lossless, ultra-thin dielectric coatings. By using theory and experiments, we show how subwavelength dielectric coatings control a mechanism of resonant light coupling with epsilon-near-zero regions generated in the metallic network, generating the formation of saturated structural colors that cover a wide portion of the spectrum. Ellipsometry measurements support the efficient observation of these colors, even at angles of 70°. The network-like architecture of these nanomaterials allows for high mechanical resistance, which is quantified in a series of nano-scratch tests. With such remarkable properties, these metastructures represent a robust design technology for real-world, large-scale commercial applications.

  13. Analysis of structure-function network decoupling in the brain systems of spastic diplegic cerebral palsy.

    Science.gov (United States)

    Lee, Dongha; Pae, Chongwon; Lee, Jong Doo; Park, Eun Sook; Cho, Sung-Rae; Um, Min-Hee; Lee, Seung-Koo; Oh, Maeng-Keun; Park, Hae-Jeong

    2017-10-01

    Manifestation of the functionalities from the structural brain network is becoming increasingly important to understand a brain disease. With the aim of investigating the differential structure-function couplings according to network systems, we investigated the structural and functional brain networks of patients with spastic diplegic cerebral palsy with periventricular leukomalacia compared to healthy controls. The structural and functional networks of the whole brain and motor system, constructed using deterministic and probabilistic tractography of diffusion tensor magnetic resonance images and Pearson and partial correlation analyses of resting-state functional magnetic resonance images, showed differential embedding of functional networks in the structural networks in patients. In the whole-brain network of patients, significantly reduced global network efficiency compared to healthy controls were found in the structural networks but not in the functional networks, resulting in reduced structural-functional coupling. On the contrary, the motor network of patients had a significantly lower functional network efficiency over the intact structural network and a lower structure-function coupling than the control group. This reduced coupling but reverse directionality in the whole-brain and motor networks of patients was prominent particularly between the probabilistic structural and partial correlation-based functional networks. Intact (or less deficient) functional network over impaired structural networks of the whole brain and highly impaired functional network topology over the intact structural motor network might subserve relatively preserved cognitions and impaired motor functions in cerebral palsy. This study suggests that the structure-function relationship, evaluated specifically using sparse functional connectivity, may reveal important clues to functional reorganization in cerebral palsy. Hum Brain Mapp 38:5292-5306, 2017. © 2017 Wiley Periodicals

  14. The Network Structure of Human Personality According to the NEO-PI-R: Matching Network Community Structure to Factor Structure

    NARCIS (Netherlands)

    Goekoop, R.; Goekoop, J.G.; Scholte, H.S.

    2012-01-01

    Introduction: Human personality is described preferentially in terms of factors (dimensions) found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. Aim: To directly compare the ability of network

  15. Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons

    Energy Technology Data Exchange (ETDEWEB)

    Li, Chun-Hsien, E-mail: chli@nknucc.nknu.edu.tw [Department of Mathematics, National Kaohsiung Normal University, Yanchao District, Kaohsiung City 82444, Taiwan (China); Yang, Suh-Yuh, E-mail: syyang@math.ncu.edu.tw [Department of Mathematics, National Central University, Jhongli District, Taoyuan City 32001, Taiwan (China)

    2015-10-23

    This work is devoted to investigate the effects of network structure on the synchronizability of nonlinearly coupled dynamical network of Hindmarsh–Rose neurons with a sigmoidal coupling function. We mainly focus on the networks that exhibit the small-world character or scale-free property. By checking the first nonzero eigenvalue of the outer-coupling matrix, which is closely related to the synchronization threshold, the synchronizabilities of three specific network ensembles with prescribed network structures are compared. Interestingly, we find that networks with more connections will not necessarily result in better synchronizability. - Highlights: • We investigate the effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons. • We mainly consider the networks that exhibit the small-world character or scale-free property. • The synchronizability of three specific network ensembles with prescribed network structures are compared. • Networks with more connections will not necessarily result in better synchronizability.

  16. Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons

    International Nuclear Information System (INIS)

    Li, Chun-Hsien; Yang, Suh-Yuh

    2015-01-01

    This work is devoted to investigate the effects of network structure on the synchronizability of nonlinearly coupled dynamical network of Hindmarsh–Rose neurons with a sigmoidal coupling function. We mainly focus on the networks that exhibit the small-world character or scale-free property. By checking the first nonzero eigenvalue of the outer-coupling matrix, which is closely related to the synchronization threshold, the synchronizabilities of three specific network ensembles with prescribed network structures are compared. Interestingly, we find that networks with more connections will not necessarily result in better synchronizability. - Highlights: • We investigate the effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons. • We mainly consider the networks that exhibit the small-world character or scale-free property. • The synchronizability of three specific network ensembles with prescribed network structures are compared. • Networks with more connections will not necessarily result in better synchronizability

  17. Dynamics of cluster structures in a financial market network

    Science.gov (United States)

    Kocheturov, Anton; Batsyn, Mikhail; Pardalos, Panos M.

    2014-11-01

    In the course of recent fifteen years the network analysis has become a powerful tool for studying financial markets. In this work we analyze stock markets of the USA and Sweden. We study cluster structures of a market network constructed from a correlation matrix of returns of the stocks traded in each of these markets. Such cluster structures are obtained by means of the P-Median Problem (PMP) whose objective is to maximize the total correlation between a set of stocks called medians of size p and other stocks. Every cluster structure is an undirected disconnected weighted graph in which every connected component (cluster) is a star, or a tree with one central node (called a median) and several leaf nodes connected with the median by weighted edges. Our main observation is that in non-crisis periods of time cluster structures change more chaotically, while during crises they show more stable behavior and fewer changes. Thus an increasing stability of a market graph cluster structure obtained via the PMP could be used as an indicator of a coming crisis.

  18. Optimal map of the modular structure of complex networks

    International Nuclear Information System (INIS)

    Arenas, A; Borge-Holthoefer, J; Gomez, S; Zamora-Lopez, G

    2010-01-01

    The modular structure is pervasive in many complex networks of interactions observed in natural, social and technological sciences. Its study sheds light on the relation between the structure and the function of complex systems. Generally speaking, modules are islands of highly connected nodes separated by a relatively small number of links. Every module can have the contributions of links from any node in the network. The challenge is to disentangle these contributions to understand how the modular structure is built. The main problem is that the analysis of a certain partition into modules involves, in principle, as much data as the number of modules times the number of nodes. To confront this challenge, here we first define the contribution matrix, the mathematical object containing all the information about the partition of interest, and then we use truncated singular value decomposition to extract the best representation of this matrix in a plane. The analysis of this projection allows us to scrutinize the skeleton of the modular structure, revealing the structure of individual modules and their interrelations.

  19. Network Structure as a Modulator of Disturbance Impacts in Streams

    Science.gov (United States)

    Warner, S.; Tullos, D. D.

    2017-12-01

    This study examines how river network structure affects the propagation of geomorphic and anthropogenic disturbances through streams. Geomorphic processes such as debris flows can alter channel morphology and modify habitat for aquatic biota. Anthropogenic disturbances such as road construction can interact with the geomorphology and hydrology of forested watersheds to change sediment and water inputs to streams. It was hypothesized that the network structure of streams within forested watersheds would influence the location and magnitude of the impacts of debris flows and road construction on sediment size and channel width. Longitudinal surveys were conducted every 50 meters for 11 kilometers of third-to-fifth order streams in the H.J. Andrews Experimental Forest in the Western Cascade Range of Oregon. Particle counts and channel geometry measurements were collected to characterize the geomorphic impacts of road crossings and debris flows as disturbances. Sediment size distributions and width measurements were plotted against the distance of survey locations through the network to identify variations in longitudinal trends of channel characteristics. Thresholds for the background variation in sediment size and channel width, based on the standard deviations of sample points, were developed for sampled stream segments characterized by location as well as geomorphic and land use history. Survey locations were classified as "disturbed" when they deviated beyond the reference thresholds in expected sediment sizes and channel widths, as well as flow-connected proximity to debris flows and road crossings. River network structure was quantified by drainage density and centrality of nodes upstream of survey locations. Drainage density and node centrality were compared between survey locations with similar channel characteristic classifications. Cluster analysis was used to assess the significance of survey location, proximity of survey location to debris flows and road

  20. Radiation synthesis and characterization of network structure of natural/synthetic double-network superabsorbent polymers

    International Nuclear Information System (INIS)

    Sen, M.; Hayrabolulu, H.

    2011-01-01

    Complete text of publication follows. Superabsorbent polymers (SAPs) are moderately cross linked, 3-D, hydrophilic network polymers that can absorb and conserve considerable amounts of aqueous fluids even under certain heat or pressure. Because of the unique properties superior to conventional absorbents, SAPs have found potential application in many fields such as hygienic products, disposable diapers, horticulture, gel actuators, drug-delivery systems, as well as water-blocking tapes coal dewatering, water managing materials for the renewal of arid and desert environment, etc. In recent years, naturally available resources, such as polysaccharides have drawn considerable attention for the preparation of SAPs. Since the mechanical properties of polysaccharide based natural polymers are low, researchers have mostly focused on natural/synthetic polymer/monomer mixtures to obtain novel SAPs. The aim of this study is to synthesize and characterization of network structure of novel double-network (DN) hydrogels as a SAP. Hydrogels with high mechanical strength have been prepared by radiation induced polymerization and crosslink of acrylic acid sodium salt in the presence of natural polymer locust bean gum. Liquid retention capacities and absorbency under load (AUL) analysis of synthesized SAPs was performed at different temperatures in water and synthetic urine solution, in order to determine their SAP character. For the characterization of network structure of the semi-IPN hydrogels, the average molecular weight between cross links (M c ) were evaluated by using uniaxial compression and oscillatory dynamical mechanical analyses and the advantage and disadvantage of these two technique for the characterization of network structures were compared.

  1. Effect of direct reciprocity and network structure on continuing prosperity of social networking services.

    Science.gov (United States)

    Osaka, Kengo; Toriumi, Fujio; Sugawara, Toshihauru

    2017-01-01

    Social networking services (SNSs) are widely used as communicative tools for a variety of purposes. SNSs rely on the users' individual activities associated with some cost and effort, and thus it is not known why users voluntarily continue to participate in SNSs. Because the structures of SNSs are similar to that of the public goods (PG) game, some studies have focused on why voluntary activities emerge as an optimal strategy by modifying the PG game. However, their models do not include direct reciprocity between users, even though reciprocity is a key mechanism that evolves and sustains cooperation in human society. We developed an abstract SNS model called the reciprocity rewards and meta-rewards games that include direct reciprocity by extending the existing models. Then, we investigated how direct reciprocity in an SNS facilitates cooperation that corresponds to participation in SNS by posting articles and comments and how the structure of the networks of users exerts an influence on the strategies of users using the reciprocity rewards game. We run reciprocity rewards games on various complex networks and an instance network of Facebook and found that two types of stable cooperation emerged. First, reciprocity slightly improves the rate of cooperation in complete graphs but the improvement is insignificant because of the instability of cooperation. However, this instability can be avoided by making two assumptions: high degree of fun, i.e. articles are read with high probability, and different attitudes to reciprocal and non-reciprocal agents. We then propose the concept of half free riders to explain what strategy sustains cooperation-dominant situations. Second, we indicate that a certain WS network structure affects users' optimal strategy and facilitates stable cooperation without any extra assumptions. We give a detailed analysis of the different characteristics of the two types of cooperation-dominant situations and the effect of the memory of

  2. Predicting and validating protein interactions using network structure.

    Directory of Open Access Journals (Sweden)

    Pao-Yang Chen

    2008-07-01

    Full Text Available Protein interactions play a vital part in the function of a cell. As experimental techniques for detection and validation of protein interactions are time consuming, there is a need for computational methods for this task. Protein interactions appear to form a network with a relatively high degree of local clustering. In this paper we exploit this clustering by suggesting a score based on triplets of observed protein interactions. The score utilises both protein characteristics and network properties. Our score based on triplets is shown to complement existing techniques for predicting protein interactions, outperforming them on data sets which display a high degree of clustering. The predicted interactions score highly against test measures for accuracy. Compared to a similar score derived from pairwise interactions only, the triplet score displays higher sensitivity and specificity. By looking at specific examples, we show how an experimental set of interactions can be enriched and validated. As part of this work we also examine the effect of different prior databases upon the accuracy of prediction and find that the interactions from the same kingdom give better results than from across kingdoms, suggesting that there may be fundamental differences between the networks. These results all emphasize that network structure is important and helps in the accurate prediction of protein interactions. The protein interaction data set and the program used in our analysis, and a list of predictions and validations, are available at http://www.stats.ox.ac.uk/bioinfo/resources/PredictingInteractions.

  3. LHCb: Time structure analysis of the LHCb Online network

    CERN Multimedia

    Antichi, G; Campora Perez, D H; Liu, G; Neufeld, N; Giordano, S; Owezarski, P; Moore, A

    2013-01-01

    The LHCb Online Network is a real time high performance network, in which 350 data sources send data over a Gigabit Ethernet LAN to more than 1500 receiving nodes. The aggregated throughput of the application, called Event Building, is more than 60 GB/s. The protocol employed by LHCb makes the sending nodes transmit simultaneously portions of events to one receiving node at a time, which is selected using a credit-token scheme. The resulting traffic is very bursty and sensitive to irregularities in the temporal distribution of packet-bursts to the same destination or region of the network. In order to study the relevant properties of such a dataflow, a non-disruptive monitoring setup based on a networking capable FPGA (NetFPGA) has been deployed. The NetFPGA allows order of hundred nano-second precise time-stamping of packets. We study in detail the timing structure of the Event Building communication, and we identify potential effects of micro-bursts like buffer packet drops or jitter.

  4. Dynamical Structure of a Traditional Amazonian Social Network

    Directory of Open Access Journals (Sweden)

    Paul L. Hooper

    2013-11-01

    Full Text Available Reciprocity is a vital feature of social networks, but relatively little is known about its temporal structure or the mechanisms underlying its persistence in real world behavior. In pursuit of these two questions, we study the stationary and dynamical signals of reciprocity in a network of manioc beer (Spanish: chicha; Tsimane’: shocdye’ drinking events in a Tsimane’ village in lowland Bolivia. At the stationary level, our analysis reveals that social exchange within the community is heterogeneously patterned according to kinship and spatial proximity. A positive relationship between the frequencies at which two families host each other, controlling for kinship and proximity, provides evidence for stationary reciprocity. Our analysis of the dynamical structure of this network presents a novel method for the study of conditional, or non-stationary, reciprocity effects. We find evidence that short-timescale reciprocity (within three days is present among non- and distant-kin pairs; conversely, we find that levels of cooperation among close kin can be accounted for on the stationary hypothesis alone.

  5. Group composition and network structure in school classes : a multilevel application of the p* model

    NARCIS (Netherlands)

    Lubbers, Miranda J.

    2003-01-01

    This paper describes the structure of social networks of students within school classes and examines differences in network structure between classes. In order to examine the network structure within school classes, we focused in particular on the principle of homophily, i.e. the tendency that

  6. Investigation of Wireless Sensor Networks for Structural Health Monitoring

    Directory of Open Access Journals (Sweden)

    Ping Wang

    2012-01-01

    Full Text Available Wireless sensor networks (WSNs are one of the most able technologies in the structural health monitoring (SHM field. Through intelligent, self-organising means, the contents of this paper will test a variety of different objects and different working principles of sensor nodes connected into a network and integrated with data processing functions. In this paper the key issues of WSN applied in SHM are discussed, including the integration of different types of sensors with different operational modalities, sampling frequencies, issues of transmission bandwidth, real-time ability, and wireless transmitter frequency. Furthermore, the topology, data fusion, integration, energy saving, and self-powering nature of different systems will be investigated. In the FP7 project “Health Monitoring of Offshore Wind Farms,” the above issues are explored.

  7. Wireless sensor networks for active vibration control in automobile structures

    International Nuclear Information System (INIS)

    Mieyeville, Fabien; Navarro, David; Du, Wan; Ichchou, Mohamed; Scorletti, Gérard

    2012-01-01

    Wireless sensor networks (WSNs) are nowadays widely used in monitoring and tracking applications. This paper presents the feasibility of using WSNs in active vibration control strategies. The method employed here involves active-structural acoustic control using piezoelectric sensors distributed on a car structure. This system aims at being merged with a WSN whose head node collects data and processes control laws so as to command piezoelectric actuators wisely placed on the structure. We will study the feasibility of implementing WSNs in active vibration control and introduce a complete design methodology to optimize hardware/software and control law synergy in mechatronic systems. A design space exploration will be conducted so as to identify the best WSN platform and the resulting impact on control. (paper)

  8. Controlling nosocomial infection based on structure of hospital social networks.

    Science.gov (United States)

    Ueno, Taro; Masuda, Naoki

    2008-10-07

    Nosocomial infection (i.e. infection in healthcare facilities) raises a serious public health problem, as implied by the existence of pathogens characteristic to healthcare facilities such as methicillin-resistant Staphylococcus aureus and hospital-mediated outbreaks of influenza and severe acute respiratory syndrome. For general communities, epidemic modeling based on social networks is being recognized as a useful tool. However, disease propagation may occur in a healthcare facility in a manner different from that in a urban community setting due to different network architecture. We simulate stochastic susceptible-infected-recovered dynamics on social networks, which are based on observations in a hospital in Tokyo, to explore effective containment strategies against nosocomial infection. The observed social networks in the hospital have hierarchical and modular structure in which dense substructure such as departments, wards, and rooms, are globally but only loosely connected, and do not reveal extremely right-skewed distributions of the number of contacts per individual. We show that healthcare workers, particularly medical doctors, are main vectors (i.e. transmitters) of diseases on these networks. Intervention methods that restrict interaction between medical doctors and their visits to different wards shrink the final epidemic size more than intervention methods that directly protect patients, such as isolating patients in single rooms. By the same token, vaccinating doctors with priority rather than patients or nurses is more effective. Finally, vaccinating individuals with large betweenness centrality (frequency of mediating connection between pairs of individuals along the shortest paths) is superior to vaccinating ones with large connectedness to others or randomly chosen individuals, which was suggested by previous model studies.

  9. Structural Covariance Networks in Children with Autism or ADHD.

    Science.gov (United States)

    Bethlehem, R A I; Romero-Garcia, R; Mak, E; Bullmore, E T; Baron-Cohen, S

    2017-08-01

    While autism and attention-deficit/hyperactivity disorder (ADHD) are considered distinct conditions from a diagnostic perspective, clinically they share some phenotypic features and have high comorbidity. Regardless, most studies have focused on only one condition, with considerable heterogeneity in their results. Taking a dual-condition approach might help elucidate shared and distinct neural characteristics. Graph theory was used to analyse topological properties of structural covariance networks across both conditions and relative to a neurotypical (NT; n = 87) group using data from the ABIDE (autism; n = 62) and ADHD-200 datasets (ADHD; n = 69). Regional cortical thickness was used to construct the structural covariance networks. This was analysed in a theoretical framework examining potential differences in long and short-range connectivity, with a specific focus on relation between central graph measures and cortical thickness. We found convergence between autism and ADHD, where both conditions show an overall decrease in CT covariance with increased Euclidean distance between centroids compared with a NT population. The 2 conditions also show divergence. Namely, there is less modular overlap between the 2 conditions than there is between each condition and the NT group. The ADHD group also showed reduced cortical thickness and lower degree in hub regions than the autism group. Lastly, the ADHD group also showed reduced wiring costs compared with the autism groups. Our results indicate a need for taking an integrated approach when considering highly comorbid conditions such as autism and ADHD. Furthermore, autism and ADHD both showed alterations in the relation between inter-regional covariance and centroid distance, where both groups show a steeper decline in covariance as a function of distance. The 2 groups also diverge on modular organization, cortical thickness of hub regions and wiring cost of the covariance network. Thus, on some network features the

  10. Oligomeric protein structure networks: insights into protein-protein interactions

    Directory of Open Access Journals (Sweden)

    Brinda KV

    2005-12-01

    Full Text Available Abstract Background Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the principles of protein-protein interactions. In this study, oligomeric protein structures are viewed from a network perspective to obtain new insights into protein association. Structure graphs of proteins have been constructed from a non-redundant set of protein oligomer crystal structures by considering amino acid residues as nodes and the edges are based on the strength of the non-covalent interactions between the residues. The analysis of such networks has been carried out in terms of amino acid clusters and hubs (highly connected residues with special emphasis to protein interfaces. Results A variety of interactions such as hydrogen bond, salt bridges, aromatic and hydrophobic interactions, which occur at the interfaces are identified in a consolidated manner as amino acid clusters at the interface, from this study. Moreover, the characterization of the highly connected hub-forming residues at the interfaces and their comparison with the hubs from the non-interface regions and the non-hubs in the interface regions show that there is a predominance of charged interactions at the interfaces. Further, strong and weak interfaces are identified on the basis of the interaction strength between amino acid residues and the sizes of the interface clusters, which also show that many protein interfaces are stronger than their monomeric protein cores. The interface strengths evaluated based on the interface clusters and hubs also correlate well with experimentally determined dissociation constants for known complexes. Finally, the interface hubs identified using the present method correlate very well with experimentally determined hotspots in the interfaces of protein complexes obtained from the Alanine Scanning Energetics database (ASEdb. A few predictions of interface hot

  11. Using structural equation modeling for network meta-analysis.

    Science.gov (United States)

    Tu, Yu-Kang; Wu, Yun-Chun

    2017-07-14

    Network meta-analysis overcomes the limitations of traditional pair-wise meta-analysis by incorporating all available evidence into a general statistical framework for simultaneous comparisons of several treatments. Currently, network meta-analyses are undertaken either within the Bayesian hierarchical linear models or frequentist generalized linear mixed models. Structural equation modeling (SEM) is a statistical method originally developed for modeling causal relations among observed and latent variables. As random effect is explicitly modeled as a latent variable in SEM, it is very flexible for analysts to specify complex random effect structure and to make linear and nonlinear constraints on parameters. The aim of this article is to show how to undertake a network meta-analysis within the statistical framework of SEM. We used an example dataset to demonstrate the standard fixed and random effect network meta-analysis models can be easily implemented in SEM. It contains results of 26 studies that directly compared three treatment groups A, B and C for prevention of first bleeding in patients with liver cirrhosis. We also showed that a new approach to network meta-analysis based on the technique of unrestricted weighted least squares (UWLS) method can also be undertaken using SEM. For both the fixed and random effect network meta-analysis, SEM yielded similar coefficients and confidence intervals to those reported in the previous literature. The point estimates of two UWLS models were identical to those in the fixed effect model but the confidence intervals were greater. This is consistent with results from the traditional pairwise meta-analyses. Comparing to UWLS model with common variance adjusted factor, UWLS model with unique variance adjusted factor has greater confidence intervals when the heterogeneity was larger in the pairwise comparison. The UWLS model with unique variance adjusted factor reflects the difference in heterogeneity within each comparison

  12. Human cancer protein-protein interaction network: a structural perspective.

    Directory of Open Access Journals (Sweden)

    Gozde Kar

    2009-12-01

    Full Text Available Protein-protein interaction networks provide a global picture of cellular function and biological processes. Some proteins act as hub proteins, highly connected to others, whereas some others have few interactions. The dysfunction of some interactions causes many diseases, including cancer. Proteins interact through their interfaces. Therefore, studying the interface properties of cancer-related proteins will help explain their role in the interaction networks. Similar or overlapping binding sites should be used repeatedly in single interface hub proteins, making them promiscuous. Alternatively, multi-interface hub proteins make use of several distinct binding sites to bind to different partners. We propose a methodology to integrate protein interfaces into cancer interaction networks (ciSPIN, cancer structural protein interface network. The interactions in the human protein interaction network are replaced by interfaces, coming from either known or predicted complexes. We provide a detailed analysis of cancer related human protein-protein interfaces and the topological properties of the cancer network. The results reveal that cancer-related proteins have smaller, more planar, more charged and less hydrophobic binding sites than non-cancer proteins, which may indicate low affinity and high specificity of the cancer-related interactions. We also classified the genes in ciSPIN according to phenotypes. Within phenotypes, for breast cancer, colorectal cancer and leukemia, interface properties were found to be discriminating from non-cancer interfaces with an accuracy of 71%, 67%, 61%, respectively. In addition, cancer-related proteins tend to interact with their partners through distinct interfaces, corresponding mostly to multi-interface hubs, which comprise 56% of cancer-related proteins, and constituting the nodes with higher essentiality in the network (76%. We illustrate the interface related affinity properties of two cancer-related hub

  13. Searching for realism, structure and agency in Actor Network Theory.

    Science.gov (United States)

    Elder-Vass, Dave

    2008-09-01

    Superficially, Actor Network Theory (ANT) and critical realism (CR) are radically opposed research traditions. Written from a realist perspective, this paper asks whether there might be a basis for finding common ground between these two traditions. It looks in turn at the questions of realism, structure, and agency, analysing the differences between the two perspectives and seeking to identify what each might learn from the other. Overall, the paper argues that there is a great deal that realists can learn from actor network theory; yet ANT remains stunted by its lack of a depth ontology. It fails to recognize the significance of mechanisms, and of their dependence on emergence, and thus lacks both dimensions of the depth that is characteristic of critical realism's ontology. This prevents ANT from recognizing the role and powers of social structure; but on the other hand, realists would do well to heed ANT's call for us to trace the connections through which structures are constantly made and remade. A lack of ontological depth also underpins ANT's practice of treating human and non-human actors symmetrically, yet this remains a valuable provocation to sociologists who neglect non-human entities entirely.

  14. True Nature of Supply Network Communication Structure (P.1-14

    Directory of Open Access Journals (Sweden)

    Lokhman Hakim bin Osman

    2017-02-01

    Full Text Available Globalization of world economy has altered the definition of organizational structure. Global supply chain can no longer be viewed as an arm-length structure. It has become more complex. The complexity demands deeper research and understanding. This research analyzed a structure of supply network in an attempt to elucidate the true structure of the supply network. Using the quantitative Social Network Analysis methodology, findings of this study indicated that, the structure of the supply network differs depending on the types of network relations. An important implication of these findings would be a more focus resource management upon network relationship development that is based on firms’ positions in the different network structure. This research also contributes to the various strategies of effective and efficient supply chain management.Keywords: Supply Chain Management, Network Studies, Inter-Organizational Relations, Social Capital

  15. Modeling Broadband Microwave Structures by Artificial Neural Networks

    Directory of Open Access Journals (Sweden)

    V. Otevrel

    2004-06-01

    Full Text Available The paper describes the exploitation of feed-forward neural networksand recurrent neural networks for replacing full-wave numerical modelsof microwave structures in complex microwave design tools. Building aneural model, attention is turned to the modeling accuracy and to theefficiency of building a model. Dealing with the accuracy, we describea method of increasing it by successive completing a training set.Neural models are mutually compared in order to highlight theiradvantages and disadvantages. As a reference model for comparisons,approximations based on standard cubic splines are used. Neural modelsare used to replace both the time-domain numeric models and thefrequency-domain ones.

  16. Refinement of Bayesian Network Structures upon New Data

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Xiang, Yanping; Pacekajus, Saulius

    2010-01-01

    Refinement of Bayesian network (BN) structures using new data becomes more and more relevant. Some work has been done there; however, one problem has not been considered yet – what to do when new data have fewer or more attributes than the existing model. In both cases, data contain important...... knowledge and every effort must be made in order to extract it. In this paper, we propose a general merging algorithm to deal with situations when new data have different set of attributes. The merging algorithm updates sufficient statistics when new data are received. It expands the flexibility of BN...

  17. Learning Spatiotemporally Encoded Pattern Transformations in Structured Spiking Neural Networks.

    Science.gov (United States)

    Gardner, Brian; Sporea, Ioana; Grüning, André

    2015-12-01

    Information encoding in the nervous system is supported through the precise spike timings of neurons; however, an understanding of the underlying processes by which such representations are formed in the first place remains an open question. Here we examine how multilayered networks of spiking neurons can learn to encode for input patterns using a fully temporal coding scheme. To this end, we introduce a new supervised learning rule, MultilayerSpiker, that can train spiking networks containing hidden layer neurons to perform transformations between spatiotemporal input and output spike patterns. The performance of the proposed learning rule is demonstrated in terms of the number of pattern mappings it can learn, the complexity of network structures it can be used on, and its classification accuracy when using multispike-based encodings. In particular, the learning rule displays robustness against input noise and can generalize well on an example data set. Our approach contributes to both a systematic understanding of how computations might take place in the nervous system and a learning rule that displays strong technical capability.

  18. A modular structure to accident identification using neural networks

    International Nuclear Information System (INIS)

    Duque Estrada, Cassius Rodrigo

    2005-01-01

    This work uses the accident identification method based on Artificial Neural Networks (ANN) as basic blocks of a modular structure, allowing the inclusion of new accidents to be identified without modifying the ANN already trained. This structure comprises several modules for accident identification and one module for analysis. Each identification module follows the structure of the basic block. The identification modules are responsible for the recognition of an accident belonging to the specific set of events for which it were trained. The analysis module processes the output from the identification module to determine the system response. In order to test this structure it was proposed a transient identification problem comprising fifty accidents distributed in five identification modules. The results have demonstrated that the accident identification method used as basic block of a modular structure allows the inclusion of new sets of accidents, or variations of a same accident, without modifying the ANN already trained. For this, it is enough to include into the system an specific module for this new set of accidents. (author)

  19. Combining structure, governance and context : A configurational approach to network effectiveness

    NARCIS (Netherlands)

    Raab, J.; Mannak, R.S.; Cambré, B.

    2015-01-01

    This study explores the way in which network structure (network integration), network context (resource munificence and stability), and network governance mode relate to net -work effectiveness. The model by Provan and Milward (Provan, Keith G., and H. Brinton Milward. 1995. A preliminary theory of

  20. Industry Consolidation and Future Airline Network Structures in Europe

    Science.gov (United States)

    Dennis, Nigel

    2003-01-01

    In the current downturn in demand for air travel, major airlines are revising and rationalizing their networks in an attempt to improve financial performance and strengthen their defences against both new entrants and traditional rivals. Expansion of commercial agreements or alliances with other airlines has become a key reaction to the increasingly competitive marketplace. In the absence, for regulatory reasons, of cross-border mergers these are the principal means by which the industry can consolidate internationally. This paper analyzes the developments which have been taking place and attempts to itentify the implications for airline network structures and the function of different hub airports. The range of services available to passengers in long-haul markets to/from Europe is evaluated before and after recent industry reorganization. Hubs are crucial to interlink the route networks of parmers in an alliance. However, duplication between nearby hub airports that find themselves within the same airline alliance can lead to loss of service at the weaker locations. The extent to which the alliance hubs in Europe duplicate or complement each other in terms of network coverage is assessed and this methodology also enables the optimal partnerships for "unattached" airlines to be identified. The future role of the various European hubs is considered under different scenarios of global alliance development. The paper concludes by considering possible longer-term developments. In an environment where the low-cost carriers will provide a major element of customer choice, it is suggested that the traditional airlines will retrench around their hubs, surrendering many secondary cities to the low-cost sector. Further reduction in the number of alliances could threaten more of the European hubs. For both regulatory and commercial reasons, the end result may be just one airline alliance - so recreating in the deregulated market the historic rule of IATA.

  1. Cascaded bidirectional recurrent neural networks for protein secondary structure prediction.

    Science.gov (United States)

    Chen, Jinmiao; Chaudhari, Narendra

    2007-01-01

    Protein secondary structure (PSS) prediction is an important topic in bioinformatics. Our study on a large set of non-homologous proteins shows that long-range interactions commonly exist and negatively affect PSS prediction. Besides, we also reveal strong correlations between secondary structure (SS) elements. In order to take into account the long-range interactions and SS-SS correlations, we propose a novel prediction system based on cascaded bidirectional recurrent neural network (BRNN). We compare the cascaded BRNN against another two BRNN architectures, namely the original BRNN architecture used for speech recognition as well as Pollastri's BRNN that was proposed for PSS prediction. Our cascaded BRNN achieves an overall three state accuracy Q3 of 74.38\\%, and reaches a high Segment OVerlap (SOV) of 66.0455. It outperforms the original BRNN and Pollastri's BRNN in both Q3 and SOV. Specifically, it improves the SOV score by 4-6%.

  2. Virality Prediction and Community Structure in Social Networks

    Science.gov (United States)

    Weng, Lilian; Menczer, Filippo; Ahn, Yong-Yeol

    2013-08-01

    How does network structure affect diffusion? Recent studies suggest that the answer depends on the type of contagion. Complex contagions, unlike infectious diseases (simple contagions), are affected by social reinforcement and homophily. Hence, the spread within highly clustered communities is enhanced, while diffusion across communities is hampered. A common hypothesis is that memes and behaviors are complex contagions. We show that, while most memes indeed spread like complex contagions, a few viral memes spread across many communities, like diseases. We demonstrate that the future popularity of a meme can be predicted by quantifying its early spreading pattern in terms of community concentration. The more communities a meme permeates, the more viral it is. We present a practical method to translate data about community structure into predictive knowledge about what information will spread widely. This connection contributes to our understanding in computational social science, social media analytics, and marketing applications.

  3. Electron excitation cross sections for the 2s^2 2p ^2p^o-2s2p^2 ^4p and 2s2p^2 ^2D transitions in O^3+

    Science.gov (United States)

    Smith, S. J.; Lozano, J. A.; Tayal, S. S.; Chutjian, A.

    2003-01-01

    Comparison is made with results of new calculations in a 25-state R-matrix theory and with results in a previous eight-state R-matrix calculation. The presence of rich resonance structure is confirmed in both experiment and theory.

  4. Density-based and transport-based core-periphery structures in networks.

    Science.gov (United States)

    Lee, Sang Hoon; Cucuringu, Mihai; Porter, Mason A

    2014-03-01

    Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks-including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.

  5. Brain gray matter structural network in myotonic dystrophy type 1.

    Directory of Open Access Journals (Sweden)

    Atsuhiko Sugiyama

    Full Text Available This study aimed to investigate abnormalities in structural covariance network constructed from gray matter volume in myotonic dystrophy type 1 (DM1 patients by using graph theoretical analysis for further clarification of the underlying mechanisms of central nervous system involvement. Twenty-eight DM1 patients (4 childhood onset, 10 juvenile onset, 14 adult onset, excluding three cases from 31 consecutive patients who underwent magnetic resonance imaging in a certain period, and 28 age- and sex- matched healthy control subjects were included in this study. The normalized gray matter images of both groups were subjected to voxel based morphometry (VBM and Graph Analysis Toolbox for graph theoretical analysis. VBM revealed extensive gray matter atrophy in DM1 patients, including cortical and subcortical structures. On graph theoretical analysis, there were no significant differences between DM1 and control groups in terms of the global measures of connectivity. Betweenness centrality was increased in several regions including the left fusiform gyrus, whereas it was decreased in the right striatum. The absence of significant differences between the groups in global network measurements on graph theoretical analysis is consistent with the fact that the general cognitive function is preserved in DM1 patients. In DM1 patients, increased connectivity in the left fusiform gyrus and decreased connectivity in the right striatum might be associated with impairment in face perception and theory of mind, and schizotypal-paranoid personality traits, respectively.

  6. Complex Network Structure Influences Processing in Long-Term and Short-Term Memory

    Science.gov (United States)

    Vitevitch, Michael S.; Chan, Kit Ying; Roodenrys, Steven

    2012-01-01

    Complex networks describe how entities in systems interact; the structure of such networks is argued to influence processing. One measure of network structure, clustering coefficient, C, measures the extent to which neighbors of a node are also neighbors of each other. Previous psycholinguistic experiments found that the C of phonological…

  7. The formation of a core-periphery structure in heterogeneous financial networks

    NARCIS (Netherlands)

    van der Leij, M.; in 't Veld, D.; Hommes, C.

    2016-01-01

    Recent empirical evidence suggests that financial networks exhibit a core-periphery network structure. This paper aims at giving an explanation for the emergence of such a structure using network formation theory. We propose a simple model of the overnight interbank lending market, in which banks

  8. Composition and structure of a large online social network in The Netherlands.

    Directory of Open Access Journals (Sweden)

    Rense Corten

    Full Text Available Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization. The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in The Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for The Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities.

  9. Composition and structure of a large online social network in The Netherlands.

    Science.gov (United States)

    Corten, Rense

    2012-01-01

    Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization). The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in The Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for The Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities.

  10. Radiation-Induced Topological Disorder in Irradiated Network Structures

    International Nuclear Information System (INIS)

    Hobbs, Linn W.

    2002-12-01

    This report summarizes results of a research program investigating the fundamental principles underlying the phenomenon of topological disordering in a radiation environment. This phenomenon is known popularly as amorphization, but is more formally described as a process of radiation-induced structural arrangement that leads in crystals to loss of long-range translational and orientational correlations and in glasses to analogous alteration of connectivity topologies. The program focus has been on a set compound ceramic solids with directed bonding exhibiting structures that can be described as networks. Such solids include SiO2, Si3N4, SiC, which are of interest to applications in fusion energy production, nuclear waste storage, and device manufacture involving ion implantation or use in radiation fields. The principal investigative tools comprise a combination of experimental diffraction-based techniques, topological modeling, and molecular-dynamics simulations that have proven a rich source of information in the preceding support period. The results from the present support period fall into three task areas. The first comprises enumeration of the rigidity constraints applying to (1) more complex ceramic structures (such as rutile, corundum, spinel and olivine structures) that exhibit multiply polytopic coordination units or multiple modes of connecting such units, (2) elemental solids (such as graphite, silicon and diamond) for which a correct choice of polytope is necessary to achieve correct representation of the constraints, and (3) compounds (such as spinel and silicon carbide) that exhibit chemical disorder on one or several sublattices. With correct identification of the topological constraints, a unique correlation is shown to exist between constraint and amorphizability which demonstrates that amorphization occurs at a critical constraint loss. The second task involves the application of molecular dynamics (MD) methods to topologically-generated models

  11. Modular structure of functional networks in olfactory memory.

    Science.gov (United States)

    Meunier, David; Fonlupt, Pierre; Saive, Anne-Lise; Plailly, Jane; Ravel, Nadine; Royet, Jean-Pierre

    2014-07-15

    Graph theory enables the study of systems by describing those systems as a set of nodes and edges. Graph theory has been widely applied to characterize the overall structure of data sets in the social, technological, and biological sciences, including neuroscience. Modular structure decomposition enables the definition of sub-networks whose components are gathered in the same module and work together closely, while working weakly with components from other modules. This processing is of interest for studying memory, a cognitive process that is widely distributed. We propose a new method to identify modular structure in task-related functional magnetic resonance imaging (fMRI) networks. The modular structure was obtained directly from correlation coefficients and thus retained information about both signs and weights. The method was applied to functional data acquired during a yes-no odor recognition memory task performed by young and elderly adults. Four response categories were explored: correct (Hit) and incorrect (False alarm, FA) recognition and correct and incorrect rejection. We extracted time series data for 36 areas as a function of response categories and age groups and calculated condition-based weighted correlation matrices. Overall, condition-based modular partitions were more homogeneous in young than elderly subjects. Using partition similarity-based statistics and a posteriori statistical analyses, we demonstrated that several areas, including the hippocampus, caudate nucleus, and anterior cingulate gyrus, belonged to the same module more frequently during Hit than during all other conditions. Modularity values were negatively correlated with memory scores in the Hit condition and positively correlated with bias scores (liberal/conservative attitude) in the Hit and FA conditions. We further demonstrated that the proportion of positive and negative links between areas of different modules (i.e., the proportion of correlated and anti-correlated areas

  12. Fragmentation alters stream fish community structure in dendritic ecological networks.

    Science.gov (United States)

    Perkin, Joshuah S; Gido, Keith B

    2012-12-01

    Effects of fragmentation on the ecology of organisms occupying dendritic ecological networks (DENs) have recently been described through both conceptual and mathematical models, but few hypotheses have been tested in complex, real-world ecosystems. Stream fishes provide a model system for assessing effects of fragmentation on the structure of communities occurring within DENs, including how fragmentation alters metacommunity dynamics and biodiversity. A recently developed habitat-availability measure, the "dendritic connectivity index" (DCI), allows for assigning quantitative measures of connectivity in DENs regardless of network extent or complexity, and might be used to predict fish community response to fragmentation. We characterized stream fish community structure in 12 DENs in the Great Plains, USA, during periods of dynamic (summer) and muted (fall) discharge regimes to test the DCI as a predictive model of fish community response to fragmentation imposed by road crossings. Results indicated that fish communities in stream segments isolated by road crossings had reduced species richness (alpha diversity) relative to communities that maintained connectivity with the surrounding DEN during summer and fall. Furthermore, isolated communities had greater dissimilarity (beta diversity) to downstream sites notisolated by road crossings during summer and fall. Finally, dissimilarity among communities within DENs decreased as a function of increased habitat connectivity (measured using the DCI) for summer and fall, suggesting that communities within highly connected DENs tend to be more homogeneous. Our results indicate that the DCI is sensitive to community effects of fragmentation in riverscapes and might be used by managers to predict ecological responses to changes in habitat connectivity. Moreover, our findings illustrate that relating structural connectivity of riverscapes to functional connectivity among communities might aid in maintaining metacommunity

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

  14. General asymmetric neutral networks and structure design by genetic algorithms: A learning rule for temporal patterns

    Energy Technology Data Exchange (ETDEWEB)

    Bornholdt, S. [Heidelberg Univ., (Germany). Inst., fuer Theoretische Physik; Graudenz, D. [Lawrence Berkeley Lab., CA (United States)

    1993-07-01

    A learning algorithm based on genetic algorithms for asymmetric neural networks with an arbitrary structure is presented. It is suited for the learning of temporal patterns and leads to stable neural networks with feedback.

  15. Data envelopment analysis a handbook of modeling internal structure and network

    CERN Document Server

    Cook, Wade D

    2014-01-01

    This comprehensive handbook on state-of-the-art topics in DEA modeling of internal structures and networks presents work by leading researchers who share their results on subjects including additive efficiency decomposition and slacks-based network DEA.

  16. General asymmetric neutral networks and structure design by genetic algorithms: A learning rule for temporal patterns

    International Nuclear Information System (INIS)

    Bornholdt, S.

    1993-07-01

    A learning algorithm based on genetic algorithms for asymmetric neural networks with an arbitrary structure is presented. It is suited for the learning of temporal patterns and leads to stable neural networks with feedback

  17. Similarity between community structures of different online social networks and its impact on underlying community detection

    Science.gov (United States)

    Fan, W.; Yeung, K. H.

    2015-03-01

    As social networking services are popular, many people may register in more than one online social network. In this paper we study a set of users who have accounts of three online social networks: namely Foursquare, Facebook and Twitter. Community structure of this set of users may be reflected in these three online social networks. Therefore, high correlation between these reflections and the underlying community structure may be observed. In this work, community structures are detected in all three online social networks. Also, we investigate the similarity level of community structures across different networks. It is found that they show strong correlation with each other. The similarity between different networks may be helpful to find a community structure close to the underlying one. To verify this, we propose a method to increase the weights of some connections in networks. With this method, new networks are generated to assist community detection. By doing this, value of modularity can be improved and the new community structure match network's natural structure better. In this paper we also show that the detected community structures of online social networks are correlated with users' locations which are identified on Foursquare. This information may also be useful for underlying community detection.

  18. Structure identification and adaptive synchronization of uncertain general complex dynamical networks

    Energy Technology Data Exchange (ETDEWEB)

    Xu Yuhua, E-mail: yuhuaxu2004@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China) and Department of Maths, Yunyang Teacher' s College, Hubei 442000 (China); Zhou Wuneng, E-mail: wnzhou@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Fang Jian' an [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Lu Hongqian [Shandong Institute of Light Industry, Shandong Jinan 250353 (China)

    2009-12-28

    This Letter proposes an approach to identify the topological structure and unknown parameters for uncertain general complex networks simultaneously. By designing effective adaptive controllers, we achieve synchronization between two complex networks. The unknown network topological structure and system parameters of uncertain general complex dynamical networks are identified simultaneously in the process of synchronization. Several useful criteria for synchronization are given. Finally, an illustrative example is presented to demonstrate the application of the theoretical results.

  19. Structure identification and adaptive synchronization of uncertain general complex dynamical networks

    International Nuclear Information System (INIS)

    Xu Yuhua; Zhou Wuneng; Fang Jian'an; Lu Hongqian

    2009-01-01

    This Letter proposes an approach to identify the topological structure and unknown parameters for uncertain general complex networks simultaneously. By designing effective adaptive controllers, we achieve synchronization between two complex networks. The unknown network topological structure and system parameters of uncertain general complex dynamical networks are identified simultaneously in the process of synchronization. Several useful criteria for synchronization are given. Finally, an illustrative example is presented to demonstrate the application of the theoretical results.

  20. Structure-function relationships in elderly resting-state-networks : influence of age and cognitive performance

    OpenAIRE

    Jockwitz, Christiane

    2016-01-01

    The aim of this work was to investigate the structure-function relationship in cognitive resting state networks in a large population-based elderly sample. The first study characterized the functional connectivity in four cognitive resting state networks with respect to age, gender and cognitive performance: Default Mode Network (DMN), executive, and left and right frontoparietal resting state networks. The second study assessed the structural correlates of the functional reorganization of th...

  1. A wireless sensor network design and evaluation for large structural strain field monitoring

    International Nuclear Information System (INIS)

    Qiu, Zixue; Wu, Jian; Yuan, Shenfang

    2011-01-01

    Structural strain changes under external environmental or mechanical loads are the main monitoring parameters in structural health monitoring or mechanical property tests. This paper presents a wireless sensor network designed for monitoring large structural strain field variation. First of all, a precision strain sensor node is designed for multi-channel strain gauge signal conditioning and wireless monitoring. In order to establish a synchronous strain data acquisition network, the cluster-star network synchronization method is designed in detail. To verify the functionality of the designed wireless network for strain field monitoring capability, a multi-point network evaluation system is developed for an experimental aluminum plate structure for load variation monitoring. Based on the precision wireless strain nodes, the wireless data acquisition network is deployed to synchronously gather, process and transmit strain gauge signals and monitor results under concentrated loads. This paper shows the efficiency of the wireless sensor network for large structural strain field monitoring

  2. Structural Properties of the Brazilian Air Transportation Network

    Directory of Open Access Journals (Sweden)

    GUILHERME S. COUTO

    2015-09-01

    Full Text Available The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.

  3. Structural Properties of the Brazilian Air Transportation Network.

    Science.gov (United States)

    Couto, Guilherme S; da Silva, Ana Paula Couto; Ruiz, Linnyer B; Benevenuto, Fabrício

    2015-09-01

    The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City) is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.

  4. Bandwidth Impacts of Localizing Peer-to-Peer IP Video Traffic in Access and Aggregation Networks

    Directory of Open Access Journals (Sweden)

    Kerpez Kenneth

    2008-01-01

    Full Text Available Abstract This paper examines the burgeoning impact of peer-to-peer (P2P traffic IP video traffic. High-quality IPTV or Internet TV has high-bandwidth requirements, and P2P IP video could severely strain broadband networks. A model for the popularity of video titles is given, showing that some titles are very popular and will often be available locally; making localized P2P attractive for video titles. The bandwidth impacts of localizing P2P video to try and keep traffic within a broadband access network area or within a broadband access aggregation network area are examined. Results indicate that such highly localized P2P video can greatly lower core bandwidth usage.

  5. Bandwidth Impacts of Localizing Peer-to-Peer IP Video Traffic in Access and Aggregation Networks

    Directory of Open Access Journals (Sweden)

    Kenneth Kerpez

    2008-10-01

    Full Text Available This paper examines the burgeoning impact of peer-to-peer (P2P traffic IP video traffic. High-quality IPTV or Internet TV has high-bandwidth requirements, and P2P IP video could severely strain broadband networks. A model for the popularity of video titles is given, showing that some titles are very popular and will often be available locally; making localized P2P attractive for video titles. The bandwidth impacts of localizing P2P video to try and keep traffic within a broadband access network area or within a broadband access aggregation network area are examined. Results indicate that such highly localized P2P video can greatly lower core bandwidth usage.

  6. Energy Harvesting for Structural Health Monitoring Sensor Networks

    Energy Technology Data Exchange (ETDEWEB)

    Park, G.; Farrar, C. R.; Todd, M. D.; Hodgkiss, T.; Rosing, T.

    2007-02-26

    This report has been developed based on information exchanges at a 2.5-day workshop on energy harvesting for embedded structural health monitoring (SHM) sensing systems that was held June 28-30, 2005, at Los Alamos National Laboratory. The workshop was hosted by the LANL/UCSD Engineering Institute (EI). This Institute is an education- and research-focused collaboration between Los Alamos National Laboratory (LANL) and the University of California, San Diego (UCSD), Jacobs School of Engineering. A Statistical Pattern Recognition paradigm for SHM is first presented and the concept of energy harvesting for embedded sensing systems is addressed with respect to the data acquisition portion of this paradigm. Next, various existing and emerging sensing modalities used for SHM and their respective power requirements are summarized, followed by a discussion of SHM sensor network paradigms, power requirements for these networks and power optimization strategies. Various approaches to energy harvesting and energy storage are discussed and limitations associated with the current technology are addressed. This discussion also addresses current energy harvesting applications and system integration issues. The report concludes by defining some future research directions and possible technology demonstrations that are aimed at transitioning the concept of energy harvesting for embedded SHM sensing systems from laboratory research to field-deployed engineering prototypes.

  7. Structure Learning and Statistical Estimation in Distribution Networks - Part I

    Energy Technology Data Exchange (ETDEWEB)

    Deka, Deepjyoti [Univ. of Texas, Austin, TX (United States); Backhaus, Scott N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-02-13

    Traditionally power distribution networks are either not observable or only partially observable. This complicates development and implementation of new smart grid technologies, such as those related to demand response, outage detection and management, and improved load-monitoring. In this two part paper, inspired by proliferation of the metering technology, we discuss estimation problems in structurally loopy but operationally radial distribution grids from measurements, e.g. voltage data, which are either already available or can be made available with a relatively minor investment. In Part I, the objective is to learn the operational layout of the grid. Part II of this paper presents algorithms that estimate load statistics or line parameters in addition to learning the grid structure. Further, Part II discusses the problem of structure estimation for systems with incomplete measurement sets. Our newly suggested algorithms apply to a wide range of realistic scenarios. The algorithms are also computationally efficient – polynomial in time– which is proven theoretically and illustrated computationally on a number of test cases. The technique developed can be applied to detect line failures in real time as well as to understand the scope of possible adversarial attacks on the grid.

  8. Building alternate protein structures using the elastic network model.

    Science.gov (United States)

    Yang, Qingyi; Sharp, Kim A

    2009-02-15

    We describe a method for efficiently generating ensembles of alternate, all-atom protein structures that (a) differ significantly from the starting structure, (b) have good stereochemistry (bonded geometry), and (c) have good steric properties (absence of atomic overlap). The method uses reconstruction from a series of backbone framework structures that are obtained from a modified elastic network model (ENM) by perturbation along low-frequency normal modes. To ensure good quality backbone frameworks, the single force parameter ENM is modified by introducing two more force parameters to characterize the interaction between the consecutive carbon alphas and those within the same secondary structure domain. The relative stiffness of the three parameters is parameterized to reproduce B-factors, while maintaining good bonded geometry. After parameterization, violations of experimental Calpha-Calpha distances and Calpha-Calpha-Calpha pseudo angles along the backbone are reduced to less than 1%. Simultaneously, the average B-factor correlation coefficient improves to R = 0.77. Two applications illustrate the potential of the approach. (1) 102,051 protein backbones spanning a conformational space of 15 A root mean square deviation were generated from 148 nonredundant proteins in the PDB database, and all-atom models with minimal bonded and nonbonded violations were produced from this ensemble of backbone structures using the SCWRL side chain building program. (2) Improved backbone templates for homology modeling. Fifteen query sequences were each modeled on two targets. For each of the 30 target frameworks, dozens of improved templates could be produced In all cases, improved full atom homology models resulted, of which 50% could be identified blind using the D-Fire statistical potential. (c) 2008 Wiley-Liss, Inc.

  9. Fundamentals of complex networks models, structures and dynamics

    CERN Document Server

    Chen, Guanrong; Li, Xiang

    2014-01-01

    Complex networks such as the Internet, WWW, transportationnetworks, power grids, biological neural networks, and scientificcooperation networks of all kinds provide challenges for futuretechnological development. In particular, advanced societies havebecome dependent on large infrastructural networks to an extentbeyond our capability to plan (modeling) and to operate (control).The recent spate of collapses in power grids and ongoing virusattacks on the Internet illustrate the need for knowledge aboutmodeling, analysis of behaviors, optimized planning and performancecontrol in such networks. F

  10. Interacting with Networks : How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?

    NARCIS (Netherlands)

    Egerstedt, Magnus; Martini, Simone; Cao, Ming; Camlibel, Kanat; Bicchi, Antonio

    As networked dynamical systems appear around us at an increasing rate, questions concerning how to manage and control such systems are becoming more important. Examples include multiagent robotics, distributed sensor networks, interconnected manufacturing chains, and data networks. In response to

  11. Effect of synapse dilution on the memory retrieval in structured attractor neural networks

    Science.gov (United States)

    Brunel, N.

    1993-08-01

    We investigate a simple model of structured attractor neural network (ANN). In this network a module codes for the category of the stored information, while another group of neurons codes for the remaining information. The probability distribution of stabilities of the patterns and the prototypes of the categories are calculated, for two different synaptic structures. The stability of the prototypes is shown to increase when the fraction of neurons coding for the category goes down. Then the effect of synapse destruction on the retrieval is studied in two opposite situations : first analytically in sparsely connected networks, then numerically in completely connected ones. In both cases the behaviour of the structured network and that of the usual homogeneous networks are compared. When lesions increase, two transitions are shown to appear in the behaviour of the structured network when one of the patterns is presented to the network. After the first transition the network recognizes the category of the pattern but not the individual pattern. After the second transition the network recognizes nothing. These effects are similar to syndromes caused by lesions in the central visual system, namely prosopagnosia and agnosia. In both types of networks (structured or homogeneous) the stability of the prototype is greater than the stability of individual patterns, however the first transition, for completely connected networks, occurs only when the network is structured.

  12. Trichomes: different regulatory networks lead to convergent structures.

    Science.gov (United States)

    Serna, Laura; Martin, Cathie

    2006-06-01

    Sometimes, proteins, biological structures or even organisms have similar functions and appearances but have evolved through widely divergent pathways. There is experimental evidence to suggest that different developmental pathways have converged to produce similar outgrowths of the aerial plant epidermis, referred to as trichomes. The emerging picture suggests that trichomes in Arabidopsis thaliana and, perhaps, in cotton develop through a transcriptional regulatory network that differs from those regulating trichome formation in Antirrhinum and Solanaceous species. Several lines of evidence suggest that the duplication of a gene controlling anthocyanin production and subsequent divergence might be the major force driving trichome formation in Arabidopsis, whereas the multicellular trichomes of Antirrhinum and Solanaceous species appear to have a different regulatory origin.

  13. Interbank lending, network structure and default risk contagion

    Science.gov (United States)

    Zhang, Minghui; He, Jianmin; Li, Shouwei

    2018-03-01

    This paper studies the default risk contagion in banking systems based on a dynamic network model with two different kinds of lenders' selecting mechanisms, namely, endogenous selecting (ES) and random selecting (RS). From sensitivity analysis, we find that higher risk premium, lower initial proportion of net assets, higher liquid assets threshold, larger size of liquidity shocks, higher proportion of the initial investments and higher Central Bank interest rates all lead to severer default risk contagion. Moreover, the autocorrelation of deposits and lenders' selecting probability have non-monotonic effects on the default risk contagion, and the effects differ under two mechanisms. Generally, the default risk contagion is much severer under RS mechanism than that of ES, because the multi-money-center structure generated by ES mechanism enables borrowers to borrow from more liquid banks with lower interest rates.

  14. Structure and external factors of chinese city airline network

    Science.gov (United States)

    Liu, Hong-Kun; Zhang, Xiao-Li; Zhou, Tao

    2010-08-01

    Abstract We investigate the structural properties of Chinese city airline network (CCAN), where nodes and edges denote cities and direct flights. The degree distribution follows a double power law and a clear hierarchical layout is observed. The population exhibits a weakly positive correlation with the number of flights, yet it does not show obvious correlation with the transportation flow. The distance is an important parameter in CCAN, that is, the number of flights decays fast with the increasing of the distance. In comparison, the tertiary industry has the most important influence on the Chinese air passenger transportation. Statistically speaking, when the tertiary industry value increases by 1%, the next period's volume will increase by 0.73%.

  15. Detection of radiation transitions between 4d9(D5/3,3/2)5s2nl and 4d105p(2P1/2,3/20)nl of self-ionized states of cadmium atom at electron-ion collisions

    International Nuclear Information System (INIS)

    Gomonaj, A.N.; Imre, A.I.

    2005-01-01

    Radiation transitions between 4d 9 ( 2 D 5/2,3/2 )5s 2 nl and 4d 10 5p( 2 P 1/2,3/2 0 )nl self-ionized states of Cd atom being dielectron satellites of λ325.0 nm (4d 9 5s 22 D 3/2 →4d 10 5p 2 P 1/2 0 ) and λ353.6 nm (4d 9 5s 22 D 3/2 → 4d 10 5p 2 P 3/2 0 ) laser lines of Cd + ion were detected for the first time at electron-ion collisions. One studied energy dependences of the effective cross sections of electron excitation of the satellite lines within 7-10 eV energy range. The effective cross sections of excitation of dielectron satellites constitutes ∼ 10 -17 cm 2 that is comparable with the efficiency of excitation of the laser lines [ru

  16. A user exposure based approach for non-structural road network vulnerability analysis.

    Directory of Open Access Journals (Sweden)

    Lei Jin

    Full Text Available Aiming at the dense urban road network vulnerability without structural negative consequences, this paper proposes a novel non-structural road network vulnerability analysis framework. Three aspects of the framework are mainly described: (i the rationality of non-structural road network vulnerability, (ii the metrics for negative consequences accounting for variant road conditions, and (iii the introduction of a new vulnerability index based on user exposure. Based on the proposed methodology, a case study in the Sioux Falls network which was usually threatened by regular heavy snow during wintertime is detailedly discussed. The vulnerability ranking of links of Sioux Falls network with respect to heavy snow scenario is identified. As a result of non-structural consequences accompanied by conceivable degeneration of network, there are significant increases in generalized travel time costs which are measurements for "emotionally hurt" of topological road network.

  17. Common neighbour structure and similarity intensity in complex networks

    Science.gov (United States)

    Hou, Lei; Liu, Kecheng

    2017-10-01

    Complex systems as networks always exhibit strong regularities, implying underlying mechanisms governing their evolution. In addition to the degree preference, the similarity has been argued to be another driver for networks. Assuming a network is randomly organised without similarity preference, the present paper studies the expected number of common neighbours between vertices. A symmetrical similarity index is accordingly developed by removing such expected number from the observed common neighbours. The developed index can not only describe the similarities between vertices, but also the dissimilarities. We further apply the proposed index to measure of the influence of similarity on the wring patterns of networks. Fifteen empirical networks as well as artificial networks are examined in terms of similarity intensity and degree heterogeneity. Results on real networks indicate that, social networks are strongly governed by the similarity as well as the degree preference, while the biological networks and infrastructure networks show no apparent similarity governance. Particularly, classical network models, such as the Barabási-Albert model, the Erdös-Rényi model and the Ring Lattice, cannot well describe the social networks in terms of the degree heterogeneity and similarity intensity. The findings may shed some light on the modelling and link prediction of different classes of networks.

  18. Uncovering the community structure associated with the diffusion dynamics on networks

    International Nuclear Information System (INIS)

    Cheng, Xue-Qi; Shen, Hua-Wei

    2010-01-01

    As two main focuses of the study of complex networks, the community structure and the dynamics on networks have both attracted much attention in various scientific fields. However, it is still an open question how the community structure is associated with the dynamics on complex networks. In this paper, through investigating the diffusion process taking place on networks, we demonstrate that the intrinsic community structure of networks can be revealed by the stable local equilibrium states of the diffusion process. Furthermore, we show that such community structure can be directly identified through the optimization of the conductance of the network, which measures how easily the diffusion among different communities occurs. Tests on benchmark networks indicate that the conductance optimization method significantly outperforms the modularity optimization methods in identifying the community structure of networks. Applications to real world networks also demonstrate the effectiveness of the conductance optimization method. This work provides insights into the multiple topological scales of complex networks, and the community structure obtained can naturally reflect the diffusion capability of the underlying network

  19. Multilabel user classification using the community structure of online networks.

    Science.gov (United States)

    Rizos, Georgios; Papadopoulos, Symeon; Kompatsiaris, Yiannis

    2017-01-01

    We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE), an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

  20. Multilabel user classification using the community structure of online networks.

    Directory of Open Access Journals (Sweden)

    Georgios Rizos

    Full Text Available We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE, an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

  1. Convolution neural-network-based detection of lung structures

    Science.gov (United States)

    Hasegawa, Akira; Lo, Shih-Chung B.; Freedman, Matthew T.; Mun, Seong K.

    1994-05-01

    Chest radiography is one of the most primary and widely used techniques in diagnostic imaging. Nowadays with the advent of digital radiology, the digital medical image processing techniques for digital chest radiographs have attracted considerable attention, and several studies on the computer-aided diagnosis (CADx) as well as on the conventional image processing techniques for chest radiographs have been reported. In the automatic diagnostic process for chest radiographs, it is important to outline the areas of the lungs, the heart, and the diaphragm. This is because the original chest radiograph is composed of important anatomic structures and, without knowing exact positions of the organs, the automatic diagnosis may result in unexpected detections. The automatic extraction of an anatomical structure from digital chest radiographs can be a useful tool for (1) the evaluation of heart size, (2) automatic detection of interstitial lung diseases, (3) automatic detection of lung nodules, and (4) data compression, etc. Based on the clearly defined boundaries of heart area, rib spaces, rib positions, and rib cage extracted, one should be able to use this information to facilitate the tasks of the CADx on chest radiographs. In this paper, we present an automatic scheme for the detection of lung field from chest radiographs by using a shift-invariant convolution neural network. A novel algorithm for smoothing boundaries of lungs is also presented.

  2. Structure Identification of Uncertain Complex Networks Based on Anticipatory Projective Synchronization.

    Directory of Open Access Journals (Sweden)

    Liu Heng

    Full Text Available This paper investigates a method to identify uncertain system parameters and unknown topological structure in general complex networks with or without time delay. A complex network, which has uncertain topology and unknown parameters, is designed as a drive network, and a known response complex network with an input controller is designed to identify the drive network. Under the proposed input controller, the drive network and the response network can achieve anticipatory projective synchronization when the system is steady. Lyapunov theorem and Barbǎlat's lemma guarantee the stability of synchronization manifold between two networks. When the synchronization is achieved, the system parameters and topology in response network can be changed to equal with the parameters and topology in drive network. A numerical example is given to show the effectiveness of the proposed method.

  3. Inferring Structure and Forecasting Dynamics on Evolving Networks

    Science.gov (United States)

    2016-01-05

    Graphs ........................................................................................................................ 23 7. Sacred Values...5) Team Formation; (6) Games of Graphs; (7) Sacred Values and Legitimacy in Network Interactions; (8) Network processes in Geo-Social Context. 1...Authority, Cooperation and Competition in Religious Networks Key Papers: McBride 2015a [72] and McBride 2015b [73] McBride (2015a) examines

  4. Ethnicity and Population Structure in Personal Naming Networks

    Science.gov (United States)

    Mateos, Pablo; Longley, Paul A.; O'Sullivan, David

    2011-01-01

    Personal naming practices exist in all human groups and are far from random. Rather, they continue to reflect social norms and ethno-cultural customs that have developed over generations. As a consequence, contemporary name frequency distributions retain distinct geographic, social and ethno-cultural patterning that can be exploited to understand population structure in human biology, public health and social science. Previous attempts to detect and delineate such structure in large populations have entailed extensive empirical analysis of naming conventions in different parts of the world without seeking any general or automated methods of population classification by ethno-cultural origin. Here we show how ‘naming networks’, constructed from forename-surname pairs of a large sample of the contemporary human population in 17 countries, provide a valuable representation of cultural, ethnic and linguistic population structure around the world. This innovative approach enriches and adds value to automated population classification through conventional national data sources such as telephone directories and electoral registers. The method identifies clear social and ethno-cultural clusters in such naming networks that extend far beyond the geographic areas in which particular names originated, and that are preserved even after international migration. Moreover, one of the most striking findings of this approach is that these clusters simply ‘emerge’ from the aggregation of millions of individual decisions on parental naming practices for their children, without any prior knowledge introduced by the researcher. Our probabilistic approach to community assignment, both at city level as well as at a global scale, helps to reveal the degree of isolation, integration or overlap between human populations in our rapidly globalising world. As such, this work has important implications for research in population genetics, public health, and social science adding new

  5. Structure-function relationships during segregated and integrated network states of human brain functional connectivity.

    Science.gov (United States)

    Fukushima, Makoto; Betzel, Richard F; He, Ye; van den Heuvel, Martijn P; Zuo, Xi-Nian; Sporns, Olaf

    2018-04-01

    Structural white matter connections are thought to facilitate integration of neural information across functionally segregated systems. Recent studies have demonstrated that changes in the balance between segregation and integration in brain networks can be tracked by time-resolved functional connectivity derived from resting-state functional magnetic resonance imaging (rs-fMRI) data and that fluctuations between segregated and integrated network states are related to human behavior. However, how these network states relate to structural connectivity is largely unknown. To obtain a better understanding of structural substrates for these network states, we investigated how the relationship between structural connectivity, derived from diffusion tractography, and functional connectivity, as measured by rs-fMRI, changes with fluctuations between segregated and integrated states in the human brain. We found that the similarity of edge weights between structural and functional connectivity was greater in the integrated state, especially at edges connecting the default mode and the dorsal attention networks. We also demonstrated that the similarity of network partitions, evaluated between structural and functional connectivity, increased and the density of direct structural connections within modules in functional networks was elevated during the integrated state. These results suggest that, when functional connectivity exhibited an integrated network topology, structural connectivity and functional connectivity were more closely linked to each other and direct structural connections mediated a larger proportion of neural communication within functional modules. Our findings point out the possibility of significant contributions of structural connections to integrative neural processes underlying human behavior.

  6. Entrepreneur online social networks: structure, diversity and impact on start-up survival

    NARCIS (Netherlands)

    Song, Y.; Vinig, T.

    2012-01-01

    In this paper, we discuss the results of a pilot study in which we use a novel approach to collect entrepreneur online social network data from LinkedIn, Facebook and Twitter. We studied the size and structure of entrepreneur social networks by analysing the online network industry and location

  7. Bayesian exponential random graph modeling of whole-brain structural networks across lifespan

    NARCIS (Netherlands)

    Sinke, Michel R T; Dijkhuizen, Rick M; Caimo, Alberto; Stam, Cornelis J; Otte, Wim

    2016-01-01

    Descriptive neural network analyses have provided important insights into the organization of structural and functional networks in the human brain. However, these analyses have limitations for inter-subject or between-group comparisons in which network sizes and edge densities may differ, such as

  8. On Line Segment Length and Mapping 4-regular Grid Structures in Network Infrastructures

    DEFF Research Database (Denmark)

    Riaz, Muhammad Tahir; Nielsen, Rasmus Hjorth; Pedersen, Jens Myrup

    2006-01-01

    The paper focuses on mapping the road network into 4-regular grid structures. A mapping algorithm is proposed. To model the road network GIS data have been used. The Geographic Information System (GIS) data for the road network are composed with different size of line segment lengths...

  9. Optimal network structure in an open market environment

    International Nuclear Information System (INIS)

    2002-01-01

    The focus of this report is on network planning in the new environment of a liberalized electricity market. The development of the network is viewed from different stakeholders objectives. The stakeholders in the transmission network are groups or individuals who have a stake in, or an expectation of the development and performance of the network. An open network exists when all market players meet equal admission rights and obligations. This required that the grid be administered through a transparent set of rules such as a grid code. (author)

  10. Review of Brookhaven nuclear transparency measurements in (p,2p ...

    Indian Academy of Sciences (India)

    In this contribution we summarize the results of two experiments to measure ... Nuclear; color transparency; protons; alternating gradient synchrotron; large angle. ..... Proceedings of the XIII International Symposium on Multi-particle Dynamics.

  11. Nonmonotonic Trust Management for P2P Applications

    NARCIS (Netherlands)

    Czenko, M.R.; Tran, H.M.; Doumen, J.M.; Etalle, Sandro; Hartel, Pieter H.; den Hartog, Jeremy

    Community decisions about access control in virtual communities are non-monotonic in nature. This means that they cannot be expressed in current, monotonic trust management languages such as the family of Role Based Trust Management languages (RT). To solve this problem we propose RTo, which adds a

  12. A network of networks model to study phase synchronization using structural connection matrix of human brain

    Science.gov (United States)

    Ferrari, F. A. S.; Viana, R. L.; Reis, A. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.

    2018-04-01

    The cerebral cortex plays a key role in complex cortical functions. It can be divided into areas according to their function (motor, sensory and association areas). In this paper, the cerebral cortex is described as a network of networks (cortex network), we consider that each cortical area is composed of a network with small-world property (cortical network). The neurons are assumed to have bursting properties with the dynamics described by the Rulkov model. We study the phase synchronization of the cortex network and the cortical networks. In our simulations, we verify that synchronization in cortex network is not homogeneous. Besides, we focus on the suppression of neural phase synchronization. Synchronization can be related to undesired and pathological abnormal rhythms in the brain. For this reason, we consider the delayed feedback control to suppress the synchronization. We show that delayed feedback control is efficient to suppress synchronous behavior in our network model when an appropriate signal intensity and time delay are defined.

  13. Spectral properties of the temporal evolution of brain network structure.

    Science.gov (United States)

    Wang, Rong; Zhang, Zhen-Zhen; Ma, Jun; Yang, Yong; Lin, Pan; Wu, Ying

    2015-12-01

    The temporal evolution properties of the brain network are crucial for complex brain processes. In this paper, we investigate the differences in the dynamic brain network during resting and visual stimulation states in a task-positive subnetwork, task-negative subnetwork, and whole-brain network. The dynamic brain network is first constructed from human functional magnetic resonance imaging data based on the sliding window method, and then the eigenvalues corresponding to the network are calculated. We use eigenvalue analysis to analyze the global properties of eigenvalues and the random matrix theory (RMT) method to measure the local properties. For global properties, the shifting of the eigenvalue distribution and the decrease in the largest eigenvalue are linked to visual stimulation in all networks. For local properties, the short-range correlation in eigenvalues as measured by the nearest neighbor spacing distribution is not always sensitive to visual stimulation. However, the long-range correlation in eigenvalues as evaluated by spectral rigidity and number variance not only predicts the universal behavior of the dynamic brain network but also suggests non-consistent changes in different networks. These results demonstrate that the dynamic brain network is more random for the task-positive subnetwork and whole-brain network under visual stimulation but is more regular for the task-negative subnetwork. Our findings provide deeper insight into the importance of spectral properties in the functional brain network, especially the incomparable role of RMT in revealing the intrinsic properties of complex systems.

  14. Unraveling the disease consequences and mechanisms of modular structure in animal social networks

    Science.gov (United States)

    Sah, Pratha; Leu, Stephan T.; Cross, Paul C.; Hudson, Peter J.; Bansal, Shweta

    2017-01-01

    Disease risk is a potential cost of group living. Although modular organization is thought to reduce this cost in animal societies, empirical evidence toward this hypothesis has been conflicting. We analyzed empirical social networks from 43 animal species to motivate our study of the epidemiological consequences of modular structure in animal societies. From these empirical studies, we identified the features of interaction patterns associated with network modularity and developed a theoretical network model to investigate when and how subdivisions in social networks influence disease dynamics. Contrary to prior work, we found that disease risk is largely unaffected by modular structure, although social networks beyond a modular threshold experience smaller disease burden and longer disease duration. Our results illustrate that the lowering of disease burden in highly modular social networks is driven by two mechanisms of modular organization: network fragmentation and subgroup cohesion. Highly fragmented social networks with cohesive subgroups are able to structurally trap infections within a few subgroups and also cause a structural delay to the spread of disease outbreaks. Finally, we show that network models incorporating modular structure are necessary only when prior knowledge suggests that interactions within the population are highly subdivided. Otherwise, null networks based on basic knowledge about group size and local contact heterogeneity may be sufficient when data-limited estimates of epidemic consequences are necessary. Overall, our work does not support the hypothesis that modular structure universally mitigates the disease impact of group living.

  15. Bayesian exponential random graph modeling of whole-brain structural networks across lifespan

    OpenAIRE

    Sinke, Michel R T; Dijkhuizen, Rick M; Caimo, Alberto; Stam, Cornelis J; Otte, Wim

    2016-01-01

    Descriptive neural network analyses have provided important insights into the organization of structural and functional networks in the human brain. However, these analyses have limitations for inter-subject or between-group comparisons in which network sizes and edge densities may differ, such as in studies on neurodevelopment or brain diseases. Furthermore, descriptive neural network analyses lack an appropriate generic null model and a unifying framework. These issues may be solved with an...

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

  17. Optimal pinnate leaf-like network/matrix structure for enhanced conductive cooling

    International Nuclear Information System (INIS)

    Hu, Liguo; Zhou, Han; Zhu, Hanxing; Fan, Tongxiang; Zhang, Di

    2015-01-01

    Highlights: • We present a pinnate leaf-like network/matrix structure for conductive cooling. • We study the effect of matrix thickness on network conductive cooling performance. • Matrix thickness determines optimal distance between collection channels in network. • We determine the optimal network architecture from a global perspective. • Optimal network greatly reduces the maximum temperature difference in the network. - Abstract: Heat generated in electronic devices has to be effectively removed because excessive temperature strongly impairs their performance and reliability. Embedding a high thermal conductivity network into an electronic device is an effective method to conduct the generated heat to the outside. In this study, inspired by the pinnate leaf, we present a pinnate leaf-like network embedded in the matrix (i.e., electronic device) to cool the matrix by conduction and develop a method to construct the optimal network. In this method, we first investigate the effect of the matrix thickness on the conductive cooling performance of the network, and then optimize the network architecture from a global perspective so that to minimize the maximum temperature difference between the heat sink and the matrix. The results indicate that the matrix thickness determines the optimal distance of the neighboring collection channels in the network, which minimizes the maximum temperature difference between the matrix and the network, and that the optimal network greatly reduces the maximum temperature difference in the network. The results can serve as a design guide for efficient conductive cooling of electronic devices

  18. The scaling structure of the global road network.

    Science.gov (United States)

    Strano, Emanuele; Giometto, Andrea; Shai, Saray; Bertuzzo, Enrico; Mucha, Peter J; Rinaldo, Andrea

    2017-10-01

    Because of increasing global urbanization and its immediate consequences, including changes in patterns of food demand, circulation and land use, the next century will witness a major increase in the extent of paved roads built worldwide. To model the effects of this increase, it is crucial to understand whether possible self-organized patterns are inherent in the global road network structure. Here, we use the largest updated database comprising all major roads on the Earth, together with global urban and cropland inventories, to suggest that road length distributions within croplands are indistinguishable from urban ones, once rescaled to account for the difference in mean road length. Such similarity extends to road length distributions within urban or agricultural domains of a given area. We find two distinct regimes for the scaling of the mean road length with the associated area, holding in general at small and at large values of the latter. In suitably large urban and cropland domains, we find that mean and total road lengths increase linearly with their domain area, differently from earlier suggestions. Scaling regimes suggest that simple and universal mechanisms regulate urban and cropland road expansion at the global scale. As such, our findings bear implications for global road infrastructure growth based on land-use change and for planning policies sustaining urban expansions.

  19. Nafion–clay hybrids with a network structure

    KAUST Repository

    Burgaz, Engin; Lian, Huiqin; Alonso, Rafael Herrera; Estevez, Luis; Kelarakis, Antonios; Giannelis, Emmanuel P.

    2009-01-01

    Nafion-clay hybrid membranes with a unique microstructure were synthesized using a fundamentally new approach. The new approach is based on depletion aggregation of suspended particles - a well-known phenomenon in colloids. For certain concentrations of clay and polymer, addition of Nafion solution to clay suspensions in water leads to a gel. Using Cryo-TEM we show that the clay particles in the hybrid gels form a network structure with an average cell size in the order of 500 nm. The hybrid gels are subsequently cast to produce hybrid Nafion-clay membranes. Compared to pure Nafion the swelling of the hybrid membranes in water and methanol is dramatically reduced while their selectivity (ratio of conductivity over permeability) increases. The small decrease of ionic conductivity for the hybrid membranes is more than compensated by the large decrease in methanol permeability. Lastly the hybrid membranes are much stiffer and can withstand higher temperatures compared to pure Nafion. Both of these characteristics are highly desirable for use in fuel cell applications, since a) they will allow the use of a thinner membrane circumventing problems associated with the membrane resistance and b) enable high temperature applications. © 2009 Elsevier Ltd. All rights reserved.

  20. Nafion–clay hybrids with a network structure

    KAUST Repository

    Burgaz, Engin

    2009-05-01

    Nafion-clay hybrid membranes with a unique microstructure were synthesized using a fundamentally new approach. The new approach is based on depletion aggregation of suspended particles - a well-known phenomenon in colloids. For certain concentrations of clay and polymer, addition of Nafion solution to clay suspensions in water leads to a gel. Using Cryo-TEM we show that the clay particles in the hybrid gels form a network structure with an average cell size in the order of 500 nm. The hybrid gels are subsequently cast to produce hybrid Nafion-clay membranes. Compared to pure Nafion the swelling of the hybrid membranes in water and methanol is dramatically reduced while their selectivity (ratio of conductivity over permeability) increases. The small decrease of ionic conductivity for the hybrid membranes is more than compensated by the large decrease in methanol permeability. Lastly the hybrid membranes are much stiffer and can withstand higher temperatures compared to pure Nafion. Both of these characteristics are highly desirable for use in fuel cell applications, since a) they will allow the use of a thinner membrane circumventing problems associated with the membrane resistance and b) enable high temperature applications. © 2009 Elsevier Ltd. All rights reserved.