Multi-Sensor Detection with Particle Swarm Optimization for Time-Frequency Coded Cooperative WSNs Based on MC-CDMA for Underground Coal Mines.

PubMed

Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao

2015-08-27

In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization.

Unconstrained handwritten numeral recognition based on radial basis competitive and cooperative networks with spatio-temporal feature representation.

PubMed

Lee, S; Pan, J J

1996-01-01

This paper presents a new approach to representation and recognition of handwritten numerals. The approach first transforms a two-dimensional (2-D) spatial representation of a numeral into a three-dimensional (3-D) spatio-temporal representation by identifying the tracing sequence based on a set of heuristic rules acting as transformation operators. A multiresolution critical-point segmentation method is then proposed to extract local feature points, at varying degrees of scale and coarseness. A new neural network architecture, referred to as radial-basis competitive and cooperative network (RCCN), is presented especially for handwritten numeral recognition. RCCN is a globally competitive and locally cooperative network with the capability of self-organizing hidden units to progressively achieve desired network performance, and functions as a universal approximator of arbitrary input-output mappings. Three types of RCCNs are explored: input-space RCCN (IRCCN), output-space RCCN (ORCCN), and bidirectional RCCN (BRCCN). Experiments against handwritten zip code numerals acquired by the U.S. Postal Service indicated that the proposed method is robust in terms of variations, deformations, transformations, and corruption, achieving about 97% recognition rate.

Downlink Cooperative Broadcast Transmission Based on Superposition Coding in a Relaying System for Future Wireless Sensor Networks.

PubMed

Liu, Yang; Han, Guangjie; Shi, Sulong; Li, Zhengquan

2018-06-20

This study investigates the superiority of cooperative broadcast transmission over traditional orthogonal schemes when applied in a downlink relaying broadcast channel (RBC). Two proposed cooperative broadcast transmission protocols, one with an amplify-and-forward (AF) relay, and the other with a repetition-based decode-and-forward (DF) relay, are investigated. By utilizing superposition coding (SupC), the source and the relay transmit the private user messages simultaneously instead of sequentially as in traditional orthogonal schemes, which means the channel resources are reused and an increased channel degree of freedom is available to each user, hence the half-duplex penalty of relaying is alleviated. To facilitate a performance evaluation, theoretical outage probability expressions of the two broadcast transmission schemes are developed, based on which, we investigate the minimum total power consumption of each scheme for a given traffic requirement by numerical simulation. The results provide details on the overall system performance and fruitful insights on the essential characteristics of cooperative broadcast transmission in RBCs. It is observed that better overall outage performances and considerable power gains can be obtained by utilizing cooperative broadcast transmissions compared to traditional orthogonal schemes.

Design and Simulation of Material-Integrated Distributed Sensor Processing with a Code-Based Agent Platform and Mobile Multi-Agent Systems

PubMed Central

Bosse, Stefan

2015-01-01

Multi-agent systems (MAS) can be used for decentralized and self-organizing data processing in a distributed system, like a resource-constrained sensor network, enabling distributed information extraction, for example, based on pattern recognition and self-organization, by decomposing complex tasks in simpler cooperative agents. Reliable MAS-based data processing approaches can aid the material-integration of structural-monitoring applications, with agent processing platforms scaled to the microchip level. The agent behavior, based on a dynamic activity-transition graph (ATG) model, is implemented with program code storing the control and the data state of an agent, which is novel. The program code can be modified by the agent itself using code morphing techniques and is capable of migrating in the network between nodes. The program code is a self-contained unit (a container) and embeds the agent data, the initialization instructions and the ATG behavior implementation. The microchip agent processing platform used for the execution of the agent code is a standalone multi-core stack machine with a zero-operand instruction format, leading to a small-sized agent program code, low system complexity and high system performance. The agent processing is token-queue-based, similar to Petri-nets. The agent platform can be implemented in software, too, offering compatibility at the operational and code level, supporting agent processing in strong heterogeneous networks. In this work, the agent platform embedded in a large-scale distributed sensor network is simulated at the architectural level by using agent-based simulation techniques. PMID:25690550

Design and simulation of material-integrated distributed sensor processing with a code-based agent platform and mobile multi-agent systems.

PubMed

Bosse, Stefan

2015-02-16

Multi-agent systems (MAS) can be used for decentralized and self-organizing data processing in a distributed system, like a resource-constrained sensor network, enabling distributed information extraction, for example, based on pattern recognition and self-organization, by decomposing complex tasks in simpler cooperative agents. Reliable MAS-based data processing approaches can aid the material-integration of structural-monitoring applications, with agent processing platforms scaled to the microchip level. The agent behavior, based on a dynamic activity-transition graph (ATG) model, is implemented with program code storing the control and the data state of an agent, which is novel. The program code can be modified by the agent itself using code morphing techniques and is capable of migrating in the network between nodes. The program code is a self-contained unit (a container) and embeds the agent data, the initialization instructions and the ATG behavior implementation. The microchip agent processing platform used for the execution of the agent code is a standalone multi-core stack machine with a zero-operand instruction format, leading to a small-sized agent program code, low system complexity and high system performance. The agent processing is token-queue-based, similar to Petri-nets. The agent platform can be implemented in software, too, offering compatibility at the operational and code level, supporting agent processing in strong heterogeneous networks. In this work, the agent platform embedded in a large-scale distributed sensor network is simulated at the architectural level by using agent-based simulation techniques.

Joint design of QC-LDPC codes for coded cooperation system with joint iterative decoding

NASA Astrophysics Data System (ADS)

Zhang, Shunwai; Yang, Fengfan; Tang, Lei; Ejaz, Saqib; Luo, Lin; Maharaj, B. T.

2016-03-01

In this paper, we investigate joint design of quasi-cyclic low-density-parity-check (QC-LDPC) codes for coded cooperation system with joint iterative decoding in the destination. First, QC-LDPC codes based on the base matrix and exponent matrix are introduced, and then we describe two types of girth-4 cycles in QC-LDPC codes employed by the source and relay. In the equivalent parity-check matrix corresponding to the jointly designed QC-LDPC codes employed by the source and relay, all girth-4 cycles including both type I and type II are cancelled. Theoretical analysis and numerical simulations show that the jointly designed QC-LDPC coded cooperation well combines cooperation gain and channel coding gain, and outperforms the coded non-cooperation under the same conditions. Furthermore, the bit error rate performance of the coded cooperation employing jointly designed QC-LDPC codes is better than those of random LDPC codes and separately designed QC-LDPC codes over AWGN channels.

An Integrated Testbed for Cooperative Perception with Heterogeneous Mobile and Static Sensors

PubMed Central

Jiménez-González, Adrián; Martínez-De Dios, José Ramiro; Ollero, Aníbal

2011-01-01

Cooperation among devices with different sensing, computing and communication capabilities provides interesting possibilities in a growing number of problems and applications including domotics (domestic robotics), environmental monitoring or intelligent cities, among others. Despite the increasing interest in academic and industrial communities, experimental tools for evaluation and comparison of cooperative algorithms for such heterogeneous technologies are still very scarce. This paper presents a remote testbed with mobile robots and Wireless Sensor Networks (WSN) equipped with a set of low-cost off-the-shelf sensors, commonly used in cooperative perception research and applications, that present high degree of heterogeneity in their technology, sensed magnitudes, features, output bandwidth, interfaces and power consumption, among others. Its open and modular architecture allows tight integration and interoperability between mobile robots and WSN through a bidirectional protocol that enables full interaction. Moreover, the integration of standard tools and interfaces increases usability, allowing an easy extension to new hardware and software components and the reuse of code. Different levels of decentralization are considered, supporting from totally distributed to centralized approaches. Developed for the EU-funded Cooperating Objects Network of Excellence (CONET) and currently available at the School of Engineering of Seville (Spain), the testbed provides full remote control through the Internet. Numerous experiments have been performed, some of which are described in the paper. PMID:22247679

An integrated testbed for cooperative perception with heterogeneous mobile and static sensors.

PubMed

Jiménez-González, Adrián; Martínez-De Dios, José Ramiro; Ollero, Aníbal

2011-01-01

Cooperation among devices with different sensing, computing and communication capabilities provides interesting possibilities in a growing number of problems and applications including domotics (domestic robotics), environmental monitoring or intelligent cities, among others. Despite the increasing interest in academic and industrial communities, experimental tools for evaluation and comparison of cooperative algorithms for such heterogeneous technologies are still very scarce. This paper presents a remote testbed with mobile robots and Wireless Sensor Networks (WSN) equipped with a set of low-cost off-the-shelf sensors, commonly used in cooperative perception research and applications, that present high degree of heterogeneity in their technology, sensed magnitudes, features, output bandwidth, interfaces and power consumption, among others. Its open and modular architecture allows tight integration and interoperability between mobile robots and WSN through a bidirectional protocol that enables full interaction. Moreover, the integration of standard tools and interfaces increases usability, allowing an easy extension to new hardware and software components and the reuse of code. Different levels of decentralization are considered, supporting from totally distributed to centralized approaches. Developed for the EU-funded Cooperating Objects Network of Excellence (CONET) and currently available at the School of Engineering of Seville (Spain), the testbed provides full remote control through the Internet. Numerous experiments have been performed, some of which are described in the paper.

Case Study Analysis of Trust and Commitment Between the Civil Engineering Commodity Council and the Civil Engineering Career Field

DTIC Science & Technology

2013-03-01

Factors influencing success ..................................................................................... 61 Antecedents of Trust ...were organized in a network that proposed which factors influence trust development between organizations. A sample list of codes and associated...perspective of trust as having a positive influence on commitment and cooperation towards an organization. Examples of factors that may influence the

Distributed polar-coded OFDM based on Plotkin's construction for half duplex wireless communication

NASA Astrophysics Data System (ADS)

Umar, Rahim; Yang, Fengfan; Mughal, Shoaib; Xu, HongJun

2018-07-01

A Plotkin-based polar-coded orthogonal frequency division multiplexing (P-PC-OFDM) scheme is proposed and its bit error rate (BER) performance over additive white gaussian noise (AWGN), frequency selective Rayleigh, Rician and Nakagami-m fading channels has been evaluated. The considered Plotkin's construction possesses a parallel split in its structure, which motivated us to extend the proposed P-PC-OFDM scheme in a coded cooperative scenario. As the relay's effective collaboration has always been pivotal in the design of cooperative communication therefore, an efficient selection criterion for choosing the information bits has been inculcated at the relay node. To assess the BER performance of the proposed cooperative scheme, we have also upgraded conventional polar-coded cooperative scheme in the context of OFDM as an appropriate bench marker. The Monte Carlo simulated results revealed that the proposed Plotkin-based polar-coded cooperative OFDM scheme convincingly outperforms the conventional polar-coded cooperative OFDM scheme by 0.5 0.6 dBs over AWGN channel. This prominent gain in BER performance is made possible due to the bit-selection criteria and the joint successive cancellation decoding adopted at the relay and the destination nodes, respectively. Furthermore, the proposed coded cooperative schemes outperform their corresponding non-cooperative schemes by a gain of 1 dB under an identical condition.

Static network structure can stabilize human cooperation.

PubMed

Rand, David G; Nowak, Martin A; Fowler, James H; Christakis, Nicholas A

2014-12-02

The evolution of cooperation in network-structured populations has been a major focus of theoretical work in recent years. When players are embedded in fixed networks, cooperators are more likely to interact with, and benefit from, other cooperators. In theory, this clustering can foster cooperation on fixed networks under certain circumstances. Laboratory experiments with humans, however, have thus far found no evidence that fixed network structure actually promotes cooperation. Here, we provide such evidence and help to explain why others failed to find it. First, we show that static networks can lead to a stable high level of cooperation, outperforming well-mixed populations. We then systematically vary the benefit that cooperating provides to one's neighbors relative to the cost required to cooperate (b/c), as well as the average number of neighbors in the network (k). When b/c > k, we observe high and stable levels of cooperation. Conversely, when b/c ≤ k or players are randomly shuffled, cooperation decays. Our results are consistent with a quantitative evolutionary game theoretic prediction for when cooperation should succeed on networks and, for the first time to our knowledge, provide an experimental demonstration of the power of static network structure for stabilizing human cooperation.

Static network structure can stabilize human cooperation

PubMed Central

Rand, David G.; Nowak, Martin A.; Fowler, James H.; Christakis, Nicholas A.

2014-01-01

The evolution of cooperation in network-structured populations has been a major focus of theoretical work in recent years. When players are embedded in fixed networks, cooperators are more likely to interact with, and benefit from, other cooperators. In theory, this clustering can foster cooperation on fixed networks under certain circumstances. Laboratory experiments with humans, however, have thus far found no evidence that fixed network structure actually promotes cooperation. Here, we provide such evidence and help to explain why others failed to find it. First, we show that static networks can lead to a stable high level of cooperation, outperforming well-mixed populations. We then systematically vary the benefit that cooperating provides to one’s neighbors relative to the cost required to cooperate (b/c), as well as the average number of neighbors in the network (k). When b/c > k, we observe high and stable levels of cooperation. Conversely, when b/c ≤ k or players are randomly shuffled, cooperation decays. Our results are consistent with a quantitative evolutionary game theoretic prediction for when cooperation should succeed on networks and, for the first time to our knowledge, provide an experimental demonstration of the power of static network structure for stabilizing human cooperation. PMID:25404308

Towards Efficient Wireless Body Area Network Using Two-Way Relay Cooperation.

PubMed

Waheed, Maham; Ahmad, Rizwan; Ahmed, Waqas; Drieberg, Micheal; Alam, Muhammad Mahtab

2018-02-13

The fabrication of lightweight, ultra-thin, low power and intelligent body-borne sensors leads to novel advances in wireless body area networks (WBANs). Depending on the placement of the nodes, it is characterized as in/on body WBAN; thus, the channel is largely affected by body posture, clothing, muscle movement, body temperature and climatic conditions. The energy resources are limited and it is not feasible to replace the sensor's battery frequently. In order to keep the sensor in working condition, the channel resources should be reserved. The lifetime of the sensor is very crucial and it highly depends on transmission among sensor nodes and energy consumption. The reliability and energy efficiency in WBAN applications play a vital role. In this paper, the analytical expressions for energy efficiency (EE) and packet error rate (PER) are formulated for two-way relay cooperative communication. The results depict better reliability and efficiency compared to direct and one-way relay communication. The effective performance range of direct vs. cooperative communication is separated by a threshold distance. Based on EE calculations, an optimal packet size is observed that provides maximum efficiency over a certain link length. A smart and energy efficient system is articulated that utilizes all three communication modes, namely direct, one-way relay and two-way relay, as the direct link performs better for a certain range, but the cooperative communication gives better results for increased distance in terms of EE. The efficacy of the proposed hybrid scheme is also demonstrated over a practical quasi-static channel. Furthermore, link length extension and diversity is achieved by joint network-channel (JNC) coding the cooperative link.

Towards Efficient Wireless Body Area Network Using Two-Way Relay Cooperation

PubMed Central

Waheed, Maham; Ahmad, Rizwan; Ahmed, Waqas

2018-01-01

The fabrication of lightweight, ultra-thin, low power and intelligent body-borne sensors leads to novel advances in wireless body area networks (WBANs). Depending on the placement of the nodes, it is characterized as in/on body WBAN; thus, the channel is largely affected by body posture, clothing, muscle movement, body temperature and climatic conditions. The energy resources are limited and it is not feasible to replace the sensor’s battery frequently. In order to keep the sensor in working condition, the channel resources should be reserved. The lifetime of the sensor is very crucial and it highly depends on transmission among sensor nodes and energy consumption. The reliability and energy efficiency in WBAN applications play a vital role. In this paper, the analytical expressions for energy efficiency (EE) and packet error rate (PER) are formulated for two-way relay cooperative communication. The results depict better reliability and efficiency compared to direct and one-way relay communication. The effective performance range of direct vs. cooperative communication is separated by a threshold distance. Based on EE calculations, an optimal packet size is observed that provides maximum efficiency over a certain link length. A smart and energy efficient system is articulated that utilizes all three communication modes, namely direct, one-way relay and two-way relay, as the direct link performs better for a certain range, but the cooperative communication gives better results for increased distance in terms of EE. The efficacy of the proposed hybrid scheme is also demonstrated over a practical quasi-static channel. Furthermore, link length extension and diversity is achieved by joint network-channel (JNC) coding the cooperative link. PMID:29438278

Contagion of Cooperation in Static and Fluid Social Networks.

PubMed

Jordan, Jillian J; Rand, David G; Arbesman, Samuel; Fowler, James H; Christakis, Nicholas A

2013-01-01

Cooperation is essential for successful human societies. Thus, understanding how cooperative and selfish behaviors spread from person to person is a topic of theoretical and practical importance. Previous laboratory experiments provide clear evidence of social contagion in the domain of cooperation, both in fixed networks and in randomly shuffled networks, but leave open the possibility of asymmetries in the spread of cooperative and selfish behaviors. Additionally, many real human interaction structures are dynamic: we often have control over whom we interact with. Dynamic networks may differ importantly in the goals and strategic considerations they promote, and thus the question of how cooperative and selfish behaviors spread in dynamic networks remains open. Here, we address these questions with data from a social dilemma laboratory experiment. We measure the contagion of both cooperative and selfish behavior over time across three different network structures that vary in the extent to which they afford individuals control over their network ties. We find that in relatively fixed networks, both cooperative and selfish behaviors are contagious. In contrast, in more dynamic networks, selfish behavior is contagious, but cooperative behavior is not: subjects are fairly likely to switch to cooperation regardless of the behavior of their neighbors. We hypothesize that this insensitivity to the behavior of neighbors in dynamic networks is the result of subjects' desire to attract new cooperative partners: even if many of one's current neighbors are defectors, it may still make sense to switch to cooperation. We further hypothesize that selfishness remains contagious in dynamic networks because of the well-documented willingness of cooperators to retaliate against selfishness, even when doing so is costly. These results shed light on the contagion of cooperative behavior in fixed and fluid networks, and have implications for influence-based interventions aiming at increasing cooperative behavior.

The narrow gap between norms and cooperative behaviour in a reindeer herding community

PubMed Central

2018-01-01

Cooperation evolves on social networks and is shaped, in part, by norms: beliefs and expectations about the behaviour of others or of oneself. Networks of cooperative social partners and associated norms are vital for pastoralists, such as Saami reindeer herders in northern Norway. However, little is known quantitatively about how norms structure pastoralists' social networks or shape cooperation. Saami herders reported their social networks and participated in field experiments, allowing us to gauge the overlap between reported and emergent cooperation. We show that individuals' perceptions of reciprocal cooperation within their social networks exceeded actual reciprocity, although both occurred frequently and were concentrated within herding groups. Herders with more extensive cooperation networks received more rewards in an economic game. Although herders overestimated reciprocal helping, cooperation in this community was still extensive, suggesting that perceived norms potentially allow network structures promoting cooperation to emerge and be maintained. PMID:29515842

Dynamic social networks promote cooperation in experiments with humans

PubMed Central

Rand, David G.; Arbesman, Samuel; Christakis, Nicholas A.

2011-01-01

Human populations are both highly cooperative and highly organized. Human interactions are not random but rather are structured in social networks. Importantly, ties in these networks often are dynamic, changing in response to the behavior of one's social partners. This dynamic structure permits an important form of conditional action that has been explored theoretically but has received little empirical attention: People can respond to the cooperation and defection of those around them by making or breaking network links. Here, we present experimental evidence of the power of using strategic link formation and dissolution, and the network modification it entails, to stabilize cooperation in sizable groups. Our experiments explore large-scale cooperation, where subjects’ cooperative actions are equally beneficial to all those with whom they interact. Consistent with previous research, we find that cooperation decays over time when social networks are shuffled randomly every round or are fixed across all rounds. We also find that, when networks are dynamic but are updated only infrequently, cooperation again fails. However, when subjects can update their network connections frequently, we see a qualitatively different outcome: Cooperation is maintained at a high level through network rewiring. Subjects preferentially break links with defectors and form new links with cooperators, creating an incentive to cooperate and leading to substantial changes in network structure. Our experiments confirm the predictions of a set of evolutionary game theoretic models and demonstrate the important role that dynamic social networks can play in supporting large-scale human cooperation. PMID:22084103

Emergence of cooperation in non-scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Yichao; Aziz-Alaoui, M. A.; Bertelle, Cyrille; Zhou, Shi; Wang, Wenting

2014-06-01

Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. Previous studies proposed a strategy updating mechanism, which successfully demonstrated that the scale-free network can provide a framework for the emergence of cooperation. Instead, individuals in random graphs and small-world networks do not favor cooperation under this updating rule. However, a recent empirical result shows the heterogeneous networks do not promote cooperation when humans play a prisoner’s dilemma. In this paper, we propose a strategy updating rule with payoff memory. We observe that the random graphs and small-world networks can provide even better frameworks for cooperation than the scale-free networks in this scenario. Our observations suggest that the degree heterogeneity may be neither a sufficient condition nor a necessary condition for the widespread cooperation in complex networks. Also, the topological structures are not sufficed to determine the level of cooperation in complex networks.

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

PubMed

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.

Punishment diminishes the benefits of network reciprocity in social dilemma experiments

PubMed Central

Li, Xuelong; Wang, Zhen; Li, Huijia; Shi, Lei; Podobnik, Boris; Havlin, Shlomo; Boccaletti, Stefano

2018-01-01

Network reciprocity has been widely advertised in theoretical studies as one of the basic cooperation-promoting mechanisms, but experimental evidence favoring this type of reciprocity was published only recently. When organized in an unchanging network of social contacts, human subjects cooperate provided the following strict condition is satisfied: The benefit of cooperation must outweigh the total cost of cooperating with all neighbors. In an attempt to relax this condition, we perform social dilemma experiments wherein network reciprocity is aided with another theoretically hypothesized cooperation-promoting mechanism—costly punishment. The results reveal how networks promote and stabilize cooperation. This stabilizing effect is stronger in a smaller-size neighborhood, as expected from theory and experiments. Contrary to expectations, punishment diminishes the benefits of network reciprocity by lowering assortment, payoff per round, and award for cooperative behavior. This diminishing effect is stronger in a larger-size neighborhood. An immediate implication is that the psychological effects of enduring punishment override the rational response anticipated in quantitative models of cooperation in networks. PMID:29259113

Cooperative Resource Pricing in Service Overlay Networks for Mobile Agents

NASA Astrophysics Data System (ADS)

Nakano, Tadashi; Okaie, Yutaka

The success of peer-to-peer overlay networks depends on cooperation among participating peers. In this paper, we investigate the degree of cooperation among individual peers required to induce globally favorable properties in an overlay network. Specifically, we consider a resource pricing problem in a market-oriented overlay network where participating peers sell own resources (e.g., CPU cycles) to earn energy which represents some money or rewards in the network. In the resource pricing model presented in this paper, each peer sets the price for own resource based on the degree of cooperation; non-cooperative peers attempt to maximize their own energy gains, while cooperative peers maximize the sum of own and neighbors' energy gains. Simulation results are presented to demonstrate that the network topology is an important factor influencing the minimum degree of cooperation required to increase the network-wide global energy gain.

Cooperation in the prisoner's dilemma game on tunable community networks

NASA Astrophysics Data System (ADS)

Liu, Penghui; Liu, Jing

2017-04-01

Community networks have attracted lots of attention as they widely exist in the real world and are essential to study properties of networks. As the game theory illustrates the competitive relationship among individuals, studying the iterated prisoner's dilemma games (PDG) on community networks is meaningful. In this paper, we focus on investigating the relationship between the cooperation level of community networks and that of their communities in the prisoner's dilemma games. With this purpose in mind, a type of tunable community networks whose communities inherit not only the scale-free property, but also the characteristic of adjustable cooperation level of Holme and Kim (HK) networks is designed. Both uniform and non-uniform community networks are investigated. We find out that cooperation enhancement of communities can improve the cooperation level of the whole networks. Moreover, simulation results indicate that a large community is a better choice than a small community to improve the cooperation level of the whole networks. Thus, improving the cooperation level of community networks can be divided into a number of sub-problems targeting at improving the cooperation level of individual communities, which can save the computation cost and deal with the problem of improving the cooperation level of huge community networks. Moreover, as the larger community is a better choice, it is reasonable to start with large communities, according to the greedy strategy when the number of nodes can participate in the enhancement is limited.

Costs for switching partners reduce network dynamics but not cooperative behaviour

PubMed Central

Bednarik, Peter; Fehl, Katrin; Semmann, Dirk

2014-01-01

Social networks represent the structuring of interactions between group members. Above all, many interactions are profoundly cooperative in humans and other animals. In accordance with this natural observation, theoretical work demonstrates that certain network structures favour the evolution of cooperation. Yet, recent experimental evidence suggests that static networks do not enhance cooperative behaviour in humans. By contrast, dynamic networks do foster cooperation. However, costs associated with dynamism such as time or resource investments in finding and establishing new partnerships have been neglected so far. Here, we show that human participants are much less likely to break links when costs arise for building new links. Especially, when costs were high, the network was nearly static. Surprisingly, cooperation levels in Prisoner's Dilemma games were not affected by reduced dynamism in social networks. We conclude that the mere potential to quit collaborations is sufficient in humans to reach high levels of cooperative behaviour. Effects of self-structuring processes or assortment on the network played a minor role: participants simply adjusted their cooperative behaviour in response to the threats of losing a partner or of being expelled. PMID:25122233

Social dilemmas in an online social network: The structure and evolution of cooperation

NASA Astrophysics Data System (ADS)

Fu, Feng; Chen, Xiaojie; Liu, Lianghuan; Wang, Long

2007-11-01

We investigate two paradigms for studying the evolution of cooperation—Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society.

Promotion of cooperation induced by two-sided players in prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Su, Zhen; Li, Lixiang; Xiao, Jinghua; Podobnik, B.; Stanley, H. Eugene

2018-01-01

We examine how real-world individuals and companies can either reach an agreement or fail to reach an agreement after several stages of negotiation. We use a modified prisoner's dilemma game with two-sided players who can either cooperate or not cooperate with their neighbors. We find that the presence of even a small number of these two-sided players substantially promotes the cooperation because, unlike the rock-paper-scissors scenario, when the cooperators change to the non-cooperators to gain a payoff, they can turn to the two-sided players and continue negotiating. We find that the network structure influences the spread of strategies. Lattice and regular-random (RR) networks benefit the spread of both non-cooperation and two-sided strategies, but scale-free (SF) networks stop both strategies. We also find that the Erdös-R e ´ nyi (ER) network promotes the two-sided strategy and blocks the spread of non-cooperation. As the ER network density decreases, and the network degree is lowered the lifetime of non-cooperators increases. Our results expand our understanding of the role played by the two-sided strategy in the growth of the cooperative behavior in networks.

Punishment diminishes the benefits of network reciprocity in social dilemma experiments.

PubMed

Li, Xuelong; Jusup, Marko; Wang, Zhen; Li, Huijia; Shi, Lei; Podobnik, Boris; Stanley, H Eugene; Havlin, Shlomo; Boccaletti, Stefano

2018-01-02

Network reciprocity has been widely advertised in theoretical studies as one of the basic cooperation-promoting mechanisms, but experimental evidence favoring this type of reciprocity was published only recently. When organized in an unchanging network of social contacts, human subjects cooperate provided the following strict condition is satisfied: The benefit of cooperation must outweigh the total cost of cooperating with all neighbors. In an attempt to relax this condition, we perform social dilemma experiments wherein network reciprocity is aided with another theoretically hypothesized cooperation-promoting mechanism-costly punishment. The results reveal how networks promote and stabilize cooperation. This stabilizing effect is stronger in a smaller-size neighborhood, as expected from theory and experiments. Contrary to expectations, punishment diminishes the benefits of network reciprocity by lowering assortment, payoff per round, and award for cooperative behavior. This diminishing effect is stronger in a larger-size neighborhood. An immediate implication is that the psychological effects of enduring punishment override the rational response anticipated in quantitative models of cooperation in networks. Copyright © 2017 the Author(s). Published by PNAS.

How mutation alters the evolutionary dynamics of cooperation on networks

NASA Astrophysics Data System (ADS)

Ichinose, Genki; Satotani, Yoshiki; Sayama, Hiroki

2018-05-01

Cooperation is ubiquitous at every level of living organisms. It is known that spatial (network) structure is a viable mechanism for cooperation to evolve. A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space. However, stochastic mutation of strategies was not considered in the analysis of AGoS. Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks. We show that our extended AGoS correctly visualizes the final states of cooperation with mutation in the individual-based simulations. Our analyses revealed that mutation always has a negative effect on the evolution of cooperation regardless of the payoff functions, fraction of cooperators, and network structures. Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.

Cooperative Learning for Distributed In-Network Traffic Classification

NASA Astrophysics Data System (ADS)

Joseph, S. B.; Loo, H. R.; Ismail, I.; Andromeda, T.; Marsono, M. N.

2017-04-01

Inspired by the concept of autonomic distributed/decentralized network management schemes, we consider the issue of information exchange among distributed network nodes to network performance and promote scalability for in-network monitoring. In this paper, we propose a cooperative learning algorithm for propagation and synchronization of network information among autonomic distributed network nodes for online traffic classification. The results show that network nodes with sharing capability perform better with a higher average accuracy of 89.21% (sharing data) and 88.37% (sharing clusters) compared to 88.06% for nodes without cooperative learning capability. The overall performance indicates that cooperative learning is promising for distributed in-network traffic classification.

The evolution of cooperation on geographical networks

NASA Astrophysics Data System (ADS)

Li, Yixiao; Wang, Yi; Sheng, Jichuan

2017-11-01

We study evolutionary public goods game on geographical networks, i.e., complex networks which are located on a geographical plane. The geographical feature effects in two ways: In one way, the geographically-induced network structure influences the overall evolutionary dynamics, and, in the other way, the geographical length of an edge influences the cost when the two players at the two ends interact. For the latter effect, we design a new cost function of cooperators, which simply assumes that the longer the distance between two players, the higher cost the cooperator(s) of them have to pay. In this study, network substrates are generated by a previous spatial network model with a cost-benefit parameter controlling the network topology. Our simulations show that the greatest promotion of cooperation is achieved in the intermediate regime of the parameter, in which empirical estimates of various railway networks fall. Further, we investigate how the distribution of edges' geographical costs influences the evolutionary dynamics and consider three patterns of the distribution: an approximately-equal distribution, a diverse distribution, and a polarized distribution. For normal geographical networks which are generated using intermediate values of the cost-benefit parameter, a diverse distribution hinders the evolution of cooperation, whereas a polarized distribution lowers the threshold value of the amplification factor for cooperation in public goods game. These results are helpful for understanding the evolution of cooperation on real-world geographical networks.

An Effect of the Co-Operative Network Model for Students' Quality in Thai Primary Schools

ERIC Educational Resources Information Center

Khanthaphum, Udomsin; Tesaputa, Kowat; Weangsamoot, Visoot

2016-01-01

This research aimed: 1) to study the current and desirable states of the co-operative network in developing the learners' quality in Thai primary schools, 2) to develop a model of the co-operative network in developing the learners' quality, and 3) to examine the results of implementation of the co-operative network model in the primary school.…

A Verification Method of Inter-Task Cooperation in Embedded Real-time Systems and its Evaluation

NASA Astrophysics Data System (ADS)

Yoshida, Toshio

In software development process of embedded real-time systems, the design of the task cooperation process is very important. The cooperating process of such tasks is specified by task cooperation patterns. Adoption of unsuitable task cooperation patterns has fatal influence on system performance, quality, and extendibility. In order to prevent repetitive work caused by the shortage of task cooperation performance, it is necessary to verify task cooperation patterns in an early software development stage. However, it is very difficult to verify task cooperation patterns in an early software developing stage where task program codes are not completed yet. Therefore, we propose a verification method using task skeleton program codes and a real-time kernel that has a function of recording all events during software execution such as system calls issued by task program codes, external interrupts, and timer interrupt. In order to evaluate the proposed verification method, we applied it to the software development process of a mechatronics control system.

Database of Industrial Technological Information in Kanagawa : Networks for Technology Activities

NASA Astrophysics Data System (ADS)

Saito, Akira; Shindo, Tadashi

This system is one of the databases which require participation by its members and of which premise is to open all the data in it. Aiming at free technological cooperation and exchange among industries it was constructed by Kanagawa Prefecture in collaboration with enterprises located in it. The input data is 36 items such as major product, special and advantageous technology, technolagy to be wanted for cooperation, facility and equipment, which technologically characterize each enterprise. They are expressed in 2,000 characters and written by natural language including Kanji except for some coded items. 24 search items are accessed by natural language so that in addition to interactive searching procedures including menu-type it enables extensive searching. The information service started in Oct., 1986 covering data from 2,000 enterprisen.

Motif structure and cooperation in real-world complex networks

NASA Astrophysics Data System (ADS)

Salehi, Mostafa; Rabiee, Hamid R.; Jalili, Mahdi

2010-12-01

Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties.

Social networks and cooperation in hunter-gatherers.

PubMed

Apicella, Coren L; Marlowe, Frank W; Fowler, James H; Christakis, Nicholas A

2012-01-25

Social networks show striking structural regularities, and both theory and evidence suggest that networks may have facilitated the development of large-scale cooperation in humans. Here, we characterize the social networks of the Hadza, a population of hunter-gatherers in Tanzania. We show that Hadza networks have important properties also seen in modernized social networks, including a skewed degree distribution, degree assortativity, transitivity, reciprocity, geographic decay and homophily. We demonstrate that Hadza camps exhibit high between-group and low within-group variation in public goods game donations. Network ties are also more likely between people who give the same amount, and the similarity in cooperative behaviour extends up to two degrees of separation. Social distance appears to be as important as genetic relatedness and physical proximity in explaining assortativity in cooperation. Our results suggest that certain elements of social network structure may have been present at an early point in human history. Also, early humans may have formed ties with both kin and non-kin, based in part on their tendency to cooperate. Social networks may thus have contributed to the emergence of cooperation.

The maintenance of cooperation in multiplex networks with limited and partible resources of agents

NASA Astrophysics Data System (ADS)

Li, Zhaofeng; Shen, Bi; Jiang, Yichuan

2017-02-01

In this paper, we try to explain the maintenance of cooperation in multiplex networks with limited and partible resources of agents: defection brings larger short-term benefit and cooperative agents may become defective because of the unaffordable costs of cooperative behaviors that are performed in multiple layers simultaneously. Recent studies have identified the positive effects of multiple layers on evolutionary cooperation but generally overlook the maximum costs of agents in these synchronous games. By utilizing network effects and designing evolutionary mechanisms, cooperative behaviors become prevailing in public goods games, and agents can allocate personal resources across multiple layers. First, we generalize degree diversity into multiplex networks to improve the prospect for cooperation. Second, to prevent agents allocating all the resources into one layer, a greedy-first mechanism is proposed, in which agents prefer to add additional investments in the higher-payoff layer. It is found that greedy-first agents can perform cooperative behaviors in multiplex networks when one layer is scale-free network and degree differences between conjoint nodes increase. Our work may help to explain the emergence of cooperation in the absence of individual reputation and punishment mechanisms.

SISL and SIRL: Two knowledge dissemination models with leader nodes on cooperative learning networks

NASA Astrophysics Data System (ADS)

Li, Jingjing; Zhang, Yumei; Man, Jiayu; Zhou, Yun; Wu, Xiaojun

2017-02-01

Cooperative learning is one of the most effective teaching methods, which has been widely used. Students' mutual contact forms a cooperative learning network in this process. Our previous research demonstrated that the cooperative learning network has complex characteristics. This study aims to investigating the dynamic spreading process of the knowledge in the cooperative learning network and the inspiration of leaders in this process. To this end, complex network transmission dynamics theory is utilized to construct the knowledge dissemination model of a cooperative learning network. Based on the existing epidemic models, we propose a new susceptible-infected-susceptible-leader (SISL) model that considers both students' forgetting and leaders' inspiration, and a susceptible-infected-removed-leader (SIRL) model that considers students' interest in spreading and leaders' inspiration. The spreading threshold λcand its impact factors are analyzed. Then, numerical simulation and analysis are delivered to reveal the dynamic transmission mechanism of knowledge and leaders' role. This work is of great significance to cooperative learning theory and teaching practice. It also enriches the theory of complex network transmission dynamics.

Network flow of mobile agents enhances the evolution of cooperation

NASA Astrophysics Data System (ADS)

Ichinose, G.; Satotani, Y.; Nagatani, T.

2018-01-01

We study the effect of contingent movement on the persistence of cooperation on complex networks with empty nodes. Each agent plays the Prisoner's Dilemma game with its neighbors and then it either updates the strategy depending on the payoff difference with neighbors or it moves to another empty node if not satisfied with its own payoff. If no neighboring node is empty, each agent stays at the same site. By extensive evolutionary simulations, we show that the medium density of agents enhances cooperation where the network flow of mobile agents is also medium. Moreover, if the movements of agents are more frequent than the strategy updating, cooperation is further promoted. In scale-free networks, the optimal density for cooperation is lower than other networks because agents get stuck at hubs. Our study suggests that keeping a smooth network flow is significant for the persistence of cooperation in ever-changing societies.

Cooperation and Contagion in Web-Based, Networked Public Goods Experiments

PubMed Central

Suri, Siddharth; Watts, Duncan J.

2011-01-01

A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs. PMID:21412431

Cooperation and contagion in web-based, networked public goods experiments.

PubMed

Suri, Siddharth; Watts, Duncan J

2011-03-11

A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs.

50 CFR 679.62 - Inshore sector cooperative allocation program.

Code of Federal Regulations, 2011 CFR

2011-10-01

... harvested by a vessel under contract to a cooperative must report the delivery to NMFS on the electronic delivery report by using the co-op code for the contracting cooperative rather than the co-op code of the... following information must be included on a contract fishing application: (i) Co-op name(s). The names of...

50 CFR 679.62 - Inshore sector cooperative allocation program.

Code of Federal Regulations, 2010 CFR

2010-10-01

... harvested by a vessel under contract to a cooperative must report the delivery to NMFS on the electronic delivery report by using the co-op code for the contracting cooperative rather than the co-op code of the... following information must be included on a contract fishing application: (i) Co-op name(s). The names of...

Determinants of public cooperation in multiplex networks

NASA Astrophysics Data System (ADS)

Battiston, Federico; Perc, Matjaž; Latora, Vito

2017-07-01

Synergies between evolutionary game theory and statistical physics have significantly improved our understanding of public cooperation in structured populations. Multiplex networks, in particular, provide the theoretical framework within network science that allows us to mathematically describe the rich structure of interactions characterizing human societies. While research has shown that multiplex networks may enhance the resilience of cooperation, the interplay between the overlap in the structure of the layers and the control parameters of the corresponding games has not yet been investigated. With this aim, we consider here the public goods game on a multiplex network, and we unveil the role of the number of layers and the overlap of links, as well as the impact of different synergy factors in different layers, on the onset of cooperation. We show that enhanced public cooperation emerges only when a significant edge overlap is combined with at least one layer being able to sustain some cooperation by means of a sufficiently high synergy factor. In the absence of either of these conditions, the evolution of cooperation in multiplex networks is determined by the bounds of traditional network reciprocity with no enhanced resilience. These results caution against overly optimistic predictions that the presence of multiple social domains may in itself promote cooperation, and they help us better understand the complexity behind prosocial behavior in layered social systems.

Cooperation in N-person evolutionary snowdrift game in scale-free Barabási Albert networks

NASA Astrophysics Data System (ADS)

Lee, K. H.; Chan, Chun-Him; Hui, P. M.; Zheng, Da-Fang

2008-09-01

Cooperation in the N-person evolutionary snowdrift game (NESG) is studied in scale-free Barabási-Albert (BA) networks. Due to the inhomogeneity of the network, two versions of NESG are proposed and studied. In a model where the size of the competing group varies from agent to agent, the fraction of cooperators drops as a function of the payoff parameter. The networking effect is studied via the fraction of cooperative agents for nodes with a particular degree. For small payoff parameters, it is found that the small- k agents are dominantly cooperators, while large- k agents are of non-cooperators. Studying the spatial correlation reveals that cooperative agents will avoid to be nearest neighbors and the correlation disappears beyond the next-nearest neighbors. The behavior can be explained in terms of the networking effect and payoffs. In another model with a fixed size of competing groups, the fraction of cooperators could show a non-monotonic behavior in the regime of small payoff parameters. This non-trivial behavior is found to be a combined effect of the many agents with the smallest degree in the BA network and the increasing fraction of cooperators among these agents with the payoff for small payoffs.

Learning and innovative elements of strategy adoption rules expand cooperative network topologies.

PubMed

Wang, Shijun; Szalay, Máté S; Zhang, Changshui; Csermely, Peter

2008-04-09

Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular network models in repeated, multi-agent Prisoner's Dilemma and Hawk-Dove games. Furthermore, we found that using the above model systems other long-term learning strategy adoption rules also promote cooperation, while introducing a low level of noise (as a model of innovation) to the strategy adoption rules makes the level of cooperation less dependent on the actual network topology. Our results demonstrate that long-term learning and random elements in the strategy adoption rules, when acting together, extend the range of network topologies enabling the development of cooperation at a wider range of costs and temptations. These results suggest that a balanced duo of learning and innovation may help to preserve cooperation during the re-organization of real-world networks, and may play a prominent role in the evolution of self-organizing, complex systems.

Sparse cliques trump scale-free networks in coordination and competition

PubMed Central

Gianetto, David A.; Heydari, Babak

2016-01-01

Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game. PMID:26899456

Sparse cliques trump scale-free networks in coordination and competition

NASA Astrophysics Data System (ADS)

Gianetto, David A.; Heydari, Babak

2016-02-01

Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game.

Axelrod's Metanorm Games on Networks

PubMed Central

Galán, José M.; Łatek, Maciej M.; Rizi, Seyed M. Mussavi

2011-01-01

Metanorms is a mechanism proposed to promote cooperation in social dilemmas. Recent experimental results show that network structures that underlie social interactions influence the emergence of norms that promote cooperation. We generalize Axelrod's analysis of metanorms dynamics to interactions unfolding on networks through simulation and mathematical modeling. Network topology strongly influences the effectiveness of the metanorms mechanism in establishing cooperation. In particular, we find that average degree, clustering coefficient and the average number of triplets per node play key roles in sustaining or collapsing cooperation. PMID:21655211

Relay Selection for Cooperative Relaying in Wireless Energy Harvesting Networks

NASA Astrophysics Data System (ADS)

Zhu, Kaiyan; Wang, Fei; Li, Songsong; Jiang, Fengjiao; Cao, Lijie

2018-01-01

Energy harvesting from the surroundings is a promising solution to provide energy supply and extend the life of wireless sensor networks. Recently, energy harvesting has been shown as an attractive solution to prolong the operation of cooperative networks. In this paper, we propose a relay selection scheme to optimize the amplify-and-forward (AF) cooperative transmission in wireless energy harvesting cooperative networks. The harvesting energy and channel conditions are considered to select the optimal relay as cooperative relay to minimize the outage probability of the system. Simulation results show that our proposed relay selection scheme achieves better outage performance than other strategies.

Social Networks and Cooperation in Hunter-Gatherers

PubMed Central

Apicella, Coren L.; Marlowe, Frank W.; Fowler, James H.; Christakis, Nicholas A.

2011-01-01

Social networks exhibit striking structural regularities1,2, and theory and evidence suggest that they may have played a role in the development of large-scale cooperation in humans3–7. Here, we characterize the social networks of the Hadza, an evolutionarily relevant population of hunter-gatherers8. We show that Hadza networks exhibit important properties also seen in modernized networks, including a skewed degree distribution, degree assortativity, transitivity, reciprocity, geographic decay, and homophily. Moreover, we demonstrate that Hadza camps exhibit high between-group and low within-group variation in public goods game donations. Network ties are also more likely between people who give the same amount, and the similarity in cooperative behaviour extends up to two degrees of separation. Finally, social distance appears to be as important as genetic relatedness and physical proximity in explaining assortativity in cooperation. Our results suggest that certain elements of social network structure may have been present at an early point in human history; that early humans may have formed ties with both kin and non-kin based, in part, on their tendency to cooperate; and that social networks may have contributed to the emergence of cooperation. PMID:22281599

Cooperative Vehicular Networking: A Survey

PubMed Central

Ahmed, Ejaz

2018-01-01

With the remarkable progress of cooperative communication technology in recent years, its transformation to vehicular networking is gaining momentum. Such a transformation has brought a new research challenge in facing the realization of cooperative vehicular networking (CVN). This paper presents a comprehensive survey of recent advances in the field of CVN. We cover important aspects of CVN research, including physical, medium access control, and routing protocols, as well as link scheduling and security. We also classify these research efforts in a taxonomy of cooperative vehicular networks. A set of key requirements for realizing the vision of cooperative vehicular networks is then identified and discussed. We also discuss open research challenges in enabling CVN. Lastly, the paper concludes by highlighting key points of research and future directions in the domain of CVN. PMID:29881331

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

PubMed

Wang, Xuwen; Nie, Sen; Wang, Binghong

2015-01-01

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

An Energy Efficient Cooperative Hierarchical MIMO Clustering Scheme for Wireless Sensor Networks

PubMed Central

Nasim, Mehwish; Qaisar, Saad; Lee, Sungyoung

2012-01-01

In this work, we present an energy efficient hierarchical cooperative clustering scheme for wireless sensor networks. Communication cost is a crucial factor in depleting the energy of sensor nodes. In the proposed scheme, nodes cooperate to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Performance is enhanced by cooperative multiple-input multiple-output (MIMO) communication ensuring energy efficiency for WSN deployments over large geographical areas. We test our scheme using TOSSIM and compare the proposed scheme with cooperative multiple-input multiple-output (CMIMO) clustering scheme and traditional multihop Single-Input-Single-Output (SISO) routing approach. Performance is evaluated on the basis of number of clusters, number of hops, energy consumption and network lifetime. Experimental results show significant energy conservation and increase in network lifetime as compared to existing schemes. PMID:22368459

Quality versus quantity of social ties in experimental cooperative networks.

PubMed

Shirado, Hirokazu; Fu, Feng; Fowler, James H; Christakis, Nicholas A

2013-01-01

Recent studies suggest that allowing individuals to choose their partners can help to maintain cooperation in human social networks; this behaviour can supplement behavioural reciprocity, whereby humans are influenced to cooperate by peer pressure. However, it is unknown how the rate of forming and breaking social ties affects our capacity to cooperate. Here we use a series of online experiments involving 1,529 unique participants embedded in 90 experimental networks, to show that there is a 'Goldilocks' effect of network dynamism on cooperation. When the rate of change in social ties is too low, subjects choose to have many ties, even if they attach to defectors. When the rate is too high, cooperators cannot detach from defectors as much as defectors re-attach and, hence, subjects resort to behavioural reciprocity and switch their behaviour to defection. Optimal levels of cooperation are achieved at intermediate levels of change in social ties.

Quality versus quantity of social ties in experimental cooperative networks

PubMed Central

Shirado, Hirokazu; Fu, Feng; Fowler, James H.; Christakis, Nicholas A.

2013-01-01

Recent studies suggest that allowing individuals to choose their partners can help to maintain cooperation in human social networks; this behaviour can supplement behavioural reciprocity, whereby humans are influenced to cooperate by peer pressure. However, it is unknown how the rate of forming and breaking social ties affects our capacity to cooperate. Here we use a series of online experiments involving 1,529 unique participants embedded in 90 experimental networks, to show that there is a ‘Goldilocks’ effect of network dynamism on cooperation. When the rate of change in social ties is too low, subjects choose to have many ties, even if they attach to defectors. When the rate is too high, cooperators cannot detach from defectors as much as defectors re-attach and, hence, subjects resort to behavioural reciprocity and switch their behaviour to defection. Optimal levels of cooperation are achieved at intermediate levels of change in social ties. PMID:24226079

Dynamic social networks facilitate cooperation in the N-player Prisoner’s Dilemma

NASA Astrophysics Data System (ADS)

Rezaei, Golriz; Kirley, Michael

2012-12-01

Understanding how cooperative behaviour evolves in network communities, where the individual members interact via social dilemma games, is an on-going challenge. In this paper, we introduce a social network based model to investigate the evolution of cooperation in the N-player Prisoner’s Dilemma game. As such, this work complements previous studies focused on multi-player social dilemma games and endogenous networks. Agents in our model, employ different game-playing strategies reflecting varying cognitive capacities. When an agent plays cooperatively, a social link is formed with each of the other N-1 group members. Subsequent cooperative actions reinforce this link. However, when an agent defects, the links in the social network are broken. Computational simulations across a range of parameter settings are used to examine different scenarios: varying population and group sizes; the group formation process (or partner selection); and agent decision-making strategies under varying dilemma constraints (cost-to-benefit ratios), including a “discriminator” strategy where the action is based on a function of the weighted links within an agent’s social network. The simulation results show that the proposed social network model is able to evolve and maintain cooperation. As expected, as the value of N increases the equilibrium proportion of cooperators in the population decreases. In addition, this outcome is dependent on the dilemma constraint (cost-to-benefit ratio). However, in some circumstances the dynamic social network plays an increasingly important role in promoting and sustaining cooperation, especially when the agents adopt the discriminator strategy. The adjustment of social links results in the formation of communities of “like-minded” agents. Subsequently, this local optimal behaviour promotes the evolution of cooperative behaviour at the system level.

Cooperation prevails when individuals adjust their social ties.

PubMed

Santos, Francisco C; Pacheco, Jorge M; Lenaerts, Tom

2006-10-20

Conventional evolutionary game theory predicts that natural selection favours the selfish and strong even though cooperative interactions thrive at all levels of organization in living systems. Recent investigations demonstrated that a limiting factor for the evolution of cooperative interactions is the way in which they are organized, cooperators becoming evolutionarily competitive whenever individuals are constrained to interact with few others along the edges of networks with low average connectivity. Despite this insight, the conundrum of cooperation remains since recent empirical data shows that real networks exhibit typically high average connectivity and associated single-to-broad-scale heterogeneity. Here, a computational model is constructed in which individuals are able to self-organize both their strategy and their social ties throughout evolution, based exclusively on their self-interest. We show that the entangled evolution of individual strategy and network structure constitutes a key mechanism for the sustainability of cooperation in social networks. For a given average connectivity of the population, there is a critical value for the ratio W between the time scales associated with the evolution of strategy and of structure above which cooperators wipe out defectors. Moreover, the emerging social networks exhibit an overall heterogeneity that accounts very well for the diversity of patterns recently found in acquired data on social networks. Finally, heterogeneity is found to become maximal when W reaches its critical value. These results show that simple topological dynamics reflecting the individual capacity for self-organization of social ties can produce realistic networks of high average connectivity with associated single-to-broad-scale heterogeneity. On the other hand, they show that cooperation cannot evolve as a result of "social viscosity" alone in heterogeneous networks with high average connectivity, requiring the additional mechanism of topological co-evolution to ensure the survival of cooperative behaviour.

Simultaneously selecting appropriate partners for gaming and strategy adaptation to enhance network reciprocity in the prisoner's dilemma

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2014-01-01

Network reciprocity is one mechanism for adding social viscosity, which leads to cooperative equilibrium in 2 × 2 prisoner's dilemma games. Previous studies have shown that cooperation can be enhanced by using a skewed, rather than a random, selection of partners for either strategy adaptation or the gaming process. Here we show that combining both processes for selecting a gaming partner and an adaptation partner further enhances cooperation, provided that an appropriate selection rule and parameters are adopted. We also show that this combined model significantly enhances cooperation by reducing the degree of activity in the underlying network; we measure the degree of activity with a quantity called effective degree. More precisely, during the initial evolutionary stage in which the global cooperation fraction declines because initially allocated cooperators becoming defectors, the model shows that weak cooperative clusters perish and only a few strong cooperative clusters survive. This finding is the most important key to attaining significant network reciprocity.

Asynchronous updates can promote the evolution of cooperation on multiplex networks

NASA Astrophysics Data System (ADS)

Allen, James M.; Hoyle, Rebecca B.

2017-04-01

We study the importance to the frequency of cooperation of the choice of updating strategies in a game played asynchronously or synchronously across layers in a multiplex network. Updating asynchronously in the public goods game leads to higher frequencies of cooperation compared to synchronous updates. How large this effect is depends on the sensitivity of the game dynamics to changes in the number of cooperators surrounding a player, with the largest effect observed when players payoffs are small. The discovery of this effect enhances understanding of cooperation on multiplex networks, and demonstrates a new way to maintain cooperation in these systems.

Project Final Report: Ubiquitous Computing and Monitoring System (UCoMS) for Discovery and Management of Energy Resources

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

Tzeng, Nian-Feng; White, Christopher D.; Moreman, Douglas

2012-07-14

The UCoMS research cluster has spearheaded three research areas since August 2004, including wireless and sensor networks, Grid computing, and petroleum applications. The primary goals of UCoMS research are three-fold: (1) creating new knowledge to push forward the technology forefronts on pertinent research on the computing and monitoring aspects of energy resource management, (2) developing and disseminating software codes and toolkits for the research community and the public, and (3) establishing system prototypes and testbeds for evaluating innovative techniques and methods. Substantial progress and diverse accomplishment have been made by research investigators in their respective areas of expertise cooperatively onmore » such topics as sensors and sensor networks, wireless communication and systems, computational Grids, particularly relevant to petroleum applications.« less

Persistence paves the way for cooperation in evolutionary games

NASA Astrophysics Data System (ADS)

Huang, Chang-Wei; Dai, Qiong-Lin

2017-04-01

Cooperation is an effective way to maximize collective benefits, especially in modern human society. The issues on the emergence and maintenance of cooperation have attracted much attention in recent years. Here, we introduce the persistence parameter τ to characterize the time duration of choices held by individuals and consider the effects of τ on cooperation. We find that persistence could promote cooperation in a population no matter what the network structure is. Furthermore, the results on heterogeneous networks show that individuals with larger τ are more inclined to cooperate than those with smaller τ. Moreover, we investigate the effects of correlations between degree and persistence in scale-free networks and find that assortative matching could remarkably enhance cooperation whereas disassortative matching has adverse impacts on the evolution of cooperation.

What promotes and inhibits cooperation in mental health care across disciplines, services and service sectors? A qualitative study.

PubMed

Bramesfeld, A; Ungewitter, C; Böttger, D; El, Jurdi J; Losert, C; Kilian, R

2012-03-01

To explore the practice of cooperation in mental health care across services and identify conditions that promote and inhibit cooperation. Focus groups with relevant service providers were conducted in four exemplary regions in Germany (rural/ urban and East/West). The discussions were content analysed. Seven central categories were deduced: (1) involved service providers, (2) comprehension, (3) reasons, (4) instruments for cooperation, (5) promoting and inhibiting conditions, (6) interdisciplinarity, and (7) regional and personal networks. Cooperation is practiced in networks, rather than defined relations. Who is involved in cooperation depends on patients/clients needs and may vary from case to case. Service providers do not have theoretical concepts of cooperation. Cooperation relies not only on personal contacts and knowledge between services but also on time, financial reimbursement and the social capital of the environment. In particular, cooperation with physicians was considered to be difficult by non-medical professionals. Physician's role models do not seem to include cooperation with other disciplines as a core task. To improve cooperation, regional and sustainable mental health networks have to be systematically implemented by providing leadership, time and reimbursement for network meetings. Interdisciplinary cooperation practice should be part of the curricula of medical students and residents in psychiatry.

Co-Operative Learning and Development Networks.

ERIC Educational Resources Information Center

Hodgson, V.; McConnell, D.

1995-01-01

Discusses the theory, nature, and benefits of cooperative learning. Considers the Cooperative Learning and Development Network (CLDN) trial in the JITOL (Just in Time Open Learning) project and examines the relationship between theories about cooperative learning and the reality of a group of professionals participating in a virtual cooperative…

Cooperative spreading processes in multiplex networks.

PubMed

Wei, Xiang; Chen, Shihua; Wu, Xiaoqun; Ning, Di; Lu, Jun-An

2016-06-01

This study is concerned with the dynamic behaviors of epidemic spreading in multiplex networks. A model composed of two interacting complex networks is proposed to describe cooperative spreading processes, wherein the virus spreading in one layer can penetrate into the other to promote the spreading process. The global epidemic threshold of the model is smaller than the epidemic thresholds of the corresponding isolated networks. Thus, global epidemic onset arises in the interacting networks even though an epidemic onset does not arise in each isolated network. Simulations verify the analysis results and indicate that cooperative spreading processes in multiplex networks enhance the final infection fraction.

The Practices of Student Network as Cooperative Learning in Ethiopia

ERIC Educational Resources Information Center

Reda, Weldemariam Nigusse; Hagos, Girmay Tsegay

2015-01-01

Student network is a teaching strategy introduced as cooperative learning to all educational levels above the upper primary schools (grade 5 and above) in Ethiopia. The study was, therefore, aimed at investigating to what extent the student network in Ethiopia is actually practiced in line with the principles of cooperative learning. Consequently,…

[The Patient Rights Act (PatRG)--part 1: legislative procedure, treatment contract, contracting parties and their obligations to cooperate and inform].

PubMed

Parzeller, Markus; Zedler, Barbara

2013-01-01

The article deals with the new regulations in the German Civil Code (BGB) which came into effect in Germany on 26 Feb 2013 as the Patient Rights Act (PatRG). In Part I, the legislative procedure, the treatment contract and the contracting parties (Section 630a Civil Code), the applicable regulations (Section 630b Civil Code) and the obligations to cooperate and inform (Section 630c Civil Code) are discussed and critically analysed.

Mechanisms and dynamics of cooperation and competition emergence in complex networked systems

NASA Astrophysics Data System (ADS)

Gianetto, David A.

Cooperative behavior is a pervasive phenomenon in human interactions and yet how it can evolve and become established, through the selfish process of natural selection, is an enduring puzzle. These behaviors emerge when agents interact in a structured manner; even so, the key structural factors that affect cooperation are not well understood. Moreover, the literature often considers cooperation a single attribute of primitive agents who do not react to environmental changes but real-world actors are more perceptive. The present work moves beyond these assumptions by evolving more realistic game participants, with memories of the past, on complex networks. Agents play repeated games with a three-part Markovian strategy that allows us to separate the cooperation phenomenon into trust, reciprocity, and forgiveness characteristics. Our results show that networks matter most when agents gain the most by acting in a selfish manner, irrespective of how much they may lose by cooperating; since the context provided by neighborhoods inhibits greedy impulses that agents otherwise succumb to in isolation. Network modularity is the most important driver of cooperation emergence in these high-stakes games. However, modularity fails to tell the complete story. Modular scale-free graphs impede cooperation when close coordination is required, partially due to the acyclic nature of scale-free network models. To achieve the highest cooperation in diverse social conditions, both high modularity, low connectivity within modules, and a rich network of long cycles become important. With these findings in hand, we study the influence of networks on coordination and competition within the federal health care insurance exchange. In this applied study, we show that systemic health care coordination is encouraged by the emergent insurance network. The network helps underpin the viability of the exchange and provides an environment of stronger competition once a critical-mass of insurers have entered the market.

Cooperation in scale-free networks with limited associative capacities

NASA Astrophysics Data System (ADS)

Poncela, Julia; Gómez-Gardeñes, Jesús; Moreno, Yamir

2011-05-01

In this work we study the effect of limiting the number of interactions (the associative capacity) that a node can establish per round of a prisoner’s dilemma game. We focus on the way this limitation influences the level of cooperation sustained by scale-free networks. We show that when the game includes cooperation costs, limiting the associative capacity of nodes to a fixed quantity renders in some cases larger values of cooperation than in the unrestricted scenario. This allows one to define an optimum capacity for which cooperation is maximally enhanced. Finally, for the case without cooperation costs, we find that even a tight limitation of the associative capacity of nodes yields the same levels of cooperation as in the original network.

Game Theory-Based Cooperation for Underwater Acoustic Sensor Networks: Taxonomy, Review, Research Challenges and Directions

PubMed Central

Muhammed, Dalhatu; Anisi, Mohammad Hossein; Vargas-Rosales, Cesar; Khan, Anwar

2018-01-01

Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal), long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node’s cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted. PMID:29389874

Game Theory-Based Cooperation for Underwater Acoustic Sensor Networks: Taxonomy, Review, Research Challenges and Directions.

PubMed

Muhammed, Dalhatu; Anisi, Mohammad Hossein; Zareei, Mahdi; Vargas-Rosales, Cesar; Khan, Anwar

2018-02-01

Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal), long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node's cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted.

Greed and Fear in Network Reciprocity: Implications for Cooperation among Organizations.

PubMed

Kitts, James A; Leal, Diego F; Felps, Will; Jones, Thomas M; Berman, Shawn L

2016-01-01

Extensive interdisciplinary literatures have built on the seminal spatial dilemmas model, which depicts the evolution of cooperation on regular lattices, with strategies propagating locally by relative fitness. In this model agents may cooperate with neighbors, paying an individual cost to enhance their collective welfare, or they may exploit cooperative neighbors and diminish collective welfare. Recent research has extended the model in numerous ways, incorporating behavioral noise, implementing other network topologies or adaptive networks, and employing alternative dynamics of replication. Although the underlying dilemma arises from two distinct dimensions-the gains for exploiting cooperative partners (Greed) and the cost of cooperating with exploitative partners (Fear)-most work following from the spatial dilemmas model has argued or assumed that the dilemma can be represented with a single parameter: This research has typically examined Greed or Fear in isolation, or a composite such as the K-index of Cooperation or the ratio of the benefit to cost of cooperation. We challenge this claim on theoretical grounds-showing that embedding interaction in networks generally leads Greed and Fear to have divergent, interactive, and highly nonlinear effects on cooperation at the macro level, even when individuals respond identically to Greed and Fear. Using computational experiments, we characterize both dynamic local behavior and long run outcomes across regions of this space. We also simulate interventions to investigate changes of Greed and Fear over time, showing how model behavior changes asymmetrically as boundaries in payoff space are crossed, leading some interventions to have irreversible effects on cooperation. We then replicate our experiments on inter-organizational network data derived from links through shared directors among 2,400 large US corporations, thus demonstrating our findings for Greed and Fear on a naturally-occurring network. In closing, we discuss implications of our main findings regarding Greed and Fear for the problem of cooperation on inter-organizational networks.

Greed and Fear in Network Reciprocity: Implications for Cooperation among Organizations

PubMed Central

Kitts, James A.; Leal, Diego F.; Felps, Will; Jones, Thomas M.; Berman, Shawn L.

2016-01-01

Extensive interdisciplinary literatures have built on the seminal spatial dilemmas model, which depicts the evolution of cooperation on regular lattices, with strategies propagating locally by relative fitness. In this model agents may cooperate with neighbors, paying an individual cost to enhance their collective welfare, or they may exploit cooperative neighbors and diminish collective welfare. Recent research has extended the model in numerous ways, incorporating behavioral noise, implementing other network topologies or adaptive networks, and employing alternative dynamics of replication. Although the underlying dilemma arises from two distinct dimensions—the gains for exploiting cooperative partners (Greed) and the cost of cooperating with exploitative partners (Fear)–most work following from the spatial dilemmas model has argued or assumed that the dilemma can be represented with a single parameter: This research has typically examined Greed or Fear in isolation, or a composite such as the K-index of Cooperation or the ratio of the benefit to cost of cooperation. We challenge this claim on theoretical grounds—showing that embedding interaction in networks generally leads Greed and Fear to have divergent, interactive, and highly nonlinear effects on cooperation at the macro level, even when individuals respond identically to Greed and Fear. Using computational experiments, we characterize both dynamic local behavior and long run outcomes across regions of this space. We also simulate interventions to investigate changes of Greed and Fear over time, showing how model behavior changes asymmetrically as boundaries in payoff space are crossed, leading some interventions to have irreversible effects on cooperation. We then replicate our experiments on inter-organizational network data derived from links through shared directors among 2,400 large US corporations, thus demonstrating our findings for Greed and Fear on a naturally-occurring network. In closing, we discuss implications of our main findings regarding Greed and Fear for the problem of cooperation on inter-organizational networks. PMID:26863540

Coevolution of cooperation and network structure under natural selection

NASA Astrophysics Data System (ADS)

Yang, D.-P.; Lin, H.; Shuai, J. W.

2011-02-01

A coevolution model by coupling mortality and fertility selection is introduced to investigate the evolution of cooperation and network structure in the prisoner's dilemma game. The cooperation level goes through a continuous phase transition vs. defection temptation b for low mortality selection intensity β and through a discontinuous one for infinite β. The cooperation level is enhanced most at β≈1 for any b. The local and global properties of the network structure, such as cluster and cooperating k-core, are investigated for the understanding of cooperation evolution. Cooperation is promoted by forming a tight cooperating k-core at moderate β, but too large β will destroy the cooperating k-core rapidly resulting in a rapid drop of the cooperation level. Importantly, the infinite β changes the normalized sucker's payoff S from 0 to 1-b and its dynamics of the cooperation level undergoes a very slow power-law decay, which leads the evolution into the regime of neutral evolution.

When Reputation Enforces Evolutionary Cooperation in Unreliable MANETs.

PubMed

Tang, Changbing; Li, Ang; Li, Xiang

2015-10-01

In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this paper, we study cooperative packet forwarding in a one-hop unreliable channel which results from loss of packets and noisy observation of transmissions. We propose an indirect reciprocity framework based on evolutionary game theory, and enforce cooperation of packet forwarding strategies in both structured and unstructured MANETs. Furthermore, we analyze the evolutionary dynamics of cooperative strategies and derive the threshold of benefit-to-cost ratio to guarantee the convergence of cooperation. The numerical simulations verify that the proposed evolutionary game theoretic solution enforces cooperation when the benefit-to-cost ratio of the altruistic exceeds the critical condition. In addition, the network throughput performance of our proposed strategy in structured MANETs is measured, which is in close agreement with that of the full cooperative strategy.

Interplay between cooperation-enhancing mechanisms in evolutionary games with tag-mediated interactions

NASA Astrophysics Data System (ADS)

Hadzibeganovic, Tarik; Stauffer, Dietrich; Han, Xiao-Pu

2018-04-01

Cooperation is fundamental for the long-term survival of biological, social, and technological networks. Previously, mechanisms for the enhancement of cooperation, such as network reciprocity, have largely been studied in isolation and with often inconclusive findings. Here, we present an evolutionary, multiagent-based, and spatially explicit computer model to specifically address the interactive interplay between such mechanisms. We systematically investigate the effects of phenotypic diversity, network structure, and rewards on cooperative behavior emerging in a population of reproducing artificial decision makers playing tag-mediated evolutionary games. Cooperative interactions are rewarded such that both the benefits of recipients and costs of donators are affected by the reward size. The reward size is determined by the number of cooperative acts occurring within a given reward time frame. Our computational experiments reveal that small reward frames promote unconditional cooperation in populations with both low and high diversity, whereas large reward frames lead to cycles of conditional and unconditional strategies at high but not at low diversity. Moreover, an interaction between rewards and spatial structure shows that relative to small reward frames, there is a strong difference between the frequency of conditional cooperators populating rewired versus non-rewired networks when the reward frame is large. Notably, in a less diverse population, the total number of defections is comparable across different network topologies, whereas in more diverse environments defections become more frequent in a regularly structured than in a rewired, small-world network of contacts. Acknowledging the importance of such interaction effects in social dilemmas will have inevitable consequences for the future design of cooperation-enhancing protocols in large-scale, distributed, and decentralized systems such as peer-to-peer networks.

Age structure and cooperation in coevolutionary games on dynamic network

NASA Astrophysics Data System (ADS)

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.

Dependency Links Can Hinder the Evolution of Cooperation in the Prisoner’s Dilemma Game on Lattices and Networks

PubMed Central

Wang, Xuwen; Nie, Sen; Wang, Binghong

2015-01-01

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

["Hope Dies Last …" - Cross-Sectoral Cooperation in Integrated Care].

PubMed

Ruppert, Daniel; Stegbauer, Constanze; Bramesfeld, Anke; Bestmann, Beate; Szecsenyi, Joachim; Götz, Katja

2017-04-01

Objective Multiple models of Integrated Care (IC) have been implemented in German mental health services in the last decade in order to improve cross-sectoral, interdisciplinary cooperation. This study investigates an IC network model providing home treatment, case management and a 24/7 hotline. The aim of the study was to explore how health professionals working in this service model perceive both cooperation within their facilities and with external stakeholders. Methods 5 focus groups with 39 health professionals working in an IC mental health network were conducted and analyzed with qualitative content analysis. Results Focus groups participants reported on excellent cooperation within their facilities. The cooperation with external stakeholders, i. e. physicians, psychotherapists and psychiatric clinics, leaves room for improvement. Conclusions Until now little consideration has been given to the perspectives of health professionals. Cooperation within IC mental health networks seems to be effective. Cooperation with stakeholders outside the networks needs to be enhanced. © Georg Thieme Verlag KG Stuttgart · New York.

Evolutionary Games in Multi-Agent Systems of Weighted Social Networks

NASA Astrophysics Data System (ADS)

Du, Wen-Bo; Cao, Xian-Bin; Zheng, Hao-Ran; Zhou, Hong; Hu, Mao-Bin

Much empirical evidence has shown realistic networks are weighted. Compared with those on unweighted networks, the dynamics on weighted network often exhibit distinctly different phenomena. In this paper, we investigate the evolutionary game dynamics (prisoner's dilemma game and snowdrift game) on a weighted social network consisted of rational agents and focus on the evolution of cooperation in the system. Simulation results show that the cooperation level is strongly affected by the weighted nature of the network. Moreover, the variation of time series has also been investigated. Our work may be helpful in understanding the cooperative behavior in the social systems.

Population Fluctuation Promotes Cooperation in Networks

PubMed Central

Miller, Steve; Knowles, Joshua

2015-01-01

We consider the problem of explaining the emergence and evolution of cooperation in dynamic network-structured populations. Building on seminal work by Poncela et al., which shows how cooperation (in one-shot prisoner’s dilemma) is supported in growing populations by an evolutionary preferential attachment (EPA) model, we investigate the effect of fluctuations in the population size. We find that a fluctuating model – based on repeated population growth and truncation – is more robust than Poncela et al.’s in that cooperation flourishes for a wider variety of initial conditions. In terms of both the temptation to defect, and the types of strategies present in the founder network, the fluctuating population is found to lead more securely to cooperation. Further, we find that this model will also support the emergence of cooperation from pre-existing non-cooperative random networks. This model, like Poncela et al.’s, does not require agents to have memory, recognition of other agents, or other cognitive abilities, and so may suggest a more general explanation of the emergence of cooperation in early evolutionary transitions, than mechanisms such as kin selection, direct and indirect reciprocity. PMID:26061705

Emergence of Super Cooperation of Prisoner’s Dilemma Games on Scale-Free Networks

PubMed Central

Li, Angsheng; Yong, Xi

2015-01-01

Recently, the authors proposed a quantum prisoner’s dilemma game based on the spatial game of Nowak and May, and showed that the game can be played classically. By using this idea, we proposed three generalized prisoner’s dilemma (GPD, for short) games based on the weak Prisoner’s dilemma game, the full prisoner’s dilemma game and the normalized Prisoner’s dilemma game, written by GPDW, GPDF and GPDN respectively. Our games consist of two players, each of which has three strategies: cooperator (C), defector (D) and super cooperator (denoted by Q), and have a parameter γ to measure the entangled relationship between the two players. We found that our generalised prisoner’s dilemma games have new Nash equilibrium principles, that entanglement is the principle of emergence and convergence (i.e., guaranteed emergence) of super cooperation in evolutions of our generalised prisoner’s dilemma games on scale-free networks, that entanglement provides a threshold for a phase transition of super cooperation in evolutions of our generalised prisoner’s dilemma games on scale-free networks, that the role of heterogeneity of the scale-free networks in cooperations and super cooperations is very limited, and that well-defined structures of scale-free networks allow coexistence of cooperators and super cooperators in the evolutions of the weak version of our generalised prisoner’s dilemma games. PMID:25643279

Evolution of cooperation on complex networks with synergistic and discounted group interactions

NASA Astrophysics Data System (ADS)

Zhou, Lei; Li, Aming; Wang, Long

2015-06-01

In the real world individuals often engage in group interactions and their payoffs are determined by many factors, including the typical nonlinear interactions, i.e., synergy and discounting. Previous literatures assume that individual payoffs are either synergistically enhanced or discounted with the additional cooperators. Such settings ignore the interplay of these two factors, which is in sharp contrast with the fact that they ubiquitously coexist. Here we investigate how the coexistence and periodical switching of synergistic and discounted group interactions affect the evolution of cooperation on various complex networks. We show that scale-free networks facilitate the emergence of cooperation in terms of fixation probability for group interactions. With nonlinear interactions the heterogeneity of the degree acts as a double-edged sword: below the neutral drift it is the best for cooperation while above the neutral drift it instead provides the least opportunity for cooperators to be fixed. The advantages of the heterogeneity fade as interactive attributes switch between synergy and discounting, which suggests that the heterogeneity of population structures cannot favor cooperators in group interactions even with simple nonlinear interactions. Nonetheless, scale-free networks always guarantee cooperators the fastest rate of fixation. Our work implies that even very simple nonlinear group interactions could greatly shape the fixation probability and fixation time of cooperators in structured populations indicated by complex networks.

A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks.

PubMed

Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

2016-10-01

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime.

A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks

PubMed Central

Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

2016-01-01

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime. PMID:27706079

Evolution of cooperation under social pressure in multiplex networks

NASA Astrophysics Data System (ADS)

Pereda, María

2016-09-01

In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.

Evolution of cooperation under social pressure in multiplex networks.

PubMed

Pereda, María

2016-09-01

In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.

Cooperative Collection Development in Multitype Library Networks: A Beginning--Goals and Methods. Proceedings of the Annual Conference of the Missouri Library Association (1980).

ERIC Educational Resources Information Center

Tompkins, Philip, Ed.

This document presents the proceedings of a conference organized to review the cooperative collection development features of the Missouri State Network Plan and to outline specific goals, methods, and materials for facilitating cooperative collection development projects in the state's multitype library networks. An introduction provides…

Problems of integrated palliative care: a Dutch case study of routines and cooperation in the region of Arnhem.

PubMed

van Raak, Arno; Paulus, Aggie; Cuijpers, Rianne; Te Velde, Clary

2008-12-01

Cooperation in networks of providers of palliative care in Europe is problematic. Based on the concept of routines (patterns of behavior) and data about a Dutch network, we developed an explanation of this problem, in order to better understand the conditions for cooperation. Although more research is needed, the study suggests that disparate matches (divergence) between routines of the network members hampers cooperation. To promote cooperation, divergence, and legislation that stabilizes existing routines, must be identified. Divergence must be overcome and negotiations and transformational leadership, which require power sources, may be useful for this.

Constructing Robust Cooperative Networks using a Multi-Objective Evolutionary Algorithm

PubMed Central

Wang, Shuai; Liu, Jing

2017-01-01

The design and construction of network structures oriented towards different applications has attracted much attention recently. The existing studies indicated that structural heterogeneity plays different roles in promoting cooperation and robustness. Compared with rewiring a predefined network, it is more flexible and practical to construct new networks that satisfy the desired properties. Therefore, in this paper, we study a method for constructing robust cooperative networks where the only constraint is that the number of nodes and links is predefined. We model this network construction problem as a multi-objective optimization problem and propose a multi-objective evolutionary algorithm, named MOEA-Netrc, to generate the desired networks from arbitrary initializations. The performance of MOEA-Netrc is validated on several synthetic and real-world networks. The results show that MOEA-Netrc can construct balanced candidates and is insensitive to the initializations. MOEA-Netrc can find the Pareto fronts for networks with different levels of cooperation and robustness. In addition, further investigation of the robustness of the constructed networks revealed the impact on other aspects of robustness during the construction process. PMID:28134314

Coevolutionary, coexisting learning and teaching agents model for prisoner’s dilemma games enhancing cooperation with assortative heterogeneous networks

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2013-07-01

Unlike other natural network systems, assortativity can be observed in most human social networks, although it has been reported that a social dilemma situation represented by the prisoner’s dilemma favors dissortativity to enhance cooperation. We established a new coevolutionary model for both agents’ strategy and network topology, where teaching and learning agents coexist. Remarkably, this model enables agents’ enhancing cooperation more than a learners-only model on a time-frozen scale-free network and produces an underlying assortative network with a fair degree of power-law distribution. The model may imply how and why assortative networks are adaptive in human society.

[Social network analysis of interdisciplinary cooperation and networking in early prevention and intervention. A pilot study].

PubMed

Künster, A K; Knorr, C; Fegert, J M; Ziegenhain, U

2010-11-01

Child protection can only be successfully solved by interdisciplinary cooperation and networking. The individual, heterogeneous, and complex needs of families cannot be met sufficiently by one profession alone. To guarantee efficient interdisciplinary cooperation, there should not be any gaps in the network. In addition, each actor in the network should be placed at an optimal position regarding function, responsibilities, and skills. Actors that serve as allocators, such as pediatricians or youth welfare officers, should be in key player positions within the network. Furthermore, successful child protection is preventive and starts early. Social network analysis is an adequate technique to assess network structures and to plan interventions to improve networking. In addition, it is very useful to evaluate the effectiveness of interventions like round tables. We present data from our pilot project which was part of "Guter Start ins Kinderleben" ("a good start into a child's life"). Exemplary network data from one community show that networking is already quite effective with a satisfactory mean density throughout the network. There is potential for improvement in cooperation, especially at the interface between the child welfare and health systems.

Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks

NASA Astrophysics Data System (ADS)

Wu, Yu'E.; Chang, Shuhua; Zhang, Zhipeng; Deng, Zhenghong

2017-01-01

Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world.

Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks

PubMed Central

Wu, Yu’e; Chang, Shuhua; Zhang, Zhipeng; Deng, Zhenghong

2017-01-01

Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world. PMID:28112276

Evolution of Cooperation in Social Dilemmas on Complex Networks

PubMed Central

Iyer, Swami; Killingback, Timothy

2016-01-01

Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution of cooperation in three exemplars of key social dilemmas, representing the prisoner’s dilemma, hawk-dove and coordination classes of games, in structured populations defined by complex networks. Using individual-based simulations of the games on model and empirical networks, we give a detailed comparative study of the effects of the structural properties of a network, such as its average degree, variance in degree distribution, clustering coefficient, and assortativity coefficient, on the promotion of cooperative behavior in all three classes of games. PMID:26928428

Wireless Cooperative Networks: Self-Configuration and Optimization

DTIC Science & Technology

2011-09-09

TERMS wireless sensor networks , wireless cooperative networks, resource optimization, ultra-wideband, localization, ranging 16. SECURITY...Communications We consider two prevalent relay protocols for wireless sensor networks : decode-and-forward (DF) and amplify-and-forward (AF). To... sensor networks where each node may have its own sensing data to transmit, since they can maximally conserve energy while helping others as relays

A simple model of bipartite cooperation for ecological and organizational networks.

PubMed

Saavedra, Serguei; Reed-Tsochas, Felix; Uzzi, Brian

2009-01-22

In theoretical ecology, simple stochastic models that satisfy two basic conditions about the distribution of niche values and feeding ranges have proved successful in reproducing the overall structural properties of real food webs, using species richness and connectance as the only input parameters. Recently, more detailed models have incorporated higher levels of constraint in order to reproduce the actual links observed in real food webs. Here, building on previous stochastic models of consumer-resource interactions between species, we propose a highly parsimonious model that can reproduce the overall bipartite structure of cooperative partner-partner interactions, as exemplified by plant-animal mutualistic networks. Our stochastic model of bipartite cooperation uses simple specialization and interaction rules, and only requires three empirical input parameters. We test the bipartite cooperation model on ten large pollination data sets that have been compiled in the literature, and find that it successfully replicates the degree distribution, nestedness and modularity of the empirical networks. These properties are regarded as key to understanding cooperation in mutualistic networks. We also apply our model to an extensive data set of two classes of company engaged in joint production in the garment industry. Using the same metrics, we find that the network of manufacturer-contractor interactions exhibits similar structural patterns to plant-animal pollination networks. This surprising correspondence between ecological and organizational networks suggests that the simple rules of cooperation that generate bipartite networks may be generic, and could prove relevant in many different domains, ranging from biological systems to human society.

Aerospace Human Factors

NASA Technical Reports Server (NTRS)

Jordan, Kevin

1999-01-01

The following contains the final report on the activities related to the Cooperative Agreement between the human factors research group at NASA Ames Research Center and the Psychology Department at San Jose State University. The participating NASA Ames division has been, as the organization has changed, the Aerospace Human Factors Research Division (ASHFRD and Code FL), the Flight Management and Human Factors Research Division (Code AF), and the Human Factors Research and Technology Division (Code IH). The inclusive dates for the report are November 1, 1984 to January 31, 1999. Throughout the years, approximately 170 persons worked on the cooperative agreements in one capacity or another. The Cooperative Agreement provided for research personnel to collaborate with senior scientists in ongoing NASA ARC research. Finally, many post-MA/MS and post-doctoral personnel contributed to the projects. It is worth noting that 10 former cooperative agreement personnel were hired into civil service positions directly from the agreements.

STBC AF relay for unmanned aircraft system

NASA Astrophysics Data System (ADS)

Adachi, Fumiyuki; Miyazaki, Hiroyuki; Endo, Chikara

2015-01-01

If a large scale disaster similar to the Great East Japan Earthquake 2011 happens, some areas may be isolated from the communications network. Recently, unmanned aircraft system (UAS) based wireless relay communication has been attracting much attention since it is able to quickly re-establish the connection between isolated areas and the network. However, the channel between ground station (GS) and unmanned aircraft (UA) is unreliable due to UA's swing motion and as consequence, the relay communication quality degrades. In this paper, we introduce space-time block coded (STBC) amplify-and-forward (AF) relay for UAS based wireless relay communication to improve relay communication quality. A group of UAs forms single frequency network (SFN) to perform STBC-AF cooperative relay. In STBC-AF relay, only conjugate operation, block exchange and amplifying are required at UAs. Therefore, STBC-AF relay improves the relay communication quality while alleviating the complexity problem at UAs. It is shown by computer simulation that STBC-AF relay can achieve better throughput performance than conventional AF relay.

Cooperative Networks: Altruism, Group Solidarity, Reciprocity, and Sanctioning in Ugandan Producer Organizations.

PubMed

Baldassarri, Delia

2015-09-01

Repeated interaction and social networks are commonly considered viable solutions to collective action problems. This article identifies and systematically measures four general mechanisms--that is, generalized altruism, group solidarity, reciprocity, and the threat of sanctioning--and tests which of them brings about cooperation in the context of Ugandan producer organizations. Using an innovative methodological framework that combines "lab-in-the-field" experiments with survey interviews and complete social networks data, the article goes beyond the assessment of a relationship between social networks and collective outcomes to study the mechanisms that favor cooperative behavior. The article first establishes a positive relationship between position in the network structure and propensity to cooperate in the producer organization and then uses farmers' behavior in dictator and public goods games to test different mechanisms that may account for such a relationship. Results show that cooperation is induced by patterns of reciprocity that emerge through repeated interaction rather than other-regarding preferences like altruism or group solidarity.

The effects of reputational and social knowledge on cooperation

PubMed Central

Gallo, Edoardo; Yan, Chang

2015-01-01

The emergence and sustenance of cooperative behavior is fundamental for a society to thrive. Recent experimental studies have shown that cooperation increases in dynamic networks in which subjects can choose their partners. However, these studies did not vary reputational knowledge, or what subjects know about other’s past actions, which has long been recognized as an important factor in supporting cooperation. They also did not give subjects access to global social knowledge, or information on who is connected to whom in the group. As a result, it remained unknown how reputational and social knowledge foster cooperative behavior in dynamic networks both independently and by complementing each other. In an experimental setting, we show that global reputational knowledge is crucial to sustaining a high level of cooperation and welfare. Cooperation is associated with the emergence of dense and clustered networks with highly cooperative hubs. Global social knowledge has no effect on the aggregate level of cooperation. A community analysis shows that the addition of global social knowledge to global reputational knowledge affects the distribution of cooperative activity: cooperators form a separate community that achieves a higher cooperation level than the community of defectors. Members of the community of cooperators achieve a higher payoff from interactions within the community than members of the less cooperative community. PMID:25775544

A Probabilistic and Highly Efficient Topology Control Algorithm for Underwater Cooperating AUV Networks

PubMed Central

Li, Ning; Cürüklü, Baran; Bastos, Joaquim; Sucasas, Victor; Fernandez, Jose Antonio Sanchez; Rodriguez, Jonathan

2017-01-01

The aim of the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) project is to make autonomous underwater vehicles (AUVs), remote operated vehicles (ROVs) and unmanned surface vehicles (USVs) more accessible and useful. To achieve cooperation and communication between different AUVs, these must be able to exchange messages, so an efficient and reliable communication network is necessary for SWARMs. In order to provide an efficient and reliable communication network for mission execution, one of the important and necessary issues is the topology control of the network of AUVs that are cooperating underwater. However, due to the specific properties of an underwater AUV cooperation network, such as the high mobility of AUVs, large transmission delays, low bandwidth, etc., the traditional topology control algorithms primarily designed for terrestrial wireless sensor networks cannot be used directly in the underwater environment. Moreover, these algorithms, in which the nodes adjust their transmission power once the current transmission power does not equal an optimal one, are costly in an underwater cooperating AUV network. Considering these facts, in this paper, we propose a Probabilistic Topology Control (PTC) algorithm for an underwater cooperating AUV network. In PTC, when the transmission power of an AUV is not equal to the optimal transmission power, then whether the transmission power needs to be adjusted or not will be determined based on the AUV’s parameters. Each AUV determines their own transmission power adjustment probability based on the parameter deviations. The larger the deviation, the higher the transmission power adjustment probability is, and vice versa. For evaluating the performance of PTC, we combine the PTC algorithm with the Fuzzy logic Topology Control (FTC) algorithm and compare the performance of these two algorithms. The simulation results have demonstrated that the PTC is efficient at reducing the transmission power adjustment ratio while improving the network performance. PMID:28471387

A Probabilistic and Highly Efficient Topology Control Algorithm for Underwater Cooperating AUV Networks.

PubMed

Li, Ning; Cürüklü, Baran; Bastos, Joaquim; Sucasas, Victor; Fernandez, Jose Antonio Sanchez; Rodriguez, Jonathan

2017-05-04

The aim of the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) project is to make autonomous underwater vehicles (AUVs), remote operated vehicles (ROVs) and unmanned surface vehicles (USVs) more accessible and useful. To achieve cooperation and communication between different AUVs, these must be able to exchange messages, so an efficient and reliable communication network is necessary for SWARMs. In order to provide an efficient and reliable communication network for mission execution, one of the important and necessary issues is the topology control of the network of AUVs that are cooperating underwater. However, due to the specific properties of an underwater AUV cooperation network, such as the high mobility of AUVs, large transmission delays, low bandwidth, etc., the traditional topology control algorithms primarily designed for terrestrial wireless sensor networks cannot be used directly in the underwater environment. Moreover, these algorithms, in which the nodes adjust their transmission power once the current transmission power does not equal an optimal one, are costly in an underwater cooperating AUV network. Considering these facts, in this paper, we propose a Probabilistic Topology Control (PTC) algorithm for an underwater cooperating AUV network. In PTC, when the transmission power of an AUV is not equal to the optimal transmission power, then whether the transmission power needs to be adjusted or not will be determined based on the AUV's parameters. Each AUV determines their own transmission power adjustment probability based on the parameter deviations. The larger the deviation, the higher the transmission power adjustment probability is, and vice versa. For evaluating the performance of PTC, we combine the PTC algorithm with the Fuzzy logic Topology Control (FTC) algorithm and compare the performance of these two algorithms. The simulation results have demonstrated that the PTC is efficient at reducing the transmission power adjustment ratio while improving the network performance.

Clustering in large networks does not promote upstream reciprocity.

PubMed

Masuda, Naoki

2011-01-01

Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution.

Clustering in Large Networks Does Not Promote Upstream Reciprocity

PubMed Central

Masuda, Naoki

2011-01-01

Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution. PMID:21998641

Multiple effect of social influence on cooperation in interdependent network games.

PubMed

Jiang, Luo-Luo; Li, Wen-Jing; Wang, Zhen

2015-10-01

The social influence exists widely in the human society, where individual decision-making process (from congressional election to electronic commerce) may be affected by the attitude and behavior of others belonging to different social networks. Here, we couple the snowdrift (SD) game and the prisoner's dilemma (PD) game on two interdependent networks, where strategies in both games are associated by social influence to mimick the majority rule. More accurately, individuals' strategies updating refers to social learning (based on payoff difference) and above-mentioned social influence (related with environment of interdependent group), which is controlled by social influence strength s. Setting s = 0 decouples the networks and returns the traditional network game; while its increase involves the interactions between networks. By means of numerous Monte Carlo simulations, we find that such a mechanism brings multiple influence to the evolution of cooperation. Small s leads to unequal cooperation level in both games, because social learning is still the main updating rule for most players. Though intermediate and large s guarantees the synchronized evolution of strategy pairs, cooperation finally dies out and reaches a completely dominance in both cases. Interestingly, these observations are attributed to the expansion of cooperation clusters. Our work may provide a new understanding to the emergence of cooperation in intercorrelated social systems.

Multiple effect of social influence on cooperation in interdependent network games

NASA Astrophysics Data System (ADS)

Jiang, Luo-Luo; Li, Wen-Jing; Wang, Zhen

2015-10-01

The social influence exists widely in the human society, where individual decision-making process (from congressional election to electronic commerce) may be affected by the attitude and behavior of others belonging to different social networks. Here, we couple the snowdrift (SD) game and the prisoner’s dilemma (PD) game on two interdependent networks, where strategies in both games are associated by social influence to mimick the majority rule. More accurately, individuals’ strategies updating refers to social learning (based on payoff difference) and above-mentioned social influence (related with environment of interdependent group), which is controlled by social influence strength s. Setting s = 0 decouples the networks and returns the traditional network game; while its increase involves the interactions between networks. By means of numerous Monte Carlo simulations, we find that such a mechanism brings multiple influence to the evolution of cooperation. Small s leads to unequal cooperation level in both games, because social learning is still the main updating rule for most players. Though intermediate and large s guarantees the synchronized evolution of strategy pairs, cooperation finally dies out and reaches a completely dominance in both cases. Interestingly, these observations are attributed to the expansion of cooperation clusters. Our work may provide a new understanding to the emergence of cooperation in intercorrelated social systems.

Effect of direct reciprocity and network structure on continuing prosperity of social networking services.

PubMed

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 reciprocal agents on cooperation.

Linking Individual and Collective Behavior in Adaptive Social Networks

NASA Astrophysics Data System (ADS)

Pinheiro, Flávio L.; Santos, Francisco C.; Pacheco, Jorge M.

2016-03-01

Adaptive social structures are known to promote the evolution of cooperation. However, up to now the characterization of the collective, population-wide dynamics resulting from the self-organization of individual strategies on a coevolving, adaptive network has remained unfeasible. Here we establish a (reversible) link between individual (micro)behavior and collective (macro)behavior for coevolutionary processes. We demonstrate that an adaptive network transforms a two-person social dilemma locally faced by individuals into a collective dynamics that resembles that associated with an N -person coordination game, whose characterization depends sensitively on the relative time scales between the entangled behavioral and network evolutions. In particular, we show that the faster the relative rate of adaptation of the network, the smaller the critical fraction of cooperators required for cooperation to prevail, thus establishing a direct link between network adaptation and the evolution of cooperation. The framework developed here is general and may be readily applied to other dynamical processes occurring on adaptive networks, notably, the spreading of contagious diseases or the diffusion of innovations.

Cooperative water network system to reduce carbon footprint.

PubMed

Lim, Seong-Rin; Park, Jong Moon

2008-08-15

Much effort has been made in reducing the carbon footprint to mitigate climate change. However, water network synthesis has been focused on reducing the consumption and cost of freshwater within each industrial plant. The objective of this study is to illustrate the necessity of the cooperation of industrial plants to reduce the total carbon footprint of their water supply systems. A mathematical optimization model to minimize global warming potentials is developed to synthesize (1) a cooperative water network system (WNS) integrated over two plants and (2) an individual WNS consisting of two WNSs separated for each plant. The cooperative WNS is compared to the individual WNS. The cooperation reduces their carbon footprint and is economically feasible and profitable. A strategy for implementing the cooperation is suggested for the fair distribution of costs and benefits. As a consequence, industrial plants should cooperate with their neighbor plants to further reduce the carbon footprint.

Game-theoretic approach for improving cooperation in wireless multihop networks.

PubMed

Ng, See-Kee; Seah, Winston K G

2010-06-01

Traditional networks are built on the assumption that network entities cooperate based on a mandatory network communication semantic to achieve desirable qualities such as efficiency and scalability. Over the years, this assumption has been eroded by the emergence of users that alter network behavior in a way to benefit themselves at the expense of others. At one extreme, a malicious user/node may eavesdrop on sensitive data or deliberately inject packets into the network to disrupt network operations. The solution to this generally lies in encryption and authentication. In contrast, a rational node acts only to achieve an outcome that he desires most. In such a case, cooperation is still achievable if the outcome is to the best interest of the node. The node misbehavior problem would be more pronounced in multihop wireless networks like mobile ad hoc and sensor networks, which are typically made up of wireless battery-powered devices that must cooperate to forward packets for one another. However, cooperation may be hard to maintain as it consumes scarce resources such as bandwidth, computational power, and battery power. This paper applies game theory to achieve collusive networking behavior in such network environments. In this paper, pricing, promiscuous listening, and mass punishments are avoided altogether. Our model builds on recent work in the field of Economics on the theory of imperfect private monitoring for the dynamic Bertrand oligopoly, and adapts it to the wireless multihop network. The model derives conditions for collusive packet forwarding, truthful routing broadcasts, and packet acknowledgments under a lossy wireless multihop environment, thus capturing many important characteristics of the network layer and link layer in one integrated analysis that has not been achieved previously. We also provide a proof of the viability of the model under a theoretical wireless environment. Finally, we show how the model can be applied to design a generic protocol which we call the Selfishness Resilient Resource Reservation protocol, and validate the effectiveness of this protocol in ensuring cooperation using simulations.

Performance Analysis of MIMO Relay Network via Propagation Measurement in L-Shaped Corridor Environment

NASA Astrophysics Data System (ADS)

Lertwiram, Namzilp; Tran, Gia Khanh; Mizutani, Keiichi; Sakaguchi, Kei; Araki, Kiyomichi

Setting relays can address the shadowing problem between a transmitter (Tx) and a receiver (Rx). Moreover, the Multiple-Input Multiple-Output (MIMO) technique has been introduced to improve wireless link capacity. The MIMO technique can be applied in relay network to enhance system performance. However, the efficiency of relaying schemes and relay placement have not been well investigated with experiment-based study. This paper provides a propagation measurement campaign of a MIMO two-hop relay network in 5GHz band in an L-shaped corridor environment with various relay locations. Furthermore, this paper proposes a Relay Placement Estimation (RPE) scheme to identify the optimum relay location, i.e. the point at which the network performance is highest. Analysis results of channel capacity show that relaying technique is beneficial over direct transmission in strong shadowing environment while it is ineffective in non-shadowing environment. In addition, the optimum relay location estimated with the RPE scheme also agrees with the location where the network achieves the highest performance as identified by network capacity. Finally, the capacity analysis shows that two-way MIMO relay employing network coding has the best performance while cooperative relaying scheme is not effective due to shadowing effect weakening the signal strength of the direct link.

Towards Reliable and Energy-Efficient Incremental Cooperative Communication for Wireless Body Area Networks.

PubMed

Yousaf, Sidrah; Javaid, Nadeem; Qasim, Umar; Alrajeh, Nabil; Khan, Zahoor Ali; Ahmed, Mansoor

2016-02-24

In this study, we analyse incremental cooperative communication for wireless body area networks (WBANs) with different numbers of relays. Energy efficiency (EE) and the packet error rate (PER) are investigated for different schemes. We propose a new cooperative communication scheme with three-stage relaying and compare it to existing schemes. Our proposed scheme provides reliable communication with less PER at the cost of surplus energy consumption. Analytical expressions for the EE of the proposed three-stage cooperative communication scheme are also derived, taking into account the effect of PER. Later on, the proposed three-stage incremental cooperation is implemented in a network layer protocol; enhanced incremental cooperative critical data transmission in emergencies for static WBANs (EInCo-CEStat). Extensive simulations are conducted to validate the proposed scheme. Results of incremental relay-based cooperative communication protocols are compared to two existing cooperative routing protocols: cooperative critical data transmission in emergencies for static WBANs (Co-CEStat) and InCo-CEStat. It is observed from the simulation results that incremental relay-based cooperation is more energy efficient than the existing conventional cooperation protocol, Co-CEStat. The results also reveal that EInCo-CEStat proves to be more reliable with less PER and higher throughput than both of the counterpart protocols. However, InCo-CEStat has less throughput with a greater stability period and network lifetime. Due to the availability of more redundant links, EInCo-CEStat achieves a reduced packet drop rate at the cost of increased energy consumption.

Towards Reliable and Energy-Efficient Incremental Cooperative Communication for Wireless Body Area Networks

PubMed Central

Yousaf, Sidrah; Javaid, Nadeem; Qasim, Umar; Alrajeh, Nabil; Khan, Zahoor Ali; Ahmed, Mansoor

2016-01-01

In this study, we analyse incremental cooperative communication for wireless body area networks (WBANs) with different numbers of relays. Energy efficiency (EE) and the packet error rate (PER) are investigated for different schemes. We propose a new cooperative communication scheme with three-stage relaying and compare it to existing schemes. Our proposed scheme provides reliable communication with less PER at the cost of surplus energy consumption. Analytical expressions for the EE of the proposed three-stage cooperative communication scheme are also derived, taking into account the effect of PER. Later on, the proposed three-stage incremental cooperation is implemented in a network layer protocol; enhanced incremental cooperative critical data transmission in emergencies for static WBANs (EInCo-CEStat). Extensive simulations are conducted to validate the proposed scheme. Results of incremental relay-based cooperative communication protocols are compared to two existing cooperative routing protocols: cooperative critical data transmission in emergencies for static WBANs (Co-CEStat) and InCo-CEStat. It is observed from the simulation results that incremental relay-based cooperation is more energy efficient than the existing conventional cooperation protocol, Co-CEStat. The results also reveal that EInCo-CEStat proves to be more reliable with less PER and higher throughput than both of the counterpart protocols. However, InCo-CEStat has less throughput with a greater stability period and network lifetime. Due to the availability of more redundant links, EInCo-CEStat achieves a reduced packet drop rate at the cost of increased energy consumption. PMID:26927104

Cooperation-Controlled Learning for Explicit Class Structure in Self-Organizing Maps

PubMed Central

Kamimura, Ryotaro

2014-01-01

We attempt to demonstrate the effectiveness of multiple points of view toward neural networks. By restricting ourselves to two points of view of a neuron, we propose a new type of information-theoretic method called “cooperation-controlled learning.” In this method, individual and collective neurons are distinguished from one another, and we suppose that the characteristics of individual and collective neurons are different. To implement individual and collective neurons, we prepare two networks, namely, cooperative and uncooperative networks. The roles of these networks and the roles of individual and collective neurons are controlled by the cooperation parameter. As the parameter is increased, the role of cooperative networks becomes more important in learning, and the characteristics of collective neurons become more dominant. On the other hand, when the parameter is small, individual neurons play a more important role. We applied the method to the automobile and housing data from the machine learning database and examined whether explicit class boundaries could be obtained. Experimental results showed that cooperation-controlled learning, in particular taking into account information on input units, could be used to produce clearer class structure than conventional self-organizing maps. PMID:25309950

Coevolution of Cooperation and Partner Rewiring Range in Spatial Social Networks

NASA Astrophysics Data System (ADS)

Khoo, Tommy; Fu, Feng; Pauls, Scott

2016-11-01

In recent years, there has been growing interest in the study of coevolutionary games on networks. Despite much progress, little attention has been paid to spatially embedded networks, where the underlying geographic distance, rather than the graph distance, is an important and relevant aspect of the partner rewiring process. It thus remains largely unclear how individual partner rewiring range preference, local vs. global, emerges and affects cooperation. Here we explicitly address this issue using a coevolutionary model of cooperation and partner rewiring range preference in spatially embedded social networks. In contrast to local rewiring, global rewiring has no distance restriction but incurs a one-time cost upon establishing any long range link. We find that under a wide range of model parameters, global partner switching preference can coevolve with cooperation. Moreover, the resulting partner network is highly degree-heterogeneous with small average shortest path length while maintaining high clustering, thereby possessing small-world properties. We also discover an optimum availability of reputation information for the emergence of global cooperators, who form distant partnerships at a cost to themselves. From the coevolutionary perspective, our work may help explain the ubiquity of small-world topologies arising alongside cooperation in the real world.

Relational Diversity Promotes Cooperation in Prisoner’s Dilemma Games

PubMed Central

Xu, Bo; Wang, Jianwei; Deng, Ruipu; Li, Miao

2014-01-01

Relational diversity can be characterized by heterogeneous distributions of tie strengths in social networks and this diversity is present not only among humans, but throughout the animal world. We account for this observation by analyzing two network datasets from Facebook. We measure the strength of a tie by calculating the extent of overlap of friends between the two individuals. Based on the previous findings in human experiments, we argue that it is very unlikely that players will allocate their investments equally to their neighbors. There is a tendency that players prefer to donate more to their intimate friends. We find that if players preferentially allocate their investments to their good friends, cooperation will be promoted in PDG. We proved that the facilitation of the cooperative strategy relies mostly on the cooperative allies between best friends, resulting in the formation of cooperative clusters which are able to prevail against the defectors even when there is a large cost to cooperate. Moreover, we discover that the effect of relational diversity cannot be analyzed by adopting classical complex networks models, because neither of the artificial networks is able to produce networks with diverse distributions of tie strengths. It is of vital importance to introduce real social networks to study the influence of diverse relations especially when it comes to humans. This research proposes a brand new perspective to understand the influence of social relations on the emergence of cooperation in evolutionary prisoner’s dilemma games. PMID:25474354

Relational diversity promotes cooperation in prisoner's dilemma games.

PubMed

Xu, Bo; Wang, Jianwei; Deng, Ruipu; Li, Miao

2014-01-01

Relational diversity can be characterized by heterogeneous distributions of tie strengths in social networks and this diversity is present not only among humans, but throughout the animal world. We account for this observation by analyzing two network datasets from Facebook. We measure the strength of a tie by calculating the extent of overlap of friends between the two individuals. Based on the previous findings in human experiments, we argue that it is very unlikely that players will allocate their investments equally to their neighbors. There is a tendency that players prefer to donate more to their intimate friends. We find that if players preferentially allocate their investments to their good friends, cooperation will be promoted in PDG. We proved that the facilitation of the cooperative strategy relies mostly on the cooperative allies between best friends, resulting in the formation of cooperative clusters which are able to prevail against the defectors even when there is a large cost to cooperate. Moreover, we discover that the effect of relational diversity cannot be analyzed by adopting classical complex networks models, because neither of the artificial networks is able to produce networks with diverse distributions of tie strengths. It is of vital importance to introduce real social networks to study the influence of diverse relations especially when it comes to humans. This research proposes a brand new perspective to understand the influence of social relations on the emergence of cooperation in evolutionary prisoner's dilemma games.

Reputation drives cooperative behaviour and network formation in human groups.

PubMed

Cuesta, Jose A; Gracia-Lázaro, Carlos; Ferrer, Alfredo; Moreno, Yamir; Sánchez, Angel

2015-01-19

Cooperativeness is a defining feature of human nature. Theoreticians have suggested several mechanisms to explain this ubiquitous phenomenon, including reciprocity, reputation, and punishment, but the problem is still unsolved. Here we show, through experiments conducted with groups of people playing an iterated Prisoner's Dilemma on a dynamic network, that it is reputation what really fosters cooperation. While this mechanism has already been observed in unstructured populations, we find that it acts equally when interactions are given by a network that players can reconfigure dynamically. Furthermore, our observations reveal that memory also drives the network formation process, and cooperators assort more, with longer link lifetimes, the longer the past actions record. Our analysis demonstrates, for the first time, that reputation can be very well quantified as a weighted mean of the fractions of past cooperative acts and the last action performed. This finding has potential applications in collaborative systems and e-commerce.

Reputation drives cooperative behaviour and network formation in human groups

PubMed Central

Cuesta, Jose A.; Gracia-Lázaro, Carlos; Ferrer, Alfredo; Moreno, Yamir; Sánchez, Angel

2015-01-01

Cooperativeness is a defining feature of human nature. Theoreticians have suggested several mechanisms to explain this ubiquitous phenomenon, including reciprocity, reputation, and punishment, but the problem is still unsolved. Here we show, through experiments conducted with groups of people playing an iterated Prisoner's Dilemma on a dynamic network, that it is reputation what really fosters cooperation. While this mechanism has already been observed in unstructured populations, we find that it acts equally when interactions are given by a network that players can reconfigure dynamically. Furthermore, our observations reveal that memory also drives the network formation process, and cooperators assort more, with longer link lifetimes, the longer the past actions record. Our analysis demonstrates, for the first time, that reputation can be very well quantified as a weighted mean of the fractions of past cooperative acts and the last action performed. This finding has potential applications in collaborative systems and e-commerce. PMID:25598347

Impact of Social Punishment on Cooperative Behavior in Complex Networks

NASA Astrophysics Data System (ADS)

Wang, Zhen; Xia, Cheng-Yi; Meloni, Sandro; Zhou, Chang-Song; Moreno, Yamir

2013-10-01

Social punishment is a mechanism by which cooperative individuals spend part of their resources to penalize defectors. In this paper, we study the evolution of cooperation in 2-person evolutionary games on networks when a mechanism for social punishment is introduced. Specifically, we introduce a new kind of role, punisher, which is aimed at reducing the earnings of defectors by applying to them a social fee. Results from numerical simulations show that different equilibria allowing the three strategies to coexist are possible as well as that social punishment further enhance the robustness of cooperation. Our results are confirmed for different network topologies and two evolutionary games. In addition, we analyze the microscopic mechanisms that give rise to the observed macroscopic behaviors in both homogeneous and heterogeneous networks. Our conclusions might provide additional insights for understanding the roots of cooperation in social systems.

First Graders' Interpersonal Understanding during Cooperative and Competitive Games

ERIC Educational Resources Information Center

Zan, Betty; Hildebrandt, Carolyn

2003-01-01

Differences in children's social interactions during cooperative and competitive games were investigated. Thirty-seven children from two first grade classes with cooperative classroom climates were videotaped while playing a cooperative and a competitive board game. Children's social interactions were coded using Selman's Levels of Enacted…

78 FR 41088 - Solicitation for a Cooperative Agreement-Support Services for Community Services Division Networks

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-09

...--Support Services for Community Services Division Networks AGENCY: National Institute of Corrections, U.S... cooperative agreement will provide support services to NIC Community Services Division sponsored networks. The networks are designed for NIC to assist in meeting the needs of the field of community corrections by...

Mesoscopic structure conditions the emergence of cooperation on social networks

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

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

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 withmore » 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.« less

Human behavior in Prisoner's Dilemma experiments suppresses network reciprocity

NASA Astrophysics Data System (ADS)

Gracia-Lázaro, Carlos; Cuesta, José A.; Sánchez, Angel; Moreno, Yamir

2012-03-01

During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks, the observed level of cooperation is the same. We thus show that when human subjects interact in a heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population.

Cooperation Improves Success during Intergroup Competition: An Analysis Using Data from Professional Soccer Tournaments.

PubMed

David, Gwendolyn Kim; Wilson, Robbie Stuart

2015-01-01

The benefit mutually gained by cooperators is considered the ultimate explanation for why cooperation evolved among non-relatives. During intergroup competition, cooperative behaviours within groups that provide a competitive edge over their opposition should be favoured by selection, particularly in lethal human warfare. Aside from forming larger groups, three other ways that individuals within a group can cooperate to improve their chances of gaining a mutual benefit are: (i) greater networking, (ii) contributing more effort, and (iii) dividing labour. Greater cooperation is expected to increase the chances of gaining a group benefit by improving proficiency in the tasks critical to success-yet empirical tests of this prediction using real-world cases are absent. In this study, we used data derived from 12 international and professional soccer competitions to test the predictions that: 1) greater levels of cooperative behaviour are associated with winning group contests, 2) the three forms of cooperation differ in relative importance for winning matches, 3) competition and tournament-type affect the levels of cooperation and shooting proficiency in matches, and 4) greater levels of networking behaviour are associated with increased proficiency in the most critical task linked with winning success in soccer-shooting at goal. Winners were best predicted by higher shooting proficiency, followed by greater frequencies of networking interactions within a team but unexpectedly, fewer networking partners and less division of labour. Although significant variation was detected across competitions and tournament-types, greater levels of networking behaviour were consistently associated with increased proficiency in shooting at goal, which in turn was linked with winning success. This study empirically supports the idea that intergroup competition can favour cooperation among non-relatives.

Benefits of Cooperative Learning in Weblog Networks

ERIC Educational Resources Information Center

Wang, Jenny; Fang, Yuehchiu

2005-01-01

The purpose of this study was to explore the benefits of cooperative learning in weblog networks, focusing particularly on learning outcomes in college writing curriculum integrated with computer-mediated learning tool-weblog. The first section addressed the advantages of using weblogs in cooperative learning structure on teaching and learning.…

1 CFR 8.7 - Agency cooperation.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 1 General Provisions 1 2011-01-01 2011-01-01 false Agency cooperation. 8.7 Section 8.7 General Provisions ADMINISTRATIVE COMMITTEE OF THE FEDERAL REGISTER SPECIAL EDITIONS OF THE FEDERAL REGISTER CODE OF FEDERAL REGULATIONS § 8.7 Agency cooperation. Each agency shall cooperate in keeping publication of the...

1 CFR 8.7 - Agency cooperation.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 1 General Provisions 1 2010-01-01 2010-01-01 false Agency cooperation. 8.7 Section 8.7 General Provisions ADMINISTRATIVE COMMITTEE OF THE FEDERAL REGISTER SPECIAL EDITIONS OF THE FEDERAL REGISTER CODE OF FEDERAL REGULATIONS § 8.7 Agency cooperation. Each agency shall cooperate in keeping publication of the...

1 CFR 8.7 - Agency cooperation.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 1 General Provisions 1 2013-01-01 2012-01-01 true Agency cooperation. 8.7 Section 8.7 General Provisions ADMINISTRATIVE COMMITTEE OF THE FEDERAL REGISTER SPECIAL EDITIONS OF THE FEDERAL REGISTER CODE OF FEDERAL REGULATIONS § 8.7 Agency cooperation. Each agency shall cooperate in keeping publication of the...

1 CFR 8.7 - Agency cooperation.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 1 General Provisions 1 2012-01-01 2012-01-01 false Agency cooperation. 8.7 Section 8.7 General Provisions ADMINISTRATIVE COMMITTEE OF THE FEDERAL REGISTER SPECIAL EDITIONS OF THE FEDERAL REGISTER CODE OF FEDERAL REGULATIONS § 8.7 Agency cooperation. Each agency shall cooperate in keeping publication of the...

1 CFR 8.7 - Agency cooperation.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 1 General Provisions 1 2014-01-01 2012-01-01 true Agency cooperation. 8.7 Section 8.7 General Provisions ADMINISTRATIVE COMMITTEE OF THE FEDERAL REGISTER SPECIAL EDITIONS OF THE FEDERAL REGISTER CODE OF FEDERAL REGULATIONS § 8.7 Agency cooperation. Each agency shall cooperate in keeping publication of the...

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

NASA Astrophysics Data System (ADS)

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

2016-05-01

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

Cooperation, social networks, and the emergence of leadership in a prisoner's dilemma with adaptive local interactions

NASA Astrophysics Data System (ADS)

Zimmermann, Martín G.; Eguíluz, Víctor M.

2005-11-01

Cooperative behavior among a group of agents is studied assuming adaptive interactions. Each agent plays a Prisoner’s Dilemma game with its local neighbors, collects an aggregate payoff, and imitates the strategy of its best neighbor. Agents may punish or reward their neighbors by removing or sustaining the interactions, according to their satisfaction level and strategy played. An agent may dismiss an interaction, and the corresponding neighbor is replaced by another randomly chosen agent, introducing diversity and evolution to the network structure. We perform an extensive numerical and analytical study, extending results in M. G. Zimmermann, V. M. Eguíluz, and M. San Miguel, Phys. Rev. E 69, 065102(R) (2004). We show that the system typically reaches either a full-defective state or a highly cooperative steady state. The latter equilibrium solution is composed mostly by cooperative agents, with a minor population of defectors that exploit the cooperators. It is shown how the network adaptation dynamics favors the emergence of cooperators with the highest payoff. These “leaders” are shown to sustain the global cooperative steady state. Also we find that the average payoff of defectors is larger than the average payoff of cooperators. Whenever “leaders” are perturbed (e.g., by addition of noise), an unstable situation arises and global cascades with oscillations between the nearly full defection network and the fully cooperative outcome are observed.

The expansion of neighborhood and pattern formation on spatial prisoner's dilemma

NASA Astrophysics Data System (ADS)

Qian, Xiaolan; Xu, Fangqian; Yang, Junzhong; Kurths, Jürgen

2015-04-01

The prisoner's dilemma (PD), in which players can either cooperate or defect, is considered a paradigm for studying the evolution of cooperation in spatially structured populations. There the compact cooperator cluster is identified as a characteristic pattern and the probability of forming such pattern in turn depends on the features of the networks. In this paper, we investigate the influence of expansion of neighborhood on pattern formation by taking a weak PD game with one free parameter T, the temptation to defect. Two different expansion methods of neighborhood are considered. One is based on a square lattice and expanses along four directions generating networks with degree increasing with K = 4 m . The other is based on a lattice with Moore neighborhood and expanses along eight directions, generating networks with degree of K = 8 m . Individuals are placed on the nodes of the networks, interact with their neighbors and learn from the better one. We find that cooperator can survive for a broad degree 4 ≤ K ≤ 70 by taking a loose type of cooperator clusters. The former simple corresponding relationship between macroscopic patterns and the microscopic PD interactions is broken. Under a condition that is unfavorable for cooperators such as large T and K, systems prefer to evolve to a loose type of cooperator clusters to support cooperation. However, compared to the well-known compact pattern, it is a suboptimal strategy because it cannot help cooperators dominating the population and always corresponding to a low cooperation level.

DEADS: Depth and Energy Aware Dominating Set Based Algorithm for Cooperative Routing along with Sink Mobility in Underwater WSNs.

PubMed

Umar, Amara; Javaid, Nadeem; Ahmad, Ashfaq; Khan, Zahoor Ali; Qasim, Umar; Alrajeh, Nabil; Hayat, Amir

2015-06-18

Performance enhancement of Underwater Wireless Sensor Networks (UWSNs) in terms of throughput maximization, energy conservation and Bit Error Rate (BER) minimization is a potential research area. However, limited available bandwidth, high propagation delay, highly dynamic network topology, and high error probability leads to performance degradation in these networks. In this regard, many cooperative communication protocols have been developed that either investigate the physical layer or the Medium Access Control (MAC) layer, however, the network layer is still unexplored. More specifically, cooperative routing has not yet been jointly considered with sink mobility. Therefore, this paper aims to enhance the network reliability and efficiency via dominating set based cooperative routing and sink mobility. The proposed work is validated via simulations which show relatively improved performance of our proposed work in terms the selected performance metrics.

Spatially correlated heterogeneous aspirations to enhance network reciprocity

NASA Astrophysics Data System (ADS)

Tanimoto, Jun; Nakata, Makoto; Hagishima, Aya; Ikegaya, Naoki

2012-02-01

Perc & Wang demonstrated that aspiring to be the fittest under conditions of pairwise strategy updating enhances network reciprocity in structured populations playing 2×2 Prisoner's Dilemma games (Z. Wang, M. Perc, Aspiring to the fittest and promoted of cooperation in the Prisoner's Dilemma game, Physical Review E 82 (2010) 021115; M. Perc, Z. Wang, Heterogeneous aspiration promotes cooperation in the Prisoner's Dilemma game, PLOS one 5 (12) (2010) e15117). Through numerical simulations, this paper shows that network reciprocity is even greater if heterogeneous aspirations are imposed. We also suggest why heterogeneous aspiration fosters network reciprocity. It distributes strategy updating speed among agents in a manner that fortifies the initially allocated cooperators' clusters against invasion. This finding prompted us to further enhance the usual heterogeneous aspiration cases for heterogeneous network topologies. We find that a negative correlation between degree and aspiration level does extend cooperation among heterogeneously structured agents.

Transparency in Cooperative Online Education

ERIC Educational Resources Information Center

Dalsgaard, Christian; Paulsen, Morten Flate

2009-01-01

The purpose of this article is to discuss the following question: What is the potential of social networking within cooperative online education? Social networking does not necessarily involve communication, dialogue, or collaboration. Instead, the authors argue that "transparency" is a unique feature of social networking services.…

Outage Performance Analysis of Relay Selection Schemes in Wireless Energy Harvesting Cooperative Networks over Non-Identical Rayleigh Fading Channels †

PubMed Central

Do, Nhu Tri; Bao, Vo Nguyen Quoc; An, Beongku

2016-01-01

In this paper, we study relay selection in decode-and-forward wireless energy harvesting cooperative networks. In contrast to conventional cooperative networks, the relays harvest energy from the source’s radio-frequency radiation and then use that energy to forward the source information. Considering power splitting receiver architecture used at relays to harvest energy, we are concerned with the performance of two popular relay selection schemes, namely, partial relay selection (PRS) scheme and optimal relay selection (ORS) scheme. In particular, we analyze the system performance in terms of outage probability (OP) over independent and non-identical (i.n.i.d.) Rayleigh fading channels. We derive the closed-form approximations for the system outage probabilities of both schemes and validate the analysis by the Monte-Carlo simulation. The numerical results provide comprehensive performance comparison between the PRS and ORS schemes and reveal the effect of wireless energy harvesting on the outage performances of both schemes. Additionally, we also show the advantages and drawbacks of the wireless energy harvesting cooperative networks and compare to the conventional cooperative networks. PMID:26927119

Outage Performance Analysis of Relay Selection Schemes in Wireless Energy Harvesting Cooperative Networks over Non-Identical Rayleigh Fading Channels.

PubMed

Do, Nhu Tri; Bao, Vo Nguyen Quoc; An, Beongku

2016-02-26

In this paper, we study relay selection in decode-and-forward wireless energy harvesting cooperative networks. In contrast to conventional cooperative networks, the relays harvest energy from the source's radio-frequency radiation and then use that energy to forward the source information. Considering power splitting receiver architecture used at relays to harvest energy, we are concerned with the performance of two popular relay selection schemes, namely, partial relay selection (PRS) scheme and optimal relay selection (ORS) scheme. In particular, we analyze the system performance in terms of outage probability (OP) over independent and non-identical (i.n.i.d.) Rayleigh fading channels. We derive the closed-form approximations for the system outage probabilities of both schemes and validate the analysis by the Monte-Carlo simulation. The numerical results provide comprehensive performance comparison between the PRS and ORS schemes and reveal the effect of wireless energy harvesting on the outage performances of both schemes. Additionally, we also show the advantages and drawbacks of the wireless energy harvesting cooperative networks and compare to the conventional cooperative networks.

Networking for English Literature Class: Cooperative Learning in Chinese Context

ERIC Educational Resources Information Center

Li, Huiyin

2017-01-01

This action research was conducted to investigate the efficacy of networking, an adjusted cooperative learning method employed in an English literature class for non-English majors in China. Questionnaire was administered online anonymously to college students after a 14-week cooperative learning in literature class in a Chinese university, aiming…

Cooperation dynamics of generalized reciprocity in state-based social dilemmas

NASA Astrophysics Data System (ADS)

Stojkoski, Viktor; Utkovski, Zoran; Basnarkov, Lasko; Kocarev, Ljupco

2018-05-01

We introduce a framework for studying social dilemmas in networked societies where individuals follow a simple state-based behavioral mechanism based on generalized reciprocity, which is rooted in the principle "help anyone if helped by someone." Within this general framework, which applies to a wide range of social dilemmas including, among others, public goods, donation, and snowdrift games, we study the cooperation dynamics on a variety of complex network examples. By interpreting the studied model through the lenses of nonlinear dynamical systems, we show that cooperation through generalized reciprocity always emerges as the unique attractor in which the overall level of cooperation is maximized, while simultaneously exploitation of the participating individuals is prevented. The analysis elucidates the role of the network structure, here captured by a local centrality measure which uniquely quantifies the propensity of the network structure to cooperation by dictating the degree of cooperation displayed both at the microscopic and macroscopic level. We demonstrate the applicability of the analysis on a practical example by considering an interaction structure that couples a donation process with a public goods game.

Wireless Network Cocast: Cooperative Communications with Space-Time Network Coding

DTIC Science & Technology

2011-04-21

P̃rk =    Prk if Rr decodes xk correctly 0 otherwise (2.4) for the case of DF and P̃rk = PrkPkk|hrk|2 Pkk|hrk|2 + N0 (2.5) for the case of AF and...w0r(t) is zero-mean and N0f0r-variance AWGN, where f0r =    1 for DF 1 + ∑N k=1 Prk |h0r|2 Pkk|hrk|2+N0 for AF (2.6) is a factor representing...2 Pkk|hr0|2 + N0 (2.10) for the case of AF and wnr(t) is zero-mean and N0fnr-variance AWGN, where fnr =    1 for DF 1 + ∑N k=1 Prk |hnr|2 Pkk

Optical network security using unipolar Walsh code

NASA Astrophysics Data System (ADS)

Sikder, Somali; Sarkar, Madhumita; Ghosh, Shila

2018-04-01

Optical code-division multiple-access (OCDMA) is considered as a good technique to provide optical layer security. Many research works have been published to enhance optical network security by using optical signal processing. The paper, demonstrates the design of the AWG (arrayed waveguide grating) router-based optical network for spectral-amplitude-coding (SAC) OCDMA networks with Walsh Code to design a reconfigurable network codec by changing signature codes to against eavesdropping. In this paper we proposed a code reconfiguration scheme to improve the network access confidentiality changing the signature codes by cyclic rotations, for OCDMA system. Each of the OCDMA network users is assigned a unique signature code to transmit the information and at the receiving end each receiver correlates its own signature pattern a(n) with the receiving pattern s(n). The signal arriving at proper destination leads to s(n)=a(n).

Properties of four real world collaboration--competition networks

NASA Astrophysics Data System (ADS)

Fu, Chun-Hua; Xu, Xiu-Lian; He, Da-Ren

2009-03-01

Our research group has empirically investigated 9 real world collaboration networks and 25 real world cooperation-competition networks. Among the 34 real world systems, all the 9 real world collaboration networks and 6 real world cooperation-competition networks show the unimodal act-size distribution and the shifted power law distribution of degree and act-degree. We have proposed a collaboration network evolution model for an explanation of the rules [1]. The other 14 real world cooperation-competition networks show that the act-size distributions are not unimodal; instead, they take qualitatively the same shifted power law forms as the degree and act-degree distributions. The properties of four systems (the main land movie film network, Beijing restaurant network, 2004 Olympic network, and Tao-Bao notebook computer sale network) are reported in detail as examples. Via a numerical simulation, we show that the new rule can still be explained by the above-mentioned model. [1] H. Chang, B. B. Su, et al. Phsica A, 2007, 383: 687-702.

Entanglement guarantees emergence of cooperation in quantum prisoner's dilemma games on networks.

PubMed

Li, Angsheng; Yong, Xi

2014-09-05

It was known that cooperation of evolutionary prisoner's dilemma games fails to emerge in homogenous networks such as random graphs. Here we proposed a quantum prisoner's dilemma game. The game consists of two players, in which each player has three choices of strategy: cooperator (C), defector (D) and super cooperator (denoted by Q). We found that quantum entanglement guarantees emergence of a new cooperation, the super cooperation of the quantum prisoner's dilemma games, and that entanglement is the mechanism of guaranteed emergence of cooperation of evolutionary prisoner's dilemma games on networks. We showed that for a game with temptation b, there exists a threshold arccos √b/b for a measurement of entanglement, beyond which, (super) cooperation of evolutionary quantum prisoner's dilemma games is guaranteed to quickly emerge, giving rise to stochastic convergence of the cooperations, that if the entanglement degree γ is less than the threshold arccos √b/b, then the equilibrium frequency of cooperations of the games is positively correlated to the entanglement degree γ, and that if γ is less than arccos √b/b and b is beyond some boundary, then the equilibrium frequency of cooperations of the games on random graphs decreases as the average degree of the graphs increases.

Leveraging Statistical Physics to Improve Understanding of Cooperation in Multiplex Networks.

PubMed

Fu, Feng; Chen, Xingru

2017-07-01

Understanding how public cooperation emerges and is maintained is a topic of broad interest, with increasing contributions coming from a synergistic combination of evolutionary game theory and statistical physics. The comprehensive study by Battiston et al (2017 New J. Phys. , in press) improves our understanding of the role of multiplexity in cooperation, revealing that a significant edge overlap across network layers along with benign conditions for cooperation in at least one of the layers is needed to facilitate the emergence of cooperation in the multiplex.

[Study on dilemma and strategy of community support network by community organization for prevention of isolated death in an urban area].

PubMed

Masuda, Yuzuri; Tadaka, Etsuko; Dai, Yuka; Itoi, Waka; Taguchi, Rie; Kawahara, Chie

2011-12-01

Isolated death of elderly is recognized as a severe social problem in public health and it is an urgent requirement that a supportive community network be organized so that its occurrence is minimized. The purpose of this research was to analyze actual issues of a supportive community network for elderly within the community and to obtain clues for useful actions to prevent isolated death of elderly individuals in the future. The subjects were 14 representatives of a supportive community network for elderly in A City, B Ward and C District (as a junior high school segment). The research was conducted with a qualitative inductively approach using the Focus Group Interview (FGI). Interviews were focused on difficulties and perspectives within their daily support activities in the community, and were held three times during October 2009 to March 2010. The FGI records were then analyzed with meaningful minimal words and sentences, categorized codes, and then those codes were classified into subcategories or categories. Three categories, Individual, Neighborhood and Community network for elderly resulted from the analysis. Regarding difficulties, "Refusing supports or indifference", "Isolation or Tojikomori in the youth generation", "Lack of family support", "Relationships among their residents weakening gradually", "Unfamiliar newcomers and residents", "Residence feels burden on association with neighborhood", "Limitation of support activities under personal security", "Lack of resources for persons and places of gathering" were identified. On the other hand, perspectives in the community network for elderly were "Building relationships personally", "Invitation to community meetings as companions", "Development of safety confirmation", "Helping each other in the neighborhood", "Stimulate enforcement of bonding in daily life", "Making arrangements for regional administration and residents for supportive activites", "Fostering the trust and connection of residence". To further promotion and effective activities for community network for elderly by community residents, it is necessary that information be exchanged among resident organizations regarding their activities in achievement of social cooperation.

Chinese Mainland Movie Network

NASA Astrophysics Data System (ADS)

Liu, Ai-Fen; Xue, Yu-Hua; He, Da-Ren

2008-03-01

We propose describing a large kind of cooperation-competition networks by bipartite graphs and their unipartite projections. In the graphs the topological structure describe the cooperation-competition configuration of the basic elements, and the vertex weight describe their different roles in cooperation or results of competition. This complex network description may be helpful for finding and understanding common properties of cooperation-competition systems. In order to show an example, we performed an empirical investigation on the movie cooperation-competition network within recent 80 years in the Chinese mainland. In the net the movies are defined as nodes, and two nodes are connected by a link if a common main movie actor performs in them. The edge represents the competition relationship between two movies for more audience among a special audience colony. We obtained the statistical properties, such as the degree distribution, act degree distribution, act size distribution, and distribution of the total node weight, and explored the influence factors of Chinese mainland movie competition intensity.

Emergent behaviors of the Schrödinger-Lohe model on cooperative-competitive networks

NASA Astrophysics Data System (ADS)

Huh, Hyungjin; Ha, Seung-Yeal; Kim, Dohyun

2017-12-01

We present several sufficient frameworks leading to the emergent behaviors of the coupled Schrödinger-Lohe (S-L) model under the same one-body external potential on cooperative-competitive networks. The S-L model was first introduced as a possible phenomenological model exhibiting quantum synchronization and its emergent dynamics on all-to-all cooperative networks has been treated via two distinct approaches, Lyapunov functional approach and the finite-dimensional reduction based on pairwise correlations. In this paper, we further generalize the finite-dimensional dynamical systems approach for pairwise correlation functions on cooperative-competitive networks and provide several sufficient frameworks leading to the collective exponential synchronization. For small systems consisting of three and four quantum subsystem, we also show that the system for pairwise correlations can be reduced to the Lotka-Volterra model with cooperative and competitive interactions, in which lots of interesting dynamical patterns appear, e.g., existence of closed orbits and limit-cycles.

Network analysis for the visualization and analysis of qualitative data.

PubMed

Pokorny, Jennifer J; Norman, Alex; Zanesco, Anthony P; Bauer-Wu, Susan; Sahdra, Baljinder K; Saron, Clifford D

2018-03-01

We present a novel manner in which to visualize the coding of qualitative data that enables representation and analysis of connections between codes using graph theory and network analysis. Network graphs are created from codes applied to a transcript or audio file using the code names and their chronological location. The resulting network is a representation of the coding data that characterizes the interrelations of codes. This approach enables quantification of qualitative codes using network analysis and facilitates examination of associations of network indices with other quantitative variables using common statistical procedures. Here, as a proof of concept, we applied this method to a set of interview transcripts that had been coded in 2 different ways and the resultant network graphs were examined. The creation of network graphs allows researchers an opportunity to view and share their qualitative data in an innovative way that may provide new insights and enhance transparency of the analytical process by which they reach their conclusions. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Social Networks-Based Adaptive Pairing Strategy for Cooperative Learning

ERIC Educational Resources Information Center

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

2012-01-01

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

Dynamic Network Selection for Multicast Services in Wireless Cooperative Networks

NASA Astrophysics Data System (ADS)

Chen, Liang; Jin, Le; He, Feng; Cheng, Hanwen; Wu, Lenan

In next generation mobile multimedia communications, different wireless access networks are expected to cooperate. However, it is a challenging task to choose an optimal transmission path in this scenario. This paper focuses on the problem of selecting the optimal access network for multicast services in the cooperative mobile and broadcasting networks. An algorithm is proposed, which considers multiple decision factors and multiple optimization objectives. An analytic hierarchy process (AHP) method is applied to schedule the service queue and an artificial neural network (ANN) is used to improve the flexibility of the algorithm. Simulation results show that by applying the AHP method, a group of weight ratios can be obtained to improve the performance of multiple objectives. And ANN method is effective to adaptively adjust weight ratios when users' new waiting threshold is generated.

The Effect of Geographical Proximity on Scientific Cooperation among Chinese Cities from 1990 to 2010

PubMed Central

Ma, Haitao; Fang, Chuanglin; Pang, Bo; Li, Guangdong

2014-01-01

Background The relations between geographical proximity and spatial distance constitute a popular topic of concern. Thus, how geographical proximity affects scientific cooperation, and whether geographically proximate scientific cooperation activities in fact exhibit geographic scale features should be investigated. Methodology Selected statistics from the ISI database on cooperatively authored papers, the authors of which resided in 60 typical cites in China, and which were published in the years 1990, 1995, 2000, 2005, and 2010, were used to establish matrices of geographic distance and cooperation levels between cities. By constructing a distance-cooperation model, the degree of scientific cooperation based on spatial distance was calculated. The relationship between geographical proximity and scientific cooperation, as well as changes in that relationship, was explored using the fitting function. Result (1) Instead of declining, the role of geographical proximity in inter-city scientific cooperation has increased gradually but significantly with the popularization of telecommunication technologies; (2) the relationship between geographical proximity and scientific cooperation has not followed a perfect declining curve, and at certain spatial scales, the distance-decay regularity does not work; (3) the Chinese scientific cooperation network gathers around different regional center cities, showing a trend towards a regional network; within this cooperation network the amount of inter-city cooperation occurring at close range increased greatly. Conclusion The relationship between inter-city geographical distance and scientific cooperation has been enhanced and strengthened over time. PMID:25365449

NCI’s Cooperative Human Tissue Network

Cancer.gov

Quality biospecimens are a foundational resource for cancer research. One of NCI’s longest running biospecimen programs is the Cooperative Human Tissue Network, a resource mainly for basic discovery and early translational research.

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

NASA Astrophysics Data System (ADS)

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.

QoS and energy aware cooperative routing protocol for wildfire monitoring wireless sensor networks.

PubMed

Maalej, Mohamed; Cherif, Sofiane; Besbes, Hichem

2013-01-01

Wireless sensor networks (WSN) are presented as proper solution for wildfire monitoring. However, this application requires a design of WSN taking into account the network lifetime and the shadowing effect generated by the trees in the forest environment. Cooperative communication is a promising solution for WSN which uses, at each hop, the resources of multiple nodes to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modeling, optimizing a cooperative communication protocol based on RSSI and node energy consumption in a competitive context (RSSI/energy-CC), that is, an energy and quality-of-service aware-based cooperative communication routing protocol. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.

Effects of adaptive dynamical linking in networked games

NASA Astrophysics Data System (ADS)

Yang, Zhihu; Li, Zhi; Wu, Te; Wang, Long

2013-10-01

The role of dynamical topologies in the evolution of cooperation has received considerable attention, as some studies have demonstrated that dynamical networks are much better than static networks in terms of boosting cooperation. Here we study a dynamical model of evolution of cooperation on stochastic dynamical networks in which there are no permanent partners to each agent. Whenever a new link is created, its duration is randomly assigned without any bias or preference. We allow the agent to adaptively adjust the duration of each link during the evolution in accordance with the feedback from game interactions. By Monte Carlo simulations, we find that cooperation can be remarkably promoted by this adaptive dynamical linking mechanism both for the game of pairwise interactions, such as the Prisoner's Dilemma game (PDG), and for the game of group interactions, illustrated by the public goods game (PGG). And the faster the adjusting rate, the more successful the evolution of cooperation. We also show that in this context weak selection favors cooperation much more than strong selection does. What is particularly meaningful is that the prosperity of cooperation in this study indicates that the rationality and selfishness of a single agent in adjusting social ties can lead to the progress of altruism of the whole population.

[Leukemia research in Germany: the Competence Network Acute and Chronic Leukemias].

PubMed

Kossak-Roth, Ute; Saußele, Susanne; Aul, Carlo; Büchner, Thomas; Döhner, Hartmut; Dugas, Martin; Ehninger, Gerhard; Ganser, Arnold; Giagounidis, Aristoteles; Gökbuget, Nicola; Griesshammer, Martin; Hasford, Jörg; Heuser, Michael; Hiddemann, Wolfgang; Hochhaus, Andreas; Hoelzer, Dieter; Niederwieser, Dietger; Reiter, Andreas; Röllig, Christoph; Hehlmann, Rüdiger

2016-04-01

The Competence Network "Acute and Chronic Leukemias" was founded in 1997 by the consolidation of the leading leukemia study groups in Germany. Key results are the development of new trials and cooperative studies, the setup of patient registries and biobanking facilities, as well as the improvement of study infrastructure. In 2003, the concept of the competence network contributed to the foundation of the European LeukemiaNet (ELN). Synergy with the ELN resulted in cooperation on a European and international level, standardization of diagnostics and treatment, and recommendations for each leukemia and interdisciplinary specialty. The ultimate goal of the network is the cure of leukemia through cooperative research.

76 FR 53492 - South Carolina Public Service Authority (Also Referred to as Santee Cooper); Combined Licenses...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-26

... Carolina Public Service Authority (Also Referred to as Santee Cooper); Combined Licenses for Virgil C... as Santee Cooper), for two Title 10 of the Code of Federal Regulations (10 CFR) part 52 combined... Service Authority (Also Referred to as Santee Cooper) Application for the Virgil C. Summer Nuclear Station...

How the initial level of visibility and limited resource affect the evolution of cooperation

NASA Astrophysics Data System (ADS)

Han, Dun; Li, Dandan; Sun, Mei

2016-06-01

This work sheds important light on how the initial level of visibility and limited resource might affect the evolution of the players’ strategies under different network structure. We perform the prisoner’s dilemma game in the lattice network and the scale-free network, the simulation results indicate that the average density of death in lattice network decreases with the increases of the initial proportion of visibility. However, the contrary phenomenon is observed in the scale-free network. Further results reflect that the individuals’ payoff in lattice network is significantly larger than the one in the scale-free network. In the lattice network, the visibility individuals could earn much more than the invisibility one. However, the difference is not apparent in the scale-free network. We also find that a high Successful-Defection-Payoff (SDB) and a rich natural environment have relatively larger deleterious cooperation effects. A high SDB is beneficial to raising the level of visibility in the heterogeneous network, however, that has adverse visibility consequences in homogeneous network. Our result reveals that players are more likely to cooperate voluntarily under homogeneous network structure.

Promotion of cooperation induced by appropriate payoff aspirations in a small-world networked game

NASA Astrophysics Data System (ADS)

Chen, Xiaojie; Wang, Long

2008-01-01

Based on learning theory, we adopt a stochastic learning updating rule to investigate the evolution of cooperation in the Prisoner’s Dilemma game on Newman-Watts small-world networks with different payoff aspiration levels. Interestingly, simulation results show that the mechanism of intermediate aspiration promoting cooperation resembles a resonancelike behavior, and there exists a ping-pong vibration of cooperation for large payoff aspiration. To explain the nontrivial dependence of the cooperation level on the aspiration level, we investigate the fractions of links, provide analytical results of the cooperation level, and find that the simulation results are in close agreement with analytical ones. Our work may be helpful in understanding the cooperative behavior induced by the aspiration level in society.

Assortative and dissortative priorities for game interaction and strategy adaptation significantly bolster network reciprocity in the prisoner’s dilemma

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2014-05-01

In 2 × 2 prisoner’s dilemma games, network reciprocity is one mechanism for adding social viscosity, which leads to cooperative equilibrium. Here we show that combining the process for selecting a gaming partner with the process for selecting an adaptation partner significantly enhances cooperation, even though such selection processes require additional costs to collect further information concerning which neighbor should be chosen. Based on elaborate investigations of the dynamics generated by our model, we find that high levels of cooperation result from two kinds of behavior: cooperators tend to interact with cooperators to prevent being exploited by defectors and defectors tend to choose cooperators to exploit despite the possibility that some defectors convert to cooperators.

Preparation of Professional Training Teachers for Network Cooperation between Educational Establishments during Labor Preparation

ERIC Educational Resources Information Center

Tarasjuk, Olga V.; Fedulova, Ksenia A.; Fedulova, Marina A.; Kryukova, Polina S.; Yadretsov, Vyacheslav ?.

2016-01-01

Relevance of the problem being investigated is conditioned by the necessity to arrange network cooperation between educational institutions during labor force preparation in the conditions of informatization of educational and technological processes. The aim of the article is to prove the necessity of including basics of network cooperation…

Simultaneous multi-patch-clamp and extracellular-array recordings: Single neuron reflects network activity.

PubMed

Vardi, Roni; Goldental, Amir; Sardi, Shira; Sheinin, Anton; Kanter, Ido

2016-11-08

The increasing number of recording electrodes enhances the capability of capturing the network's cooperative activity, however, using too many monitors might alter the properties of the measured neural network and induce noise. Using a technique that merges simultaneous multi-patch-clamp and multi-electrode array recordings of neural networks in-vitro, we show that the membrane potential of a single neuron is a reliable and super-sensitive probe for monitoring such cooperative activities and their detailed rhythms. Specifically, the membrane potential and the spiking activity of a single neuron are either highly correlated or highly anti-correlated with the time-dependent macroscopic activity of the entire network. This surprising observation also sheds light on the cooperative origin of neuronal burst in cultured networks. Our findings present an alternative flexible approach to the technique based on a massive tiling of networks by large-scale arrays of electrodes to monitor their activity.

Optimal interdependence between networks for the evolution of cooperation.

PubMed

Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

2013-01-01

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality.

Optimal interdependence between networks for the evolution of cooperation

PubMed Central

Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

2013-01-01

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality. PMID:23959086

Cooperative optimization and their application in LDPC codes

NASA Astrophysics Data System (ADS)

Chen, Ke; Rong, Jian; Zhong, Xiaochun

2008-10-01

Cooperative optimization is a new way for finding global optima of complicated functions of many variables. The proposed algorithm is a class of message passing algorithms and has solid theory foundations. It can achieve good coding gains over the sum-product algorithm for LDPC codes. For (6561, 4096) LDPC codes, the proposed algorithm can achieve 2.0 dB gains over the sum-product algorithm at BER of 4×10-7. The decoding complexity of the proposed algorithm is lower than the sum-product algorithm can do; furthermore, the former can achieve much lower error floor than the latter can do after the Eb / No is higher than 1.8 dB.

Cooperative Energy Harvesting-Adaptive MAC Protocol for WBANs

PubMed Central

Esteves, Volker; Antonopoulos, Angelos; Kartsakli, Elli; Puig-Vidal, Manel; Miribel-Català, Pere; Verikoukis, Christos

2015-01-01

In this paper, we introduce a cooperative medium access control (MAC) protocol, named cooperative energy harvesting (CEH)-MAC, that adapts its operation to the energy harvesting (EH) conditions in wireless body area networks (WBANs). In particular, the proposed protocol exploits the EH information in order to set an idle time that allows the relay nodes to charge their batteries and complete the cooperation phase successfully. Extensive simulations have shown that CEH-MAC significantly improves the network performance in terms of throughput, delay and energy efficiency compared to the cooperative operation of the baseline IEEE 802.15.6 standard. PMID:26029950

Intelligent Cooperative MAC Protocol for Balancing Energy Consumption

NASA Astrophysics Data System (ADS)

Wu, S.; Liu, K.; Huang, B.; Liu, F.

To extend the lifetime of wireless sensor networks, we proposed an intelligent balanced energy consumption cooperative MAC protocol (IBEC-CMAC) based on the multi-node cooperative transmission model. The protocol has priority to access high-quality channels for reducing energy consumption of each transmission. It can also balance the energy consumption among cooperative nodes by using high residual energy nodes instead of excessively consuming some node's energy. Simulation results show that IBEC-CMAC can obtain longer network lifetime and higher energy utilization than direct transmission.

A Comparative Study on Cooperative Learning in Multimedia and Network Environment Used by English Majors between China Mainland and Taiwan

ERIC Educational Resources Information Center

Xue, Gong; Lingling, Liu

2018-01-01

This paper first based on the theory of cooperative learning research. It analyses the characteristics and advantages of cooperative learning under the multimedia network environment. And then take China Three Gorges University and Taiwan I-Shou University English major students for example, using questionnaires and interviews to investigate the…

Adaptable Network Cooperate Catalog for Complex Information Objects. From Single Library to a Consortium: Sharing the Management and Distribution of Information Resources.

ERIC Educational Resources Information Center

Morag, Azriel

Libraries faced with the challenge of cooperative cataloging must maintain a high degree of unification within the library network (consortium) without compromising local libraries' independence. This paper compares a traditional model for cooperative catalogs achieved by means of a Union Catalog that depends entirely on replication of data…

Effective seeding strategy in evolutionary prisoner's dilemma games on online social networks

NASA Astrophysics Data System (ADS)

Xu, Bo; Shi, Huibin; Wang, Jianwei; Huang, Yun

2015-04-01

This paper explores effective seeding strategies in prisoner's dilemma game (PDG) on online social networks, i.e. the optimal strategy to obtain global cooperation with minimum cost. Three distinct seeding strategies are compared by performing computer simulations on real online social network datasets. Our finding suggests that degree centrality seeding outperforms other strategies regardless of the initial payoff setting or network size. Celebrities of online social networks play key roles in preserving cooperation.

Dynamics, morphogenesis and convergence of evolutionary quantum Prisoner's Dilemma games on networks

PubMed Central

Yong, Xi

2016-01-01

The authors proposed a quantum Prisoner's Dilemma (PD) game as a natural extension of the classic PD game to resolve the dilemma. Here, we establish a new Nash equilibrium principle of the game, propose the notion of convergence and discover the convergence and phase-transition phenomena of the evolutionary games on networks. We investigate the many-body extension of the game or evolutionary games in networks. For homogeneous networks, we show that entanglement guarantees a quick convergence of super cooperation, that there is a phase transition from the convergence of defection to the convergence of super cooperation, and that the threshold for the phase transitions is principally determined by the Nash equilibrium principle of the game, with an accompanying perturbation by the variations of structures of networks. For heterogeneous networks, we show that the equilibrium frequencies of super-cooperators are divergent, that entanglement guarantees emergence of super-cooperation and that there is a phase transition of the emergence with the threshold determined by the Nash equilibrium principle, accompanied by a perturbation by the variations of structures of networks. Our results explore systematically, for the first time, the dynamics, morphogenesis and convergence of evolutionary games in interacting and competing systems. PMID:27118882

Cooperation among cancer cells as public goods games on Voronoi networks.

PubMed

Archetti, Marco

2016-05-07

Cancer cells produce growth factors that diffuse and sustain tumour proliferation, a form of cooperation that can be studied using mathematical models of public goods in the framework of evolutionary game theory. Cell populations, however, form heterogeneous networks that cannot be described by regular lattices or scale-free networks, the types of graphs generally used in the study of cooperation. To describe the dynamics of growth factor production in populations of cancer cells, I study public goods games on Voronoi networks, using a range of non-linear benefits that account for the known properties of growth factors, and different types of diffusion gradients. The results are surprisingly similar to those obtained on regular graphs and different from results on scale-free networks, revealing that network heterogeneity per se does not promote cooperation when public goods diffuse beyond one-step neighbours. The exact shape of the diffusion gradient is not crucial, however, whereas the type of non-linear benefit is an essential determinant of the dynamics. Public goods games on Voronoi networks can shed light on intra-tumour heterogeneity, the evolution of resistance to therapies that target growth factors, and new types of cell therapy. Copyright © 2016 Elsevier Ltd. All rights reserved.

Validation of Framework Code Approach to a Life Prediction System for Fiber Reinforced Composites

NASA Technical Reports Server (NTRS)

Gravett, Phillip

1997-01-01

The grant was conducted by the MMC Life Prediction Cooperative, an industry/government collaborative team, Ohio Aerospace Institute (OAI) acted as the prime contractor on behalf of the Cooperative for this grant effort. See Figure I for the organization and responsibilities of team members. The technical effort was conducted during the period August 7, 1995 to June 30, 1996 in cooperation with Erwin Zaretsky, the LERC Program Monitor. Phil Gravett of Pratt & Whitney was the principal technical investigator. Table I documents all meeting-related coordination memos during this period. The effort under this grant was closely coordinated with an existing USAF sponsored program focused on putting into practice a life prediction system for turbine engine components made of metal matrix composites (MMC). The overall architecture of the NMC life prediction system was defined in the USAF sponsored program (prior to this grant). The efforts of this grant were focussed on implementing and tailoring of the life prediction system, the framework code within it and the damage modules within it to meet the specific requirements of the Cooperative. T'he tailoring of the life prediction system provides the basis for pervasive and continued use of this capability by the industry/government cooperative. The outputs of this grant are: 1. Definition of the framework code to analysis modules interfaces, 2. Definition of the interface between the materials database and the finite element model, and 3. Definition of the integration of the framework code into an FEM design tool.

Power-efficient distributed resource allocation under goodput QoS constraints for heterogeneous networks

NASA Astrophysics Data System (ADS)

Andreotti, Riccardo; Del Fiorentino, Paolo; Giannetti, Filippo; Lottici, Vincenzo

2016-12-01

This work proposes a distributed resource allocation (RA) algorithm for packet bit-interleaved coded OFDM transmissions in the uplink of heterogeneous networks (HetNets), characterized by small cells deployed over a macrocell area and sharing the same band. Every user allocates its transmission resources, i.e., bits per active subcarrier, coding rate, and power per subcarrier, to minimize the power consumption while both guaranteeing a target quality of service (QoS) and accounting for the interference inflicted by other users transmitting over the same band. The QoS consists of the number of information bits delivered in error-free packets per unit of time, or goodput (GP), estimated at the transmitter by resorting to an efficient effective SNR mapping technique. First, the RA problem is solved in the point-to-point case, thus deriving an approximate yet accurate closed-form expression for the power allocation (PA). Then, the interference-limited HetNet case is examined, where the RA problem is described as a non-cooperative game, providing a solution in terms of generalized Nash equilibrium. Thanks to the closed-form of the PA, the solution analysis is based on the best response concept. Hence, sufficient conditions for existence and uniqueness of the solution are analytically derived, along with a distributed algorithm capable of reaching the game equilibrium.

Hybrid services efficient provisioning over the network coding-enabled elastic optical networks

NASA Astrophysics Data System (ADS)

Wang, Xin; Gu, Rentao; Ji, Yuefeng; Kavehrad, Mohsen

2017-03-01

As a variety of services have emerged, hybrid services have become more common in real optical networks. Although the elastic spectrum resource optimizations over the elastic optical networks (EONs) have been widely investigated, little research has been carried out on the hybrid services of the routing and spectrum allocation (RSA), especially over the network coding-enabled EON. We investigated the RSA for the unicast service and network coding-based multicast service over the network coding-enabled EON with the constraints of time delay and transmission distance. To address this issue, a mathematical model was built to minimize the total spectrum consumption for the hybrid services over the network coding-enabled EON under the constraints of time delay and transmission distance. The model guarantees different routing constraints for different types of services. The immediate nodes over the network coding-enabled EON are assumed to be capable of encoding the flows for different kinds of information. We proposed an efficient heuristic algorithm of the network coding-based adaptive routing and layered graph-based spectrum allocation algorithm (NCAR-LGSA). From the simulation results, NCAR-LGSA shows highly efficient performances in terms of the spectrum resources utilization under different network scenarios compared with the benchmark algorithms.

Randomly biased investments and the evolution of public goods on interdependent networks

NASA Astrophysics Data System (ADS)

Chen, Wei; Wu, Te; Li, Zhiwu; Wang, Long

2017-08-01

Deciding how to allocate resources between interdependent systems is significant to optimize efficiency. We study the effects of heterogeneous contribution, induced by such interdependency, on the evolution of cooperation, through implementing the public goods games on two-layer networks. The corresponding players on different layers try to share a fixed amount of resources as the initial investment properly. The symmetry breaking of investments between players located on different layers is able to either prevent investments from, or extract them out of the deadlock. Results show that a moderate investment heterogeneity is best favorable for the evolution of cooperation, and random allocation of investment bias suppresses the cooperators at a wide range of the investment bias and the enhancement effect. Further studies on time evolution with different initial strategy configurations show that the non-interdependent cooperators along the interface of interdependent cooperators also are an indispensable factor in facilitating cooperative behavior. Our main results are qualitatively unchanged even diversifying investment bias that is subject to uniform distribution. Our study may shed light on the understanding of the origin of cooperative behavior on interdependent networks.

A simple rule for the evolution of cooperation on graphs and social networks.

PubMed

Ohtsuki, Hisashi; Hauert, Christoph; Lieberman, Erez; Nowak, Martin A

2006-05-25

A fundamental aspect of all biological systems is cooperation. Cooperative interactions are required for many levels of biological organization ranging from single cells to groups of animals. Human society is based to a large extent on mechanisms that promote cooperation. It is well known that in unstructured populations, natural selection favours defectors over cooperators. There is much current interest, however, in studying evolutionary games in structured populations and on graphs. These efforts recognize the fact that who-meets-whom is not random, but determined by spatial relationships or social networks. Here we describe a surprisingly simple rule that is a good approximation for all graphs that we have analysed, including cycles, spatial lattices, random regular graphs, random graphs and scale-free networks: natural selection favours cooperation, if the benefit of the altruistic act, b, divided by the cost, c, exceeds the average number of neighbours, k, which means b/c > k. In this case, cooperation can evolve as a consequence of 'social viscosity' even in the absence of reputation effects or strategic complexity.

Power allocation for target detection in radar networks based on low probability of intercept: A cooperative game theoretical strategy

NASA Astrophysics Data System (ADS)

Shi, Chenguang; Salous, Sana; Wang, Fei; Zhou, Jianjiang

2017-08-01

Distributed radar network systems have been shown to have many unique features. Due to their advantage of signal and spatial diversities, radar networks are attractive for target detection. In practice, the netted radars in radar networks are supposed to maximize their transmit power to achieve better detection performance, which may be in contradiction with low probability of intercept (LPI). Therefore, this paper investigates the problem of adaptive power allocation for radar networks in a cooperative game-theoretic framework such that the LPI performance can be improved. Taking into consideration both the transmit power constraints and the minimum signal to interference plus noise ratio (SINR) requirement of each radar, a cooperative Nash bargaining power allocation game based on LPI is formulated, whose objective is to minimize the total transmit power by optimizing the power allocation in radar networks. First, a novel SINR-based network utility function is defined and utilized as a metric to evaluate power allocation. Then, with the well-designed network utility function, the existence and uniqueness of the Nash bargaining solution are proved analytically. Finally, an iterative Nash bargaining algorithm is developed that converges quickly to a Pareto optimal equilibrium for the cooperative game. Numerical simulations and theoretic analysis are provided to evaluate the effectiveness of the proposed algorithm.

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

Discriminative Cooperative Networks for Detecting Phase Transitions

NASA Astrophysics Data System (ADS)

Liu, Ye-Hua; van Nieuwenburg, Evert P. L.

2018-04-01

The classification of states of matter and their corresponding phase transitions is a special kind of machine-learning task, where physical data allow for the analysis of new algorithms, which have not been considered in the general computer-science setting so far. Here we introduce an unsupervised machine-learning scheme for detecting phase transitions with a pair of discriminative cooperative networks (DCNs). In this scheme, a guesser network and a learner network cooperate to detect phase transitions from fully unlabeled data. The new scheme is efficient enough for dealing with phase diagrams in two-dimensional parameter spaces, where we can utilize an active contour model—the snake—from computer vision to host the two networks. The snake, with a DCN "brain," moves and learns actively in the parameter space, and locates phase boundaries automatically.

Game-theoretic cooperativity in networks of self-interested units

NASA Astrophysics Data System (ADS)

Barto, Andrew G.

1986-08-01

The behavior of theoretical neural networks is often described in terms of competition and cooperation. I present an approach to network learning that is related to game and team problems in which competition and cooperation have more technical meanings. I briefly describe the application of stochastic learning automata to game and team problems and then present an adaptive element that is a synthesis of aspects of stochastic learning automata and typical neuron-like adaptive elements. These elements act as self-interested agents that work toward improving their performance with respect to their individual preference orderings. Networks of these elements can solve a variety of team decision problems, some of which take the form of layered networks in which the ``hidden units'' become appropriate functional components as they attempt to improve their own payoffs.

Mutually cooperative epidemics on power-law networks

NASA Astrophysics Data System (ADS)

Cui, Peng-Bi; Colaiori, Francesca; Castellano, Claudio

2017-08-01

The spread of an infectious disease can, in some cases, promote the propagation of other pathogens favoring violent outbreaks, which cause a discontinuous transition to an endemic state. The topology of the contact network plays a crucial role in these cooperative dynamics. We consider a susceptible-infected-removed-type model with two mutually cooperative pathogens: An individual already infected with one disease has an increased probability of getting infected by the other. We present a heterogeneous mean-field theoretical approach to the coinfection dynamics on generic uncorrelated power-law degree-distributed networks and validate its results by means of numerical simulations. We show that, when the second moment of the degree distribution is finite, the epidemic transition is continuous for low cooperativity, while it is discontinuous when cooperativity is sufficiently high. For scale-free networks, i.e., topologies with diverging second moment, the transition is instead always continuous. In this way we clarify the effect of heterogeneity and system size on the nature of the transition, and we validate the physical interpretation about the origin of the discontinuity.

Conformity hinders the evolution of cooperation on scale-free networks

NASA Astrophysics Data System (ADS)

Peña, Jorge; Volken, Henri; Pestelacci, Enea; Tomassini, Marco

2009-07-01

We study the effects of conformity, the tendency of humans to imitate locally common behaviors, in the evolution of cooperation when individuals occupy the vertices of a graph and engage in the one-shot prisoner’s dilemma or the snowdrift game with their neighbors. Two different graphs are studied: rings (one-dimensional lattices with cyclic boundary conditions) and scale-free networks of the Barabási-Albert type. The proposed evolutionary-graph model is studied both by means of Monte Carlo simulations and an extended pair-approximation technique. We find improved levels of cooperation when evolution is carried on rings and individuals imitate according to both the traditional payoff bias and a conformist bias. More importantly, we show that scale-free networks are no longer powerful amplifiers of cooperation when fair amounts of conformity are introduced in the imitation rules of the players. Such weakening of the cooperation-promoting abilities of scale-free networks is the result of a less biased flow of information in scale-free topologies, making hubs more susceptible of being influenced by less-connected neighbors.

Design Graphics

NASA Technical Reports Server (NTRS)

1990-01-01

A mathematician, David R. Hedgley, Jr. developed a computer program that considers whether a line in a graphic model of a three-dimensional object should or should not be visible. Known as the Hidden Line Computer Code, the program automatically removes superfluous lines and displays an object from a specific viewpoint, just as the human eye would see it. An example of how one company uses the program is the experience of Birdair which specializes in production of fabric skylights and stadium covers. The fabric called SHEERFILL is a Teflon coated fiberglass material developed in cooperation with DuPont Company. SHEERFILL glazed structures are either tension structures or air-supported tension structures. Both are formed by patterned fabric sheets supported by a steel or aluminum frame or cable network. Birdair uses the Hidden Line Computer Code, to illustrate a prospective structure to an architect or owner. The program generates a three- dimensional perspective with the hidden lines removed. This program is still used by Birdair and continues to be commercially available to the public.

Simultaneous multi-patch-clamp and extracellular-array recordings: Single neuron reflects network activity

NASA Astrophysics Data System (ADS)

Vardi, Roni; Goldental, Amir; Sardi, Shira; Sheinin, Anton; Kanter, Ido

2016-11-01

The increasing number of recording electrodes enhances the capability of capturing the network’s cooperative activity, however, using too many monitors might alter the properties of the measured neural network and induce noise. Using a technique that merges simultaneous multi-patch-clamp and multi-electrode array recordings of neural networks in-vitro, we show that the membrane potential of a single neuron is a reliable and super-sensitive probe for monitoring such cooperative activities and their detailed rhythms. Specifically, the membrane potential and the spiking activity of a single neuron are either highly correlated or highly anti-correlated with the time-dependent macroscopic activity of the entire network. This surprising observation also sheds light on the cooperative origin of neuronal burst in cultured networks. Our findings present an alternative flexible approach to the technique based on a massive tiling of networks by large-scale arrays of electrodes to monitor their activity.

Simultaneous multi-patch-clamp and extracellular-array recordings: Single neuron reflects network activity

PubMed Central

Vardi, Roni; Goldental, Amir; Sardi, Shira; Sheinin, Anton; Kanter, Ido

2016-01-01

The increasing number of recording electrodes enhances the capability of capturing the network’s cooperative activity, however, using too many monitors might alter the properties of the measured neural network and induce noise. Using a technique that merges simultaneous multi-patch-clamp and multi-electrode array recordings of neural networks in-vitro, we show that the membrane potential of a single neuron is a reliable and super-sensitive probe for monitoring such cooperative activities and their detailed rhythms. Specifically, the membrane potential and the spiking activity of a single neuron are either highly correlated or highly anti-correlated with the time-dependent macroscopic activity of the entire network. This surprising observation also sheds light on the cooperative origin of neuronal burst in cultured networks. Our findings present an alternative flexible approach to the technique based on a massive tiling of networks by large-scale arrays of electrodes to monitor their activity. PMID:27824075

Integrated networks and health care provider cooperatives: new models for rural health care delivery and financing.

PubMed

Casey, M M

1997-01-01

Minnesota's 1994 health care reform legislation authorized the establishment of community integrated service networks (CISNs) and health care provider cooperatives, which were envisioned as new health care delivery models that could be successfully implemented in rural areas of the state. Four CISNs are licensed, and three organizations are incorporated as health care provider cooperatives. Many of the policy issues Minnesota has faced regarding the development of CISNs and health care provider cooperatives in rural areas are similar to those raised by current Medicare reform proposals.

Groundwater and streamflow information program Kansas Cooperative Water Science since 1895

USGS Publications Warehouse

Painter, Colin C.; Kramer, Ariele R.; Kelly, Brian P.

2017-05-10

The U.S. Geological Survey, in cooperation with State, local, and other Federal agencies, operates a network of streamgages throughout the State of Kansas. Data provided by this network are used to forecast floods, operate reservoirs, develop water policy, administer regulation of water, and perform interpretive analyses of streamflow. This data collection and analysis effort has been sustained since 1895 through cooperative matching fund programs that allow the USGS to work with cooperative agencies to solve groundwater and surface water challenges that affect citizens locally and throughout the Nation.  

Variable weight spectral amplitude coding for multiservice OCDMA networks

NASA Astrophysics Data System (ADS)

Seyedzadeh, Saleh; Rahimian, Farzad Pour; Glesk, Ivan; Kakaee, Majid H.

2017-09-01

The emergence of heterogeneous data traffic such as voice over IP, video streaming and online gaming have demanded networks with capability of supporting quality of service (QoS) at the physical layer with traffic prioritisation. This paper proposes a new variable-weight code based on spectral amplitude coding for optical code-division multiple-access (OCDMA) networks to support QoS differentiation. The proposed variable-weight multi-service (VW-MS) code relies on basic matrix construction. A mathematical model is developed for performance evaluation of VW-MS OCDMA networks. It is shown that the proposed code provides an optimal code length with minimum cross-correlation value when compared to other codes. Numerical results for a VW-MS OCDMA network designed for triple-play services operating at 0.622 Gb/s, 1.25 Gb/s and 2.5 Gb/s are considered.

Learning by statistical cooperation of self-interested neuron-like computing elements.

PubMed

Barto, A G

1985-01-01

Since the usual approaches to cooperative computation in networks of neuron-like computating elements do not assume that network components have any "preferences", they do not make substantive contact with game theoretic concepts, despite their use of some of the same terminology. In the approach presented here, however, each network component, or adaptive element, is a self-interested agent that prefers some inputs over others and "works" toward obtaining the most highly preferred inputs. Here we describe an adaptive element that is robust enough to learn to cooperate with other elements like itself in order to further its self-interests. It is argued that some of the longstanding problems concerning adaptation and learning by networks might be solvable by this form of cooperativity, and computer simulation experiments are described that show how networks of self-interested components that are sufficiently robust can solve rather difficult learning problems. We then place the approach in its proper historical and theoretical perspective through comparison with a number of related algorithms. A secondary aim of this article is to suggest that beyond what is explicitly illustrated here, there is a wealth of ideas from game theory and allied disciplines such as mathematical economics that can be of use in thinking about cooperative computation in both nervous systems and man-made systems.

Applications of Time-Reversal Processing for Planetary Surface Communications

NASA Technical Reports Server (NTRS)

Barton, Richard J.

2007-01-01

Due to the power constraints imposed on wireless sensor and communication networks deployed on a planetary surface during exploration, energy efficient transfer of data becomes a critical issue. In situations where groups of nodes within a network are located in relatively close proximity, cooperative communication techniques can be utilized to improve the range, data rate, power efficiency, and lifetime of the network. In particular, if the point-to-point communication channels on the network are well modeled as frequency non-selective, distributed or cooperative beamforming can employed. For frequency-selective channels, beamforming itself is not generally appropriate, but a natural generalization of it, time-reversal communication (TRC), can still be effective. Time-reversal processing has been proposed and studied previously for other applications, including acoustical imaging, electromagnetic imaging, underwater acoustic communication, and wireless communication channels. In this paper, we study both the theoretical advantages and the experimental performance of cooperative TRC for wireless communication on planetary surfaces. We give a brief introduction to TRC and present several scenarios where TRC could be profitably employed during planetary exploration. We also present simulation results illustrating the performance of cooperative TRC employed in a complex multipath environment and discuss the optimality of cooperative TRC for data aggregation in wireless sensor networks

Link prediction based on nonequilibrium cooperation effect

NASA Astrophysics Data System (ADS)

Li, Lanxi; Zhu, Xuzhen; Tian, Hui

2018-04-01

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

Cooperative Adaptive Output Regulation for Second-Order Nonlinear Multiagent Systems With Jointly Connected Switching Networks.

PubMed

Liu, Wei; Huang, Jie

2018-03-01

This paper studies the cooperative global robust output regulation problem for a class of heterogeneous second-order nonlinear uncertain multiagent systems with jointly connected switching networks. The main contributions consist of the following three aspects. First, we generalize the result of the adaptive distributed observer from undirected jointly connected switching networks to directed jointly connected switching networks. Second, by performing a new coordinate and input transformation, we convert our problem into the cooperative global robust stabilization problem of a more complex augmented system via the distributed internal model principle. Third, we solve the stabilization problem by a distributed state feedback control law. Our result is illustrated by the leader-following consensus problem for a group of Van der Pol oscillators.

NetCooperate: a network-based tool for inferring host-microbe and microbe-microbe cooperation.

PubMed

Levy, Roie; Carr, Rogan; Kreimer, Anat; Freilich, Shiri; Borenstein, Elhanan

2015-05-17

Host-microbe and microbe-microbe interactions are often governed by the complex exchange of metabolites. Such interactions play a key role in determining the way pathogenic and commensal species impact their host and in the assembly of complex microbial communities. Recently, several studies have demonstrated how such interactions are reflected in the organization of the metabolic networks of the interacting species, and introduced various graph theory-based methods to predict host-microbe and microbe-microbe interactions directly from network topology. Using these methods, such studies have revealed evolutionary and ecological processes that shape species interactions and community assembly, highlighting the potential of this reverse-ecology research paradigm. NetCooperate is a web-based tool and a software package for determining host-microbe and microbe-microbe cooperative potential. It specifically calculates two previously developed and validated metrics for species interaction: the Biosynthetic Support Score which quantifies the ability of a host species to supply the nutritional requirements of a parasitic or a commensal species, and the Metabolic Complementarity Index which quantifies the complementarity of a pair of microbial organisms' niches. NetCooperate takes as input a pair of metabolic networks, and returns the pairwise metrics as well as a list of potential syntrophic metabolic compounds. The Biosynthetic Support Score and Metabolic Complementarity Index provide insight into host-microbe and microbe-microbe metabolic interactions. NetCooperate determines these interaction indices from metabolic network topology, and can be used for small- or large-scale analyses. NetCooperate is provided as both a web-based tool and an open-source Python module; both are freely available online at http://elbo.gs.washington.edu/software_netcooperate.html.

Applications of Coding in Network Communications

ERIC Educational Resources Information Center

Chang, Christopher SungWook

2012-01-01

This thesis uses the tool of network coding to investigate fast peer-to-peer file distribution, anonymous communication, robust network construction under uncertainty, and prioritized transmission. In a peer-to-peer file distribution system, we use a linear optimization approach to show that the network coding framework significantly simplifies…

Coevolving agent strategies and network topology for the public goods games

NASA Astrophysics Data System (ADS)

Zhang, C. Y.; Zhang, J. L.; Xie, G. M.; Wang, L.

2011-03-01

Much of human cooperation remains an evolutionary riddle. Coevolutionary public goods games in structured populations are studied where players can change from an unproductive public goods game to a productive one, by evaluating the productivity of the public goods games. In our model, each individual participates in games organized by its neighborhood plus by itself. Coevolution here refers to an evolutionary process entailing both deletion of existing links and addition of new links between agents that accompanies the evolution of their strategies. Furthermore, we investigate the effects of time scale separation of strategy and structure on cooperation level. This study presents the following: Foremost, we observe that high cooperation levels in public goods interactions are attained by the entangled coevolution of strategy and structure. Presented results also confirm that the resulting networks show many features of real systems, such as cooperative behavior and hierarchical clustering. The heterogeneity of the interaction network is held responsible for the observed promotion of cooperation. We hope our work may offer an explanation for the origin of large-scale cooperative behavior among unrelated individuals.

Evolution of Cooperation in Adaptive Social Networks

NASA Astrophysics Data System (ADS)

Segbroeck, Sven Van; Santos, Francisco C.; Traulsen, Arne; Lenaerts, Tom; Pacheco, Jorge M.

Humans are organized in societies, a phenomenon that would never have been possible without the evolution of cooperative behavior. Several mechanisms that foster this evolution have been unraveled over the years, with population structure as a prominent promoter of cooperation. Modern networks of exchange and cooperation are, however, becoming increasingly volatile, and less and less based on long-term stable structure. Here, we address how this change of paradigm aspects the evolution of cooperation. We discuss analytical and numerical models in which individuals can break social ties and create new ones. Interactions are modeled as two-player dilemmas of cooperation. Once a link between two individuals has formed, the productivity of this link is evaluated. Links can be broken off at different rates. This individual capacity of forming new links or severing inconvenient ones can effectively change the nature of the game. We address random formation of new links and local linking rules as well as different individual capacities to maintain social interactions. We conclude by discussing how adaptive social networks can become an important step towards more realistic models of cultural dynamics.

Impact of dynamic rate coding aspects of mobile phone networks on forensic voice comparison.

PubMed

Alzqhoul, Esam A S; Nair, Balamurali B T; Guillemin, Bernard J

2015-09-01

Previous studies have shown that landline and mobile phone networks are different in their ways of handling the speech signal, and therefore in their impact on it. But the same is also true of the different networks within the mobile phone arena. There are two major mobile phone technologies currently in use today, namely the global system for mobile communications (GSM) and code division multiple access (CDMA) and these are fundamentally different in their design. For example, the quality of the coded speech in the GSM network is a function of channel quality, whereas in the CDMA network it is determined by channel capacity (i.e., the number of users sharing a cell site). This paper examines the impact on the speech signal of a key feature of these networks, namely dynamic rate coding, and its subsequent impact on the task of likelihood-ratio-based forensic voice comparison (FVC). Surprisingly, both FVC accuracy and precision are found to be better for both GSM- and CDMA-coded speech than for uncoded. Intuitively one expects FVC accuracy to increase with increasing coded speech quality. This trend is shown to occur for the CDMA network, but, surprisingly, not for the GSM network. Further, in respect to comparisons between these two networks, FVC accuracy for CDMA-coded speech is shown to be slightly better than for GSM-coded speech, particularly when the coded-speech quality is high, but in terms of FVC precision the two networks are shown to be very similar. Copyright © 2015 The Chartered Society of Forensic Sciences. Published by Elsevier Ireland Ltd. All rights reserved.

Heterogeneous Coupling between Interdependent Lattices Promotes the Cooperation in the Prisoner’s Dilemma Game

PubMed Central

Xia, Cheng-Yi; Meng, Xiao-Kun; Wang, Zhen

2015-01-01

In the research realm of game theory, interdependent networks have extended the content of spatial reciprocity, which needs the suitable coupling between networks. However, thus far, the vast majority of existing works just assume that the coupling strength between networks is symmetric. This hypothesis, to some extent, seems inconsistent with the ubiquitous observation of heterogeneity. Here, we study how the heterogeneous coupling strength, which characterizes the interdependency of utility between corresponding players of both networks, affects the evolution of cooperation in the prisoner’s dilemma game with two types of coupling schemes (symmetric and asymmetric ones). Compared with the traditional case, we show that heterogeneous coupling greatly promotes the collective cooperation. The symmetric scheme seems much better than the asymmetric case. Moreover, the role of varying amplitude of coupling strength is also studied on these two interdependent ways. Current findings are helpful for us to understand the evolution of cooperation within many real-world systems, in particular for the interconnected and interrelated systems. PMID:26102082

Heterogeneous Coupling between Interdependent Lattices Promotes the Cooperation in the Prisoner's Dilemma Game.

PubMed

Xia, Cheng-Yi; Meng, Xiao-Kun; Wang, Zhen

2015-01-01

In the research realm of game theory, interdependent networks have extended the content of spatial reciprocity, which needs the suitable coupling between networks. However, thus far, the vast majority of existing works just assume that the coupling strength between networks is symmetric. This hypothesis, to some extent, seems inconsistent with the ubiquitous observation of heterogeneity. Here, we study how the heterogeneous coupling strength, which characterizes the interdependency of utility between corresponding players of both networks, affects the evolution of cooperation in the prisoner's dilemma game with two types of coupling schemes (symmetric and asymmetric ones). Compared with the traditional case, we show that heterogeneous coupling greatly promotes the collective cooperation. The symmetric scheme seems much better than the asymmetric case. Moreover, the role of varying amplitude of coupling strength is also studied on these two interdependent ways. Current findings are helpful for us to understand the evolution of cooperation within many real-world systems, in particular for the interconnected and interrelated systems.

ARC-2001-ACD01-0018

NASA Image and Video Library

2001-02-16

New Center Network Deployment ribbon Cutting: from left to right: Maryland Edwards, Code JT upgrade project deputy task manager; Ed Murphy, foundry networks systems engineer; Bohdan Cmaylo, Code JT upgrade project task manager, Scott Santiago, Division Chief, Code JT; Greg Miller, Raytheon Network engineer and Frank Daras, Raytheon network engineering manager.

Celestial data routing network

NASA Astrophysics Data System (ADS)

Bordetsky, Alex

2000-11-01

Imagine that information processing human-machine network is threatened in a particular part of the world. Suppose that an anticipated threat of physical attacks could lead to disruption of telecommunications network management infrastructure and access capabilities for small geographically distributed groups engaged in collaborative operations. Suppose that small group of astronauts are exploring the solar planet and need to quickly configure orbital information network to support their collaborative work and local communications. The critical need in both scenarios would be a set of low-cost means of small team celestial networking. To the geographically distributed mobile collaborating groups such means would allow to maintain collaborative multipoint work, set up orbital local area network, and provide orbital intranet communications. This would be accomplished by dynamically assembling the network enabling infrastructure of the small satellite based router, satellite based Codec, and set of satellite based intelligent management agents. Cooperating single function pico satellites, acting as agents and personal switching devices together would represent self-organizing intelligent orbital network of cooperating mobile management nodes. Cooperative behavior of the pico satellite based agents would be achieved by comprising a small orbital artificial neural network capable of learning and restructing the networking resources in response to the anticipated threat.

Collaboration between industry and academia--prospects for male fertility control.

PubMed

Stock, G; Habenicht, U F

1999-12-01

Drug development within the pharmaceutical industry is probably the field with the highest level of regulations. Due to the complexity of the different components of drug development and drug surveillance the need for a sophisticated organization and infrastructure is obvious. In addition, there is a necessity for sufficient resources and long-term commitment as well as logistic and long-term knowledge management. In order to secure high professional standards at all levels of this highly complex value creating chain, the number of cooperative arrangements in the pharmaceutical industry are increasing. The identification of new targets in the drug finding process calls in particular for outside partners. At the same time the preparedness of non-industrial researchers to cooperate with industry has also increased significantly. The area of fertility control, especially male fertility control, provides an excellent example for this kind of cooperation between industrial and non-industrial partners. Here a cooperative network is described which probably meets practically all relevant criteria for both the non-industrial but also the industrial partner. Some principles for the management of such a cooperative network are discussed. We believe that this kind of network can serve as a model for similar networks in other fields.

The evolutionary advantage of limited network knowledge.

PubMed

Larson, Jennifer M

2016-06-07

Groups of individuals have social networks that structure interactions within the groups; evolutionary theory increasingly uses this fact to explain the emergence of cooperation (Eshel and Cavalli-Sforza, 1982; Boyd and Richerson, 1988, 1989; Ohtsuki et al., 2006; Nowak et al., 2010; Van Veelen et al., 2012). This approach has resulted in a number of important insights for the evolution of cooperation in the biological and social sciences, but omits a key function of social networks that has persisted throughout recent evolutionary history (Apicella et al., 2012): their role in transmitting gossip about behavior within a group. Accounting for this well-established role of social networks among rational agents in a setting of indirect reciprocity not only shows a new mechanism by which the structure of networks is fitness-relevant, but also reveals that knowledge of social networks can be fitness-relevant as well. When groups enforce cooperation by sanctioning peers whom gossip reveals to have deviated, individuals in certain peripheral network positions are tempting targets of uncooperative behavior because gossip they share about misbehavior spreads slowly through the network. The ability to identify these individuals creates incentives to behave uncooperatively. Consequently, groups comprised of individuals who knew precise information about their social networks would be at a fitness disadvantage relative to groups of individuals with a coarser knowledge of their networks. Empirical work has consistently shown that modern humans know little about the structure of their own social networks and perform poorly when tasked with learning new ones. This robust empirical regularity may be the product of natural selection in an environment of strong selective pressure at the group level. Imprecise views of networks make enforcing cooperation easier. Copyright © 2016 Elsevier Ltd. All rights reserved.

Network Coding in Relay-based Device-to-Device Communications

PubMed Central

Huang, Jun; Gharavi, Hamid; Yan, Huifang; Xing, Cong-cong

2018-01-01

Device-to-Device (D2D) communications has been realized as an effective means to improve network throughput, reduce transmission latency, and extend cellular coverage in 5G systems. Network coding is a well-established technique known for its capability to reduce the number of retransmissions. In this article, we review state-of-the-art network coding in relay-based D2D communications, in terms of application scenarios and network coding techniques. We then apply two representative network coding techniques to dual-hop D2D communications and present an efficient relay node selecting mechanism as a case study. We also outline potential future research directions, according to the current research challenges. Our intention is to provide researchers and practitioners with a comprehensive overview of the current research status in this area and hope that this article may motivate more researchers to participate in developing network coding techniques for different relay-based D2D communications scenarios. PMID:29503504

Cooperative behavior cascades in human social networks.

PubMed

Fowler, James H; Christakis, Nicholas A

2010-03-23

Theoretical models suggest that social networks influence the evolution of cooperation, but to date there have been few experimental studies. Observational data suggest that a wide variety of behaviors may spread in human social networks, but subjects in such studies can choose to befriend people with similar behaviors, posing difficulty for causal inference. Here, we exploit a seminal set of laboratory experiments that originally showed that voluntary costly punishment can help sustain cooperation. In these experiments, subjects were randomly assigned to a sequence of different groups to play a series of single-shot public goods games with strangers; this feature allowed us to draw networks of interactions to explore how cooperative and uncooperative behaviors spread from person to person to person. We show that, in both an ordinary public goods game and in a public goods game with punishment, focal individuals are influenced by fellow group members' contribution behavior in future interactions with other individuals who were not a party to the initial interaction. Furthermore, this influence persists for multiple periods and spreads up to three degrees of separation (from person to person to person to person). The results suggest that each additional contribution a subject makes to the public good in the first period is tripled over the course of the experiment by other subjects who are directly or indirectly influenced to contribute more as a consequence. These results show experimentally that cooperative behavior cascades in human social networks.

Cooperative SIS epidemics can lead to abrupt outbreaks

NASA Astrophysics Data System (ADS)

Ghanbarnejad, Fakhteh; Chen, Li; Cai, Weiran; Grassberger, Peter

2015-03-01

In this paper, we study spreading of two cooperative SIS epidemics in mean field approximations and also within an agent based framework. Therefore we investigate dynamics on different topologies like Erdos-Renyi networks and regular lattices. We show that cooperativity of two diseases can lead to strongly first order outbreaks, while the dynamics still might present some scaling laws typical for second order phase transitions. We argue how topological network features might be related to this interesting hybrid behaviors.

7 CFR Exhibit C to Subpart B of... - Cooperative Agreement (Example)

Code of Federal Regulations, 2012 CFR

2012-01-01

... 7 Agriculture 14 2012-01-01 2012-01-01 false Cooperative Agreement (Example) C Exhibit C to... Pt. 1955, Subpt. B, Note Exhibit C to Subpart B of Part 1955—Cooperative Agreement (Example) Editorial Note: Exhibit C is not published in the Code of Federal Regulations. It is available in any FmHA...

7 CFR Exhibit C to Subpart B of... - Cooperative Agreement (Example)

Code of Federal Regulations, 2011 CFR

2011-01-01

... 7 Agriculture 14 2011-01-01 2011-01-01 false Cooperative Agreement (Example) C Exhibit C to... Pt. 1955, Subpt. B, Note Exhibit C to Subpart B of Part 1955—Cooperative Agreement (Example) Editorial Note: Exhibit C is not published in the Code of Federal Regulations. It is available in any FmHA...

7 CFR Exhibit C to Subpart B of... - Cooperative Agreement (Example)

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 14 2014-01-01 2014-01-01 false Cooperative Agreement (Example) C Exhibit C to... Pt. 1955, Subpt. B, Note Exhibit C to Subpart B of Part 1955—Cooperative Agreement (Example) Editorial Note: Exhibit C is not published in the Code of Federal Regulations. It is available in any FmHA...

A model for the emergence of cooperation, interdependence, and structure in evolving networks.

PubMed

Jain, S; Krishna, S

2001-01-16

Evolution produces complex and structured networks of interacting components in chemical, biological, and social systems. We describe a simple mathematical model for the evolution of an idealized chemical system to study how a network of cooperative molecular species arises and evolves to become more complex and structured. The network is modeled by a directed weighted graph whose positive and negative links represent "catalytic" and "inhibitory" interactions among the molecular species, and which evolves as the least populated species (typically those that go extinct) are replaced by new ones. A small autocatalytic set, appearing by chance, provides the seed for the spontaneous growth of connectivity and cooperation in the graph. A highly structured chemical organization arises inevitably as the autocatalytic set enlarges and percolates through the network in a short analytically determined timescale. This self organization does not require the presence of self-replicating species. The network also exhibits catastrophes over long timescales triggered by the chance elimination of "keystone" species, followed by recoveries.

A model for the emergence of cooperation, interdependence, and structure in evolving networks

NASA Astrophysics Data System (ADS)

Jain, Sanjay; Krishna, Sandeep

2001-01-01

Evolution produces complex and structured networks of interacting components in chemical, biological, and social systems. We describe a simple mathematical model for the evolution of an idealized chemical system to study how a network of cooperative molecular species arises and evolves to become more complex and structured. The network is modeled by a directed weighted graph whose positive and negative links represent "catalytic" and "inhibitory" interactions among the molecular species, and which evolves as the least populated species (typically those that go extinct) are replaced by new ones. A small autocatalytic set, appearing by chance, provides the seed for the spontaneous growth of connectivity and cooperation in the graph. A highly structured chemical organization arises inevitably as the autocatalytic set enlarges and percolates through the network in a short analytically determined timescale. This self organization does not require the presence of self-replicating species. The network also exhibits catastrophes over long timescales triggered by the chance elimination of "keystone" species, followed by recoveries.

An implementation of a security infrastructure compliant with the Italian Personal Data Protection Code in a web-based cooperative work system.

PubMed

Eccher, Claudio; Eccher, Lorenzo; Izzo, Umberto

2005-01-01

In this poster we describe the security solutions implemented in a web-based cooperative work frame-work for managing heart failure patients among different health care professionals involved in the care process. The solution, developed in close collaboration with the Law Department of the University of Trento, is compliant with the new Italian Personal Data Protection Code, issued in 2003, that regulates also the storing and processing of health data.

Mutual Co-operation for Schools Development: Some Experiences from Asia and the Pacific. Report of a Study Group (Bangkok, Thailand, November 6-17, 1984).

ERIC Educational Resources Information Center

United Nations Educational, Scientific, and Cultural Organization, Bangkok (Thailand). Regional Office for Education in Asia and the Pacific.

Focusing on the use of networking structures as a means of promoting and mobilizing inter-institutional support for educational development, this publication reports on topics raised at a meeting held by the Study Group on Inter-Institutional and Other Co-operative Networking Structures. Chapter 1 reports on ways in which networking is taking root…

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel

PubMed Central

Sakin, Sayef Azad; Alamri, Atif; Tran, Nguyen H.

2017-01-01

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies. PMID:29215591

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel.

PubMed

Sakin, Sayef Azad; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Alamri, Atif; Tran, Nguyen H; Fortino, Giancarlo

2017-12-07

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies.

Network-based reading system for lung cancer screening CT

NASA Astrophysics Data System (ADS)

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

2006-03-01

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

Tactile communication, cooperation, and performance: an ethological study of the NBA.

PubMed

Kraus, Michael W; Huang, Cassey; Keltner, Dacher

2010-10-01

Tactile communication, or physical touch, promotes cooperation between people, communicates distinct emotions, soothes in times of stress, and is used to make inferences of warmth and trust. Based on this conceptual analysis, we predicted that in group competition, physical touch would predict increases in both individual and group performance. In an ethological study, we coded the touch behavior of players from the National Basketball Association (NBA) during the 2008-2009 regular season. Consistent with hypotheses, early season touch predicted greater performance for individuals as well as teams later in the season. Additional analyses confirmed that touch predicted improved performance even after accounting for player status, preseason expectations, and early season performance. Moreover, coded cooperative behaviors between teammates explained the association between touch and team performance. Discussion focused on the contributions touch makes to cooperative groups and the potential implications for other group settings. (PsycINFO Database Record (c) 2010 APA, all rights reserved).

West Hills College Cooperative Training Network. Final Performance and Financial Status Report.

ERIC Educational Resources Information Center

West Hills Community Coll., Coalinga, CA.

A cooperative training network was developed by West Hills Community College (Coalinga, California), in conjunction with government agencies/private businesses, to train students in truck driving skills. Emphasis was placed on training women, members of minority groups, and disadvantaged persons. During the project, an advisory council was…

West Hills College Cooperative Training Network. Truck Driving Program. Dissemination Workbook.

ERIC Educational Resources Information Center

West Hills Community Coll., Coalinga, CA.

A cooperative training network was developed by West Hills Community College (Coalinga, California) in conjunction with government agencies/private businesses to train students in truck driving skills. Emphasis was placed on training women, members of minority groups, and disadvantaged persons. During the project, an advisory council was…

Moran-evolution of cooperation: From well-mixed to heterogeneous complex networks

NASA Astrophysics Data System (ADS)

Sarkar, Bijan

2018-05-01

Configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation, which is explained by the well-established framework of evolutionary game theory. In the current study, not only qualitatively but also quantitatively, we measure Moran-evolution of cooperation to support an analytical agreement based on the consequences of the replicator equation in a finite population. The validity of the measurement has been double-checked in the well-mixed network by the Langevin stochastic differential equation and the Gillespie-algorithmic version of Moran-evolution, while in a structured network, the measurement of accuracy is verified by the standard numerical simulation. Considering the Birth-Death and Death-Birth updating rules through diffusion of individuals, the investigation is carried out in the wide range of game environments those relate to the various social dilemmas where we are able to draw a new rigorous mathematical track to tackle the heterogeneity of complex networks. The set of modified criteria reveals the exact fact about the emergence and maintenance of cooperation in the structured population. We find that in general, nature promotes the environment of coexistent traits.

Peer pressure and incentive mechanisms in social networks

NASA Astrophysics Data System (ADS)

Deng, Chuang; Ye, Chao; Wang, Lin; Rong, Zhihai; Wang, Xiaofan

2018-01-01

Cooperation can be viewed as a social norm that is expected in our society. In this work, a framework based on spatial public goods game theory is established to study how peer pressure and incentive mechanisms can influence the evolution of cooperation. A unified model with adjustable parameters is developed to represent the effects of pure Personal Mechanism, Personal Mechanism with peer pressure and Social Mechanism, which demonstrates that when the sum of rewards plus the peer pressure felt by defectors is larger than the effective cost of cooperation, cooperation can prevail. As the peer pressure is caused by other cooperators in a game, group size and network structure play an important role. In particular, larger group size and more heterogeneous structured population can make defectors feel more peer pressure, which will promote the evolution and sustainment of cooperation.

Communication and cooperation in networked environments: an experimental analysis.

PubMed

Galimberti, C; Ignazi, S; Vercesi, P; Riva, G

2001-02-01

Interpersonal communication and cooperation do not happen exclusively face to face. In work contexts, as in private life, there are more and more situations of mediated communication and cooperation in which new online tools are used. However, understanding how to use the Internet to support collaborative interaction presents a substantial challenge for the designers and users of this emerging technology. First, collaborative Internet environments are designed to serve a purpose, so must be designed with intended users' tasks and goals explicitly considered. Second, in cooperative activities the key content of communication is the interpretation of the situations in which actors are involved. So, the most effective way of clarifying the meaning of messages is to connect them to a shared context of meaning. However, this is more difficult in the Internet than in other computer-based activities. This paper tries to understand the characteristics of cooperative activities in networked environments--shared 3D virtual worlds--through two different studies. The first used the analysis of conversations to explore the characteristics of the interaction during the cooperative task; the second analyzed whether and how the level of immersion in the networked environments influenced the performance and the interactional process. The results are analyzed to identify the psychosocial roots used to support cooperation in a digital interactive communication.

Worst-Case Cooperative Jamming for Secure Communications in CIoT Networks.

PubMed

Li, Zhen; Jing, Tao; Ma, Liran; Huo, Yan; Qian, Jin

2016-03-07

The Internet of Things (IoT) is a significant branch of the ongoing advances in the Internet and mobile communications. The use of a large number of IoT devices makes the spectrum scarcity problem even more serious. The usable spectrum resources are almost entirely occupied, and thus, the increasing radio access demands of IoT devices cannot be met. To tackle this problem, the Cognitive Internet of Things (CIoT) has been proposed. In a CIoT network, secondary users, i.e., sensors and actuators, can access the licensed spectrum bands provided by licensed primary users (such as telephones). Security is a major concern in CIoT networks. However, the traditional encryption method at upper layers (such as symmetric cryptography and asymmetric cryptography) may be compromised in CIoT networks, since these types of networks are heterogeneous. In this paper, we address the security issue in spectrum-leasing-based CIoT networks using physical layer methods. Considering that the CIoT networks are cooperative networks, we propose to employ cooperative jamming to achieve secrecy transmission. In the cooperative jamming scheme, a certain secondary user is employed as the helper to harvest energy transmitted by the source and then uses the harvested energy to generate an artificial noise that jams the eavesdropper without interfering with the legitimate receivers. The goal is to minimize the signal to interference plus noise ratio (SINR) at the eavesdropper subject to the quality of service (QoS) constraints of the primary traffic and the secondary traffic. We formulate the considered minimization problem into a two-stage robust optimization problem based on the worst-case Channel State Information of the Eavesdropper. By using semi-definite programming (SDP), the optimal solutions of the transmit covariance matrices can be obtained. Moreover, in order to build an incentive mechanism for the secondary users, we propose an auction framework based on the cooperative jamming scheme. The proposed auction framework jointly formulates the helper selection and the corresponding energy allocation problems under the constraint of the eavesdropper's SINR. By adopting the Vickrey auction, truthfulness and individual rationality can be guaranteed. Simulation results demonstrate the good performance of the cooperative jamming scheme and the auction framework.

A Large Scale Code Resolution Service Network in the Internet of Things

PubMed Central

Yu, Haining; Zhang, Hongli; Fang, Binxing; Yu, Xiangzhan

2012-01-01

In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT's advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS. PMID:23202207

A large scale code resolution service network in the Internet of Things.

PubMed

Yu, Haining; Zhang, Hongli; Fang, Binxing; Yu, Xiangzhan

2012-11-07

In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT’s advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS.

The Pacific Community Concept. Proposals for Further Development and Co-Operation between Countries of the Pacific Basin and Reaction to Such Proposals by Pacific Basin Countries. A Select Bibliography. Development of Resource Sharing Networks. Networks Study No. 14.

ERIC Educational Resources Information Center

National Library of Australia, Canberra.

As part of its statutory duty to foster international cooperation, the National Library of Australia has produced this annotated bibliography based on a review of material published since 1968 on the Pacific Community Concept or cooperation between countries in the Pacific Basin area of Asia and Oceania. The 159 items listed cover the following…

The virtual cooperation platform in enterprise and supplier cooperation models.

PubMed

Chang, Che-Wei; Wu, Cheng-Ru; Liao, Chia-Chun

2010-08-01

Abstract This study examines the use of the virtual enterprise network supplier supply-chain model of business behavior in creating synergies of cooperation. To explore virtual network behavior, it evaluates 60 samples, taken from of a few supply chains, and 17 items meeting certain behavioral criteria. Such an analysis may help to reduce costs and processing time effectively, as well as promote effective communication. Furthermore, the study of behavior in this electronic setting is a reliable and useful assessment method.

7 CFR Exhibit E to Subpart A of... - Voluntary National Model Building Codes

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 12 2010-01-01 2010-01-01 false Voluntary National Model Building Codes E Exhibit E... HOUSING SERVICE, RURAL BUSINESS-COOPERATIVE SERVICE, RURAL UTILITIES SERVICE, AND FARM SERVICE AGENCY... National Model Building Codes The following documents address the health and safety aspects of buildings...

Cognitive strategies take advantage of the cooperative potential of heterogeneous networks

NASA Astrophysics Data System (ADS)

Vukov, Jeromos; Santos, Francisco C.; Pacheco, Jorge M.

2012-06-01

Understanding the emergence and maintenance of cooperation is one of the most challenging topics of our time. Evolutionary game theory offers a very flexible framework within which to address this challenge. Here we use the prisoner's dilemma game to investigate the performance of individuals who are capable of adopting reactive strategies in communities structurally organized by means of Barabási-Albert scale-free networks. We find that basic cognitive abilities, such as the capability to distinguish their partners and act according to their previous actions, enable cooperation to thrive. This result is particularly significant whenever fear is the leading social tension, as this fosters retaliation, thus enforcing and sustaining cooperation. Being able to simultaneously reward fellow cooperators and punish defectors proves instrumental in achieving cooperation and the welfare of the community. As a result, central individuals can successfully lead the community and turn defective players into cooperative ones. Finally, even when participation costs—known to be detrimental to cooperation in scale-free networks—are explicitly included, we find that basic cognitive abilities have enough potential to help cooperation to prevail.

Design of special purpose database for credit cooperation bank business processing network system

NASA Astrophysics Data System (ADS)

Yu, Yongling; Zong, Sisheng; Shi, Jinfa

2011-12-01

With the popularization of e-finance in the city, the construction of e-finance is transfering to the vast rural market, and quickly to develop in depth. Developing the business processing network system suitable for the rural credit cooperative Banks can make business processing conveniently, and have a good application prospect. In this paper, We analyse the necessity of adopting special purpose distributed database in Credit Cooperation Band System, give corresponding distributed database system structure , design the specical purpose database and interface technology . The application in Tongbai Rural Credit Cooperatives has shown that system has better performance and higher efficiency.

Exploiting Outage and Error Probability of Cooperative Incremental Relaying in Underwater Wireless Sensor Networks

PubMed Central

Nasir, Hina; Javaid, Nadeem; Sher, Muhammad; Qasim, Umar; Khan, Zahoor Ali; Alrajeh, Nabil; Niaz, Iftikhar Azim

2016-01-01

This paper embeds a bi-fold contribution for Underwater Wireless Sensor Networks (UWSNs); performance analysis of incremental relaying in terms of outage and error probability, and based on the analysis proposition of two new cooperative routing protocols. Subject to the first contribution, a three step procedure is carried out; a system model is presented, the number of available relays are determined, and based on cooperative incremental retransmission methodology, closed-form expressions for outage and error probability are derived. Subject to the second contribution, Adaptive Cooperation in Energy (ACE) efficient depth based routing and Enhanced-ACE (E-ACE) are presented. In the proposed model, feedback mechanism indicates success or failure of data transmission. If direct transmission is successful, there is no need for relaying by cooperative relay nodes. In case of failure, all the available relays retransmit the data one by one till the desired signal quality is achieved at destination. Simulation results show that the ACE and E-ACE significantly improves network performance, i.e., throughput, when compared with other incremental relaying protocols like Cooperative Automatic Repeat reQuest (CARQ). E-ACE and ACE achieve 69% and 63% more throughput respectively as compared to CARQ in hard underwater environment. PMID:27420061

Efficient data communication protocols for wireless networks

NASA Astrophysics Data System (ADS)

Zeydan, Engin

In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to converge to pure strategy Nash equilibrium with high probability throughout the iterations in the interference impaired network. On the other hand, the regret-matching learning algorithm is noncooperative and requires minimum amount of overhead. The proposed cooperative and regret-matching based distributed algorithms are also compared with centralized solutions through simulation results.

Technology and Cooperation: The Behaviors of Networking.

ERIC Educational Resources Information Center

Martin, Susan K.

1987-01-01

Discusses the pros and cons of library cooperation as exemplified by interlibrary loan and OCLC. Moving away from cooperation toward the more intensive use of local systems is suggested as one alternative for the future. (MES)

Competition among networks highlights the power of the weak

PubMed Central

Iranzo, Jaime; Buldú, Javier M.; Aguirre, Jacobo

2016-01-01

The unpreventable connections between real networked systems have recently called for an examination of percolation, diffusion or synchronization phenomena in multilayer networks. Here we use network science and game theory to explore interactions in networks-of-networks and model these as a game for gaining importance. We propose a viewpoint where networks choose the connection strategies, in contrast with classical approaches where nodes are the active players. Specifically, we investigate how creating paths between networks leads to different Nash equilibria that determine their structural and dynamical properties. In a wide variety of cases, selecting adequate connections leads to a cooperative solution that allows weak networks to overcome the strongest opponent. Counterintuitively, each weak network can induce a global transition to such cooperative configuration regardless of the actions of the strongest network. This power of the weak reveals a critical dominance of the underdogs in the fate of networks-of-networks. PMID:27841258

Risk of coinfection outbreaks in temporal networks: a case study of a hospital contact network

NASA Astrophysics Data System (ADS)

Rodríguez, Jorge P.; Ghanbarnejad, Fakhteh; Eguíluz, Víctor M.

2017-10-01

We study the spreading of cooperative infections in an empirical temporal network of contacts between people, including health care workers and patients, in a hospital. The system exhibits a phase transition leading to one or several endemic branches, depending on the connectivity pattern and the temporal correlations. There are two endemic branches in the original setting and the non-cooperative case. However, the cooperative interaction between infections reinforces the upper branch, leading to a smaller epidemic threshold and a higher probability for having a big outbreak. We show the microscopic mechanisms leading to these differences, characterize three different risks, and use the influenza features as an example for this dynamics.

Telemedicine as a Tool for Europe-Africa Cooperation: A Practical Experience

NASA Astrophysics Data System (ADS)

Dinis, Manuel; Santiago, Fernando; Silva, Luís; Ferreira, Ricardo; Machado, José; Castela, Eduardo

This paper presents the experience of an Europe-Africa telemedicine network, focused on the pediatric area, and involving hospitals located in Luanda (Angola), Benguela (Angola), Praia (Cape Verde) and Coimbra (Portugal). In the scope of this network, the cooperation between these hospitals goes beyond the teleconsultation sessions. Tele-training, clinical experience exchange, patient transfer agreements and health staff training to local development of new medical capabilities are some of the involved activities. It is therefore agreed that this kind of technical and knowledge network could also be expanded to other African countries with clear benefits to the local citizens, overcoming the digital-divide and improving the cooperation between developed and developing countries.

Effects of competition and cooperation interaction between agents on networks in the presence of a market capacity

NASA Astrophysics Data System (ADS)

Sonubi, A.; Arcagni, A.; Stefani, S.; Ausloos, M.

2016-08-01

A network effect is introduced taking into account competition, cooperation, and mixed-type interaction among agents along a generalized Verhulst-Lotka-Volterra model. It is also argued that the presence of a market capacity undoubtedly enforces a definite limit on the agent's size growth. The state stability of triadic agents, i.e., the most basic network plaquette, is investigated analytically for possible scenarios, through a fixed-point analysis. It is discovered that: (i) market demand is only satisfied for full competition when one agent monopolizes the market; (ii) growth of agent size is encouraged in full cooperation; (iii) collaboration among agents to compete against one single agent may result in the disappearance of this single agent out of the market; and (iv) cooperating with two rivals may become a growth strategy for an intelligent agent.

Effects of competition and cooperation interaction between agents on networks in the presence of a market capacity.

PubMed

Sonubi, A; Arcagni, A; Stefani, S; Ausloos, M

2016-08-01

A network effect is introduced taking into account competition, cooperation, and mixed-type interaction among agents along a generalized Verhulst-Lotka-Volterra model. It is also argued that the presence of a market capacity undoubtedly enforces a definite limit on the agent's size growth. The state stability of triadic agents, i.e., the most basic network plaquette, is investigated analytically for possible scenarios, through a fixed-point analysis. It is discovered that: (i) market demand is only satisfied for full competition when one agent monopolizes the market; (ii) growth of agent size is encouraged in full cooperation; (iii) collaboration among agents to compete against one single agent may result in the disappearance of this single agent out of the market; and (iv) cooperating with two rivals may become a growth strategy for an intelligent agent.

Visualizing the Comorbidity Burden in Children with Autism Spectrum Disorder Receiving Dental Treatment Under General Anesthesia.

PubMed

Mathu-Muju, Kavita R; Li, Hsin-Fang; Nam, Lisa H; Bush, Heather M

2016-01-01

The purposes of this study were to: (1) describe the comorbidity burden in children with autism spectrum disorder (ASD) receiving dental treatment under general anesthesia (GA); and (2) characterize the complexity of these concurrent comorbidities. A retrospective chart review was completed of 303 children with ASD who received dental treatment under GA. All comorbidities, in addition to the primary diagnosis of ASD, were categorized using the International Classification of Diseases-10 codes. The interconnectedness of the comorbidities was graphically displayed using a network plot. Network indices (degree centrality, betweenness centrality, closeness centrality) were used to characterize the comorbidities that exhibited the highest connectedness to ASD. The network plot of medical diagnoses for children with ASD was highly complex, with multiple connected comorbidities. Developmental delay, speech delay, intellectual disability, and seizure disorders exhibited the highest connectedness to ASD. Children with autism spectrum disorder may have a significant comorbidity burden of closely related neurodevelopmental disorders. The medical history review should assess the severity of these concurrent disorders to evaluate a patient's potential ability to cooperate for dental treatment and to determine appropriate behavior guidance techniques to facilitate the delivery of dental care.

7 CFR Appendix to Subpart A of... - List of Federal Financial Assistance From USDA

Code of Federal Regulations, 2011 CFR

2011-01-01

... Supplemental Food Program for Women, Infants and Children Child Nutrition Act of 1966, Sec. 17, 42 U.S.C. 1786... Administered by the Agricultural Cooperative Service 1. Cooperative Development Cooperative Marketing Act of... Act, D.C. Code, Sec. 31-1518; Title V, Rural Development Act of 1972, as amended; 7 U.S.C. 2661 et seq...

7 CFR Appendix to Subpart A of... - List of Federal Financial Assistance From USDA

Code of Federal Regulations, 2013 CFR

2013-01-01

... Supplemental Food Program for Women, Infants and Children Child Nutrition Act of 1966, Sec. 17, 42 U.S.C. 1786... Administered by the Agricultural Cooperative Service 1. Cooperative Development Cooperative Marketing Act of... Act, D.C. Code, Sec. 31-1518; Title V, Rural Development Act of 1972, as amended; 7 U.S.C. 2661 et seq...

7 CFR Appendix to Subpart A of... - List of Federal Financial Assistance From USDA

Code of Federal Regulations, 2010 CFR

2010-01-01

... Supplemental Food Program for Women, Infants and Children Child Nutrition Act of 1966, Sec. 17, 42 U.S.C. 1786... Administered by the Agricultural Cooperative Service 1. Cooperative Development Cooperative Marketing Act of... Act, D.C. Code, Sec. 31-1518; Title V, Rural Development Act of 1972, as amended; 7 U.S.C. 2661 et seq...

7 CFR Appendix to Subpart A of... - List of Federal Financial Assistance From USDA

Code of Federal Regulations, 2014 CFR

2014-01-01

... Supplemental Food Program for Women, Infants and Children Child Nutrition Act of 1966, Sec. 17, 42 U.S.C. 1786... Administered by the Agricultural Cooperative Service 1. Cooperative Development Cooperative Marketing Act of... Act, D.C. Code, Sec. 31-1518; Title V, Rural Development Act of 1972, as amended; 7 U.S.C. 2661 et seq...

7 CFR Appendix to Subpart A of... - List of Federal Financial Assistance From USDA

Code of Federal Regulations, 2012 CFR

2012-01-01

... Supplemental Food Program for Women, Infants and Children Child Nutrition Act of 1966, Sec. 17, 42 U.S.C. 1786... Administered by the Agricultural Cooperative Service 1. Cooperative Development Cooperative Marketing Act of... Act, D.C. Code, Sec. 31-1518; Title V, Rural Development Act of 1972, as amended; 7 U.S.C. 2661 et seq...

Effect of a large gaming neighborhood and a strategy adaptation neighborhood for bolstering network reciprocity in a prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Ogasawara, Takashi; Tanimoto, Jun; Fukuda, Eriko; Hagishima, Aya; Ikegaya, Naoki

2014-12-01

In 2 × 2 prisoner's dilemma (PD) games, network reciprocity is one mechanism for adding social viscosity, leading to a cooperative equilibrium. In this paper, we explain how gaming neighborhoods and strategy-adaptation neighborhoods affect network reciprocity independently in spatial PD games. We explore an appropriate range of strategy adaptation neighborhoods as opposed to the conventional method of making the gaming and strategy adaptation neighborhoods coincide to enhance the level of cooperation. In cases of expanding gaming neighborhoods, network reciprocity falls to a low level relative to the conventional setting. In the discussion below, which is based on the results of our simulation, we explore how these enhancements come about. Essentially, varying the range of the neighborhoods influences how cooperative clusters form and expand in the evolutionary process.

Cooperation stimulation strategies for peer-to-peer wireless live video-sharing social networks.

PubMed

Lin, W Sabrina; Zhao, H Vicky; Liu, K J Ray

2010-07-01

Human behavior analysis in video sharing social networks is an emerging research area, which analyzes the behavior of users who share multimedia content and investigates the impact of human dynamics on video sharing systems. Users watching live streaming in the same wireless network share the same limited bandwidth of backbone connection to the Internet, thus, they might want to cooperate with each other to obtain better video quality. These users form a wireless live-streaming social network. Every user wishes to watch video with high quality while paying as little as possible cost to help others. This paper focuses on providing incentives for user cooperation. We propose a game-theoretic framework to model user behavior and to analyze the optimal strategies for user cooperation simulation in wireless live streaming. We first analyze the Pareto optimality and the time-sensitive bargaining equilibrium of the two-person game. We then extend the solution to the multiuser scenario. We also consider potential selfish users' cheating behavior and malicious users' attacking behavior and analyze the performance of the proposed strategies with the existence of cheating users and malicious attackers. Both our analytical and simulation results show that the proposed strategies can effectively stimulate user cooperation, achieve cheat free and attack resistance, and help provide reliable services for wireless live streaming applications.

Extension of analog network coding in wireless information exchange

NASA Astrophysics Data System (ADS)

Chen, Cheng; Huang, Jiaqing

2012-01-01

Ever since the concept of analog network coding(ANC) was put forward by S.Katti, much attention has been focused on how to utilize analog network coding to take advantage of wireless interference, which used to be considered generally harmful, to improve throughput performance. Previously, only the case of two nodes that need to exchange information has been fully discussed while the issue of extending analog network coding to more than three nodes remains undeveloped. In this paper, we propose a practical transmission scheme to extend analog network coding to more than two nodes that need to exchange information among themselves. We start with the case of three nodes that need to exchange information and demonstrate that through utilizing our algorithm, the throughput can achieve 33% and 20% increase compared with that of traditional transmission scheduling and digital network coding, respectively. Then, we generalize the algorithm so that it can fit for occasions with any number of nodes. We also discuss some technical issues and throughput analysis as well as the bit error rate.

75 FR 61501 - Cooperative Agreement To Support Capacity Building Activities Through the World Health...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-05

... Foodborne Infections Network AGENCY: Food and Drug Administration, HHS. ACTION: Notice. SUMMARY: The Food... application to award a cooperative agreement to the World Health Organization (WHO) Advisory Group on... Infections Network (GFN) and to provide guidance to the WHO on a framework for the development of an...

A Study of Cooperative, Networking, and Computer Activities in Southwestern Libraries.

ERIC Educational Resources Information Center

Corbin, John

The Southwestern Library Association (SWLA) conducted an inventory and study of the SWLA libraries in cooperative, network, and computer activities to collect data for use in planning future activities and in minimizing duplication of efforts. Questionnaires were mailed to 2,060 academic, public, and special libraries in the six SWLA states.…

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

PubMed

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

2013-05-15

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

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

PubMed Central

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

2013-01-01

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

Coevolution of dynamical states and interactions in dynamic networks

NASA Astrophysics Data System (ADS)

Zimmermann, Martín G.; Eguíluz, Víctor M.; San Miguel, Maxi

2004-06-01

We explore the coupled dynamics of the internal states of a set of interacting elements and the network of interactions among them. Interactions are modeled by a spatial game and the network of interaction links evolves adapting to the outcome of the game. As an example, we consider a model of cooperation in which the adaptation is shown to facilitate the formation of a hierarchical interaction network that sustains a highly cooperative stationary state. The resulting network has the characteristics of a small world network when a mechanism of local neighbor selection is introduced in the adaptive network dynamics. The highly connected nodes in the hierarchical structure of the network play a leading role in the stability of the network. Perturbations acting on the state of these special nodes trigger global avalanches leading to complete network reorganization.

Technologies for network-centric C4ISR

NASA Astrophysics Data System (ADS)

Dunkelberger, Kirk A.

2003-07-01

Three technologies form the heart of any network-centric command, control, communication, intelligence, surveillance, and reconnaissance (C4ISR) system: distributed processing, reconfigurable networking, and distributed resource management. Distributed processing, enabled by automated federation, mobile code, intelligent process allocation, dynamic multiprocessing groups, check pointing, and other capabilities creates a virtual peer-to-peer computing network across the force. Reconfigurable networking, consisting of content-based information exchange, dynamic ad-hoc routing, information operations (perception management) and other component technologies forms the interconnect fabric for fault tolerant inter processor and node communication. Distributed resource management, which provides the means for distributed cooperative sensor management, foe sensor utilization, opportunistic collection, symbiotic inductive/deductive reasoning and other applications provides the canonical algorithms for network-centric enterprises and warfare. This paper introduces these three core technologies and briefly discusses a sampling of their component technologies and their individual contributions to network-centric enterprises and warfare. Based on the implied requirements, two new algorithms are defined and characterized which provide critical building blocks for network centricity: distributed asynchronous auctioning and predictive dynamic source routing. The first provides a reliable, efficient, effective approach for near-optimal assignment problems; the algorithm has been demonstrated to be a viable implementation for ad-hoc command and control, object/sensor pairing, and weapon/target assignment. The second is founded on traditional dynamic source routing (from mobile ad-hoc networking), but leverages the results of ad-hoc command and control (from the contributed auctioning algorithm) into significant increases in connection reliability through forward prediction. Emphasis is placed on the advantages gained from the closed-loop interaction of the multiple technologies in the network-centric application environment.

Cooperative behavior cascades in human social networks

PubMed Central

Fowler, James H.; Christakis, Nicholas A.

2010-01-01

Theoretical models suggest that social networks influence the evolution of cooperation, but to date there have been few experimental studies. Observational data suggest that a wide variety of behaviors may spread in human social networks, but subjects in such studies can choose to befriend people with similar behaviors, posing difficulty for causal inference. Here, we exploit a seminal set of laboratory experiments that originally showed that voluntary costly punishment can help sustain cooperation. In these experiments, subjects were randomly assigned to a sequence of different groups to play a series of single-shot public goods games with strangers; this feature allowed us to draw networks of interactions to explore how cooperative and uncooperative behaviors spread from person to person to person. We show that, in both an ordinary public goods game and in a public goods game with punishment, focal individuals are influenced by fellow group members’ contribution behavior in future interactions with other individuals who were not a party to the initial interaction. Furthermore, this influence persists for multiple periods and spreads up to three degrees of separation (from person to person to person to person). The results suggest that each additional contribution a subject makes to the public good in the first period is tripled over the course of the experiment by other subjects who are directly or indirectly influenced to contribute more as a consequence. These results show experimentally that cooperative behavior cascades in human social networks. PMID:20212120

Evolutionary Dynamics of Collective Action in Structured Populations

NASA Astrophysics Data System (ADS)

Santos, Marta Daniela de Almeida

The pervasiveness of cooperation in Nature is not easily explained. If evolution is characterized by competition and survival of the fittest, why should selfish individuals cooperate with each other? Evolutionary Game Theory (EGT) provides a suitable mathematical framework to study this problem, central to many areas of science. Conventionally, interactions between individuals are modeled in terms of one-shot, symmetric 2-Person Dilemmas of Cooperation, but many real-life situations involve decisions within groups with more than 2 individuals, which are best-dealt in the framework of N-Person games. In this Thesis, we investigate the evolutionary dynamics of two paradigmatic collective social dilemmas - the N-Person Prisoner's Dilemma (NPD) and the N-Person Snowdrift Game (NSG) on structured populations, modeled by networks with diverse topological properties. Cooperative strategies are just one example of the many traits that can be transmitted on social networks. Several recent studies based on empirical evidence from a medical database have suggested the existence of a 3 degrees of influence rule, according to which not only our "friends", but also our friends' friends, and our friends' friends' friends, have a non-trivial influence on our decisions. We investigate the degree of peer influence that emerges from the spread of cooperative strategies, opinions and diseases on populations with distinct underlying networks of contacts. Our results show that networks naturally entangle individuals into interactions of many-body nature and that for each network class considered different processes lead to identical degrees of influence. None

Selective investment promotes cooperation in public goods game

NASA Astrophysics Data System (ADS)

Li, Jing; Wu, Te; Zeng, Gang; Wang, Long

2012-08-01

Most previous investigations on spatial Public Goods Game assume that individuals treat neighbors equivalently, which is in sharp contrast with realistic situations, where bias is ubiquitous. We construct a model to study how a selective investment mechanism affects the evolution of cooperation. Cooperators selectively contribute to just a fraction among their neighbors. According to the interaction result, the investment network can be adapted. On selecting investees, three patterns are considered. In the random pattern, cooperators choose their investees among the neighbors equiprobably. In the social-preference pattern, cooperators tend to invest to individuals possessing large social ties. In the wealth-preference pattern, cooperators are more likely to invest to neighbors with higher payoffs. Our result shows robustness of selective investment mechanism that boosts emergence and maintenance of cooperation. Cooperation is more or less hampered under the latter two patterns, and we prove the anti-social-preference or anti-wealth-preference pattern of selecting investees can accelerate cooperation to some extent. Furthermore, the theoretical analysis of our mechanism on double-star networks coincides with simulation results. We hope our finding could shed light on better understanding of the emergence of cooperation among adaptive populations.

Extortion provides alternative routes to the evolution of cooperation in structured populations

NASA Astrophysics Data System (ADS)

Xu, Xiongrui; Rong, Zhihai; Wu, Zhi-Xi; Zhou, Tao; Tse, Chi Kong

2017-05-01

In this paper, we study the evolution of cooperation in structured populations (individuals are located on either a regular lattice or a scale-free network) in the context of repeated games by involving three types of strategies, namely, unconditional cooperation, unconditional defection, and extortion. The strategy updating of the players is ruled by the replicator-like dynamics. We find that extortion strategies can act as catalysts to promote the emergence of cooperation in structured populations via different mechanisms. Specifically, on regular lattice, extortioners behave as both a shield, which can enwrap cooperators inside and keep them away from defectors, and a spear, which can defeat those surrounding defectors with the help of the neighboring cooperators. Particularly, the enhancement of cooperation displays a resonance-like behavior, suggesting the existence of optimal extortion strength mostly favoring the evolution of cooperation, which is in good agreement with the predictions from the generalized mean-field approximation theory. On scale-free network, the hubs, who are likely occupied by extortioners or defectors at the very beginning, are then prone to be conquered by cooperators on small-degree nodes as time elapses, thus establishing a bottom-up mechanism for the emergence and maintenance of cooperation.

Innovative Improvement and Intensification of Business Relationships Supported by Cooperative Networks

NASA Astrophysics Data System (ADS)

Vančová, Viera; Čambál, Miloš; Cagáňová, Dagmar

2012-12-01

Nowadays, the opportunity for companies to be involved in cluster initiatives and international business associations is a major factor that contributes to the increase of their innovative potential. Companies organized in technological clusters have greater access to mutual business contacts, faster information transfer and deployment of advanced technologies. These companies cooperate more frequently with universities and research - development institutions on innovative projects. An important benefit of cluster associations is that they create a suitable environment for innovation and the transfer of knowledge by means of international cooperation and networking. This supportive environment is not easy to access for different small and mediumsized companies, who are not members of any clusters or networks. Supplier-customer business channels expand by means of transnational networks and exchanges of experience. Knowledge potential is broadened and joint innovative projects are developed. Reflecting the growing importance of clusters as driving forces of economic and regional development, a number of cluster policies and initiatives have emerged in the last few decades, oriented to encourage the establishment of new clusters, to support existing clusters, or to assist the development of transnational cooperation. To achieve the goals of the Europe 2020 Strategy, European countries should have an interest in building strong clusters and developing cluster cooperation by sharing specialized research infrastructures and testing facilities and facilitating knowledge transfer for crossborder cooperation. This requires developing a long term joint strategy in order to facilitate the development of open global clusters and innovative small and medium entrepreneurs.

Delay Analysis of Car-to-Car Reliable Data Delivery Strategies Based on Data Mulling with Network Coding

NASA Astrophysics Data System (ADS)

Park, Joon-Sang; Lee, Uichin; Oh, Soon Young; Gerla, Mario; Lun, Desmond Siumen; Ro, Won Woo; Park, Joonseok

Vehicular ad hoc networks (VANET) aims to enhance vehicle navigation safety by providing an early warning system: any chance of accidents is informed through the wireless communication between vehicles. For the warning system to work, it is crucial that safety messages be reliably delivered to the target vehicles in a timely manner and thus reliable and timely data dissemination service is the key building block of VANET. Data mulling technique combined with three strategies, network codeing, erasure coding and repetition coding, is proposed for the reliable and timely data dissemination service. Particularly, vehicles in the opposite direction on a highway are exploited as data mules, mobile nodes physically delivering data to destinations, to overcome intermittent network connectivity cause by sparse vehicle traffic. Using analytic models, we show that in such a highway data mulling scenario the network coding based strategy outperforms erasure coding and repetition based strategies.

Networks of recyclable material waste-picker’s cooperatives: An alternative for the solid waste management in the city of Rio de Janeiro

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

Tirado-Soto, Magda Martina, E-mail: magda@pep.ufrj.br; Zamberlan, Fabio Luiz, E-mail: fabio@pep.ufrj.br

Highlights: ► In the marketing of recyclable materials, the waste-pickers are the least wins. ► It is proposed creating a network of recycling cooperatives to achieve viability. ► The waste-pickers contribute to waste management to the city. - Abstract: The objective of this study is to discuss the role of networks formed of waste-picker cooperatives in ameliorating problems of final disposal of solid waste in the city of Rio de Janeiro, since the city’s main landfill will soon have to close because of exhausted capacity. However, it is estimated that in the city of Rio de Janeiro there are aroundmore » five thousand waste-pickers working in poor conditions, with lack of physical infrastructure and training, but contributing significantly by diverting solid waste from landfills. According to the Sustainable Development Indicators (IBGE, 2010a,b) in Brazil, recycling rates hover between 45% and 55%. In the municipality of Rio de Janeiro, only 1% of the waste produced is collected selectively by the government (COMLURB, 2010), demonstrating that recycling is mainly performed by waste-pickers. Furthermore, since the recycling market is an oligopsony that requires economies of scale to negotiate directly with industries, the idea of working in networks of cooperatives meets the demands for joint marketing of recyclable materials. Thus, this work presents a method for creating and structuring a network of recycling cooperatives, with prior training for working in networks, so that the expected synergies and joint efforts can lead to concrete results. We intend to demonstrate that it is first essential to strengthen the waste-pickers’ cooperatives in terms of infrastructure, governance and training so that solid waste management can be environmentally, socially and economically sustainable in the city of Rio de Janeiro.« less

DoD Electronic Data Interchange (EDI) Convention: ASC X12 Transaction Set 836 Contract Award (Version 003010)

DTIC Science & Technology

1993-01-01

upon designation of DoD Activity Address Code (DoDAAC) or other code coordinated with the value-added network (VAN). Mandatory ISA06 106 Interc.ange...coordinated with the value-added network (VAN). Non-DoD activities use identification code qualified by ISA05 and coordinated with the VAN. Mandatory...designation of DoD Activity Address Code (DoDAAC) or other code coordinated with the value-added network (VAN). Mandatory ISA08 107 Interchange Receiver

Promoting cooperation by preventing exploitation: The role of network structure

NASA Astrophysics Data System (ADS)

Utkovski, Zoran; Stojkoski, Viktor; Basnarkov, Lasko; Kocarev, Ljupco

2017-08-01

A growing body of empirical evidence indicates that social and cooperative behavior can be affected by cognitive and neurological factors, suggesting the existence of state-based decision-making mechanisms that may have emerged by evolution. Motivated by these observations, we propose a simple mechanism of anonymous network interactions identified as a form of generalized reciprocity—a concept organized around the premise "help anyone if helped by someone'—and study its dynamics on random graphs. In the presence of such a mechanism, the evolution of cooperation is related to the dynamics of the levels of investments (i.e., probabilities of cooperation) of the individual nodes engaging in interactions. We demonstrate that the propensity for cooperation is determined by a network centrality measure here referred to as neighborhood importance index and discuss relevant implications to natural and artificial systems. To address the robustness of the state-based strategies to an invasion of defectors, we additionally provide an analysis which redefines the results for the case when a fraction of the nodes behave as unconditional defectors.

The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks

PubMed Central

Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue

2018-01-01

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C/2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C/2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi’s model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments. PMID:29401668

The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks.

PubMed

Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue

2018-02-03

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C /2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C /2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi's model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.

Effects of Individual's Self-Examination on Cooperation in Prisoner's Dilemma Game

NASA Astrophysics Data System (ADS)

Guan, Jian-Yue; Sun, Jin-Tu; Wang, Ying-Hai

We study a spatial evolutionary prisoner's dilemma game on regular network's one-dimensional regular ring and two-dimensional square lattice. The individuals located on the sites of networks can either cooperate with their neighbors or defect. The effects of individual's self-examination are introduced. Using Monte Carlo simulations and pair approximation method, we investigate the average density of cooperators in the stationary state for various values of payoff parameters b and the time interval Δt. The effects of the fraction p of players in the system who are using the self-examination on cooperation are also discussed. It is shown that compared with the case of no individual's self-examination, the persistence of cooperation is inhibited when the payoff parameter b is small and at certain Δt (Δt > 0) or p (p > 0), cooperation is mostly inhibited, while when b is large, the emergence of cooperation can be remarkably enhanced and mostly enhanced at Δt = 0 or p = 1.

Cooperative Game-Based Energy Efficiency Management over Ultra-Dense Wireless Cellular Networks

PubMed Central

Li, Ming; Chen, Pengpeng; Gao, Shouwan

2016-01-01

Ultra-dense wireless cellular networks have been envisioned as a promising technique for handling the explosive increase of wireless traffic volume. With the extensive deployment of small cells in wireless cellular networks, the network spectral efficiency (SE) is improved with the use of limited frequency. However, the mutual inter-tier and intra-tier interference between or among small cells and macro cells becomes serious. On the other hand, more chances for potential cooperation among different cells are introduced. Energy efficiency (EE) has become one of the most important problems for future wireless networks. This paper proposes a cooperative bargaining game-based method for comprehensive EE management in an ultra-dense wireless cellular network, which highlights the complicated interference influence on energy-saving challenges and the power-coordination process among small cells and macro cells. Especially, a unified EE utility with the consideration of the interference mitigation is proposed to jointly address the SE, the deployment efficiency (DE), and the EE. In particular, closed-form power-coordination solutions for the optimal EE are derived to show the convergence property of the algorithm. Moreover, a simplified algorithm is presented to reduce the complexity of the signaling overhead, which is significant for ultra-dense small cells. Finally, numerical simulations are provided to illustrate the efficiency of the proposed cooperative bargaining game-based and simplified schemes. PMID:27649170

Cooperative Game-Based Energy Efficiency Management over Ultra-Dense Wireless Cellular Networks.

PubMed

Li, Ming; Chen, Pengpeng; Gao, Shouwan

2016-09-13

Ultra-dense wireless cellular networks have been envisioned as a promising technique for handling the explosive increase of wireless traffic volume. With the extensive deployment of small cells in wireless cellular networks, the network spectral efficiency (SE) is improved with the use of limited frequency. However, the mutual inter-tier and intra-tier interference between or among small cells and macro cells becomes serious. On the other hand, more chances for potential cooperation among different cells are introduced. Energy efficiency (EE) has become one of the most important problems for future wireless networks. This paper proposes a cooperative bargaining game-based method for comprehensive EE management in an ultra-dense wireless cellular network, which highlights the complicated interference influence on energy-saving challenges and the power-coordination process among small cells and macro cells. Especially, a unified EE utility with the consideration of the interference mitigation is proposed to jointly address the SE, the deployment efficiency (DE), and the EE. In particular, closed-form power-coordination solutions for the optimal EE are derived to show the convergence property of the algorithm. Moreover, a simplified algorithm is presented to reduce the complexity of the signaling overhead, which is significant for ultra-dense small cells. Finally, numerical simulations are provided to illustrate the efficiency of the proposed cooperative bargaining game-based and simplified schemes.

The queueing perspective of asynchronous network coding in two-way relay network

NASA Astrophysics Data System (ADS)

Liang, Yaping; Chang, Qing; Li, Xianxu

2018-04-01

Asynchronous network coding (NC) has potential to improve the wireless network performance compared with a routing or the synchronous network coding. Recent researches concentrate on the optimization between throughput/energy consuming and delay with a couple of independent input flow. However, the implementation of NC requires a thorough investigation of its impact on relevant queueing systems where few work focuses on. Moreover, few works study the probability density function (pdf) in network coding scenario. In this paper, the scenario with two independent Poisson input flows and one output flow is considered. The asynchronous NC-based strategy is that a new arrival evicts a head packet holding in its queue when waiting for another packet from the other flow to encode. The pdf for the output flow which contains both coded and uncoded packets is derived. Besides, the statistic characteristics of this strategy are analyzed. These results are verified by numerical simulations.

The prisoner’s dilemma on co-evolving networks under perfect rationality

NASA Astrophysics Data System (ADS)

Biely, Christoly; Dragosits, Klaus; Thurner, Stefan

2007-04-01

We consider the prisoner’s dilemma being played repeatedly on a dynamic network, where agents may choose their actions as well as their co-players. This leads to co-evolution of network structure and strategy patterns of the players. Individual decisions are made fully rationally and are based on local information only. They are made such that links to defecting agents are resolved and that cooperating agents build up new links. The exact form of the updating scheme is motivated by profit maximization and not by imitation. If players update their decisions in a synchronized way the system exhibits oscillatory dynamics: Periods of growing cooperation (and total linkage) alternate with periods of increasing defection. The cyclical behavior is reduced and the system stabilizes at significant total cooperation levels when players are less synchronized. In this regime we find emergent network structures resembling ‘complex’ and hierarchical topology. The exponent of the power-law degree distribution ( γ∼8.6) perfectly matches empirical results for human communication networks.

On optimal designs of transparent WDM networks with 1 + 1 protection leveraged by all-optical XOR network coding schemes

NASA Astrophysics Data System (ADS)

Dao, Thanh Hai

2018-01-01

Network coding techniques are seen as the new dimension to improve the network performances thanks to the capability of utilizing network resources more efficiently. Indeed, the application of network coding to the realm of failure recovery in optical networks has been marking a major departure from traditional protection schemes as it could potentially achieve both rapid recovery and capacity improvement, challenging the prevailing wisdom of trading capacity efficiency for speed recovery and vice versa. In this context, the maturing of all-optical XOR technologies appears as a good match to the necessity of a more efficient protection in transparent optical networks. In addressing this opportunity, we propose to use a practical all-optical XOR network coding to leverage the conventional 1 + 1 optical path protection in transparent WDM optical networks. The network coding-assisted protection solution combines protection flows of two demands sharing the same destination node in supportive conditions, paving the way for reducing the backup capacity. A novel mathematical model taking into account the operation of new protection scheme for optimal network designs is formulated as the integer linear programming. Numerical results based on extensive simulations on realistic topologies, COST239 and NSFNET networks, are presented to highlight the benefits of our proposal compared to the conventional approach in terms of wavelength resources efficiency and network throughput.

Single-shot secure quantum network coding on butterfly network with free public communication

NASA Astrophysics Data System (ADS)

Owari, Masaki; Kato, Go; Hayashi, Masahito

2018-01-01

Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose a secure quantum network code for the butterfly network with free public classical communication in the multiple unicast setting under restricted eavesdropper’s power. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy with shared randomness as additional resource when the eavesdropper wiretaps one of the channels in the butterfly network and also derives the information sending through public classical communication. Our protocol does not require verification process, which ensures single-shot security.

Fashion, Cooperation, and Social Interactions

PubMed Central

Cao, Zhigang; Gao, Haoyu; Qu, Xinglong; Yang, Mingmin; Yang, Xiaoguang

2013-01-01

Fashion plays such a crucial rule in the evolution of culture and society that it is regarded as a second nature to the human being. Also, its impact on economy is quite nontrivial. On what is fashionable, interestingly, there are two viewpoints that are both extremely widespread but almost opposite: conformists think that what is popular is fashionable, while rebels believe that being different is the essence. Fashion color is fashionable in the first sense, and Lady Gaga in the second. We investigate a model where the population consists of the afore-mentioned two groups of people that are located on social networks (a spatial cellular automata network and small-world networks). This model captures two fundamental kinds of social interactions (coordination and anti-coordination) simultaneously, and also has its own interest to game theory: it is a hybrid model of pure competition and pure cooperation. This is true because when a conformist meets a rebel, they play the zero sum matching pennies game, which is pure competition. When two conformists (rebels) meet, they play the (anti-) coordination game, which is pure cooperation. Simulation shows that simple social interactions greatly promote cooperation: in most cases people can reach an extraordinarily high level of cooperation, through a selfish, myopic, naive, and local interacting dynamic (the best response dynamic). We find that degree of synchronization also plays a critical role, but mostly on the negative side. Four indices, namely cooperation degree, average satisfaction degree, equilibrium ratio and complete ratio, are defined and applied to measure people’s cooperation levels from various angles. Phase transition, as well as emergence of many interesting geographic patterns in the cellular automata network, is also observed. PMID:23382799

Remote Video Monitor of Vehicles in Cooperative Information Platform

NASA Astrophysics Data System (ADS)

Qin, Guofeng; Wang, Xiaoguo; Wang, Li; Li, Yang; Li, Qiyan

Detection of vehicles plays an important role in the area of the modern intelligent traffic management. And the pattern recognition is a hot issue in the area of computer vision. An auto- recognition system in cooperative information platform is studied. In the cooperative platform, 3G wireless network, including GPS, GPRS (CDMA), Internet (Intranet), remote video monitor and M-DMB networks are integrated. The remote video information can be taken from the terminals and sent to the cooperative platform, then detected by the auto-recognition system. The images are pretreated and segmented, including feature extraction, template matching and pattern recognition. The system identifies different models and gets vehicular traffic statistics. Finally, the implementation of the system is introduced.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

PubMed

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-03-19

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

PubMed Central

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-01-01

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast. PMID:28335494

Cooperative Efforts in Urban Literacy: Learnings from the Urban Literacy Network's Grant Projects.

ERIC Educational Resources Information Center

Williams, Martha

One of the major activities of the Urban Literacy Network (ULN) is a grants program aimed at supporting cooperative, collaborative approaches to developing resources and support systems for literacy in urban areas. Eleven grants were awarded in 1987-1988 in the following urban areas: Boston; Chicago; Denver; El Paso; Houston; Nashville; Oklahoma…

COOPERATIVE ROUTING FOR DYNAMIC AERIAL LAYER NETWORKS

DTIC Science & Technology

2018-03-01

Advisor, Computing & Communications Division Information Directorate This report is published in the interest of scientific and technical...information accumulation at the physical layer, and study the cooperative routing and resource allocation problems associated with such SU networks...interference power constraint is studied . In [Shi2012Joint], an optimal power and sub-carrier allocation strategy to maximize SUs’ throughput subject to

A dynamically coupled allosteric network underlies binding cooperativity in Src kinase

PubMed Central

Foda, Zachariah H.; Shan, Yibing; Kim, Eric T.; Shaw, David E.; Seeliger, Markus A.

2015-01-01

Protein tyrosine kinases are attractive drug targets because many human diseases are associated with the deregulation of kinase activity. However, how the catalytic kinase domain integrates different signals and switches from an active to an inactive conformation remains incompletely understood. Here we identify an allosteric network of dynamically coupled amino acids in Src kinase that connects regulatory sites to the ATP- and substrate-binding sites. Surprisingly, reactants (ATP and peptide substrates) bind with negative cooperativity to Src kinase while products (ADP and phosphopeptide) bind with positive cooperativity. We confirm the molecular details of the signal relay through the allosteric network by biochemical studies. Experiments on two additional protein tyrosine kinases indicate that the allosteric network may be largely conserved among these enzymes. Our work provides new insights into the regulation of protein tyrosine kinases and establishes a potential conduit by which resistance mutations to ATP-competitive kinase inhibitors can affect their activity. PMID:25600932

Ground-state coding in partially connected neural networks

NASA Technical Reports Server (NTRS)

Baram, Yoram

1989-01-01

Patterns over (-1,0,1) define, by their outer products, partially connected neural networks, consisting of internally strongly connected, externally weakly connected subnetworks. The connectivity patterns may have highly organized structures, such as lattices and fractal trees or nests. Subpatterns over (-1,1) define the subcodes stored in the subnetwork, that agree in their common bits. It is first shown that the code words are locally stable stares of the network, provided that each of the subcodes consists of mutually orthogonal words or of, at most, two words. Then it is shown that if each of the subcodes consists of two orthogonal words, the code words are the unique ground states (absolute minima) of the Hamiltonian associated with the network. The regions of attraction associated with the code words are shown to grow with the number of subnetworks sharing each of the neurons. Depending on the particular network architecture, the code sizes of partially connected networks can be vastly greater than those of fully connected ones and their error correction capabilities can be significantly greater than those of the disconnected subnetworks. The codes associated with lattice-structured and hierarchical networks are discussed in some detail.

Properties of centralized cooperative sensing in cognitive radio networks

NASA Astrophysics Data System (ADS)

Skokowski, Paweł; Malon, Krzysztof; Łopatka, Jerzy

2017-04-01

Spectrum sensing is a functionality that enables network creation in the cognitive radio technology. Spectrum sensing is use for building the situation awareness knowledge for better use of radio resources and to adjust network parameters in case of jamming, interferences from legacy systems, decreasing link quality caused e.g. by nodes positions changes. This paper presents results from performed tests to compare cooperative centralized sensing versus local sensing. All tests were performed in created simulator developed in Matlab/Simulink environment.

Role of investment heterogeneity in the cooperation on spatial public goods game.

PubMed

Yuan, Wu-Jie; Xia, Cheng-Yi

2014-01-01

Public cooperation plays a significant role in the survival and maintenance of biological species, to elucidate its origin thus becomes an interesting question from various disciplines. Through long-term development, the public goods game has proven to be a useful tool, where cooperator making contribution can beat again the free-rides. Differentiating from the traditional homogeneous investment, individual trend of making contribution is more likely affected by the investment level of his neighborhood. Based on this fact, we here investigate the impact of heterogeneous investment on public cooperation, where the investment sum is mapped to the proportion of cooperators determined by parameter α. Interestingly, we find, irrespective of interaction networks, that the increment of α (increment of heterogeneous investment) is beneficial for promoting cooperation and even guarantees the complete cooperation dominance under weak replication factor. While this promotion effect can be attributed to the formation of more robust cooperator clusters and shortening END period. Moreover, we find that this simple mechanism can change the potential interaction network, which results in the change of phase diagrams. We hope that our work may shed light on the understanding of the cooperative behavior in other social dilemmas.

Social contact patterns can buffer costs of forgetting in the evolution of cooperation.

PubMed

Stevens, Jeffrey R; Woike, Jan K; Schooler, Lael J; Lindner, Stefan; Pachur, Thorsten

2018-06-13

Analyses of the evolution of cooperation often rely on two simplifying assumptions: (i) individuals interact equally frequently with all social network members and (ii) they accurately remember each partner's past cooperation or defection. Here, we examine how more realistic, skewed patterns of contact-in which individuals interact primarily with only a subset of their network's members-influence cooperation. In addition, we test whether skewed contact patterns can counteract the decrease in cooperation caused by memory errors (i.e. forgetting). Finally, we compare two types of memory error that vary in whether forgotten interactions are replaced with random actions or with actions from previous encounters. We use evolutionary simulations of repeated prisoner's dilemma games that vary agents' contact patterns, forgetting rates and types of memory error. We find that highly skewed contact patterns foster cooperation and also buffer the detrimental effects of forgetting. The type of memory error used also influences cooperation rates. Our findings reveal previously neglected but important roles of contact pattern, type of memory error and the interaction of contact pattern and memory on cooperation. Although cognitive limitations may constrain the evolution of cooperation, social contact patterns can counteract some of these constraints. © 2018 The Author(s).

Content-Based Multi-Channel Network Coding Algorithm in the Millimeter-Wave Sensor Network

PubMed Central

Lin, Kai; Wang, Di; Hu, Long

2016-01-01

With the development of wireless technology, the widespread use of 5G is already an irreversible trend, and millimeter-wave sensor networks are becoming more and more common. However, due to the high degree of complexity and bandwidth bottlenecks, the millimeter-wave sensor network still faces numerous problems. In this paper, we propose a novel content-based multi-channel network coding algorithm, which uses the functions of data fusion, multi-channel and network coding to improve the data transmission; the algorithm is referred to as content-based multi-channel network coding (CMNC). The CMNC algorithm provides a fusion-driven model based on the Dempster-Shafer (D-S) evidence theory to classify the sensor nodes into different classes according to the data content. By using the result of the classification, the CMNC algorithm also provides the channel assignment strategy and uses network coding to further improve the quality of data transmission in the millimeter-wave sensor network. Extensive simulations are carried out and compared to other methods. Our simulation results show that the proposed CMNC algorithm can effectively improve the quality of data transmission and has better performance than the compared methods. PMID:27376302

Simulation of Code Spectrum and Code Flow of Cultured Neuronal Networks.

PubMed

Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime

2016-01-01

It has been shown that, in cultured neuronal networks on a multielectrode, pseudorandom-like sequences (codes) are detected, and they flow with some spatial decay constant. Each cultured neuronal network is characterized by a specific spectrum curve. That is, we may consider the spectrum curve as a "signature" of its associated neuronal network that is dependent on the characteristics of neurons and network configuration, including the weight distribution. In the present study, we used an integrate-and-fire model of neurons with intrinsic and instantaneous fluctuations of characteristics for performing a simulation of a code spectrum from multielectrodes on a 2D mesh neural network. We showed that it is possible to estimate the characteristics of neurons such as the distribution of number of neurons around each electrode and their refractory periods. Although this process is a reverse problem and theoretically the solutions are not sufficiently guaranteed, the parameters seem to be consistent with those of neurons. That is, the proposed neural network model may adequately reflect the behavior of a cultured neuronal network. Furthermore, such prospect is discussed that code analysis will provide a base of communication within a neural network that will also create a base of natural intelligence.

Competition-cooperation relationship networks characterize the competition and cooperation between proteins

PubMed Central

Li, Hong; Zhou, Yuan; Zhang, Ziding

2015-01-01

By analyzing protein-protein interaction (PPI) networks, one can find that a protein may have multiple binding partners. However, it is difficult to determine whether the interactions with these partners occur simultaneously from binary PPIs alone. Here, we construct the yeast and human competition-cooperation relationship networks (CCRNs) based on protein structural interactomes to clearly exhibit the relationship (competition or cooperation) between two partners of the same protein. If two partners compete for the same interaction interface, they would be connected by a competitive edge; otherwise, they would be connected by a cooperative edge. The properties of three kinds of hubs (i.e., competitive, modest, and cooperative hubs) are analyzed in the CCRNs. Our results show that competitive hubs have higher clustering coefficients and form clusters in the human CCRN, but these tendencies are not observed in the yeast CCRN. We find that the human-specific proteins contribute significantly to these differences. Subsequently, we conduct a series of computational experiments to investigate the regulatory mechanisms that avoid competition between proteins. Our comprehensive analyses reveal that for most yeast and human protein competitors, transcriptional regulation plays an important role. Moreover, the human-specific proteins have a particular preference for other regulatory mechanisms, such as alternative splicing. PMID:26108281

78 FR 54370 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-03

... Yemen Dated: August 26, 2013. Danielle Rolfes, International Tax Counsel, (Tax Policy). [FR Doc. 2013... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an [[Page 54371

Efficient Network Coding-Based Loss Recovery for Reliable Multicast in Wireless Networks

NASA Astrophysics Data System (ADS)

Chi, Kaikai; Jiang, Xiaohong; Ye, Baoliu; Horiguchi, Susumu

Recently, network coding has been applied to the loss recovery of reliable multicast in wireless networks [19], where multiple lost packets are XOR-ed together as one packet and forwarded via single retransmission, resulting in a significant reduction of bandwidth consumption. In this paper, we first prove that maximizing the number of lost packets for XOR-ing, which is the key part of the available network coding-based reliable multicast schemes, is actually a complex NP-complete problem. To address this limitation, we then propose an efficient heuristic algorithm for finding an approximately optimal solution of this optimization problem. Furthermore, we show that the packet coding principle of maximizing the number of lost packets for XOR-ing sometimes cannot fully exploit the potential coding opportunities, and we then further propose new heuristic-based schemes with a new coding principle. Simulation results demonstrate that the heuristic-based schemes have very low computational complexity and can achieve almost the same transmission efficiency as the current coding-based high-complexity schemes. Furthermore, the heuristic-based schemes with the new coding principle not only have very low complexity, but also slightly outperform the current high-complexity ones.

Minimal Increase Network Coding for Dynamic Networks.

PubMed

Zhang, Guoyin; Fan, Xu; Wu, Yanxia

2016-01-01

Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed. By identifying the nonzero elements of an encoding vector, it selects blocks to be encoded on the basis of relationship between the nonzero elements that the controls changes in the degrees of the blocks; then, the encoding time is shortened in a dynamic network. The results of simulations show that, compared with existing encoding algorithms, the MINC algorithm provides reduced computational complexity of encoding and an increased probability of delivery.

Minimal Increase Network Coding for Dynamic Networks

PubMed Central

Wu, Yanxia

2016-01-01

Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed. By identifying the nonzero elements of an encoding vector, it selects blocks to be encoded on the basis of relationship between the nonzero elements that the controls changes in the degrees of the blocks; then, the encoding time is shortened in a dynamic network. The results of simulations show that, compared with existing encoding algorithms, the MINC algorithm provides reduced computational complexity of encoding and an increased probability of delivery. PMID:26867211

Cooperative Learning in Rural and Small Schools. Rural/Small Schools Network Information Exchange: Number 10, Spring 1991.

ERIC Educational Resources Information Center

Regional Laboratory for Educational Improvement of the Northeast & Islands, Andover, MA.

This packet includes reprints of journal articles and other resources pertaining to cooperative learning strategies in small, rural schools. The four sections of the packet cover introduction to cooperative learning, examples of how team strategies and cooperative learning can be used, issues such as program evaluation and public relations, and…

Neural network decoder for quantum error correcting codes

NASA Astrophysics Data System (ADS)

Krastanov, Stefan; Jiang, Liang

Artificial neural networks form a family of extremely powerful - albeit still poorly understood - tools used in anything from image and sound recognition through text generation to, in our case, decoding. We present a straightforward Recurrent Neural Network architecture capable of deducing the correcting procedure for a quantum error-correcting code from a set of repeated stabilizer measurements. We discuss the fault-tolerance of our scheme and the cost of training the neural network for a system of a realistic size. Such decoders are especially interesting when applied to codes, like the quantum LDPC codes, that lack known efficient decoding schemes.

Networks of recyclable material waste-picker's cooperatives: an alternative for the solid waste management in the city of Rio de Janeiro.

PubMed

Tirado-Soto, Magda Martina; Zamberlan, Fabio Luiz

2013-04-01

The objective of this study is to discuss the role of networks formed of waste-picker cooperatives in ameliorating problems of final disposal of solid waste in the city of Rio de Janeiro, since the city's main landfill will soon have to close because of exhausted capacity. However, it is estimated that in the city of Rio de Janeiro there are around five thousand waste-pickers working in poor conditions, with lack of physical infrastructure and training, but contributing significantly by diverting solid waste from landfills. According to the Sustainable Development Indicators (IBGE, 2010a,b) in Brazil, recycling rates hover between 45% and 55%. In the municipality of Rio de Janeiro, only 1% of the waste produced is collected selectively by the government (COMLURB, 2010), demonstrating that recycling is mainly performed by waste-pickers. Furthermore, since the recycling market is an oligopsony that requires economies of scale to negotiate directly with industries, the idea of working in networks of cooperatives meets the demands for joint marketing of recyclable materials. Thus, this work presents a method for creating and structuring a network of recycling cooperatives, with prior training for working in networks, so that the expected synergies and joint efforts can lead to concrete results. We intend to demonstrate that it is first essential to strengthen the waste-pickers' cooperatives in terms of infrastructure, governance and training so that solid waste management can be environmentally, socially and economically sustainable in the city of Rio de Janeiro. Copyright © 2012 Elsevier Ltd. All rights reserved.

Evolution of Cooperation in Continuous Prisoner's Dilemma Games on Barabasi—Albert Networks with Degree-Dependent Guilt Mechanism

NASA Astrophysics Data System (ADS)

Wang, Xian-Jia; Quan, Ji; Liu, Wei-Bing

2012-05-01

This paper studies the continuous prisoner's dilemma games (CPDG) on Barabasi—Albert (BA) networks. In the model, each agent on a vertex of the networks makes an investment and interacts with all of his neighboring agents. Making an investment is costly, but which benefits its neighboring agents, where benefit and cost depend on the level of investment made. The payoff of each agent is given by the sum of payoffs it receives in its interactions with all its neighbors. Not only payoff, individual's guilty emotion in the games has also been considered. The negative guilty emotion produced in comparing with its neighbors can reduce the utility of individuals directly. We assume that the reduction amount depends on the individual's degree and a baseline level parameter. The group's cooperative level is characterized by the average investment of the population. Each player makes his investment in the next step based on a convex combination of the investment of his best neighbors in the last step, his best history strategies in the latest steps which number is controlled by a memory length parameter, and a uniformly distributed random number. Simulation results show that this degree-dependent guilt mechanism can promote the evolution of cooperation dramatically comparing with degree-independent guilt or no guilt cases. Imitation, memory, uncertainty coefficients and network structure also play determinant roles in the cooperation level of the population. All our results may shed some new light on studying the evolution of cooperation based on network reciprocity mechanisms.

In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection

NASA Astrophysics Data System (ADS)

Albano, Michele; Gao, Jie

In a sensor network of n nodes in which k of them have sensed interesting data, we perform in-network erasure coding such that each node stores a linear combination of all the network data with random coefficients. This scheme greatly improves data resilience to node failures: as long as there are k nodes that survive an attack, all the data produced in the sensor network can be recovered with high probability. The in-network coding storage scheme also improves data collection rate by mobile mules and allows for easy scheduling of data mules.

Network Coding on Heterogeneous Multi-Core Processors for Wireless Sensor Networks

PubMed Central

Kim, Deokho; Park, Karam; Ro, Won W.

2011-01-01

While network coding is well known for its efficiency and usefulness in wireless sensor networks, the excessive costs associated with decoding computation and complexity still hinder its adoption into practical use. On the other hand, high-performance microprocessors with heterogeneous multi-cores would be used as processing nodes of the wireless sensor networks in the near future. To this end, this paper introduces an efficient network coding algorithm developed for the heterogenous multi-core processors. The proposed idea is fully tested on one of the currently available heterogeneous multi-core processors referred to as the Cell Broadband Engine. PMID:22164053

Network perturbation by recurrent regulatory variants in cancer

PubMed Central

Cho, Ara; Lee, Insuk; Choi, Jung Kyoon

2017-01-01

Cancer driving genes have been identified as recurrently affected by variants that alter protein-coding sequences. However, a majority of cancer variants arise in noncoding regions, and some of them are thought to play a critical role through transcriptional perturbation. Here we identified putative transcriptional driver genes based on combinatorial variant recurrence in cis-regulatory regions. The identified genes showed high connectivity in the cancer type-specific transcription regulatory network, with high outdegree and many downstream genes, highlighting their causative role during tumorigenesis. In the protein interactome, the identified transcriptional drivers were not as highly connected as coding driver genes but appeared to form a network module centered on the coding drivers. The coding and regulatory variants associated via these interactions between the coding and transcriptional drivers showed exclusive and complementary occurrence patterns across tumor samples. Transcriptional cancer drivers may act through an extensive perturbation of the regulatory network and by altering protein network modules through interactions with coding driver genes. PMID:28333928

Labor union members play an OLG repeated game

PubMed Central

Kandori, Michihiro; Obayashi, Shinya

2014-01-01

Humans are capable of cooperating with one another even when it is costly and a deviation provides an immediate gain. An important reason is that cooperation is reciprocated or rewarded and deviations are penalized in later stages. For cooperation to be sustainable, not only must rewards and penalties be strong enough but individuals should also have the right incentives to provide rewards and punishments. Codes of conduct with such properties have been studied extensively in game theory (as repeated game equilibria), and the literature on the evolution of cooperation shows how equilibrium behavior might emerge and proliferate in society. We found that community unions, a subclass of labor unions that admits individual affiliations, are ideal to corroborate these theories with reality, because (i) their activities are simple and (ii) they have a structure that closely resembles a theoretical model, the overlapping generations repeated game. A detailed case study of a community union revealed a possible equilibrium that can function under the very limited observability in the union. The equilibrium code of conduct appears to be a natural focal point based on simple heuristic reasoning. The union we studied was created out of necessity for cooperation, without knowing or anticipating how cooperation might be sustained. The union has successfully resolved about 3,000 labor disputes and created a number of offspring. PMID:25024211

Modeling Misbehavior in Cooperative Diversity: A Dynamic Game Approach

NASA Astrophysics Data System (ADS)

Dehnie, Sintayehu; Memon, Nasir

2009-12-01

Cooperative diversity protocols are designed with the assumption that terminals always help each other in a socially efficient manner. This assumption may not be valid in commercial wireless networks where terminals may misbehave for selfish or malicious intentions. The presence of misbehaving terminals creates a social-dilemma where terminals exhibit uncertainty about the cooperative behavior of other terminals in the network. Cooperation in social-dilemma is characterized by a suboptimal Nash equilibrium where wireless terminals opt out of cooperation. Hence, without establishing a mechanism to detect and mitigate effects of misbehavior, it is difficult to maintain a socially optimal cooperation. In this paper, we first examine effects of misbehavior assuming static game model and show that cooperation under existing cooperative protocols is characterized by a noncooperative Nash equilibrium. Using evolutionary game dynamics we show that a small number of mutants can successfully invade a population of cooperators, which indicates that misbehavior is an evolutionary stable strategy (ESS). Our main goal is to design a mechanism that would enable wireless terminals to select reliable partners in the presence of uncertainty. To this end, we formulate cooperative diversity as a dynamic game with incomplete information. We show that the proposed dynamic game formulation satisfied the conditions for the existence of perfect Bayesian equilibrium.

Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks.

PubMed

Wang, Wen-Xu; Lai, Ying-Cheng; Armbruster, Dieter

2011-09-01

We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.

Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks

NASA Astrophysics Data System (ADS)

Wang, Wen-Xu; Lai, Ying-Cheng; Armbruster, Dieter

2011-09-01

We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.

The cooperative forestry research unit Commercial Thinning Research Network--9-year results

Treesearch

Robert S. Seymour; Spencer R. Meyer; Robert G. Wagner

2014-01-01

The Commercial Thinning Research Network (CTRN) was established throughout the spruce-fir forest of Maine beginning in 2000 with substantial funding from the University of Maine's Cooperative Forestry Research Unit. One of six replicates of the precommercially thinned stand condition in the CTRN is located in compartment 23A in the U.S. Department of Agriculture,...

DISSAnet: Development of an Information Science Research Network in the Republic of South Africa 1998-2000

ERIC Educational Resources Information Center

Wormell, Irene; Bothma, Theo J. D.; Ralebipi, Rocky M. D.

2002-01-01

Based on the concept of the NORDIC academic cooperation model (NorFa), in 1998-2000 Danish and international information scientists initiated a co-operative effort to build an education and research network among LIS institutions in South Africa. The paper reports the successful completion of the project, with 20 MA and Ph.D. students selected…

Power allocation strategies to minimize energy consumption in wireless body area networks.

PubMed

Kailas, Aravind

2011-01-01

The wide scale deployment of wireless body area networks (WBANs) hinges on designing energy efficient communication protocols to support the reliable communication as well as to prolong the network lifetime. Cooperative communications, a relatively new idea in wireless communications, offers the benefits of multi-antenna systems, thereby improving the link reliability and boosting energy efficiency. In this short paper, the advantages of resorting to cooperative communications for WBANs in terms of minimized energy consumption are investigated. Adopting an energy model that encompasses energy consumptions in the transmitter and receiver circuits, and transmitting energy per bit, it is seen that cooperative transmission can improve energy efficiency of the wireless network. In particular, the problem of optimal power allocation is studied with the constraint of targeted outage probability. Two strategies of power allocation are considered: power allocation with and without posture state information. Using analysis and simulation-based results, two key points are demonstrated: (i) allocating power to the on-body sensors making use of the posture information can reduce the total energy consumption of the WBAN; and (ii) when the channel condition is good, it is better to recruit less relays for cooperation to enhance energy efficiency.

Robustness of coevolution in resolving prisoner's dilemma games on interdependent networks subject to attack

NASA Astrophysics Data System (ADS)

Liu, Penghui; Liu, Jing

2017-08-01

Recently, coevolution between strategy and network structure has been established as a rule to resolve social dilemmas and reach optimal situations for cooperation. Many follow-up researches have focused on studying how coevolution helps networks reorganize to deter the defectors and many coevolution methods have been proposed. However, the robustness of the coevolution rules against attacks have not been studied much. Since attacks may directly influence the original evolutionary process of cooperation, the robustness should be an important index while evaluating the quality of a coevolution method. In this paper, we focus on investigating the robustness of an elementary coevolution method in resolving the prisoner's dilemma game upon the interdependent networks. Three different types of time-independent attacks, named as edge attacks, instigation attacks and node attacks have been employed to test its robustness. Through analyzing the simulation results obtained, we find this coevolution method is relatively robust against the edge attack and the node attack as it successfully maintains cooperation in the population over the entire attack range. However, when the instigation probability of the attacked individuals is large or the attack range of instigation attack is wide enough, coevolutionary rule finally fails in maintaining cooperation in the population.

A Novel Design of Reconfigurable Wavelength-Time Optical Codes to Enhance Security in Optical CDMA Networks

NASA Astrophysics Data System (ADS)

Nasaruddin; Tsujioka, Tetsuo

An optical CDMA (OCDMA) system is a flexible technology for future broadband multiple access networks. A secure OCDMA network in broadband optical access technologies is also becoming an issue of great importance. In this paper, we propose novel reconfigurable wavelength-time (W-T) optical codes that lead to secure transmission in OCDMA networks. The proposed W-T optical codes are constructed by using quasigroups (QGs) for wavelength hopping and one-dimensional optical orthogonal codes (OOCs) for time spreading; we call them QGs/OOCs. Both QGs and OOCs are randomly generated by a computer search to ensure that an eavesdropper could not improve its interception performance by making use of the coding structure. Then, the proposed reconfigurable QGs/OOCs can provide more codewords, and many different code set patterns, which differ in both wavelength and time positions for given code parameters. Moreover, the bit error probability of the proposed codes is analyzed numerically. To realize the proposed codes, a secure system is proposed by employing reconfigurable encoders/decoders based on array waveguide gratings (AWGs), which allow the users to change their codeword patterns to protect against eavesdropping. Finally, the probability of breaking a certain codeword in the proposed system is evaluated analytically. The results show that the proposed codes and system can provide a large codeword pattern, and decrease the probability of breaking a certain codeword, to enhance OCDMA network security.

On Applicability of Network Coding Technique for 6LoWPAN-based Sensor Networks.

PubMed

Amanowicz, Marek; Krygier, Jaroslaw

2018-05-26

In this paper, the applicability of the network coding technique in 6LoWPAN-based sensor multihop networks is examined. The 6LoWPAN is one of the standards proposed for the Internet of Things architecture. Thus, we can expect the significant growth of traffic in such networks, which can lead to overload and decrease in the sensor network lifetime. The authors propose the inter-session network coding mechanism that can be implemented in resource-limited sensor motes. The solution reduces the overall traffic in the network, and in consequence, the energy consumption is decreased. Used procedures take into account deep header compressions of the native 6LoWPAN packets and the hop-by-hop changes of the header structure. Applied simplifications reduce signaling traffic that is typically occurring in network coding deployments, keeping the solution usefulness for the wireless sensor networks with limited resources. The authors validate the proposed procedures in terms of end-to-end packet delay, packet loss ratio, traffic in the air, total energy consumption, and network lifetime. The solution has been tested in a real wireless sensor network. The results confirm the efficiency of the proposed technique, mostly in delay-tolerant sensor networks.

From degree-correlated to payoff-correlated activity for an optimal resolution of social dilemmas

NASA Astrophysics Data System (ADS)

Aleta, Alberto; Meloni, Sandro; Perc, Matjaž; Moreno, Yamir

2016-12-01

An active participation of players in evolutionary games depends on several factors, ranging from personal stakes to the properties of the interaction network. Diverse activity patterns thus have to be taken into account when studying the evolution of cooperation in social dilemmas. Here we study the weak prisoner's dilemma game, where the activity of each player is determined in a probabilistic manner either by its degree or by its payoff. While degree-correlated activity introduces cascading failures of cooperation that are particularly severe on scale-free networks with frequently inactive hubs, payoff-correlated activity provides a more nuanced activity profile, which ultimately hinders systemic breakdowns of cooperation. To determine optimal conditions for the evolution of cooperation, we introduce an exponential decay to payoff-correlated activity that determines how fast the activity of a player returns to its default state. We show that there exists an intermediate decay rate at which the resolution of the social dilemma is optimal. This can be explained by the emerging activity patterns of players, where the inactivity of hubs is compensated effectively by the increased activity of average-degree players, who through their collective influence in the network sustain a higher level of cooperation. The sudden drops in the fraction of cooperators observed with degree-correlated activity therefore vanish, and so does the need for the lengthy spatiotemporal reorganization of compact cooperative clusters. The absence of such asymmetric dynamic instabilities thus leads to an optimal resolution of social dilemmas, especially when the conditions for the evolution of cooperation are strongly adverse.

Continuous-variable quantum network coding for coherent states

NASA Astrophysics Data System (ADS)

Shang, Tao; Li, Ke; Liu, Jian-wei

2017-04-01

As far as the spectral characteristic of quantum information is concerned, the existing quantum network coding schemes can be looked on as the discrete-variable quantum network coding schemes. Considering the practical advantage of continuous variables, in this paper, we explore two feasible continuous-variable quantum network coding (CVQNC) schemes. Basic operations and CVQNC schemes are both provided. The first scheme is based on Gaussian cloning and ADD/SUB operators and can transmit two coherent states across with a fidelity of 1/2, while the second scheme utilizes continuous-variable quantum teleportation and can transmit two coherent states perfectly. By encoding classical information on quantum states, quantum network coding schemes can be utilized to transmit classical information. Scheme analysis shows that compared with the discrete-variable paradigms, the proposed CVQNC schemes provide better network throughput from the viewpoint of classical information transmission. By modulating the amplitude and phase quadratures of coherent states with classical characters, the first scheme and the second scheme can transmit 4{log _2}N and 2{log _2}N bits of information by a single network use, respectively.

A new HLA-based distributed control architecture for agricultural teams of robots in hybrid applications with real and simulated devices or environments.

PubMed

Nebot, Patricio; Torres-Sospedra, Joaquín; Martínez, Rafael J

2011-01-01

The control architecture is one of the most important part of agricultural robotics and other robotic systems. Furthermore its importance increases when the system involves a group of heterogeneous robots that should cooperate to achieve a global goal. A new control architecture is introduced in this paper for groups of robots in charge of doing maintenance tasks in agricultural environments. Some important features such as scalability, code reuse, hardware abstraction and data distribution have been considered in the design of the new architecture. Furthermore, coordination and cooperation among the different elements in the system is allowed in the proposed control system. By integrating a network oriented device server Player, Java Agent Development Framework (JADE) and High Level Architecture (HLA), the previous concepts have been considered in the new architecture presented in this paper. HLA can be considered the most important part because it not only allows the data distribution and implicit communication among the parts of the system but also allows to simultaneously operate with simulated and real entities, thus allowing the use of hybrid systems in the development of applications.

Towards effective payoffs in the prisoner’s dilemma game on scale-free networks

NASA Astrophysics Data System (ADS)

Szolnoki, Attila; Perc, Matjaž; Danku, Zsuzsa

2008-03-01

We study the transition towards effective payoffs in the prisoner's dilemma game on scale-free networks by introducing a normalization parameter guiding the system from accumulated payoffs to payoffs normalized with the connectivity of each agent. We show that during this transition the heterogeneity-based ability of scale-free networks to facilitate cooperative behavior deteriorates continuously, eventually collapsing with the results obtained on regular graphs. The strategy donations and adaptation probabilities of agents with different connectivities are studied. Results reveal that strategies generally spread from agents with larger towards agents with smaller degree. However, this strategy adoption flow reverses sharply in the fully normalized payoff limit. Surprisingly, cooperators occupy the hubs even if the averaged cooperation level due to partly normalized payoffs is moderate.

Cooperative Spatial Retreat for Resilient Drone Networks.

PubMed

Kang, Jin-Hyeok; Kwon, Young-Min; Park, Kyung-Joon

2017-05-03

Drones are broadening their scope to various applications such as networking, package delivery, agriculture, rescue, and many more. For proper operation of drones, reliable communication should be guaranteed because drones are remotely controlled. When drones experience communication failure due to bad channel condition, interference, or jamming in a certain area, one existing solution is to exploit mobility or so-called spatial retreat to evacuate them from the communication failure area. However, the conventional spatial retreat scheme moves drones in random directions, which results in inefficient movement with significant evacuation time and waste of battery lifetime. In this paper, we propose a novel spatial retreat technique that takes advantage of cooperation between drones for resilient networking, which is called cooperative spatial retreat (CSR). Our performance evaluation shows that the proposed CSR significantly outperforms existing schemes.

Percolation and cooperation with mobile agents: geometric and strategy clusters.

PubMed

Vainstein, Mendeli H; Brito, Carolina; Arenzon, Jeferson J

2014-08-01

We study the conditions for persistent cooperation in an off-lattice model of mobile agents playing the Prisoner's Dilemma game with pure, unconditional strategies. Each agent has an exclusion radius r(P), which accounts for the population viscosity, and an interaction radius r(int), which defines the instantaneous contact network for the game dynamics. We show that, differently from the r(P)=0 case, the model with finite-sized agents presents a coexistence phase with both cooperators and defectors, besides the two absorbing phases, in which either cooperators or defectors dominate. We provide, in addition, a geometric interpretation of the transitions between phases. In analogy with lattice models, the geometric percolation of the contact network (i.e., irrespective of the strategy) enhances cooperation. More importantly, we show that the percolation of defectors is an essential condition for their survival. Differently from compact clusters of cooperators, isolated groups of defectors will eventually become extinct if not percolating, independently of their size.

Public goods games on adaptive coevolutionary networks

NASA Astrophysics Data System (ADS)

Pichler, Elgar; Shapiro, Avi M.

2017-07-01

Productive societies feature high levels of cooperation and strong connections between individuals. Public Goods Games (PGGs) are frequently used to study the development of social connections and cooperative behavior in model societies. In such games, contributions to the public good are made only by cooperators, while all players, including defectors, reap public goods benefits, which are shares of the contributions amplified by a synergy factor. Classic results of game theory show that mutual defection, as opposed to cooperation, is the Nash Equilibrium of PGGs in well-mixed populations, where each player interacts with all others. In this paper, we explore the coevolutionary dynamics of a low information public goods game on a complex network in which players adapt to their environment in order to increase individual payoffs relative to past payoffs parameterized by greediness. Players adapt by changing their strategies, either to cooperate or to defect, and by altering their social connections. We find that even if players do not know other players' strategies and connectivity, cooperation can arise and persist despite large short-term fluctuations.

Public goods games on adaptive coevolutionary networks.

PubMed

Pichler, Elgar; Shapiro, Avi M

2017-07-01

Productive societies feature high levels of cooperation and strong connections between individuals. Public Goods Games (PGGs) are frequently used to study the development of social connections and cooperative behavior in model societies. In such games, contributions to the public good are made only by cooperators, while all players, including defectors, reap public goods benefits, which are shares of the contributions amplified by a synergy factor. Classic results of game theory show that mutual defection, as opposed to cooperation, is the Nash Equilibrium of PGGs in well-mixed populations, where each player interacts with all others. In this paper, we explore the coevolutionary dynamics of a low information public goods game on a complex network in which players adapt to their environment in order to increase individual payoffs relative to past payoffs parameterized by greediness. Players adapt by changing their strategies, either to cooperate or to defect, and by altering their social connections. We find that even if players do not know other players' strategies and connectivity, cooperation can arise and persist despite large short-term fluctuations.

Deciding to Cooperate in Northern Ghana: Trust as an Evolutionary Constraint Across Cultural Diversity.

PubMed

Acedo-Carmona, Cristina; Gomila, Antoni

2015-11-27

The upper-east and northern regions of Ghana offers a unique opportunity to study the influence of evolutionary social dynamics in making cooperation possible, despite cultural differences. These regions are occupied by several distinct ethnic groups, in interaction, such as the Kussasi, Mamprusi, Bimoba, Konkomba, and Fulani. We will report our fieldwork related to how cooperation takes places there, both within each group and among people from the different groups. Methods included personal networks of cooperation (ego networks), interviews and analysis of group contexts. The most important result is that, while each ethnic group may differ in terms of family and clan structure, a similar pattern can be found in all of them, of cooperation structured around small groups of trust-based close relationships. The study suggests that habitual decisions about cooperation are not strategic or self-interested, but instead are based on unconscious processes sustained by the emotional bonds of trust. These kind of emotional bonds are claimed to be relevant from an evolutionary point of view.

An Adaptive Cooperative Strategy for Underlay MIMO Cognitive Radio Networks: An Opportunistic and Low-Complexity Approach

NASA Astrophysics Data System (ADS)

Mazoochi, M.; Pourmina, M. A.; Bakhshi, H.

2015-03-01

The core aim of this work is the maximization of the achievable data rate of the secondary user pairs (SU pairs), while ensuring the QoS of primary users (PUs). All users are assumed to be equipped with multiple antennas. It is assumed that when PUs are present, the direct communications between SU pairs introduces intolerable interference to PUs and thereby SUs transmit signal using the cooperation of other SUs and avoid transmitting in the direct channel. In brief, an adaptive cooperative strategy for multiple-input/multiple-output (MIMO) cognitive radio networks is proposed. At the presence of PUs, the issue of joint relay selection and power allocation in Underlay MIMO Cooperative Cognitive Radio Networks (U-MIMO-CCRN) is addressed. The optimal approach for determining the power allocation and the cooperating SU is proposed. Besides, the outage probability of the proposed communication protocol is further derived. Due to high complexity of the optimal approach, a low-complexity approach is further proposed and its performance is evaluated using simulations. The simulation results reveal that the performance loss due to the low-complexity approach is only about 14%, while the complexity is greatly reduced.

Utility Evaluation Based on One-To-N Mapping in the Prisoner's Dilemma Game for Interdependent Networks.

PubMed

Wang, Juan; Lu, Wenwen; Liu, Lina; Li, Li; Xia, Chengyi

2016-01-01

In the field of evolutionary game theory, network reciprocity has become an important means to promote the level of promotion within the population system. Recently, the interdependency provides a novel perspective to understand the widespread cooperation behavior in many real-world systems. In previous works, interdependency is often built from the direct or indirect connections between two networks through the one-to-one mapping mode. However, under many realistic scenarios, players may need much more information from many neighboring agents so as to make a more rational decision. Thus, beyond the one-to-one mapping mode, we investigate the cooperation behavior on two interdependent lattices, in which the utility evaluation of a focal player on one lattice may not only concern himself, but also integrate the payoff information of several corresponding players on the other lattice. Large quantities of simulations indicate that the cooperation can be substantially promoted when compared to the traditionally spatial lattices. The cluster formation and phase transition are also analyzed in order to explore the role of interdependent utility coupling in the collective cooperation. Current results are beneficial to deeply understand various mechanisms to foster the cooperation exhibited inside natural, social and engineering systems.

Analysis of radio wave propagation for ISM 2.4 GHz Wireless Sensor Networks in inhomogeneous vegetation environments.

PubMed

Azpilicueta, Leire; López-Iturri, Peio; Aguirre, Erik; Mateo, Ignacio; Astrain, José Javier; Villadangos, Jesús; Falcone, Francisco

2014-12-10

The use of wireless networks has experienced exponential growth due to the improvements in terms of battery life and low consumption of the devices. However, it is compulsory to conduct previous radio propagation analysis when deploying a wireless sensor network. These studies are necessary to perform an estimation of the range coverage, in order to optimize the distance between devices in an actual network deployment. In this work, the radio channel characterization for ISM 2.4 GHz Wireless Sensor Networks (WSNs) in an inhomogeneous vegetation environment has been analyzed. This analysis allows designing environment monitoring tools based on ZigBee and WiFi where WSN and smartphones cooperate, providing rich and customized monitoring information to users in a friendly manner. The impact of topology as well as morphology of the environment is assessed by means of an in-house developed 3D Ray Launching code, to emulate the realistic operation in the framework of the scenario. Experimental results gathered from a measurement campaign conducted by deploying a ZigBee Wireless Sensor Network, are analyzed and compared with simulations in this paper. The scenario where this network is intended to operate is a combination of buildings and diverse vegetation species. To gain insight in the effects of radio propagation, a simplified vegetation model has been developed, considering the material parameters and simplified geometry embedded in the simulation scenario. An initial location-based application has been implemented in a real scenario, to test the functionality within a context aware scenario. The use of deterministic tools can aid to know the impact of the topological influence in the deployment of the optimal Wireless Sensor Network in terms of capacity, coverage and energy consumption, making the use of these systems attractive for multiple applications in inhomogeneous vegetation environments.

Five rules for the evolution of cooperation.

PubMed

Nowak, Martin A

2006-12-08

Cooperation is needed for evolution to construct new levels of organization. Genomes, cells, multicellular organisms, social insects, and human society are all based on cooperation. Cooperation means that selfish replicators forgo some of their reproductive potential to help one another. But natural selection implies competition and therefore opposes cooperation unless a specific mechanism is at work. Here I discuss five mechanisms for the evolution of cooperation: kin selection, direct reciprocity, indirect reciprocity, network reciprocity, and group selection. For each mechanism, a simple rule is derived that specifies whether natural selection can lead to cooperation.

Five Rules for the Evolution of Cooperation

NASA Astrophysics Data System (ADS)

Nowak, Martin A.

2006-12-01

Cooperation is needed for evolution to construct new levels of organization. Genomes, cells, multicellular organisms, social insects, and human society are all based on cooperation. Cooperation means that selfish replicators forgo some of their reproductive potential to help one another. But natural selection implies competition and therefore opposes cooperation unless a specific mechanism is at work. Here I discuss five mechanisms for the evolution of cooperation: kin selection, direct reciprocity, indirect reciprocity, network reciprocity, and group selection. For each mechanism, a simple rule is derived that specifies whether natural selection can lead to cooperation.

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

PubMed

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

1995-01-01

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

Group learning versus local learning: Which is prefer for public cooperation?

NASA Astrophysics Data System (ADS)

Yang, Shi-Han; Song, Qi-Qing

2018-01-01

We study the evolution of cooperation in public goods games on various graphs, focusing on the effects that are brought by different kinds of strategy donors. This highlights a basic feature of a public good game, for which there exists a remarkable difference between the interactive players and the players who are imitated. A player can learn from all the groups where the player is a member or from the typically local nearest neighbors, and the results show that the group learning rules have better performance in promoting cooperation on many networks than the local learning rules. The heterogeneity of networks' degree may be an effective mechanism for harvesting the cooperation expectation in many cases, however, we find that heterogeneity does not definitely mean the high frequency of cooperators in a population under group learning rules. It was shown that cooperators always hardly evolve whenever the interaction and the replacement do not coincide for evolutionary pairwise dilemmas on graphs, while for PG games we find that breaking the symmetry is conducive to the survival of cooperators.

Recent advances in coding theory for near error-free communications

NASA Technical Reports Server (NTRS)

Cheung, K.-M.; Deutsch, L. J.; Dolinar, S. J.; Mceliece, R. J.; Pollara, F.; Shahshahani, M.; Swanson, L.

1991-01-01

Channel and source coding theories are discussed. The following subject areas are covered: large constraint length convolutional codes (the Galileo code); decoder design (the big Viterbi decoder); Voyager's and Galileo's data compression scheme; current research in data compression for images; neural networks for soft decoding; neural networks for source decoding; finite-state codes; and fractals for data compression.

Study on multiple-hops performance of MOOC sequences-based optical labels for OPS networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun; Ma, Chunli

2009-11-01

In this paper, we utilize a new study method that is under independent case of multiple optical orthogonal codes to derive the probability function of MOOCS-OPS networks, discuss the performance characteristics for a variety of parameters, and compare some characteristics of the system employed by single optical orthogonal code or multiple optical orthogonal codes sequences-based optical labels. The performance of the system is also calculated, and our results verify that the method is effective. Additionally it is found that performance of MOOCS-OPS networks would, negatively, be worsened, compared with single optical orthogonal code-based optical label for optical packet switching (SOOC-OPS); however, MOOCS-OPS networks can greatly enlarge the scalability of optical packet switching networks.

Reliable Wireless Broadcast with Linear Network Coding for Multipoint-to-Multipoint Real-Time Communications

NASA Astrophysics Data System (ADS)

Kondo, Yoshihisa; Yomo, Hiroyuki; Yamaguchi, Shinji; Davis, Peter; Miura, Ryu; Obana, Sadao; Sampei, Seiichi

This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.

Medical reliable network using concatenated channel codes through GSM network.

PubMed

Ahmed, Emtithal; Kohno, Ryuji

2013-01-01

Although the 4(th) generation (4G) of global mobile communication network, i.e. Long Term Evolution (LTE) coexisting with the 3(rd) generation (3G) has successfully started; the 2(nd) generation (2G), i.e. Global System for Mobile communication (GSM) still playing an important role in many developing countries. Without any other reliable network infrastructure, GSM can be applied for tele-monitoring applications, where high mobility and low cost are necessary. A core objective of this paper is to introduce the design of a more reliable and dependable Medical Network Channel Code system (MNCC) through GSM Network. MNCC design based on simple concatenated channel code, which is cascade of an inner code (GSM) and an extra outer code (Convolution Code) in order to protect medical data more robust against channel errors than other data using the existing GSM network. In this paper, the MNCC system will provide Bit Error Rate (BER) equivalent to the BER for medical tele monitoring of physiological signals, which is 10(-5) or less. The performance of the MNCC has been proven and investigated using computer simulations under different channels condition such as, Additive White Gaussian Noise (AWGN), Rayleigh noise and burst noise. Generally the MNCC system has been providing better performance as compared to GSM.

Computer Code for Transportation Network Design and Analysis

DOT National Transportation Integrated Search

1977-01-01

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

Partner choice cooperation in prisoner's dilemma

NASA Astrophysics Data System (ADS)

Wang, Qi; Xu, Zhaojin; Zhang, Lianzhong

2017-12-01

In this paper, we investigated the cooperative behavior in prisoner's dilemma when the individual behaviors and interaction structures could coevolve. Here, we study the model that the individuals can imitate the strategy of their neighbors and rewire their social ties throughout evolution, based exclusively on a fitness comparison. We find that the cooperation can be achieved if the time scale of network adaptation is large enough, even when the social dilemma strength is very strong. Detailed investigation shows that the presence or absence of the network adaptation has a profound impact on the collective behavior in the system.

Modeling the cooperative and competitive contagions in online social networks

NASA Astrophysics Data System (ADS)

Zhuang, Yun-Bei; Chen, J. J.; Li, Zhi-hong

2017-10-01

The wide adoption of social media has increased the interaction among different pieces of information, and this interaction includes cooperation and competition for our finite attention. While previous research focus on fully competition, this paper extends the interaction to be both "cooperation" and "competition", by employing an IS1S2 R model. To explore how two different pieces of information interact with each other, the IS1S2 R model splits the agents into four parts-(Ignorant-Spreader I-Spreader II-Stifler), based on SIR epidemic spreading model. Using real data from Weibo.com, a social network site similar to Twitter, we find some parameters, like decaying rates, can both influence the cooperative diffusion process and the competitive process, while other parameters, like infectious rates only have influence on the competitive diffusion process. Besides, the parameters' effect are more significant in the competitive diffusion than in the cooperative diffusion.

Cooperative Tertiary Interaction Network Guides RNA Folding

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

Behrouzi, Reza; Roh, Joon Ho; Kilburn, Duncan

2013-04-08

Noncoding RNAs form unique 3D structures, which perform many regulatory functions. To understand how RNAs fold uniquely despite a small number of tertiary interaction motifs, we mutated the major tertiary interactions in a group I ribozyme by single-base substitutions. The resulting perturbations to the folding energy landscape were measured using SAXS, ribozyme activity, hydroxyl radical footprinting, and native PAGE. Double- and triple-mutant cycles show that most tertiary interactions have a small effect on the stability of the native state. Instead, the formation of core and peripheral structural motifs is cooperatively linked in near-native folding intermediates, and this cooperativity depends onmore » the native helix orientation. The emergence of a cooperative interaction network at an early stage of folding suppresses nonnative structures and guides the search for the native state. We suggest that cooperativity in noncoding RNAs arose from natural selection of architectures conducive to forming a unique, stable fold.« less

Dynamic instability of cooperation due to diverse activity patterns in evolutionary social dilemmas

NASA Astrophysics Data System (ADS)

Xia, Cheng-Yi; Meloni, Sandro; Perc, Matjaž; Moreno, Yamir

2015-03-01

Individuals might abstain from participating in an instance of an evolutionary game for various reasons, ranging from lack of interest to risk aversion. In order to understand the consequences of such diverse activity patterns on the evolution of cooperation, we study a weak prisoner's dilemma where each player's participation is probabilistic rather than certain. Players that do not participate get a null payoff and are unable to replicate. We show that inactivity introduces cascading failures of cooperation, which are particularly severe on scale-free networks with frequently inactive hubs. The drops in the fraction of cooperators are sudden, while the spatiotemporal reorganization of compact cooperative clusters, and thus the recovery, takes time. Nevertheless, if the activity of players is directly proportional to their degree, or if the interaction network is not strongly heterogeneous, the overall evolution of cooperation is not impaired. This is because inactivity negatively affects the potency of low-degree defectors, who are hence unable to utilize on their inherent evolutionary advantage. Between cascading failures, the fraction of cooperators is therefore higher than usual, which lastly balances out the asymmetric dynamic instabilities that emerge due to intermittent blackouts of cooperative hubs.

Apply network coding for H.264/SVC multicasting

NASA Astrophysics Data System (ADS)

Wang, Hui; Kuo, C.-C. Jay

2008-08-01

In a packet erasure network environment, video streaming benefits from error control in two ways to achieve graceful degradation. The first approach is application-level (or the link-level) forward error-correction (FEC) to provide erasure protection. The second error control approach is error concealment at the decoder end to compensate lost packets. A large amount of research work has been done in the above two areas. More recently, network coding (NC) techniques have been proposed for efficient data multicast over networks. It was shown in our previous work that multicast video streaming benefits from NC for its throughput improvement. An algebraic model is given to analyze the performance in this work. By exploiting the linear combination of video packets along nodes in a network and the SVC video format, the system achieves path diversity automatically and enables efficient video delivery to heterogeneous receivers in packet erasure channels. The application of network coding can protect video packets against the erasure network environment. However, the rank defficiency problem of random linear network coding makes the error concealment inefficiently. It is shown by computer simulation that the proposed NC video multicast scheme enables heterogenous receiving according to their capacity constraints. But it needs special designing to improve the video transmission performance when applying network coding.

LinkMind: link optimization in swarming mobile sensor networks.

PubMed

Ngo, Trung Dung

2011-01-01

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

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

PubMed Central

Ngo, Trung Dung

2011-01-01

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

14 CFR 1214.403 - Code of Conduct for the International Space Station Crew.

Code of Federal Regulations, 2012 CFR

2012-01-01

... disciplinary policy, and requirements imposed by their Cooperating Agency or those relating to the Earth-to... Cooperating Agency providing him or her through the crew training curriculum and normal program operations as... his or her authority, leads the ISS crewmembers through the training curriculum and mission...

14 CFR 1214.403 - Code of Conduct for the International Space Station Crew.

Code of Federal Regulations, 2011 CFR

2011-01-01

... disciplinary policy, and requirements imposed by their Cooperating Agency or those relating to the Earth-to... Cooperating Agency providing him or her through the crew training curriculum and normal program operations as... his or her authority, leads the ISS crewmembers through the training curriculum and mission...

14 CFR 1214.403 - Code of Conduct for the International Space Station Crew.

Code of Federal Regulations, 2013 CFR

2013-01-01

... disciplinary policy, and requirements imposed by their Cooperating Agency or those relating to the Earth-to... Cooperating Agency providing him or her through the crew training curriculum and normal program operations as... his or her authority, leads the ISS crewmembers through the training curriculum and mission...

Smart photonic networks and computer security for image data

NASA Astrophysics Data System (ADS)

Campello, Jorge; Gill, John T.; Morf, Martin; Flynn, Michael J.

1998-02-01

Work reported here is part of a larger project on 'Smart Photonic Networks and Computer Security for Image Data', studying the interactions of coding and security, switching architecture simulations, and basic technologies. Coding and security: coding methods that are appropriate for data security in data fusion networks were investigated. These networks have several characteristics that distinguish them form other currently employed networks, such as Ethernet LANs or the Internet. The most significant characteristics are very high maximum data rates; predominance of image data; narrowcasting - transmission of data form one source to a designated set of receivers; data fusion - combining related data from several sources; simple sensor nodes with limited buffering. These characteristics affect both the lower level network design and the higher level coding methods.Data security encompasses privacy, integrity, reliability, and availability. Privacy, integrity, and reliability can be provided through encryption and coding for error detection and correction. Availability is primarily a network issue; network nodes must be protected against failure or routed around in the case of failure. One of the more promising techniques is the use of 'secret sharing'. We consider this method as a special case of our new space-time code diversity based algorithms for secure communication. These algorithms enable us to exploit parallelism and scalable multiplexing schemes to build photonic network architectures. A number of very high-speed switching and routing architectures and their relationships with very high performance processor architectures were studied. Indications are that routers for very high speed photonic networks can be designed using the very robust and distributed TCP/IP protocol, if suitable processor architecture support is available.

Error-correcting codes on scale-free networks

NASA Astrophysics Data System (ADS)

Kim, Jung-Hoon; Ko, Young-Jo

2004-06-01

We investigate the potential of scale-free networks as error-correcting codes. We find that irregular low-density parity-check codes with the highest performance known to date have degree distributions well fitted by a power-law function p (k) ˜ k-γ with γ close to 2, which suggests that codes built on scale-free networks with appropriate power exponents can be good error-correcting codes, with a performance possibly approaching the Shannon limit. We demonstrate for an erasure channel that codes with a power-law degree distribution of the form p (k) = C (k+α)-γ , with k⩾2 and suitable selection of the parameters α and γ , indeed have very good error-correction capabilities.

Constructing a Cooperative Distance Learning System: The CORAL Experience.

ERIC Educational Resources Information Center

Chou, Chien; Sun, Chuen-Tsai

1996-01-01

Describes the development of the Cooperative Remotely Accessible Learning (CORAL) system on the Internet at National Chiao Tung University (Taiwan) that promotes cooperative constructive distance learning and provides the first comprehensive and networked courseware written in Chinese. Results of formative evaluation are described and future…

Enhancement by Enlargement: The Proliferation Security Initiative

DTIC Science & Technology

2008-01-01

Minister Mahathir Mohammad. In any event, Malaysia’s expressions of common interest with the United States in cooperative efforts to combat terrorism...instances 10 The sharp change in the current Malaysian government’s stance toward cooperation with the United States from that of the preceding, Mahathir ...preceding prime minister, Mahathir , Malaysia was implicated in the proliferation network of Pakistan’s A. Q. Khan. As part of that network

Cooperative Institute for Research in the Atmosphere (CIRA) Requirements Review

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

Zurawski, Jason, W; Mace, Kathryn, P

2016-08-11

In August 2016 The Energy Sciences Network (ESnet) and Colorado State University (CSU) organized a review to characterize the networking requirements of the Cooperative Institute for Research in the Atmosphere (CIRA) located on the campus of Colorado State University. Several key findings highlighting the results from the review were discovered, with benefits to improve the overall scientific process for CIRA and CSU.

Cooperative genomic alteration network reveals molecular classification across 12 major cancer types

PubMed Central

Zhang, Hongyi; Deng, Yulan; Zhang, Yong; Ping, Yanyan; Zhao, Hongying; Pang, Lin; Zhang, Xinxin; Wang, Li; Xu, Chaohan; Xiao, Yun; Li, Xia

2017-01-01

The accumulation of somatic genomic alterations that enables cells to gradually acquire growth advantage contributes to tumor development. This has the important implication of the widespread existence of cooperative genomic alterations in the accumulation process. Here, we proposed a computational method HCOC that simultaneously consider genetic context and downstream functional effects on cancer hallmarks to uncover somatic cooperative events in human cancers. Applying our method to 12 TCGA cancer types, we totally identified 1199 cooperative events with high heterogeneity across human cancers, and then constructed a pan-cancer cooperative alteration network. These cooperative events are associated with genomic alterations of some high-confident cancer drivers, and can trigger the dysfunction of hallmark associated pathways in a co-defect way rather than single alterations. We found that these cooperative events can be used to produce a prognostic classification that can provide complementary information with tissue-of-origin. In a further case study of glioblastoma, using 23 cooperative events identified, we stratified patients into molecularly relevant subtypes with a prognostic significance independent of the Glioma-CpG Island Methylator Phenotype (GCIMP). In summary, our method can be effectively used to discover cancer-driving cooperative events that can be valuable clinical markers for patient stratification. PMID:27899621

Spillover modes in multiplex games: double-edged effects on cooperation and their coevolution.

PubMed

Khoo, Tommy; Fu, Feng; Pauls, Scott

2018-05-02

In recent years, there has been growing interest in studying games on multiplex networks that account for interactions across linked social contexts. However, little is known about how potential cross-context interference, or spillover, of individual behavioural strategy impact overall cooperation. We consider three plausible spillover modes, quantifying and comparing their effects on the evolution of cooperation. In our model, social interactions take place on two network layers: repeated interactions with close neighbours in a lattice, and one-shot interactions with random individuals. Spillover can occur during the learning process with accidental cross-layer strategy transfer, or during social interactions with errors in implementation. Our analytical results, using extended pair approximation, are in good agreement with extensive simulations. We find double-edged effects of spillover: increasing the intensity of spillover can promote cooperation provided cooperation is favoured in one layer, but too much spillover is detrimental. We also discover a bistability phenomenon: spillover hinders or promotes cooperation depending on initial frequencies of cooperation in each layer. Furthermore, comparing strategy combinations emerging in each spillover mode provides good indication of their co-evolutionary dynamics with cooperation. Our results make testable predictions that inspire future research, and sheds light on human cooperation across social domains.

Distinguishing the opponents promotes cooperation in well-mixed populations

NASA Astrophysics Data System (ADS)

Wardil, Lucas; da Silva, Jafferson K. L.

2010-03-01

Cooperation has been widely studied when an individual strategy is adopted against all coplayers. In this context, some extra mechanisms, such as punishment, reward, memory, and network reciprocity must be introduced in order to keep cooperators alive. Here, we adopt a different point of view. We study the adoption of different strategies against different opponents instead of adoption of the same strategy against all of them. In the context of the prisoner dilemma, we consider an evolutionary process in which strategies that provide more benefits are imitated and the players replace the strategy used in one of the interactions furnishing the worst payoff. Individuals are set in a well-mixed population, so that network reciprocity effect is excluded and both synchronous and asynchronous updates are analyzed. As a consequence of the replacement rule, we show that mutual cooperation is never destroyed and the initial fraction of mutual cooperation is a lower bound for the level of cooperation. We show by simulation and mean-field analysis that (i) cooperation dominates for synchronous update and (ii) only the initial mutual cooperation is maintained for asynchronous update. As a side effect of the replacement rule, an “implicit punishment” mechanism comes up in a way that exploitations are always neutralized providing evolutionary stability for cooperation.

An IUR evolutionary game model on the patent cooperate of Shandong China

NASA Astrophysics Data System (ADS)

Liu, Mengmeng; Ma, Yinghong; Liu, Zhiyuan; You, Xuemei

2017-06-01

Organizations of industries and university & research institutes cooperate to meet their respective needs based on social contacts, trust and share complementary resources. From the perspective of complex network together with the patent data of Shandong province in China, a novel evolutionary game model on patent cooperation network is presented. Two sides in the game model are industries and universities & research institutes respectively. The cooperation is represented by a connection when a new patent is developed together by the two sides. The optimal strategy of the evolutionary game model is quantified by the average positive cooperation probability p ¯ and the average payoff U ¯ . The feasibility of this game model is simulated on the parameters such as the knowledge spillover, the punishment, the development cost and the distribution coefficient of the benefit. The numerical simulations show that the cooperative behaviors are affected by the variation of parameters. The knowledge spillover displays different behaviors when the punishment is larger than the development cost or less than it. Those results indicate that reasonable punishment would improve the positive cooperation. The appropriate punishment will be useful to enhance the big degree nodes positively cooperate with industries and universities & research institutes. And an equitable plan for the distribution of cooperative profits is half-and-half distribution strategy for the two sides in game.

User's manual for a material transport code on the Octopus Computer Network

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

Naymik, T.G.; Mendez, G.D.

1978-09-15

A code to simulate material transport through porous media was developed at Oak Ridge National Laboratory. This code has been modified and adapted for use at Lawrence Livermore Laboratory. This manual, in conjunction with report ORNL-4928, explains the input, output, and execution of the code on the Octopus Computer Network.

Digital video technologies and their network requirements

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

R. P. Tsang; H. Y. Chen; J. M. Brandt

1999-11-01

Coded digital video signals are considered to be one of the most difficult data types to transport due to their real-time requirements and high bit rate variability. In this study, the authors discuss the coding mechanisms incorporated by the major compression standards bodies, i.e., JPEG and MPEG, as well as more advanced coding mechanisms such as wavelet and fractal techniques. The relationship between the applications which use these coding schemes and their network requirements are the major focus of this study. Specifically, the authors relate network latency, channel transmission reliability, random access speed, buffering and network bandwidth with the variousmore » coding techniques as a function of the applications which use them. Such applications include High-Definition Television, Video Conferencing, Computer-Supported Collaborative Work (CSCW), and Medical Imaging.« less

The Southern Kansas Seismic Network

NASA Astrophysics Data System (ADS)

Terra, F. M.

2015-12-01

Historically aseismic Harper and Sumner counties in Southern Kansas experienced a dramatic increase in seismicity beginning in early 2014, coincident with the development of new oil production in the Mississippi Lime Play. In order to better understand the potential relationships between seismicity and oil development, the USGS installed a real-time telemetered seismic network in cooperation with the Kansas Geological Survey, the Kansas Corporation Commission, the Kansas Department of Health and Environment, Harper County, and the Oklahoma Geological Survey. The network began operation in March 2014 with an initial deployment of 5 NetQuakes accelerometers and by July 2014 had expanded to include 10 broadband sites. The network currently has 14 stations, all with accelerometers and 12 with broadband seismometers. The network has interstation spacing of 15 - 25 km and typical azimuthal gap of 80 for well-located events. Data are continuously streamed to IRIS at 200 samples per second from most sites. Earthquake locations are augmented with additional stations from the USGS National Network, Oklahoma Geological Survey Seismic Network, Kansas Seismic Monitoring Network and the Enid Oklahoma Network. Since the spring of 2014 over 7500 earthquakes have been identified with data from this network, 1400 of which have been manually timed and cataloged. Focal depths for earthquakes typically range between 2 and 7 km. The catalog is available at earthquake.usgs.gov/earthquakes/search/ under network code 'Ismpkansas'. The network recorded the largest known earthquake in Harper County, Mw 4.3, on October 2, 2014 and in Sumner County, Mw 4.9, on November 12, 2014. Recorded ground motions at the epicenter of the October earthquake were 0.70 g (PGA) and 12 cm/s (PGV). These high ground motion values agree with near-source recordings made by other USGS temporary deployments in the U. S. midcontinent, indicating a significant shaking hazard from such shallow, moderate-magnitude earthquakes.

A Simulation of Cooperation and Competition in Insurgent Networks

NASA Astrophysics Data System (ADS)

Gabbay, Michael

2014-03-01

Insurgencies are often characterized by multiple groups who share a common foe in the national government but have independent organizations which may differ with respect to social identities, ideologies, strategies, and their use of violence. These groups may cooperate in various ways such as conducting joint attacks, pooling resources, and establishing formal alliances or mergers. However, they may also compete with each other over popular support, recruitment of fighters, funding, allies, and ultimately military dominance. A network coevolution model of insurgent factional dynamics is presented which accounts for factors driving cooperation and competition. The model is formulated as a system of coupled ODEs which evolves network ties between insurgent groups along with group policies concerning the targets of violence. Simulation results are presented showing sharp transitions in network structure as model parameters are varied. Connections are drawn between the model results and empirical data from the Iraqi insurgency. This work was supported by the Office of Naval Research under grant N00014-13-1-0381.

Packet error rate analysis of decode-and-forward free-space optical cooperative networks in the presence of random link blockage

NASA Astrophysics Data System (ADS)

Zdravković, Nemanja; Cvetkovic, Aleksandra; Milic, Dejan; Djordjevic, Goran T.

2017-09-01

This paper analyses end-to-end packet error rate (PER) of a free-space optical decode-and-forward cooperative network over a gamma-gamma atmospheric turbulence channel in the presence of temporary random link blockage. Closed-form analytical expressions for PER are derived for the cases with and without transmission links being prone to blockage. Two cooperation protocols (denoted as 'selfish' and 'pilot-adaptive') are presented and compared, where the latter accounts for the presence of blockage and adapts transmission power. The influence of scintillation, link distance, average transmitted signal power, network topology and probability of an uplink and/or internode link being blocked are discussed when the destination applies equal gain combining. The results show that link blockage caused by obstacles can degrade system performance, causing an unavoidable PER floor. The implementation of the pilot-adaptive protocol improves performance when compared to the selfish protocol, diminishing internode link blockage and lowering the PER floor, especially for larger networks.

Networking and Institutional Planning.

ERIC Educational Resources Information Center

Riggs, Donald E.

1987-01-01

Explores the impact of networks and shared library resources on the library planning process. Environmental scanning techniques, the need for cooperative planning, and the formulation of strategies to achieve networking goals are discussed. (CLB)

Facilitators on networks reveal optimal interplay between information exchange and reciprocity.

PubMed

Szolnoki, Attila; Perc, Matjaž; Mobilia, Mauro

2014-04-01

Reciprocity is firmly established as an important mechanism that promotes cooperation. An efficient information exchange is likewise important, especially on structured populations, where interactions between players are limited. Motivated by these two facts, we explore the role of facilitators in social dilemmas on networks. Facilitators are here mirrors to their neighbors-they cooperate with cooperators and defect with defectors-but they do not participate in the exchange of strategies. As such, in addition to introducing direct reciprocity, they also obstruct information exchange. In well-mixed populations, facilitators favor the replacement and invasion of defection by cooperation as long as their number exceeds a critical value. In structured populations, on the other hand, there exists a delicate balance between the benefits of reciprocity and the deterioration of information exchange. Extensive Monte Carlo simulations of social dilemmas on various interaction networks reveal that there exists an optimal interplay between reciprocity and information exchange, which sets in only when a small number of facilitators occupy the main hubs of the scale-free network. The drawbacks of missing cooperative hubs are more than compensated for by reciprocity and, at the same time, the compromised information exchange is routed via the auxiliary hubs with only marginal losses in effectivity. These results indicate that it is not always optimal for the main hubs to become leaders of the masses, but rather to exploit their highly connected state to promote tit-for-tat-like behavior.

Facilitators on networks reveal optimal interplay between information exchange and reciprocity

NASA Astrophysics Data System (ADS)

Szolnoki, Attila; Perc, Matjaž; Mobilia, Mauro

2014-04-01

Reciprocity is firmly established as an important mechanism that promotes cooperation. An efficient information exchange is likewise important, especially on structured populations, where interactions between players are limited. Motivated by these two facts, we explore the role of facilitators in social dilemmas on networks. Facilitators are here mirrors to their neighbors—they cooperate with cooperators and defect with defectors—but they do not participate in the exchange of strategies. As such, in addition to introducing direct reciprocity, they also obstruct information exchange. In well-mixed populations, facilitators favor the replacement and invasion of defection by cooperation as long as their number exceeds a critical value. In structured populations, on the other hand, there exists a delicate balance between the benefits of reciprocity and the deterioration of information exchange. Extensive Monte Carlo simulations of social dilemmas on various interaction networks reveal that there exists an optimal interplay between reciprocity and information exchange, which sets in only when a small number of facilitators occupy the main hubs of the scale-free network. The drawbacks of missing cooperative hubs are more than compensated for by reciprocity and, at the same time, the compromised information exchange is routed via the auxiliary hubs with only marginal losses in effectivity. These results indicate that it is not always optimal for the main hubs to become leaders of the masses, but rather to exploit their highly connected state to promote tit-for-tat-like behavior.

Failed cooperative, but not competitive, interaction between large-scale brain networks impairs working memory in schizophrenia.

PubMed

Pu, W; Luo, Q; Palaniyappan, L; Xue, Z; Yao, S; Feng, J; Liu, Z

2016-04-01

A large-scale network named the default mode network (DMN) dynamically cooperates and competes with an external attention system (EAS) to facilitate various cognitive functioning that is prominently impaired in schizophrenia. However, it is unclear whether the cognitive deficit in schizophrenia is related to the disrupted competition and/or cooperation between these two networks. A total of 35 schizophrenia patients and 30 healthy controls were scanned using gradient-echo echo-planar imaging during n-back working memory (WM) processing. Brain activities of the DMN and EAS were measured using general linear modelling of the functional magnetic resonance imaging data. Dynamic interaction between the DMN and EAS was decomposed into two directions using Granger causality analysis. We observed a significant failure of DMN suppression in patients with schizophrenia, which was significantly related to WM/attentional deficit. Granger causality modelling showed that in healthy controls, while the EAS inhibitorily influenced the DMN, the DMN exerted an 'excitatory' or cooperative influence back on the EAS, especially in those with lower WM accuracy. In schizophrenia, this 'excitatory' DMN→EAS influence within the reciprocal EAS-DMN loop was significantly reduced, especially in patients with WM/attentional deficit. The dynamic interaction between the DMN and EAS is likely to be comprised of both competitive and cooperative influences. In healthy controls, both the 'inhibitory' EAS→DMN interaction and 'excitatory' DMN→EAS interaction are correlated with WM performance. In schizophrenia, reduced 'cooperative' influence from the DMN to dorsal nodes of the EAS occurs in the context of non-suppression of the DMN and may form a possible pathophysiological substrate of WM deficit and attention disorder.

Cooperation of return-to-work professionals: the challenges of multi-actor work disability management.

PubMed

Liukko, Jyri; Kuuva, Niina

2017-07-01

This article explores which concrete factors hinder or facilitate the cooperation of return-to-work (RTW) professionals in a complex system of multiple stakeholders. The empirical material consists of in-depth interviews with 24 RTW professionals from various organizations involved in work disability management in Finland. The interviews were analyzed using thematic content analysis. The study revealed several kinds of challenges in the cooperation of the professionals. These were related to two partly interrelated themes: communication and distribution of responsibility. The most difficult problems were connected to the cooperation between public employment offices and other stakeholders. However, the study distinguished notable regional differences depending primarily on the scale of the local network. The main areas of improvement proposed by the interviewees were related to better networking of case managers and expansion of expertise. The article argues for the importance of systematic networking and stresses the role of public employment services in the multi-actor management of work disabilities. The article contributes to existing work disability case management models by suggesting the employment administration system as an important component in addition to health care, workplace and insurance systems. The study also highlights the need for expansion of expertise in the field. Implications for Rehabilitation Cooperation between RTW professionals in public employment offices and other organizations involved in work disability management was considered inadequate. In order to improve the cooperation of RTW professionals, the stakeholders need to create more systematic ways of communication and networking with professionals in other organizations. There is a need to expand the expertise in work disability management and rehabilitation, partly by increasing the role of other professionals than physicians.

Impact of heterogeneous activity and community structure on the evolutionary success of cooperators in social networks

NASA Astrophysics Data System (ADS)

Wu, Zhi-Xi; Rong, Zhihai; Yang, Han-Xin

2015-01-01

Recent empirical studies suggest that heavy-tailed distributions of human activities are universal in real social dynamics [L. Muchnik, S. Pei, L. C. Parra, S. D. S. Reis, J. S. Andrade Jr., S. Havlin, and H. A. Makse, Sci. Rep. 3, 1783 (2013), 10.1038/srep01783]. On the other hand, community structure is ubiquitous in biological and social networks [M. E. J. Newman, Nat. Phys. 8, 25 (2012), 10.1038/nphys2162]. Motivated by these facts, we here consider the evolutionary prisoner's dilemma game taking place on top of a real social network to investigate how the community structure and the heterogeneity in activity of individuals affect the evolution of cooperation. In particular, we account for a variation of the birth-death process (which can also be regarded as a proportional imitation rule from a social point of view) for the strategy updating under both weak and strong selection (meaning the payoffs harvested from games contribute either slightly or heavily to the individuals' performance). By implementing comparative studies, where the players are selected either randomly or in terms of their actual activities to play games with their immediate neighbors, we figure out that heterogeneous activity benefits the emergence of collective cooperation in a harsh environment (the action for cooperation is costly) under strong selection, whereas it impairs the formation of altruism under weak selection. Moreover, we find that the abundance of communities in the social network can evidently foster the formation of cooperation under strong selection, in contrast to the games evolving on randomized counterparts. Our results are therefore helpful for us to better understand the evolution of cooperation in real social systems.

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks

PubMed Central

Artuñedo, Antonio; del Toro, Raúl M.; Haber, Rodolfo E.

2017-01-01

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller (TLC) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks. PMID:28445398

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks.

PubMed

Artuñedo, Antonio; Del Toro, Raúl M; Haber, Rodolfo E

2017-04-26

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller ( TLC ) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks.

NSDann2BS, a neutron spectrum unfolding code based on neural networks technology and two bonner spheres

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

Ortiz-Rodriguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.

In this work a neutron spectrum unfolding code, based on artificial intelligence technology is presented. The code called ''Neutron Spectrometry and Dosimetry with Artificial Neural Networks and two Bonner spheres'', (NSDann2BS), was designed in a graphical user interface under the LabVIEW programming environment. The main features of this code are to use an embedded artificial neural network architecture optimized with the ''Robust design of artificial neural networks methodology'' and to use two Bonner spheres as the only piece of information. In order to build the code here presented, once the net topology was optimized and properly trained, knowledge stored atmore » synaptic weights was extracted and using a graphical framework build on the LabVIEW programming environment, the NSDann2BS code was designed. This code is friendly, intuitive and easy to use for the end user. The code is freely available upon request to authors. To demonstrate the use of the neural net embedded in the NSDann2BS code, the rate counts of {sup 252}Cf, {sup 241}AmBe and {sup 239}PuBe neutron sources measured with a Bonner spheres system.« less

Spike Code Flow in Cultured Neuronal Networks.

PubMed

Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime; Kamimura, Takuya; Yagi, Yasushi; Mizuno-Matsumoto, Yuko; Chen, Yen-Wei

2016-01-01

We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of "1101" and "1011," which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the "maximum cross-correlations" among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

NSDann2BS, a neutron spectrum unfolding code based on neural networks technology and two bonner spheres

NASA Astrophysics Data System (ADS)

Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solís Sánches, L. O.; Miranda, R. Castañeda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.

2013-07-01

In this work a neutron spectrum unfolding code, based on artificial intelligence technology is presented. The code called "Neutron Spectrometry and Dosimetry with Artificial Neural Networks and two Bonner spheres", (NSDann2BS), was designed in a graphical user interface under the LabVIEW programming environment. The main features of this code are to use an embedded artificial neural network architecture optimized with the "Robust design of artificial neural networks methodology" and to use two Bonner spheres as the only piece of information. In order to build the code here presented, once the net topology was optimized and properly trained, knowledge stored at synaptic weights was extracted and using a graphical framework build on the LabVIEW programming environment, the NSDann2BS code was designed. This code is friendly, intuitive and easy to use for the end user. The code is freely available upon request to authors. To demonstrate the use of the neural net embedded in the NSDann2BS code, the rate counts of 252Cf, 241AmBe and 239PuBe neutron sources measured with a Bonner spheres system.

Cooperative learning neural network output feedback control of uncertain nonlinear multi-agent systems under directed topologies

NASA Astrophysics Data System (ADS)

Wang, W.; Wang, D.; Peng, Z. H.

2017-09-01

Without assuming that the communication topologies among the neural network (NN) weights are to be undirected and the states of each agent are measurable, the cooperative learning NN output feedback control is addressed for uncertain nonlinear multi-agent systems with identical structures in strict-feedback form. By establishing directed communication topologies among NN weights to share their learned knowledge, NNs with cooperative learning laws are employed to identify the uncertainties. By designing NN-based κ-filter observers to estimate the unmeasurable states, a new cooperative learning output feedback control scheme is proposed to guarantee that the system outputs can track nonidentical reference signals with bounded tracking errors. A simulation example is given to demonstrate the effectiveness of the theoretical results.

Cooperative epidemics on multiplex networks.

PubMed

Azimi-Tafreshi, N

2016-04-01

The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric coinfection model for spreading of two diseases on a two-layer multiplex network. We allow layer overlapping, but we assume that each layer is random and locally loopless. Infection with one of the diseases increases the probability of getting infected with the other. Using the generating function method, we calculate exactly the fraction of individuals infected with both diseases (so-called coinfected clusters) in the stationary state, as well as the epidemic spreading thresholds and the phase diagram of the model. With increasing cooperation, we observe a tricritical point and the type of transition changes from continuous to hybrid. Finally, we compare the coinfected clusters in the case of cooperating diseases with the so-called "viable" clusters in networks with dependencies.

Cooperative epidemics on multiplex networks

NASA Astrophysics Data System (ADS)

Azimi-Tafreshi, N.

2016-04-01

The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric coinfection model for spreading of two diseases on a two-layer multiplex network. We allow layer overlapping, but we assume that each layer is random and locally loopless. Infection with one of the diseases increases the probability of getting infected with the other. Using the generating function method, we calculate exactly the fraction of individuals infected with both diseases (so-called coinfected clusters) in the stationary state, as well as the epidemic spreading thresholds and the phase diagram of the model. With increasing cooperation, we observe a tricritical point and the type of transition changes from continuous to hybrid. Finally, we compare the coinfected clusters in the case of cooperating diseases with the so-called "viable" clusters in networks with dependencies.

Cooperative Spatial Retreat for Resilient Drone Networks †

PubMed Central

Kang, Jin-Hyeok; Kwon, Young-Min; Park, Kyung-Joon

2017-01-01

Drones are broadening their scope to various applications such as networking, package delivery, agriculture, rescue, and many more. For proper operation of drones, reliable communication should be guaranteed because drones are remotely controlled. When drones experience communication failure due to bad channel condition, interference, or jamming in a certain area, one existing solution is to exploit mobility or so-called spatial retreat to evacuate them from the communication failure area. However, the conventional spatial retreat scheme moves drones in random directions, which results in inefficient movement with significant evacuation time and waste of battery lifetime. In this paper, we propose a novel spatial retreat technique that takes advantage of cooperation between drones for resilient networking, which is called cooperative spatial retreat (CSR). Our performance evaluation shows that the proposed CSR significantly outperforms existing schemes. PMID:28467390

7 CFR 4274.337 - Other regulatory requirements.

Code of Federal Regulations, 2011 CFR

2011-01-01

....337 Agriculture Regulations of the Department of Agriculture (Continued) RURAL BUSINESS-COOPERATIVE... recipient on the basis of sex, marital status, race, color, religion, national origin, age, physical or... of one of the following model building codes or the latest edition of that code providing an...

Soft-Input Soft-Output Modules for the Construction and Distributed Iterative Decoding of Code Networks

NASA Technical Reports Server (NTRS)

Benedetto, S.; Divsalar, D.; Montorsi, G.; Pollara, F.

1998-01-01

Soft-input soft-output building blocks (modules) are presented to construct and iteratively decode in a distributed fashion code networks, a new concept that includes, and generalizes, various forms of concatenated coding schemes.

Three-tier multi-granularity switching system based on PCE

NASA Astrophysics Data System (ADS)

Wang, Yubao; Sun, Hao; Liu, Yanfei

2017-10-01

With the growing demand for business communications, electrical signal processing optical path switching can't meet the demand. The multi-granularity switch system that can improve node routing and switching capabilities came into being. In the traditional network, each node is responsible for calculating the path; synchronize the whole network state, which will increase the burden on the network, so the concept of path calculation element (PCE) is proposed. The PCE is responsible for routing and allocating resources in the network1. In the traditional band-switched optical network, the wavelength is used as the basic routing unit, resulting in relatively low wavelength utilization. Due to the limitation of wavelength continuity, the routing design of the band technology becomes complicated, which directly affects the utilization of the system. In this paper, optical code granularity is adopted. There is no continuity of the optical code, and the number of optical codes is more flexible than the wavelength. For the introduction of optical code switching, we propose a Code Group Routing Entity (CGRE) algorithm. In short, the combination of three-tier multi-granularity optical switching system and PCE can simplify the network structure, reduce the node load, and enhance the network scalability and survivability. Realize the intelligentization of optical network.

Five rules for the evolution of cooperation

PubMed Central

Nowak, Martin A.

2011-01-01

Cooperation is needed for evolution to construct new levels of organization. The emergence of genomes, cells, multi-cellular organisms, social insects and human society are all based on cooperation. Cooperation means that selfish replicators forgo some of their reproductive potential to help one another. But natural selection implies competition and therefore opposes cooperation unless a specific mechanism is at work. Here I discuss five mechanisms for the evolution of cooperation: kin selection, direct reciprocity, indirect reciprocity, network reciprocity and group selection. For each mechanism, a simple rule is derived which specifies whether natural selection can lead to cooperation. PMID:17158317

Clustering of neural code words revealed by a first-order phase transition

NASA Astrophysics Data System (ADS)

Huang, Haiping; Toyoizumi, Taro

2016-06-01

A network of neurons in the central nervous system collectively represents information by its spiking activity states. Typically observed states, i.e., code words, occupy only a limited portion of the state space due to constraints imposed by network interactions. Geometrical organization of code words in the state space, critical for neural information processing, is poorly understood due to its high dimensionality. Here, we explore the organization of neural code words using retinal data by computing the entropy of code words as a function of Hamming distance from a particular reference codeword. Specifically, we report that the retinal code words in the state space are divided into multiple distinct clusters separated by entropy-gaps, and that this structure is shared with well-known associative memory networks in a recallable phase. Our analysis also elucidates a special nature of the all-silent state. The all-silent state is surrounded by the densest cluster of code words and located within a reachable distance from most code words. This code-word space structure quantitatively predicts typical deviation of a state-trajectory from its initial state. Altogether, our findings reveal a non-trivial heterogeneous structure of the code-word space that shapes information representation in a biological network.

Incorporation of Condensation Heat Transfer in a Flow Network Code

NASA Technical Reports Server (NTRS)

Anthony, Miranda; Majumdar, Alok; McConnaughey, Paul K. (Technical Monitor)

2001-01-01

In this paper we have investigated the condensation of water vapor in a short tube. A numerical model of condensation heat transfer was incorporated in a flow network code. The flow network code that we have used in this paper is Generalized Fluid System Simulation Program (GFSSP). GFSSP is a finite volume based flow network code. Four different condensation models were presented in the paper. Soliman's correlation has been found to be the most stable in low flow rates which is of particular interest in this application. Another highlight of this investigation is conjugate or coupled heat transfer between solid or fluid. This work was done in support of NASA's International Space Station program.

SMEs and their co-operation with academia.

PubMed

Antoine, Jean Michel; Strömqvist, Mats

2005-01-01

Co-operation between SMEs and Academia can be a win-win situation when each partner understands the constraints of the other. SMEs are often leaders in innovation; therefore more ready to share interest in research. They are flexible and dynamic. They need a short feed-back to sustain their co-operation. Academia is often more long-term oriented and more question- than answer-oriented. A code of conduct can ease the relationship because it can anticipate the potential problems.

Monitoring the effects of air-quality on forests: An overview of the Sierra Ancha Experimental Forest ICP-Level II Site

Treesearch

Peter E. Koestner; Karen A. Koestner; Daniel G. Neary

2012-01-01

The Sierra Ancha International Cooperative Program on Assessment and Monitoring of Air Pollution Effects on Forests study site or (SAEF-ICP II) is part of an international network of cooperative forest monitoring sites spread throughout Europe and the United States. The United Nations Economic Commission for Europe established the ICP II network in 1985 to monitor long...

Systematic network coding for two-hop lossy transmissions

NASA Astrophysics Data System (ADS)

Li, Ye; Blostein, Steven; Chan, Wai-Yip

2015-12-01

In this paper, we consider network transmissions over a single or multiple parallel two-hop lossy paths. These scenarios occur in applications such as sensor networks or WiFi offloading. Random linear network coding (RLNC), where previously received packets are re-encoded at intermediate nodes and forwarded, is known to be a capacity-achieving approach for these networks. However, a major drawback of RLNC is its high encoding and decoding complexity. In this work, a systematic network coding method is proposed. We show through both analysis and simulation that the proposed method achieves higher end-to-end rate as well as lower computational cost than RLNC for finite field sizes and finite-sized packet transmissions.

Advanced information processing system: Hosting of advanced guidance, navigation and control algorithms on AIPS using ASTER

NASA Technical Reports Server (NTRS)

Brenner, Richard; Lala, Jaynarayan H.; Nagle, Gail A.; Schor, Andrei; Turkovich, John

1994-01-01

This program demonstrated the integration of a number of technologies that can increase the availability and reliability of launch vehicles while lowering costs. Availability is increased with an advanced guidance algorithm that adapts trajectories in real-time. Reliability is increased with fault-tolerant computers and communication protocols. Costs are reduced by automatically generating code and documentation. This program was realized through the cooperative efforts of academia, industry, and government. The NASA-LaRC coordinated the effort, while Draper performed the integration. Georgia Institute of Technology supplied a weak Hamiltonian finite element method for optimal control problems. Martin Marietta used MATLAB to apply this method to a launch vehicle (FENOC). Draper supplied the fault-tolerant computing and software automation technology. The fault-tolerant technology includes sequential and parallel fault-tolerant processors (FTP & FTPP) and authentication protocols (AP) for communication. Fault-tolerant technology was incrementally incorporated. Development culminated with a heterogeneous network of workstations and fault-tolerant computers using AP. Draper's software automation system, ASTER, was used to specify a static guidance system based on FENOC, navigation, flight control (GN&C), models, and the interface to a user interface for mission control. ASTER generated Ada code for GN&C and C code for models. An algebraic transform engine (ATE) was developed to automatically translate MATLAB scripts into ASTER.

75 FR 22679 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-29

... Department of the Treasury. Dated: April 23, 2010. Manal Corwin, International Tax Counsel (Tax Policy). [FR... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

76 FR 27377 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-11

... the Department of the Treasury. Dated: May 2, 2011. Michael J. Caballero, International Tax Counsel... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

75 FR 44842 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-29

... Department of the Treasury. Dated: July 20, 2010. Manal Corwin, International Tax Counsel (Tax Policy). [FR... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

77 FR 7660 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-13

... Treasury. Dated: February 3, 2012. Michael J. Caballero, International Tax Counsel (Tax Policy). [FR Doc... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

75 FR 74769 - List of Countries Requiring Cooperation with an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-01

... the Department of the Treasury. Dated: November 23, 2010. Manal Corwin, International Tax Counsel (Tax... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

76 FR 67791 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-02

... Department of the Treasury. Dated: October 25, 2011. Michael J. Caballero, International Tax Counsel (Tax... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

76 FR 49836 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-11

... the Department of the Treasury. Dated: August 1, 2011. Michael J. Caballero, International Tax Counsel... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

14 CFR § 1214.403 - Code of Conduct for the International Space Station Crew.

Code of Federal Regulations, 2014 CFR

2014-01-01

... disciplinary policy, and requirements imposed by their Cooperating Agency or those relating to the Earth-to... Cooperating Agency providing him or her through the crew training curriculum and normal program operations as... his or her authority, leads the ISS crewmembers through the training curriculum and mission...

Cross-cultural comparison of political leaders' operational codes.

PubMed

Dirilen-Gumus, Ozlem

2017-12-01

This study aims at comparing operational codes (namely, philosophical and instrumental beliefs about the political universe) of political leaders from different cultures. According to Schwartz (2004), cultures can be categorised into 3 dimensions: autonomy-embeddedness, egalitarianism-hierarchy and mastery-harmony. This study draws upon the 1st dimension (akin to the most popular cultural dimension of Hofstede: individualism-collectivism) and focuses on comparing the leaders of autonomous and embedded cultures based on how cooperative/conflictual they are. The main research hypothesis is as follows: the leaders of embedded cultures would be more cooperative than the leaders of autonomous cultures. For this purpose, 3 autonomous cultures (the UK, Canada and Australia) and embedded cultures (Singapore, South Africa and Malaysia) cultures were chosen randomly and the cooperativeness of the correspondent countries' leaders were compared after being profiled by Profiler Plus. The results indicated that the leaders of embedded cultures were significantly more cooperative than autonomous cultures after holding the control variables constant. The findings were discussed in the light of relevant literature. © 2016 International Union of Psychological Science.

The interactive roles of parenting, emotion regulation and executive functioning in moral reasoning during middle childhood.

PubMed

Hinnant, J Benjamin; Nelson, Jackie A; O'Brien, Marion; Keane, Susan P; Calkins, Susan D

2013-01-01

We examined mother-child co-operative behaviour, children's emotion regulation and executive function, as well as combinations of these factors, as predictors of moral reasoning in 89 10-year-old children. Dyadic co-operation was coded from videotaped observations of laboratory puzzle and speech tasks. Emotion regulation was derived from maternal report, and executive functioning was assessed with the Tower of London task. Moral reasoning was coded during mother-child conversations about morally ambiguous, peer-conflict situations. Two significant interactions indicated that children from more co-operative dyads who also had higher executive function skills had higher moral reasoning scores than other children, and children lower in both emotion regulation and executive function had lower moral reasoning scores than other children. The results contribute to the literature on the multiple and interactive levels of influence on moral reasoning in childhood.

The Interactive Roles of Parenting, Emotion Regulation and Executive Functioning in Moral Reasoning during Middle Childhood

PubMed Central

Hinnant, J. Benjamin; Nelson, Jackie A.; O’Brien, Marion; Keane, Susan P.; Calkins, Susan D.

2013-01-01

We examined mother-child cooperative behavior, children’s emotion regulation and executive function, as well as combinations of these factors, as predictors of moral reasoning in 89 10-year-old children. Dyadic cooperation was coded from videotaped observations of laboratory puzzle and speech tasks. Emotion regulation was derived from maternal report, and executive functioning was assessed with the Tower of London task. Moral reasoning was coded during mother-child conversations about morally ambiguous, peer-conflict situations. Two significant interactions indicated that children from more cooperative dyads who also had higher executive function skills had higher moral reasoning scores than other children, and children lower in both emotion regulation and executive function had lower moral reasoning scores than other children. The results contribute to the literature on the multiple and interactive levels of influence on moral reasoning in childhood. PMID:23650955

Decentralized cooperative TOA/AOA target tracking for hierarchical wireless sensor networks.

PubMed

Chen, Ying-Chih; Wen, Chih-Yu

2012-11-08

This paper proposes a distributed method for cooperative target tracking in hierarchical wireless sensor networks. The concept of leader-based information processing is conducted to achieve object positioning, considering a cluster-based network topology. Random timers and local information are applied to adaptively select a sub-cluster for the localization task. The proposed energy-efficient tracking algorithm allows each sub-cluster member to locally estimate the target position with a Bayesian filtering framework and a neural networking model, and further performs estimation fusion in the leader node with the covariance intersection algorithm. This paper evaluates the merits and trade-offs of the protocol design towards developing more efficient and practical algorithms for object position estimation.

Coevolution of strategy-selection time scale and cooperation in spatial prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Rong, Zhihai; Wu, Zhi-Xi; Chen, Guanrong

2013-06-01

In this paper, we investigate a networked prisoner's dilemma game where individuals' strategy-selection time scale evolves based on their historical learning information. We show that the more times the current strategy of an individual is learnt by his neighbors, the longer time he will stick on the successful behavior by adaptively adjusting the lifetime of the adopted strategy. Through characterizing the extent of success of the individuals with normalized payoffs, we show that properly using the learned information can form a positive feedback mechanism between cooperative behavior and its lifetime, which can boost cooperation on square lattices and scale-free networks.

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks.

PubMed

Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

2017-05-16

In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks.

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks

PubMed Central

Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

2017-01-01

In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks. PMID:28509841

Toward Agent-Based Models of the Development And Evolution of Business Relations and Networks

NASA Astrophysics Data System (ADS)

Wilkinson, Ian F.; Marks, Robert E.; Young, Louise

Firms achieve competitive advantage in part through the development of cooperative relations with other firms and organisations. We describe a program of research designed to map and model the development of cooperative inter-firm relations, including the processes and paths by which firms may evolve from adversarial to more cooperative relations. Narrative-event-history methods will be used to develop stylised histories of the emergence of business relations in various contexts and to identify relevant causal mechanisms to be included in the agent-based models of relationship and network evolution. The relationship histories will provide the means of assuring the agent-based models developed.

A Novel Optimal Joint Resource Allocation Method in Cooperative Multicarrier Networks: Theory and Practice

PubMed Central

Gao, Yuan; Zhou, Weigui; Ao, Hong; Chu, Jian; Zhou, Quan; Zhou, Bo; Wang, Kang; Li, Yi; Xue, Peng

2016-01-01

With the increasing demands for better transmission speed and robust quality of service (QoS), the capacity constrained backhaul gradually becomes a bottleneck in cooperative wireless networks, e.g., in the Internet of Things (IoT) scenario in joint processing mode of LTE-Advanced Pro. This paper focuses on resource allocation within capacity constrained backhaul in uplink cooperative wireless networks, where two base stations (BSs) equipped with single antennae serve multiple single-antennae users via multi-carrier transmission mode. In this work, we propose a novel cooperative transmission scheme based on compress-and-forward with user pairing to solve the joint mixed integer programming problem. To maximize the system capacity under the limited backhaul, we formulate the joint optimization problem of user sorting, subcarrier mapping and backhaul resource sharing among different pairs (subcarriers for users). A novel robust and efficient centralized algorithm based on alternating optimization strategy and perfect mapping is proposed. Simulations show that our novel method can improve the system capacity significantly under the constraint of the backhaul resource compared with the blind alternatives. PMID:27077865

Technology Infusion of CodeSonar into the Space Network Ground Segment

NASA Technical Reports Server (NTRS)

Benson, Markland J.

2009-01-01

This slide presentation reviews the applicability of CodeSonar to the Space Network software. CodeSonar is a commercial off the shelf system that analyzes programs written in C, C++ or Ada for defects in the code. Software engineers use CodeSonar results as an input to the existing source code inspection process. The study is focused on large scale software developed using formal processes. The systems studied are mission critical in nature but some use commodity computer systems.

On Delay and Security in Network Coding

ERIC Educational Resources Information Center

Dikaliotis, Theodoros K.

2013-01-01

In this thesis, delay and security issues in network coding are considered. First, we study the delay incurred in the transmission of a fixed number of packets through acyclic networks comprised of erasure links. The two transmission schemes studied are routing with hop-by-hop retransmissions, where every node in the network simply stores and…

Non-US data compression and coding research. FASAC Technical Assessment Report

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

Gray, R.M.; Cohn, M.; Craver, L.W.

1993-11-01

This assessment of recent data compression and coding research outside the United States examines fundamental and applied work in the basic areas of signal decomposition, quantization, lossless compression, and error control, as well as application development efforts in image/video compression and speech/audio compression. Seven computer scientists and engineers who are active in development of these technologies in US academia, government, and industry carried out the assessment. Strong industrial and academic research groups in Western Europe, Israel, and the Pacific Rim are active in the worldwide search for compression algorithms that provide good tradeoffs among fidelity, bit rate, and computational complexity,more » though the theoretical roots and virtually all of the classical compression algorithms were developed in the United States. Certain areas, such as segmentation coding, model-based coding, and trellis-coded modulation, have developed earlier or in more depth outside the United States, though the United States has maintained its early lead in most areas of theory and algorithm development. Researchers abroad are active in other currently popular areas, such as quantizer design techniques based on neural networks and signal decompositions based on fractals and wavelets, but, in most cases, either similar research is or has been going on in the United States, or the work has not led to useful improvements in compression performance. Because there is a high degree of international cooperation and interaction in this field, good ideas spread rapidly across borders (both ways) through international conferences, journals, and technical exchanges. Though there have been no fundamental data compression breakthroughs in the past five years--outside or inside the United State--there have been an enormous number of significant improvements in both places in the tradeoffs among fidelity, bit rate, and computational complexity.« less

Noncoherent Physical-Layer Network Coding with FSK Modulation: Relay Receiver Design Issues

DTIC Science & Technology

2011-03-01

222 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 9, SEPTEMBER 2011 2595 Noncoherent Physical-Layer Network Coding with FSK Modulation: Relay... noncoherent reception, channel estima- tion. I. INTRODUCTION IN the two-way relay channel (TWRC), a pair of sourceterminals exchange information...2011 4. TITLE AND SUBTITLE Noncoherent Physical-Layer Network Coding with FSK Modulation:Relay Receiver Design Issues 5a. CONTRACT NUMBER 5b

Secure Cooperation of Autonomous Mobile Sensors Using an Underwater Acoustic Network

PubMed Central

Caiti, Andrea; Calabrò, Vincenzo; Dini, Gianluca; Duca, Angelica Lo; Munafò, Andrea

2012-01-01

Methodologies and algorithms are presented for the secure cooperation of a team of autonomous mobile underwater sensors, connected through an acoustic communication network, within surveillance and patrolling applications. In particular, the work proposes a cooperative algorithm in which the mobile underwater sensors (installed on Autonomous Underwater Vehicles—AUVs) respond to simple local rules based on the available information to perform the mission and maintain the communication link with the network (behavioral approach). The algorithm is intrinsically robust: with loss of communication among the vehicles the coverage performance (i.e., the mission goal) is degraded but not lost. The ensuing form of graceful degradation provides also a reactive measure against Denial of Service. The cooperative algorithm relies on the fact that the available information from the other sensors, though not necessarily complete, is trustworthy. To ensure trustworthiness, a security suite has been designed, specifically oriented to the underwater scenario, and in particular with the goal of reducing the communication overhead introduced by security in terms of number and size of messages. The paper gives implementation details on the integration between the security suite and the cooperative algorithm and provides statistics on the performance of the system as collected during the UAN project sea trial held in Trondheim, Norway, in May 2011. PMID:22438748

Utility Evaluation Based on One-To-N Mapping in the Prisoner’s Dilemma Game for Interdependent Networks

PubMed Central

Wang, Juan; Lu, Wenwen; Liu, Lina; Li, Li; Xia, Chengyi

2016-01-01

In the field of evolutionary game theory, network reciprocity has become an important means to promote the level of promotion within the population system. Recently, the interdependency provides a novel perspective to understand the widespread cooperation behavior in many real-world systems. In previous works, interdependency is often built from the direct or indirect connections between two networks through the one-to-one mapping mode. However, under many realistic scenarios, players may need much more information from many neighboring agents so as to make a more rational decision. Thus, beyond the one-to-one mapping mode, we investigate the cooperation behavior on two interdependent lattices, in which the utility evaluation of a focal player on one lattice may not only concern himself, but also integrate the payoff information of several corresponding players on the other lattice. Large quantities of simulations indicate that the cooperation can be substantially promoted when compared to the traditionally spatial lattices. The cluster formation and phase transition are also analyzed in order to explore the role of interdependent utility coupling in the collective cooperation. Current results are beneficial to deeply understand various mechanisms to foster the cooperation exhibited inside natural, social and engineering systems. PMID:27907024

Secure cooperation of autonomous mobile sensors using an underwater acoustic network.

PubMed

Caiti, Andrea; Calabrò, Vincenzo; Dini, Gianluca; Lo Duca, Angelica; Munafò, Andrea

2012-01-01

Methodologies and algorithms are presented for the secure cooperation of a team of autonomous mobile underwater sensors, connected through an acoustic communication network, within surveillance and patrolling applications. In particular, the work proposes a cooperative algorithm in which the mobile underwater sensors (installed on Autonomous Underwater Vehicles-AUVs) respond to simple local rules based on the available information to perform the mission and maintain the communication link with the network (behavioral approach). The algorithm is intrinsically robust: with loss of communication among the vehicles the coverage performance (i.e., the mission goal) is degraded but not lost. The ensuing form of graceful degradation provides also a reactive measure against Denial of Service. The cooperative algorithm relies on the fact that the available information from the other sensors, though not necessarily complete, is trustworthy. To ensure trustworthiness, a security suite has been designed, specifically oriented to the underwater scenario, and in particular with the goal of reducing the communication overhead introduced by security in terms of number and size of messages. The paper gives implementation details on the integration between the security suite and the cooperative algorithm and provides statistics on the performance of the system as collected during the UAN project sea trial held in Trondheim, Norway, in May 2011.

Technology Network Ties: Network Services and Technology Programs for New York State's Educational System.

ERIC Educational Resources Information Center

New York State Education Dept., Albany. Office of Elementary and Secondary Education Planning, Testing, and Technological Services.

The New York State Technology Network Ties (TNT) systems is a statewide telecommunications network which consists of computers, telephone lines, and telecommunications hardware and software. This network links school districts, Boards of Cooperative Educational Services (BOCES), libraries, other educational institutions, and the State Education…

Learning dynamics explains human behaviour in prisoner's dilemma on networks.

PubMed

Cimini, Giulio; Sánchez, Angel

2014-05-06

Cooperative behaviour lies at the very basis of human societies, yet its evolutionary origin remains a key unsolved puzzle. Whereas reciprocity or conditional cooperation is one of the most prominent mechanisms proposed to explain the emergence of cooperation in social dilemmas, recent experimental findings on networked Prisoner's Dilemma games suggest that conditional cooperation also depends on the previous action of the player-namely on the 'mood' in which the player is currently in. Roughly, a majority of people behave as conditional cooperators if they cooperated in the past, whereas they ignore the context and free ride with high probability if they did not. However, the ultimate origin of this behaviour represents a conundrum itself. Here, we aim specifically to provide an evolutionary explanation of moody conditional cooperation (MCC). To this end, we perform an extensive analysis of different evolutionary dynamics for players' behavioural traits-ranging from standard processes used in game theory based on pay-off comparison to others that include non-economic or social factors. Our results show that only a dynamic built upon reinforcement learning is able to give rise to evolutionarily stable MCC, and at the end to reproduce the human behaviours observed in the experiments.

Cooperative networks overcoming defectors by social influence

NASA Astrophysics Data System (ADS)

Gomez Portillo, Ignacio

2014-01-01

We address the cooperation problem in structured populations by considering the prisoner’s dilemma game as a metaphor of the social interactions between individuals with imitation capacity. We present a new strategy update rule called democratic weighted update where the individual’s behavior is socially influenced by each one of their neighbors. In particular, the capacity of an individual to socially influence other ones is proportional to its accumulated payoff. When in a neighborhood there are cooperators and defectors, the focal player is contradictorily influenced by them and, therefore, the effective social influence is given by the difference of the accumulated payoff of each strategy in its neighborhood. First, by considering the growing process of the network and neglecting mutations, we show the evolution of highly cooperative systems. Then, we broadly show that the social influence allows to overcome the emergence of defectors into highly cooperative systems. In this way, we conclude that in a structured system formed by a growing process, the cooperation evolves if the individuals have an imitation capacity socially influenced by each one of their neighbors. Therefore, here we present a theoretical solution of the cooperation problem among genetically unrelated individuals.

Coordinated within-trial dynamics of low-frequency neural rhythms controls evidence accumulation.

PubMed

Werkle-Bergner, Markus; Grandy, Thomas H; Chicherio, Christian; Schmiedek, Florian; Lövdén, Martin; Lindenberger, Ulman

2014-06-18

Higher cognitive functions, such as human perceptual decision making, require information processing and transmission across wide-spread cortical networks. Temporally synchronized neural firing patterns are advantageous for efficiently representing and transmitting information within and between assemblies. Computational, empirical, and conceptual considerations all lead to the expectation that the informational redundancy of neural firing rates is positively related to their synchronization. Recent theorizing and initial evidence also suggest that the coding of stimulus characteristics and their integration with behavioral goal states require neural interactions across a hierarchy of timescales. However, most studies thus have focused on neural activity in a single frequency range or on a restricted set of brain regions. Here we provide evidence for cooperative spatiotemporal dynamics of slow and fast EEG signals during perceptual decision making at the single-trial level. Participants performed three masked two-choice decision tasks, one each with numerical, verbal, or figural content. Decrements in posterior α power (8-14 Hz) were paralleled by increments in high-frequency (>30 Hz) signal entropy in trials demanding active sensory processing. Simultaneously, frontocentral θ power (4-7 Hz) increased, indicating evidence integration. The coordinated α/θ dynamics were tightly linked to decision speed and remarkably similar across tasks, suggesting a domain-general mechanism. In sum, we demonstrate an inverse association between decision-related changes in widespread low-frequency power and local high-frequency entropy. The cooperation among mechanisms captured by these changes enhances the informational density of neural response patterns and qualifies as a neural coding system in the service of perceptual decision making. Copyright © 2014 the authors 0270-6474/14/348519-10$15.00/0.

Library Networking: Current Problems and Future Prospects! Panel Discussion.

ERIC Educational Resources Information Center

Resource Sharing and Information Networks, 1983

1983-01-01

Presents questions and answers from information networking panel discussion involving symposium speakers Barbara Markuson (Indiana Cooperative Library Services Authority), Frank Grisham (Southeastern Library Network), Laima Mockus (New England Library Information Network), Richard McCoy (Research Libraries Group), Rowland Brown (OCLC), and Toni…

The Multitype Library Network.

ERIC Educational Resources Information Center

Dejohn, William, Ed.; Lamont, Bridget L., Ed.

1975-01-01

"Illinois Libraries" for June, 1975, is devoted to interlibrary cooperation and the multitype library network as exemplified by the Illinois Library and Information Network (ILLINET). The history, geographical coverage, member and affiliate libraries, and the workings of the network at various levels are described. A second section…

Approximately adaptive neural cooperative control for nonlinear multiagent systems with performance guarantee

NASA Astrophysics Data System (ADS)

Wang, Jing; Yang, Tianyu; Staskevich, Gennady; Abbe, Brian

2017-04-01

This paper studies the cooperative control problem for a class of multiagent dynamical systems with partially unknown nonlinear system dynamics. In particular, the control objective is to solve the state consensus problem for multiagent systems based on the minimisation of certain cost functions for individual agents. Under the assumption that there exist admissible cooperative controls for such class of multiagent systems, the formulated problem is solved through finding the optimal cooperative control using the approximate dynamic programming and reinforcement learning approach. With the aid of neural network parameterisation and online adaptive learning, our method renders a practically implementable approximately adaptive neural cooperative control for multiagent systems. Specifically, based on the Bellman's principle of optimality, the Hamilton-Jacobi-Bellman (HJB) equation for multiagent systems is first derived. We then propose an approximately adaptive policy iteration algorithm for multiagent cooperative control based on neural network approximation of the value functions. The convergence of the proposed algorithm is rigorously proved using the contraction mapping method. The simulation results are included to validate the effectiveness of the proposed algorithm.

Effects of Dimers on Cooperation in the Spatial Prisoner's Dilemma Game

NASA Astrophysics Data System (ADS)

Li, Hai-Hong; Cheng, Hong-Yan; Dai, Qiong-Lin; Ju, Ping; Zhang, Mei; Yang, Jun-Zhong

2011-11-01

We investigate the evolutionary prisoner's dilemma game in structured populations by introducing dimers, which are defined as that two players in each dimer always hold a same strategy. We find that influences of dimers on cooperation depend on the type of dimers and the population structure. For those dimers in which players interact with each other, the cooperation level increases with the number of dimers though the cooperation improvement level depends on the type of network structures. On the other hand, the dimers, in which there are not mutual interactions, will not do any good to the cooperation level in a single community, but interestingly, will improve the cooperation level in a population with two communities. We explore the relationship between dimers and self-interactions and find that the effects of dimers are similar to that of self-interactions. Also, we find that the dimers, which are established over two communities in a multi-community network, act as one type of interaction through which information between communities is communicated by the requirement that two players in a dimer hold a same strategy.

Evolutionary dynamics of cooperation in neutral populations

NASA Astrophysics Data System (ADS)

Szolnoki, Attila; Perc, Matjaž

2018-01-01

Cooperation is a difficult proposition in the face of Darwinian selection. Those that defect have an evolutionary advantage over cooperators who should therefore die out. However, spatial structure enables cooperators to survive through the formation of homogeneous clusters, which is the hallmark of network reciprocity. Here we go beyond this traditional setup and study the spatiotemporal dynamics of cooperation in a population of populations. We use the prisoner's dilemma game as the mathematical model and show that considering several populations simultaneously gives rise to fascinating spatiotemporal dynamics and pattern formation. Even the simplest assumption that strategies between different populations are payoff-neutral with one another results in the spontaneous emergence of cyclic dominance, where defectors of one population become prey of cooperators in the other population, and vice versa. Moreover, if social interactions within different populations are characterized by significantly different temptations to defect, we observe that defectors in the population with the largest temptation counterintuitively vanish the fastest, while cooperators that hang on eventually take over the whole available space. Our results reveal that considering the simultaneous presence of different populations significantly expands the complexity of evolutionary dynamics in structured populations, and it allows us to understand the stability of cooperation under adverse conditions that could never be bridged by network reciprocity alone.

Decoding small surface codes with feedforward neural networks

NASA Astrophysics Data System (ADS)

Varsamopoulos, Savvas; Criger, Ben; Bertels, Koen

2018-01-01

Surface codes reach high error thresholds when decoded with known algorithms, but the decoding time will likely exceed the available time budget, especially for near-term implementations. To decrease the decoding time, we reduce the decoding problem to a classification problem that a feedforward neural network can solve. We investigate quantum error correction and fault tolerance at small code distances using neural network-based decoders, demonstrating that the neural network can generalize to inputs that were not provided during training and that they can reach similar or better decoding performance compared to previous algorithms. We conclude by discussing the time required by a feedforward neural network decoder in hardware.

Supercooperation in evolutionary games on correlated weighted networks.

PubMed

Buesser, Pierre; Tomassini, Marco

2012-01-01

In this work we study the behavior of classical two-person, two-strategies evolutionary games on a class of weighted networks derived from Barabási-Albert and random scale-free unweighted graphs. Using customary imitative dynamics, our numerical simulation results show that the presence of link weights that are correlated in a particular manner with the degree of the link end points leads to unprecedented levels of cooperation in the whole games' phase space, well above those found for the corresponding unweighted complex networks. We provide intuitive explanations for this favorable behavior by transforming the weighted networks into unweighted ones with particular topological properties. The resulting structures help us to understand why cooperation can thrive and also give ideas as to how such supercooperative networks might be built.

GLOBECOM '88 - IEEE Global Telecommunications Conference and Exhibition, Hollywood, FL, Nov. 28-Dec. 1, 1988, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

Various papers on communications for the information age are presented. Among the general topics considered are: telematic services and terminals, satellite communications, telecommunications mangaement network, control of integrated broadband networks, advances in digital radio systems, the intelligent network, broadband networks and services deployment, future switch architectures, performance analysis of computer networks, advances in spread spectrum, optical high-speed LANs, and broadband switching and networks. Also addressed are: multiple access protocols, video coding techniques, modulation and coding, photonic switching, SONET terminals and applications, standards for video coding, digital switching, progress in MANs, mobile and portable radio, software design for improved maintainability, multipath propagation and advanced countermeasure, data communication, network control and management, fiber in the loop, network algorithm and protocols, and advances in computer communications.

Communique: Special Issue on the International Network for Cooperation in Northern Science Created at a Meeting held in Edmonton, Alberta (October 12-15, 1982). Summary of Discussions and Agreements Reached = Numero special sur le Reseau Scientifique Internationale pour le Nord cree a la reunion tenue a Edmonton, Alberta (du 12 au 15 octobre 1982). Resume des discussions et accords conclus.

ERIC Educational Resources Information Center

Communique, 1983

1983-01-01

Delegations from Canada, Finland, Greenland, Norway, Sweden, and the United States agreed to the establishment of a network for cooperation among individuals engaged in problems peculiar to the circumpolar North. The Northern Science Network, established within the Unesco Man and the Biosphere Program, consists of three themes: studies on the…

Scientific reasons for a network of ST radars and cooperative campaigns

NASA Technical Reports Server (NTRS)

Petitdidier, M.; Crochet, M.

1986-01-01

Due to their capabilities of measuring wind profiles in the troposphere and stratosphere with good time and height resolution, whatever the weather conditions, stratosphere-troposphere (ST) radars are well adapted to carry out atmospheric research in many fields as well as to fulfill the meteorological forecasting needs. Examples are presented from previous and future national or international campaigns planned in France. The ST radars were used first by themselves with the adjunction of radiosonde data. Then networks were built and used to get horizontal parameters. It appears that ST radar networks should naturally be included in cooperative campaigns.

Mobile Security Enclaves

DTIC Science & Technology

2011-09-01

LAI Location Area Identity MANET Mobile Ad - hoc Network MCC Mobile Country Code MCD Mobile Communications Device MNC Mobile Network Code ...tower or present within a geographical area. These conditions relate directly to users who often operate with mobile ad - hoc networks. These types of...infrastructures. First responders can use these mobile base stations to set up their own networks on the fly, similar to mobile ad - hoc networks

An efficient and reliable geographic routing protocol based on partial network coding for underwater sensor networks.

PubMed

Hao, Kun; Jin, Zhigang; Shen, Haifeng; Wang, Ying

2015-05-28

Efficient routing protocols for data packet delivery are crucial to underwater sensor networks (UWSNs). However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. Network coding is a promising technique for efficient data packet delivery thanks to the broadcast nature of acoustic channels and the relatively high computation capabilities of the sensor nodes. In this work, we present GPNC, a novel geographic routing protocol for UWSNs that incorporates partial network coding to encode data packets and uses sensor nodes' location information to greedily forward data packets to sink nodes. GPNC can effectively reduce network delays and retransmissions of redundant packets causing additional network energy consumption. Simulation results show that GPNC can significantly improve network throughput and packet delivery ratio, while reducing energy consumption and network latency when compared with other routing protocols.

Dim Networks: The Utility of Social Network Analysis for Illuminating Partner Security Force Networks

DTIC Science & Technology

2015-12-01

use of social network analysis (SNA) has allowed the military to map dark networks of terrorist organizations and selectively target key elements...data to improve SC. 14. SUBJECT TERMS social network analysis, dark networks, light networks, dim networks, security cooperation, Southeast Asia...task may already exist. Recently, the use of social network analysis (SNA) has allowed the military to map dark networks of terrorist organizations

Peer-to-peer model for the area coverage and cooperative control of mobile sensor networks

NASA Astrophysics Data System (ADS)

Tan, Jindong; Xi, Ning

2004-09-01

This paper presents a novel model and distributed algorithms for the cooperation and redeployment of mobile sensor networks. A mobile sensor network composes of a collection of wireless connected mobile robots equipped with a variety of sensors. In such a sensor network, each mobile node has sensing, computation, communication, and locomotion capabilities. The locomotion ability enhances the autonomous deployment of the system. The system can be rapidly deployed to hostile environment, inaccessible terrains or disaster relief operations. The mobile sensor network is essentially a cooperative multiple robot system. This paper first presents a peer-to-peer model to define the relationship between neighboring communicating robots. Delaunay Triangulation and Voronoi diagrams are used to define the geometrical relationship between sensor nodes. This distributed model allows formal analysis for the fusion of spatio-temporal sensory information of the network. Based on the distributed model, this paper discusses a fault tolerant algorithm for autonomous self-deployment of the mobile robots. The algorithm considers the environment constraints, the presence of obstacles and the nonholonomic constraints of the robots. The distributed algorithm enables the system to reconfigure itself such that the area covered by the system can be enlarged. Simulation results have shown the effectiveness of the distributed model and deployment algorithms.

Stochastic noncooperative and cooperative evolutionary game strategies of a population of biological networks under natural selection.

PubMed

Chen, Bor-Sen; Yeh, Chin-Hsun

2017-12-01

We review current static and dynamic evolutionary game strategies of biological networks and discuss the lack of random genetic variations and stochastic environmental disturbances in these models. To include these factors, a population of evolving biological networks is modeled as a nonlinear stochastic biological system with Poisson-driven genetic variations and random environmental fluctuations (stimuli). To gain insight into the evolutionary game theory of stochastic biological networks under natural selection, the phenotypic robustness and network evolvability of noncooperative and cooperative evolutionary game strategies are discussed from a stochastic Nash game perspective. The noncooperative strategy can be transformed into an equivalent multi-objective optimization problem and is shown to display significantly improved network robustness to tolerate genetic variations and buffer environmental disturbances, maintaining phenotypic traits for longer than the cooperative strategy. However, the noncooperative case requires greater effort and more compromises between partly conflicting players. Global linearization is used to simplify the problem of solving nonlinear stochastic evolutionary games. Finally, a simple stochastic evolutionary model of a metabolic pathway is simulated to illustrate the procedure of solving for two evolutionary game strategies and to confirm and compare their respective characteristics in the evolutionary process. Copyright © 2017 Elsevier B.V. All rights reserved.

Protein-DNA binding dynamics predict transcriptional response to nutrients in archaea.

PubMed

Todor, Horia; Sharma, Kriti; Pittman, Adrianne M C; Schmid, Amy K

2013-10-01

Organisms across all three domains of life use gene regulatory networks (GRNs) to integrate varied stimuli into coherent transcriptional responses to environmental pressures. However, inferring GRN topology and regulatory causality remains a central challenge in systems biology. Previous work characterized TrmB as a global metabolic transcription factor in archaeal extremophiles. However, it remains unclear how TrmB dynamically regulates its ∼100 metabolic enzyme-coding gene targets. Using a dynamic perturbation approach, we elucidate the topology of the TrmB metabolic GRN in the model archaeon Halobacterium salinarum. Clustering of dynamic gene expression patterns reveals that TrmB functions alone to regulate central metabolic enzyme-coding genes but cooperates with various regulators to control peripheral metabolic pathways. Using a dynamical model, we predict gene expression patterns for some TrmB-dependent promoters and infer secondary regulators for others. Our data suggest feed-forward gene regulatory topology for cobalamin biosynthesis. In contrast, purine biosynthesis appears to require TrmB-independent regulators. We conclude that TrmB is an important component for mediating metabolic modularity, integrating nutrient status and regulating gene expression dynamics alone and in concert with secondary regulators.

[SUPPORT, CO-OPERATIVE EDUCATION PROGRAMMES, PRAGMATIC CODE OF ETHICS: A CLINICAL APPROACH OF EXECUTIVE TRAINING].

PubMed

Cabaret, Véronique

2016-01-01

This article aims at introducing an educational sequence completed at l'Institut de Formation des Cadres de Santé (IFCS) at the CHRU in Lille in France, entitled "training project and educational project" present in the "training duties" module whose goal is to generate students'knowledge through co-operative education programmes. By creating this innovative sequence, the educational aim is to use the Institut ground as a ground of learning, associated with the various internship grounds, in order to get the most of co-operative education programmes. Besides, in a pragmatic code of ethics in training, the teaching staff draw their inspiration from a clinical approach of executive training: they regard students as true protagonists in a co-operative plan created for them, wishing to design it with them using their words. Thus, students are brought to criticize the IFCS educational project and debate it with the trainers who have built it. Each partner tries to understand the Other, being aware of their being different. By contributing every year to rewriting the educational project which directly concerns them, students build their professional positions as health executives. They play an active role in co-operative education programmes just like IFCS outside partners.

The Dynamics of Coalition Formation on Complex Networks

NASA Astrophysics Data System (ADS)

Auer, S.; Heitzig, J.; Kornek, U.; Schöll, E.; Kurths, J.

2015-08-01

Complex networks describe the structure of many socio-economic systems. However, in studies of decision-making processes the evolution of the underlying social relations are disregarded. In this report, we aim to understand the formation of self-organizing domains of cooperation (“coalitions”) on an acquaintance network. We include both the network’s influence on the formation of coalitions and vice versa how the network adapts to the current coalition structure, thus forming a social feedback loop. We increase complexity from simple opinion adaptation processes studied in earlier research to more complex decision-making determined by costs and benefits, and from bilateral to multilateral cooperation. We show how phase transitions emerge from such coevolutionary dynamics, which can be interpreted as processes of great transformations. If the network adaptation rate is high, the social dynamics prevent the formation of a grand coalition and therefore full cooperation. We find some empirical support for our main results: Our model develops a bimodal coalition size distribution over time similar to those found in social structures. Our detection and distinguishing of phase transitions may be exemplary for other models of socio-economic systems with low agent numbers and therefore strong finite-size effects.

[A survey of Local Physicians and Psychotherapists on Cooperation in Regional Networks for Early Child Interventions in Saxony-Anhalt].

PubMed

Clauß, D; Fleischer, S; Mattern, E; Ayerle, G

2016-07-01

Early childhood interventions positively contribute to health related child development. For these interventions, networks are a necessary prerequisite as they promote interdisciplinary and interprofessional cooperation. This holds especially true for the integration of health system protagonists. In a cross-sectional survey local paediatrists, gynaecologists, general practitioners, and psychotherapists were asked about their knowledge, experiences, desires, and reservations regarding cooperation in early childhood intervention networks. 64 out of 1747 (3.7%) eligible clinicians answered the survey. On average they estimated that 10.1% of the families they are treating would benefit from early childhood interventions. Participants rated themselves as competent to offer appropriate early childhood interventions. The youth welfare service was judged as the most important institution for their own professional practice by 84.4%. Additionally to an applicable agenda, a fair group moderation of network meetings was seen as a substantial requirement in order to take part in network meetings. Health professionals are important protagonists in early childhood interventions. Clinicians should assess relevant problems in families and offer appropriate support on a regular basis. Alongside clearly defined regional contacts, interprofessional continuing education seems mandatory. © Georg Thieme Verlag KG Stuttgart · New York.

An Architecture for Cooperative Localization in Underwater Acoustic Networks

DTIC Science & Technology

2015-10-24

range. (b) Independent navigation and control system onboard Iver AUVs . The cooperative localization process is highlighted in red. Figure 1: Block...Iver2 AUVs (Fig. 3) and a topside ship. While we make spe- cific notes about this three vehicle network, the architecture is vehicle independent. 3.1...Single vehicle subsystem Each vehicle executes several processes including sensor drivers, a pose estimator (Section 2), and, in the case of the AUVs

Configuration of Wireless Cooperative/Sensor Networks

DTIC Science & Technology

2008-05-25

WSN), the advantages of cooperation can be further exploited by optimally allocating the energy and bandwidth resources among users based on the... consumption and extend system lifetime [Sin98]. The implementation of a minimum energy routing protocol is discussed in [Dos02a, Dos02b]. An online...power consumption in the network given the required SER at the destination. For example, with source power Ps=20dB, the EP algorithm requires one relay

Summary of DSN (Deep Space Network) reimbursable launch support

NASA Technical Reports Server (NTRS)

Fanelli, N. A.; Wyatt, M. E.

1988-01-01

The Deep Space Network is providing ground support to space agencies of foreign governments as well as to NASA and other agencies of the Federal government which are involved in space activities. DSN funding for support of missions other than NASA are on either a cooperative or a reimbursable basis. Cooperative funding and support are accomplished in the same manner as NASA sponsored missions. Reimbursable launch funding and support methods are described.

Chimera states in a network-organized public goods game with destructive agents

NASA Astrophysics Data System (ADS)

Kouvaris, Nikos E.; Requejo, Rubén J.; Hizanidis, Johanne; Díaz-Guilera, Albert

2016-12-01

We found that a network-organized metapopulation of cooperators, defectors, and destructive agents playing the public goods game with mutations can collectively reach global synchronization or chimera states. Global synchronization is accompanied by a collective periodic burst of cooperation, whereas chimera states reflect the tendency of the networked metapopulation to be fragmented in clusters of synchronous and incoherent bursts of cooperation. Numerical simulations have shown that the system's dynamics switches between these two steady states through a first order transition. Depending on the parameters determining the dynamical and topological properties, chimera states with different numbers of coherent and incoherent clusters are observed. Our results present the first systematic study of chimera states and their characterization in the context of evolutionary game theory. This provides a valuable insight into the details of their occurrence, extending the relevance of such states to natural and social systems.

Perturbed cooperative-state feedback strategy for model predictive networked control of interconnected systems.

PubMed

Tran, Tri; Ha, Q P

2018-01-01

A perturbed cooperative-state feedback (PSF) strategy is presented for the control of interconnected systems in this paper. The subsystems of an interconnected system can exchange data via the communication network that has multiple connection topologies. The PSF strategy can resolve both issues, the sensor data losses and the communication network breaks, thanks to the two components of the control including a cooperative-state feedback and a perturbation variable, e.g., u i =K ij x j +w i . The PSF is implemented in a decentralized model predictive control scheme with a stability constraint and a non-monotonic storage function (ΔV(x(k))≥0), derived from the dissipative systems theory. Numerical simulation for the automatic generation control problem in power systems is studied to illustrate the effectiveness of the presented PSF strategy. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Non-Cooperative Air Target Identification Using Radar (l’Identification radar des cibles aeriennes non cooperatives)

DTIC Science & Technology

1998-11-01

are already operational in the radar domain , e.g. in airborne radars. NATO fighter aircraft are equipped with transponder systems answering on...Mise en forme et 6talonnage des donn6es SER moyenne pour un domaine de fr6quence (bande passante du code utilis6) et un secteur Ce module extrait les...cooperatives) Papers presented at the Symposium of the RTO Systems Concepts and Integration Panel (SCI) held in Mannheim, Germany, 22-24 April 1998. 1

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

PubMed Central

Ye, Ye; Cheong, Kang Hao; Cen, Yu-wan; Xie, Neng-gang

2016-01-01

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed. PMID:27845430

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

NASA Astrophysics Data System (ADS)

Ye, Ye; Cheong, Kang Hao; Cen, Yu-Wan; Xie, Neng-Gang

2016-11-01

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed.

Connectivity Restoration in Wireless Sensor Networks via Space Network Coding.

PubMed

Uwitonze, Alfred; Huang, Jiaqing; Ye, Yuanqing; Cheng, Wenqing

2017-04-20

The problem of finding the number and optimal positions of relay nodes for restoring the network connectivity in partitioned Wireless Sensor Networks (WSNs) is Non-deterministic Polynomial-time hard (NP-hard) and thus heuristic methods are preferred to solve it. This paper proposes a novel polynomial time heuristic algorithm, namely, Relay Placement using Space Network Coding (RPSNC), to solve this problem, where Space Network Coding, also called Space Information Flow (SIF), is a new research paradigm that studies network coding in Euclidean space, in which extra relay nodes can be introduced to reduce the cost of communication. Unlike contemporary schemes that are often based on Minimum Spanning Tree (MST), Euclidean Steiner Minimal Tree (ESMT) or a combination of MST with ESMT, RPSNC is a new min-cost multicast space network coding approach that combines Delaunay triangulation and non-uniform partitioning techniques for generating a number of candidate relay nodes, and then linear programming is applied for choosing the optimal relay nodes and computing their connection links with terminals. Subsequently, an equilibrium method is used to refine the locations of the optimal relay nodes, by moving them to balanced positions. RPSNC can adapt to any density distribution of relay nodes and terminals, as well as any density distribution of terminals. The performance and complexity of RPSNC are analyzed and its performance is validated through simulation experiments.

An effective intervention algorithm for promoting cooperation in the prisoner's dilemma game with multiple stable states

NASA Astrophysics Data System (ADS)

Li, Y. S.; Xu, C.; Hui, P. M.

2018-07-01

Multiple stable states, hysteresis, sensitivity to initial distributions, and a control algorithm for promoting cooperation are studied in an evolutionary prisoner's dilemma with agents connected into a regular random network. A system could evolve into states of different cooperative frequencies xc in different runs, even starting with the same initial cooperative frequency xc(in) and payoff parameters. For a large reward R, some values of xc(in) either take the system to a group of low cooperative frequency (LCF) states or to a few high cooperative frequency (HCF) states. These states differ by their network structures, with cooperative players connected into ring-like structure in LCF states and compact clusters in HCF states. Hysteresis in xc is observed when R is swept down and up, when the final state of the previous R is used as the initial state of the next R. The analysis led us to propose a closed pack cluster algorithm that gives HCF states effectively. The algorithm intervenes the system at some point in time by selectively switching some non-cooperative D-agents into cooperative C-agents at the peripheral of an existing cluster of C-agents. It ensures protection of a small C-cluster from which more cooperation can be induced. Practically, a governing body may first allow a society to evolve freely and then derive suitable policy to promote selected pockets of good practices for attaining a higher level of common good.

Solution of nonlinear flow equations for complex aerodynamic shapes

NASA Technical Reports Server (NTRS)

Djomehri, M. Jahed

1992-01-01

Solution-adaptive CFD codes based on unstructured methods for 3-D complex geometries in subsonic to supersonic regimes were investigated, and the computed solution data were analyzed in conjunction with experimental data obtained from wind tunnel measurements in order to assess and validate the predictability of the code. Specifically, the FELISA code was assessed and improved in cooperation with NASA Langley and Imperial College, Swansea, U.K.

All-optical OFDM network coding scheme for all-optical virtual private communication in PON

NASA Astrophysics Data System (ADS)

Li, Lijun; Gu, Rentao; Ji, Yuefeng; Bai, Lin; Huang, Zhitong

2014-03-01

A novel optical orthogonal frequency division multiplexing (OFDM) network coding scheme is proposed over passive optical network (PON) system. The proposed scheme for all-optical virtual private network (VPN) does not only improve transmission efficiency, but also realize full-duplex communication mode in a single fiber. Compared with the traditional all-optical VPN architectures, the all-optical OFDM network coding scheme can support higher speed, more flexible bandwidth allocation, and higher spectrum efficiency. In order to reduce the difficulty of alignment for encoding operation between inter-communication traffic, the width of OFDM subcarrier pulse is stretched in our proposed scheme. The feasibility of all-optical OFDM network coding scheme for VPN is verified, and the relevant simulation results show that the full-duplex inter-communication traffic stream can be transmitted successfully. Furthermore, the tolerance of misalignment existing in inter-ONUs traffic is investigated and analyzed for all-optical encoding operation, and the difficulty of pulse alignment is proved to be lower.

QOS-aware error recovery in wireless body sensor networks using adaptive network coding.

PubMed

Razzaque, Mohammad Abdur; Javadi, Saeideh S; Coulibaly, Yahaya; Hira, Muta Tah

2014-12-29

Wireless body sensor networks (WBSNs) for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS), in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network's QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts.

78 FR 10690 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-14

..., 2013. Danielle Rolfes, International Tax Counsel (Tax Policy). [FR Doc. 2013-03339 Filed 2-13-13; 8:45... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

78 FR 32011 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-28

..., 2013. Danielle Rolfes, International Tax Counsel, Tax Policy. [FR Doc. 2013-12415 Filed 5-24-13; 8:45... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

77 FR 68886 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2012-11-16

..., 2012. Danielle Rolfes, International Tax Counsel, (Tax Policy). [FR Doc. 2012-27737 Filed 11-15-12; 8... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

77 FR 49864 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-17

..., 2012. Danielle Rolfes, Acting International Tax Counsel, Tax Policy. [FR Doc. 2012-20182 Filed 8-16-12... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

78 FR 71038 - List of Countries Requiring Cooperation With an International Boycott

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-27

..., 2013. Danielle Rolfes, International Tax Counsel, (Tax Policy). [FR Doc. 2013-28490 Filed 11-26-13; 8... International Boycott In accordance with section 999(a)(3) of the Internal Revenue Code of 1986, the Department... in, or cooperation with, an international boycott (within the meaning of section 999(b)(3) of the...

Cooperative system and method using mobile robots for testing a cooperative search controller

DOEpatents

Byrne, Raymond H.; Harrington, John J.; Eskridge, Steven E.; Hurtado, John E.

2002-01-01

A test system for testing a controller provides a way to use large numbers of miniature mobile robots to test a cooperative search controller in a test area, where each mobile robot has a sensor, a communication device, a processor, and a memory. A method of using a test system provides a way for testing a cooperative search controller using multiple robots sharing information and communicating over a communication network.

GLOBECOM '87 - Global Telecommunications Conference, Tokyo, Japan, Nov. 15-18, 1987, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

The present conference on global telecommunications discusses topics in the fields of Integrated Services Digital Network (ISDN) technology field trial planning and results to date, motion video coding, ISDN networking, future network communications security, flexible and intelligent voice/data networks, Asian and Pacific lightwave and radio systems, subscriber radio systems, the performance of distributed systems, signal processing theory, satellite communications modulation and coding, and terminals for the handicapped. Also discussed are knowledge-based technologies for communications systems, future satellite transmissions, high quality image services, novel digital signal processors, broadband network access interface, traffic engineering for ISDN design and planning, telecommunications software, coherent optical communications, multimedia terminal systems, advanced speed coding, portable and mobile radio communications, multi-Gbit/second lightwave transmission systems, enhanced capability digital terminals, communications network reliability, advanced antimultipath fading techniques, undersea lightwave transmission, image coding, modulation and synchronization, adaptive signal processing, integrated optical devices, VLSI technologies for ISDN, field performance of packet switching, CSMA protocols, optical transport system architectures for broadband ISDN, mobile satellite communications, indoor wireless communication, echo cancellation in communications, and distributed network algorithms.

Population coding in sparsely connected networks of noisy neurons.

PubMed

Tripp, Bryan P; Orchard, Jeff

2012-01-01

This study examines the relationship between population coding and spatial connection statistics in networks of noisy neurons. Encoding of sensory information in the neocortex is thought to require coordinated neural populations, because individual cortical neurons respond to a wide range of stimuli, and exhibit highly variable spiking in response to repeated stimuli. Population coding is rooted in network structure, because cortical neurons receive information only from other neurons, and because the information they encode must be decoded by other neurons, if it is to affect behavior. However, population coding theory has often ignored network structure, or assumed discrete, fully connected populations (in contrast with the sparsely connected, continuous sheet of the cortex). In this study, we modeled a sheet of cortical neurons with sparse, primarily local connections, and found that a network with this structure could encode multiple internal state variables with high signal-to-noise ratio. However, we were unable to create high-fidelity networks by instantiating connections at random according to spatial connection probabilities. In our models, high-fidelity networks required additional structure, with higher cluster factors and correlations between the inputs to nearby neurons.

14 CFR 1215.108 - Defining user service requirements.

Code of Federal Regulations, 2010 CFR

2010-01-01

... to NASA Headquarters, Code OX, Space Network Division, Washington, DC 20546. Upon review and... submitted in writing to both NASA Headquarters, Code OX, Space Network Division, and GSFC, Code 501.... Request for services within priority groups shall be negotiated with non-NASA users on a first come, first...

Genetic information transfer promotes cooperation in bacteria

PubMed Central

Dimitriu, Tatiana; Lotton, Chantal; Bénard-Capelle, Julien; Misevic, Dusan; Brown, Sam P.; Lindner, Ariel B.; Taddei, François

2014-01-01

Many bacterial species are social, producing costly secreted “public good” molecules that enhance the growth of neighboring cells. The genes coding for these cooperative traits are often propagated via mobile genetic elements and can be virulence factors from a biomedical perspective. Here, we present an experimental framework that links genetic information exchange and the selection of cooperative traits. Using simulations and experiments based on a synthetic bacterial system to control public good secretion and plasmid conjugation, we demonstrate that horizontal gene transfer can favor cooperation. In a well-mixed environment, horizontal transfer brings a direct infectious advantage to any gene, regardless of its cooperation properties. However, in a structured population transfer selects specifically for cooperation by increasing the assortment among cooperative alleles. Conjugation allows cooperative alleles to overcome rarity thresholds and invade bacterial populations structured purely by stochastic dilution effects. Our results provide an explanation for the prevalence of cooperative genes on mobile elements, and suggest a previously unidentified benefit of horizontal gene transfer for bacteria. PMID:25024219

Knowledge extraction from evolving spiking neural networks with rank order population coding.

PubMed

Soltic, Snjezana; Kasabov, Nikola

2010-12-01

This paper demonstrates how knowledge can be extracted from evolving spiking neural networks with rank order population coding. Knowledge discovery is a very important feature of intelligent systems. Yet, a disproportionally small amount of research is centered on the issue of knowledge extraction from spiking neural networks which are considered to be the third generation of artificial neural networks. The lack of knowledge representation compatibility is becoming a major detriment to end users of these networks. We show that a high-level knowledge can be obtained from evolving spiking neural networks. More specifically, we propose a method for fuzzy rule extraction from an evolving spiking network with rank order population coding. The proposed method was used for knowledge discovery on two benchmark taste recognition problems where the knowledge learnt by an evolving spiking neural network was extracted in the form of zero-order Takagi-Sugeno fuzzy IF-THEN rules.

Mining Learning Social Networks for Cooperative Learning with Appropriate Learning Partners in a Problem-Based Learning Environment

ERIC Educational Resources Information Center

Chen, Chih-Ming; Chang, Chia-Cheng

2014-01-01

Many studies have identified web-based cooperative learning as an increasingly popular educational paradigm with potential to increase learner satisfaction and interactions. However, peer-to-peer interaction often suffers barriers owing to a failure to explore useful social interaction information in web-based cooperative learning environments.…

Cooperative processing data bases

NASA Technical Reports Server (NTRS)

Hasta, Juzar

1991-01-01

Cooperative processing for the 1990's using client-server technology is addressed. The main theme is concepts of downsizing from mainframes and minicomputers to workstations on a local area network (LAN). This document is presented in view graph form.

An adaptive distributed data aggregation based on RCPC for wireless sensor networks

NASA Astrophysics Data System (ADS)

Hua, Guogang; Chen, Chang Wen

2006-05-01

One of the most important design issues in wireless sensor networks is energy efficiency. Data aggregation has significant impact on the energy efficiency of the wireless sensor networks. With massive deployment of sensor nodes and limited energy supply, data aggregation has been considered as an essential paradigm for data collection in sensor networks. Recently, distributed source coding has been demonstrated to possess several advantages in data aggregation for wireless sensor networks. Distributed source coding is able to encode sensor data with lower bit rate without direct communication among sensor nodes. To ensure reliable and high throughput transmission with the aggregated data, we proposed in this research a progressive transmission and decoding of Rate-Compatible Punctured Convolutional (RCPC) coded data aggregation with distributed source coding. Our proposed 1/2 RSC codes with Viterbi algorithm for distributed source coding are able to guarantee that, even without any correlation between the data, the decoder can always decode the data correctly without wasting energy. The proposed approach achieves two aspects in adaptive data aggregation for wireless sensor networks. First, the RCPC coding facilitates adaptive compression corresponding to the correlation of the sensor data. When the data correlation is high, higher compression ration can be achieved. Otherwise, lower compression ratio will be achieved. Second, the data aggregation is adaptively accumulated. There is no waste of energy in the transmission; even there is no correlation among the data, the energy consumed is at the same level as raw data collection. Experimental results have shown that the proposed distributed data aggregation based on RCPC is able to achieve high throughput and low energy consumption data collection for wireless sensor networks

The co-evolution of networks and prisoner’s dilemma game by considering sensitivity and visibility

NASA Astrophysics Data System (ADS)

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H. Eugene

2017-03-01

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual’s connection, we explore how sensitivity and visibility affect the prisoner’s dilemma game. The so-called ‘sensitivity’ and ‘visibility’ respectively present one’s self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes.

The co-evolution of networks and prisoner's dilemma game by considering sensitivity and visibility.

PubMed

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H Eugene

2017-03-24

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual's connection, we explore how sensitivity and visibility affect the prisoner's dilemma game. The so-called 'sensitivity' and 'visibility' respectively present one's self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes.

The co-evolution of networks and prisoner’s dilemma game by considering sensitivity and visibility

PubMed Central

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H. Eugene

2017-01-01

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual’s connection, we explore how sensitivity and visibility affect the prisoner’s dilemma game. The so-called ‘sensitivity’ and ‘visibility’ respectively present one’s self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes. PMID:28338070

Dilemma solving by the coevolution of networks and strategy in a 2 x 2 game.

PubMed

Tanimoto, Jun

2007-08-01

A 2 x 2 game model implemented by a coevolution mechanism of both networks and strategy, inspired by the work of Zimmermann and Eguiluz [Phys. Rev. E72, 056118 (2005)] is established. Network adaptation is the manner in which an existing link between two agents is destroyed and how a new one is established to replace it. The strategy is defined as whether an agent offers cooperation (C) or defection (D) . Both the networks and strategy are synchronously renovated in a simulation time step. A series of numerical experiments, considering various 2 x 2 game structures, reveals that the proposed coevolution mechanism can solve dilemmas in several game classes. The effect of solving a dilemma means mutual-cooperation reciprocity (R reciprocity), which is brought about by emerging several cooperative hub agents who have plenty of links. This effect can be primarily observed in game classes of the prisoner's dilemma and stag hunt. The coevolution mechanism, however, seems counterproductive for game classes of leader and hero, where the alternating reciprocity (ST reciprocity) is meaningful.

SWARMs Ontology: A Common Information Model for the Cooperation of Underwater Robots.

PubMed

Li, Xin; Bilbao, Sonia; Martín-Wanton, Tamara; Bastos, Joaquim; Rodriguez, Jonathan

2017-03-11

In order to facilitate cooperation between underwater robots, it is a must for robots to exchange information with unambiguous meaning. However, heterogeneity, existing in information pertaining to different robots, is a major obstruction. Therefore, this paper presents a networked ontology, named the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) ontology, to address information heterogeneity and enable robots to have the same understanding of exchanged information. The SWARMs ontology uses a core ontology to interrelate a set of domain-specific ontologies, including the mission and planning, the robotic vehicle, the communication and networking, and the environment recognition and sensing ontology. In addition, the SWARMs ontology utilizes ontology constructs defined in the PR-OWL ontology to annotate context uncertainty based on the Multi-Entity Bayesian Network (MEBN) theory. Thus, the SWARMs ontology can provide both a formal specification for information that is necessarily exchanged between robots and a command and control entity, and also support for uncertainty reasoning. A scenario on chemical pollution monitoring is described and used to showcase how the SWARMs ontology can be instantiated, be extended, represent context uncertainty, and support uncertainty reasoning.

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

PubMed Central

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

1995-01-01

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

Internal Acoustic Transceivers Reveal the Annual Social Network Patterns in a Coastal Top Predator

NASA Astrophysics Data System (ADS)

Haulsee, D.; Fox, D. A.; Breece, M.; Wetherbee, B.; Brown, L.; Kneebone, J.; Skomal, G.; Oliver, M. J.

2016-02-01

Sand Tigers (Carcharias taurus) are large apex predators resident in the coastal ocean along the Eastern US Coast. Although Delaware Bay and surrounding coastal waters are known summer "hot spots" for Sand Tigers, our understanding of their seasonal movements is less well known. Since 2007, we have implanted more than 300 VEMCO acoustic transmitters in Sand Tigers, which have been detected from Cape Canaveral, Florida to Long Island, New York by collaborators in the Atlantic Cooperative Telemetry (ACT) Network. During the summer of 2012, 20 Sand Tigers were implanted with VEMCO Mobile Transceivers (VMTs), which are capable of both transmitting and receiving coded acoustic pings. To date, two of the 20 sharks have been recaptured, and their VMTs recovered. VMTs recorded detections of 350 individuals, from 8 different species. We analyzed their intra- and interspecific social network, which allowed us to reconstruct the approximate locations of Sand Tigers throughout the year. Changes in the interspecific population dynamics throughout the year revealed evidence of fission-fusion social behavior, which is common in mammals, but rarely documented in non-mammalian species. This project is a unique look at the social network of an apex predator and is a useful model for studies quantifying the social structures of marine animals. In addition, understanding how the aggregations of this species changes (in terms of sex and size class segregation) on spatiotemporal scales is critical for effective protection of the species and will be useful as managers develop conservation plans along the East Coast.

The Challenges and Opportunities for International Cooperative Radio Science; Experience with Mars Express and Venus Express Missions

NASA Technical Reports Server (NTRS)

Holmes, Dwight P.; Thompson, Tommy; Simpson, Richard; Tyler, G. Leonard; Dehant, Veronique; Rosenblatt, Pascal; Hausler, Bernd; Patzold, Martin; Goltz, Gene; Kahan, Daniel;

77 FR 38833 - Job Accommodation Network

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-29

... DEPARTMENT OF LABOR Job Accommodation Network AGENCY: Office of Disability Employment Policy, Department of Labor. Announcement Type: New Notice of Availability of Funds and Solicitation for Grant... cooperative agreement to manage and operate its Job Accommodation Network (JAN), a national technical...

Building a Unified Information Network.

ERIC Educational Resources Information Center

Avram, Henriette D.

1988-01-01

Discusses cooperative efforts between research organizations and libraries to create a national information network. Topics discussed include the Linked System Project (LSP); technical processing versus reference and research functions; Open Systems Interconnection (OSI) Reference Model; the National Science Foundation Network (NSFNET); and…

Conflicting social motives in negotiating groups.

PubMed

Weingart, Laurie R; Brett, Jeanne M; Olekalns, Mara; Smith, Philip L

2007-12-01

Negotiators' social motives (cooperative vs. individualistic) influence their strategic behaviors. In this study, the authors used multilevel modeling and analyses of strategy sequences to test hypotheses regarding how negotiators' social motives and the composition of the group influence group members' negotiation strategies. Four-person groups negotiating a 5-issue mixed-motive decision-making task were videotaped, and the tapes were transcribed and coded. Group composition included 2 homogeneous conditions (all cooperators and all individualists) and 3 heterogeneous conditions (3 cooperators and 1 individualist, 2 cooperators and 2 individualists, 1 cooperator and 3 individualists). Results showed that cooperative negotiators adjusted their use of integrative and distributive strategies in response to the social-motive composition of the group, but individualistic negotiators did not. Results from analyses of strategy sequences showed that cooperators responded more systematically to others' behaviors than did individualists. They also redirected the negotiation depending on group composition. (c) 2007 APA, all rights reserved.

Large-Scale Cooperative Task Distribution on Peer-to-Peer Networks

DTIC Science & Technology

2012-01-01

SUBTITLE Large-scale cooperative task distribution on peer-to-peer networks 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6...of agents, and each agent attempts to form a coalition with its most profitable partner. The second algorithm builds upon the Shapley for- mula [37...ters at the second layer. These Category Layer clusters each represent a single resource, and agents join one or more clusters based on their

Synaptic Plasticity in Visual Cortex: Comparison of Theory with Experiment

DTIC Science & Technology

1990-01-01

Hubel DH, Wiesel TN (1961) Integrative action in the cat’s lateral geniculate body . J. Physiol. 155:385-398. Hubel DH, Wiesel TN (1962) Receptive...fibers from the lateral geniculate nucleus (LGN) onto a single cortical neuron. Scofield and Cooper (1985) extended this to a network of interconnected...connected network was later 1 simplified by Cooper and Scofield (1988) with the introduction of a mean-field theory, which in effect replaces all of the

Distributed Learning, Recognition, and Prediction by ART and ARTMAP Neural Networks.

PubMed

Carpenter, Gail A.

1997-11-01

A class of adaptive resonance theory (ART) models for learning, recognition, and prediction with arbitrarily distributed code representations is introduced. Distributed ART neural networks combine the stable fast learning capabilities of winner-take-all ART systems with the noise tolerance and code compression capabilities of multilayer perceptrons. With a winner-take-all code, the unsupervised model dART reduces to fuzzy ART and the supervised model dARTMAP reduces to fuzzy ARTMAP. With a distributed code, these networks automatically apportion learned changes according to the degree of activation of each coding node, which permits fast as well as slow learning without catastrophic forgetting. Distributed ART models replace the traditional neural network path weight with a dynamic weight equal to the rectified difference between coding node activation and an adaptive threshold. Thresholds increase monotonically during learning according to a principle of atrophy due to disuse. However, monotonic change at the synaptic level manifests itself as bidirectional change at the dynamic level, where the result of adaptation resembles long-term potentiation (LTP) for single-pulse or low frequency test inputs but can resemble long-term depression (LTD) for higher frequency test inputs. This paradoxical behavior is traced to dual computational properties of phasic and tonic coding signal components. A parallel distributed match-reset-search process also helps stabilize memory. Without the match-reset-search system, dART becomes a type of distributed competitive learning network.

Cooperative synchronized assemblies enhance orientation discrimination.

PubMed

Samonds, Jason M; Allison, John D; Brown, Heather A; Bonds, A B

2004-04-27

There is no clear link between the broad tuning of single neurons and the fine behavioral capabilities of orientation discrimination. We recorded from populations of cells in the cat visual cortex (area 17) to examine whether the joint activity of cells can support finer discrimination than found in individual responses. Analysis of joint firing yields a substantial advantage (i.e., cooperation) in fine-angle discrimination. This cooperation increases to more considerable levels as the population of an assembly is increased. The cooperation in a population of six cells provides encoding of orientation with an information advantage that is at least 2-fold in terms of requiring either fewer cells or less time than independent coding. This cooperation suggests that correlated or synchronized activity can increase information.

Guiding District Implementation of Common Core State Standards: Innovation Configuration Maps

ERIC Educational Resources Information Center

Roy, Patricia; Killion, Joellen

2011-01-01

Leadership Networks are regional and content-specific networks focused on the preparation of college- and career-ready students. Each network includes teacher leaders, school administrators, central office staff, regional cooperatives, and institutes of higher education. Network members work collaboratively to focus their efforts on regional needs…

Thermodynamic properties distinguish human mitochondrial aspartyl-tRNA synthetase from bacterial homolog with same 3D architecture.

PubMed

Neuenfeldt, Anne; Lorber, Bernard; Ennifar, Eric; Gaudry, Agnès; Sauter, Claude; Sissler, Marie; Florentz, Catherine

2013-02-01

In the mammalian mitochondrial translation apparatus, the proteins and their partner RNAs are coded by two genomes. The proteins are nuclear-encoded and resemble their homologs, whereas the RNAs coming from the rapidly evolving mitochondrial genome have lost critical structural information. This raises the question of molecular adaptation of these proteins to their peculiar partner RNAs. The crystal structure of the homodimeric bacterial-type human mitochondrial aspartyl-tRNA synthetase (DRS) confirmed a 3D architecture close to that of Escherichia coli DRS. However, the mitochondrial enzyme distinguishes by an enlarged catalytic groove, a more electropositive surface potential and an alternate interaction network at the subunits interface. It also presented a thermal stability reduced by as much as 12°C. Isothermal titration calorimetry analyses revealed that the affinity of the mitochondrial enzyme for cognate and non-cognate tRNAs is one order of magnitude higher, but with different enthalpy and entropy contributions. They further indicated that both enzymes bind an adenylate analog by a cooperative allosteric mechanism with different thermodynamic contributions. The larger flexibility of the mitochondrial synthetase with respect to the bacterial enzyme, in combination with a preserved architecture, may represent an evolutionary process, allowing nuclear-encoded proteins to cooperate with degenerated organelle RNAs.

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

ERIC Educational Resources Information Center

Yu, Chao

2013-01-01

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

Spontaneous Symmetry Breaking in Interdependent Networked Game

PubMed Central

Jin, Qing; Wang, Lin; Xia, Cheng-Yi; Wang, Zhen

2014-01-01

Spatial evolution game has traditionally assumed that players interact with direct neighbors on a single network, which is isolated and not influenced by other systems. However, this is not fully consistent with recent research identification that interactions between networks play a crucial rule for the outcome of evolutionary games taking place on them. In this work, we introduce the simple game model into the interdependent networks composed of two networks. By means of imitation dynamics, we display that when the interdependent factor α is smaller than a threshold value αC, the symmetry of cooperation can be guaranteed. Interestingly, as interdependent factor exceeds αC, spontaneous symmetry breaking of fraction of cooperators presents itself between different networks. With respect to the breakage of symmetry, it is induced by asynchronous expansion between heterogeneous strategy couples of both networks, which further enriches the content of spatial reciprocity. Moreover, our results can be well predicted by the strategy-couple pair approximation method. PMID:24526076

Georgia's Stream-Water-Quality Monitoring Network, 2006

USGS Publications Warehouse

Nobles, Patricia L.; ,

2006-01-01

The USGS stream-water-quality monitoring network for Georgia is an aggregation of smaller networks and individual monitoring stations that have been established in cooperation with Federal, State, and local agencies. These networks collectively provide data from 130 sites, 62 of which are monitored continuously in real time using specialized equipment that transmits these data via satellite to a centralized location for processing and storage. These data are made available on the Web in near real time at http://waterdata.usgs.gov/ga/nwis/ Ninety-eight stations are sampled periodically for a more extensive suite of chemical and biological constituents that require laboratory analysis. Both the continuous and the periodic water-quality data are archived and maintained in the USGS National Water Information System and are available to cooperators, water-resource managers, and the public. The map at right shows the USGS stream-water-quality monitoring network for Georgia and major watersheds. The network represents an aggregation of smaller networks and individual monitoring stations that collectively provide data from 130 sites.

Library Automation.

ERIC Educational Resources Information Center

Husby, Ole

1990-01-01

The challenges and potential benefits of automating university libraries are reviewed, with special attention given to cooperative systems. Aspects discussed include database size, the role of the university computer center, storage modes, multi-institutional systems, resource sharing, cooperative system management, networking, and intelligent…

Evolutionary prisoner's dilemma on Newman-Watts social networks with an asymmetric payoff distribution mechanism

NASA Astrophysics Data System (ADS)

Du, Wen-Bo; Cao, Xian-Bin; Yang, Han-Xin; Hu, Mao-Bin

2010-01-01

In this paper, we introduce an asymmetric payoff distribution mechanism into the evolutionary prisoner's dilemma game (PDG) on Newman-Watts social networks, and study its effects on the evolution of cooperation. The asymmetric payoff distribution mechanism can be adjusted by the parameter α: if α > 0, the rich will exploit the poor to get richer; if α < 0, the rich are forced to offer part of their income to the poor. Numerical results show that the cooperator frequency monotonously increases with α and is remarkably promoted when α > 0. The effects of updating order and self-interaction are also investigated. The co-action of random updating and self-interaction can induce the highest cooperation level. Moreover, we employ the Gini coefficient to investigate the effect of asymmetric payoff distribution on the the system's wealth distribution. This work may be helpful for understanding cooperative behaviour and wealth inequality in society.

Auction-based Security Game for Multiuser Cooperative Networks

NASA Astrophysics Data System (ADS)

Wang, An; Cai, Yueming; Yang, Wendong; Cheng, Yunpeng

2013-04-01

In this paper, we develop an auction-based algorithm to allocate the relay power efficiently to improve the system secrecy rate in a cooperative network, where several source-destination pairs and one cooperative relay are involved. On the one hand, the cooperative relay assists these pairs to transmit under a peak power constraint. On the other hand, the relay is untrusty and is also a passive eavesdropper. The whole auction process is completely distributed and no instantaneous channel state information exchange is needed. We also prove the existence and uniqueness of the Nash Equilibrium (NE) for the proposed power auction game. Moreover, the Pareto optimality is also validated. Simulation results show that our proposed auction-based algorithm can effectively improve the system secrecy rate. Besides, the proposed auction-based algorithm can converge to the unique NE point within a finite number of iterations. More interestingly, we also find that the proposed power auction mechanism is cheat-proof.

The solvability of quantum k-pair network in a measurement-based way.

PubMed

Li, Jing; Xu, Gang; Chen, Xiu-Bo; Qu, Zhiguo; Niu, Xin-Xin; Yang, Yi-Xian

2017-12-01

Network coding is an effective means to enhance the communication efficiency. The characterization of network solvability is one of the most important topic in this field. However, for general network, the solvability conditions are still a challenge. In this paper, we consider the solvability of general quantum k-pair network in measurement-based framework. For the first time, a detailed account of measurement-based quantum network coding(MB-QNC) is specified systematically. Differing from existing coding schemes, single qubit measurements on a pre-shared graph state are the only allowed coding operations. Since no control operations are concluded, it makes MB-QNC schemes more feasible. Further, the sufficient conditions formulating by eigenvalue equations and stabilizer matrix are presented, which build an unambiguous relation among the solvability and the general network. And this result can also analyze the feasibility of sharing k EPR pairs task in large-scale networks. Finally, in the presence of noise, we analyze the advantage of MB-QNC in contrast to gate-based way. By an instance network [Formula: see text], we show that MB-QNC allows higher error thresholds. Specially, for X error, the error threshold is about 30% higher than 10% in gate-based way. In addition, the specific expressions of fidelity subject to some constraint conditions are given.

Importance of tie strengths in the prisoner's dilemma game on social networks

NASA Astrophysics Data System (ADS)

Xu, Bo; Liu, Lu; You, Weijia

2011-06-01

Though numerous researches have shown that tie strengths play a key role in the formation of collective behavior in social networks, little work has been done to explore their impact on the outcome of evolutionary games. In this Letter, we studied the effect of tie strength in the dynamics of evolutionary prisoner's dilemma games by using online social network datasets. The results show that the fraction of cooperators has a non-trivial dependence on tie strength. Weak ties, just like previous researches on epidemics and information diffusion have shown, play a key role by the maintenance of cooperators in evolutionary prisoner's dilemma games.

Oscillation, Conduction Delays, and Learning Cooperate to Establish Neural Competition in Recurrent Networks

PubMed Central

Kato, Hideyuki; Ikeguchi, Tohru

2016-01-01

Specific memory might be stored in a subnetwork consisting of a small population of neurons. To select neurons involved in memory formation, neural competition might be essential. In this paper, we show that excitable neurons are competitive and organize into two assemblies in a recurrent network with spike timing-dependent synaptic plasticity (STDP) and axonal conduction delays. Neural competition is established by the cooperation of spontaneously induced neural oscillation, axonal conduction delays, and STDP. We also suggest that the competition mechanism in this paper is one of the basic functions required to organize memory-storing subnetworks into fine-scale cortical networks. PMID:26840529

Economic indicators selection for crime rates forecasting using cooperative feature selection

NASA Astrophysics Data System (ADS)

Alwee, Razana; Shamsuddin, Siti Mariyam Hj; Salleh Sallehuddin, Roselina

2013-04-01

Features selection in multivariate forecasting model is very important to ensure that the model is accurate. The purpose of this study is to apply the Cooperative Feature Selection method for features selection. The features are economic indicators that will be used in crime rate forecasting model. The Cooperative Feature Selection combines grey relational analysis and artificial neural network to establish a cooperative model that can rank and select the significant economic indicators. Grey relational analysis is used to select the best data series to represent each economic indicator and is also used to rank the economic indicators according to its importance to the crime rate. After that, the artificial neural network is used to select the significant economic indicators for forecasting the crime rates. In this study, we used economic indicators of unemployment rate, consumer price index, gross domestic product and consumer sentiment index, as well as data rates of property crime and violent crime for the United States. Levenberg-Marquardt neural network is used in this study. From our experiments, we found that consumer price index is an important economic indicator that has a significant influence on the violent crime rate. While for property crime rate, the gross domestic product, unemployment rate and consumer price index are the influential economic indicators. The Cooperative Feature Selection is also found to produce smaller errors as compared to Multiple Linear Regression in forecasting property and violent crime rates.

Interactive diversity promotes the evolution of cooperation in structured populations

NASA Astrophysics Data System (ADS)

Su, Qi; Li, Aming; Zhou, Lei; Wang, Long

2016-10-01

Evolutionary games on networks traditionally assume that each individual adopts an identical strategy to interact with all its neighbors in each generation. Considering the prevalent diversity of individual interactions in the real society, here we propose the concept of interactive diversity, which allows individuals to adopt different strategies against different neighbors in each generation. We investigate the evolution of cooperation based on the edge dynamics rather than the traditional nodal dynamics in networked systems. The results show that, without invoking any other mechanisms, interactive diversity drives the frequency of cooperation to a high level for a wide range of parameters in both well-mixed and structured populations. Even in highly connected populations, cooperation still thrives. When interactive diversity and large topological heterogeneity are combined together, however, in the relaxed social dilemma, cooperation level is lower than that with just one of them, implying that the combination of many promotive factors may make a worse outcome. By an analytical approximation, we get the condition under which interactive diversity provides more advantages for cooperation than traditional evolutionary dynamics does. Numerical simulations validating the approximation are also presented. Our work provides a new line to explore the latent relation between the ubiquitous cooperation and individuals’ distinct responses in different interactions. The presented results suggest that interactive diversity should receive more attention in pursuing mechanisms fostering cooperation.