Pattern-Oriented Modeling of Agent-Based Complex Systems: Lessons from Ecology

NASA Astrophysics Data System (ADS)

Grimm, Volker; Revilla, Eloy; Berger, Uta; Jeltsch, Florian; Mooij, Wolf M.; Railsback, Steven F.; Thulke, Hans-Hermann; Weiner, Jacob; Wiegand, Thorsten; DeAngelis, Donald L.

2005-11-01

Agent-based complex systems are dynamic networks of many interacting agents; examples include ecosystems, financial markets, and cities. The search for general principles underlying the internal organization of such systems often uses bottom-up simulation models such as cellular automata and agent-based models. No general framework for designing, testing, and analyzing bottom-up models has yet been established, but recent advances in ecological modeling have come together in a general strategy we call pattern-oriented modeling. This strategy provides a unifying framework for decoding the internal organization of agent-based complex systems and may lead toward unifying algorithmic theories of the relation between adaptive behavior and system complexity.

Multi-stage complex contagions.

PubMed

Melnik, Sergey; Ward, Jonathan A; Gleeson, James P; Porter, Mason A

2013-03-01

The spread of ideas across a social network can be studied using complex contagion models, in which agents are activated by contact with multiple activated neighbors. The investigation of complex contagions can provide crucial insights into social influence and behavior-adoption cascades on networks. In this paper, we introduce a model of a multi-stage complex contagion on networks. Agents at different stages-which could, for example, represent differing levels of support for a social movement or differing levels of commitment to a certain product or idea-exert different amounts of influence on their neighbors. We demonstrate that the presence of even one additional stage introduces novel dynamical behavior, including interplay between multiple cascades, which cannot occur in single-stage contagion models. We find that cascades-and hence collective action-can be driven not only by high-stage influencers but also by low-stage influencers.

Multi-stage complex contagions

NASA Astrophysics Data System (ADS)

Melnik, Sergey; Ward, Jonathan A.; Gleeson, James P.; Porter, Mason A.

2013-03-01

The spread of ideas across a social network can be studied using complex contagion models, in which agents are activated by contact with multiple activated neighbors. The investigation of complex contagions can provide crucial insights into social influence and behavior-adoption cascades on networks. In this paper, we introduce a model of a multi-stage complex contagion on networks. Agents at different stages—which could, for example, represent differing levels of support for a social movement or differing levels of commitment to a certain product or idea—exert different amounts of influence on their neighbors. We demonstrate that the presence of even one additional stage introduces novel dynamical behavior, including interplay between multiple cascades, which cannot occur in single-stage contagion models. We find that cascades—and hence collective action—can be driven not only by high-stage influencers but also by low-stage influencers.

Properties of interaction networks underlying the minority game.

PubMed

Caridi, Inés

2014-11-01

The minority game is a well-known agent-based model with no explicit interaction among its agents. However, it is known that they interact through the global magnitudes of the model and through their strategies. In this work we have attempted to formalize the implicit interactions among minority game agents as if they were links on a complex network. We have defined the link between two agents by quantifying the similarity between them. This link definition is based on the information of the instance of the game (the set of strategies assigned to each agent at the beginning) without any dynamic information on the game and brings about a static, unweighed and undirected network. We have analyzed the structure of the resulting network for different parameters, such as the number of agents (N) and the agent's capacity to process information (m), always taking into account games with two strategies per agent. In the region of crowd effects of the model, the resulting networks structure is a small-world network, whereas in the region where the behavior of the minority game is the same as in a game of random decisions, networks become a random network of Erdos-Renyi. The transition between these two types of networks is slow, without any peculiar feature of the network in the region of the coordination among agents. Finally, we have studied the resulting static networks for the full strategy minority game model, a maximal instance of the minority game in which all possible agents take part in the game. We have explicitly calculated the degree distribution of the full strategy minority game network and, on the basis of this analytical result, we have estimated the degree distribution of the minority game network, which is in accordance with computational results.

Automation of multi-agent control for complex dynamic systems in heterogeneous computational network

NASA Astrophysics Data System (ADS)

Oparin, Gennady; Feoktistov, Alexander; Bogdanova, Vera; Sidorov, Ivan

2017-01-01

The rapid progress of high-performance computing entails new challenges related to solving large scientific problems for various subject domains in a heterogeneous distributed computing environment (e.g., a network, Grid system, or Cloud infrastructure). The specialists in the field of parallel and distributed computing give the special attention to a scalability of applications for problem solving. An effective management of the scalable application in the heterogeneous distributed computing environment is still a non-trivial issue. Control systems that operate in networks, especially relate to this issue. We propose a new approach to the multi-agent management for the scalable applications in the heterogeneous computational network. The fundamentals of our approach are the integrated use of conceptual programming, simulation modeling, network monitoring, multi-agent management, and service-oriented programming. We developed a special framework for an automation of the problem solving. Advantages of the proposed approach are demonstrated on the parametric synthesis example of the static linear regulator for complex dynamic systems. Benefits of the scalable application for solving this problem include automation of the multi-agent control for the systems in a parallel mode with various degrees of its detailed elaboration.

Distributed containment control of heterogeneous fractional-order multi-agent systems with communication delays

NASA Astrophysics Data System (ADS)

Yang, Hongyong; Han, Fujun; Zhao, Mei; Zhang, Shuning; Yue, Jun

2017-08-01

Because many networked systems can only be characterized with fractional-order dynamics in complex environments, fractional-order calculus has been studied deeply recently. When diverse individual features are shown in different agents of networked systems, heterogeneous fractional-order dynamics will be used to describe the complex systems. Based on the distinguishing properties of agents, heterogeneous fractional-order multi-agent systems (FOMAS) are presented. With the supposition of multiple leader agents in FOMAS, distributed containment control of FOMAS is studied in directed weighted topologies. By applying Laplace transformation and frequency domain theory of the fractional-order operator, an upper bound of delays is obtained to ensure containment consensus of delayed heterogenous FOMAS. Consensus results of delayed FOMAS in this paper can be extended to systems with integer-order models. Finally, numerical examples are used to verify our results.

A multi-agent intelligent environment for medical knowledge.

PubMed

Vicari, Rosa M; Flores, Cecilia D; Silvestre, André M; Seixas, Louise J; Ladeira, Marcelo; Coelho, Helder

2003-03-01

AMPLIA is a multi-agent intelligent learning environment designed to support training of diagnostic reasoning and modelling of domains with complex and uncertain knowledge. AMPLIA focuses on the medical area. It is a system that deals with uncertainty under the Bayesian network approach, where learner-modelling tasks will consist of creating a Bayesian network for a problem the system will present. The construction of a network involves qualitative and quantitative aspects. The qualitative part concerns the network topology, that is, causal relations among the domain variables. After it is ready, the quantitative part is specified. It is composed of the distribution of conditional probability of the variables represented. A negotiation process (managed by an intelligent MediatorAgent) will treat the differences of topology and probability distribution between the model the learner built and the one built-in in the system. That negotiation process occurs between the agents that represent the expert knowledge domain (DomainAgent) and the agent that represents the learner knowledge (LearnerAgent).

Directed clustering coefficient as a measure of systemic risk in complex banking networks

NASA Astrophysics Data System (ADS)

Tabak, Benjamin M.; Takami, Marcelo; Rocha, Jadson M. C.; Cajueiro, Daniel O.; Souza, Sergio R. S.

2014-01-01

Recent literature has focused on the study of systemic risk in complex networks. It is clear now, after the crisis of 2008, that the aggregate behavior of the interaction among agents is not straightforward and it is very difficult to predict. Contributing to this debate, this paper shows that the directed clustering coefficient may be used as a measure of systemic risk in complex networks. Furthermore, using data from the Brazilian interbank network, we show that the directed clustering coefficient is negatively correlated with domestic interest rates.

Multi-agent based control of large-scale complex systems employing distributed dynamic inference engine

NASA Astrophysics Data System (ADS)

Zhang, Daili

Increasing societal demand for automation has led to considerable efforts to control large-scale complex systems, especially in the area of autonomous intelligent control methods. The control system of a large-scale complex system needs to satisfy four system level requirements: robustness, flexibility, reusability, and scalability. Corresponding to the four system level requirements, there arise four major challenges. First, it is difficult to get accurate and complete information. Second, the system may be physically highly distributed. Third, the system evolves very quickly. Fourth, emergent global behaviors of the system can be caused by small disturbances at the component level. The Multi-Agent Based Control (MABC) method as an implementation of distributed intelligent control has been the focus of research since the 1970s, in an effort to solve the above-mentioned problems in controlling large-scale complex systems. However, to the author's best knowledge, all MABC systems for large-scale complex systems with significant uncertainties are problem-specific and thus difficult to extend to other domains or larger systems. This situation is partly due to the control architecture of multiple agents being determined by agent to agent coupling and interaction mechanisms. Therefore, the research objective of this dissertation is to develop a comprehensive, generalized framework for the control system design of general large-scale complex systems with significant uncertainties, with the focus on distributed control architecture design and distributed inference engine design. A Hybrid Multi-Agent Based Control (HyMABC) architecture is proposed by combining hierarchical control architecture and module control architecture with logical replication rings. First, it decomposes a complex system hierarchically; second, it combines the components in the same level as a module, and then designs common interfaces for all of the components in the same module; third, replications are made for critical agents and are organized into logical rings. This architecture maintains clear guidelines for complexity decomposition and also increases the robustness of the whole system. Multiple Sectioned Dynamic Bayesian Networks (MSDBNs) as a distributed dynamic probabilistic inference engine, can be embedded into the control architecture to handle uncertainties of general large-scale complex systems. MSDBNs decomposes a large knowledge-based system into many agents. Each agent holds its partial perspective of a large problem domain by representing its knowledge as a Dynamic Bayesian Network (DBN). Each agent accesses local evidence from its corresponding local sensors and communicates with other agents through finite message passing. If the distributed agents can be organized into a tree structure, satisfying the running intersection property and d-sep set requirements, globally consistent inferences are achievable in a distributed way. By using different frequencies for local DBN agent belief updating and global system belief updating, it balances the communication cost with the global consistency of inferences. In this dissertation, a fully factorized Boyen-Koller (BK) approximation algorithm is used for local DBN agent belief updating, and the static Junction Forest Linkage Tree (JFLT) algorithm is used for global system belief updating. MSDBNs assume a static structure and a stable communication network for the whole system. However, for a real system, sub-Bayesian networks as nodes could be lost, and the communication network could be shut down due to partial damage in the system. Therefore, on-line and automatic MSDBNs structure formation is necessary for making robust state estimations and increasing survivability of the whole system. A Distributed Spanning Tree Optimization (DSTO) algorithm, a Distributed D-Sep Set Satisfaction (DDSSS) algorithm, and a Distributed Running Intersection Satisfaction (DRIS) algorithm are proposed in this dissertation. Combining these three distributed algorithms and a Distributed Belief Propagation (DBP) algorithm in MSDBNs makes state estimations robust to partial damage in the whole system. Combining the distributed control architecture design and the distributed inference engine design leads to a process of control system design for a general large-scale complex system. As applications of the proposed methodology, the control system design of a simplified ship chilled water system and a notional ship chilled water system have been demonstrated step by step. Simulation results not only show that the proposed methodology gives a clear guideline for control system design for general large-scale complex systems with dynamic and uncertain environment, but also indicate that the combination of MSDBNs and HyMABC can provide excellent performance for controlling general large-scale complex systems.

A Statistical Test of Walrasian Equilibrium by Means of Complex Networks Theory

NASA Astrophysics Data System (ADS)

Bargigli, Leonardo; Viaggiu, Stefano; Lionetto, Andrea

2016-10-01

We represent an exchange economy in terms of statistical ensembles for complex networks by introducing the concept of market configuration. This is defined as a sequence of nonnegative discrete random variables {w_{ij}} describing the flow of a given commodity from agent i to agent j. This sequence can be arranged in a nonnegative matrix W which we can regard as the representation of a weighted and directed network or digraph G. Our main result consists in showing that general equilibrium theory imposes highly restrictive conditions upon market configurations, which are in most cases not fulfilled by real markets. An explicit example with reference to the e-MID interbank credit market is provided.

Patterns of cooperation: fairness and coordination in networks of interacting agents

NASA Astrophysics Data System (ADS)

Do, Anne-Ly; Rudolf, Lars; Gross, Thilo

2010-06-01

We study the self-assembly of a complex network of collaborations among self-interested agents. The agents can maintain different levels of cooperation with different partners. Further, they continuously, selectively and independently adapt the amount of resources allocated to each of their collaborations in order to maximize the obtained payoff. We show analytically that the system approaches a state in which the agents make identical investments, and links produce identical benefits. Despite this high degree of social coordination, some agents manage to secure privileged topological positions in the network, enabling them to extract high payoffs. Our analytical investigations provide a rationale for the emergence of unidirectional non-reciprocal collaborations and different responses to the withdrawal of a partner from an interaction that have been reported in the psychological literature.

AST: Activity-Security-Trust driven modeling of time varying networks.

PubMed

Wang, Jian; Xu, Jiake; Liu, Yanheng; Deng, Weiwen

2016-02-18

Network modeling is a flexible mathematical structure that enables to identify statistical regularities and structural principles hidden in complex systems. The majority of recent driving forces in modeling complex networks are originated from activity, in which an activity potential of a time invariant function is introduced to identify agents' interactions and to construct an activity-driven model. However, the new-emerging network evolutions are already deeply coupled with not only the explicit factors (e.g. activity) but also the implicit considerations (e.g. security and trust), so more intrinsic driving forces behind should be integrated into the modeling of time varying networks. The agents undoubtedly seek to build a time-dependent trade-off among activity, security, and trust in generating a new connection to another. Thus, we reasonably propose the Activity-Security-Trust (AST) driven model through synthetically considering the explicit and implicit driving forces (e.g. activity, security, and trust) underlying the decision process. AST-driven model facilitates to more accurately capture highly dynamical network behaviors and figure out the complex evolution process, allowing a profound understanding of the effects of security and trust in driving network evolution, and improving the biases induced by only involving activity representations in analyzing the dynamical processes.

Characteristics of pattern formation and evolution in approximations of Physarum transport networks.

PubMed

Jones, Jeff

2010-01-01

Most studies of pattern formation place particular emphasis on its role in the development of complex multicellular body plans. In simpler organisms, however, pattern formation is intrinsic to growth and behavior. Inspired by one such organism, the true slime mold Physarum polycephalum, we present examples of complex emergent pattern formation and evolution formed by a population of simple particle-like agents. Using simple local behaviors based on chemotaxis, the mobile agent population spontaneously forms complex and dynamic transport networks. By adjusting simple model parameters, maps of characteristic patterning are obtained. Certain areas of the parameter mapping yield particularly complex long term behaviors, including the circular contraction of network lacunae and bifurcation of network paths to maintain network connectivity. We demonstrate the formation of irregular spots and labyrinthine and reticulated patterns by chemoattraction. Other Turing-like patterning schemes were obtained by using chemorepulsion behaviors, including the self-organization of regular periodic arrays of spots, and striped patterns. We show that complex pattern types can be produced without resorting to the hierarchical coupling of reaction-diffusion mechanisms. We also present network behaviors arising from simple pre-patterning cues, giving simple examples of how the emergent pattern formation processes evolve into networks with functional and quasi-physical properties including tensionlike effects, network minimization behavior, and repair to network damage. The results are interpreted in relation to classical theories of biological pattern formation in natural systems, and we suggest mechanisms by which emergent pattern formation processes may be used as a method for spatially represented unconventional computation.

Slow-down or speed-up of inter- and intra-cluster diffusion of controversial knowledge in stubborn communities based on a small world network

NASA Astrophysics Data System (ADS)

Ausloos, Marcel

2015-06-01

Diffusion of knowledge is expected to be huge when agents are open minded. The report concerns a more difficult diffusion case when communities are made of stubborn agents. Communities having markedly different opinions are for example the Neocreationist and Intelligent Design Proponents (IDP), on one hand, and the Darwinian Evolution Defenders (DED), on the other hand. The case of knowledge diffusion within such communities is studied here on a network based on an adjacency matrix built from time ordered selected quotations of agents, whence for inter- and intra-communities. The network is intrinsically directed and not necessarily reciprocal. Thus, the adjacency matrices have complex eigenvalues; the eigenvectors present complex components. A quantification of the slow-down or speed-up effects of information diffusion in such temporal networks, with non-Markovian contact sequences, can be made by comparing the real time dependent (directed) network to its counterpart, the time aggregated (undirected) network, - which has real eigenvalues. In order to do so, small world networks which both contain an odd number of nodes are studied and compared to similar networks with an even number of nodes. It is found that (i) the diffusion of knowledge is more difficult on the largest networks; (ii) the network size influences the slowing-down or speeding-up diffusion process. Interestingly, it is observed that (iii) the diffusion of knowledge is slower in IDP and faster in DED communities. It is suggested that the finding can be "rationalized", if some "scientific quality" and "publication habit" is attributed to the agents, as common sense would guess. This finding offers some opening discussion toward tying scientific knowledge to belief.

Research on mixed network architecture collaborative application model

NASA Astrophysics Data System (ADS)

Jing, Changfeng; Zhao, Xi'an; Liang, Song

2009-10-01

When facing complex requirements of city development, ever-growing spatial data, rapid development of geographical business and increasing business complexity, collaboration between multiple users and departments is needed urgently, however conventional GIS software (such as Client/Server model or Browser/Server model) are not support this well. Collaborative application is one of the good resolutions. Collaborative application has four main problems to resolve: consistency and co-edit conflict, real-time responsiveness, unconstrained operation, spatial data recoverability. In paper, application model called AMCM is put forward based on agent and multi-level cache. AMCM can be used in mixed network structure and supports distributed collaborative. Agent is an autonomous, interactive, initiative and reactive computing entity in a distributed environment. Agent has been used in many fields such as compute science and automation. Agent brings new methods for cooperation and the access for spatial data. Multi-level cache is a part of full data. It reduces the network load and improves the access and handle of spatial data, especially, in editing the spatial data. With agent technology, we make full use of its characteristics of intelligent for managing the cache and cooperative editing that brings a new method for distributed cooperation and improves the efficiency.

Coordinating complex problem-solving among distributed intelligent agents

NASA Technical Reports Server (NTRS)

Adler, Richard M.

1992-01-01

A process-oriented control model is described for distributed problem solving. The model coordinates the transfer and manipulation of information across independent networked applications, both intelligent and conventional. The model was implemented using SOCIAL, a set of object-oriented tools for distributing computing. Complex sequences of distributed tasks are specified in terms of high level scripts. Scripts are executed by SOCIAL objects called Manager Agents, which realize an intelligent coordination model that routes individual tasks to suitable server applications across the network. These tools are illustrated in a prototype distributed system for decision support of ground operations for NASA's Space Shuttle fleet.

A cognitive information processing framework for distributed sensor networks

NASA Astrophysics Data System (ADS)

Wang, Feiyi; Qi, Hairong

2004-09-01

In this paper, we present a cognitive agent framework (CAF) based on swarm intelligence and self-organization principles, and demonstrate it through collaborative processing for target classification in sensor networks. The framework involves integrated designs to provide both cognitive behavior at the organization level to conquer complexity and reactive behavior at the individual agent level to retain simplicity. The design tackles various problems in the current information processing systems, including overly complex systems, maintenance difficulties, increasing vulnerability to attack, lack of capability to tolerate faults, and inability to identify and cope with low-frequency patterns. An important and distinguishing point of the presented work from classical AI research is that the acquired intelligence does not pertain to distinct individuals but to groups. It also deviates from multi-agent systems (MAS) due to sheer quantity of extremely simple agents we are able to accommodate, to the degree that some loss of coordination messages and behavior of faulty/compromised agents will not affect the collective decision made by the group.

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.

Impact of mobility structure on optimization of small-world networks of mobile agents

NASA Astrophysics Data System (ADS)

Lee, Eun; Holme, Petter

2016-06-01

In ad hoc wireless networking, units are connected to each other rather than to a central, fixed, infrastructure. Constructing and maintaining such networks create several trade-off problems between robustness, communication speed, power consumption, etc., that bridges engineering, computer science and the physics of complex systems. In this work, we address the role of mobility patterns of the agents on the optimal tuning of a small-world type network construction method. By this method, the network is updated periodically and held static between the updates. We investigate the optimal updating times for different scenarios of the movement of agents (modeling, for example, the fat-tailed trip distances, and periodicities, of human travel). We find that these mobility patterns affect the power consumption in non-trivial ways and discuss how these effects can best be handled.

Hypothesis generation using network structures on community health center cancer-screening performance.

PubMed

Carney, Timothy Jay; Morgan, Geoffrey P; Jones, Josette; McDaniel, Anna M; Weaver, Michael T; Weiner, Bryan; Haggstrom, David A

2015-10-01

Nationally sponsored cancer-care quality-improvement efforts have been deployed in community health centers to increase breast, cervical, and colorectal cancer-screening rates among vulnerable populations. Despite several immediate and short-term gains, screening rates remain below national benchmark objectives. Overall improvement has been both difficult to sustain over time in some organizational settings and/or challenging to diffuse to other settings as repeatable best practices. Reasons for this include facility-level changes, which typically occur in dynamic organizational environments that are complex, adaptive, and unpredictable. This study seeks to understand the factors that shape community health center facility-level cancer-screening performance over time. This study applies a computational-modeling approach, combining principles of health-services research, health informatics, network theory, and systems science. To investigate the roles of knowledge acquisition, retention, and sharing within the setting of the community health center and to examine their effects on the relationship between clinical decision support capabilities and improvement in cancer-screening rate improvement, we employed Construct-TM to create simulated community health centers using previously collected point-in-time survey data. Construct-TM is a multi-agent model of network evolution. Because social, knowledge, and belief networks co-evolve, groups and organizations are treated as complex systems to capture the variability of human and organizational factors. In Construct-TM, individuals and groups interact by communicating, learning, and making decisions in a continuous cycle. Data from the survey was used to differentiate high-performing simulated community health centers from low-performing ones based on computer-based decision support usage and self-reported cancer-screening improvement. This virtual experiment revealed that patterns of overall network symmetry, agent cohesion, and connectedness varied by community health center performance level. Visual assessment of both the agent-to-agent knowledge sharing network and agent-to-resource knowledge use network diagrams demonstrated that community health centers labeled as high performers typically showed higher levels of collaboration and cohesiveness among agent classes, faster knowledge-absorption rates, and fewer agents that were unconnected to key knowledge resources. Conclusions and research implications: Using the point-in-time survey data outlining community health center cancer-screening practices, our computational model successfully distinguished between high and low performers. Results indicated that high-performance environments displayed distinctive network characteristics in patterns of interaction among agents, as well as in the access and utilization of key knowledge resources. Our study demonstrated how non-network-specific data obtained from a point-in-time survey can be employed to forecast community health center performance over time, thereby enhancing the sustainability of long-term strategic-improvement efforts. Our results revealed a strategic profile for community health center cancer-screening improvement via simulation over a projected 10-year period. The use of computational modeling allows additional inferential knowledge to be drawn from existing data when examining organizational performance in increasingly complex environments. Copyright © 2015 Elsevier Inc. All rights reserved.

A framework for modelling the complexities of food and water security under globalisation

NASA Astrophysics Data System (ADS)

Dermody, Brian J.; Sivapalan, Murugesu; Stehfest, Elke; van Vuuren, Detlef P.; Wassen, Martin J.; Bierkens, Marc F. P.; Dekker, Stefan C.

2018-01-01

We present a new framework for modelling the complexities of food and water security under globalisation. The framework sets out a method to capture regional and sectoral interdependencies and cross-scale feedbacks within the global food system that contribute to emergent water use patterns. The framework integrates aspects of existing models and approaches in the fields of hydrology and integrated assessment modelling. The core of the framework is a multi-agent network of city agents connected by infrastructural trade networks. Agents receive socio-economic and environmental constraint information from integrated assessment models and hydrological models respectively and simulate complex, socio-environmental dynamics that operate within those constraints. The emergent changes in food and water resources are aggregated and fed back to the original models with minimal modification of the structure of those models. It is our conviction that the framework presented can form the basis for a new wave of decision tools that capture complex socio-environmental change within our globalised world. In doing so they will contribute to illuminating pathways towards a sustainable future for humans, ecosystems and the water they share.

Epidemic dynamics and endemic states in complex networks

NASA Astrophysics Data System (ADS)

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2001-06-01

We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks.

Dynamical and topological aspects of consensus formation in complex networks

NASA Astrophysics Data System (ADS)

Chacoma, A.; Mato, G.; Kuperman, M. N.

2018-04-01

The present work analyzes a particular scenario of consensus formation, where the individuals navigate across an underlying network defining the topology of the walks. The consensus, associated to a given opinion coded as a simple message, is generated by interactions during the agent's walk and manifest itself in the collapse of the various opinions into a single one. We analyze how the topology of the underlying networks and the rules of interaction between the agents promote or inhibit the emergence of this consensus. We find that non-linear interaction rules are required to form consensus and that consensus is more easily achieved in networks whose degree distribution is narrower.

Immunization of complex networks

NASA Astrophysics Data System (ADS)

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2002-03-01

Complex networks such as the sexual partnership web or the Internet often show a high degree of redundancy and heterogeneity in their connectivity properties. This peculiar connectivity provides an ideal environment for the spreading of infective agents. Here we show that the random uniform immunization of individuals does not lead to the eradication of infections in all complex networks. Namely, networks with scale-free properties do not acquire global immunity from major epidemic outbreaks even in the presence of unrealistically high densities of randomly immunized individuals. The absence of any critical immunization threshold is due to the unbounded connectivity fluctuations of scale-free networks. Successful immunization strategies can be developed only by taking into account the inhomogeneous connectivity properties of scale-free networks. In particular, targeted immunization schemes, based on the nodes' connectivity hierarchy, sharply lower the network's vulnerability to epidemic attacks.

Multi-agent-based bio-network for systems biology: protein-protein interaction network as an example.

PubMed

Ren, Li-Hong; Ding, Yong-Sheng; Shen, Yi-Zhen; Zhang, Xiang-Feng

2008-10-01

Recently, a collective effort from multiple research areas has been made to understand biological systems at the system level. This research requires the ability to simulate particular biological systems as cells, organs, organisms, and communities. In this paper, a novel bio-network simulation platform is proposed for system biology studies by combining agent approaches. We consider a biological system as a set of active computational components interacting with each other and with an external environment. Then, we propose a bio-network platform for simulating the behaviors of biological systems and modelling them in terms of bio-entities and society-entities. As a demonstration, we discuss how a protein-protein interaction (PPI) network can be seen as a society of autonomous interactive components. From interactions among small PPI networks, a large PPI network can emerge that has a remarkable ability to accomplish a complex function or task. We also simulate the evolution of the PPI networks by using the bio-operators of the bio-entities. Based on the proposed approach, various simulators with different functions can be embedded in the simulation platform, and further research can be done from design to development, including complexity validation of the biological system.

Agent-based spin model for financial markets on complex networks: Emergence of two-phase phenomena

NASA Astrophysics Data System (ADS)

Kim, Yup; Kim, Hong-Joo; Yook, Soon-Hyung

2008-09-01

We study a microscopic model for financial markets on complex networks, motivated by the dynamics of agents and their structure of interaction. The model consists of interacting agents (spins) with local ferromagnetic coupling and global antiferromagnetic coupling. In order to incorporate more realistic situations, we also introduce an external field which changes in time. From numerical simulations, we find that the model shows two-phase phenomena. When the local ferromagnetic interaction is balanced with the global antiferromagnetic interaction, the resulting return distribution satisfies a power law having a single peak at zero values of return, which corresponds to the market equilibrium phase. On the other hand, if local ferromagnetic interaction is dominant, then the return distribution becomes double peaked at nonzero values of return, which characterizes the out-of-equilibrium phase. On random networks, the crossover between two phases comes from the competition between two different interactions. However, on scale-free networks, not only the competition between the different interactions but also the heterogeneity of underlying topology causes the two-phase phenomena. Possible relationships between the critical phenomena of spin system and the two-phase phenomena are discussed.

Distributed Coordination of Heterogeneous Agents Using a Semantic Overlay Network and a Goal-Directed Graphplan Planner

PubMed Central

Lopes, António Luís; Botelho, Luís Miguel

2013-01-01

In this paper, we describe a distributed coordination system that allows agents to seamlessly cooperate in problem solving by partially contributing to a problem solution and delegating the subproblems for which they do not have the required skills or knowledge to appropriate agents. The coordination mechanism relies on a dynamically built semantic overlay network that allows the agents to efficiently locate, even in very large unstructured networks, the necessary skills for a specific problem. Each agent performs partial contributions to the problem solution using a new distributed goal-directed version of the Graphplan algorithm. This new goal-directed version of the original Graphplan algorithm provides an efficient solution to the problem of "distraction", which most forward-chaining algorithms suffer from. We also discuss a set of heuristics to be used in the backward-search process of the planning algorithm in order to distribute this process amongst idle agents in an attempt to find a solution in less time. The evaluation results show that our approach is effective in building a scalable and efficient agent society capable of solving complex distributable problems. PMID:23704885

Collective navigation of complex networks: Participatory greedy routing.

PubMed

Kleineberg, Kaj-Kolja; Helbing, Dirk

2017-06-06

Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and global navigability? Here, we present an evolutionary game where agents share the value generated by successful delivery of information or goods. We show that global navigability can emerge, but its complete breakdown is possible as well. Furthermore, we show that the system tends to self-organize into local clusters of agents who participate in the navigation. This organizational principle can be exploited to favor the emergence of global navigability in the system.

Influence of anesthesia on cerebral blood flow, cerebral metabolic rate, and brain functional connectivity.

PubMed

Bonhomme, Vincent; Boveroux, Pierre; Hans, Pol; Brichant, Jean François; Vanhaudenhuyse, Audrey; Boly, Melanie; Laureys, Steven

2011-10-01

To describe recent studies exploring brain function under the influence of hypnotic anesthetic agents, and their implications on the understanding of consciousness physiology and anesthesia-induced alteration of consciousness. Cerebral cortex is the primary target of the hypnotic effect of anesthetic agents, and higher-order association areas are more sensitive to this effect than lower-order processing regions. Increasing concentration of anesthetic agents progressively attenuates connectivity in the consciousness networks, while connectivity in lower-order sensory and motor networks is preserved. Alteration of thalamic sub-cortical regulation could compromise the cortical integration of information despite preserved thalamic activation by external stimuli. At concentrations producing unresponsiveness, the activity of consciousness networks becomes anticorrelated with thalamic activity, while connectivity in lower-order sensory networks persists, although with cross-modal interaction alterations. Accumulating evidence suggests that hypnotic anesthetic agents disrupt large-scale cerebral connectivity. This would result in an inability of the brain to generate and integrate information, while external sensory information is still processed at a lower order of complexity.

Investigating accident causation through information network modelling.

PubMed

Griffin, T G C; Young, M S; Stanton, N A

2010-02-01

Management of risk in complex domains such as aviation relies heavily on post-event investigations, requiring complex approaches to fully understand the integration of multi-causal, multi-agent and multi-linear accident sequences. The Event Analysis of Systemic Teamwork methodology (EAST; Stanton et al. 2008) offers such an approach based on network models. In this paper, we apply EAST to a well-known aviation accident case study, highlighting communication between agents as a central theme and investigating the potential for finding agents who were key to the accident. Ultimately, this work aims to develop a new model based on distributed situation awareness (DSA) to demonstrate that the risk inherent in a complex system is dependent on the information flowing within it. By identifying key agents and information elements, we can propose proactive design strategies to optimize the flow of information and help work towards avoiding aviation accidents. Statement of Relevance: This paper introduces a novel application of an holistic methodology for understanding aviation accidents. Furthermore, it introduces an ongoing project developing a nonlinear and prospective method that centralises distributed situation awareness and communication as themes. The relevance of findings are discussed in the context of current ergonomic and aviation issues of design, training and human-system interaction.

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher

2005-01-01

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

Strategies for Increasing Pancreatic Tumor Immunogenicity

PubMed Central

Johnson, Burles A.; Yarchoan, Mark; Lee, Valerie; Laheru, Daniel A.; Jaffee, Elizabeth M.

2017-01-01

Immunotherapy has changed the standard of care for multiple deadly cancers including lung, head and neck, gastric, and some colorectal cancers. However, single agent immunotherapy has had little effect in pancreatic adenocarcinoma (PDAC). Increasing evidence suggests that the PDAC microenvironment is comprised of an intricate network of signals between immune cells, PDAC cells, and stroma, resulting in an immunosuppressive environment resistant to single agent immunotherapies. In this review, we discuss differences between immunotherapy sensitive cancers and PDAC, the complex interactions between PDAC stroma and suppressive tumor infiltrating cells that facilitate PDAC development and progression, the immunologic targets within these complex networks that are drugable, and data supporting combination drug approaches that modulate multiple PDAC signals, which should lead to improved clinical outcomes. PMID:28373364

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.

Competitive cluster growth in complex networks.

PubMed

Moreira, André A; Paula, Demétrius R; Costa Filho, Raimundo N; Andrade, José S

2006-06-01

In this work we propose an idealized model for competitive cluster growth in complex networks. Each cluster can be thought of as a fraction of a community that shares some common opinion. Our results show that the cluster size distribution depends on the particular choice for the topology of the network of contacts among the agents. As an application, we show that the cluster size distributions obtained when the growth process is performed on hierarchical networks, e.g., the Apollonian network, have a scaling form similar to what has been observed for the distribution of a number of votes in an electoral process. We suggest that this similarity may be due to the fact that social networks involved in the electoral process may also possess an underlining hierarchical structure.

Dynamics of Research Team Formation in Complex Networks

NASA Astrophysics Data System (ADS)

Sun, Caihong; Wan, Yuzi; Chen, Yu

Most organizations encourage the formation of teams to accomplish complicated tasks, and vice verse, effective teams could bring lots benefits and profits for organizations. Network structure plays an important role in forming teams. In this paper, we specifically study the dynamics of team formation in large research communities in which knowledge of individuals plays an important role on team performance and individual utility. An agent-based model is proposed, in which heterogeneous agents from research communities are described and empirically tested. Each agent has a knowledge endowment and a preference for both income and leisure. Agents provide a variable input (‘effort’) and their knowledge endowments to production. They could learn from others in their team and those who are not in their team but have private connections in community to adjust their own knowledge endowment. They are allowed to join other teams or work alone when it is welfare maximizing to do so. Various simulation experiments are conducted to examine the impacts of network topology, knowledge diffusion among community network, and team output sharing mechanisms on the dynamics of team formation.

Voice in the Agentic Assemblage

ERIC Educational Resources Information Center

Mazzei, Lisa A.; Jackson, Alecia Y.

2017-01-01

In this article, we explore how a posthumanist stance has enabled us to work a different consideration of the way in which "voice" is constituted and constituting in educational inquiry; that is, we position voice in a posthuman ontology that is understood as attributable to a complex network of human and nonhuman agents that exceed the…

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.

Influence of network topology on cooperative problem-solving systems.

PubMed

Fontanari, José F; Rodrigues, Francisco A

2016-09-01

The idea of a collective intelligence behind the complex natural structures built by organisms suggests that the organization of social networks is selected so as to optimize problem-solving competence at the group level. Here we study the influence of the social network topology on the performance of a group of agents whose task is to locate the global maxima of NK fitness landscapes. Agents cooperate by broadcasting messages informing on their fitness and use this information to imitate the fittest agent in their influence networks. In the case those messages convey accurate information on the proximity of the solution (i.e., for smooth fitness landscapes), we find that high connectivity as well as centralization boosts the group performance. For rugged landscapes, however, these characteristics are beneficial for small groups only. For large groups, it is advantageous to slow down the information transmission through the network to avoid local maximum traps. Long-range links and modularity have marginal effects on the performance of the group, except for a very narrow region of the model parameters.

Growth mechanisms of MgO nanocrystals via a sol-gel synthesis using different complexing agents

PubMed Central

2014-01-01

In the preparation of nanostructured materials, it is important to optimize synthesis parameters in order to obtain the desired material. This work investigates the role of complexing agents, oxalic acid and tartaric acid, in the production of MgO nanocrystals. Results from simultaneous thermogravimetric analysis (STA) show that the two different synthesis routes yield precursors with different thermal profiles. It is found that the thermal profiles of the precursors can reveal the effects of crystal growth during thermal annealing. X-ray diffraction confirms that the final products are pure, single phase and of cubic shape. It is also found that complexing agents can affect the rate of crystal growth. The structures of the oxalic acid and tartaric acid as well as the complexation sites play very important roles in the formation of the nanocrystals. The complexing agents influence the rate of growth which affects the final crystallite size of the materials. Surprisingly, it is also found that oxalic acid and tartaric acid act as surfactants inhibiting crystal growth even at a high temperature of 950°C and a long annealing time of 36 h. The crystallite formation routes are proposed to be via linear and branched polymer networks due to the different structures of the complexing agents. PMID:24650322

One-step synthesis and characterization of polyaniline nanofiber/silver nanoparticle composite networks as antibacterial agents.

PubMed

Poyraz, Selcuk; Cerkez, Idris; Huang, Tung Shi; Liu, Zhen; Kang, Litao; Luo, Jujie; Zhang, Xinyu

2014-11-26

Through a facile and effective seeding polymerization reaction via a one-step redox/complexation process, which took place in aqueous medium at ambient temperature, silver nanoparticles (Ag NPs) embedded polyaniline nanofiber (PANI NF) networks were synthesized as antibacterial agents. During the reaction, not only NF morphology formation of the resulting conducting polymers (CPs) but also amplification of the aqueous silver nitrate (AgNO3) solutions' oxidative potentials were managed by vanadium pentoxide (V2O5) sol-gel nanofibers, which acted as well-known nanofibrous seeding agents and the auxiliary oxidative agent at the same time. The PANI/Ag nanocomposites were proven to exhibit excellent antibacterial property against both Gram-negative Escherichia coli and Gram-positive Staphylococcus aureus. Antibacterial property performance and average life span of the nanocomposite network were optimized through the homogeneous distribution/embedment of Ag NPs within one-dimensional (1-D) PANI NF matrix. The antibacterial efficacy tests and nanocomposite material characterization results further indicated that the sole components of PANI/Ag have a synergistic effect to each other in terms of antibacterial property. Thus, this well-known catalytic seeding approach via a one-step oxidative polymerization reaction can be considered as a general methodology and a substantial fabrication tool to synthesize Ag NP decorated nanofibrillar PANI networks as advanced antibacterial agents.

Fast social-like learning of complex behaviors based on motor motifs.

PubMed

Calvo Tapia, Carlos; Tyukin, Ivan Y; Makarov, Valeri A

2018-05-01

Social learning is widely observed in many species. Less experienced agents copy successful behaviors exhibited by more experienced individuals. Nevertheless, the dynamical mechanisms behind this process remain largely unknown. Here we assume that a complex behavior can be decomposed into a sequence of n motor motifs. Then a neural network capable of activating motor motifs in a given sequence can drive an agent. To account for (n-1)! possible sequences of motifs in a neural network, we employ the winnerless competition approach. We then consider a teacher-learner situation: one agent exhibits a complex movement, while another one aims at mimicking the teacher's behavior. Despite the huge variety of possible motif sequences we show that the learner, equipped with the provided learning model, can rewire "on the fly" its synaptic couplings in no more than (n-1) learning cycles and converge exponentially to the durations of the teacher's motifs. We validate the learning model on mobile robots. Experimental results show that the learner is indeed capable of copying the teacher's behavior composed of six motor motifs in a few learning cycles. The reported mechanism of learning is general and can be used for replicating different functions, including, for example, sound patterns or speech.

Fast social-like learning of complex behaviors based on motor motifs

NASA Astrophysics Data System (ADS)

Calvo Tapia, Carlos; Tyukin, Ivan Y.; Makarov, Valeri A.

2018-05-01

Social learning is widely observed in many species. Less experienced agents copy successful behaviors exhibited by more experienced individuals. Nevertheless, the dynamical mechanisms behind this process remain largely unknown. Here we assume that a complex behavior can be decomposed into a sequence of n motor motifs. Then a neural network capable of activating motor motifs in a given sequence can drive an agent. To account for (n -1 )! possible sequences of motifs in a neural network, we employ the winnerless competition approach. We then consider a teacher-learner situation: one agent exhibits a complex movement, while another one aims at mimicking the teacher's behavior. Despite the huge variety of possible motif sequences we show that the learner, equipped with the provided learning model, can rewire "on the fly" its synaptic couplings in no more than (n -1 ) learning cycles and converge exponentially to the durations of the teacher's motifs. We validate the learning model on mobile robots. Experimental results show that the learner is indeed capable of copying the teacher's behavior composed of six motor motifs in a few learning cycles. The reported mechanism of learning is general and can be used for replicating different functions, including, for example, sound patterns or speech.

Facilitating and Learning at the Edge of Chaos: Expanding the Context of Experiential Education.

ERIC Educational Resources Information Center

Oekerman, Carl

Significant recent discoveries within a number of scientific disciplines, collectively referred to as the science of complexity, are creating a major shift in how human beings understand the complex, adaptive systems that make up the world. A complex adaptive system consists of networks of large numbers of agents that interact with each other and…

Emulating a System Dynamics Model with Agent-Based Models: A Methodological Case Study in Simulation of Diabetes Progression

DOE PAGES

Schryver, Jack; Nutaro, James; Shankar, Mallikarjun

2015-10-30

An agent-based simulation model hierarchy emulating disease states and behaviors critical to progression of diabetes type 2 was designed and implemented in the DEVS framework. The models are translations of basic elements of an established system dynamics model of diabetes. In this model hierarchy, which mimics diabetes progression over an aggregated U.S. population, was dis-aggregated and reconstructed bottom-up at the individual (agent) level. Four levels of model complexity were defined in order to systematically evaluate which parameters are needed to mimic outputs of the system dynamics model. Moreover, the four estimated models attempted to replicate stock counts representing disease statesmore » in the system dynamics model, while estimating impacts of an elderliness factor, obesity factor and health-related behavioral parameters. Health-related behavior was modeled as a simple realization of the Theory of Planned Behavior, a joint function of individual attitude and diffusion of social norms that spread over each agent s social network. Although the most complex agent-based simulation model contained 31 adjustable parameters, all models were considerably less complex than the system dynamics model which required numerous time series inputs to make its predictions. In all three elaborations of the baseline model provided significantly improved fits to the output of the system dynamics model. The performances of the baseline agent-based model and its extensions illustrate a promising approach to translate complex system dynamics models into agent-based model alternatives that are both conceptually simpler and capable of capturing main effects of complex local agent-agent interactions.« less

Emulating a System Dynamics Model with Agent-Based Models: A Methodological Case Study in Simulation of Diabetes Progression

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

Schryver, Jack; Nutaro, James; Shankar, Mallikarjun

An agent-based simulation model hierarchy emulating disease states and behaviors critical to progression of diabetes type 2 was designed and implemented in the DEVS framework. The models are translations of basic elements of an established system dynamics model of diabetes. In this model hierarchy, which mimics diabetes progression over an aggregated U.S. population, was dis-aggregated and reconstructed bottom-up at the individual (agent) level. Four levels of model complexity were defined in order to systematically evaluate which parameters are needed to mimic outputs of the system dynamics model. Moreover, the four estimated models attempted to replicate stock counts representing disease statesmore » in the system dynamics model, while estimating impacts of an elderliness factor, obesity factor and health-related behavioral parameters. Health-related behavior was modeled as a simple realization of the Theory of Planned Behavior, a joint function of individual attitude and diffusion of social norms that spread over each agent s social network. Although the most complex agent-based simulation model contained 31 adjustable parameters, all models were considerably less complex than the system dynamics model which required numerous time series inputs to make its predictions. In all three elaborations of the baseline model provided significantly improved fits to the output of the system dynamics model. The performances of the baseline agent-based model and its extensions illustrate a promising approach to translate complex system dynamics models into agent-based model alternatives that are both conceptually simpler and capable of capturing main effects of complex local agent-agent interactions.« less

Simpler grammar, larger vocabulary: How population size affects language

PubMed Central

2018-01-01

Languages with many speakers tend to be structurally simple while small communities sometimes develop languages with great structural complexity. Paradoxically, the opposite pattern appears to be observed for non-structural properties of language such as vocabulary size. These apparently opposite patterns pose a challenge for theories of language change and evolution. We use computational simulations to show that this inverse pattern can depend on a single factor: ease of diffusion through the population. A population of interacting agents was arranged on a network, passing linguistic conventions to one another along network links. Agents can invent new conventions, or replicate conventions that they have previously generated themselves or learned from other agents. Linguistic conventions are either Easy or Hard to diffuse, depending on how many times an agent needs to encounter a convention to learn it. In large groups, only linguistic conventions that are easy to learn, such as words, tend to proliferate, whereas small groups where everyone talks to everyone else allow for more complex conventions, like grammatical regularities, to be maintained. Our simulations thus suggest that language, and possibly other aspects of culture, may become simpler at the structural level as our world becomes increasingly interconnected. PMID:29367397

Further Structural Intelligence for Sensors Cluster Technology in Manufacturing

PubMed Central

Mekid, Samir

2006-01-01

With the ever increasing complex sensing and actuating tasks in manufacturing plants, intelligent sensors cluster in hybrid networks becomes a rapidly expanding area. They play a dominant role in many fields from macro and micro scale. Global object control and the ability to self organize into fault-tolerant and scalable systems are expected for high level applications. In this paper, new structural concepts of intelligent sensors and networks with new intelligent agents are presented. Embedding new functionalities to dynamically manage cooperative agents for autonomous machines are interesting key enabling technologies most required in manufacturing for zero defects production.

The dynamics of financial stability in complex networks

NASA Astrophysics Data System (ADS)

da Cruz, J. P.; Lind, P. G.

2012-08-01

We address the problem of banking system resilience by applying off-equilibrium statistical physics to a system of particles, representing the economic agents, modelled according to the theoretical foundation of the current banking regulation, the so called Merton-Vasicek model. Economic agents are attracted to each other to exchange `economic energy', forming a network of trades. When the capital level of one economic agent drops below a minimum, the economic agent becomes insolvent. The insolvency of one single economic agent affects the economic energy of all its neighbours which thus become susceptible to insolvency, being able to trigger a chain of insolvencies (avalanche). We show that the distribution of avalanche sizes follows a power-law whose exponent depends on the minimum capital level. Furthermore, we present evidence that under an increase in the minimum capital level, large crashes will be avoided only if one assumes that agents will accept a drop in business levels, while keeping their trading attitudes and policies unchanged. The alternative assumption, that agents will try to restore their business levels, may lead to the unexpected consequence that large crises occur with higher probability.

Dynamics of Complex Systems Built as Coupled Physical, Communication and Decision Layers

PubMed Central

Kühnlenz, Florian; Nardelli, Pedro H. J.

2016-01-01

This paper proposes a simple model to capture the complexity of multilayer systems where their constituent layers affect, and are affected by, each other. The physical layer is a circuit composed by a power source and resistors in parallel. Every individual agent aims at maximizing its own delivered power by adding, removing or keeping the resistors it has; the delivered power is in turn a non-linear function that depends on the other agents’ behavior, its own internal state, its global state perception, the information received from its neighbors via the communication network and a randomized selfishness. We develop an agent-based simulation to analyze the effects of number of agents (system size), communication network topology, communication errors and the minimum power gain that triggers a behavioral change on the system dynamic. Our results show that a wave-like behavior at macro-level (caused by individual changes in the decision layer) can only emerge for a specific system size. The ratio between cooperators and defectors depends on the minimum gain assumed—lower minimal gains lead to less cooperation, and vice-versa. Different communication network topologies imply different levels of power utilization and fairness at the physical layer, and a certain level of error in the communication layer induces more cooperation. PMID:26730590

Macroscopic description of complex adaptive networks coevolving with dynamic node states

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

2015-05-01

In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.

Macroscopic description of complex adaptive networks coevolving with dynamic node states.

PubMed

Wiedermann, Marc; Donges, Jonathan F; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

2015-05-01

In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.

Emergence of social structures via preferential selection

NASA Astrophysics Data System (ADS)

Lipowski, Adam; Lipowska, Dorota; Ferreira, Antonio Luis

2014-09-01

We examine a weighted-network multiagent model with preferential selection such that agents choose partners with probability p (w), where w is the number of their past selections. When p (w) increases sublinearly with the number of past selections [p(w)˜wα,α<1], agents develop a uniform preference for all other agents. At α =1, this state loses stability and more complex structures form. For a superlinear increase (α>1), strong heterogeneities emerge and agents make selections mainly within small and sometimes asymmetric clusters. Even in a few-agent case, the formation of such clusters resembles phase transitions with spontaneous symmetry breaking.

Evolutionary dynamics of the traveler's dilemma and minimum-effort coordination games on complex networks.

PubMed

Iyer, Swami; Killingback, Timothy

2014-10-01

The traveler's dilemma game and the minimum-effort coordination game are social dilemmas that have received significant attention resulting from the fact that the predictions of classical game theory are inconsistent with the results found when the games are studied experimentally. Moreover, both the traveler's dilemma and the minimum-effort coordination games have potentially important applications in evolutionary biology. Interestingly, standard deterministic evolutionary game theory, as represented by the replicator dynamics in a well-mixed population, is also inadequate to account for the behavior observed in these games. Here we study the evolutionary dynamics of both these games in populations with interaction patterns described by a variety of complex network topologies. We investigate the evolutionary dynamics of these games through agent-based simulations on both model and empirical networks. In particular, we study the effects of network clustering and assortativity on the evolutionary dynamics of both games. In general, we show that the evolutionary behavior of the traveler's dilemma and minimum-effort coordination games on complex networks is in good agreement with that observed experimentally. Thus, formulating the traveler's dilemma and the minimum-effort coordination games on complex networks neatly resolves the paradoxical aspects of these games.

Evolutionary dynamics of the traveler's dilemma and minimum-effort coordination games on complex networks

NASA Astrophysics Data System (ADS)

Iyer, Swami; Killingback, Timothy

2014-10-01

The traveler's dilemma game and the minimum-effort coordination game are social dilemmas that have received significant attention resulting from the fact that the predictions of classical game theory are inconsistent with the results found when the games are studied experimentally. Moreover, both the traveler's dilemma and the minimum-effort coordination games have potentially important applications in evolutionary biology. Interestingly, standard deterministic evolutionary game theory, as represented by the replicator dynamics in a well-mixed population, is also inadequate to account for the behavior observed in these games. Here we study the evolutionary dynamics of both these games in populations with interaction patterns described by a variety of complex network topologies. We investigate the evolutionary dynamics of these games through agent-based simulations on both model and empirical networks. In particular, we study the effects of network clustering and assortativity on the evolutionary dynamics of both games. In general, we show that the evolutionary behavior of the traveler's dilemma and minimum-effort coordination games on complex networks is in good agreement with that observed experimentally. Thus, formulating the traveler's dilemma and the minimum-effort coordination games on complex networks neatly resolves the paradoxical aspects of these games.

Role of Distance-Based Routing in Traffic Dynamics on Mobile Networks

NASA Astrophysics Data System (ADS)

Yang, Han-Xin; Wang, Wen-Xu

2013-06-01

Despite of intensive investigations on transportation dynamics taking place on complex networks with fixed structures, a deep understanding of networks consisting of mobile nodes is challenging yet, especially the lacking of insight into the effects of routing strategies on transmission efficiency. We introduce a distance-based routing strategy for networks of mobile agents toward enhancing the network throughput and the transmission efficiency. We study the transportation capacity and delivering time of data packets associated with mobility and communication ability. Interestingly, we find that the transportation capacity is optimized at moderate moving speed, which is quite different from random routing strategy. In addition, both continuous and discontinuous transitions from free flow to congestions are observed. Degree distributions are explored in order to explain the enhancement of network throughput and other observations. Our work is valuable toward understanding complex transportation dynamics and designing effective routing protocols.

Vector-based navigation using grid-like representations in artificial agents.

PubMed

Banino, Andrea; Barry, Caswell; Uria, Benigno; Blundell, Charles; Lillicrap, Timothy; Mirowski, Piotr; Pritzel, Alexander; Chadwick, Martin J; Degris, Thomas; Modayil, Joseph; Wayne, Greg; Soyer, Hubert; Viola, Fabio; Zhang, Brian; Goroshin, Ross; Rabinowitz, Neil; Pascanu, Razvan; Beattie, Charlie; Petersen, Stig; Sadik, Amir; Gaffney, Stephen; King, Helen; Kavukcuoglu, Koray; Hassabis, Demis; Hadsell, Raia; Kumaran, Dharshan

2018-05-01

Deep neural networks have achieved impressive successes in fields ranging from object recognition to complex games such as Go 1,2 . Navigation, however, remains a substantial challenge for artificial agents, with deep neural networks trained by reinforcement learning 3-5 failing to rival the proficiency of mammalian spatial behaviour, which is underpinned by grid cells in the entorhinal cortex 6 . Grid cells are thought to provide a multi-scale periodic representation that functions as a metric for coding space 7,8 and is critical for integrating self-motion (path integration) 6,7,9 and planning direct trajectories to goals (vector-based navigation) 7,10,11 . Here we set out to leverage the computational functions of grid cells to develop a deep reinforcement learning agent with mammal-like navigational abilities. We first trained a recurrent network to perform path integration, leading to the emergence of representations resembling grid cells, as well as other entorhinal cell types 12 . We then showed that this representation provided an effective basis for an agent to locate goals in challenging, unfamiliar, and changeable environments-optimizing the primary objective of navigation through deep reinforcement learning. The performance of agents endowed with grid-like representations surpassed that of an expert human and comparison agents, with the metric quantities necessary for vector-based navigation derived from grid-like units within the network. Furthermore, grid-like representations enabled agents to conduct shortcut behaviours reminiscent of those performed by mammals. Our findings show that emergent grid-like representations furnish agents with a Euclidean spatial metric and associated vector operations, providing a foundation for proficient navigation. As such, our results support neuroscientific theories that see grid cells as critical for vector-based navigation 7,10,11 , demonstrating that the latter can be combined with path-based strategies to support navigation in challenging environments.

Stochastic opinion formation in scale-free networks

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

M. Bartolozzi; D. B. Leinweber; A. W. Thomas

2005-10-01

The dynamics of opinion formation in large groups of people is a complex nonlinear phenomenon whose investigation is just beginning. Both collective behavior and personal views play an important role in this mechanism. In the present work we mimic the dynamics of opinion formation of a group of agents, represented by two states 1, as a stochastic response of each agent to the opinion of his/her neighbors in the social network and to feedback from the average opinion of the whole. In the light of recent studies, a scale-free Barabsi-Albert network has been selected to simulate the topology of themore » interactions. A turbulent-like dynamics, characterized by an intermittent behavior, is observed for a certain range of the model parameters. The problem of uncertainty in decision taking is also addressed both from a topological point of view, using random and targeted removal of agents from the network, and by implementing a three-state model, where the third state, zero, is related to the information available to each agent. Finally, the results of the model are tested against the best known network of social interactions: the stock market. A time series of daily closures of the Dow-Jones index has been used as an indicator of the possible applicability of our model in the financial context. Good qualitative agreement is found.« less

[Methodological novelties applied to the anthropology of food: agent-based models and social networks analysis].

PubMed

Díaz Córdova, Diego

2016-01-01

The aim of this article is to introduce two methodological strategies that have not often been utilized in the anthropology of food: agent-based models and social networks analysis. In order to illustrate these methods in action, two cases based in materials typical of the anthropology of food are presented. For the first strategy, fieldwork carried out in Quebrada de Humahuaca (province of Jujuy, Argentina) regarding meal recall was used, and for the second, elements of the concept of "domestic consumption strategies" applied by Aguirre were employed. The underlying idea is that, given that eating is recognized as a "total social fact" and, therefore, as a complex phenomenon, the methodological approach must also be characterized by complexity. The greater the number of methods utilized (with the appropriate rigor), the better able we will be to understand the dynamics of feeding in the social environment.

Social networks and family violence in cross-cultural perspective.

PubMed

Korbin, J E

1995-01-01

The purpose of this chapter was twofold. First, the chapter put forward a brief cross-cultural perspective indicating that multiple types of intrafamilial violence occur cross-culturally. Second, the chapter placed social networks at the core of a complex etiology of intrafamilial violence. The purpose of giving centrality to social networks is not to suggest that social networks are the sole or primary agent contributing to family violence but to broaden the context in which family violence is viewed beyond that of the perpetrator, the victim/survivor, or the violent dyad.

Ribbon networks for modeling navigable paths of autonomous agents in virtual environments.

PubMed

Willemsen, Peter; Kearney, Joseph K; Wang, Hongling

2006-01-01

This paper presents the Environment Description Framework (EDF) for modeling complex networks of intersecting roads and pathways in virtual environments. EDF represents information about the layout of streets and sidewalks, the rules that govern behavior on roads and walkways, and the locations of agents with respect to navigable structures. The framework serves as the substrate on which behavior programs for autonomous vehicles and pedestrians are built. Pathways are modeled as ribbons in space. The ribbon structure provides a natural coordinate frame for defining the local geometry of navigable surfaces. EDF includes a powerful runtime interface supported by robust and efficient code for locating objects on the ribbon network, for mapping between Cartesian and ribbon coordinates, and for determining behavioral constraints imposed by the environment.

Modeling Trust in ELICIT-WEL to Capture the Impact of Organization Structure on the Agility of Complex Networks

DTIC Science & Technology

2012-06-01

Topic 8: Networks and Networking Name of Author(s) Kevin Chan, US Army Research Laboratory Mary Ruddy, Azigo Point of Contact Kevin Chan RDRL-CIN...framework. The enhanced integrated emulation platform is then used to conduct a series of agent-based ELICIT experiments whose design is informed by...NUMBER 6. AUTHOR(S) 5d. PROJECT NUMBER 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) US Army Research

Global adaptation in networks of selfish components: emergent associative memory at the system scale.

PubMed

Watson, Richard A; Mills, Rob; Buckley, C L

2011-01-01

In some circumstances complex adaptive systems composed of numerous self-interested agents can self-organize into structures that enhance global adaptation, efficiency, or function. However, the general conditions for such an outcome are poorly understood and present a fundamental open question for domains as varied as ecology, sociology, economics, organismic biology, and technological infrastructure design. In contrast, sufficient conditions for artificial neural networks to form structures that perform collective computational processes such as associative memory/recall, classification, generalization, and optimization are well understood. Such global functions within a single agent or organism are not wholly surprising, since the mechanisms (e.g., Hebbian learning) that create these neural organizations may be selected for this purpose; but agents in a multi-agent system have no obvious reason to adhere to such a structuring protocol or produce such global behaviors when acting from individual self-interest. However, Hebbian learning is actually a very simple and fully distributed habituation or positive feedback principle. Here we show that when self-interested agents can modify how they are affected by other agents (e.g., when they can influence which other agents they interact with), then, in adapting these inter-agent relationships to maximize their own utility, they will necessarily alter them in a manner homologous with Hebbian learning. Multi-agent systems with adaptable relationships will thereby exhibit the same system-level behaviors as neural networks under Hebbian learning. For example, improved global efficiency in multi-agent systems can be explained by the inherent ability of associative memory to generalize by idealizing stored patterns and/or creating new combinations of subpatterns. Thus distributed multi-agent systems can spontaneously exhibit adaptive global behaviors in the same sense, and by the same mechanism, as with the organizational principles familiar in connectionist models of organismic learning.

Process and data fragmentation-oriented enterprise network integration with collaboration modelling and collaboration agents

NASA Astrophysics Data System (ADS)

Li, Qing; Wang, Ze-yuan; Cao, Zhi-chao; Du, Rui-yang; Luo, Hao

2015-08-01

With the process of globalisation and the development of management models and information technology, enterprise cooperation and collaboration has developed from intra-enterprise integration, outsourcing and inter-enterprise integration, and supply chain management, to virtual enterprises and enterprise networks. Some midfielder enterprises begin to serve for different supply chains. Therefore, they combine related supply chains into a complex enterprise network. The main challenges for enterprise network's integration and collaboration are business process and data fragmentation beyond organisational boundaries. This paper reviews the requirements of enterprise network's integration and collaboration, as well as the development of new information technologies. Based on service-oriented architecture (SOA), collaboration modelling and collaboration agents are introduced to solve problems of collaborative management for service convergence under the condition of process and data fragmentation. A model-driven methodology is developed to design and deploy the integrating framework. An industrial experiment is designed and implemented to illustrate the usage of developed technologies in this paper.

Weighted Networks at the Polish Market

NASA Astrophysics Data System (ADS)

Chmiel, A. M.; Sienkiewicz, J.; Suchecki, K.; Hołyst, J. A.

During the last few years various models of networks [1,2] have become a powerful tool for analysis of complex systems in such distant fields as Internet [3], biology [4], social groups [5], ecology [6] and public transport [7]. Modeling behavior of economical agents is a challenging issue that has also been studied from a network point of view. The examples of such studies are models of financial networks [8], supply chains [9, 10], production networks [11], investment networks [12] or collective bank bankrupcies [13, 14]. Relations between different companies have been already analyzed using several methods: as networks of shareholders [15], networks of correlations between stock prices [16] or networks of board directors [17]. In several cases scaling laws for network characteristics have been observed.

Microscopic Examination of Chitosan Polyphosphate Beads with Entrapped Spores of the Biocontrol Agent, Streptomyces melanosporofaciens EF-76

NASA Astrophysics Data System (ADS)

Jobin, Guy; Grondin, Gilles; Couture, Geneviève; Beaulieu, Carole

2005-04-01

Spores of the biocontrol agent, Streptomyces melanosporofaciens EF-76, were entrapped by complex coacervation in beads composed of a macromolecular complex (MC) of chitosan and polyphosphate. A proportion of spores entrapped in beads survived the entrapment procedure as shown by treating spores from chitosan beads with a dye allowing the differentiation of live and dead cells. The spore-loaded chitosan beads could be digested by a chitosanase, suggesting that, once introduced in soil, the beads would be degraded to release the biocontrol agent. Spore-loaded beads were examined by optical and scanning electron microscopy because the release of the biological agent depends on the spore distribution in the chitosan beads. The microscopic examination revealed that the beads had a porous surface and contained a network of inner microfibrils. Spores were entrapped in both the chitosan microfibrils and the bead lacuna.

Human-level control through deep reinforcement learning.

PubMed

Mnih, Volodymyr; Kavukcuoglu, Koray; Silver, David; Rusu, Andrei A; Veness, Joel; Bellemare, Marc G; Graves, Alex; Riedmiller, Martin; Fidjeland, Andreas K; Ostrovski, Georg; Petersen, Stig; Beattie, Charles; Sadik, Amir; Antonoglou, Ioannis; King, Helen; Kumaran, Dharshan; Wierstra, Daan; Legg, Shane; Hassabis, Demis

2015-02-26

The theory of reinforcement learning provides a normative account, deeply rooted in psychological and neuroscientific perspectives on animal behaviour, of how agents may optimize their control of an environment. To use reinforcement learning successfully in situations approaching real-world complexity, however, agents are confronted with a difficult task: they must derive efficient representations of the environment from high-dimensional sensory inputs, and use these to generalize past experience to new situations. Remarkably, humans and other animals seem to solve this problem through a harmonious combination of reinforcement learning and hierarchical sensory processing systems, the former evidenced by a wealth of neural data revealing notable parallels between the phasic signals emitted by dopaminergic neurons and temporal difference reinforcement learning algorithms. While reinforcement learning agents have achieved some successes in a variety of domains, their applicability has previously been limited to domains in which useful features can be handcrafted, or to domains with fully observed, low-dimensional state spaces. Here we use recent advances in training deep neural networks to develop a novel artificial agent, termed a deep Q-network, that can learn successful policies directly from high-dimensional sensory inputs using end-to-end reinforcement learning. We tested this agent on the challenging domain of classic Atari 2600 games. We demonstrate that the deep Q-network agent, receiving only the pixels and the game score as inputs, was able to surpass the performance of all previous algorithms and achieve a level comparable to that of a professional human games tester across a set of 49 games, using the same algorithm, network architecture and hyperparameters. This work bridges the divide between high-dimensional sensory inputs and actions, resulting in the first artificial agent that is capable of learning to excel at a diverse array of challenging tasks.

Human-level control through deep reinforcement learning

NASA Astrophysics Data System (ADS)

Mnih, Volodymyr; Kavukcuoglu, Koray; Silver, David; Rusu, Andrei A.; Veness, Joel; Bellemare, Marc G.; Graves, Alex; Riedmiller, Martin; Fidjeland, Andreas K.; Ostrovski, Georg; Petersen, Stig; Beattie, Charles; Sadik, Amir; Antonoglou, Ioannis; King, Helen; Kumaran, Dharshan; Wierstra, Daan; Legg, Shane; Hassabis, Demis

2015-02-01

The theory of reinforcement learning provides a normative account, deeply rooted in psychological and neuroscientific perspectives on animal behaviour, of how agents may optimize their control of an environment. To use reinforcement learning successfully in situations approaching real-world complexity, however, agents are confronted with a difficult task: they must derive efficient representations of the environment from high-dimensional sensory inputs, and use these to generalize past experience to new situations. Remarkably, humans and other animals seem to solve this problem through a harmonious combination of reinforcement learning and hierarchical sensory processing systems, the former evidenced by a wealth of neural data revealing notable parallels between the phasic signals emitted by dopaminergic neurons and temporal difference reinforcement learning algorithms. While reinforcement learning agents have achieved some successes in a variety of domains, their applicability has previously been limited to domains in which useful features can be handcrafted, or to domains with fully observed, low-dimensional state spaces. Here we use recent advances in training deep neural networks to develop a novel artificial agent, termed a deep Q-network, that can learn successful policies directly from high-dimensional sensory inputs using end-to-end reinforcement learning. We tested this agent on the challenging domain of classic Atari 2600 games. We demonstrate that the deep Q-network agent, receiving only the pixels and the game score as inputs, was able to surpass the performance of all previous algorithms and achieve a level comparable to that of a professional human games tester across a set of 49 games, using the same algorithm, network architecture and hyperparameters. This work bridges the divide between high-dimensional sensory inputs and actions, resulting in the first artificial agent that is capable of learning to excel at a diverse array of challenging tasks.

Economic networks: Heterogeneity-induced vulnerability and loss of synchronization

NASA Astrophysics Data System (ADS)

Colon, Célian; Ghil, Michael

2017-12-01

Interconnected systems are prone to propagation of disturbances, which can undermine their resilience to external perturbations. Propagation dynamics can clearly be affected by potential time delays in the underlying processes. We investigate how such delays influence the resilience of production networks facing disruption of supply. Interdependencies between economic agents are modeled using systems of Boolean delay equations (BDEs); doing so allows us to introduce heterogeneity in production delays and in inventories. Complex network topologies are considered that reproduce realistic economic features, including a network of networks. Perturbations that would otherwise vanish can, because of delay heterogeneity, amplify and lead to permanent disruptions. This phenomenon is enabled by the interactions between short cyclic structures. Difference in delays between two interacting, and otherwise resilient, structures can in turn lead to loss of synchronization in damage propagation and thus prevent recovery. Finally, this study also shows that BDEs on complex networks can lead to metastable relaxation oscillations, which are damped out in one part of a network while moving on to another part.

Role models for complex networks

NASA Astrophysics Data System (ADS)

Reichardt, J.; White, D. R.

2007-11-01

We present a framework for automatically decomposing (“block-modeling”) the functional classes of agents within a complex network. These classes are represented by the nodes of an image graph (“block model”) depicting the main patterns of connectivity and thus functional roles in the network. Using a first principles approach, we derive a measure for the fit of a network to any given image graph allowing objective hypothesis testing. From the properties of an optimal fit, we derive how to find the best fitting image graph directly from the network and present a criterion to avoid overfitting. The method can handle both two-mode and one-mode data, directed and undirected as well as weighted networks and allows for different types of links to be dealt with simultaneously. It is non-parametric and computationally efficient. The concepts of structural equivalence and modularity are found as special cases of our approach. We apply our method to the world trade network and analyze the roles individual countries play in the global economy.

Learning Agents for Autonomous Space Asset Management (LAASAM)

NASA Astrophysics Data System (ADS)

Scally, L.; Bonato, M.; Crowder, J.

2011-09-01

Current and future space systems will continue to grow in complexity and capabilities, creating a formidable challenge to monitor, maintain, and utilize these systems and manage their growing network of space and related ground-based assets. Integrated System Health Management (ISHM), and in particular, Condition-Based System Health Management (CBHM), is the ability to manage and maintain a system using dynamic real-time data to prioritize, optimize, maintain, and allocate resources. CBHM entails the maintenance of systems and equipment based on an assessment of current and projected conditions (situational and health related conditions). A complete, modern CBHM system comprises a number of functional capabilities: sensing and data acquisition; signal processing; conditioning and health assessment; diagnostics and prognostics; and decision reasoning. In addition, an intelligent Human System Interface (HSI) is required to provide the user/analyst with relevant context-sensitive information, the system condition, and its effect on overall situational awareness of space (and related) assets. Colorado Engineering, Inc. (CEI) and Raytheon are investigating and designing an Intelligent Information Agent Architecture that will provide a complete range of CBHM and HSI functionality from data collection through recommendations for specific actions. The research leverages CEI’s expertise with provisioning management network architectures and Raytheon’s extensive experience with learning agents to define a system to autonomously manage a complex network of current and future space-based assets to optimize their utilization.

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.

Dynamic Network Analysis for Robust Uncertainty Management

DTIC Science & Technology

2010-03-01

complex networks since a set of modules could be a lot simpler than a collection of entangled individual agents (22). The simplification may be...nanomaterials and photonic crystals with desired material prop- 233 C.l. FAST GENERATION OF POTENTIALS FOR SELF-ASSEMBLY OF PARTICLES erties [14-21...prescribed geometry and structure is highly motivated by the desire to produce photonic crystals with specified optical properties. Also, we intend to

Functionality, Complexity, and Approaches to Assessment of Resilience Under Constrained Energy and Information

DTIC Science & Technology

2015-03-26

albeit powerful , method available for exploring CAS. As discussed above, there are many useful mathematical tools appropriate for CAS modeling. Agent-based...cells, tele- phone calls, and sexual contacts approach power -law distributions. [48] Networks in general are robust against random failures, but...targeted failures can have powerful effects – provided the targeter has a good understanding of the network structure. Some argue (convincingly) that all

SSIC model: A multi-layer model for intervention of online rumors spreading

NASA Astrophysics Data System (ADS)

Tian, Ru-Ya; Zhang, Xue-Fu; Liu, Yi-Jun

2015-06-01

SIR model is a classical model to simulate rumor spreading, while the supernetwork is an effective tool for modeling complex systems. Based on the Opinion SuperNetwork involving Social Sub-network, Environmental Sub-network, Psychological Sub-network, and Viewpoint Sub-network, drawing from the modeling idea of SIR model, this paper designs super SIC model (SSIC model) and its evolution rules, and also analyzes intervention effects on public opinion of four elements of supernetwork, which are opinion agent, opinion environment, agent's psychology and viewpoint. Studies show that, the SSIC model based on supernetwork has effective intervention effects on rumor spreading. It is worth noting that (i) identifying rumor spreaders in Social Sub-network and isolating them can achieve desired intervention results, (ii) improving environmental information transparency so that the public knows as much information as possible to reduce the rumors is a feasible way to intervene, (iii) persuading wavering neutrals has better intervention effects than clarifying rumors already spread everywhere, so rumors should be intervened in properly in time by psychology counseling.

Advancing complementary and alternative medicine through social network analysis and agent-based modeling.

PubMed

Frantz, Terrill L

2012-01-01

This paper introduces the contemporary perspectives and techniques of social network analysis (SNA) and agent-based modeling (ABM) and advocates applying them to advance various aspects of complementary and alternative medicine (CAM). SNA and ABM are invaluable methods for representing, analyzing and projecting complex, relational, social phenomena; they provide both an insightful vantage point and a set of analytic tools that can be useful in a wide range of contexts. Applying these methods in the CAM context can aid the ongoing advances in the CAM field, in both its scientific aspects and in developing broader acceptance in associated stakeholder communities. Copyright © 2012 S. Karger AG, Basel.

Spreading dynamics on complex networks: a general stochastic approach.

PubMed

Noël, Pierre-André; Allard, Antoine; Hébert-Dufresne, Laurent; Marceau, Vincent; Dubé, Louis J

2014-12-01

Dynamics on networks is considered from the perspective of Markov stochastic processes. We partially describe the state of the system through network motifs and infer any missing data using the available information. This versatile approach is especially well adapted for modelling spreading processes and/or population dynamics. In particular, the generality of our framework and the fact that its assumptions are explicitly stated suggests that it could be used as a common ground for comparing existing epidemics models too complex for direct comparison, such as agent-based computer simulations. We provide many examples for the special cases of susceptible-infectious-susceptible and susceptible-infectious-removed dynamics (e.g., epidemics propagation) and we observe multiple situations where accurate results may be obtained at low computational cost. Our perspective reveals a subtle balance between the complex requirements of a realistic model and its basic assumptions.

Agent-based model of angiogenesis simulates capillary sprout initiation in multicellular networks

PubMed Central

Walpole, J.; Chappell, J.C.; Cluceru, J.G.; Mac Gabhann, F.; Bautch, V.L.; Peirce, S. M.

2015-01-01

Many biological processes are controlled by both deterministic and stochastic influences. However, efforts to model these systems often rely on either purely stochastic or purely rule-based methods. To better understand the balance between stochasticity and determinism in biological processes a computational approach that incorporates both influences may afford additional insight into underlying biological mechanisms that give rise to emergent system properties. We apply a combined approach to the simulation and study of angiogenesis, the growth of new blood vessels from existing networks. This complex multicellular process begins with selection of an initiating endothelial cell, or tip cell, which sprouts from the parent vessels in response to stimulation by exogenous cues. We have constructed an agent-based model of sprouting angiogenesis to evaluate endothelial cell sprout initiation frequency and location, and we have experimentally validated it using high-resolution time-lapse confocal microscopy. ABM simulations were then compared to a Monte Carlo model, revealing that purely stochastic simulations could not generate sprout locations as accurately as the rule-informed agent-based model. These findings support the use of rule-based approaches for modeling the complex mechanisms underlying sprouting angiogenesis over purely stochastic methods. PMID:26158406

Agent-based model of angiogenesis simulates capillary sprout initiation in multicellular networks.

PubMed

Walpole, J; Chappell, J C; Cluceru, J G; Mac Gabhann, F; Bautch, V L; Peirce, S M

2015-09-01

Many biological processes are controlled by both deterministic and stochastic influences. However, efforts to model these systems often rely on either purely stochastic or purely rule-based methods. To better understand the balance between stochasticity and determinism in biological processes a computational approach that incorporates both influences may afford additional insight into underlying biological mechanisms that give rise to emergent system properties. We apply a combined approach to the simulation and study of angiogenesis, the growth of new blood vessels from existing networks. This complex multicellular process begins with selection of an initiating endothelial cell, or tip cell, which sprouts from the parent vessels in response to stimulation by exogenous cues. We have constructed an agent-based model of sprouting angiogenesis to evaluate endothelial cell sprout initiation frequency and location, and we have experimentally validated it using high-resolution time-lapse confocal microscopy. ABM simulations were then compared to a Monte Carlo model, revealing that purely stochastic simulations could not generate sprout locations as accurately as the rule-informed agent-based model. These findings support the use of rule-based approaches for modeling the complex mechanisms underlying sprouting angiogenesis over purely stochastic methods.

Computational Model of Secondary Palate Fusion and Disruption

EPA Science Inventory

Morphogenetic events are driven by cell-generated physical forces and complex cellular dynamics. To improve our capacity to predict developmental effects from cellular alterations, we built a multi-cellular agent-based model in CompuCell3D that recapitulates the cellular networks...

Learning about knowledge: A complex network approach

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

Fontoura Costa, Luciano da

2006-08-15

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

Spreading of infection in a two species reaction-diffusion process in networks

NASA Astrophysics Data System (ADS)

Korosoglou, Paschalis; Kittas, Aristotelis; Argyrakis, Panos

2010-12-01

We study the dynamics of the infection of a two mobile species reaction from a single infected agent in a population of healthy agents. Historically, the main focus for infection propagation has been through spreading phenomena, where a random location of the system is initially infected and then propagates by successfully infecting its neighbor sites. Here both the infected and healthy agents are mobile, performing classical random walks. This may be a more realistic picture to such epidemiological models, such as the spread of a virus in communication networks of routers, where data travel in packets, the communication time of stations in ad hoc mobile networks, information spreading (such as rumor spreading) in social networks, etc. We monitor the density of healthy particles ρ(t) , which we find in all cases to be an exponential function in the long-time limit in two-dimensional and three-dimensional lattices and Erdős-Rényi (ER) and scale-free (SF) networks. We also investigate the scaling of the crossover time tc from short- to long-time exponential behavior, which we find to be a power law in lattices and ER networks. This crossover is shown to be absent in SF networks, where we reveal the role of the connectivity of the network in the infection process. We compare this behavior to ER networks and lattices and highlight the significance of various connectivity patterns, as well as the important differences of this process in the various underlying geometries, revealing a more complex behavior of ρ(t) .

Novel Holistic Approaches for Overcoming Therapy Resistance in Pancreatic and Colon Cancers.

PubMed

Sarkar, Fazlul H

2016-01-01

Gastrointestinal (GI) cancers, such as of the colon and pancreas, are highly resistant to both standard and targeted therapeutics. Therapy-resistant and heterogeneous GI cancers harbor highly complex signaling networks (the resistome) that resist apoptotic programming. Commonly used gemcitabine or platinum-based regimens fail to induce meaningful (i.e. disease-reversing) perturbations in the resistome, resulting in high rates of treatment failure. The GI cancer resistance networks are, in part, due to interactions between parallel signaling and aberrantly expressed microRNAs (miRNAs) that collectively promote the development and survival of drug-resistant cancer stem cells with epithelial-to-mesenchymal transition (EMT) characteristics. The lack of understanding of the resistance networks associated with this subpopulation of cells as well as reductionist, single protein-/pathway-targeted approaches have made 'effective drug design' a difficult task. We propose that the successful design of novel therapeutic regimens to target drug-resistant GI tumors is only possible if network-based drug avenues and agents, in particular 'natural agents' with no known toxicity, are correctly identified. Natural agents (dietary agents or their synthetic derivatives) can individually alter miRNA profiles, suppress EMT pathways and eliminate cancer stem-like cells that derive from pancreatic cancer and colon cancer, by partially targeting multiple yet meaningful networks within the GI cancer resistome. However, the efficacy of these agents as combinations (e.g. consumed in the diet) against this resistome has never been studied. This short review article provides an overview of the different challenges involved in the understanding of the GI resistome, and how novel computational biology can help in the design of effective therapies to overcome resistance. © 2015 S. Karger AG, Basel.

An opinion formation based binary optimization approach for feature selection

NASA Astrophysics Data System (ADS)

Hamedmoghadam, Homayoun; Jalili, Mahdi; Yu, Xinghuo

2018-02-01

This paper proposed a novel optimization method based on opinion formation in complex network systems. The proposed optimization technique mimics human-human interaction mechanism based on a mathematical model derived from social sciences. Our method encodes a subset of selected features to the opinion of an artificial agent and simulates the opinion formation process among a population of agents to solve the feature selection problem. The agents interact using an underlying interaction network structure and get into consensus in their opinions, while finding better solutions to the problem. A number of mechanisms are employed to avoid getting trapped in local minima. We compare the performance of the proposed method with a number of classical population-based optimization methods and a state-of-the-art opinion formation based method. Our experiments on a number of high dimensional datasets reveal outperformance of the proposed algorithm over others.

VMSoar: a cognitive agent for network security

NASA Astrophysics Data System (ADS)

Benjamin, David P.; Shankar-Iyer, Ranjita; Perumal, Archana

2005-03-01

VMSoar is a cognitive network security agent designed for both network configuration and long-term security management. It performs automatic vulnerability assessments by exploring a configuration"s weaknesses and also performs network intrusion detection. VMSoar is built on the Soar cognitive architecture, and benefits from the general cognitive abilities of Soar, including learning from experience, the ability to solve a wide range of complex problems, and use of natural language to interact with humans. The approach used by VMSoar is very different from that taken by other vulnerability assessment or intrusion detection systems. VMSoar performs vulnerability assessments by using VMWare to create a virtual copy of the target machine then attacking the simulated machine with a wide assortment of exploits. VMSoar uses this same ability to perform intrusion detection. When trying to understand a sequence of network packets, VMSoar uses VMWare to make a virtual copy of the local portion of the network and then attempts to generate the observed packets on the simulated network by performing various exploits. This approach is initially slow, but VMSoar"s learning ability significantly speeds up both vulnerability assessment and intrusion detection. This paper describes the design and implementation of VMSoar, and initial experiments with Windows NT and XP.

Modelling and simulating decision processes of linked lives: An approach based on concurrent processes and stochastic race.

PubMed

Warnke, Tom; Reinhardt, Oliver; Klabunde, Anna; Willekens, Frans; Uhrmacher, Adelinde M

2017-10-01

Individuals' decision processes play a central role in understanding modern migration phenomena and other demographic processes. Their integration into agent-based computational demography depends largely on suitable support by a modelling language. We are developing the Modelling Language for Linked Lives (ML3) to describe the diverse decision processes of linked lives succinctly in continuous time. The context of individuals is modelled by networks the individual is part of, such as family ties and other social networks. Central concepts, such as behaviour conditional on agent attributes, age-dependent behaviour, and stochastic waiting times, are tightly integrated in the language. Thereby, alternative decisions are modelled by concurrent processes that compete by stochastic race. Using a migration model, we demonstrate how this allows for compact description of complex decisions, here based on the Theory of Planned Behaviour. We describe the challenges for the simulation algorithm posed by stochastic race between multiple concurrent complex decisions.

Evolution of tag-mediated altruistic behavior in one-shot encounters on large-scale complex networks

NASA Astrophysics Data System (ADS)

Hadzibeganovic, Tarik; Lima, F. Welington S.; Stauffer, Dietrich

2012-11-01

An agent-based evolutionary model of tag-mediated altruism is studied on large-scale complex networks addressing multiplayer one-shot Prisoner’s Dilemma-like games with four competing strategies. Contrary to standard theoretical predictions, but in line with recent empirical findings, we observed that altruistic acts in non-repeated interactions can emerge as a natural consequence of recognition of heritable phenotypic traits such as visual tags, which enable the discrimination between potentially beneficial and unproductive encounters. Moreover, we identified topological regimes in which cooperation always prevails at short times, but where unconditional cooperators are favored over conditional tag-based helpers, even though the latter initially have a slight reproductive advantage. After very long times, we found that all four strategies appeared about equally often, meaning that only one quarter of agents refused cooperation egoistically. However, our study suggests that intra-tag generosity can quickly evolve to dominate over other strategies in spatially structured environments that are otherwise detrimental to cooperative behavior.

AST: Activity-Security-Trust driven modeling of time varying networks

PubMed Central

Wang, Jian; Xu, Jiake; Liu, Yanheng; Deng, Weiwen

2016-01-01

Network modeling is a flexible mathematical structure that enables to identify statistical regularities and structural principles hidden in complex systems. The majority of recent driving forces in modeling complex networks are originated from activity, in which an activity potential of a time invariant function is introduced to identify agents’ interactions and to construct an activity-driven model. However, the new-emerging network evolutions are already deeply coupled with not only the explicit factors (e.g. activity) but also the implicit considerations (e.g. security and trust), so more intrinsic driving forces behind should be integrated into the modeling of time varying networks. The agents undoubtedly seek to build a time-dependent trade-off among activity, security, and trust in generating a new connection to another. Thus, we reasonably propose the Activity-Security-Trust (AST) driven model through synthetically considering the explicit and implicit driving forces (e.g. activity, security, and trust) underlying the decision process. AST-driven model facilitates to more accurately capture highly dynamical network behaviors and figure out the complex evolution process, allowing a profound understanding of the effects of security and trust in driving network evolution, and improving the biases induced by only involving activity representations in analyzing the dynamical processes. PMID:26888717

Strategies and Rubrics for Teaching Complex Systems Theory to Novices (Invited)

NASA Astrophysics Data System (ADS)

Fichter, L. S.

2010-12-01

Bifurcation. Self-similarity. Fractal. Sensitive dependent. Agents. Self-organized criticality. Avalanche behavior. Power laws. Strange attractors. Emergence. The language of complexity is fundamentally different from the language of equilibrium. If students do not know these phenomena, and what they tell us about the pulse of dynamic systems, complex systems will be opaque. A complex system is a group of agents. (individual interacting units, like birds in a flock, sand grains in a ripple, or individual friction units along a fault zone), existing far from equilibrium, interacting through positive and negative feedbacks, following simple rules, forming interdependent, dynamic, evolutionary networks. Complex systems produce behaviors that cannot be predicted deductively from knowledge of the behaviors of the individual components themselves; they must be experienced. What complexity theory demonstrates is that, by following simple rules, all the agents end up coordinating their behavior—self organizing—so that what emerges is not chaos, but meaningful patterns. How can we introduce Freshman, non-science, general education students to complex systems theories, in 3 to 5 classes; in a way they really get it, and can use the principles to understand real systems? Complex systems theories are not a series of unconnected or disconnected equations or models; they are developed as narratives that makes sense of how all the pieces and properties are interrelated. The principles of complex systems must be taught as deliberately and systematically as the equilibrium principles normally taught; as, say, the systematic training from pre-algebra and geometry to algebra. We have developed a sequence of logically connected narratives (strategies and rubrics) that introduce complex systems principles using models that can be simulated in a computer, in class, in real time. The learning progression has a series of 12 models (e.g. logistic system, bifurcation diagrams, genetic algorithms, etc.) leading to 19 learning outcomes that encompass most of the universality properties that characterize complex systems. They are developed in a specific order to achieve specific ends of understanding. We use these models in various depths and formats in courses ranging from gened courses, to evolutionary systems and environmental systems, to upper level geology courses. Depending on the goals of a course, the learning outcomes can be applied to understanding many other complex systems; e.g. oscillating chemical reactions (reaction-diffusion and activator-inhibitor systems), autocatalytic networks, hysteresis (bistable) systems, networks, and the rise/collapse of complex societies. We use these and other complex systems concepts in various classes to talk about the origin of life, ecosystem organization, game theory, extinction events, and environmental system behaviors. The applications are almost endless. The complete learning progression with models, computer programs, experiments, and learning outcomes is available at: www.jmu.edu/geology/ComplexEvolutionarySystems/

Entropic determination of the phase transition in a coevolving opinion-formation model.

PubMed

Burgos, E; Hernández, Laura; Ceva, H; Perazzo, R P J

2015-03-01

We study an opinion formation model by the means of a coevolving complex network where the vertices represent the individuals, characterized by their evolving opinions, and the edges represent the interactions among them. The network adapts to the spreading of opinions in two ways: not only connected agents interact and eventually change their thinking but an agent may also rewire one of its links to a neighborhood holding the same opinion as his. The dynamics, based on a global majority rule, depends on an external parameter that controls the plasticity of the network. We show how the information entropy associated to the distribution of group sizes allows us to locate the phase transition between a phase of full consensus and another, where different opinions coexist. We also determine the minimum size of the most informative sampling. At the transition the distribution of the sizes of groups holding the same opinion is scale free.

Social power and opinion formation in complex networks

NASA Astrophysics Data System (ADS)

Jalili, Mahdi

2013-02-01

In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts-Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts-Strogatz networks could not significantly change the consensus profile.

The R-Shell approach - Using scheduling agents in complex distributed real-time systems

NASA Technical Reports Server (NTRS)

Natarajan, Swaminathan; Zhao, Wei; Goforth, Andre

1993-01-01

Large, complex real-time systems such as space and avionics systems are extremely demanding in their scheduling requirements. The current OS design approaches are quite limited in the capabilities they provide for task scheduling. Typically, they simply implement a particular uniprocessor scheduling strategy and do not provide any special support for network scheduling, overload handling, fault tolerance, distributed processing, etc. Our design of the R-Shell real-time environment fcilitates the implementation of a variety of sophisticated but efficient scheduling strategies, including incorporation of all these capabilities. This is accomplished by the use of scheduling agents which reside in the application run-time environment and are responsible for coordinating the scheduling of the application.

Evans blue dye-enhanced capillary-resolution photoacoustic microscopy in vivo

NASA Astrophysics Data System (ADS)

Yao, Junjie; Maslov, Konstantin; Hu, Song; Wang, Lihong V.

2009-09-01

Complete and continuous imaging of microvascular networks is crucial for a wide variety of biomedical applications. Photoacoustic tomography can provide high resolution microvascular imaging using hemoglobin within red blood cells (RBCs) as an endogenic contrast agent. However, intermittent RBC flow in capillaries results in discontinuous and fragmentary capillary images. To overcome this problem, we use Evans blue (EB) dye as a contrast agent for in vivo photoacoustic imaging. EB has strong optical absorption and distributes uniformly in the blood stream by chemically binding to albumin. With the help of EB, complete and continuous microvascular networks--especially capillaries--are imaged. The diffusion dynamics of EB leaving the blood stream and the clearance dynamics of the EB-albumin complex are also quantitatively investigated.

Master stability functions reveal diffusion-driven pattern formation in networks

NASA Astrophysics Data System (ADS)

Brechtel, Andreas; Gramlich, Philipp; Ritterskamp, Daniel; Drossel, Barbara; Gross, Thilo

2018-03-01

We study diffusion-driven pattern formation in networks of networks, a class of multilayer systems, where different layers have the same topology, but different internal dynamics. Agents are assumed to disperse within a layer by undergoing random walks, while they can be created or destroyed by reactions between or within a layer. We show that the stability of homogeneous steady states can be analyzed with a master stability function approach that reveals a deep analogy between pattern formation in networks and pattern formation in continuous space. For illustration, we consider a generalized model of ecological meta-food webs. This fairly complex model describes the dispersal of many different species across a region consisting of a network of individual habitats while subject to realistic, nonlinear predator-prey interactions. In this example, the method reveals the intricate dependence of the dynamics on the spatial structure. The ability of the proposed approach to deal with this fairly complex system highlights it as a promising tool for ecology and other applications.

Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks.

PubMed

Liu, Ming; Xu, Yang; Mohammed, Abdul-Wahid

2016-01-01

Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent's limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent's cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent's view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved.

A Novel Network Attack Audit System based on Multi-Agent Technology

NASA Astrophysics Data System (ADS)

Jianping, Wang; Min, Chen; Xianwen, Wu

A network attack audit system which includes network attack audit Agent, host audit Agent and management control center audit Agent is proposed. And the improved multi-agent technology is carried out in the network attack audit Agent which has achieved satisfactory audit results. The audit system in terms of network attack is just in-depth, and with the function improvement of network attack audit Agent, different attack will be better analyzed and audit. In addition, the management control center Agent should manage and analyze audit results from AA (or HA) and audit data on time. And the history files of network packets and host log data should also be audit to find deeper violations that cannot be found in real time.

The Physics of Traffic Congestion and Road Pricing in Transportation Planning

NASA Astrophysics Data System (ADS)

Levinson, David

2010-03-01

This presentation develops congestion theory and congestion pricing theory from its micro- foundations, the interaction of two or more vehicles. Using game theory, with a two- player game it is shown that the emergence of congestion depends on the players' relative valuations of early arrival, late arrival, and journey delay. Congestion pricing can be used as a cooperation mechanism to minimize total costs (if returned to the players). The analysis is then extended to the case of the three- player game, which illustrates congestion as a negative externality imposed on players who do not themselves contribute to it. A multi-agent model of travelers competing to utilize a roadway in time and space is presented. To realize the spillover effect among travelers, N-player games are constructed in which the strategy set includes N+1 strategies. We solve the N-player game (for N = 7) and find Nash equilibria if they exist. This model is compared to the bottleneck model. The results of numerical simulation show that the two models yield identical results in terms of lowest total costs and marginal costs when a social optimum exists. Moving from temporal dynamics to spatial complexity, using consistent agent- based techniques, we model the decision-making processes of users and infrastructure owner/operators to explore the welfare consequence of price competition, capacity choice, and product differentiation on congested transportation networks. Component models include: (1) An agent-based travel demand model wherein each traveler has learning capabilities and unique characteristics (e.g. value of time); (2) Econometric facility provision cost models; and (3) Representations of road authorities making pricing and capacity decisions. Different from small-network equilibrium models in prior literature, this agent- based model is applicable to pricing and investment analyses on large complex networks. The subsequent economic analysis focuses on the source, evolution, measurement, and impact of product differentiation with heterogeneous users on a mixed ownership network (with tolled and untolled roads). Two types of product differentiation in the presence of toll roads, path differentiation and space differentiation, are defined and measured for a base case and several variants with different types of price and capacity competition and with various degrees of user heterogeneity. The findings favor a fixed-rate road pricing policy compared to complete pricing freedom on toll roads. It is also shown that the relationship between net social benefit and user heterogeneity is not monotonic on a complex network with toll roads.

Is there any connection between the network morphology and the fluctuations of the stock market index?

NASA Astrophysics Data System (ADS)

Stefan, F. M.; Atman, A. P. F.

2015-02-01

Models which consider behavioral aspects of the investors have attracted increasing interest in the Finance and Econophysics literature in the last years. Different behavioral profiles (imitation, anti-imitation, indifference) were proposed for the investors, which take their decision based on their trust network (neighborhood). Results from agent-based models have shown that most of the features observed in actual stock market indices can be replicated in simulations. Here, we present a deeper investigation of an agent based model considering different network morphologies (regular, random, small-world) for the investors' trust network, in an attempt to answer the question raised in the title. We study the model by considering four scenarios for the investors and different initial conditions to analyze their influence in the stock market fluctuations. We have characterized the stationary limit for each scenario tested, focusing on the changes introduced when complex networks were used, and calculated the Hurst exponent in some cases. Simulations showed interesting results suggesting that the fluctuations of the stock market index are strongly affected by the network morphology, a remarkable result which we believe was never reported or predicted before.

Robust scalable stabilisability conditions for large-scale heterogeneous multi-agent systems with uncertain nonlinear interactions: towards a distributed computing architecture

NASA Astrophysics Data System (ADS)

Manfredi, Sabato

2016-06-01

Large-scale dynamic systems are becoming highly pervasive in their occurrence with applications ranging from system biology, environment monitoring, sensor networks, and power systems. They are characterised by high dimensionality, complexity, and uncertainty in the node dynamic/interactions that require more and more computational demanding methods for their analysis and control design, as well as the network size and node system/interaction complexity increase. Therefore, it is a challenging problem to find scalable computational method for distributed control design of large-scale networks. In this paper, we investigate the robust distributed stabilisation problem of large-scale nonlinear multi-agent systems (briefly MASs) composed of non-identical (heterogeneous) linear dynamical systems coupled by uncertain nonlinear time-varying interconnections. By employing Lyapunov stability theory and linear matrix inequality (LMI) technique, new conditions are given for the distributed control design of large-scale MASs that can be easily solved by the toolbox of MATLAB. The stabilisability of each node dynamic is a sufficient assumption to design a global stabilising distributed control. The proposed approach improves some of the existing LMI-based results on MAS by both overcoming their computational limits and extending the applicative scenario to large-scale nonlinear heterogeneous MASs. Additionally, the proposed LMI conditions are further reduced in terms of computational requirement in the case of weakly heterogeneous MASs, which is a common scenario in real application where the network nodes and links are affected by parameter uncertainties. One of the main advantages of the proposed approach is to allow to move from a centralised towards a distributed computing architecture so that the expensive computation workload spent to solve LMIs may be shared among processors located at the networked nodes, thus increasing the scalability of the approach than the network size. Finally, a numerical example shows the applicability of the proposed method and its advantage in terms of computational complexity when compared with the existing approaches.

Models for the modern power grid

NASA Astrophysics Data System (ADS)

Nardelli, Pedro H. J.; Rubido, Nicolas; Wang, Chengwei; Baptista, Murilo S.; Pomalaza-Raez, Carlos; Cardieri, Paulo; Latva-aho, Matti

2014-10-01

This article reviews different kinds of models for the electric power grid that can be used to understand the modern power system, the smart grid. From the physical network to abstract energy markets, we identify in the literature different aspects that co-determine the spatio-temporal multilayer dynamics of power system. We start our review by showing how the generation, transmission and distribution characteristics of the traditional power grids are already subject to complex behaviour appearing as a result of the the interplay between dynamics of the nodes and topology, namely synchronisation and cascade effects. When dealing with smart grids, the system complexity increases even more: on top of the physical network of power lines and controllable sources of electricity, the modernisation brings information networks, renewable intermittent generation, market liberalisation, prosumers, among other aspects. In this case, we forecast a dynamical co-evolution of the smart grid and other kind of networked systems that cannot be understood isolated. This review compiles recent results that model electric power grids as complex systems, going beyond pure technological aspects. From this perspective, we then indicate possible ways to incorporate the diverse co-evolving systems into the smart grid model using, for example, network theory and multi-agent simulation.

Controlling collective dynamics in complex minority-game resource-allocation systems

NASA Astrophysics Data System (ADS)

Zhang, Ji-Qiang; Huang, Zi-Gang; Dong, Jia-Qi; Huang, Liang; Lai, Ying-Cheng

2013-05-01

Resource allocation takes place in various kinds of real-world complex systems, such as traffic systems, social services institutions or organizations, or even ecosystems. The fundamental principle underlying complex resource-allocation dynamics is Boolean interactions associated with minority games, as resources are generally limited and agents tend to choose the least used resource based on available information. A common but harmful dynamical behavior in resource-allocation systems is herding, where there are time intervals during which a large majority of the agents compete for a few resources, leaving many other resources unused. Accompanying the herd behavior is thus strong fluctuations with time in the number of resources being used. In this paper, we articulate and establish that an intuitive control strategy, namely pinning control, is effective at harnessing the herding dynamics. In particular, by fixing the choices of resources for a few agents while leaving the majority of the agents free, herding can be eliminated completely. Our investigation is systematic in that we consider random and targeted pinning and a variety of network topologies, and we carry out a comprehensive analysis in the framework of mean-field theory to understand the working of control. The basic philosophy is then that, when a few agents waive their freedom to choose resources by receiving sufficient incentives, the majority of the agents benefit in that they will make fair, efficient, and effective use of the available resources. Our work represents a basic and general framework to address the fundamental issue of fluctuations in complex dynamical systems with significant applications to social, economical, and political systems.

Society, sex, and STIs: human behavior and the evolution of sexually transmitted diseases and their agents.

PubMed

Nahmias, Susa Beckman; Nahmias, Daniella

2011-08-01

The last few decades have provided new perspectives on the increasingly complex interrelationships between the evolutionary epidemiology of STDs and their agents, human sexuality, and economic, social, cultural, and technological developments. Rapidly emerging HIV/AIDS, globalization, migration, and information technology are some factors that stress the importance of focusing on how old and new sexually transmitted infections (STIs) are spread, both in and between networks and populations. This review of determinants of STI transmission emphasizes their impact on disease prevalence and transmission, as well as their potential for affecting the agents themselves--directly or indirectly. Interventions aiming to control the spread of STIs and HIV on the different levels of society need to be adapted to the specific environment and need to integrate social structures, such as economic and gender inequality and mobility, as well as the great variability and complexity of sexual behavior. © 2011 New York Academy of Sciences.

Network evolution by nonlinear preferential rewiring of edges

NASA Astrophysics Data System (ADS)

Xu, Xin-Jian; Hu, Xiao-Ming; Zhang, Li-Jie

2011-06-01

The mathematical framework for small-world networks proposed in a seminal paper by Watts and Strogatz sparked a widespread interest in modeling complex networks in the past decade. However, most of research contributing to static models is in contrast to real-world dynamic networks, such as social and biological networks, which are characterized by rearrangements of connections among agents. In this paper, we study dynamic networks evolved by nonlinear preferential rewiring of edges. The total numbers of vertices and edges of the network are conserved, but edges are continuously rewired according to the nonlinear preference. Assuming power-law kernels with exponents α and β, the network structures in stationary states display a distinct behavior, depending only on β. For β>1, the network is highly heterogeneous with the emergence of starlike structures. For β<1, the network is widely homogeneous with a typical connectivity. At β=1, the network is scale free with an exponential cutoff.

How new concepts become universal scientific approaches: insights from citation network analysis of agent-based complex systems science.

PubMed

Vincenot, Christian E

2018-03-14

Progress in understanding and managing complex systems comprised of decision-making agents, such as cells, organisms, ecosystems or societies, is-like many scientific endeavours-limited by disciplinary boundaries. These boundaries, however, are moving and can actively be made porous or even disappear. To study this process, I advanced an original bibliometric approach based on network analysis to track and understand the development of the model-based science of agent-based complex systems (ACS). I analysed research citations between the two communities devoted to ACS research, namely agent-based (ABM) and individual-based modelling (IBM). Both terms refer to the same approach, yet the former is preferred in engineering and social sciences, while the latter prevails in natural sciences. This situation provided a unique case study for grasping how a new concept evolves distinctly across scientific domains and how to foster convergence into a universal scientific approach. The present analysis based on novel hetero-citation metrics revealed the historical development of ABM and IBM, confirmed their past disjointedness, and detected their progressive merger. The separation between these synonymous disciplines had silently opposed the free flow of knowledge among ACS practitioners and thereby hindered the transfer of methodological advances and the emergence of general systems theories. A surprisingly small number of key publications sparked the ongoing fusion between ABM and IBM research. Beside reviews raising awareness of broad-spectrum issues, generic protocols for model formulation and boundary-transcending inference strategies were critical means of science integration. Accessible broad-spectrum software similarly contributed to this change. From the modelling viewpoint, the discovery of the unification of ABM and IBM demonstrates that a wide variety of systems substantiate the premise of ACS research that microscale behaviours of agents and system-level dynamics are inseparably bound. © 2018 The Author(s).

Self-organized criticality in a network of economic agents with finite consumption

NASA Astrophysics Data System (ADS)

da Cruz, João P.; Lind, Pedro G.

2012-02-01

We introduce a minimal agent model to explain the emergence of heavy-tailed return distributions as a result of self-organized criticality. The model assumes that agents trade their economic outputs with each other composing a complex network of agents and connections. Further, the incoming degree of an agent is proportional to the demand on its goods, while its outgoing degree is proportional to the supply. The model considers a collection of economic agents which are attracted to establish connections among them to make an exchange at a price formed by supply and demand. With our model we are able to reproduce the evolution of the return of macroscopic quantities (indices) and to correctly retrieve the non-trivial exponent value characterizing the amplitude of drops in several indices in financial markets, relating it to the underlying topology of connections. The distribution of drops in empirical data is obtained by counting the number of successive time-steps for which a decrease in the index value is observed. All eight financial indexes show an exponent m˜5/2. Finally, we present mean-field calculations of the critical exponents, and of the scaling relation m=3/2 γ-1 between the exponent m for the distribution of drops and the topological exponent γ for the degree distribution.

A Complex Network Approach to Stylometry

PubMed Central

Amancio, Diego Raphael

2015-01-01

Statistical methods have been widely employed to study the fundamental properties of language. In recent years, methods from complex and dynamical systems proved useful to create several language models. Despite the large amount of studies devoted to represent texts with physical models, only a limited number of studies have shown how the properties of the underlying physical systems can be employed to improve the performance of natural language processing tasks. In this paper, I address this problem by devising complex networks methods that are able to improve the performance of current statistical methods. Using a fuzzy classification strategy, I show that the topological properties extracted from texts complement the traditional textual description. In several cases, the performance obtained with hybrid approaches outperformed the results obtained when only traditional or networked methods were used. Because the proposed model is generic, the framework devised here could be straightforwardly used to study similar textual applications where the topology plays a pivotal role in the description of the interacting agents. PMID:26313921

Design and Implementation of a Unified Command and Control Architecture for Multiple Cooperative Unmanned Vehicles Utilizing Commercial Off the Shelf Components

DTIC Science & Technology

2015-12-24

network, allowing each to communicate with all nodes on the network. Additionally , the transmission power will be turned down to the lowest value . This...reserved for these unmanned agents are gen- erally too dull, dirty, dangerous, or difficult for onboard human pilots to complete. Additionally , the use...architectures do have a much higher level of complexity than single vehicle architectures. Additionally , the weight, size, and power limitations of the

Emergent organization in a model market

NASA Astrophysics Data System (ADS)

Yadav, Avinash Chand; Manchanda, Kaustubh; Ramaswamy, Ramakrishna

2017-09-01

We study the collective behaviour of interacting agents in a simple model of market economics that was originally introduced by Nørrelykke and Bak. A general theoretical framework for interacting traders on an arbitrary network is presented, with the interaction consisting of buying (namely consumption) and selling (namely production) of commodities. Extremal dynamics is introduced by having the agent with least profit in the market readjust prices, causing the market to self-organize. In addition to examining this model market on regular lattices in two-dimensions, we also study the cases of random complex networks both with and without community structures. Fluctuations in an activity signal exhibit properties that are characteristic of avalanches observed in models of self-organized criticality, and these can be described by power-law distributions when the system is in the critical state.

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

NASA Astrophysics Data System (ADS)

Truong, Quang Duc; Kakihana, Masato

2012-06-01

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

The evolving cobweb of relations among partially rational investors.

PubMed

DeLellis, Pietro; DiMeglio, Anna; Garofalo, Franco; Lo Iudice, Francesco

2017-01-01

To overcome the limitations of neoclassical economics, researchers have leveraged tools of statistical physics to build novel theories. The idea was to elucidate the macroscopic features of financial markets from the interaction of its microscopic constituents, the investors. In this framework, the model of the financial agents has been kept separate from that of their interaction. Here, instead, we explore the possibility of letting the interaction topology emerge from the model of the agents' behavior. Then, we investigate how the emerging cobweb of relationship affects the overall market dynamics. To this aim, we leverage tools from complex systems analysis and nonlinear dynamics, and model the network of mutual influence as the output of a dynamical system describing the edge evolution. In this work, the driver of the link evolution is the relative reputation between possibly coupled agents. The reputation is built differently depending on the extent of rationality of the investors. The continuous edge activation or deactivation induces the emergence of leaders and of peculiar network structures, typical of real influence networks. The subsequent impact on the market dynamics is investigated through extensive numerical simulations in selected scenarios populated by partially rational investors.

Using Swarming Agents for Scalable Security in Large Network Environments

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

Crouse, Michael; White, Jacob L.; Fulp, Errin W.

2011-09-23

The difficulty of securing computer infrastructures increases as they grow in size and complexity. Network-based security solutions such as IDS and firewalls cannot scale because of exponentially increasing computational costs inherent in detecting the rapidly growing number of threat signatures. Hostbased solutions like virus scanners and IDS suffer similar issues, and these are compounded when enterprises try to monitor these in a centralized manner. Swarm-based autonomous agent systems like digital ants and artificial immune systems can provide a scalable security solution for large network environments. The digital ants approach offers a biologically inspired design where each ant in the virtualmore » colony can detect atoms of evidence that may help identify a possible threat. By assembling the atomic evidences from different ant types the colony may detect the threat. This decentralized approach can require, on average, fewer computational resources than traditional centralized solutions; however there are limits to its scalability. This paper describes how dividing a large infrastructure into smaller managed enclaves allows the digital ant framework to effectively operate in larger environments. Experimental results will show that using smaller enclaves allows for more consistent distribution of agents and results in faster response times.« less

Design of Hybrid Mobile Communication Networks for Planetary Exploration

NASA Technical Reports Server (NTRS)

Alena, Richard L.; Ossenfort, John; Lee, Charles; Walker, Edward; Stone, Thom

2004-01-01

The Mobile Exploration System Project (MEX) at NASA Ames Research Center has been conducting studies into hybrid communication networks for future planetary missions. These networks consist of space-based communication assets connected to ground-based Internets and planetary surface-based mobile wireless networks. These hybrid mobile networks have been deployed in rugged field locations in the American desert and the Canadian arctic for support of science and simulation activities on at least six occasions. This work has been conducted over the past five years resulting in evolving architectural complexity, improved component characteristics and better analysis and test methods. A rich set of data and techniques have resulted from the development and field testing of the communication network during field expeditions such as the Haughton Mars Project and NASA Mobile Agents Project.

PAXIP1 potentiates the combination of WEE1 inhibitor AZD1775 and platinum agents in lung cancer

PubMed Central

Jhuraney, Ankita; Woods, Nicholas T.; Wright, Gabriela; Rix, Lily; Kinose, Fumi; Kroeger, Jodi L.; Remily-Wood, Elizabeth; Cress, W. Douglas; Koomen, John M.; Brantley, Stephen G.; Gray, Jhanelle E.; Haura, Eric B.; Rix, Uwe; Monteiro, Alvaro N.

2016-01-01

The DNA damage response (DDR) involves a complex network of signaling events mediated by modular protein domains such as the BRCT (BRCA1 C-terminal) domain. Thus, proteins that interact with BRCT domains and are a part of the DDR constitute potential targets for sensitization to DNA damaging chemotherapy agents. We performed a pharmacological screen to evaluate seventeen kinases, identified in a BRCT-mediated interaction network as targets to enhance platinum-based chemotherapy in lung cancer. Inhibition of mitotic kinase WEE1 was found to have the most effective response in combination with platinum compounds in lung cancer cell lines. In the BRCT-mediated interaction network, WEE1 was found in complex with PAXIP1, a protein containing six BRCT domains involved in transcription and in the cellular response to DNA damage. We show that PAXIP1 BRCT domains regulate WEE1-mediated phosphorylation of CDK1. Further, ectopic expression of PAXIP1 promotes enhanced caspase 3-mediated apoptosis in cells treated with WEE1 inhibitor AZD1775 (formerly, MK-1775) and cisplatin compared with cells treated with AZD1775 alone. Cell lines and patient-derived xenograft models expressing both PAXIP1 and WEE1 exhibited synergistic effects of AZD1775 and cisplatin. In summary, PAXIP1 is involved in sensitizing lung cancer cells to the WEE1 inhibitor AZD1775 in combination with platinum-based treatment. We propose that WEE1 and PAXIP1 levels may be used as mechanism-based biomarkers of response when WEE1 inhibitor AZD1775 is combined with DNA damaging agents. PMID:27196765

Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation

PubMed Central

Kitson, Alison; Brook, Alan; Harvey, Gill; Jordan, Zoe; Marshall, Rhianon; O’Shea, Rebekah; Wilson, David

2018-01-01

Many representations of the movement of healthcare knowledge through society exist, and multiple models for the translation of evidence into policy and practice have been articulated. Most are linear or cyclical and very few come close to reflecting the dense and intricate relationships, systems and politics of organizations and the processes required to enact sustainable improvements. We illustrate how using complexity and network concepts can better inform knowledge translation (KT) and argue that changing the way we think and talk about KT could enhance the creation and movement of knowledge throughout those systems needing to develop and utilise it. From our theoretical refinement, we propose that KT is a complex network composed of five interdependent sub-networks, or clusters, of key processes (problem identification [PI], knowledge creation [KC], knowledge synthesis [KS], implementation [I], and evaluation [E]) that interact dynamically in different ways at different times across one or more sectors (community; health; government; education; research for example). We call this the KT Complexity Network, defined as a network that optimises the effective, appropriate and timely creation and movement of knowledge to those who need it in order to improve what they do. Activation within and throughout any one of these processes and systems depends upon the agents promoting the change, successfully working across and between multiple systems and clusters. The case is presented for moving to a way of thinking about KT using complexity and network concepts. This extends the thinking that is developing around integrated KT approaches. There are a number of policy and practice implications that need to be considered in light of this shift in thinking. PMID:29524952

Multiobjective Optimal Control Methodology for the Analysis of Certain Sociodynamic Problems

DTIC Science & Technology

2009-03-01

but less expensive in both time and memory. 137 References [1] R. Albert and A-L Barabasi. Statistical mechanics of complex networks. Reviews of Modern...Review, E(51):4282–4286, 1995. [24] D. Helbing, P. Molnar, and F. Schweitzer . Computer simulation of pedestrian dynamics and trail formation. May 1998...Patterson AFB, OH, 2001. [49] F. Schweitzer . Brownian Agents and Active Particles. Springer, Santa Fe, NM, 2003. [50] P. Sen. Complexities of social

Sustainable development goals for global health: facilitating good governance in a complex environment.

PubMed

Haffeld, Just

2013-11-01

Increasing complexity is following in the wake of rampant globalization. Thus, the discussion about Sustainable Development Goals (SDGs) requires new thinking that departs from a critique of current policy tools in exploration of a complexity-friendly approach. This article argues that potential SDGs should: treat stakeholders, like states, business and civil society actors, as agents on different aggregate levels of networks; incorporate good governance processes that facilitate early involvement of relevant resources, as well as equitable participation, consultative processes, and regular policy and programme implementation reviews; anchor adoption and enforcement of such rules to democratic processes in accountable organizations; and include comprehensive systems evaluations, including procedural indicators. A global framework convention for health could be a suitable instrument for handling some of the challenges related to the governance of a complex environment. It could structure and legitimize government involvement, engage stakeholders, arrange deliberation and decision-making processes with due participation and regular policy review, and define minimum standards for health services. A monitoring scheme could ensure that agents in networks comply according to whole-systems targets, locally defined outcome indicators, and process indicators, thus resolving the paradox of government control vs. local policy space. A convention could thus exploit the energy created in the encounter between civil society, international organizations and national authorities. Copyright © 2013 Reproductive Health Matters. Published by Elsevier Ltd. All rights reserved.

Multi Sensor Fusion Using Fitness Adaptive Differential Evolution

NASA Astrophysics Data System (ADS)

Giri, Ritwik; Ghosh, Arnob; Chowdhury, Aritra; Das, Swagatam

The rising popularity of multi-source, multi-sensor networks supports real-life applications calls for an efficient and intelligent approach to information fusion. Traditional optimization techniques often fail to meet the demands. The evolutionary approach provides a valuable alternative due to its inherent parallel nature and its ability to deal with difficult problems. We present a new evolutionary approach based on a modified version of Differential Evolution (DE), called Fitness Adaptive Differential Evolution (FiADE). FiADE treats sensors in the network as distributed intelligent agents with various degrees of autonomy. Existing approaches based on intelligent agents cannot completely answer the question of how their agents could coordinate their decisions in a complex environment. The proposed approach is formulated to produce good result for the problems that are high-dimensional, highly nonlinear, and random. The proposed approach gives better result in case of optimal allocation of sensors. The performance of the proposed approach is compared with an evolutionary algorithm coordination generalized particle model (C-GPM).

Photoacoustic microscopy using Evans Blue dye as a contrast agent

NASA Astrophysics Data System (ADS)

Yao, Junjie; Maslov, Konstantin I.; Hu, Song; Wang, Lihong V.

2010-02-01

Complete and continuous imaging of microvascular networks is crucial for a wide variety of biomedical applications. Photoacoustic tomography can provide high resolution microvascular imaging using hemoglobin within red blood cells (RBC) as an endogenous contrast agent. However, intermittent RBC flow in capillaries results in discontinuous and fragmentary capillary images. To overcome this problem, we used Evans Blue (EB) dye as a contrast agent for in vivo photoacoustic imaging. EB has strong optical absorption at 610 nm and distributes uniformly in the blood stream by chemically binding to albumin. By intravenous injection of EB (6%, 200 μL), complete and continuous microvascular networks-especially capillaries-of the ears of nude mice were imaged. The diffusion of EB (3%, 100 μL) leaving the blood stream was monitored for 2 hours. At lower administration dose of EB (3%, 50 μL), the clearance of the EB-albumin complex was imaged for 10 days and quantitatively investigated using a two-compartment model.

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

NASA Technical Reports Server (NTRS)

Alena, Richard I.; Lee, Charles

2004-01-01

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Emergent adaptive behaviour of GRN-controlled simulated robots in a changing environment.

PubMed

Yao, Yao; Storme, Veronique; Marchal, Kathleen; Van de Peer, Yves

2016-01-01

We developed a bio-inspired robot controller combining an artificial genome with an agent-based control system. The genome encodes a gene regulatory network (GRN) that is switched on by environmental cues and, following the rules of transcriptional regulation, provides output signals to actuators. Whereas the genome represents the full encoding of the transcriptional network, the agent-based system mimics the active regulatory network and signal transduction system also present in naturally occurring biological systems. Using such a design that separates the static from the conditionally active part of the gene regulatory network contributes to a better general adaptive behaviour. Here, we have explored the potential of our platform with respect to the evolution of adaptive behaviour, such as preying when food becomes scarce, in a complex and changing environment and show through simulations of swarm robots in an A-life environment that evolution of collective behaviour likely can be attributed to bio-inspired evolutionary processes acting at different levels, from the gene and the genome to the individual robot and robot population.

Emergent adaptive behaviour of GRN-controlled simulated robots in a changing environment

PubMed Central

Yao, Yao; Storme, Veronique; Marchal, Kathleen

2016-01-01

We developed a bio-inspired robot controller combining an artificial genome with an agent-based control system. The genome encodes a gene regulatory network (GRN) that is switched on by environmental cues and, following the rules of transcriptional regulation, provides output signals to actuators. Whereas the genome represents the full encoding of the transcriptional network, the agent-based system mimics the active regulatory network and signal transduction system also present in naturally occurring biological systems. Using such a design that separates the static from the conditionally active part of the gene regulatory network contributes to a better general adaptive behaviour. Here, we have explored the potential of our platform with respect to the evolution of adaptive behaviour, such as preying when food becomes scarce, in a complex and changing environment and show through simulations of swarm robots in an A-life environment that evolution of collective behaviour likely can be attributed to bio-inspired evolutionary processes acting at different levels, from the gene and the genome to the individual robot and robot population. PMID:28028477

Diversity of multilayer networks and its impact on collaborating epidemics

NASA Astrophysics Data System (ADS)

Min, Yong; Hu, Jiaren; Wang, Weihong; Ge, Ying; Chang, Jie; Jin, Xiaogang

2014-12-01

Interacting epidemics on diverse multilayer networks are increasingly important in modeling and analyzing the diffusion processes of real complex systems. A viral agent spreading on one layer of a multilayer network can interact with its counterparts by promoting (cooperative interaction), suppressing (competitive interaction), or inducing (collaborating interaction) its diffusion on other layers. Collaborating interaction displays different patterns: (i) random collaboration, where intralayer or interlayer induction has the same probability; (ii) concentrating collaboration, where consecutive intralayer induction is guaranteed with a probability of 1; and (iii) cascading collaboration, where consecutive intralayer induction is banned with a probability of 0. In this paper, we develop a top-bottom framework that uses only two distributions, the overlaid degree distribution and edge-type distribution, to model collaborating epidemics on multilayer networks. We then state the response of three collaborating patterns to structural diversity (evenness and difference of network layers). For viral agents with small transmissibility, we find that random collaboration is more effective in networks with higher diversity (high evenness and difference), while the concentrating pattern is more suitable in uneven networks. Interestingly, the cascading pattern requires a network with moderate difference and high evenness, and the moderately uneven coupling of multiple network layers can effectively increase robustness to resist cascading failure. With large transmissibility, however, we find that all collaborating patterns are more effective in high-diversity networks. Our work provides a systemic analysis of collaborating epidemics on multilayer networks. The results enhance our understanding of biotic and informative diffusion through multiple vectors.

An agent-based hydroeconomic model to evaluate water policies in Jordan

NASA Astrophysics Data System (ADS)

Yoon, J.; Gorelick, S.

2014-12-01

Modern water systems can be characterized by a complex network of institutional and private actors that represent competing sectors and interests. Identifying solutions to enhance water security in such systems calls for analysis that can adequately account for this level of complexity and interaction. Our work focuses on the development of a hierarchical, multi-agent, hydroeconomic model that attempts to realistically represent complex interactions between hydrologic and multi-faceted human systems. The model is applied to Jordan, one of the most water-poor countries in the world. In recent years, the water crisis in Jordan has escalated due to an ongoing drought and influx of refugees from regional conflicts. We adopt a modular approach in which biophysical modules simulate natural and engineering phenomena, and human modules represent behavior at multiple scales of decision making. The human modules employ agent-based modeling, in which agents act as autonomous decision makers at the transboundary, state, organizational, and user levels. A systematic nomenclature and conceptual framework is used to characterize model agents and modules. Concepts from the Unified Modeling Language (UML) are adopted to promote clear conceptualization of model classes and process sequencing, establishing a foundation for full deployment of the integrated model in a scalable object-oriented programming environment. Although the framework is applied to the Jordanian water context, it is generalizable to other regional human-natural freshwater supply systems.

Topological resilience in non-normal networked systems

NASA Astrophysics Data System (ADS)

Asllani, Malbor; Carletti, Timoteo

2018-04-01

The network of interactions in complex systems strongly influences their resilience and the system capability to resist external perturbations or structural damages and to promptly recover thereafter. The phenomenon manifests itself in different domains, e.g., parasitic species invasion in ecosystems or cascade failures in human-made networks. Understanding the topological features of the networks that affect the resilience phenomenon remains a challenging goal for the design of robust complex systems. We hereby introduce the concept of non-normal networks, namely networks whose adjacency matrices are non-normal, propose a generating model, and show that such a feature can drastically change the global dynamics through an amplification of the system response to exogenous disturbances and eventually impact the system resilience. This early stage transient period can induce the formation of inhomogeneous patterns, even in systems involving a single diffusing agent, providing thus a new kind of dynamical instability complementary to the Turing one. We provide, first, an illustrative application of this result to ecology by proposing a mechanism to mute the Allee effect and, second, we propose a model of virus spreading in a population of commuters moving using a non-normal transport network, the London Tube.

An Agent-Based Model of Private Woodland Owner Management Behavior Using Social Interactions, Information Flow, and Peer-To-Peer Networks

PubMed Central

Huff, Emily Silver; Leahy, Jessica E.; Hiebeler, David; Weiskittel, Aaron R.; Noblet, Caroline L.

2015-01-01

Privately owned woodlands are an important source of timber and ecosystem services in North America and worldwide. Impacts of management on these ecosystems and timber supply from these woodlands are difficult to estimate because complex behavioral theory informs the owner’s management decisions. The decision-making environment consists of exogenous market factors, internal cognitive processes, and social interactions with fellow landowners, foresters, and other rural community members. This study seeks to understand how social interactions, information flow, and peer-to-peer networks influence timber harvesting behavior using an agent-based model. This theoretical model includes forested polygons in various states of ‘harvest readiness’ and three types of agents: forest landowners, foresters, and peer leaders (individuals trained in conservation who use peer-to-peer networking). Agent rules, interactions, and characteristics were parameterized with values from existing literature and an empirical survey of forest landowner attitudes, intentions, and demographics. The model demonstrates that as trust in foresters and peer leaders increases, the percentage of the forest that is harvested sustainably increases. Furthermore, peer leaders can serve to increase landowner trust in foresters. Model output and equations will inform forest policy and extension/outreach efforts. The model also serves as an important testing ground for new theories of landowner decision making and behavior. PMID:26562429

Equilibria, information and frustration in heterogeneous network games with conflicting preferences

NASA Astrophysics Data System (ADS)

Mazzoli, M.; Sánchez, A.

2017-11-01

Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has addressed this issue by combining the physics of complex networks with a description of interactions in terms of evolutionary game theory. We here take this research a step further by introducing a most salient societal factor such as the individuals’ preferences, a characteristic that is key to understanding much of the social phenomenology these days. We consider a heterogeneous, agent-based model in which agents interact strategically with their neighbors, but their preferences and payoffs for the possible actions differ. We study how such a heterogeneous network behaves under evolutionary dynamics and different strategic interactions, namely coordination games and best shot games. With this model we study the emergence of the equilibria predicted analytically in random graphs under best response dynamics, and we extend this test to unexplored contexts like proportional imitation and scale free networks. We show that some theoretically predicted equilibria do not arise in simulations with incomplete information, and we demonstrate the importance of the graph topology and the payoff function parameters for some games. Finally, we discuss our results with the available experimental evidence on coordination games, showing that our model agrees better with the experiment than standard economic theories, and draw hints as to how to maximize social efficiency in situations of conflicting preferences.

Competition in a Social Structure

NASA Astrophysics Data System (ADS)

Legara, Erika Fille; Longjas, Anthony; Batac, Rene

Complex adaptive agents develop strategies in the presence of competition. In modern human societies, there is an inherent sense of locality when describing inter-agent dynamics because of its network structure. One then wonders whether the traditional advertising schemes that are globally publicized and target random individuals are as effective in attracting a larger portion of the population as those that take advantage of local neighborhoods, such as "word-of-mouth" marketing schemes. Here, we demonstrate using a differential equation model that schemes targeting local cliques within the network are more successful at gaining a larger share of the population than those that target users randomly at a global scale (e.g., television commercials, print ads, etc.). This suggests that success in the competition is dependent not only on the number of individuals in the population but also on how they are connected in the network. We further show that the model is general in nature by considering examples of competition dynamics, particularly those of business competition and language death.

Nanocelluloses from jute fibers and their nanocomposites with natural rubber: Preparation and characterization.

PubMed

Thomas, Martin George; Abraham, Eldho; Jyotishkumar, P; Maria, Hanna J; Pothen, Laly A; Thomas, Sabu

2015-11-01

Nanocellulose fibers having an average diameter of 50nm were isolated from raw jute fibers by steam explosion process. The isolation of nanocellulose from jute fibers by this extraction process is proved by SEM, XRD, FTIR, birefringence and TEM characterizations. This nanocellulose was used as the reinforcing agent in natural rubber (NR) latex along with crosslinking agents to prepare crosslinked nanocomposite films. The effects of nanocellulose loading on the morphology and mechanics of the nanocomposites have been carefully analyzed. Significant improvements in the Young's modulus and tensile strength of the nanocomposite were observed because of the reinforcing ability of the nanocellulose in the rubber matrix. A mechanism is suggested for the formation of the Zn-cellulose complex. The three-dimensional network of cellulose nanofibers (cellulose/cellulose network and Zn/cellulose network) in the NR matrix plays a major role in improving the properties of the crosslinked nanocomposites. Copyright © 2015 Elsevier B.V. All rights reserved.

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

Integrating Transcriptomic and Proteomic Data Using Predictive Regulatory Network Models of Host Response to Pathogens

PubMed Central

Chasman, Deborah; Walters, Kevin B.; Lopes, Tiago J. S.; Eisfeld, Amie J.; Kawaoka, Yoshihiro; Roy, Sushmita

2016-01-01

Mammalian host response to pathogenic infections is controlled by a complex regulatory network connecting regulatory proteins such as transcription factors and signaling proteins to target genes. An important challenge in infectious disease research is to understand molecular similarities and differences in mammalian host response to diverse sets of pathogens. Recently, systems biology studies have produced rich collections of omic profiles measuring host response to infectious agents such as influenza viruses at multiple levels. To gain a comprehensive understanding of the regulatory network driving host response to multiple infectious agents, we integrated host transcriptomes and proteomes using a network-based approach. Our approach combines expression-based regulatory network inference, structured-sparsity based regression, and network information flow to infer putative physical regulatory programs for expression modules. We applied our approach to identify regulatory networks, modules and subnetworks that drive host response to multiple influenza infections. The inferred regulatory network and modules are significantly enriched for known pathways of immune response and implicate apoptosis, splicing, and interferon signaling processes in the differential response of viral infections of different pathogenicities. We used the learned network to prioritize regulators and study virus and time-point specific networks. RNAi-based knockdown of predicted regulators had significant impact on viral replication and include several previously unknown regulators. Taken together, our integrated analysis identified novel module level patterns that capture strain and pathogenicity-specific patterns of expression and helped identify important regulators of host response to influenza infection. PMID:27403523

Maintaining Limited-Range Connectivity Among Second-Order Agents

DTIC Science & Technology

2016-07-07

we consider ad-hoc networks of robotic agents with double integrator dynamics. For such networks, the connectivity maintenance problems are: (i) do...hoc networks of mobile autonomous agents. This loose ter- minology refers to groups of robotic agents with limited mobility and communica- tion...connectivity can be preserved. 3.1. Networks of robotic agents with second-order dynamics and the connectivity maintenance problem. We begin by

Cyber Security Research Frameworks For Coevolutionary Network Defense

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

Rush, George D.; Tauritz, Daniel Remy

Several architectures have been created for developing and testing systems used in network security, but most are meant to provide a platform for running cyber security experiments as opposed to automating experiment processes. In the first paper, we propose a framework termed Distributed Cyber Security Automation Framework for Experiments (DCAFE) that enables experiment automation and control in a distributed environment. Predictive analysis of adversaries is another thorny issue in cyber security. Game theory can be used to mathematically analyze adversary models, but its scalability limitations restrict its use. Computational game theory allows us to scale classical game theory to larger,more » more complex systems. In the second paper, we propose a framework termed Coevolutionary Agent-based Network Defense Lightweight Event System (CANDLES) that can coevolve attacker and defender agent strategies and capabilities and evaluate potential solutions with a custom network defense simulation. The third paper is a continuation of the CANDLES project in which we rewrote key parts of the framework. Attackers and defenders have been redesigned to evolve pure strategy, and a new network security simulation is devised which specifies network architecture and adds a temporal aspect. We also add a hill climber algorithm to evaluate the search space and justify the use of a coevolutionary algorithm.« less

Prototyping and Simulation of Robot Group Intelligence using Kohonen Networks.

PubMed

Wang, Zhijun; Mirdamadi, Reza; Wang, Qing

2016-01-01

Intelligent agents such as robots can form ad hoc networks and replace human being in many dangerous scenarios such as a complicated disaster relief site. This project prototypes and builds a computer simulator to simulate robot kinetics, unsupervised learning using Kohonen networks, as well as group intelligence when an ad hoc network is formed. Each robot is modeled using an object with a simple set of attributes and methods that define its internal states and possible actions it may take under certain circumstances. As the result, simple, reliable, and affordable robots can be deployed to form the network. The simulator simulates a group of robots as an unsupervised learning unit and tests the learning results under scenarios with different complexities. The simulation results show that a group of robots could demonstrate highly collaborative behavior on a complex terrain. This study could potentially provide a software simulation platform for testing individual and group capability of robots before the design process and manufacturing of robots. Therefore, results of the project have the potential to reduce the cost and improve the efficiency of robot design and building.

Prototyping and Simulation of Robot Group Intelligence using Kohonen Networks

PubMed Central

Wang, Zhijun; Mirdamadi, Reza; Wang, Qing

2016-01-01

Intelligent agents such as robots can form ad hoc networks and replace human being in many dangerous scenarios such as a complicated disaster relief site. This project prototypes and builds a computer simulator to simulate robot kinetics, unsupervised learning using Kohonen networks, as well as group intelligence when an ad hoc network is formed. Each robot is modeled using an object with a simple set of attributes and methods that define its internal states and possible actions it may take under certain circumstances. As the result, simple, reliable, and affordable robots can be deployed to form the network. The simulator simulates a group of robots as an unsupervised learning unit and tests the learning results under scenarios with different complexities. The simulation results show that a group of robots could demonstrate highly collaborative behavior on a complex terrain. This study could potentially provide a software simulation platform for testing individual and group capability of robots before the design process and manufacturing of robots. Therefore, results of the project have the potential to reduce the cost and improve the efficiency of robot design and building. PMID:28540284

Evolution of natural agents: preservation, advance, and emergence of functional information.

PubMed

Sharov, Alexei A

2016-04-01

Biological evolution is often viewed narrowly as a change of morphology or allele frequency in a sequence of generations. Here I pursue an alternative informational concept of evolution, as preservation, advance, and emergence of functional information in natural agents. Functional information is a network of signs (e.g., memory, transient messengers, and external signs) that are used by agents to preserve and regulate their functions. Functional information is preserved in evolution via complex interplay of copying and construction processes: the digital components are copied, whereas interpreting subagents together with scaffolds, tools, and resources, are constructed. Some of these processes are simple and invariant, whereas others are complex and contextual. Advance of functional information includes improvement and modification of already existing functions. Although the genome information may change passively and randomly, the interpretation is active and guided by the logic of agent behavior and embryonic development. Emergence of new functions is based on the reinterpretation of already existing information, when old tools, resources, and control algorithms are adopted for novel functions. Evolution of functional information progressed from protosemiosis, where signs correspond directly to actions, to eusemiosis, where agents associate signs with objects. Language is the most advanced form of eusemiosis, where the knowledge of objects and models is communicated between agents.

Evolution of natural agents: preservation, advance, and emergence of functional information

PubMed Central

Sharov, Alexei A.

2016-01-01

Biological evolution is often viewed narrowly as a change of morphology or allele frequency in a sequence of generations. Here I pursue an alternative informational concept of evolution, as preservation, advance, and emergence of functional information in natural agents. Functional information is a network of signs (e.g., memory, transient messengers, and external signs) that are used by agents to preserve and regulate their functions. Functional information is preserved in evolution via complex interplay of copying and construction processes: the digital components are copied, whereas interpreting subagents together with scaffolds, tools, and resources, are constructed. Some of these processes are simple and invariant, whereas others are complex and contextual. Advance of functional information includes improvement and modification of already existing functions. Although the genome information may change passively and randomly, the interpretation is active and guided by the logic of agent behavior and embryonic development. Emergence of new functions is based on the reinterpretation of already existing information, when old tools, resources, and control algorithms are adopted for novel functions. Evolution of functional information progressed from protosemiosis, where signs correspond directly to actions, to eusemiosis, where agents associate signs with objects. Language is the most advanced form of eusemiosis, where the knowledge of objects and models is communicated between agents. PMID:27525048

Bias, belief, and consensus: Collective opinion formation on fluctuating networks

NASA Astrophysics Data System (ADS)

Ngampruetikorn, Vudtiwat; Stephens, Greg J.

2016-11-01

With the advent of online networks, societies have become substantially more interconnected with individual members able to easily both maintain and modify their own social links. Here, we show that active network maintenance exposes agents to confirmation bias, the tendency to confirm one's beliefs, and we explore how this bias affects collective opinion formation. We introduce a model of binary opinion dynamics on a complex, fluctuating network with stochastic rewiring and we analyze these dynamics in the mean-field limit of large networks and fast link rewiring. We show that confirmation bias induces a segregation of individuals with different opinions and stabilizes the consensus state. We further show that bias can have an unusual, nonmonotonic effect on the time to consensus and this suggests a novel avenue for large-scale opinion manipulation.

Bias, belief, and consensus: Collective opinion formation on fluctuating networks.

PubMed

Ngampruetikorn, Vudtiwat; Stephens, Greg J

2016-11-01

With the advent of online networks, societies have become substantially more interconnected with individual members able to easily both maintain and modify their own social links. Here, we show that active network maintenance exposes agents to confirmation bias, the tendency to confirm one's beliefs, and we explore how this bias affects collective opinion formation. We introduce a model of binary opinion dynamics on a complex, fluctuating network with stochastic rewiring and we analyze these dynamics in the mean-field limit of large networks and fast link rewiring. We show that confirmation bias induces a segregation of individuals with different opinions and stabilizes the consensus state. We further show that bias can have an unusual, nonmonotonic effect on the time to consensus and this suggests a novel avenue for large-scale opinion manipulation.

Understanding the complex dynamics of stock markets through cellular automata

NASA Astrophysics Data System (ADS)

Qiu, G.; Kandhai, D.; Sloot, P. M. A.

2007-04-01

We present a cellular automaton (CA) model for simulating the complex dynamics of stock markets. Within this model, a stock market is represented by a two-dimensional lattice, of which each vertex stands for a trader. According to typical trading behavior in real stock markets, agents of only two types are adopted: fundamentalists and imitators. Our CA model is based on local interactions, adopting simple rules for representing the behavior of traders and a simple rule for price updating. This model can reproduce, in a simple and robust manner, the main characteristics observed in empirical financial time series. Heavy-tailed return distributions due to large price variations can be generated through the imitating behavior of agents. In contrast to other microscopic simulation (MS) models, our results suggest that it is not necessary to assume a certain network topology in which agents group together, e.g., a random graph or a percolation network. That is, long-range interactions can emerge from local interactions. Volatility clustering, which also leads to heavy tails, seems to be related to the combined effect of a fast and a slow process: the evolution of the influence of news and the evolution of agents’ activity, respectively. In a general sense, these causes of heavy tails and volatility clustering appear to be common among some notable MS models that can confirm the main characteristics of financial markets.

Modeling the diffusion of complex innovations as a process of opinion formation through social networks.

PubMed

Assenova, Valentina A

2018-01-01

Complex innovations- ideas, practices, and technologies that hold uncertain benefits for potential adopters-often vary in their ability to diffuse in different communities over time. To explain why, I develop a model of innovation adoption in which agents engage in naïve (DeGroot) learning about the value of an innovation within their social networks. Using simulations on Bernoulli random graphs, I examine how adoption varies with network properties and with the distribution of initial opinions and adoption thresholds. The results show that: (i) low-density and high-asymmetry networks produce polarization in influence to adopt an innovation over time, (ii) increasing network density and asymmetry promote adoption under a variety of opinion and threshold distributions, and (iii) the optimal levels of density and asymmetry in networks depend on the distribution of thresholds: networks with high density (>0.25) and high asymmetry (>0.50) are optimal for maximizing diffusion when adoption thresholds are right-skewed (i.e., barriers to adoption are low), but networks with low density (<0.01) and low asymmetry (<0.25) are optimal when thresholds are left-skewed. I draw on data from a diffusion field experiment to predict adoption over time and compare the results to observed outcomes.

Managing Communications with Experts in Geographically Distributed Collaborative Networks

DTIC Science & Technology

2009-03-01

agent architectures, and management of sensor-unmanned vehicle decision maker self organizing environments . Although CENETIX has its beginnings...understanding how everything in a complex system is interconnected. Additionally, environmental factors that impact the management of communications with...unrestricted warfare environment . In “Unconventional Insights for Managing Stakeholder Trust”, Pirson, et al. (2008) emphasizes the challenges of managing

Impact of centrality on cooperative processes

NASA Astrophysics Data System (ADS)

Reia, Sandro M.; Herrmann, Sebastian; Fontanari, José F.

2017-02-01

The solution of today's complex problems requires the grouping of task forces whose members are usually connected remotely over long physical distances and different time zones. Hence, understanding the effects of imposed communication patterns (i.e., who can communicate with whom) on group performance is important. Here we use an agent-based model to explore the influence of the betweenness centrality of the nodes on the time the group requires to find the global maxima of NK-fitness landscapes. The agents cooperate by broadcasting messages, informing on their fitness to their neighbors, and use this information to copy the more successful agents in their neighborhood. We find that for easy tasks (smooth landscapes), the topology of the communication network has no effect on the performance of the group, and that the more central nodes are the most likely to find the global maximum first. For difficult tasks (rugged landscapes), however, we find a positive correlation between the variance of the betweenness among the network nodes and the group performance. For these tasks, the performances of individual nodes are strongly influenced by the agents' dispositions to cooperate and by the particular realizations of the rugged landscapes.

Social Network Analysis and Nutritional Behavior: An Integrated Modeling Approach

PubMed Central

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

2016-01-01

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

Rational pain management in complex regional pain syndrome 1 (CRPS 1)--a network meta-analysis.

PubMed

Wertli, Maria M; Kessels, Alphons G H; Perez, Roberto S G M; Bachmann, Lucas M; Brunner, Florian

2014-09-01

Guidelines for complex regional pain syndrome (CRPS) 1 advocate several substance classes to reduce pain and support physical rehabilitation, but guidance about which agent should be prioritized when designing a therapeutic regimen is not provided. Using a network meta-analytic approach, we examined the efficacy of all agent classes investigated in randomized clinical trials of CRPS 1 and provide a rank order of various substances stratified by length of illness duration. In this study a network meta-analysis was conducted. The participants of this study were patients with CRPS 1. Searches in electronic, previous systematic reviews, conference abstracts, book chapters, and the reference lists of relevant articles were performed. Eligible studies were randomized controlled trials comparing at least one analgesic agent with placebo or with another analgesic and reporting efficacy in reducing pain. Summary efficacy stratified by symptom duration and length of follow-up was computed across all substance classes. Two authors independently extracted data. In total, 16 studies were included in the analysis. Bisphosphonates appear to be the treatment of choice in early stages of CRPS 1. The effects of calcitonin surpass that of bisphosphonates and other substances as a short-term medication in more chronic stages of the illness. While most medications showed some efficacy on short-term follow-up, only bisphosphonates, NMDA analogs, and vasodilators showed better long-term pain reduction than placebo. For some drug classes, only a few studies were available and many studies included a small group of patients. Insufficient data were available to analyze efficacy on disability. This network meta-analysis indicates that a rational pharmacological treatment strategy of pain management should consider bisphosphonates in early CRPS 1 and a short-term course of calcitonin in later stages. While most medications showed some efficacy on short-term follow-up, only bisphosphonates, NMDA analogs and vasodilators showed better long-term pain reduction than placebo. Wiley Periodicals, Inc.

An Agent-Based Optimization Framework for Engineered Complex Adaptive Systems with Application to Demand Response in Electricity Markets

NASA Astrophysics Data System (ADS)

Haghnevis, Moeed

The main objective of this research is to develop an integrated method to study emergent behavior and consequences of evolution and adaptation in engineered complex adaptive systems (ECASs). A multi-layer conceptual framework and modeling approach including behavioral and structural aspects is provided to describe the structure of a class of engineered complex systems and predict their future adaptive patterns. The approach allows the examination of complexity in the structure and the behavior of components as a result of their connections and in relation to their environment. This research describes and uses the major differences of natural complex adaptive systems (CASs) with artificial/engineered CASs to build a framework and platform for ECAS. While this framework focuses on the critical factors of an engineered system, it also enables one to synthetically employ engineering and mathematical models to analyze and measure complexity in such systems. In this way concepts of complex systems science are adapted to management science and system of systems engineering. In particular an integrated consumer-based optimization and agent-based modeling (ABM) platform is presented that enables managers to predict and partially control patterns of behaviors in ECASs. Demonstrated on the U.S. electricity markets, ABM is integrated with normative and subjective decision behavior recommended by the U.S. Department of Energy (DOE) and Federal Energy Regulatory Commission (FERC). The approach integrates social networks, social science, complexity theory, and diffusion theory. Furthermore, it has unique and significant contribution in exploring and representing concrete managerial insights for ECASs and offering new optimized actions and modeling paradigms in agent-based simulation.

Design of a multi-agent hydroeconomic model to simulate a complex human-water system: Early insights from the Jordan Water Project

NASA Astrophysics Data System (ADS)

Yoon, J.; Klassert, C. J. A.; Lachaut, T.; Selby, P. D.; Knox, S.; Gorelick, S.; Rajsekhar, D.; Tilmant, A.; Avisse, N.; Harou, J. J.; Gawel, E.; Klauer, B.; Mustafa, D.; Talozi, S.; Sigel, K.

2015-12-01

Our work focuses on development of a multi-agent, hydroeconomic model for purposes of water policy evaluation in Jordan. The model adopts a modular approach, integrating biophysical modules that simulate natural and engineered phenomena with human modules that represent behavior at multiple levels of decision making. The hydrologic modules are developed using spatially-distributed groundwater and surface water models, which are translated into compact simulators for efficient integration into the multi-agent model. For the groundwater model, we adopt a response matrix method approach in which a 3-dimensional MODFLOW model of a complex regional groundwater system is converted into a linear simulator of groundwater response by pre-processing drawdown results from several hundred numerical simulation runs. Surface water models for each major surface water basin in the country are developed in SWAT and similarly translated into simple rainfall-runoff functions for integration with the multi-agent model. The approach balances physically-based, spatially-explicit representation of hydrologic systems with the efficiency required for integration into a complex multi-agent model that is computationally amenable to robust scenario analysis. For the multi-agent model, we explicitly represent human agency at multiple levels of decision making, with agents representing riparian, management, supplier, and water user groups. The agents' decision making models incorporate both rule-based heuristics as well as economic optimization. The model is programmed in Python using Pynsim, a generalizable, open-source object-oriented code framework for modeling network-based water resource systems. The Jordan model is one of the first applications of Pynsim to a real-world water management case study. Preliminary results from a tanker market scenario run through year 2050 are presented in which several salient features of the water system are investigated: competition between urban and private farmer agents, the emergence of a private tanker market, disparities in economic wellbeing to different user groups caused by unique supply conditions, and response of the complex system to various policy interventions.

Effect of Silane Coupling Agent on the Creep Behavior and Mechanical Properties of Carbon Fibers/Acrylonitrile Butadiene Rubber Composites.

PubMed

Choi, Woong-Ki; Park, Gil-Young; Kim, Byoung-Shuk; Seo, Min-Kang

2018-09-01

In this study, we investigated the effect of the silane coupling agent on the relationship between the surface free energy of carbon fibers (CFs) and the mechanical strength of CFs/acrylonitrile butadiene rubber (NBR) composites. Moreover, the creep behavior of the CF/NBR composites at surface energetic point of view were studied. The specific component of the surface free energy of the carbon fibers was found to increase upon grafting of the silane coupling agent, resulting in an increase in the tensile strength of the CF/NBR composites. On the other hand, the compressive creep strength was found to follow a slightly different trend. These results indicate the possible formation of a complex interpenetrating polymer network depending on the molecular size of the organic functional groups of the silane coupling agent.

Learning Perfectly Secure Cryptography to Protect Communications with Adversarial Neural Cryptography

PubMed Central

2018-01-01

Researches in Artificial Intelligence (AI) have achieved many important breakthroughs, especially in recent years. In some cases, AI learns alone from scratch and performs human tasks faster and better than humans. With the recent advances in AI, it is natural to wonder whether Artificial Neural Networks will be used to successfully create or break cryptographic algorithms. Bibliographic review shows the main approach to this problem have been addressed throughout complex Neural Networks, but without understanding or proving the security of the generated model. This paper presents an analysis of the security of cryptographic algorithms generated by a new technique called Adversarial Neural Cryptography (ANC). Using the proposed network, we show limitations and directions to improve the current approach of ANC. Training the proposed Artificial Neural Network with the improved model of ANC, we show that artificially intelligent agents can learn the unbreakable One-Time Pad (OTP) algorithm, without human knowledge, to communicate securely through an insecure communication channel. This paper shows in which conditions an AI agent can learn a secure encryption scheme. However, it also shows that, without a stronger adversary, it is more likely to obtain an insecure one. PMID:29695066

Learning Perfectly Secure Cryptography to Protect Communications with Adversarial Neural Cryptography.

PubMed

Coutinho, Murilo; de Oliveira Albuquerque, Robson; Borges, Fábio; García Villalba, Luis Javier; Kim, Tai-Hoon

2018-04-24

Researches in Artificial Intelligence (AI) have achieved many important breakthroughs, especially in recent years. In some cases, AI learns alone from scratch and performs human tasks faster and better than humans. With the recent advances in AI, it is natural to wonder whether Artificial Neural Networks will be used to successfully create or break cryptographic algorithms. Bibliographic review shows the main approach to this problem have been addressed throughout complex Neural Networks, but without understanding or proving the security of the generated model. This paper presents an analysis of the security of cryptographic algorithms generated by a new technique called Adversarial Neural Cryptography (ANC). Using the proposed network, we show limitations and directions to improve the current approach of ANC. Training the proposed Artificial Neural Network with the improved model of ANC, we show that artificially intelligent agents can learn the unbreakable One-Time Pad (OTP) algorithm, without human knowledge, to communicate securely through an insecure communication channel. This paper shows in which conditions an AI agent can learn a secure encryption scheme. However, it also shows that, without a stronger adversary, it is more likely to obtain an insecure one.

A data fusion approach to indications and warnings of terrorist attacks

NASA Astrophysics Data System (ADS)

McDaniel, David; Schaefer, Gregory

2014-05-01

Indications and Warning (I&W) of terrorist attacks, particularly IED attacks, require detection of networks of agents and patterns of behavior. Social Network Analysis tries to detect a network; activity analysis tries to detect anomalous activities. This work builds on both to detect elements of an activity model of terrorist attack activity - the agents, resources, networks, and behaviors. The activity model is expressed as RDF triples statements where the tuple positions are elements or subsets of a formal ontology for activity models. The advantage of a model is that elements are interdependent and evidence for or against one will influence others so that there is a multiplier effect. The advantage of the formality is that detection could occur hierarchically, that is, at different levels of abstraction. The model matching is expressed as a likelihood ratio between input text and the model triples. The likelihood ratio is designed to be analogous to track correlation likelihood ratios common in JDL fusion level 1. This required development of a semantic distance metric for positive and null hypotheses as well as for complex objects. The metric uses the Web 1Terabype database of one to five gram frequencies for priors. This size requires the use of big data technologies so a Hadoop cluster is used in conjunction with OpenNLP natural language and Mahout clustering software. Distributed data fusion Map Reduce jobs distribute parts of the data fusion problem to the Hadoop nodes. For the purposes of this initial testing, open source models and text inputs of similar complexity to terrorist events were used as surrogates for the intended counter-terrorist application.

A linguistic geometry for 3D strategic planning

NASA Technical Reports Server (NTRS)

Stilman, Boris

1995-01-01

This paper is a new step in the development and application of the Linguistic Geometry. This formal theory is intended to discover the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. In this paper we investigate heuristics extracted in the form of hierarchical networks of planning paths of autonomous agents. Employing Linguistic Geometry tools the dynamic hierarchy of networks is represented as a hierarchy of formal attribute languages. The main ideas of this methodology are shown in this paper on the new pilot example of the solution of the extremely complex 3D optimization problem of strategic planning for the space combat of autonomous vehicles. This example demonstrates deep and highly selective search in comparison with conventional search algorithms.

Combining Bayesian Networks and Agent Based Modeling to develop a decision-support model in Vietnam

NASA Astrophysics Data System (ADS)

Nong, Bao Anh; Ertsen, Maurits; Schoups, Gerrit

2016-04-01

Complexity and uncertainty in natural resources management have been focus themes in recent years. Within these debates, with the aim to define an approach feasible for water management practice, we are developing an integrated conceptual modeling framework for simulating decision-making processes of citizens, in our case in the Day river area, Vietnam. The model combines Bayesian Networks (BNs) and Agent-Based Modeling (ABM). BNs are able to combine both qualitative data from consultants / experts / stakeholders, and quantitative data from observations on different phenomena or outcomes from other models. Further strengths of BNs are that the relationship between variables in the system is presented in a graphical interface, and that components of uncertainty are explicitly related to their probabilistic dependencies. A disadvantage is that BNs cannot easily identify the feedback of agents in the system once changes appear. Hence, ABM was adopted to represent the reaction among stakeholders under changes. The modeling framework is developed as an attempt to gain better understanding about citizen's behavior and factors influencing their decisions in order to reduce uncertainty in the implementation of water management policy.

Wealth condensation in a Barabasi-Albert network

NASA Astrophysics Data System (ADS)

Vázquez-Montejo, J.; Huerta-Quintanilla, R.; Rodríguez-Achach, M.

2010-04-01

We study the flow of money among agents in a Barabasi-Albert (BA) scale free network, where each network node represents an agent and money exchange interactions are established through links. The system allows money trade between two agents at a time, betting a fraction f of the poorer’s agent wealth. We also allow for the bet to be biased, giving the poorer agent a winning probability p. In the no network case there is a phase transition involving a relationship between p and f. In the networked case, we also found a condensation interface, however, this is not a complete condensation due to the presence of clusters in the network and its topology. As can be expected, the winner is always a well-connected agent, but we also found that the mean wealth decreases with the agents’ connectivity.

On the Embedded Complementarity of Agent-Based and Aggregate Reasoning in Students' Developing Understanding of Dynamic Systems

ERIC Educational Resources Information Center

Stroup, Walter M.; Wilensky, Uri

2014-01-01

Placed in the larger context of broadening the engagement with systems dynamics and complexity theory in school-aged learning and teaching, this paper is intended to introduce, situate, and illustrate--with results from the use of network supported participatory simulations in classrooms--a stance we call "embedded complementarity" as an…

Research on e-commerce transaction networks using multi-agent modelling and open application programming interface

NASA Astrophysics Data System (ADS)

Piao, Chunhui; Han, Xufang; Wu, Harris

2010-08-01

We provide a formal definition of an e-commerce transaction network. Agent-based modelling is used to simulate e-commerce transaction networks. For real-world analysis, we studied the open application programming interfaces (APIs) from eBay and Taobao e-commerce websites and captured real transaction data. Pajek is used to visualise the agent relationships in the transaction network. We derived one-mode networks from the transaction network and analysed them using degree and betweenness centrality. Integrating multi-agent modelling, open APIs and social network analysis, we propose a new way to study large-scale e-commerce systems.

SpikingLab: modelling agents controlled by Spiking Neural Networks in Netlogo.

PubMed

Jimenez-Romero, Cristian; Johnson, Jeffrey

2017-01-01

The scientific interest attracted by Spiking Neural Networks (SNN) has lead to the development of tools for the simulation and study of neuronal dynamics ranging from phenomenological models to the more sophisticated and biologically accurate Hodgkin-and-Huxley-based and multi-compartmental models. However, despite the multiple features offered by neural modelling tools, their integration with environments for the simulation of robots and agents can be challenging and time consuming. The implementation of artificial neural circuits to control robots generally involves the following tasks: (1) understanding the simulation tools, (2) creating the neural circuit in the neural simulator, (3) linking the simulated neural circuit with the environment of the agent and (4) programming the appropriate interface in the robot or agent to use the neural controller. The accomplishment of the above-mentioned tasks can be challenging, especially for undergraduate students or novice researchers. This paper presents an alternative tool which facilitates the simulation of simple SNN circuits using the multi-agent simulation and the programming environment Netlogo (educational software that simplifies the study and experimentation of complex systems). The engine proposed and implemented in Netlogo for the simulation of a functional model of SNN is a simplification of integrate and fire (I&F) models. The characteristics of the engine (including neuronal dynamics, STDP learning and synaptic delay) are demonstrated through the implementation of an agent representing an artificial insect controlled by a simple neural circuit. The setup of the experiment and its outcomes are described in this work.

Enabling private and public sector organizations as agents of homeland security

NASA Astrophysics Data System (ADS)

Glassco, David H. J.; Glassco, Jordan C.

2006-05-01

Homeland security and defense applications seek to reduce the risk of undesirable eventualities across physical space in real-time. With that functional requirement in mind, our work focused on the development of IP based agent telecommunication solutions for heterogeneous sensor / robotic intelligent "Things" that could be deployed across the internet. This paper explains how multi-organization information and device sharing alliances may be formed to enable organizations to act as agents of homeland security (in addition to other uses). Topics include: (i) using location-aware, agent based, real-time information sharing systems to integrate business systems, mobile devices, sensor and actuator based devices and embedded devices used in physical infrastructure assets, equipment and other man-made "Things"; (ii) organization-centric real-time information sharing spaces using on-demand XML schema formatted networks; (iii) object-oriented XML serialization as a methodology for heterogeneous device glue code; (iv) how complex requirements for inter / intra organization information and device ownership and sharing, security and access control, mobility and remote communication service, tailored solution life cycle management, service QoS, service and geographic scalability and the projection of remote physical presence (through sensing and robotics) and remote informational presence (knowledge of what is going elsewhere) can be more easily supported through feature inheritance with a rapid agent system development methodology; (v) how remote object identification and tracking can be supported across large areas; (vi) how agent synergy may be leveraged with analytics to complement heterogeneous device networks.

Congestion control for a fair packet delivery in WSN: from a complex system perspective.

PubMed

Aguirre-Guerrero, Daniela; Marcelín-Jiménez, Ricardo; Rodriguez-Colina, Enrique; Pascoe-Chalke, Michael

2014-01-01

In this work, we propose that packets travelling across a wireless sensor network (WSN) can be seen as the active agents that make up a complex system, just like a bird flock or a fish school, for instance. From this perspective, the tools and models that have been developed to study this kind of systems have been applied. This is in order to create a distributed congestion control based on a set of simple rules programmed at the nodes of the WSN. Our results show that it is possible to adapt the carried traffic to the network capacity, even under stressing conditions. Also, the network performance shows a smooth degradation when the traffic goes beyond a threshold which is settled by the proposed self-organized control. In contrast, without any control, the network collapses before this threshold. The use of the proposed solution provides an effective strategy to address some of the common problems found in WSN deployment by providing a fair packet delivery. In addition, the network congestion is mitigated using adaptive traffic mechanisms based on a satisfaction parameter assessed by each packet which has impact on the global satisfaction of the traffic carried by the WSN.

Behavior control in the sensorimotor loop with short-term synaptic dynamics induced by self-regulating neurons.

PubMed

Toutounji, Hazem; Pasemann, Frank

2014-01-01

The behavior and skills of living systems depend on the distributed control provided by specialized and highly recurrent neural networks. Learning and memory in these systems is mediated by a set of adaptation mechanisms, known collectively as neuronal plasticity. Translating principles of recurrent neural control and plasticity to artificial agents has seen major strides, but is usually hampered by the complex interactions between the agent's body and its environment. One of the important standing issues is for the agent to support multiple stable states of behavior, so that its behavioral repertoire matches the requirements imposed by these interactions. The agent also must have the capacity to switch between these states in time scales that are comparable to those by which sensory stimulation varies. Achieving this requires a mechanism of short-term memory that allows the neurocontroller to keep track of the recent history of its input, which finds its biological counterpart in short-term synaptic plasticity. This issue is approached here by deriving synaptic dynamics in recurrent neural networks. Neurons are introduced as self-regulating units with a rich repertoire of dynamics. They exhibit homeostatic properties for certain parameter domains, which result in a set of stable states and the required short-term memory. They can also operate as oscillators, which allow them to surpass the level of activity imposed by their homeostatic operation conditions. Neural systems endowed with the derived synaptic dynamics can be utilized for the neural behavior control of autonomous mobile agents. The resulting behavior depends also on the underlying network structure, which is either engineered or developed by evolutionary techniques. The effectiveness of these self-regulating units is demonstrated by controlling locomotion of a hexapod with 18 degrees of freedom, and obstacle-avoidance of a wheel-driven robot.

Behavior control in the sensorimotor loop with short-term synaptic dynamics induced by self-regulating neurons

PubMed Central

Toutounji, Hazem; Pasemann, Frank

2014-01-01

The behavior and skills of living systems depend on the distributed control provided by specialized and highly recurrent neural networks. Learning and memory in these systems is mediated by a set of adaptation mechanisms, known collectively as neuronal plasticity. Translating principles of recurrent neural control and plasticity to artificial agents has seen major strides, but is usually hampered by the complex interactions between the agent's body and its environment. One of the important standing issues is for the agent to support multiple stable states of behavior, so that its behavioral repertoire matches the requirements imposed by these interactions. The agent also must have the capacity to switch between these states in time scales that are comparable to those by which sensory stimulation varies. Achieving this requires a mechanism of short-term memory that allows the neurocontroller to keep track of the recent history of its input, which finds its biological counterpart in short-term synaptic plasticity. This issue is approached here by deriving synaptic dynamics in recurrent neural networks. Neurons are introduced as self-regulating units with a rich repertoire of dynamics. They exhibit homeostatic properties for certain parameter domains, which result in a set of stable states and the required short-term memory. They can also operate as oscillators, which allow them to surpass the level of activity imposed by their homeostatic operation conditions. Neural systems endowed with the derived synaptic dynamics can be utilized for the neural behavior control of autonomous mobile agents. The resulting behavior depends also on the underlying network structure, which is either engineered or developed by evolutionary techniques. The effectiveness of these self-regulating units is demonstrated by controlling locomotion of a hexapod with 18 degrees of freedom, and obstacle-avoidance of a wheel-driven robot. PMID:24904403

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.

Network reciprocity by coexisting learning and teaching strategies

NASA Astrophysics Data System (ADS)

Tanimoto, Jun; Brede, Markus; Yamauchi, Atsuo

2012-03-01

We propose a network reciprocity model in which an agent probabilistically adopts learning or teaching strategies. In the learning adaptation mechanism, an agent may copy a neighbor's strategy through Fermi pairwise comparison. The teaching adaptation mechanism involves an agent imposing its strategy on a neighbor. Our simulations reveal that the reciprocity is significantly affected by the frequency with which learning and teaching agents coexist in a network and by the structure of the network itself.

Research and Simulation on Application of the Mobile IP Network

NASA Astrophysics Data System (ADS)

Yibing, Deng; Wei, Hu; Minghui, Li; Feng, Gao; Junyi, Shen

The paper analysed the mobile node, home agent, and foreign agent of mobile IP network firstly, some key technique, such as mobile IP network basical principle, protocol work principle, agent discovery, registration, and IP packet transmission, were discussed. Then a network simulation model was designed, validating the characteristic of mobile IP network, and some advantages, which were brought by mobile network, were testified. Finally, the conclusion is gained: mobile IP network could realize the expectation of consumer that they can communicate with others anywhere.

Programmable chemical controllers made from DNA.

PubMed

Chen, Yuan-Jyue; Dalchau, Neil; Srinivas, Niranjan; Phillips, Andrew; Cardelli, Luca; Soloveichik, David; Seelig, Georg

2013-10-01

Biological organisms use complex molecular networks to navigate their environment and regulate their internal state. The development of synthetic systems with similar capabilities could lead to applications such as smart therapeutics or fabrication methods based on self-organization. To achieve this, molecular control circuits need to be engineered to perform integrated sensing, computation and actuation. Here we report a DNA-based technology for implementing the computational core of such controllers. We use the formalism of chemical reaction networks as a 'programming language' and our DNA architecture can, in principle, implement any behaviour that can be mathematically expressed as such. Unlike logic circuits, our formulation naturally allows complex signal processing of intrinsically analogue biological and chemical inputs. Controller components can be derived from biologically synthesized (plasmid) DNA, which reduces errors associated with chemically synthesized DNA. We implement several building-block reaction types and then combine them into a network that realizes, at the molecular level, an algorithm used in distributed control systems for achieving consensus between multiple agents.

Programmable chemical controllers made from DNA

NASA Astrophysics Data System (ADS)

Chen, Yuan-Jyue; Dalchau, Neil; Srinivas, Niranjan; Phillips, Andrew; Cardelli, Luca; Soloveichik, David; Seelig, Georg

2013-10-01

Biological organisms use complex molecular networks to navigate their environment and regulate their internal state. The development of synthetic systems with similar capabilities could lead to applications such as smart therapeutics or fabrication methods based on self-organization. To achieve this, molecular control circuits need to be engineered to perform integrated sensing, computation and actuation. Here we report a DNA-based technology for implementing the computational core of such controllers. We use the formalism of chemical reaction networks as a 'programming language' and our DNA architecture can, in principle, implement any behaviour that can be mathematically expressed as such. Unlike logic circuits, our formulation naturally allows complex signal processing of intrinsically analogue biological and chemical inputs. Controller components can be derived from biologically synthesized (plasmid) DNA, which reduces errors associated with chemically synthesized DNA. We implement several building-block reaction types and then combine them into a network that realizes, at the molecular level, an algorithm used in distributed control systems for achieving consensus between multiple agents.

Programmable chemical controllers made from DNA

PubMed Central

Chen, Yuan-Jyue; Dalchau, Neil; Srinivas, Niranjan; Phillips, Andrew; Cardelli, Luca; Soloveichik, David; Seelig, Georg

2014-01-01

Biological organisms use complex molecular networks to navigate their environment and regulate their internal state. The development of synthetic systems with similar capabilities could lead to applications such as smart therapeutics or fabrication methods based on self-organization. To achieve this, molecular control circuits need to be engineered to perform integrated sensing, computation and actuation. Here we report a DNA-based technology for implementing the computational core of such controllers. We use the formalism of chemical reaction networks as a 'programming language', and our DNA architecture can, in principle, implement any behaviour that can be mathematically expressed as such. Unlike logic circuits, our formulation naturally allows complex signal processing of intrinsically analogue biological and chemical inputs. Controller components can be derived from biologically synthesized (plasmid) DNA, which reduces errors associated with chemically synthesized DNA. We implement several building-block reaction types and then combine them into a network that realizes, at the molecular level, an algorithm used in distributed control systems for achieving consensus between multiple agents. PMID:24077029

Organization of the secure distributed computing based on multi-agent system

NASA Astrophysics Data System (ADS)

Khovanskov, Sergey; Rumyantsev, Konstantin; Khovanskova, Vera

2018-04-01

Nowadays developing methods for distributed computing is received much attention. One of the methods of distributed computing is using of multi-agent systems. The organization of distributed computing based on the conventional network computers can experience security threats performed by computational processes. Authors have developed the unified agent algorithm of control system of computing network nodes operation. Network PCs is used as computing nodes. The proposed multi-agent control system for the implementation of distributed computing allows in a short time to organize using of the processing power of computers any existing network to solve large-task by creating a distributed computing. Agents based on a computer network can: configure a distributed computing system; to distribute the computational load among computers operated agents; perform optimization distributed computing system according to the computing power of computers on the network. The number of computers connected to the network can be increased by connecting computers to the new computer system, which leads to an increase in overall processing power. Adding multi-agent system in the central agent increases the security of distributed computing. This organization of the distributed computing system reduces the problem solving time and increase fault tolerance (vitality) of computing processes in a changing computing environment (dynamic change of the number of computers on the network). Developed a multi-agent system detects cases of falsification of the results of a distributed system, which may lead to wrong decisions. In addition, the system checks and corrects wrong results.

Using Synchronous Boolean Networks to Model Several Phenomena of Collective Behavior

PubMed Central

Kochemazov, Stepan; Semenov, Alexander

2014-01-01

In this paper, we propose an approach for modeling and analysis of a number of phenomena of collective behavior. By collectives we mean multi-agent systems that transition from one state to another at discrete moments of time. The behavior of a member of a collective (agent) is called conforming if the opinion of this agent at current time moment conforms to the opinion of some other agents at the previous time moment. We presume that at each moment of time every agent makes a decision by choosing from the set (where 1-decision corresponds to action and 0-decision corresponds to inaction). In our approach we model collective behavior with synchronous Boolean networks. We presume that in a network there can be agents that act at every moment of time. Such agents are called instigators. Also there can be agents that never act. Such agents are called loyalists. Agents that are neither instigators nor loyalists are called simple agents. We study two combinatorial problems. The first problem is to find a disposition of instigators that in several time moments transforms a network from a state where the majority of simple agents are inactive to a state with the majority of active agents. The second problem is to find a disposition of loyalists that returns the network to a state with the majority of inactive agents. Similar problems are studied for networks in which simple agents demonstrate the contrary to conforming behavior that we call anticonforming. We obtained several theoretical results regarding the behavior of collectives of agents with conforming or anticonforming behavior. In computational experiments we solved the described problems for randomly generated networks with several hundred vertices. We reduced corresponding combinatorial problems to the Boolean satisfiability problem (SAT) and used modern SAT solvers to solve the instances obtained. PMID:25526612

Fast Flux Watch: A mechanism for online detection of fast flux networks.

PubMed

Al-Duwairi, Basheer N; Al-Hammouri, Ahmad T

2014-07-01

Fast flux networks represent a special type of botnets that are used to provide highly available web services to a backend server, which usually hosts malicious content. Detection of fast flux networks continues to be a challenging issue because of the similar behavior between these networks and other legitimate infrastructures, such as CDNs and server farms. This paper proposes Fast Flux Watch (FF-Watch), a mechanism for online detection of fast flux agents. FF-Watch is envisioned to exist as a software agent at leaf routers that connect stub networks to the Internet. The core mechanism of FF-Watch is based on the inherent feature of fast flux networks: flux agents within stub networks take the role of relaying client requests to point-of-sale websites of spam campaigns. The main idea of FF-Watch is to correlate incoming TCP connection requests to flux agents within a stub network with outgoing TCP connection requests from the same agents to the point-of-sale website. Theoretical and traffic trace driven analysis shows that the proposed mechanism can be utilized to efficiently detect fast flux agents within a stub network.

Multi-agent coordination in directed moving neighbourhood random networks

NASA Astrophysics Data System (ADS)

Shang, Yi-Lun

2010-07-01

This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results.

Dynamical systems approach to the study of a sociophysics agent-based model

NASA Astrophysics Data System (ADS)

Timpanaro, André M.; Prado, Carmen P. C.

2011-03-01

The Sznajd model is a Potts-like model that has been studied in the context of sociophysics [1,2] (where spins are interpreted as opinions). In a recent work [3], we generalized the Sznajd model to include assymetric interactions between the spins (interpreted as biases towards opinions) and used dynamical systems techniques to tackle its mean-field version, given by the flow: ησ = ∑ σ' = 1Mησησ'(ησρσ'→σ-σ'ρσ→σ'). Where hs is the proportion of agents with opinion (spin) σ', M is the number of opinions and σ'→σ' is the probability weight for an agent with opinion σ being convinced by another agent with opinion σ'. We made Monte Carlo simulations of the model in a complex network (using Barabási-Albert networks [4]) and they displayed the same attractors than the mean-field. Using linear stability analysis, we were able to determine the mean-field attractor structure analytically and to show that it has connections with well known graph theory problems (maximal independent sets and positive fluxes in directed graphs). Our dynamical systems approach is quite simple and can be used also in other models, like the voter model.

Theorising big IT programmes in healthcare: strong structuration theory meets actor-network theory.

PubMed

Greenhalgh, Trisha; Stones, Rob

2010-05-01

The UK National Health Service is grappling with various large and controversial IT programmes. We sought to develop a sharper theoretical perspective on the question "What happens - at macro-, meso- and micro-level - when government tries to modernise a health service with the help of big IT?" Using examples from data fragments at the micro-level of clinical work, we considered how structuration theory and actor-network theory (ANT) might be combined to inform empirical investigation. Giddens (1984) argued that social structures and human agency are recursively linked and co-evolve. ANT studies the relationships that link people and technologies in dynamic networks. It considers how discourses become inscribed in data structures and decision models of software, making certain network relations irreversible. Stones' (2005) strong structuration theory (SST) is a refinement of Giddens' work, systematically concerned with empirical research. It views human agents as linked in dynamic networks of position-practices. A quadripartite approcach considers [a] external social structures (conditions for action); [b] internal social structures (agents' capabilities and what they 'know' about the social world); [c] active agency and actions and [d] outcomes as they feed back on the position-practice network. In contrast to early structuration theory and ANT, SST insists on disciplined conceptual methodology and linking this with empirical evidence. In this paper, we adapt SST for the study of technology programmes, integrating elements from material interactionism and ANT. We argue, for example, that the position-practice network can be a socio-technical one in which technologies in conjunction with humans can be studied as 'actants'. Human agents, with their complex socio-cultural frames, are required to instantiate technology in social practices. Structurally relevant properties inscribed and embedded in technological artefacts constrain and enable human agency. The fortunes of healthcare IT programmes might be studied in terms of the interplay between these factors. Copyright 2010 Elsevier Ltd. All rights reserved.

An evolutionary game model for behavioral gambit of loyalists: Global awareness and risk-aversion

NASA Astrophysics Data System (ADS)

Alfinito, E.; Barra, A.; Beccaria, M.; Fachechi, A.; Macorini, G.

2018-02-01

We study the phase diagram of a minority game where three classes of agents are present. Two types of agents play a risk-loving game that we model by the standard Snowdrift Game. The behaviour of the third type of agents is coded by indifference with respect to the game at all: their dynamics is designed to account for risk-aversion as an innovative behavioral gambit. From this point of view, the choice of this solitary strategy is enhanced when innovation starts, while is depressed when it becomes the majority option. This implies that the payoff matrix of the game becomes dependent on the global awareness of the agents measured by the relevance of the population of the indifferent players. The resulting dynamics is nontrivial with different kinds of phase transition depending on a few model parameters. The phase diagram is studied on regular as well as complex networks.

Exploring complex dynamics in multi agent-based intelligent systems: Theoretical and experimental approaches using the Multi Agent-based Behavioral Economic Landscape (MABEL) model

NASA Astrophysics Data System (ADS)

Alexandridis, Konstantinos T.

This dissertation adopts a holistic and detailed approach to modeling spatially explicit agent-based artificial intelligent systems, using the Multi Agent-based Behavioral Economic Landscape (MABEL) model. The research questions that addresses stem from the need to understand and analyze the real-world patterns and dynamics of land use change from a coupled human-environmental systems perspective. Describes the systemic, mathematical, statistical, socio-economic and spatial dynamics of the MABEL modeling framework, and provides a wide array of cross-disciplinary modeling applications within the research, decision-making and policy domains. Establishes the symbolic properties of the MABEL model as a Markov decision process, analyzes the decision-theoretic utility and optimization attributes of agents towards comprising statistically and spatially optimal policies and actions, and explores the probabilogic character of the agents' decision-making and inference mechanisms via the use of Bayesian belief and decision networks. Develops and describes a Monte Carlo methodology for experimental replications of agent's decisions regarding complex spatial parcel acquisition and learning. Recognizes the gap on spatially-explicit accuracy assessment techniques for complex spatial models, and proposes an ensemble of statistical tools designed to address this problem. Advanced information assessment techniques such as the Receiver-Operator Characteristic curve, the impurity entropy and Gini functions, and the Bayesian classification functions are proposed. The theoretical foundation for modular Bayesian inference in spatially-explicit multi-agent artificial intelligent systems, and the ensembles of cognitive and scenario assessment modular tools build for the MABEL model are provided. Emphasizes the modularity and robustness as valuable qualitative modeling attributes, and examines the role of robust intelligent modeling as a tool for improving policy-decisions related to land use change. Finally, the major contributions to the science are presented along with valuable directions for future research.

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.

Evolution of tag-based cooperation with emotion on complex networks

NASA Astrophysics Data System (ADS)

Lima, F. W. S.

2018-04-01

We study the evolution of the four strategies: Ethnocentric, altruistic, egoistic and cosmopolitan in one community of individuals through Monte Carlo simulations. Interactions and reproduction among computational agents are simulated on undirected Barabási-Albert (UBA) networks and Erdös-Rènyi random graphs (ER).We study the Hammond-Axelrod model on both UBA networks and ER random graphs for the asexual reproduction case. We use a modified version of the traditional Hammond-Axelrod model and we also allow the agents’ decisions about one of the strategies to take into account the emotion among their equals. Our simulations showed that egoism and altruism win, differently from other results found in the literature where ethnocentric strategy is common.

Keratitis-associated fungi form biofilms with reduced antifungal drug susceptibility.

PubMed

Zhang, Xiaoyan; Sun, Xuguang; Wang, Zhiqun; Zhang, Yang; Hou, Wenbo

2012-11-21

To investigate the biofilm-forming capacity of Fusarium solani, Cladosporium sphaerospermum, and Acremonium implicatum, and the activities of antifungal agents against the three keratitis-associated fungi. The architecture of biofilms was analyzed using scanning electron microscopy and confocal scanning laser microscopy (CSLM). Susceptibility against six antifungal drugs was measured using the CLSI M38-A method and XTT reduction assay. Time course analyses of CSLM revealed that biofilm formation occurred in an organized fashion through four distinct developmental phases: adhesion, germling formation, microcolony formation, and biofilm maturation. Scanning electron microscopy revealed that mature biofilms displayed a complex three-dimensional structure, consisting of coordinated network of hyphal structures glued by the extracellular matrix (ECM). The antifungal susceptibility testing demonstrated a time-dependent decrease in efficacy for all six antifungal agents as the complexity of fungal hyphal structures developed. Natamycin (NAT), amphotericin B (AMB), and NAT were the most effective against F. solani, C. sphaerospermum, and A. implicatum biofilm, respectively. Corneal isolates of F. solani, C. sphaerospermum, and A. implicatum could produce biofilms that were resistant to antifungal agents in vitro.

A hybrid fuzzy logic/constraint satisfaction problem approach to automatic decision making in simulation game models.

PubMed

Braathen, Sverre; Sendstad, Ole Jakob

2004-08-01

Possible techniques for representing automatic decision-making behavior approximating human experts in complex simulation model experiments are of interest. Here, fuzzy logic (FL) and constraint satisfaction problem (CSP) methods are applied in a hybrid design of automatic decision making in simulation game models. The decision processes of a military headquarters are used as a model for the FL/CSP decision agents choice of variables and rulebases. The hybrid decision agent design is applied in two different types of simulation games to test the general applicability of the design. The first application is a two-sided zero-sum sequential resource allocation game with imperfect information interpreted as an air campaign game. The second example is a network flow stochastic board game designed to capture important aspects of land manoeuvre operations. The proposed design is shown to perform well also in this complex game with a very large (billionsize) action set. Training of the automatic FL/CSP decision agents against selected performance measures is also shown and results are presented together with directions for future research.

An Assessment of Direct and Indirect Economic Losses of Climatic Extreme Events

NASA Astrophysics Data System (ADS)

Otto, C.; Willner, S. N.; Wenz, L.; Levermann, A.

2015-12-01

Risk of extreme weather events like storms, heat extremes, and floods has already risen due to anthropogenic climate change and is likely to increase further under future global warming. Additionally, the structure of the global economy has changed importantly in the last decades. In the process of globalization, local economies have become more and more interwoven forming a complex network. Together with a trend towards lean production, this has resulted in a strong dependency of local manufacturers on global supply and value added chains, which may render the economic network more vulnerable to climatic extremes; outages of local manufacturers trigger indirect losses, which spread along supply chains and can even outstrip direct losses. Accordingly, in a comprehensive climate risk assessment these inter-linkages should be considered. Here, we present acclimate, an agent based dynamic damage propagation model. Its agents are production and consumption sites, which are interlinked by economic flows accounting for the complexity as well as the heterogeneity of the global supply network. Assessing the economic response on the timescale of the adverse event, the model permits to study temporal and spatial evolution of indirect production losses during the disaster and in the subsequent recovery phase of the economy. In this study, we focus on the dynamic economic resilience defined here as the ratio of direct to total losses. This implies that the resilience of the system under consideration is low if the high indirect losses are high. We find and assess a nonlinear dependence of the resilience on the disaster size. Further, we analyze the influence of the network structure upon resilience and discuss the potential of warehousing as an adaptation option.

Drug release control and system understanding of sucrose esters matrix tablets by artificial neural networks.

PubMed

Chansanroj, Krisanin; Petrović, Jelena; Ibrić, Svetlana; Betz, Gabriele

2011-10-09

Artificial neural networks (ANNs) were applied for system understanding and prediction of drug release properties from direct compacted matrix tablets using sucrose esters (SEs) as matrix-forming agents for controlled release of a highly water soluble drug, metoprolol tartrate. Complexity of the system was presented through the effects of SE concentration and tablet porosity at various hydrophilic-lipophilic balance (HLB) values of SEs ranging from 0 to 16. Both effects contributed to release behaviors especially in the system containing hydrophilic SEs where swelling phenomena occurred. A self-organizing map neural network (SOM) was applied for visualizing interrelation among the variables and multilayer perceptron neural networks (MLPs) were employed to generalize the system and predict the drug release properties based on HLB value and concentration of SEs and tablet properties, i.e., tablet porosity, volume and tensile strength. Accurate prediction was obtained after systematically optimizing network performance based on learning algorithm of MLP. Drug release was mainly attributed to the effects of SEs, tablet volume and tensile strength in multi-dimensional interrelation whereas tablet porosity gave a small impact. Ability of system generalization and accurate prediction of the drug release properties proves the validity of SOM and MLPs for the formulation modeling of direct compacted matrix tablets containing controlled release agents of different material properties. Copyright © 2011 Elsevier B.V. All rights reserved.

Modeling Social Capital as Dynamic Networks to Promote Access to Oral Healthcare

PubMed Central

Northridge, Mary E.; Kunzel, Carol; Zhang, Qiuyi; Kum, Susan S.; Gilbert, Jessica L.; Jin, Zhu; Metcalf, Sara S.

2016-01-01

Social capital, as comprised of human connections in social networks and their associated benefits, is closely related to the health of individuals, communities, and societies at large. For disadvantaged population groups such as older adults and racial/ethnic minorities, social capital may play a particularly critical role in mitigating the negative effects and reinforcing the positive effects on health. In this project, we model social capital as both cause and effect by simulating dynamic networks. Informed in part by a community-based health promotion program, an agent-based model is contextualized in a GIS environment to explore the complexity of social disparities in oral and general health as experienced at the individual, interpersonal, and community scales. This study provides the foundation for future work investigating how health and healthcare accessibility may be influenced by social networks. PMID:27668298

Modeling Social Capital as Dynamic Networks to Promote Access to Oral Healthcare.

PubMed

Wang, Hua; Northridge, Mary E; Kunzel, Carol; Zhang, Qiuyi; Kum, Susan S; Gilbert, Jessica L; Jin, Zhu; Metcalf, Sara S

2016-01-01

Social capital, as comprised of human connections in social networks and their associated benefits, is closely related to the health of individuals, communities, and societies at large. For disadvantaged population groups such as older adults and racial/ethnic minorities, social capital may play a particularly critical role in mitigating the negative effects and reinforcing the positive effects on health. In this project, we model social capital as both cause and effect by simulating dynamic networks. Informed in part by a community-based health promotion program, an agent-based model is contextualized in a GIS environment to explore the complexity of social disparities in oral and general health as experienced at the individual, interpersonal, and community scales. This study provides the foundation for future work investigating how health and healthcare accessibility may be influenced by social networks.

Distributed Processing System for Restoration of Electric Power Distribution Network Using Two-Layered Contract Net Protocol

NASA Astrophysics Data System (ADS)

Kodama, Yu; Hamagami, Tomoki

Distributed processing system for restoration of electric power distribution network using two-layered CNP is proposed. The goal of this study is to develop the restoration system which adjusts to the future power network with distributed generators. The state of the art of this study is that the two-layered CNP is applied for the distributed computing environment in practical use. The two-layered CNP has two classes of agents, named field agent and operating agent in the network. In order to avoid conflicts of tasks, operating agent controls privilege for managers to send the task announcement messages in CNP. This technique realizes the coordination between agents which work asynchronously in parallel with others. Moreover, this study implements the distributed processing system using a de-fact standard multi-agent framework, JADE(Java Agent DEvelopment framework). This study conducts the simulation experiments of power distribution network restoration and compares the proposed system with the previous system. We confirmed the results show effectiveness of the proposed system.

A framework for unravelling the complexities of unsustainable water resource use

NASA Astrophysics Data System (ADS)

Dermody, Brian; Bierkens, Marc; Wassen, Martin; Dekker, Stefan

2016-04-01

The majority of unsustainable water resource use is associated with food production, with the agricultural sector accounting for up to 70% of total freshwater use by humans. Water resource use in food production emerges as a result of dynamic interactions between humans and their environment in importing and exporting regions as well as the physical and socioeconomic trade infrastructure linking the two. Thus in order to understand unsustainable water resource use, it is essential to understand the complex socioecological food production and trade system. We present a modelling framework of the food production and trade system that facilitates an understanding of complex socioenvironmental processes that lead to unsustainable water resource use. Our framework is based on a coupling of the global hydrological model PC Raster Global Water Balance (PCR-GLOBWB) with a multi-agent socioeconomic food production and trade network. In our framework, agents perceive environmental conditions. They make food supply decisions based upon those perceptions and the heterogeneous socioeconomic conditions in which they exist. Agent decisions modify land and water resources. Those environmental changes feedback to influence decision making further. The framework presented has the potential to go beyond a diagnosis of the causes of unsustainable water resource and provide pathways towards a sustainable food system in terms of water resources.

a Model for Brand Competition Within a Social Network

NASA Astrophysics Data System (ADS)

Huerta-Quintanilla, R.; Canto-Lugo, E.; Rodríguez-Achach, M.

An agent-based model was built representing an economic environment in which m brands are competing for a product market. These agents represent companies that interact within a social network in which a certain agent persuades others to update or shift their brands; the brands of the products they are using. Decision rules were established that caused each agent to react according to the economic benefits it would receive; they updated/shifted only if it was beneficial. Each agent can have only one of the m possible brands, and she can interact with its two nearest neighbors and another set of agents which are chosen according to a particular set of rules in the network topology. An absorbing state was always reached in which a single brand monopolized the network (known as condensation). The condensation time varied as a function of model parameters is studied including an analysis of brand competition using different networks.

Resilient distributed control in the presence of misbehaving agents in networked control systems.

PubMed

Zeng, Wente; Chow, Mo-Yuen

2014-11-01

In this paper, we study the problem of reaching a consensus among all the agents in the networked control systems (NCS) in the presence of misbehaving agents. A reputation-based resilient distributed control algorithm is first proposed for the leader-follower consensus network. The proposed algorithm embeds a resilience mechanism that includes four phases (detection, mitigation, identification, and update), into the control process in a distributed manner. At each phase, every agent only uses local and one-hop neighbors' information to identify and isolate the misbehaving agents, and even compensate their effect on the system. We then extend the proposed algorithm to the leaderless consensus network by introducing and adding two recovery schemes (rollback and excitation recovery) into the current framework to guarantee the accurate convergence of the well-behaving agents in NCS. The effectiveness of the proposed method is demonstrated through case studies in multirobot formation control and wireless sensor networks.

The offer network protocol: Mathematical foundations and a roadmap for the development of a global brain

NASA Astrophysics Data System (ADS)

Heylighen, Francis

2017-01-01

The world is confronted with a variety of interdependent problems, including scarcity, unsustainability, inequality, pollution and poor governance. Tackling such complex challenges requires coordinated action. The present paper proposes the development of a self-organizing system for coordination, called an "offer network", that would use the distributed intelligence of the Internet to match the offers and needs of all human, technological and natural agents on the planet. This would maximize synergy and thus minimize waste and scarcity of resources. Implementing such coordination requires a protocol that formally defines agents, offers, needs, and the network of condition-action rules or reactions that interconnect them. Matching algorithms can then determine self-sustaining subnetworks in which each consumed resource (need) is also produced (offer). After sketching the elements of a mathematical foundation for offer networks, the paper proposes a roadmap for their practical implementation. This includes step-by-step integration with technologies such as the Semantic Web, ontologies, the Internet of Things, reputation and recommendation systems, reinforcement learning, governance through legal constraints and nudging, and ecosystem modeling. The resulting intelligent platform should be able to tackle nearly all practical and theoretical problems in a bottom-up, distributed manner, thus functioning like a Global Brain for humanity.

A standalone perfusion platform for drug testing and target validation in micro-vessel networks

PubMed Central

Zhang, Boyang; Peticone, Carlotta; Murthy, Shashi K.; Radisic, Milica

2013-01-01

Studying the effects of pharmacological agents on human endothelium includes the routine use of cell monolayers cultivated in multi-well plates. This configuration fails to recapitulate the complex architecture of vascular networks in vivo and does not capture the relationship between shear stress (i.e. flow) experienced by the cells and dose of the applied pharmacological agents. Microfluidic platforms have been applied extensively to create vascular systems in vitro; however, they rely on bulky external hardware to operate, which hinders the wide application of microfluidic chips by non-microfluidic experts. Here, we have developed a standalone perfusion platform where multiple devices were perfused at a time with a single miniaturized peristaltic pump. Using the platform, multiple micro-vessel networks, that contained three levels of branching structures, were created by culturing endothelial cells within circular micro-channel networks mimicking the geometrical configuration of natural blood vessels. To demonstrate the feasibility of our platform for drug testing and validation assays, a drug induced nitric oxide assay was performed on the engineered micro-vessel network using a panel of vaso-active drugs (acetylcholine, phenylephrine, atorvastatin, and sildenafil), showing both flow and drug dose dependent responses. The interactive effects between flow and drug dose for sildenafil could not be captured by a simple straight rectangular channel coated with endothelial cells, but it was captured in a more physiological branching circular network. A monocyte adhesion assay was also demonstrated with and without stimulation by an inflammatory cytokine, tumor necrosis factor-α. PMID:24404058

The value of less connected agents in Boolean networks

NASA Astrophysics Data System (ADS)

Epstein, Daniel; Bazzan, Ana L. C.

2013-11-01

In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality that help to see how agents are organized.

A Framework of Complex Adaptive Systems: Parents As Partners in the Neonatal Intensive Care Unit.

PubMed

DʼAgata, Amy L; McGrath, Jacqueline M

2016-01-01

Advances in neonatal care are allowing for increased infant survival; however, neurodevelopmental complications continue. Using a complex adaptive system framework, a broad analysis of the network of agents most influential to vulnerable infants in the neonatal intensive care unit (NICU) is presented: parent, nurse, and organization. By exploring these interconnected relationships and the emergent behaviors, a model of care that increases parental caregiving in the NICU is proposed. Supportive parent caregiving early in an infant's NICU stay has the potential for more sensitive caregiving and enhanced opportunities for attachment, perhaps positively impacting neurodevelopment.

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.

A Literature Review on Operator Interface Technologies for Network Enabled Operational Environments Using Complex System Analysis

DTIC Science & Technology

2009-05-30

d’interface fondées sur le comportement et sur la psychologie , ainsi que des méthodes de conception et de mise en œuvre d’interfaces multi-agents. On a mis...réseaucentriques. Ces technologies comprennent des approches de conception d’interface fondées sur le comportement et sur la psychologie , ainsi que des

Distributed robust adaptive control of high order nonlinear multi agent systems.

PubMed

Hashemi, Mahnaz; Shahgholian, Ghazanfar

2018-03-01

In this paper, a robust adaptive neural network based controller is presented for multi agent high order nonlinear systems with unknown nonlinear functions, unknown control gains and unknown actuator failures. At first, Neural Network (NN) is used to approximate the nonlinear uncertainty terms derived from the controller design procedure for the followers. Then, a novel distributed robust adaptive controller is developed by combining the backstepping method and the Dynamic Surface Control (DSC) approach. The proposed controllers are distributed in the sense that the designed controller for each follower agent only requires relative state information between itself and its neighbors. By using the Young's inequality, only few parameters need to be tuned regardless of NN nodes number. Accordingly, the problems of dimensionality curse and explosion of complexity are counteracted, simultaneously. New adaptive laws are designed by choosing the appropriate Lyapunov-Krasovskii functionals. The proposed approach proves the boundedness of all the closed-loop signals in addition to the convergence of the distributed tracking errors to a small neighborhood of the origin. Simulation results indicate that the proposed controller is effective and robust. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Distributed Optimization of Multi-Agent Systems: Framework, Local Optimizer, and Applications

NASA Astrophysics Data System (ADS)

Zu, Yue

Convex optimization problem can be solved in a centralized or distributed manner. Compared with centralized methods based on single-agent system, distributed algorithms rely on multi-agent systems with information exchanging among connected neighbors, which leads to great improvement on the system fault tolerance. Thus, a task within multi-agent system can be completed with presence of partial agent failures. By problem decomposition, a large-scale problem can be divided into a set of small-scale sub-problems that can be solved in sequence/parallel. Hence, the computational complexity is greatly reduced by distributed algorithm in multi-agent system. Moreover, distributed algorithm allows data collected and stored in a distributed fashion, which successfully overcomes the drawbacks of using multicast due to the bandwidth limitation. Distributed algorithm has been applied in solving a variety of real-world problems. Our research focuses on the framework and local optimizer design in practical engineering applications. In the first one, we propose a multi-sensor and multi-agent scheme for spatial motion estimation of a rigid body. Estimation performance is improved in terms of accuracy and convergence speed. Second, we develop a cyber-physical system and implement distributed computation devices to optimize the in-building evacuation path when hazard occurs. The proposed Bellman-Ford Dual-Subgradient path planning method relieves the congestion in corridor and the exit areas. At last, highway traffic flow is managed by adjusting speed limits to minimize the fuel consumption and travel time in the third project. Optimal control strategy is designed through both centralized and distributed algorithm based on convex problem formulation. Moreover, a hybrid control scheme is presented for highway network travel time minimization. Compared with no controlled case or conventional highway traffic control strategy, the proposed hybrid control strategy greatly reduces total travel time on test highway network.

Inhomogeneity of epidemic spreading with entropy-based infected clusters.

PubMed

Wen-Jie, Zhou; Xing-Yuan, Wang

2013-12-01

Considering the difference in the sizes of the infected clusters in the dynamic complex networks, the normalized entropy based on infected clusters (δ*) is proposed to characterize the inhomogeneity of epidemic spreading. δ* gives information on the variability of the infected clusters in the system. We investigate the variation in the inhomogeneity of the distribution of the epidemic with the absolute velocity v of moving agent, the infection density ρ, and the interaction radius r. By comparing δ* in the dynamic networks with δH* in homogeneous mode, the simulation experiments show that the inhomogeneity of epidemic spreading becomes smaller with the increase of v, ρ, r.

Aperiodic dynamics in a deterministic adaptive network model of attitude formation in social groups

NASA Astrophysics Data System (ADS)

Ward, Jonathan A.; Grindrod, Peter

2014-07-01

Adaptive network models, in which node states and network topology coevolve, arise naturally in models of social dynamics that incorporate homophily and social influence. Homophily relates the similarity between pairs of nodes' states to their network coupling strength, whilst social influence causes coupled nodes' states to convergence. In this paper we propose a deterministic adaptive network model of attitude formation in social groups that includes these effects, and in which the attitudinal dynamics are represented by an activato-inhibitor process. We illustrate that consensus, corresponding to all nodes adopting the same attitudinal state and being fully connected, may destabilise via Turing instability, giving rise to aperiodic dynamics with sensitive dependence on initial conditions. These aperiodic dynamics correspond to the formation and dissolution of sub-groups that adopt contrasting attitudes. We discuss our findings in the context of cultural polarisation phenomena. Social influence. This reflects the fact that people tend to modify their behaviour and attitudes in response to the opinions of others [22-26]. We model social influence via diffusion: agents adjust their state according to a weighted sum (dictated by the evolving network) of the differences between their state and the states of their neighbours. Homophily. This relates the similarity of individuals' states to their frequency and strength of interaction [27]. Thus in our model, homophily drives the evolution of the weighted ‘social' network. A precise formulation of our model is given in Section 2. Social influence and homophily underpin models of social dynamics [21], which cover a wide range of sociological phenomena, including the diffusion of innovations [28-32], complex contagions [33-36], collective action [37-39], opinion dynamics [19,20,40,10,11,13,15,41,16], the emergence of social norms [42-44], group stability [45], social differentiation [46] and, of particular relevance here, cultural dissemination [47,12,48].Combining the effects of social influence and homophily naturally gives rise to an adaptive network, since social influence causes the states of agents that are strongly connected to become more similar, while homophily strengthens connections between agents whose states are already similar.1

Social network community structure and the contact-mediated sharing of commensal E. coli among captive rhesus macaques (Macaca mulatta).

PubMed

Balasubramaniam, Krishna; Beisner, Brianne; Guan, Jiahui; Vandeleest, Jessica; Fushing, Hsieh; Atwill, Edward; McCowan, Brenda

2018-01-01

In group-living animals, heterogeneity in individuals' social connections may mediate the sharing of microbial infectious agents. In this regard, the genetic relatedness of individuals' commensal gut bacterium Escherichia coli may be ideal to assess the potential for pathogen transmission through animal social networks. Here we use microbial phylogenetics and population genetics approaches, as well as host social network reconstruction, to assess evidence for the contact-mediated sharing of E. coli among three groups of captively housed rhesus macaques ( Macaca mulatta ), at multiple organizational scales. For each group, behavioral data on grooming, huddling, and aggressive interactions collected for a six-week period were used to reconstruct social network communities via the Data Cloud Geometry (DCG) clustering algorithm. Further, an E. coli isolate was biochemically confirmed and genotypically fingerprinted from fecal swabs collected from each macaque. Population genetics approaches revealed that Group Membership, in comparison to intrinsic attributes like age, sex, and/or matriline membership of individuals, accounted for the highest proportion of variance in E. coli genotypic similarity. Social network approaches revealed that such sharing was evident at the community-level rather than the dyadic level. Specifically, although we found no links between dyadic E. coli similarity and social contact frequencies, similarity was significantly greater among macaques within the same social network communities compared to those across different communities. Moreover, tests for one of our study-groups confirmed that E. coli isolated from macaque rectal swabs were more genotypically similar to each other than they were to isolates from environmentally deposited feces. In summary, our results suggest that among frequently interacting, spatially constrained macaques with complex social relationships, microbial sharing via fecal-oral, social contact-mediated routes may depend on both individuals' direct connections and on secondary network pathways that define community structure. They lend support to the hypothesis that social network communities may act as bottlenecks to contain the spread of infectious agents, thereby encouraging disease control strategies to focus on multiple organizational scales. Future directions includeincreasing microbial sampling effort per individual to better-detect dyadic transmission events, and assessments of the co-evolutionary links between sociality, infectious agent risk, and host immune function.

A Method for Decentralised Optimisation in Networks

NASA Astrophysics Data System (ADS)

Saramäki, Jari

2005-06-01

We outline a method for distributed Monte Carlo optimisation of computational problems in networks of agents, such as peer-to-peer networks of computers. The optimisation and messaging procedures are inspired by gossip protocols and epidemic data dissemination, and are decentralised, i.e. no central overseer is required. In the outlined method, each agent follows simple local rules and seeks for better solutions to the optimisation problem by Monte Carlo trials, as well as by querying other agents in its local neighbourhood. With proper network topology, good solutions spread rapidly through the network for further improvement. Furthermore, the system retains its functionality even in realistic settings where agents are randomly switched on and off.

An agent-based simulation of persistent inequalities in health behavior: Understanding the interdependent roles of segregation, clustering, and social influence.

PubMed

Langellier, Brent A

2016-12-01

Health inequalities are conspicuously persistent through time and often durable even in spite of interventions. In this study, I use agent-based simulation models (ABMs) to understand how the complex interrelationships between residential segregation, social network formation, group-level preferences, and social influence may contribute to this persistence. I use a more-stylized ABM, Bubblegum Village (BV), to understand how initial inequalities in bubblegum-chewing behaviors either endure, increase, or decrease over time given group-level differences in preferences, neighborhood-level barriers or facilitators of bubblegum chewing (e.g., access to bubblegum shops), and agents' preferences for segregation, homophily, and clustering (i.e., the 'tightness' of social networks). I further use BV to understand whether segregation and social network characteristics impact whether the effects of a bubblegum-reduction intervention that is very effective in the short term are durable over time, as well as to identify intervention strategies to reduce attenuation of the intervention effects. In addition to BV, I also present results from an ABM based on the distribution and social characteristics of the population in Philadelphia, PA. This model explores similar questions to BV, but examines racial/ethnic inequalities in soda consumption based on agents' social characteristics and baseline soda consumption probabilities informed by the 2007-2010 National Health and Nutrition Examination Survey. Collectively, the models suggest that residential segregation is a fundamental process for the production and persistence of health inequalities. The other major conclusion of the study is that, for behaviors that are subject to social influence and that cluster within social groups, interventions that are randomly-targeted to individuals with 'bad' behaviors will likely experience a large degree of recidivism to pre-intervention behaviors. In contrast, interventions that target multiple members of the same network, as well as multilevel interventions that include a neighborhood-level component, can reduce recidivism.

Pattern Analysis in Social Networks with Dynamic Connections

NASA Astrophysics Data System (ADS)

Wu, Yu; Zhang, Yu

In this paper, we explore how decentralized local interactions of autonomous agents in a network relate to collective behaviors. Most existing work in this area models social network in which agent relations are fixed; instead, we focus on dynamic social networks where agents can rationally adjust their neighborhoods based on their individual interests. We propose a new connection evaluation rule called the Highest Weighted Reward (HWR) rule, with which agents dynamically choose their neighbors in order to maximize their own utilities based on the rewards from previous interactions. Our experiments show that in the 2-action pure coordination game, our system will stabilize to a clustering state where all relationships in the network are rewarded with the optimal payoff. Our experiments also reveal additional interesting patterns in the network.

Adaptive architectures for resilient control of networked multiagent systems in the presence of misbehaving agents

NASA Astrophysics Data System (ADS)

Torre, Gerardo De La; Yucelen, Tansel

2018-03-01

Control algorithms of networked multiagent systems are generally computed distributively without having a centralised entity monitoring the activity of agents; and therefore, unforeseen adverse conditions such as uncertainties or attacks to the communication network and/or failure of agent-wise components can easily result in system instability and prohibit the accomplishment of system-level objectives. In this paper, we study resilient coordination of networked multiagent systems in the presence of misbehaving agents, i.e. agents that are subject to exogenous disturbances that represent a class of adverse conditions. In particular, a distributed adaptive control architecture is presented for directed and time-varying graph topologies to retrieve a desired networked multiagent system behaviour. Apart from the existing relevant literature that make specific assumptions on the graph topology and/or the fraction of misbehaving agents, we show that the considered class of adverse conditions can be mitigated by the proposed adaptive control approach that utilises a local state emulator - even if all agents are misbehaving. Illustrative numerical examples are provided to demonstrate the theoretical findings.

Pricing the Services in Dynamic Environment: Agent Pricing Model

NASA Astrophysics Data System (ADS)

Žagar, Drago; Rupčić, Slavko; Rimac-Drlje, Snježana

New Internet applications and services as well as new user demands open many new issues concerning dynamic management of quality of service and price for received service, respectively. The main goals of Internet service providers are to maximize profit and maintain a negotiated quality of service. From the users' perspective the main goal is to maximize ratio of received QoS and costs of service. However, achieving these objectives could become very complex if we know that Internet service users might during the session become highly dynamic and proactive. This connotes changes in user profile or network provider/s profile caused by high level of user mobility or variable level of user demands. This paper proposes a new agent based pricing architecture for serving the highly dynamic customers in context of dynamic user/network environment. The proposed architecture comprises main aspects and basic parameters that will enable objective and transparent assessment of the costs for the service those Internet users receive while dynamically change QoS demands and cost profile.

Autonomous Agents for Dynamic Process Planning in the Flexible Manufacturing System

NASA Astrophysics Data System (ADS)

Nik Nejad, Hossein Tehrani; Sugimura, Nobuhiro; Iwamura, Koji; Tanimizu, Yoshitaka

Rapid changes of market demands and pressures of competition require manufacturers to maintain highly flexible manufacturing systems to cope with a complex manufacturing environment. This paper deals with development of an agent-based architecture of dynamic systems for incremental process planning in the manufacturing systems. In consideration of alternative manufacturing processes and machine tools, the process plans and the schedules of the manufacturing resources are generated incrementally and dynamically. A negotiation protocol is discussed, in this paper, to generate suitable process plans for the target products real-timely and dynamically, based on the alternative manufacturing processes. The alternative manufacturing processes are presented by the process plan networks discussed in the previous paper, and the suitable process plans are searched and generated to cope with both the dynamic changes of the product specifications and the disturbances of the manufacturing resources. We initiatively combine the heuristic search algorithms of the process plan networks with the negotiation protocols, in order to generate suitable process plans in the dynamic manufacturing environment.

Temporal asymmetries in Interbank Market: an empirically grounded Agent-Based Model

NASA Astrophysics Data System (ADS)

Zlatic, Vinko; Popovic, Marko; Abraham, Hrvoje; Caldarelli, Guido; Iori, Giulia

2014-03-01

We analyse the changes in the topology of the structure of the E-mid interbank market in the period from September 1st 1999 to September 1st 2009. We uncover a type of temporal irreversibility in the growth of the largest component of the interbank trading network, which is not common to any of the usual network growth models. Such asymmetry, which is also detected on the growth of the clustering and reciprocity coefficient, reveals that the trading mechanism is driven by different dynamics at the beginning and at the end of the day. We are able to recover the complexity of the system by means of a simple Agent Based Model in which the probability of matching between counter parties depends on a time varying vertex fitness (or attractiveness) describing banks liquidity needs. We show that temporal irreversibility is associated with heterogeneity in the banking system and emerges when the distribution of liquidity shocks across banks is broad. We acknowledge support from FET project FOC-II.

False belief and counterfactual reasoning in a social environment.

PubMed

Van Hoeck, Nicole; Begtas, Elizabet; Steen, Johan; Kestemont, Jenny; Vandekerckhove, Marie; Van Overwalle, Frank

2014-04-15

Behavioral studies indicate that theory of mind and counterfactual reasoning are strongly related cognitive processes. In a neuroimaging study, we explored the common and distinct regions underlying these inference processes. We directly compared false belief reasoning (inferring an agent's false belief about an object's location or content) and counterfactual reasoning (inferring what the object's location or content would be if an agent had acted differently), both in contrast with a baseline condition of conditional reasoning (inferring what the true location or content of an object is). Results indicate that these three types of reasoning about social scenarios are supported by activations in the mentalizing network (left temporo-parietal junction and precuneus) and the executive control network (bilateral prefrontal cortex [PFC] and right inferior parietal lobule). In addition, representing a false belief or counterfactual state (both not directly observable in the external world) recruits additional activity in the executive control network (left dorsolateral PFC and parietal lobe). The results further suggest that counterfactual reasoning is a more complex cognitive process than false belief reasoning, showing stronger activation of the dorsomedial, left dorsolateral PFC, cerebellum and left temporal cortex. Copyright © 2013 Elsevier Inc. All rights reserved.

The evolving cobweb of relations among partially rational investors

PubMed Central

DiMeglio, Anna; Garofalo, Franco; Lo Iudice, Francesco

2017-01-01

To overcome the limitations of neoclassical economics, researchers have leveraged tools of statistical physics to build novel theories. The idea was to elucidate the macroscopic features of financial markets from the interaction of its microscopic constituents, the investors. In this framework, the model of the financial agents has been kept separate from that of their interaction. Here, instead, we explore the possibility of letting the interaction topology emerge from the model of the agents’ behavior. Then, we investigate how the emerging cobweb of relationship affects the overall market dynamics. To this aim, we leverage tools from complex systems analysis and nonlinear dynamics, and model the network of mutual influence as the output of a dynamical system describing the edge evolution. In this work, the driver of the link evolution is the relative reputation between possibly coupled agents. The reputation is built differently depending on the extent of rationality of the investors. The continuous edge activation or deactivation induces the emergence of leaders and of peculiar network structures, typical of real influence networks. The subsequent impact on the market dynamics is investigated through extensive numerical simulations in selected scenarios populated by partially rational investors. PMID:28196144

Cosine Kuramoto Based Distribution of a Convoy with Limit-Cycle Obstacle Avoidance Through the Use of Simulated Agents

NASA Astrophysics Data System (ADS)

Howerton, William

This thesis presents a method for the integration of complex network control algorithms with localized agent specific algorithms for maneuvering and obstacle avoidance. This method allows for successful implementation of group and agent specific behaviors. It has proven to be robust and will work for a variety of vehicle platforms. Initially, a review and implementation of two specific algorithms will be detailed. The first, a modified Kuramoto model was developed by Xu [1] which utilizes tools from graph theory to efficiently perform the task of distributing agents. The second algorithm developed by Kim [2] is an effective method for wheeled robots to avoid local obstacles using a limit-cycle navigation method. The results of implementing these methods on a test-bed of wheeled robots will be presented. Control issues related to outside disturbances not anticipated in the original theory are then discussed. A novel method of using simulated agents to separate the task of distributing agents from agent specific velocity and heading commands has been developed and implemented to address these issues. This new method can be used to combine various behaviors and is not limited to a specific control algorithm.

Approach for Autonomous Control of Unmanned Aerial Vehicle Using Intelligent Agents for Knowledge Creation

NASA Technical Reports Server (NTRS)

Dufrene, Warren R., Jr.

2004-01-01

This paper describes the development of a planned approach for Autonomous operation of an Unmanned Aerial Vehicle (UAV). A Hybrid approach will seek to provide Knowledge Generation through the application of Artificial Intelligence (AI) and Intelligent Agents (IA) for UAV control. The applications of several different types of AI techniques for flight are explored during this research effort. The research concentration is directed to the application of different AI methods within the UAV arena. By evaluating AI and biological system approaches. which include Expert Systems, Neural Networks. Intelligent Agents, Fuzzy Logic, and Complex Adaptive Systems, a new insight may be gained into the benefits of AI and CAS techniques applied to achieving true autonomous operation of these systems. Although flight systems were explored, the benefits should apply to many Unmanned Vehicles such as: Rovers. Ocean Explorers, Robots, and autonomous operation systems. A portion of the flight system is broken down into control agents that represent the intelligent agent approach used in AI. After the completion of a successful approach, a framework for applying an intelligent agent is presented. The initial results from simulation of a security agent for communication are presented.

Ecology Based Decentralized Agent Management System

NASA Technical Reports Server (NTRS)

Peysakhov, Maxim D.; Cicirello, Vincent A.; Regli, William C.

2004-01-01

The problem of maintaining a desired number of mobile agents on a network is not trivial, especially if we want a completely decentralized solution. Decentralized control makes a system more r e bust and less susceptible to partial failures. The problem is exacerbated on wireless ad hoc networks where host mobility can result in significant changes in the network size and topology. In this paper we propose an ecology-inspired approach to the management of the number of agents. The approach associates agents with living organisms and tasks with food. Agents procreate or die based on the abundance of uncompleted tasks (food). We performed a series of experiments investigating properties of such systems and analyzed their stability under various conditions. We concluded that the ecology based metaphor can be successfully applied to the management of agent populations on wireless ad hoc networks.

Noise Response Data Reveal Novel Controllability Gramian for Nonlinear Network Dynamics

PubMed Central

Kashima, Kenji

2016-01-01

Control of nonlinear large-scale dynamical networks, e.g., collective behavior of agents interacting via a scale-free connection topology, is a central problem in many scientific and engineering fields. For the linear version of this problem, the so-called controllability Gramian has played an important role to quantify how effectively the dynamical states are reachable by a suitable driving input. In this paper, we first extend the notion of the controllability Gramian to nonlinear dynamics in terms of the Gibbs distribution. Next, we show that, when the networks are open to environmental noise, the newly defined Gramian is equal to the covariance matrix associated with randomly excited, but uncontrolled, dynamical state trajectories. This fact theoretically justifies a simple Monte Carlo simulation that can extract effectively controllable subdynamics in nonlinear complex networks. In addition, the result provides a novel insight into the relationship between controllability and statistical mechanics. PMID:27264780

Self-organizing network services with evolutionary adaptation.

PubMed

Nakano, Tadashi; Suda, Tatsuya

2005-09-01

This paper proposes a novel framework for developing adaptive and scalable network services. In the proposed framework, a network service is implemented as a group of autonomous agents that interact in the network environment. Agents in the proposed framework are autonomous and capable of simple behaviors (e.g., replication, migration, and death). In this paper, an evolutionary adaptation mechanism is designed using genetic algorithms (GAs) for agents to evolve their behaviors and improve their fitness values (e.g., response time to a service request) to the environment. The proposed framework is evaluated through simulations, and the simulation results demonstrate the ability of autonomous agents to adapt to the network environment. The proposed framework may be suitable for disseminating network services in dynamic and large-scale networks where a large number of data and services need to be replicated, moved, and deleted in a decentralized manner.

Representing Micro-Macro Linkages by Actor-Based Dynamic Network Models

ERIC Educational Resources Information Center

Snijders, Tom A. B.; Steglich, Christian E. G.

2015-01-01

Stochastic actor-based models for network dynamics have the primary aim of statistical inference about processes of network change, but may be regarded as a kind of agent-based models. Similar to many other agent-based models, they are based on local rules for actor behavior. Different from many other agent-based models, by including elements of…

Residual Network Data Structures in Android Devices

DTIC Science & Technology

2011-09-01

Apple’s iOS, Google’s Android, RIM’s Blackberry and Nokia’s Symbian. Each Smartphone presents unique characteristics for forensic examiners. In...another. • Home Agent: A router on mobile node’s home network that tunnels traffic to mobile node when not on home network. Also maintains mobile nodes...Address notification to the Home Agent. When traffic arrives at the Home Agent for the mobile node, the Home Agent tunnels the traffic to the Care-of

Chemical hybridizing agent SQ-1-induced male sterility in Triticum aestivum L.: a comparative analysis of the anther proteome.

PubMed

Liu, Hongzhan; Zhang, Gaisheng; Wang, Junsheng; Li, Jingjing; Song, Yulong; Qiao, Lin; Niu, Na; Wang, Junwei; Ma, Shoucai; Li, Lili

2018-01-05

Heterosis is widely used to increase the yield of many crops. However, as wheat is a self-pollinating crop, hybrid breeding is not so successful in this organism. Even though male sterility induced by chemical hybridizing agents is an important aspect of crossbreeding, the mechanisms by which these agents induce male sterility in wheat is not well understood. We performed proteomic analyses using the wheat Triticum aestivum L.to identify those proteins involved in physiological male sterility (PHYMS) induced by the chemical hybridizing agent CHA SQ-1. A total of 103 differentially expressed proteins were found by 2D-PAGE and subsequently identified by MALDI-TOF/TOF MS/MS. In general, these proteins had obvious functional tendencies implicated in carbohydrate metabolism, oxidative stress and resistance, protein metabolism, photosynthesis, and cytoskeleton and cell structure. In combination with phenotypic, tissue section, and bioinformatics analyses, the identified differentially expressed proteins revealed a complex network behind the regulation of PHYMS and pollen development. Accordingly, we constructed a protein network of male sterility in wheat, drawing relationships between the 103 differentially expressed proteins and their annotated biological pathways. To further validate our proposed protein network, we determined relevant physiological values and performed real-time PCR assays. Our proteomics based approach has enabled us to identify certain tendencies in PHYMS anthers. Anomalies in carbohydrate metabolism and oxidative stress, together with premature tapetum degradation, may be the cause behind carbohydrate starvation and male sterility in CHA SQ-1 treated plants. Here, we provide important insight into the mechanisms underlying CHA SQ-1-induced male sterility. Our findings have practical implications for the application of hybrid breeding in wheat.

Using simple agent-based modeling to inform and enhance neighborhood walkability.

PubMed

Badland, Hannah; White, Marcus; Macaulay, Gus; Eagleson, Serryn; Mavoa, Suzanne; Pettit, Christopher; Giles-Corti, Billie

2013-12-11

Pedestrian-friendly neighborhoods with proximal destinations and services encourage walking and decrease car dependence, thereby contributing to more active and healthier communities. Proximity to key destinations and services is an important aspect of the urban design decision making process, particularly in areas adopting a transit-oriented development (TOD) approach to urban planning, whereby densification occurs within walking distance of transit nodes. Modeling destination access within neighborhoods has been limited to circular catchment buffers or more sophisticated network-buffers generated using geoprocessing routines within geographical information systems (GIS). Both circular and network-buffer catchment methods are problematic. Circular catchment models do not account for street networks, thus do not allow exploratory 'what-if' scenario modeling; and network-buffering functionality typically exists within proprietary GIS software, which can be costly and requires a high level of expertise to operate. This study sought to overcome these limitations by developing an open-source simple agent-based walkable catchment tool that can be used by researchers, urban designers, planners, and policy makers to test scenarios for improving neighborhood walkable catchments. A simplified version of an agent-based model was ported to a vector-based open source GIS web tool using data derived from the Australian Urban Research Infrastructure Network (AURIN). The tool was developed and tested with end-user stakeholder working group input. The resulting model has proven to be effective and flexible, allowing stakeholders to assess and optimize the walkability of neighborhood catchments around actual or potential nodes of interest (e.g., schools, public transport stops). Users can derive a range of metrics to compare different scenarios modeled. These include: catchment area versus circular buffer ratios; mean number of streets crossed; and modeling of different walking speeds and wait time at intersections. The tool has the capacity to influence planning and public health advocacy and practice, and by using open-access source software, it is available for use locally and internationally. There is also scope to extend this version of the tool from a simple to a complex model, which includes agents (i.e., simulated pedestrians) 'learning' and incorporating other environmental attributes that enhance walkability (e.g., residential density, mixed land use, traffic volume).

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.

Business Model Design from an ANT Perspective: Contributions and Insights of an Open and Living Theory

NASA Astrophysics Data System (ADS)

Costa, Cristina Chuva; da Cunha, Paulo Rupino

The way the Internet has connected millions of users at negligible costs has changed playing field for companies. Several stakeholders can now come together in virtual networks to create innovative business models that would be unfeasible in the physical world. However, the more radical the departure from the established models of value creation, the bigger the complexity in ensuring the sustained interest of the involved parties and the stability of the bonds. To address this problem, we sought inspiration in the Actor-Network Theory (ANT), which is capable of providing insights into socio-technical settings where human and non-human agents interact. We describe how several of its principles, ideas, and concepts were adapted and embedded in our approach for complex business model design or analysis. A simple illustration is provided. Our iterative approach helps systematically scrutinize and tune the contributions and returns of the various actors, ensuring that all end up with an attractive value proposal, thus promoting the robustness of the network. Guidelines for the services that an underlying information system must provide are also derived from the results.

APINetworks: A general API for the treatment of complex networks in arbitrary computational environments

NASA Astrophysics Data System (ADS)

Niño, Alfonso; Muñoz-Caro, Camelia; Reyes, Sebastián

2015-11-01

The last decade witnessed a great development of the structural and dynamic study of complex systems described as a network of elements. Therefore, systems can be described as a set of, possibly, heterogeneous entities or agents (the network nodes) interacting in, possibly, different ways (defining the network edges). In this context, it is of practical interest to model and handle not only static and homogeneous networks but also dynamic, heterogeneous ones. Depending on the size and type of the problem, these networks may require different computational approaches involving sequential, parallel or distributed systems with or without the use of disk-based data structures. In this work, we develop an Application Programming Interface (APINetworks) for the modeling and treatment of general networks in arbitrary computational environments. To minimize dependency between components, we decouple the network structure from its function using different packages for grouping sets of related tasks. The structural package, the one in charge of building and handling the network structure, is the core element of the system. In this work, we focus in this API structural component. We apply an object-oriented approach that makes use of inheritance and polymorphism. In this way, we can model static and dynamic networks with heterogeneous elements in the nodes and heterogeneous interactions in the edges. In addition, this approach permits a unified treatment of different computational environments. Tests performed on a C++11 version of the structural package show that, on current standard computers, the system can handle, in main memory, directed and undirected linear networks formed by tens of millions of nodes and edges. Our results compare favorably to those of existing tools.

Referral hospitals in the Democratic Republic of Congo as complex adaptive systems: similar program, different dynamics.

PubMed

Karemere, Hermès; Ribesse, Nathalie; Kahindo, Jean-Bosco; Macq, Jean

2015-01-01

In many African countries, first referral hospitals received little attention from development agencies until recently. We report the evolution of two of them in an unstable region like Eastern Democratic Republic of Congo when receiving the support from development aid program. Specifically, we aimed at studying how actors' network and institutional framework evolved over time and what could matter the most when looking at their performance in such an environment. We performed two cases studies between 2006 and 2010. We used multiple sources of data: reports to document events; health information system for hospital services production, and "key-informants" interviews to interpret the relation between interventions and services production. Our analysis was inspired from complex adaptive system theory. It started from the analysis of events implementation, to explore interaction process between the main agents in each hospital, and the consequence it could have on hospital health services production. This led to the development of new theoretical propositions. Two events implemented in the frame of the development aid program were identified by most of the key-informants interviewed as having the greatest impact on hospital performance: the development of a hospital plan and the performance based financing. They resulted in contrasting interaction process between the main agents between the two hospitals. Two groups of services production were reviewed: consultation at outpatient department and admissions, and surgery. The evolution of both groups of services production were different between both hospitals. By studying two first referral hospitals through the lens of a Complex Adaptive System, their performance in a context of development aid takes a different meaning. Success is not only measured through increased hospital production but through meaningful process of hospital agents'" network adaptation. Expected process is not necessarily a change; strengthened equilibrium and existing institutional arrangement may be a preferable result. Much more attention should be given in future international aid to the proper understanding of the hospital adaptation capacities.

Exacerbated vulnerability of coupled socio-economic risk in complex networks

NASA Astrophysics Data System (ADS)

Zhang, Xin; Feng, Ling; Berman, Yonatan; Hu, Ning; Stanley, H. Eugene

2016-10-01

The study of risk contagion in economic networks has most often focused on the financial liquidities of institutions and assets. In practice the agents in a network affect each other through social contagion, i.e., through herd behavior and the tendency to follow leaders. We study the coupled risk between social and economic contagion and find it significantly more severe than when economic risk is considered alone. Using the empirical network from the China venture capital market we find that the system exhibits an extreme risk of abrupt phase transition and large-scale damage, which is in clear contrast to the smooth phase transition traditionally observed in economic contagion alone. We also find that network structure impacts market resilience and that the randomization of the social network of the market participants can reduce system fragility when there is herd behavior. Our work indicates that under coupled contagion mechanisms network resilience can exhibit a fundamentally different behavior, i.e., an abrupt transition. It also reveals the extreme risk when a system has coupled socio-economic risks, and this could be of interest to both policy makers and market practitioners.

Hybrid evolutionary computing model for mobile agents of wireless Internet multimedia

NASA Astrophysics Data System (ADS)

Hortos, William S.

2001-03-01

The ecosystem is used as an evolutionary paradigm of natural laws for the distributed information retrieval via mobile agents to allow the computational load to be added to server nodes of wireless networks, while reducing the traffic on communication links. Based on the Food Web model, a set of computational rules of natural balance form the outer stage to control the evolution of mobile agents providing multimedia services with a wireless Internet protocol WIP. The evolutionary model shows how mobile agents should behave with the WIP, in particular, how mobile agents can cooperate, compete and learn from each other, based on an underlying competition for radio network resources to establish the wireless connections to support the quality of service QoS of user requests. Mobile agents are also allowed to clone themselves, propagate and communicate with other agents. A two-layer model is proposed for agent evolution: the outer layer is based on the law of natural balancing, the inner layer is based on a discrete version of a Kohonen self-organizing feature map SOFM to distribute network resources to meet QoS requirements. The former is embedded in the higher OSI layers of the WIP, while the latter is used in the resource management procedures of Layer 2 and 3 of the protocol. Algorithms for the distributed computation of mobile agent evolutionary behavior are developed by adding a learning state to the agent evolution state diagram. When an agent is in an indeterminate state, it can communicate to other agents. Computing models can be replicated from other agents. Then the agents transitions to the mutating state to wait for a new information-retrieval goal. When a wireless terminal or station lacks a network resource, an agent in the suspending state can change its policy to submit to the environment before it transitions to the searching state. The agents learn the facts of agent state information entered into an external database. In the cloning process, two agents on a host station sharing a common goal can be merged or married to compose a new agent. Application of the two-layer set of algorithms for mobile agent evolution, performed in a distributed processing environment, is made to the QoS management functions of the IP multimedia IM sub-network of the third generation 3G Wideband Code-division Multiple Access W-CDMA wireless network.

Statistical Physics of Cascading Failures in Complex Networks

NASA Astrophysics Data System (ADS)

Panduranga, Nagendra Kumar

Systems such as the power grid, world wide web (WWW), and internet are categorized as complex systems because of the presence of a large number of interacting elements. For example, the WWW is estimated to have a billion webpages and understanding the dynamics of such a large number of individual agents (whose individual interactions might not be fully known) is a challenging task. Complex network representations of these systems have proved to be of great utility. Statistical physics is the study of emergence of macroscopic properties of systems from the characteristics of the interactions between individual molecules. Hence, statistical physics of complex networks has been an effective approach to study these systems. In this dissertation, I have used statistical physics to study two distinct phenomena in complex systems: i) Cascading failures and ii) Shortest paths in complex networks. Understanding cascading failures is considered to be one of the "holy grails" in the study of complex systems such as the power grid, transportation networks, and economic systems. Studying failures of these systems as percolation on complex networks has proved to be insightful. Previously, cascading failures have been studied extensively using two different models: k-core percolation and interdependent networks. The first part of this work combines the two models into a general model, solves it analytically, and validates the theoretical predictions through extensive computer simulations. The phase diagram of the percolation transition has been systematically studied as one varies the average local k-core threshold and the coupling between networks. The phase diagram of the combined processes is very rich and includes novel features that do not appear in the models which study each of the processes separately. For example, the phase diagram consists of first- and second-order transition regions separated by two tricritical lines that merge together and enclose a two-stage transition region. In the two-stage transition, the size of the giant component undergoes a first-order jump at a certain occupation probability followed by a continuous second-order transition at a smaller occupation probability. Furthermore, at certain fixed interdependencies, the percolation transition cycles from first-order to second-order to two-stage to first-order as the k-core threshold is increased. We setup the analytical equations describing the phase boundaries of the two-stage transition region and we derive the critical exponents for each type of transition. Understanding the shortest paths between individual elements in systems like communication networks and social media networks is important in the study of information cascades in these systems. Often, large heterogeneity can be present in the connections between nodes in these networks. Certain sets of nodes can be more highly connected among themselves than with the nodes from other sets. These sets of nodes are often referred to as 'communities'. The second part of this work studies the effect of the presence of communities on the distribution of shortest paths in a network using a modular Erdős-Renyi network model. In this model, the number of communities and the degree of modularity of the network can be tuned using the parameters of the model. We find that the model reaches a percolation threshold while tuning the degree of modularity of the network and the distribution of the shortest paths in the network can be used as an indicator of how the communities are connected.

Compartmental and Spatial Rule-Based Modeling with Virtual Cell.

PubMed

Blinov, Michael L; Schaff, James C; Vasilescu, Dan; Moraru, Ion I; Bloom, Judy E; Loew, Leslie M

2017-10-03

In rule-based modeling, molecular interactions are systematically specified in the form of reaction rules that serve as generators of reactions. This provides a way to account for all the potential molecular complexes and interactions among multivalent or multistate molecules. Recently, we introduced rule-based modeling into the Virtual Cell (VCell) modeling framework, permitting graphical specification of rules and merger of networks generated automatically (using the BioNetGen modeling engine) with hand-specified reaction networks. VCell provides a number of ordinary differential equation and stochastic numerical solvers for single-compartment simulations of the kinetic systems derived from these networks, and agent-based network-free simulation of the rules. In this work, compartmental and spatial modeling of rule-based models has been implemented within VCell. To enable rule-based deterministic and stochastic spatial simulations and network-free agent-based compartmental simulations, the BioNetGen and NFSim engines were each modified to support compartments. In the new rule-based formalism, every reactant and product pattern and every reaction rule are assigned locations. We also introduce the rule-based concept of molecular anchors. This assures that any species that has a molecule anchored to a predefined compartment will remain in this compartment. Importantly, in addition to formulation of compartmental models, this now permits VCell users to seamlessly connect reaction networks derived from rules to explicit geometries to automatically generate a system of reaction-diffusion equations. These may then be simulated using either the VCell partial differential equations deterministic solvers or the Smoldyn stochastic simulator. Copyright © 2017 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Modeling Self-Healing of Concrete Using Hybrid Genetic Algorithm–Artificial Neural Network

PubMed Central

Ramadan Suleiman, Ahmed; Nehdi, Moncef L.

2017-01-01

This paper presents an approach to predicting the intrinsic self-healing in concrete using a hybrid genetic algorithm–artificial neural network (GA–ANN). A genetic algorithm was implemented in the network as a stochastic optimizing tool for the initial optimal weights and biases. This approach can assist the network in achieving a global optimum and avoid the possibility of the network getting trapped at local optima. The proposed model was trained and validated using an especially built database using various experimental studies retrieved from the open literature. The model inputs include the cement content, water-to-cement ratio (w/c), type and dosage of supplementary cementitious materials, bio-healing materials, and both expansive and crystalline additives. Self-healing indicated by means of crack width is the model output. The results showed that the proposed GA–ANN model is capable of capturing the complex effects of various self-healing agents (e.g., biochemical material, silica-based additive, expansive and crystalline components) on the self-healing performance in cement-based materials. PMID:28772495

Modeling Self-Healing of Concrete Using Hybrid Genetic Algorithm-Artificial Neural Network.

PubMed

Ramadan Suleiman, Ahmed; Nehdi, Moncef L

2017-02-07

This paper presents an approach to predicting the intrinsic self-healing in concrete using a hybrid genetic algorithm-artificial neural network (GA-ANN). A genetic algorithm was implemented in the network as a stochastic optimizing tool for the initial optimal weights and biases. This approach can assist the network in achieving a global optimum and avoid the possibility of the network getting trapped at local optima. The proposed model was trained and validated using an especially built database using various experimental studies retrieved from the open literature. The model inputs include the cement content, water-to-cement ratio (w/c), type and dosage of supplementary cementitious materials, bio-healing materials, and both expansive and crystalline additives. Self-healing indicated by means of crack width is the model output. The results showed that the proposed GA-ANN model is capable of capturing the complex effects of various self-healing agents (e.g., biochemical material, silica-based additive, expansive and crystalline components) on the self-healing performance in cement-based materials.

Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management.

PubMed

Cruz-Piris, Luis; Rivera, Diego; Fernandez, Susel; Marsa-Maestre, Ivan

2018-02-02

One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic) in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network.

Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management

PubMed Central

2018-01-01

One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic) in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network. PMID:29393884

Detection of communities with Naming Game-based methods

PubMed Central

Ribeiro, Carlos Henrique Costa

2017-01-01

Complex networks are often organized in groups or communities of agents that share the same features and/or functions, and this structural organization is built naturally with the formation of the system. In social networks, we argue that the dynamic of linguistic interactions of agreement among people can be a crucial factor in generating this community structure, given that sharing opinions with another person bounds them together, and disagreeing constantly would probably weaken the relationship. We present here a computational model of opinion exchange that uncovers the community structure of a network. Our aim is not to present a new community detection method proper, but to show how a model of social communication dynamics can reveal the (simple and overlapping) community structure in an emergent way. Our model is based on a standard Naming Game, but takes into consideration three social features: trust, uncertainty and opinion preference, that are built over time as agents communicate among themselves. We show that the separate addition of each social feature in the Naming Game results in gradual improvements with respect to community detection. In addition, the resulting uncertainty and trust values classify nodes and edges according to role and position in the network. Also, our model has shown a degree of accuracy both for non-overlapping and overlapping communities that are comparable with most algorithms specifically designed for topological community detection. PMID:28797097

A complex systems approach to constructing better models for managing financial markets and the economy

NASA Astrophysics Data System (ADS)

Farmer, J. Doyne; Gallegati, M.; Hommes, C.; Kirman, A.; Ormerod, P.; Cincotti, S.; Sanchez, A.; Helbing, D.

2012-11-01

We outline a vision for an ambitious program to understand the economy and financial markets as a complex evolving system of coupled networks of interacting agents. This is a completely different vision from that currently used in most economic models. This view implies new challenges and opportunities for policy and managing economic crises. The dynamics of such models inherently involve sudden and sometimes dramatic changes of state. Further, the tools and approaches we use emphasize the analysis of crises rather than of calm periods. In this they respond directly to the calls of Governors Bernanke and Trichet for new approaches to macroeconomic modelling.

Application of the dynamically allocated virtual clustering management system to emulated tactical network experimentation

NASA Astrophysics Data System (ADS)

Marcus, Kelvin

2014-06-01

The U.S Army Research Laboratory (ARL) has built a "Network Science Research Lab" to support research that aims to improve their ability to analyze, predict, design, and govern complex systems that interweave the social/cognitive, information, and communication network genres. Researchers at ARL and the Network Science Collaborative Technology Alliance (NS-CTA), a collaborative research alliance funded by ARL, conducted experimentation to determine if automated network monitoring tools and task-aware agents deployed within an emulated tactical wireless network could potentially increase the retrieval of relevant data from heterogeneous distributed information nodes. ARL and NS-CTA required the capability to perform this experimentation over clusters of heterogeneous nodes with emulated wireless tactical networks where each node could contain different operating systems, application sets, and physical hardware attributes. Researchers utilized the Dynamically Allocated Virtual Clustering Management System (DAVC) to address each of the infrastructure support requirements necessary in conducting their experimentation. The DAVC is an experimentation infrastructure that provides the means to dynamically create, deploy, and manage virtual clusters of heterogeneous nodes within a cloud computing environment based upon resource utilization such as CPU load, available RAM and hard disk space. The DAVC uses 802.1Q Virtual LANs (VLANs) to prevent experimentation crosstalk and to allow for complex private networks. Clusters created by the DAVC system can be utilized for software development, experimentation, and integration with existing hardware and software. The goal of this paper is to explore how ARL and the NS-CTA leveraged the DAVC to create, deploy and manage multiple experimentation clusters to support their experimentation goals.

Suppressing epidemic spreading by risk-averse migration in dynamical networks

NASA Astrophysics Data System (ADS)

Yang, Han-Xin; Tang, Ming; Wang, Zhen

2018-01-01

In this paper, we study the interplay between individual behaviors and epidemic spreading in a dynamical network. We distribute agents on a square-shaped region with periodic boundary conditions. Every agent is regarded as a node of the network and a wireless link is established between two agents if their geographical distance is less than a certain radius. At each time, every agent assesses the epidemic situation and make decisions on whether it should stay in or leave its current place. An agent will leave its current place with a speed if the number of infected neighbors reaches or exceeds a critical value E. Owing to the movement of agents, the network's structure is dynamical. Interestingly, we find that there exists an optimal value of E leading to the maximum epidemic threshold. This means that epidemic spreading can be effectively controlled by risk-averse migration. Besides, we find that the epidemic threshold increases as the recovering rate increases, decreases as the contact radius increases, and is maximized by an optimal moving speed. Our findings offer a deeper understanding of epidemic spreading in dynamical networks.

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

NASA Astrophysics Data System (ADS)

Gan, Yu; Tang, Ming; Yang, Hanxin

2013-05-01

Since the discovery of non-Poisson statistics of human mobility trajectories, more attention has been paid to understand the role of these patterns in different dynamics. In this study, we first introduce the heterogeneous mobility of mobile agents into dynamical networks, and then investigate packet forwarding strategy on the heterogeneous dynamical networks. We find that the faster speed and the higher proportion of high-speed agents can enhance the network throughput and reduce the mean traveling time in random forwarding. A hierarchical structure in the dependence of high-speed is observed: the network throughput remains unchanged at small and large high-speed value. It is also interesting to find that a slightly preferential forwarding to high-speed agents can maximize the network capacity. Through theoretical analysis and numerical simulations, we show that the optimal forwarding ratio stems from the local structural heterogeneity of low-speed agents.

Research of negotiation in network trade system based on multi-agent

NASA Astrophysics Data System (ADS)

Cai, Jun; Wang, Guozheng; Wu, Haiyan

2009-07-01

A construction and implementation technology of network trade based on multi-agent is described in this paper. First, we researched the technology of multi-agent, then we discussed the consumer's behaviors and the negotiation between purchaser and bargainer which emerges in the traditional business mode and analysed the key technology to implement the network trade system. Finally, we implement the system.

Agent Collaborative Target Localization and Classification in Wireless Sensor Networks

PubMed Central

Wang, Xue; Bi, Dao-wei; Ding, Liang; Wang, Sheng

2007-01-01

Wireless sensor networks (WSNs) are autonomous networks that have been frequently deployed to collaboratively perform target localization and classification tasks. Their autonomous and collaborative features resemble the characteristics of agents. Such similarities inspire the development of heterogeneous agent architecture for WSN in this paper. The proposed agent architecture views WSN as multi-agent systems and mobile agents are employed to reduce in-network communication. According to the architecture, an energy based acoustic localization algorithm is proposed. In localization, estimate of target location is obtained by steepest descent search. The search algorithm adapts to measurement environments by dynamically adjusting its termination condition. With the agent architecture, target classification is accomplished by distributed support vector machine (SVM). Mobile agents are employed for feature extraction and distributed SVM learning to reduce communication load. Desirable learning performance is guaranteed by combining support vectors and convex hull vectors. Fusion algorithms are designed to merge SVM classification decisions made from various modalities. Real world experiments with MICAz sensor nodes are conducted for vehicle localization and classification. Experimental results show the proposed agent architecture remarkably facilitates WSN designs and algorithm implementation. The localization and classification algorithms also prove to be accurate and energy efficient.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

NASA Astrophysics Data System (ADS)

Yang, Hong-Yong; Lu, Lan; Cao, Ke-Cai; Zhang, Si-Ying

2010-04-01

In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration.

Interactome of Obesity: Obesidome : Genetic Obesity, Stress Induced Obesity, Pathogenic Obesity Interaction.

PubMed

Geronikolou, Styliani A; Pavlopoulou, Athanasia; Cokkinos, Dennis; Chrousos, George

2017-01-01

Obesity is a chronic disease of increasing prevalence reaching epidemic proportions. Genetic defects as well as epigenetic effects contribute to the obesity phenotype. Investigating gene (e.g. MC4R defects)-environment (behavior, infectious agents, stress) interactions is a relative new field of great research interest. In this study, we have made an effort to create an interactome (henceforth referred to as "obesidome"), where extrinsic stressors response, intrinsic predisposition, immunity response to inflammation and autonomous nervous system implications are integrated. These pathways are presented in one interactome network for the first time. In our study, obesity-related genes/gene products were found to form a complex interactions network.

PILOT: An intelligent distributed operations support system

NASA Technical Reports Server (NTRS)

Rasmussen, Arthur N.

1993-01-01

The Real-Time Data System (RTDS) project is exploring the application of advanced technologies to the real-time flight operations environment of the Mission Control Centers at NASA's Johnson Space Center. The system, based on a network of engineering workstations, provides services such as delivery of real time telemetry data to flight control applications. To automate the operation of this complex distributed environment, a facility called PILOT (Process Integrity Level and Operation Tracker) is being developed. PILOT comprises a set of distributed agents cooperating with a rule-based expert system; together they monitor process operation and data flows throughout the RTDS network. The goal of PILOT is to provide unattended management and automated operation under user control.

Neural associative memories for the integration of language, vision and action in an autonomous agent.

PubMed

Markert, H; Kaufmann, U; Kara Kayikci, Z; Palm, G

2009-03-01

Language understanding is a long-standing problem in computer science. However, the human brain is capable of processing complex languages with seemingly no difficulties. This paper shows a model for language understanding using biologically plausible neural networks composed of associative memories. The model is able to deal with ambiguities on the single word and grammatical level. The language system is embedded into a robot in order to demonstrate the correct semantical understanding of the input sentences by letting the robot perform corresponding actions. For that purpose, a simple neural action planning system has been combined with neural networks for visual object recognition and visual attention control mechanisms.

Agent-based real-time signal coordination in congested networks.

DOT National Transportation Integrated Search

2014-01-01

This study is the continuation of a previous NEXTRANS study on agent-based reinforcement : learning methods for signal coordination in congested networks. In the previous study, the : formulation of a real-time agent-based traffic signal control in o...

Complex Physical, Biophysical and Econophysical Systems

NASA Astrophysics Data System (ADS)

Dewar, Robert L.; Detering, Frank

1. Introduction to complex and econophysics systems: a navigation map / T. Aste and T. Di Matteo -- 2. An introduction to fractional diffusion / B. I. Henry, T.A.M. Langlands and P. Straka -- 3. Space plasmas and fusion plasmas as complex systems / R. O. Dendy -- 4. Bayesian data analysis / M. S. Wheatland -- 5. Inverse problems and complexity in earth system science / I. G. Enting -- 6. Applied fluid chaos: designing advection with periodically reoriented flows for micro to geophysical mixing and transport enhancement / G. Metcalfe -- 7. Approaches to modelling the dynamical activity of brain function based on the electroencephalogram / D. T. J. Liley and F. Frascoli -- 8. Jaynes' maximum entropy principle, Riemannian metrics and generalised least action bound / R. K. Niven and B. Andresen -- 9. Complexity, post-genomic biology and gene expression programs / R. B. H. Williams and O. J.-H. Luo -- 10. Tutorials on agent-based modelling with NetLogo and network analysis with Pajek / M. J. Berryman and S. D. Angus.

Development and implementation of a PACS network and resource manager

NASA Astrophysics Data System (ADS)

Stewart, Brent K.; Taira, Ricky K.; Dwyer, Samuel J., III; Huang, H. K.

1992-07-01

Clinical acceptance of PACS is predicated upon maximum uptime. Upon component failure, detection, diagnosis, reconfiguration and repair must occur immediately. Our current PACS network is large, heterogeneous, complex and wide-spread geographically. The overwhelming number of network devices, computers and software processes involved in a departmental or inter-institutional PACS makes development of tools for network and resource management critical. The authors have developed and implemented a comprehensive solution (PACS Network-Resource Manager) using the OSI Network Management Framework with network element agents that respond to queries and commands for network management stations. Managed resources include: communication protocol layers for Ethernet, FDDI and UltraNet; network devices; computer and operating system resources; and application, database and network services. The Network-Resource Manager is currently being used for warning, fault, security violation and configuration modification event notification. Analysis, automation and control applications have been added so that PACS resources can be dynamically reconfigured and so that users are notified when active involvement is required. Custom data and error logging have been implemented that allow statistics for each PACS subsystem to be charted for performance data. The Network-Resource Manager allows our departmental PACS system to be monitored continuously and thoroughly, with a minimal amount of personal involvement and time.

An Embedded Multi-Agent Systems Based Industrial Wireless Sensor Network

PubMed Central

Brennan, Robert W.

2017-01-01

With the emergence of cyber-physical systems, there has been a growing interest in network-connected devices. One of the key requirements of a cyber-physical device is the ability to sense its environment. Wireless sensor networks are a widely-accepted solution for this requirement. In this study, an embedded multi-agent systems-managed wireless sensor network is presented. A novel architecture is proposed, along with a novel wireless sensor network architecture. Active and passive wireless sensor node types are defined, along with their communication protocols, and two application-specific examples are presented. A series of three experiments is conducted to evaluate the performance of the agent-embedded wireless sensor network. PMID:28906452

Competition-Driven Network Dynamics: Emergence of a Scale-Free Leadership Structure and Collective Efficiency

NASA Astrophysics Data System (ADS)

Anghel, M.; Toroczkai, Zoltán; Bassler, Kevin E.; Korniss, G.

2004-02-01

Using the minority game as a model for competition dynamics, we investigate the effects of interagent communications across a network on the global evolution of the game. Agent communication across this network leads to the formation of an influence network, which is dynamically coupled to the evolution of the game, and it is responsible for the information flow driving the agents' actions. We show that the influence network spontaneously develops hubs with a broad distribution of in-degrees, defining a scale-free robust leadership structure. Furthermore, in realistic parameter ranges, facilitated by information exchange on the network, agents can generate a high degree of cooperation making the collective almost maximally efficient.

An Embedded Multi-Agent Systems Based Industrial Wireless Sensor Network.

PubMed

Taboun, Mohammed S; Brennan, Robert W

2017-09-14

With the emergence of cyber-physical systems, there has been a growing interest in network-connected devices. One of the key requirements of a cyber-physical device is the ability to sense its environment. Wireless sensor networks are a widely-accepted solution for this requirement. In this study, an embedded multi-agent systems-managed wireless sensor network is presented. A novel architecture is proposed, along with a novel wireless sensor network architecture. Active and passive wireless sensor node types are defined, along with their communication protocols, and two application-specific examples are presented. A series of three experiments is conducted to evaluate the performance of the agent-embedded wireless sensor network.

Agent-based paradigm for integration of interactive cable television operations and business support systems

NASA Astrophysics Data System (ADS)

Wattawa, Scott

1995-11-01

Offering interactive services and data in a hybrid fiber/coax cable system requires the coordination of a host of operations and business support systems. New service offerings and network growth and evolution create never-ending changes in the network infrastructure. Agent-based enterprise models provide a flexible mechanism for systems integration of service and support systems. Agent models also provide a mechanism to decouple interactive services from network architecture. By using the Java programming language, agents may be made safe, portable, and intelligent. This paper investigates the application of the Object Management Group's Common Object Request Brokering Architecture to the integration of a multiple services metropolitan area network.

Formation of Common Investment Networks by Project Establishment between Agents

NASA Astrophysics Data System (ADS)

Navarro-Barrientos, Jesús Emeterio

We present an investment model integrated with trust and reputation mechanisms where agents interact with each other to establish investment projects. We investigate the establishment of investment projects, the influence of the interaction between agents in the evolution of the distribution of wealth as well as the formation of common investment networks and some of their properties. Simulation results show that the wealth distribution presents a power law in its tail. Also, it is shown that the trust and reputation mechanism proposed leads to the establishment of networks among agents, presenting some of the typical characteristics of real-life networks like a high clustering coefficient and short average path length.

Performance Impact of Connectivity Restrictions and Increased Vulnerability Presence on Automated Attack Graph Generation

DTIC Science & Technology

2007-03-01

results (Ingols 2005). 2.4.3 Skybox - Skybox view Skybox View is a commercially available tool developed by Skybox Security that can automatically...generate attack graphs through the use of host-based agents, management interfaces, and an analysis server located on the target network ( Skybox 2006... Skybox , an examination of recent patents submitted by Skybox identified the algorithmic complexity of the product as n4, where n represents the number

Integrating Language and Cognition in Grounded Adaptive Agents

DTIC Science & Technology

2008-11-21

a gents w ill b e able t o communicate amo ng th emselves a nd w ith humans w ith the fl exibility and complexity of h uman language. Leonid...Cangelosi A., Hourdakis E . & Tikhanoff V. (2006). Language acquisition and symbol grounding transfer with neural networks and cognitive robots...Hence it is natural to define the following partial similarity measure between object i and concept k ieO ( ) ( )[∏ = − −−= d e keiekeke OSkil 1

Trade-offs Between Command and Control Architectures and Force Capabilities Using Battlespace Awareness

DTIC Science & Technology

2014-06-01

information superiority in Network- centric warfare .34 A brief discussion of the implementation of battlespace awareness is given. The method 3 Figure 2...developing the model used for this study. Lanchester Equations,39 System Dynamics models,40–42 Discrete Event Simulation, and Agent-based models (ABMs) were...popularity in the military modeling community in recent years due to their ability to effectively capture complex interactions in warfare scenarios with many

Technological integration and hyperconnectivity: Tools for promoting extreme human lifespans

NASA Astrophysics Data System (ADS)

Kyriazis, Marios

2015-07-01

Artificial, neurobiological, and social networks are three distinct complex adaptive systems (CAS), each containing discrete processing units (nodes, neurons, and humans respectively). Despite the apparent differences, these three networks are bound by common underlying principles which describe the behaviour of the system in terms of the connections of its components, and its emergent properties. The longevity (long-term retention and functionality) of the components of each of these systems is also defined by common principles. Here, I will examine some properties of the longevity and function of the components of artificial and neurobiological systems, and generalise these to the longevity and function of the components of social CAS. In other words, I will show that principles governing the long-term functionality of computer nodes and of neurons, may be extrapolated to the study of the long-term functionality of humans (or more precisely, of the noemes, an abstract combination of existence and digital fame). The study of these phenomena can provide useful insights regarding practical ways that can be used in order to maximize human longevity. The basic law governing these behaviours is the Law of Requisite Usefulness, which states that the length of retention of an agent within a CAS is proportional to the contribution of the agent to the overall adaptability of the system. Key Words: Complex Adaptive Systems, Hyper-connectivity, Human Longevity, Adaptability and Evolution, Noeme

Cytokines, chemokines, and colony-stimulating factors in human milk: the 1997 update.

PubMed

Garofalo, R P; Goldman, A S

1998-01-01

Epidemiologic studies conducted over the past 30 years to investigate the protective functions of human milk strongly support the notion that breast-feeding prevents infantile infections, particularly those affecting the gastrointestinal and respiratory tracts. However, more recent clinical and experimental observations also suggest that human milk not only provides passive protection, but also can directly modulate the immunological development of the recipient infant. The study of this remarkable defense system in human milk has been difficult due to its biochemical complexity, the small concentration of certain bioactive components, the compartmentalization of some of these agents, the dynamic quantitative and qualitative changes of milk during lactation, and the lack of specific reagents to quantify these agents. Nevertheless, a host of bioactive substances including hormones, growth factors, and immunological factors such as cytokines have been identified in human milk. Cytokines are pluripotent polypeptides that act in autocrine/paracrine fashions by binding to specific cellular receptors. They operate in networks and orchestrate the development and functions of the immune system. Several different cytokines and chemokines have been discovered in human milk over the past years, and the list is growing very rapidly. This article will review the current knowledge about the increasingly complex network of chemoattractants, activators, and anti-inflammatory cytokines present in human milk and their potential role in compensating for the developmental delay of the neonate immune system.

Cytokines in human milk.

PubMed

Garofalo, Roberto

2010-02-01

Epidemiologic studies conducted in the past 30 years to investigate the protective functions of human milk strongly support the notion that breastfeeding prevents infantile infections, particularly those affecting the gastrointestinal and respiratory tracts. However, more recent clinical and experimental observations also suggest that human milk not only provides passive protection, but also can directly modulate the immunological development of the recipient infant. The study of this remarkable defense system in human milk has been difficult because of its biochemical complexity, the small concentration of certain bioactive components, the compartmentalization of some of these agents, the dynamic quantitative and qualitative changes of milk during lactation, and the lack of specific reagents to quantify these agents. However, a host of bioactive substances, including hormones, growth factors, and immunological factors such as cytokines, have been identified in human milk. Cytokines are pluripotent polypeptides that act in autocrine/paracrine fashions by binding to specific cellular receptors. They operate in networks and orchestrate the development and functions of immune system. Several different cytokines and chemokines have been discovered in human milk in the past years, and the list is growing very rapidly. This article will review the current knowledge about the increasingly complex network of chemoattractants, activators, and anti-inflammatory cytokines present in human milk and their potential role in compensating for the developmental delay of the neonate immune system. Copyright 2010. Published by Mosby, Inc.

Ant-inspired density estimation via random walks.

PubMed

Musco, Cameron; Su, Hsin-Hao; Lynch, Nancy A

2017-10-03

Many ant species use distributed population density estimation in applications ranging from quorum sensing, to task allocation, to appraisal of enemy colony strength. It has been shown that ants estimate local population density by tracking encounter rates: The higher the density, the more often the ants bump into each other. We study distributed density estimation from a theoretical perspective. We prove that a group of anonymous agents randomly walking on a grid are able to estimate their density within a small multiplicative error in few steps by measuring their rates of encounter with other agents. Despite dependencies inherent in the fact that nearby agents may collide repeatedly (and, worse, cannot recognize when this happens), our bound nearly matches what would be required to estimate density by independently sampling grid locations. From a biological perspective, our work helps shed light on how ants and other social insects can obtain relatively accurate density estimates via encounter rates. From a technical perspective, our analysis provides tools for understanding complex dependencies in the collision probabilities of multiple random walks. We bound the strength of these dependencies using local mixing properties of the underlying graph. Our results extend beyond the grid to more general graphs, and we discuss applications to size estimation for social networks, density estimation for robot swarms, and random walk-based sampling for sensor networks.

Dynamical systems approach to the study of a sociophysics agent-based model

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

Timpanaro, Andre M.; Prado, Carmen P. C.

2011-03-24

The Sznajd model is a Potts-like model that has been studied in the context of sociophysics [1,2](where spins are interpreted as opinions). In a recent work [3], we generalized the Sznajd model to include assymetric interactions between the spins (interpreted as biases towards opinions) and used dynamical systems techniques to tackle its mean-field version, given by the flow: {eta}{sub {sigma}} = {Sigma}{sub {sigma}}'{sup M} = 1{eta}{sub {sigma}}{eta}{sigma}'({eta}{sub {sigma}}{rho}{sigma}'{yields}{sigma}-{sigma}'{rho}{sigma}{yields}{sigma}').Where hs is the proportion of agents with opinion (spin){sigma}', M is the number of opinions and {sigma}'{yields}{sigma}' is the probability weight for an agent with opinion {sigma} being convinced by another agentmore » with opinion {sigma}'. We made Monte Carlo simulations of the model in a complex network (using Barabasi-Albert networks [4]) and they displayed the same attractors than the mean-field. Using linear stability analysis, we were able to determine the mean-field attractor structure analytically and to show that it has connections with well known graph theory problems (maximal independent sets and positive fluxes in directed graphs). Our dynamical systems approach is quite simple and can be used also in other models, like the voter model.« less

Constant Price of Anarchy in Network Creation Games via Public Service Advertising

NASA Astrophysics Data System (ADS)

Demaine, Erik D.; Zadimoghaddam, Morteza

Network creation games have been studied in many different settings recently. These games are motivated by social networks in which selfish agents want to construct a connection graph among themselves. Each node wants to minimize its average or maximum distance to the others, without paying much to construct the network. Many generalizations have been considered, including non-uniform interests between nodes, general graphs of allowable edges, bounded budget agents, etc. In all of these settings, there is no known constant bound on the price of anarchy. In fact, in many cases, the price of anarchy can be very large, namely, a constant power of the number of agents. This means that we have no control on the behavior of network when agents act selfishly. On the other hand, the price of stability in all these models is constant, which means that there is chance that agents act selfishly and we end up with a reasonable social cost.

Design, Implementation and Case Study of WISEMAN: WIreless Sensors Employing Mobile AgeNts

NASA Astrophysics Data System (ADS)

González-Valenzuela, Sergio; Chen, Min; Leung, Victor C. M.

We describe the practical implementation of Wiseman: our proposed scheme for running mobile agents in Wireless Sensor Networks. Wiseman’s architecture derives from a much earlier agent system originally conceived for distributed process coordination in wired networks. Given the memory constraints associated with small sensor devices, we revised the architecture of the original agent system to make it applicable to this type of networks. Agents are programmed as compact text scripts that are interpreted at the sensor nodes. Wiseman is currently implemented in TinyOS ver. 1, its binary image occupies 19Kbytes of ROM memory, and it occupies 3Kbytes of RAM to operate. We describe the rationale behind Wiseman’s interpreter architecture and unique programming features that can help reduce packet overhead in sensor networks. In addition, we gauge the proposed system’s efficiency in terms of task duration with different network topologies through a case study that involves an early-fire-detection application in a fictitious forest setting.

Structure and Connectivity Analysis of Financial Complex System Based on G-Causality Network

NASA Astrophysics Data System (ADS)

Xu, Chuan-Ming; Yan, Yan; Zhu, Xiao-Wu; Li, Xiao-Teng; Chen, Xiao-Song

2013-11-01

The recent financial crisis highlights the inherent weaknesses of the financial market. To explore the mechanism that maintains the financial market as a system, we study the interactions of U.S. financial market from the network perspective. Applied with conditional Granger causality network analysis, network density, in-degree and out-degree rankings are important indicators to analyze the conditional causal relationships among financial agents, and further to assess the stability of U.S. financial systems. It is found that the topological structure of G-causality network in U.S. financial market changed in different stages over the last decade, especially during the recent global financial crisis. Network density of the G-causality model is much higher during the period of 2007-2009 crisis stage, and it reaches the peak value in 2008, the most turbulent time in the crisis. Ranked by in-degrees and out-degrees, insurance companies are listed in the top of 68 financial institutions during the crisis. They act as the hubs which are more easily influenced by other financial institutions and simultaneously influence others during the global financial disturbance.

Effects of temporal correlations in social multiplex networks.

PubMed

Starnini, Michele; Baronchelli, Andrea; Pastor-Satorras, Romualdo

2017-08-17

Multi-layered networks represent a major advance in the description of natural complex systems, and their study has shed light on new physical phenomena. Despite its importance, however, the role of the temporal dimension in their structure and function has not been investigated in much detail so far. Here we study the temporal correlations between layers exhibited by real social multiplex networks. At a basic level, the presence of such correlations implies a certain degree of predictability in the contact pattern, as we quantify by an extension of the entropy and mutual information analyses proposed for the single-layer case. At a different level, we demonstrate that temporal correlations are a signature of a 'multitasking' behavior of network agents, characterized by a higher level of switching between different social activities than expected in a uncorrelated pattern. Moreover, temporal correlations significantly affect the dynamics of coupled epidemic processes unfolding on the network. Our work opens the way for the systematic study of temporal multiplex networks and we anticipate it will be of interest to researchers in a broad array of fields.

Collective helping and bystander effects in coevolving helping networks.

PubMed

Jo, Hang-Hyun; Lee, Hyun Keun; Park, Hyunggyu

2010-06-01

We study collective helping behavior and bystander effects in a coevolving helping network model. A node and a link of the network represents an agent who renders or receives help and a friendly relation between agents, respectively. A helping trial of an agent depends on relations with other involved agents and its result (success or failure) updates the relation between the helper and the recipient. We study the network link dynamics and its steady states analytically and numerically. The full phase diagram is presented with various kinds of active and inactive phases and the nature of phase transitions are explored. We find various interesting bystander effects, consistent with the field study results, of which the underlying mechanism is proposed.

Knowledge Diffusion on Networks through the Game Strategy

NASA Astrophysics Data System (ADS)

Sun, Shu; Wu, Jiangning; Xuan, Zhaoguo

In this paper, we develop a knowledge diffusion model in which agents determine to give their knowledge to others according to some exchange strategies. The typical network namely small-world network is used for modeling, on which agents with knowledge are viewed as the nodes of the network and the edges are viewed as the social relationships for knowledge transmission. Such agents are permitted to interact with their neighbors repeatedly who have direct connections with them and accordingly change their strategies by choosing the most beneficial neighbors to diffuse knowledge. Two kinds of knowledge transmission strategies are proposed for the theoretical model based on the game theory and thereafter used in different simulations to examine the effect of the network structure on the knowledge diffusion effect. By analyses, two main observations can be found: One is that the simulation results are contrary to our intuition which agents would like to only accept but not share, thus they will maximize their benefit; another one is that the number of the agents acquired knowledge and the corresponding knowledge stock turn out to be independent of the percentage of those agents who choose to contribute their knowledge.

Social network community structure and the contact-mediated sharing of commensal E. coli among captive rhesus macaques (Macaca mulatta)

PubMed Central

Beisner, Brianne; Guan, Jiahui; Vandeleest, Jessica; Fushing, Hsieh; Atwill, Edward; McCowan, Brenda

2018-01-01

In group-living animals, heterogeneity in individuals’ social connections may mediate the sharing of microbial infectious agents. In this regard, the genetic relatedness of individuals’ commensal gut bacterium Escherichia coli may be ideal to assess the potential for pathogen transmission through animal social networks. Here we use microbial phylogenetics and population genetics approaches, as well as host social network reconstruction, to assess evidence for the contact-mediated sharing of E. coli among three groups of captively housed rhesus macaques (Macaca mulatta), at multiple organizational scales. For each group, behavioral data on grooming, huddling, and aggressive interactions collected for a six-week period were used to reconstruct social network communities via the Data Cloud Geometry (DCG) clustering algorithm. Further, an E. coli isolate was biochemically confirmed and genotypically fingerprinted from fecal swabs collected from each macaque. Population genetics approaches revealed that Group Membership, in comparison to intrinsic attributes like age, sex, and/or matriline membership of individuals, accounted for the highest proportion of variance in E. coli genotypic similarity. Social network approaches revealed that such sharing was evident at the community-level rather than the dyadic level. Specifically, although we found no links between dyadic E. coli similarity and social contact frequencies, similarity was significantly greater among macaques within the same social network communities compared to those across different communities. Moreover, tests for one of our study-groups confirmed that E. coli isolated from macaque rectal swabs were more genotypically similar to each other than they were to isolates from environmentally deposited feces. In summary, our results suggest that among frequently interacting, spatially constrained macaques with complex social relationships, microbial sharing via fecal-oral, social contact-mediated routes may depend on both individuals’ direct connections and on secondary network pathways that define community structure. They lend support to the hypothesis that social network communities may act as bottlenecks to contain the spread of infectious agents, thereby encouraging disease control strategies to focus on multiple organizational scales. Future directions includeincreasing microbial sampling effort per individual to better-detect dyadic transmission events, and assessments of the co-evolutionary links between sociality, infectious agent risk, and host immune function. PMID:29372120

Networks of conforming or nonconforming individuals tend to reach satisfactory decisions.

PubMed

Ramazi, Pouria; Riehl, James; Cao, Ming

2016-11-15

Binary decisions of agents coupled in networks can often be classified into two types: "coordination," where an agent takes an action if enough neighbors are using that action, as in the spread of social norms, innovations, and viral epidemics, and "anticoordination," where too many neighbors taking a particular action causes an agent to take the opposite action, as in traffic congestion, crowd dispersion, and division of labor. Both of these cases can be modeled using linear-threshold-based dynamics, and a fundamental question is whether the individuals in such networks are likely to reach decisions with which they are satisfied. We show that, in the coordination case, and perhaps more surprisingly, also in the anticoordination case, the agents will indeed always tend to reach satisfactory decisions, that is, the network will almost surely reach an equilibrium state. This holds for every network topology and every distribution of thresholds, for both asynchronous and partially synchronous decision-making updates. These results reveal that irregular network topology, population heterogeneity, and partial synchrony are not sufficient to cause cycles or nonconvergence in linear-threshold dynamics; rather, other factors such as imitation or the coexistence of coordinating and anticoordinating agents must play a role.

Modeling the dynamical interaction between epidemics on overlay networks

NASA Astrophysics Data System (ADS)

Marceau, Vincent; Noël, Pierre-André; Hébert-Dufresne, Laurent; Allard, Antoine; Dubé, Louis J.

2011-08-01

Epidemics seldom occur as isolated phenomena. Typically, two or more viral agents spread within the same host population and may interact dynamically with each other. We present a general model where two viral agents interact via an immunity mechanism as they propagate simultaneously on two networks connecting the same set of nodes. By exploiting a correspondence between the propagation dynamics and a dynamical process performing progressive network generation, we develop an analytical approach that accurately captures the dynamical interaction between epidemics on overlay networks. The formalism allows for overlay networks with arbitrary joint degree distribution and overlap. To illustrate the versatility of our approach, we consider a hypothetical delayed intervention scenario in which an immunizing agent is disseminated in a host population to hinder the propagation of an undesirable agent (e.g., the spread of preventive information in the context of an emerging infectious disease).

Towards a Bio-inspired Security Framework for Mission-Critical Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Ren, Wei; Song, Jun; Ma, Zhao; Huang, Shiyong

Mission-critical wireless sensor networks (WSNs) have been found in numerous promising applications in civil and military fields. However, the functionality of WSNs extensively relies on its security capability for detecting and defending sophisticated adversaries, such as Sybil, worm hole and mobile adversaries. In this paper, we propose a bio-inspired security framework to provide intelligence-enabled security mechanisms. This scheme is composed of a middleware, multiple agents and mobile agents. The agents monitor the network packets, host activities, make decisions and launch corresponding responses. Middleware performs an infrastructure for the communication between various agents and corresponding mobility. Certain cognitive models and intelligent algorithms such as Layered Reference Model of Brain and Self-Organizing Neural Network with Competitive Learning are explored in the context of sensor networks that have resource constraints. The security framework and implementation are also described in details.

Agent-Based Modeling of China's Rural-Urban Migration and Social Network Structure.

PubMed

Fu, Zhaohao; Hao, Lingxin

2018-01-15

We analyze China's rural-urban migration and endogenous social network structures using agent-based modeling. The agents from census micro data are located in their rural origin with an empirical-estimated prior propensity to move. The population-scale social network is a hybrid one, combining observed family ties and locations of the origin with a parameter space calibrated from census, survey and aggregate data and sampled using a stepwise Latin Hypercube Sampling method. At monthly intervals, some agents migrate and these migratory acts change the social network by turning within-nonmigrant connections to between-migrant-nonmigrant connections, turning local connections to nonlocal connections, and adding among-migrant connections. In turn, the changing social network structure updates migratory propensities of those well-connected nonmigrants who become more likely to move. These two processes iterate over time. Using a core-periphery method developed from the k -core decomposition method, we identify and quantify the network structural changes and map these changes with the migration acceleration patterns. We conclude that network structural changes are essential for explaining migration acceleration observed in China during the 1995-2000 period.

Agent-based modeling of China's rural-urban migration and social network structure

NASA Astrophysics Data System (ADS)

Fu, Zhaohao; Hao, Lingxin

2018-01-01

We analyze China's rural-urban migration and endogenous social network structures using agent-based modeling. The agents from census micro data are located in their rural origin with an empirical-estimated prior propensity to move. The population-scale social network is a hybrid one, combining observed family ties and locations of the origin with a parameter space calibrated from census, survey and aggregate data and sampled using a stepwise Latin Hypercube Sampling method. At monthly intervals, some agents migrate and these migratory acts change the social network by turning within-nonmigrant connections to between-migrant-nonmigrant connections, turning local connections to nonlocal connections, and adding among-migrant connections. In turn, the changing social network structure updates migratory propensities of those well-connected nonmigrants who become more likely to move. These two processes iterate over time. Using a core-periphery method developed from the k-core decomposition method, we identify and quantify the network structural changes and map these changes with the migration acceleration patterns. We conclude that network structural changes are essential for explaining migration acceleration observed in China during the 1995-2000 period.

Representing Micro-Macro Linkages by Actor-Based Dynamic Network Models

PubMed Central

Snijders, Tom A.B.; Steglich, Christian E.G.

2014-01-01

Stochastic actor-based models for network dynamics have the primary aim of statistical inference about processes of network change, but may be regarded as a kind of agent-based models. Similar to many other agent-based models, they are based on local rules for actor behavior. Different from many other agent-based models, by including elements of generalized linear statistical models they aim to be realistic detailed representations of network dynamics in empirical data sets. Statistical parallels to micro-macro considerations can be found in the estimation of parameters determining local actor behavior from empirical data, and the assessment of goodness of fit from the correspondence with network-level descriptives. This article studies several network-level consequences of dynamic actor-based models applied to represent cross-sectional network data. Two examples illustrate how network-level characteristics can be obtained as emergent features implied by micro-specifications of actor-based models. PMID:25960578

Research on application of intelligent computation based LUCC model in urbanization process

NASA Astrophysics Data System (ADS)

Chen, Zemin

2007-06-01

Global change study is an interdisciplinary and comprehensive research activity with international cooperation, arising in 1980s, with the largest scopes. The interaction between land use and cover change, as a research field with the crossing of natural science and social science, has become one of core subjects of global change study as well as the front edge and hot point of it. It is necessary to develop research on land use and cover change in urbanization process and build an analog model of urbanization to carry out description, simulation and analysis on dynamic behaviors in urban development change as well as to understand basic characteristics and rules of urbanization process. This has positive practical and theoretical significance for formulating urban and regional sustainable development strategy. The effect of urbanization on land use and cover change is mainly embodied in the change of quantity structure and space structure of urban space, and LUCC model in urbanization process has been an important research subject of urban geography and urban planning. In this paper, based upon previous research achievements, the writer systematically analyzes the research on land use/cover change in urbanization process with the theories of complexity science research and intelligent computation; builds a model for simulating and forecasting dynamic evolution of urban land use and cover change, on the basis of cellular automation model of complexity science research method and multi-agent theory; expands Markov model, traditional CA model and Agent model, introduces complexity science research theory and intelligent computation theory into LUCC research model to build intelligent computation-based LUCC model for analog research on land use and cover change in urbanization research, and performs case research. The concrete contents are as follows: 1. Complexity of LUCC research in urbanization process. Analyze urbanization process in combination with the contents of complexity science research and the conception of complexity feature to reveal the complexity features of LUCC research in urbanization process. Urban space system is a complex economic and cultural phenomenon as well as a social process, is the comprehensive characterization of urban society, economy and culture, and is a complex space system formed by society, economy and nature. It has dissipative structure characteristics, such as opening, dynamics, self-organization, non-balance etc. Traditional model cannot simulate these social, economic and natural driving forces of LUCC including main feedback relation from LUCC to driving force. 2. Establishment of Markov extended model of LUCC analog research in urbanization process. Firstly, use traditional LUCC research model to compute change speed of regional land use through calculating dynamic degree, exploitation degree and consumption degree of land use; use the theory of fuzzy set to rewrite the traditional Markov model, establish structure transfer matrix of land use, forecast and analyze dynamic change and development trend of land use, and present noticeable problems and corresponding measures in urbanization process according to research results. 3. Application of intelligent computation research and complexity science research method in LUCC analog model in urbanization process. On the basis of detailed elaboration of the theory and the model of LUCC research in urbanization process, analyze the problems of existing model used in LUCC research (namely, difficult to resolve many complexity phenomena in complex urban space system), discuss possible structure realization forms of LUCC analog research in combination with the theories of intelligent computation and complexity science research. Perform application analysis on BP artificial neural network and genetic algorithms of intelligent computation and CA model and MAS technology of complexity science research, discuss their theoretical origins and their own characteristics in detail, elaborate the feasibility of them in LUCC analog research, and bring forward improvement methods and measures on existing problems of this kind of model. 4. Establishment of LUCC analog model in urbanization process based on theories of intelligent computation and complexity science. Based on the research on abovementioned BP artificial neural network, genetic algorithms, CA model and multi-agent technology, put forward improvement methods and application assumption towards their expansion on geography, build LUCC analog model in urbanization process based on CA model and Agent model, realize the combination of learning mechanism of BP artificial neural network and fuzzy logic reasoning, express the regulation with explicit formula, and amend the initial regulation through self study; optimize network structure of LUCC analog model and methods and procedures of model parameters with genetic algorithms. In this paper, I introduce research theory and methods of complexity science into LUCC analog research and presents LUCC analog model based upon CA model and MAS theory. Meanwhile, I carry out corresponding expansion on traditional Markov model and introduce the theory of fuzzy set into data screening and parameter amendment of improved model to improve the accuracy and feasibility of Markov model in the research on land use/cover change.

Systemic risk on different interbank network topologies

NASA Astrophysics Data System (ADS)

Lenzu, Simone; Tedeschi, Gabriele

2012-09-01

In this paper we develop an interbank market with heterogeneous financial institutions that enter into lending agreements on different network structures. Credit relationships (links) evolve endogenously via a fitness mechanism based on agents' performance. By changing the agent's trust on its neighbor's performance, interbank linkages self-organize themselves into very different network architectures, ranging from random to scale-free topologies. We study which network architecture can make the financial system more resilient to random attacks and how systemic risk spreads over the network. To perturb the system, we generate a random attack via a liquidity shock. The hit bank is not automatically eliminated, but its failure is endogenously driven by its incapacity to raise liquidity in the interbank network. Our analysis shows that a random financial network can be more resilient than a scale free one in case of agents' heterogeneity.

Multi-agent Negotiation Mechanisms for Statistical Target Classification in Wireless Multimedia Sensor Networks

PubMed Central

Wang, Xue; Bi, Dao-wei; Ding, Liang; Wang, Sheng

2007-01-01

The recent availability of low cost and miniaturized hardware has allowed wireless sensor networks (WSNs) to retrieve audio and video data in real world applications, which has fostered the development of wireless multimedia sensor networks (WMSNs). Resource constraints and challenging multimedia data volume make development of efficient algorithms to perform in-network processing of multimedia contents imperative. This paper proposes solving problems in the domain of WMSNs from the perspective of multi-agent systems. The multi-agent framework enables flexible network configuration and efficient collaborative in-network processing. The focus is placed on target classification in WMSNs where audio information is retrieved by microphones. To deal with the uncertainties related to audio information retrieval, the statistical approaches of power spectral density estimates, principal component analysis and Gaussian process classification are employed. A multi-agent negotiation mechanism is specially developed to efficiently utilize limited resources and simultaneously enhance classification accuracy and reliability. The negotiation is composed of two phases, where an auction based approach is first exploited to allocate the classification task among the agents and then individual agent decisions are combined by the committee decision mechanism. Simulation experiments with real world data are conducted and the results show that the proposed statistical approaches and negotiation mechanism not only reduce memory and computation requirements in WMSNs but also significantly enhance classification accuracy and reliability. PMID:28903223

Networked Community Change: Understanding Community Systems Change through the Lens of Social Network Analysis.

PubMed

Lawlor, Jennifer A; Neal, Zachary P

2016-06-01

Addressing complex problems in communities has become a key area of focus in recent years (Kania & Kramer, 2013, Stanford Social Innovation Review). Building on existing approaches to understanding and addressing problems, such as action research, several new approaches have emerged that shift the way communities solve problems (e.g., Burns, 2007, Systemic Action Research; Foth, 2006, Action Research, 4, 205; Kania & Kramer, 2011, Stanford Social Innovation Review, 1, 36). Seeking to bring clarity to the emerging literature on community change strategies, this article identifies the common features of the most widespread community change strategies and explores the conditions under which such strategies have the potential to be effective. We identify and describe five common features among the approaches to change. Then, using an agent-based model, we simulate network-building behavior among stakeholders participating in community change efforts using these approaches. We find that the emergent stakeholder networks are efficient when the processes are implemented under ideal conditions. © Society for Community Research and Action 2016.

Neural correlates of consciousness during general anesthesia using functional magnetic resonance imaging (fMRI).

PubMed

Bonhomme, V; Boveroux, P; Brichant, J F; Laureys, S; Boly, M

2012-01-01

This paper reviews the current knowledge about the mechanisms of anesthesia-induced alteration of consciousness. It is now evident that hypnotic anesthetic agents have specific brain targets whose function is hierarchically altered in a dose-dependent manner. Higher order networks, thought to be involved in mental content generation, as well as sub-cortical networks involved in thalamic activity regulation seems to be affected first by increasing concentrations of hypnotic agents that enhance inhibitory neurotransmission. Lower order sensory networks are preserved, including thalamo-cortical connectivity into those networks, even at concentrations that suppress responsiveness, but cross-modal sensory interactions are inhibited. Thalamo-cortical connectivity into the consciousness networks decreases with increasing concentrations of those agents, and is transformed into an anti-correlated activity between the thalamus and the cortex for the deepest levels of sedation, when the subject is non responsive. Future will tell us whether these brain function alterations are also observed with hypnotic agents that mainly inhibit excitatory neurotransmission. The link between the observations made using fMRI and the identified biochemical targets of hypnotic anesthetic agents still remains to be identified.

The Role of Histone Deacetylases in Neurodegenerative Diseases and Small-Molecule Inhibitors as a Potential Therapeutic Approach

NASA Astrophysics Data System (ADS)

Bürli, Roland W.; Thomas, Elizabeth; Beaumont, Vahri

Neurodegenerative disorders are devastating for patients and their social environment. Their etiology is poorly understood and complex. As a result, there is clearly an urgent need for therapeutic agents that slow down disease progress and alleviate symptoms. In this respect, interference with expression and function of multiple gene products at the epigenetic level has offered much promise, and histone deacetylases play a crucial role in these processes. This review presents an overview of the biological pathways in which these enzymes are involved and illustrates the complex network of proteins that governs their activity. An overview of small molecules that interfere with histone deacetylase function is provided.

Dynamic Control of Plans with Temporal Uncertainty

NASA Technical Reports Server (NTRS)

Morris, Paul; Muscettola, Nicola; Vidal, Thierry

2001-01-01

Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many applications involve processes of uncertain duration whose timing cannot be controlled by the execution agent. These cases require more complex notions of temporal feasibility. In previous work, various "controllability" properties such as Weak, Strong, and Dynamic Controllability have been defined. The most interesting and useful Controllability property, the Dynamic one, has ironically proved to be the most difficult to analyze. In this paper, we resolve the complexity issue for Dynamic Controllability. Unexpectedly, the problem turns out to be tractable. We also show how to efficiently execute networks whose status has been verified.

Using simple agent-based modeling to inform and enhance neighborhood walkability

PubMed Central

2013-01-01

Background Pedestrian-friendly neighborhoods with proximal destinations and services encourage walking and decrease car dependence, thereby contributing to more active and healthier communities. Proximity to key destinations and services is an important aspect of the urban design decision making process, particularly in areas adopting a transit-oriented development (TOD) approach to urban planning, whereby densification occurs within walking distance of transit nodes. Modeling destination access within neighborhoods has been limited to circular catchment buffers or more sophisticated network-buffers generated using geoprocessing routines within geographical information systems (GIS). Both circular and network-buffer catchment methods are problematic. Circular catchment models do not account for street networks, thus do not allow exploratory ‘what-if’ scenario modeling; and network-buffering functionality typically exists within proprietary GIS software, which can be costly and requires a high level of expertise to operate. Methods This study sought to overcome these limitations by developing an open-source simple agent-based walkable catchment tool that can be used by researchers, urban designers, planners, and policy makers to test scenarios for improving neighborhood walkable catchments. A simplified version of an agent-based model was ported to a vector-based open source GIS web tool using data derived from the Australian Urban Research Infrastructure Network (AURIN). The tool was developed and tested with end-user stakeholder working group input. Results The resulting model has proven to be effective and flexible, allowing stakeholders to assess and optimize the walkability of neighborhood catchments around actual or potential nodes of interest (e.g., schools, public transport stops). Users can derive a range of metrics to compare different scenarios modeled. These include: catchment area versus circular buffer ratios; mean number of streets crossed; and modeling of different walking speeds and wait time at intersections. Conclusions The tool has the capacity to influence planning and public health advocacy and practice, and by using open-access source software, it is available for use locally and internationally. There is also scope to extend this version of the tool from a simple to a complex model, which includes agents (i.e., simulated pedestrians) ‘learning’ and incorporating other environmental attributes that enhance walkability (e.g., residential density, mixed land use, traffic volume). PMID:24330721

Mitigation of short-term disturbance negative impacts in the agent-based model of a production companies network

NASA Astrophysics Data System (ADS)

Shevchuk, G. K.; Berg, D. B.; Zvereva, O. M.; Medvedeva, M. A.

2017-11-01

This article is devoted to the study of a supply chain disturbance impact on manufacturing volumes in a production system network. Each network agent's product can be used as a resource by other system agents (manufacturers). A supply chain disturbance can lead to operating cease of the entire network. Authors suggest using of short-term partial resources reservation to mitigate negative consequences of such disturbances. An agent-based model with a reservation algorithm compatible with strategies for resource procurement in terms of financial constraints was engineered. This model works in accordance with the static input-output Leontief 's model. The results can be used for choosing the ways of system's stability improving, and protecting it from various disturbances and imbalance.

Complex shaped boron carbides from negative additive manufacturing

DOE PAGES

Lu, Ryan; Chandrasekaran, Swetha; Du Frane, Wyatt L.; ...

2018-03-13

In this paper, complex shaped boron carbide with carbon (B 4C/C) at near-full densities were achieved for the first time using negative additive manufacturing techniques via gelcasting. Negative additive manufacturing involves 3D printing of sacrificial molds used for casting negative copies. B 4C powder distributions and rheology of suspensions were optimized to successfully cast complex shapes. In addition to demonstrating scalability of these complex geometries, hierarchically meso-porous structures were also shown to be possible from this technique. Resorcinol-Formaldehyde (RF) polymer was selected as the gelling agent and can also pyrolyze into a carbon aerogel network to act as the sinteringmore » aid for B 4C. Finally, due to the highly effective distribution of in situ carbon for the B 4C matrix, near-full sintered density of 97–98% of theoretical maximum density was achieved.« less

Complex shaped boron carbides from negative additive manufacturing

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

Lu, Ryan; Chandrasekaran, Swetha; Du Frane, Wyatt L.

In this paper, complex shaped boron carbide with carbon (B 4C/C) at near-full densities were achieved for the first time using negative additive manufacturing techniques via gelcasting. Negative additive manufacturing involves 3D printing of sacrificial molds used for casting negative copies. B 4C powder distributions and rheology of suspensions were optimized to successfully cast complex shapes. In addition to demonstrating scalability of these complex geometries, hierarchically meso-porous structures were also shown to be possible from this technique. Resorcinol-Formaldehyde (RF) polymer was selected as the gelling agent and can also pyrolyze into a carbon aerogel network to act as the sinteringmore » aid for B 4C. Finally, due to the highly effective distribution of in situ carbon for the B 4C matrix, near-full sintered density of 97–98% of theoretical maximum density was achieved.« less

Socio-contextual Network Mining for User Assistance in Web-based Knowledge Gathering Tasks

NASA Astrophysics Data System (ADS)

Rajendran, Balaji; Kombiah, Iyakutti

Web-based Knowledge Gathering (WKG) is a specialized and complex information seeking task carried out by many users on the web, for their various learning, and decision-making requirements. We construct a contextual semantic structure by observing the actions of the users involved in WKG task, in order to gain an understanding of their task and requirement. We also build a knowledge warehouse in the form of a master Semantic Link Network (SLX) that accommodates and assimilates all the contextual semantic structures. This master SLX, which is a socio-contextual network, is then mined to provide contextual inputs to the current users through their agents. We validated our approach through experiments and analyzed the benefits to the users in terms of resource explorations and the time saved. The results are positive enough to motivate us to implement in a larger scale.

Complex contagions with timers

NASA Astrophysics Data System (ADS)

Oh, Se-Wook; Porter, Mason A.

2018-03-01

There has been a great deal of effort to try to model social influence—including the spread of behavior, norms, and ideas—on networks. Most models of social influence tend to assume that individuals react to changes in the states of their neighbors without any time delay, but this is often not true in social contexts, where (for various reasons) different agents can have different response times. To examine such situations, we introduce the idea of a timer into threshold models of social influence. The presence of timers on nodes delays adoptions—i.e., changes of state—by the agents, which in turn delays the adoptions of their neighbors. With a homogeneously-distributed timer, in which all nodes have the same amount of delay, the adoption order of nodes remains the same. However, heterogeneously-distributed timers can change the adoption order of nodes and hence the "adoption paths" through which state changes spread in a network. Using a threshold model of social contagions, we illustrate that heterogeneous timers can either accelerate or decelerate the spread of adoptions compared to an analogous situation with homogeneous timers, and we investigate the relationship of such acceleration or deceleration with respect to the timer distribution and network structure. We derive an analytical approximation for the temporal evolution of the fraction of adopters by modifying a pair approximation for the Watts threshold model, and we find good agreement with numerical simulations. We also examine our new timer model on networks constructed from empirical data.

Safety and feasibility of targeted agent combinations in solid tumours.

PubMed

Park, Sook Ryun; Davis, Myrtle; Doroshow, James H; Kummar, Shivaani

2013-03-01

The plethora of novel molecular-targeted agents (MTAs) has provided an opportunity to selectively target pathways involved in carcinogenesis and tumour progression. Combination strategies of MTAs are being used to inhibit multiple aberrant pathways in the hope of optimizing antitumour efficacy and to prevent development of resistance. While the selection of specific agents in a given combination has been based on biological considerations (including the role of the putative targets in cancer) and the interactions of the agents used in combination, there has been little exploration of the possible enhanced toxicity of combinations resulting from alterations in multiple signalling pathways in normal cell biology. Owing to the complex networks and crosstalk that govern normal and tumour cell proliferation, inhibiting multiple pathways with MTA combinations can result in unpredictable disturbances in normal physiology. This Review focuses on the main toxicities and the lack of tolerability of some common MTA combinations, particularly where evidence of enhanced toxicity compared to either agent alone is documented or there is development of unexpected toxicity. Toxicities caused by MTA combinations highlight the need to introduce new preclinical testing paradigms early in the drug development process for the assessment of chronic toxicities resulting from such combinations.

Smart social adaptation prevents catastrophic ecological regime shifts in networks of myopic harvesters

NASA Astrophysics Data System (ADS)

Donges, Jonathan; Lucht, Wolfgang; Wiedermann, Marc; Heitzig, Jobst; Kurths, Jürgen

2015-04-01

In the anthropocene, the rise of global social and economic networks with ever increasing connectivity and speed of interactions, e.g., the internet or global financial markets, is a key challenge for sustainable development. The spread of opinions, values or technologies on these networks, in conjunction with the coevolution of the network structures themselves, underlies nexuses of current concern such as anthropogenic climate change, biodiversity loss or global land use change. To isolate and quantitatively study the effects and implications of network dynamics for sustainable development, we propose an agent-based model of information flow on adaptive networks between myopic harvesters that exploit private renewable resources. In this conceptual model of a network of socio-ecological systems, information on management practices flows between agents via boundedly rational imitation depending on the state of the resource stocks involved in an interaction. Agents can also adapt the structure of their social network locally by preferentially connecting to culturally similar agents with identical management practices and, at the same time, disconnecting from culturally dissimilar agents. Investigating in detail the statistical mechanics of this model, we find that an increasing rate of information flow through faster imitation dynamics or growing density of network connectivity leads to a marked increase in the likelihood of environmental resource collapse. However, we show that an optimal rate of social network adaptation can mitigate this negative effect without loss of social cohesion through network fragmentation. Our results highlight that seemingly immaterial network dynamics of spreading opinions or values can be of large relevance for the sustainable management of socio-ecological systems and suggest smartly conservative network adaptation as a strategy for mitigating environmental collapse. Hence, facing the great acceleration, these network dynamics should be more routinely incorporated in standard models of economic development or integrated assessment models used for evaluating anthropogenic climate change.

Network formation: neighborhood structures, establishment costs, and distributed learning.

PubMed

Chasparis, Georgios C; Shamma, Jeff S

2013-12-01

We consider the problem of network formation in a distributed fashion. Network formation is modeled as a strategic-form game, where agents represent nodes that form and sever unidirectional links with other nodes and derive utilities from these links. Furthermore, agents can form links only with a limited set of neighbors. Agents trade off the benefit from links, which is determined by a distance-dependent reward function, and the cost of maintaining links. When each agent acts independently, trying to maximize its own utility function, we can characterize “stable” networks through the notion of Nash equilibrium. In fact, the introduced reward and cost functions lead to Nash equilibria (networks), which exhibit several desirable properties such as connectivity, bounded-hop diameter, and efficiency (i.e., minimum number of links). Since Nash networks may not necessarily be efficient, we also explore the possibility of “shaping” the set of Nash networks through the introduction of state-based utility functions. Such utility functions may represent dynamic phenomena such as establishment costs (either positive or negative). Finally, we show how Nash networks can be the outcome of a distributed learning process. In particular, we extend previous learning processes to so-called “state-based” weakly acyclic games, and we show that the proposed network formation games belong to this class of games.

State-level legal preparedness for nuclear and radiological emergencies in the U.S.: a network analysis of state laws and regulations.

PubMed

Guclu, Hasan; Ferrell Bjerke, Elizabeth; Galvan, Jared; Sweeney, Patricia; Potter, Margaret A

2014-01-01

This study explored if and to what extent the laws of U.S. states mirrored the U.S. federal laws for responding to nuclear-radiological emergencies (NREs). Emergency laws from a 12-state sample and the federal government were retrieved and translated into numeric codes representing acting agents, their partner agents, and the purposes of activity in terms of preparedness, response, and recovery. We used network analysis to explore the relationships among agents in terms of legally directed NRE activities. States' legal networks for NREs appear as not highly inclusive, involving an average of 28% of agents among those specified in the federal laws. Certain agents are highly central in NRE networks, so that their capacity and effectiveness might strongly influence an NRE response. State-level lawmakers and planners might consider whether or not greater inclusion of agents, modeled on the federal government laws, would enhance their NRE laws and if more agents should be engaged in planning and policy-making for NRE incidents. Further research should explore if and to what extent legislated NRE directives impose constraints on practical response activities including emergency planning.

Multi-Agent Market Modeling of Foreign Exchange Rates

NASA Astrophysics Data System (ADS)

Zimmermann, Georg; Neuneier, Ralph; Grothmann, Ralph

A market mechanism is basically driven by a superposition of decisions of many agents optimizing their profit. The oeconomic price dynamic is a consequence of the cumulated excess demand/supply created on this micro level. The behavior analysis of a small number of agents is well understood through the game theory. In case of a large number of agents one may use the limiting case that an individual agent does not have an influence on the market, which allows the aggregation of agents by statistic methods. In contrast to this restriction, we can omit the assumption of an atomic market structure, if we model the market through a multi-agent approach. The contribution of the mathematical theory of neural networks to the market price formation is mostly seen on the econometric side: neural networks allow the fitting of high dimensional nonlinear dynamic models. Furthermore, in our opinion, there is a close relationship between economics and the modeling ability of neural networks because a neuron can be interpreted as a simple model of decision making. With this in mind, a neural network models the interaction of many decisions and, hence, can be interpreted as the price formation mechanism of a market.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY Trajectory Control of Scale-Free Dynamical Networks with Exogenous Disturbances

NASA Astrophysics Data System (ADS)

Yang, Hong-Yong; Zhang, Shun; Zong, Guang-Deng

2011-01-01

In this paper, the trajectory control of multi-agent dynamical systems with exogenous disturbances is studied. Suppose multiple agents composing of a scale-free network topology, the performance of rejecting disturbances for the low degree node and high degree node is analyzed. Firstly, the consensus of multi-agent systems without disturbances is studied by designing a pinning control strategy on a part of agents, where this pinning control can bring multiple agents' states to an expected consensus track. Then, the influence of the disturbances is considered by developing disturbance observers, and disturbance observers based control (DOBC) are developed for disturbances generated by an exogenous system to estimate the disturbances. Asymptotical consensus of the multi-agent systems with disturbances under the composite controller can be achieved for scale-free network topology. Finally, by analyzing examples of multi-agent systems with scale-free network topology and exogenous disturbances, the verities of the results are proved. Under the DOBC with the designed parameters, the trajectory convergence of multi-agent systems is researched by pinning two class of the nodes. We have found that it has more stronger robustness to exogenous disturbances for the high degree node pinned than that of the low degree node pinned.

Competition of information channels in the spreading of innovations

NASA Astrophysics Data System (ADS)

Kocsis, Gergely; Kun, Ferenc

2011-08-01

We study the spreading of information on technological developments in socioeconomic systems where the social contacts of agents are represented by a network of connections. In the model, agents get informed about the existence and advantages of new innovations through advertising activities of producers, which are then followed by an interagent information transfer. Computer simulations revealed that varying the strength of external driving and of interagent coupling, furthermore, the topology of social contacts, the model presents a complex behavior with interesting novel features: On the macrolevel the system exhibits logistic behavior typical for the diffusion of innovations. The time evolution can be described analytically by an integral equation that captures the nucleation and growth of clusters of informed agents. On the microlevel, small clusters are found to be compact with a crossover to fractal structures with increasing size. The distribution of cluster sizes has a power-law behavior with a crossover to a higher exponent when long-range social contacts are present in the system. Based on computer simulations we construct an approximate phase diagram of the model on a regular square lattice of agents.

A Parallel Sliding Region Algorithm to Make Agent-Based Modeling Possible for a Large-Scale Simulation: Modeling Hepatitis C Epidemics in Canada.

PubMed

Wong, William W L; Feng, Zeny Z; Thein, Hla-Hla

2016-11-01

Agent-based models (ABMs) are computer simulation models that define interactions among agents and simulate emergent behaviors that arise from the ensemble of local decisions. ABMs have been increasingly used to examine trends in infectious disease epidemiology. However, the main limitation of ABMs is the high computational cost for a large-scale simulation. To improve the computational efficiency for large-scale ABM simulations, we built a parallelizable sliding region algorithm (SRA) for ABM and compared it to a nonparallelizable ABM. We developed a complex agent network and performed two simulations to model hepatitis C epidemics based on the real demographic data from Saskatchewan, Canada. The first simulation used the SRA that processed on each postal code subregion subsequently. The second simulation processed the entire population simultaneously. It was concluded that the parallelizable SRA showed computational time saving with comparable results in a province-wide simulation. Using the same method, SRA can be generalized for performing a country-wide simulation. Thus, this parallel algorithm enables the possibility of using ABM for large-scale simulation with limited computational resources.

Competition of information channels in the spreading of innovations.

PubMed

Kocsis, Gergely; Kun, Ferenc

2011-08-01

We study the spreading of information on technological developments in socioeconomic systems where the social contacts of agents are represented by a network of connections. In the model, agents get informed about the existence and advantages of new innovations through advertising activities of producers, which are then followed by an interagent information transfer. Computer simulations revealed that varying the strength of external driving and of interagent coupling, furthermore, the topology of social contacts, the model presents a complex behavior with interesting novel features: On the macrolevel the system exhibits logistic behavior typical for the diffusion of innovations. The time evolution can be described analytically by an integral equation that captures the nucleation and growth of clusters of informed agents. On the microlevel, small clusters are found to be compact with a crossover to fractal structures with increasing size. The distribution of cluster sizes has a power-law behavior with a crossover to a higher exponent when long-range social contacts are present in the system. Based on computer simulations we construct an approximate phase diagram of the model on a regular square lattice of agents.

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.

Intracellular Mannose Binding Lectin Mediates Subcellular Trafficking of HIV-1 gp120 in Neurons

PubMed Central

Teodorof, C; Divakar, S; Soontornniyomkij, B; Achim, CL; Kaul, M; Singh, KK

2014-01-01

Human immunodeficiency virus -1 (HIV-1) enters the brain early during infection and leads to severe neuronal damage and central nervous system impairment. HIV-1 envelope glycoprotein 120 (gp120), a neurotoxin, undergoes intracellular trafficking and transport across neurons; however mechanisms of gp120 trafficking in neurons are unclear. Our results show that mannose binding lectin (MBL) that binds to the N-linked mannose residues on gp120, participates in intravesicular packaging of gp120 in neuronal subcellular organelles and also in subcellular trafficking of these vesicles in neuronal cells. Perinuclear MBL:gp120 vesicular complexes were observed and MBL facilitated the subcellular trafficking of gp120 via the endoplasmic reticulum (ER) and Golgi vesicles. The functional carbohydrate recognition domain of MBL was required for perinuclear organization, distribution and subcellular trafficking of MBL:gp120 vesicular complexes. Nocodazole, an agent that depolymerizes the microtubule network, abolished the trafficking of MBL:gp120 vesicles, suggesting that these vesicular complexes were transported along the microtubule network. Live cell imaging confirmed the association of the MBL:gp120 complexes with dynamic subcellular vesicles that underwent trafficking in neuronal soma and along the neurites. Thus, our findings suggest that intracellular MBL mediates subcellular trafficking and transport of viral glycoproteins in a microtubule-dependent mechanism in the neurons. PMID:24825317

Plant Phenotyping through the Eyes of Complex Systems: Theoretical Considerations

NASA Astrophysics Data System (ADS)

Kim, J.

2017-12-01

Plant phenotyping is an emerging transdisciplinary research which necessitates not only the communication and collaboration of scientists from different disciplines but also the paradigm shift to a holistic approach. Complex system is defined as a system having a large number of interacting parts (or particles, agents), whose interactions give rise to non-trivial properties like self-organization and emergence. Plant ecosystems are complex systems which are continually morphing dynamical systems, i.e. self-organizing hierarchical open systems. Such systems are composed of many subunits/subsystems with nonlinear interactions and feedback. The throughput such as the flow of energy, matter and information is the key control parameter in complex systems. Information theoretic approaches can be used to understand and identify such interactions, structures and dynamics through reductions in uncertainty (i.e. entropy). The theoretical considerations based on network and thermodynamic thinking and exemplary analyses (e.g. dynamic process network, spectral entropy) of the throughput time series will be presented. These can be used as a framework to develop more discipline-specific fundamental approaches to provide tools for the transferability of traits between measurement scales in plant phenotyping. Acknowledgment: This work was funded by the Weather Information Service Engine Program of the Korea Meteorological Administration under Grant KMIPA-2012-0001.

Intracellular mannose binding lectin mediates subcellular trafficking of HIV-1 gp120 in neurons.

PubMed

Teodorof, C; Divakar, S; Soontornniyomkij, B; Achim, C L; Kaul, M; Singh, K K

2014-09-01

Human immunodeficiency virus-1 (HIV-1) enters the brain early during infection and leads to severe neuronal damage and central nervous system impairment. HIV-1 envelope glycoprotein 120 (gp120), a neurotoxin, undergoes intracellular trafficking and transport across neurons; however mechanisms of gp120 trafficking in neurons are unclear. Our results show that mannose binding lectin (MBL) that binds to the N-linked mannose residues on gp120, participates in intravesicular packaging of gp120 in neuronal subcellular organelles and also in subcellular trafficking of these vesicles in neuronal cells. Perinuclear MBL:gp120 vesicular complexes were observed and MBL facilitated the subcellular trafficking of gp120 via the endoplasmic reticulum (ER) and Golgi vesicles. The functional carbohydrate recognition domain of MBL was required for perinuclear organization, distribution and subcellular trafficking of MBL:gp120 vesicular complexes. Nocodazole, an agent that depolymerizes the microtubule network, abolished the trafficking of MBL:gp120 vesicles, suggesting that these vesicular complexes were transported along the microtubule network. Live cell imaging confirmed the association of the MBL:gp120 complexes with dynamic subcellular vesicles that underwent trafficking in neuronal soma and along the neurites. Thus, our findings suggest that intracellular MBL mediates subcellular trafficking and transport of viral glycoproteins in a microtubule-dependent mechanism in the neurons. Published by Elsevier Inc.

The impact of socio-technical communication styles on the diversity and innovation potential of global science collaboratories

DOE PAGES

Ozmen, Ozgur; Yilmaz, Levent; Smith, Jeffrey

2016-02-09

Emerging cyber-infrastructure tools are enabling scientists to transparently co-develop, share, and communicate about real-time diverse forms of knowledge artifacts. In these environments, communication preferences of scientists are posited as an important factor affecting innovation capacity and robustness of social and knowledge network structures. Scientific knowledge creation in such communities is called global participatory science (GPS). Recently, using agent-based modeling and collective action theory as a basis, a complex adaptive social communication network model (CollectiveInnoSim) is implemented. This work leverages CollectiveInnoSim implementing communication preferences of scientists. Social network metrics and knowledge production patterns are used as proxy metrics to infer innovationmore » potential of emergent knowledge and collaboration networks. The objective is to present the underlying communication dynamics of GPS in a form of computational model and delineate the impacts of various communication preferences of scientists on innovation potential of the collaboration network. Ultimately, the insight gained can help policy-makers to design GPS environments and promote innovation.« less

The impact of socio-technical communication styles on the diversity and innovation potential of global science collaboratories

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

Ozmen, Ozgur; Yilmaz, Levent; Smith, Jeffrey

Emerging cyber-infrastructure tools are enabling scientists to transparently co-develop, share, and communicate about real-time diverse forms of knowledge artifacts. In these environments, communication preferences of scientists are posited as an important factor affecting innovation capacity and robustness of social and knowledge network structures. Scientific knowledge creation in such communities is called global participatory science (GPS). Recently, using agent-based modeling and collective action theory as a basis, a complex adaptive social communication network model (CollectiveInnoSim) is implemented. This work leverages CollectiveInnoSim implementing communication preferences of scientists. Social network metrics and knowledge production patterns are used as proxy metrics to infer innovationmore » potential of emergent knowledge and collaboration networks. The objective is to present the underlying communication dynamics of GPS in a form of computational model and delineate the impacts of various communication preferences of scientists on innovation potential of the collaboration network. Ultimately, the insight gained can help policy-makers to design GPS environments and promote innovation.« less

Efficient Allocation of Resources for Defense of Spatially Distributed Networks Using Agent-Based Simulation.

PubMed

Kroshl, William M; Sarkani, Shahram; Mazzuchi, Thomas A

2015-09-01

This article presents ongoing research that focuses on efficient allocation of defense resources to minimize the damage inflicted on a spatially distributed physical network such as a pipeline, water system, or power distribution system from an attack by an active adversary, recognizing the fundamental difference between preparing for natural disasters such as hurricanes, earthquakes, or even accidental systems failures and the problem of allocating resources to defend against an opponent who is aware of, and anticipating, the defender's efforts to mitigate the threat. Our approach is to utilize a combination of integer programming and agent-based modeling to allocate the defensive resources. We conceptualize the problem as a Stackelberg "leader follower" game where the defender first places his assets to defend key areas of the network, and the attacker then seeks to inflict the maximum damage possible within the constraints of resources and network structure. The criticality of arcs in the network is estimated by a deterministic network interdiction formulation, which then informs an evolutionary agent-based simulation. The evolutionary agent-based simulation is used to determine the allocation of resources for attackers and defenders that results in evolutionary stable strategies, where actions by either side alone cannot increase its share of victories. We demonstrate these techniques on an example network, comparing the evolutionary agent-based results to a more traditional, probabilistic risk analysis (PRA) approach. Our results show that the agent-based approach results in a greater percentage of defender victories than does the PRA-based approach. © 2015 Society for Risk Analysis.

Adaptive-network models of collective dynamics

NASA Astrophysics Data System (ADS)

Zschaler, G.

2012-09-01

Complex systems can often be modelled as networks, in which their basic units are represented by abstract nodes and the interactions among them by abstract links. This network of interactions is the key to understanding emergent collective phenomena in such systems. In most cases, it is an adaptive network, which is defined by a feedback loop between the local dynamics of the individual units and the dynamical changes of the network structure itself. This feedback loop gives rise to many novel phenomena. Adaptive networks are a promising concept for the investigation of collective phenomena in different systems. However, they also present a challenge to existing modelling approaches and analytical descriptions due to the tight coupling between local and topological degrees of freedom. In this work, which is essentially my PhD thesis, I present a simple rule-based framework for the investigation of adaptive networks, using which a wide range of collective phenomena can be modelled and analysed from a common perspective. In this framework, a microscopic model is defined by the local interaction rules of small network motifs, which can be implemented in stochastic simulations straightforwardly. Moreover, an approximate emergent-level description in terms of macroscopic variables can be derived from the microscopic rules, which we use to analyse the system's collective and long-term behaviour by applying tools from dynamical systems theory. We discuss three adaptive-network models for different collective phenomena within our common framework. First, we propose a novel approach to collective motion in insect swarms, in which we consider the insects' adaptive interaction network instead of explicitly tracking their positions and velocities. We capture the experimentally observed onset of collective motion qualitatively in terms of a bifurcation in this non-spatial model. We find that three-body interactions are an essential ingredient for collective motion to emerge. Moreover, we show what minimal microscopic interaction rules determine whether the transition to collective motion is continuous or discontinuous. Second, we consider a model of opinion formation in groups of individuals, where we focus on the effect of directed links in adaptive networks. Extending the adaptive voter model to directed networks, we find a novel fragmentation mechanism, by which the network breaks into distinct components of opposing agents. This fragmentation is mediated by the formation of self-stabilizing structures in the network, which do not occur in the undirected case. We find that they are related to degree correlations stemming from the interplay of link directionality and adaptive topological change. Third, we discuss a model for the evolution of cooperation among self-interested agents, in which the adaptive nature of their interaction network gives rise to a novel dynamical mechanism promoting cooperation. We show that even full cooperation can be achieved asymptotically if the networks' adaptive response to the agents' dynamics is sufficiently fast.

Explaining Inference on a Population of Independent Agents Using Bayesian Networks

ERIC Educational Resources Information Center

Sutovsky, Peter

2013-01-01

The main goal of this research is to design, implement, and evaluate a novel explanation method, the hierarchical explanation method (HEM), for explaining Bayesian network (BN) inference when the network is modeling a population of conditionally independent agents, each of which is modeled as a subnetwork. For example, consider disease-outbreak…

Adaptivity in Agent-Based Routing for Data Networks

NASA Technical Reports Server (NTRS)

Wolpert, David H.; Kirshner, Sergey; Merz, Chris J.; Turner, Kagan

2000-01-01

Adaptivity, both of the individual agents and of the interaction structure among the agents, seems indispensable for scaling up multi-agent systems (MAS s) in noisy environments. One important consideration in designing adaptive agents is choosing their action spaces to be as amenable as possible to machine learning techniques, especially to reinforcement learning (RL) techniques. One important way to have the interaction structure connecting agents itself be adaptive is to have the intentions and/or actions of the agents be in the input spaces of the other agents, much as in Stackelberg games. We consider both kinds of adaptivity in the design of a MAS to control network packet routing. We demonstrate on the OPNET event-driven network simulator the perhaps surprising fact that simply changing the action space of the agents to be better suited to RL can result in very large improvements in their potential performance: at their best settings, our learning-amenable router agents achieve throughputs up to three and one half times better than that of the standard Bellman-Ford routing algorithm, even when the Bellman-Ford protocol traffic is maintained. We then demonstrate that much of that potential improvement can be realized by having the agents learn their settings when the agent interaction structure is itself adaptive.

A secure 3-way routing protocols for intermittently connected mobile ad hoc networks.

PubMed

Sekaran, Ramesh; Parasuraman, Ganesh Kumar

2014-01-01

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

PubMed Central

Parasuraman, Ganesh Kumar

2014-01-01

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET. PMID:25136697

An Agent-Based Dynamic Model for Analysis of Distributed Space Exploration Architectures

NASA Astrophysics Data System (ADS)

Sindiy, Oleg V.; DeLaurentis, Daniel A.; Stein, William B.

2009-07-01

A range of complex challenges, but also potentially unique rewards, underlie the development of exploration architectures that use a distributed, dynamic network of resources across the solar system. From a methodological perspective, the prime challenge is to systematically model the evolution (and quantify comparative performance) of such architectures, under uncertainty, to effectively direct further study of specialized trajectories, spacecraft technologies, concept of operations, and resource allocation. A process model for System-of-Systems Engineering is used to define time-varying performance measures for comparative architecture analysis and identification of distinguishing patterns among interoperating systems. Agent-based modeling serves as the means to create a discrete-time simulation that generates dynamics for the study of architecture evolution. A Solar System Mobility Network proof-of-concept problem is introduced representing a set of longer-term, distributed exploration architectures. Options within this set revolve around deployment of human and robotic exploration and infrastructure assets, their organization, interoperability, and evolution, i.e., a system-of-systems. Agent-based simulations quantify relative payoffs for a fully distributed architecture (which can be significant over the long term), the latency period before they are manifest, and the up-front investment (which can be substantial compared to alternatives). Verification and sensitivity results provide further insight on development paths and indicate that the framework and simulation modeling approach may be useful in architectural design of other space exploration mass, energy, and information exchange settings.

Ant-inspired density estimation via random walks

PubMed Central

Musco, Cameron; Su, Hsin-Hao

2017-01-01

Many ant species use distributed population density estimation in applications ranging from quorum sensing, to task allocation, to appraisal of enemy colony strength. It has been shown that ants estimate local population density by tracking encounter rates: The higher the density, the more often the ants bump into each other. We study distributed density estimation from a theoretical perspective. We prove that a group of anonymous agents randomly walking on a grid are able to estimate their density within a small multiplicative error in few steps by measuring their rates of encounter with other agents. Despite dependencies inherent in the fact that nearby agents may collide repeatedly (and, worse, cannot recognize when this happens), our bound nearly matches what would be required to estimate density by independently sampling grid locations. From a biological perspective, our work helps shed light on how ants and other social insects can obtain relatively accurate density estimates via encounter rates. From a technical perspective, our analysis provides tools for understanding complex dependencies in the collision probabilities of multiple random walks. We bound the strength of these dependencies using local mixing properties of the underlying graph. Our results extend beyond the grid to more general graphs, and we discuss applications to size estimation for social networks, density estimation for robot swarms, and random walk-based sampling for sensor networks. PMID:28928146

Social adaptation in multi-agent model of linguistic categorization is affected by network information flow.

PubMed

Zubek, Julian; Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz

2017-01-01

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems.

Social adaptation in multi-agent model of linguistic categorization is affected by network information flow

PubMed Central

Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz

2017-01-01

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems. PMID:28809957

Mic Flocks in the Cloud: Harnessing Mobile Ubiquitous Sensor Networks

NASA Astrophysics Data System (ADS)

Garces, M. A.; Christe, A.

2015-12-01

Smartphones provide a commercial, off-the-shelf solution to capture, store, analyze, and distribute infrasound using on-board or external microphones (mics) as well as on-board barometers. Free iOS infrasound apps can be readily downloaded from the Apple App Store, and Android versions are in progress. Infrasound propagates for great distances, has low sample rates, and provides a tractable pilot study scenario for open distributed sensor networks at regional and global scales using one of the most ubiquitous sensors on Earth - microphones. Data collection is no longer limited to selected vendors at exclusive prices: anybody on Earth can record and stream infrasound, and the diversity of recording systems and environments is rapidly expanding. Global deployment may be fast and easy (www.redvox.io), but comes with the cost of increasing data volume, velocity, variety, and complexity. Flocking - the collective motion of mobile agents - is a natural human response to threats or events of interest. Anticipating, modeling and harnessing flocking sensor topologies will be necessary for adaptive array and network processing. The increasing data quantity and complexity will exceed the processing capacity of human analysts and most research servers. We anticipate practical real-time applications will require the on-demand adaptive scalability and resources of the Cloud. Cloud architectures for such heterogeneous sensor networks will consider eventual integration into the Global Earth Observation System of Systems (GEOSS).

Network inoculation: Heteroclinics and phase transitions in an epidemic model

NASA Astrophysics Data System (ADS)

Yang, Hui; Rogers, Tim; Gross, Thilo

2016-08-01

In epidemiological modelling, dynamics on networks, and, in particular, adaptive and heterogeneous networks have recently received much interest. Here, we present a detailed analysis of a previously proposed model that combines heterogeneity in the individuals with adaptive rewiring of the network structure in response to a disease. We show that in this model, qualitative changes in the dynamics occur in two phase transitions. In a macroscopic description, one of these corresponds to a local bifurcation, whereas the other one corresponds to a non-local heteroclinic bifurcation. This model thus provides a rare example of a system where a phase transition is caused by a non-local bifurcation, while both micro- and macro-level dynamics are accessible to mathematical analysis. The bifurcation points mark the onset of a behaviour that we call network inoculation. In the respective parameter region, exposure of the system to a pathogen will lead to an outbreak that collapses but leaves the network in a configuration where the disease cannot reinvade, despite every agent returning to the susceptible class. We argue that this behaviour and the associated phase transitions can be expected to occur in a wide class of models of sufficient complexity.

Topology for Dominance for Network of Multi-Agent System

NASA Astrophysics Data System (ADS)

Szeto, K. Y.

2007-05-01

The resource allocation problem in evolving two-dimensional point patterns is investigated for the existence of good strategies for the construction of initial configuration that leads to fast dominance of the pattern by one single species, which can be interpreted as market dominance by a company in the context of multi-agent systems in econophysics. For hexagonal lattice, certain special topological arrangements of the resource in two-dimensions, such as rings, lines and clusters have higher probability of dominance, compared to random pattern. For more complex networks, a systematic way to search for a stable and dominant strategy of resource allocation in the changing environment is found by means of genetic algorithm. Five typical features can be summarized by means of the distribution function for the local neighborhood of friends and enemies as well as the local clustering coefficients: (1) The winner has more triangles than the loser has. (2) The winner likes to form clusters as the winner tends to connect with other winner rather than with losers; while the loser tends to connect with winners rather than losers. (3) The distribution function of friends as well as enemies for the winner is broader than the corresponding distribution function for the loser. (4) The connectivity at which the peak of the distribution of friends for the winner occurs is larger than that of the loser; while the peak values for friends for winners is lower. (5) The connectivity at which the peak of the distribution of enemies for the winner occurs is smaller than that of the loser; while the peak values for enemies for winners is lower. These five features appear to be general, at least in the context of two-dimensional hexagonal lattices of various sizes, hierarchical lattice, Voronoi diagrams, as well as high-dimensional random networks. These general local topological properties of networks are relevant to strategists aiming at dominance in evolving patterns when the interaction between the agents is local.

Trophallaxis-inspired model for distributed transport between randomly interacting agents

NASA Astrophysics Data System (ADS)

Gräwer, Johannes; Ronellenfitsch, Henrik; Mazza, Marco G.; Katifori, Eleni

2017-08-01

Trophallaxis, the regurgitation and mouth to mouth transfer of liquid food between members of eusocial insect societies, is an important process that allows the fast and efficient dissemination of food in the colony. Trophallactic systems are typically treated as a network of agent interactions. This approach, though valuable, does not easily lend itself to analytic predictions. In this work we consider a simple trophallactic system of randomly interacting agents with finite carrying capacity, and calculate analytically and via a series of simulations the global food intake rate for the whole colony as well as observables describing how uniformly the food is distributed within the nest. Our model and predictions provide a useful benchmark to assess to what level the observed food uptake rates and efficiency in food distribution is due to stochastic effects or specific trophallactic strategies by the ant colony. Our work also serves as a stepping stone to describing the collective properties of more complex trophallactic systems, such as those including division of labor between foragers and workers.

Feature Reinforcement Learning: Part I. Unstructured MDPs

NASA Astrophysics Data System (ADS)

Hutter, Marcus

2009-12-01

General-purpose, intelligent, learning agents cycle through sequences of observations, actions, and rewards that are complex, uncertain, unknown, and non-Markovian. On the other hand, reinforcement learning is well-developed for small finite state Markov decision processes (MDPs). Up to now, extracting the right state representations out of bare observations, that is, reducing the general agent setup to the MDP framework, is an art that involves significant effort by designers. The primary goal of this work is to automate the reduction process and thereby significantly expand the scope of many existing reinforcement learning algorithms and the agents that employ them. Before we can think of mechanizing this search for suitable MDPs, we need a formal objective criterion. The main contribution of this article is to develop such a criterion. I also integrate the various parts into one learning algorithm. Extensions to more realistic dynamic Bayesian networks are developed in Part II (Hutter, 2009c). The role of POMDPs is also considered there.

Trophallaxis-inspired model for distributed transport between randomly interacting agents.

PubMed

Gräwer, Johannes; Ronellenfitsch, Henrik; Mazza, Marco G; Katifori, Eleni

2017-08-01

Trophallaxis, the regurgitation and mouth to mouth transfer of liquid food between members of eusocial insect societies, is an important process that allows the fast and efficient dissemination of food in the colony. Trophallactic systems are typically treated as a network of agent interactions. This approach, though valuable, does not easily lend itself to analytic predictions. In this work we consider a simple trophallactic system of randomly interacting agents with finite carrying capacity, and calculate analytically and via a series of simulations the global food intake rate for the whole colony as well as observables describing how uniformly the food is distributed within the nest. Our model and predictions provide a useful benchmark to assess to what level the observed food uptake rates and efficiency in food distribution is due to stochastic effects or specific trophallactic strategies by the ant colony. Our work also serves as a stepping stone to describing the collective properties of more complex trophallactic systems, such as those including division of labor between foragers and workers.

Multi-agent Simulations of Population Behavior: A Promising Tool for Systems Biology.

PubMed

Colosimo, Alfredo

2018-01-01

This contribution reports on the simulation of some dynamical events observed in the collective behavior of different kinds of populations, ranging from shape-changing cells in a Petri dish to functionally correlated brain areas in vivo. The unifying methodological approach, based upon a Multi-Agent Simulation (MAS) paradigm as incorporated in the NetLogo™ interpreter, is a direct consequence of the cornerstone that simple, individual actions within a population of interacting agents often give rise to complex, collective behavior.The discussion will mainly focus on the emergence and spreading of synchronous activities within the population, as well as on the modulation of the collective behavior exerted by environmental force-fields. A relevant section of this contribution is dedicated to the extension of the MAS paradigm to Brain Network models. In such a general framework some recent applications taken from the direct experience of the author, and exploring the activation patterns characteristic of specific brain functional states, are described, and their impact on the Systems-Biology universe underlined.

Studies of Opinion Stability for Small Dynamic Networks with Opportunistic Agents

NASA Astrophysics Data System (ADS)

Sobkowicz, Pawel

There are numerous examples of societies with extremely stable mix of contrasting opinions. We argue that this stability is a result of an interplay between society network topology adjustment and opinion changing processes. To support this position we present a computer model of opinion formation based on some novel assumptions, designed to bring the model closer to social reality. In our model, the agents, in addition to changing their opinions due to influence of the rest of society and external propaganda, have the ability to modify their social network, forming links with agents sharing the same opinions and cutting the links with those they disagree with. To improve the model further we divide the agents into "fanatics" and "opportunists," depending on how easy it is to change their opinions. The simulations show significant differences compared to traditional models, where network links are static. In particular, for the dynamical model where inter-agent links are adjustable, the final network structure and opinion distribution is shown to resemble real world observations, such as social structures and persistence of minority groups even when most of the society is against them and the propaganda is strong.

A Decentralized Framework for Multi-Agent Robotic Systems

PubMed Central

2018-01-01

Over the past few years, decentralization of multi-agent robotic systems has become an important research area. These systems do not depend on a central control unit, which enables the control and assignment of distributed, asynchronous and robust tasks. However, in some cases, the network communication process between robotic agents is overlooked, and this creates a dependency for each agent to maintain a permanent link with nearby units to be able to fulfill its goals. This article describes a communication framework, where each agent in the system can leave the network or accept new connections, sending its information based on the transfer history of all nodes in the network. To this end, each agent needs to comply with four processes to participate in the system, plus a fifth process for data transfer to the nearest nodes that is based on Received Signal Strength Indicator (RSSI) and data history. To validate this framework, we use differential robotic agents and a monitoring agent to generate a topological map of an environment with the presence of obstacles. PMID:29389849

Adaptation and survivors in a random Boolean network.

PubMed

Nakamura, Ikuo

2002-04-01

We introduce the competitive agent with imitation strategy in a random Boolean network, in which the agent plays a competitive game that rewards those in minority. After a long time interval, the worst performer changes its strategy to the one of the best and the process is repeated. The network, initially in a chaotic state, evolves to an intermittent state and finally reaches a frozen state. Time series of survived species (whose strategies are imitated by other agents) in the system depend on the connectivity of each agent. In a system with various connectivity groups, the low connectivity groups win the minority game over the high connectivity groups. We also compared the result with mutation strategy system.

Transition to parenthood: the role of social interaction and endogenous networks.

PubMed

Diaz, Belinda Aparicio; Fent, Thomas; Prskawetz, Alexia; Bernardi, Laura

2011-05-01

Empirical studies indicate that the transition to parenthood is influenced by an individual's peer group. To study the mechanisms creating interdependencies across individuals' transition to parenthood and its timing, we apply an agent-based simulation model. We build a one-sex model and provide agents with three different characteristics: age, intended education, and parity. Agents endogenously form their network based on social closeness. Network members may then influence the agents' transition to higher parity levels. Our numerical simulations indicate that accounting for social interactions can explain the shift of first-birth probabilities in Austria during the period 1984 to 2004. Moreover, we apply our model to forecast age-specific fertility rates up to 2016.

Elucidating the druggable interface of protein-protein interactions using fragment docking and coevolutionary analysis.

PubMed

Bai, Fang; Morcos, Faruck; Cheng, Ryan R; Jiang, Hualiang; Onuchic, José N

2016-12-13

Protein-protein interactions play a central role in cellular function. Improving the understanding of complex formation has many practical applications, including the rational design of new therapeutic agents and the mechanisms governing signal transduction networks. The generally large, flat, and relatively featureless binding sites of protein complexes pose many challenges for drug design. Fragment docking and direct coupling analysis are used in an integrated computational method to estimate druggable protein-protein interfaces. (i) This method explores the binding of fragment-sized molecular probes on the protein surface using a molecular docking-based screen. (ii) The energetically favorable binding sites of the probes, called hot spots, are spatially clustered to map out candidate binding sites on the protein surface. (iii) A coevolution-based interface interaction score is used to discriminate between different candidate binding sites, yielding potential interfacial targets for therapeutic drug design. This approach is validated for important, well-studied disease-related proteins with known pharmaceutical targets, and also identifies targets that have yet to be studied. Moreover, therapeutic agents are proposed by chemically connecting the fragments that are strongly bound to the hot spots.

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.

Event-Triggered Distributed Average Consensus Over Directed Digital Networks With Limited Communication Bandwidth.

PubMed

Li, Huaqing; Chen, Guo; Huang, Tingwen; Dong, Zhaoyang; Zhu, Wei; Gao, Lan

2016-12-01

In this paper, we consider the event-triggered distributed average-consensus of discrete-time first-order multiagent systems with limited communication data rate and general directed network topology. In the framework of digital communication network, each agent has a real-valued state but can only exchange finite-bit binary symbolic data sequence with its neighborhood agents at each time step due to the digital communication channels with energy constraints. Novel event-triggered dynamic encoder and decoder for each agent are designed, based on which a distributed control algorithm is proposed. A scheme that selects the number of channel quantization level (number of bits) at each time step is developed, under which all the quantizers in the network are never saturated. The convergence rate of consensus is explicitly characterized, which is related to the scale of network, the maximum degree of nodes, the network structure, the scaling function, the quantization interval, the initial states of agents, the control gain and the event gain. It is also found that under the designed event-triggered protocol, by selecting suitable parameters, for any directed digital network containing a spanning tree, the distributed average consensus can be always achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step. Two simulation examples are provided to illustrate the feasibility of presented protocol and the correctness of the theoretical results.

Effect of crystals and fibrous network polymer additives on cellular morphology of microcellular foams

NASA Astrophysics Data System (ADS)

Miyamoto, Ryoma; Utano, Tatsumi; Yasuhara, Shunya; Ishihara, Shota; Ohshima, Masahiro

2015-05-01

In this study, the core-back foam injection molding was used for preparing microcelluar polypropylene (PP) foam with either a 1,3:2,4 bis-O-(4-methylbenzylidene)-D-sorbitol gelling agent (Gel-all MD) or a fibros network polymer additive (Metablen 3000). Both agent and addiive could effectively control the celluar morphology in foams but somehow different ways. In course of cooling the polymer with Gel-all MD in the mold caity, the agent enhanced the crystal nucleation and resulted in the large number of small crystals. The crystals acted as effective bubble nucleation agent in foaming process. Thus, the agent reduced the cell size and increased the cell density, drastically. Furthermore, the small crystals provided an inhomogenuity to the expanding cell wall and produced the high open cell content with nano-scale fibril structure. Gell-all as well as Metablene 3000 formed a gel-like fibrous network in melt. The network increased the elongational viscosity and tended to prevent the cell wall from breaking up. The foaming temperature window was widened by the presence of the network. Especially, the temperature window where the macro-fibrous structure was formed was expanded to the higher temperature. The effects of crystal nucleating agent and PTFE on crystals' size and number, viscoelsticity, rheological propreties of PP and cellular morphology were compared and thorougly investigated.

Graceful Failure and Societal Resilience Analysis Via Agent-Based Modeling and Simulation

NASA Astrophysics Data System (ADS)

Schopf, P. S.; Cioffi-Revilla, C.; Rogers, J. D.; Bassett, J.; Hailegiorgis, A. B.

2014-12-01

Agent-based social modeling is opening up new methodologies for the study of societal response to weather and climate hazards, and providing measures of resiliency that can be studied in many contexts, particularly in coupled human and natural-technological systems (CHANTS). Since CHANTS are complex adaptive systems, societal resiliency may or may not occur, depending on dynamics that lack closed form solutions. Agent-based modeling has been shown to provide a viable theoretical and methodological approach for analyzing and understanding disasters and societal resiliency in CHANTS. Our approach advances the science of societal resilience through computational modeling and simulation methods that complement earlier statistical and mathematical approaches. We present three case studies of social dynamics modeling that demonstrate the use of these agent based models. In Central Asia, we exmaine mutltiple ensemble simulations with varying climate statistics to see how droughts and zuds affect populations, transmission of wealth across generations, and the overall structure of the social system. In Eastern Africa, we explore how successive episodes of drought events affect the adaptive capacity of rural households. Human displacement, mainly, rural to urban migration, and livelihood transition particularly from pastoral to farming are observed as rural households interacting dynamically with the biophysical environment and continually adjust their behavior to accommodate changes in climate. In the far north case we demonstrate one of the first successful attempts to model the complete climate-permafrost-infrastructure-societal interaction network as a complex adaptive system/CHANTS implemented as a ``federated'' agent-based model using evolutionary computation. Analysis of population changes resulting from extreme weather across these and other cases provides evidence for the emergence of new steady states and shifting patterns of resilience.

A Lego Mindstorms NXT based test bench for multiagent exploratory systems and distributed network partitioning

NASA Astrophysics Data System (ADS)

Patil, Riya Raghuvir

Networks of communicating agents require distributed algorithms for a variety of tasks in the field of network analysis and control. For applications such as swarms of autonomous vehicles, ad hoc and wireless sensor networks, and such military and civilian applications as exploring and patrolling a robust autonomous system that uses a distributed algorithm for selfpartitioning can be significantly helpful. A single team of autonomous vehicles in a field may need to self-dissemble into multiple teams, conducive to completing multiple control tasks. Moreover, because communicating agents are subject to changes, namely, addition or failure of an agent or link, a distributed or decentralized algorithm is favorable over having a central agent. A framework to help with the study of self-partitioning of such multi agent systems that have most basic mobility model not only saves our time in conception but also gives us a cost effective prototype without negotiating the physical realization of the proposed idea. In this thesis I present my work on the implementation of a flexible and distributed stochastic partitioning algorithm on the LegoRTM Mindstorms' NXT on a graphical programming platform using National Instruments' LabVIEW(TM) forming a team of communicating agents via NXT-Bee radio module. We single out mobility, communication and self-partition as the core elements of the work. The goal is to randomly explore a precinct for reference sites. Agents who have discovered the reference sites announce their target acquisition to form a network formed based upon the distance of each agent with the other wherein the self-partitioning begins to find an optimal partition. Further, to illustrate the work, an experimental test-bench of five Lego NXT robots is presented.

Hopping in the Crowd to Unveil Network Topology.

PubMed

Asllani, Malbor; Carletti, Timoteo; Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2018-04-13

We introduce a nonlinear operator to model diffusion on a complex undirected network under crowded conditions. We show that the asymptotic distribution of diffusing agents is a nonlinear function of the nodes' degree and saturates to a constant value for sufficiently large connectivities, at variance with standard diffusion in the absence of excluded-volume effects. Building on this observation, we define and solve an inverse problem, aimed at reconstructing the a priori unknown connectivity distribution. The method gathers all the necessary information by repeating a limited number of independent measurements of the asymptotic density at a single node, which can be chosen randomly. The technique is successfully tested against both synthetic and real data and is also shown to estimate with great accuracy the total number of nodes.

Distributed Cognition on the road: Using EAST to explore future road transportation systems.

PubMed

Banks, Victoria A; Stanton, Neville A; Burnett, Gary; Hermawati, Setia

2018-04-01

Connected and Autonomous Vehicles (CAV) are set to revolutionise the way in which we use our transportation system. However, we do not fully understand how the integration of wireless and autonomous technology into the road transportation network affects overall network dynamism. This paper uses the theoretical principles underlying Distributed Cognition to explore the dependencies and interdependencies that exist between system agents located within the road environment, traffic management centres and other external agencies in both non-connected and connected transportation systems. This represents a significant step forward in modelling complex sociotechnical systems as it shows that the principles underlying Distributed Cognition can be applied to macro-level systems using the visual representations afforded by the Event Analysis of Systemic Teamwork (EAST) method. Copyright © 2017 Elsevier Ltd. All rights reserved.

Hopping in the Crowd to Unveil Network Topology

NASA Astrophysics Data System (ADS)

Asllani, Malbor; Carletti, Timoteo; Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2018-04-01

We introduce a nonlinear operator to model diffusion on a complex undirected network under crowded conditions. We show that the asymptotic distribution of diffusing agents is a nonlinear function of the nodes' degree and saturates to a constant value for sufficiently large connectivities, at variance with standard diffusion in the absence of excluded-volume effects. Building on this observation, we define and solve an inverse problem, aimed at reconstructing the a priori unknown connectivity distribution. The method gathers all the necessary information by repeating a limited number of independent measurements of the asymptotic density at a single node, which can be chosen randomly. The technique is successfully tested against both synthetic and real data and is also shown to estimate with great accuracy the total number of nodes.

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.

Using an agent-based model to evaluate the effect of producer specialization on the epidemiological resilience of livestock production networks.

PubMed

Wiltshire, Serge W

2018-01-01

An agent-based computer model that builds representative regional U.S. hog production networks was developed and employed to assess the potential impact of the ongoing trend towards increased producer specialization upon network-level resilience to catastrophic disease outbreaks. Empirical analyses suggest that the spatial distribution and connectivity patterns of contact networks often predict epidemic spreading dynamics. Our model heuristically generates realistic systems composed of hog producer, feed mill, and slaughter plant agents. Network edges are added during each run as agents exchange livestock and feed. The heuristics governing agents' contact patterns account for factors including their industry roles, physical proximities, and the age of their livestock. In each run, an infection is introduced, and may spread according to probabilities associated with the various modes of contact. For each of three treatments-defined by one-phase, two-phase, and three-phase production systems-a parameter variation experiment examines the impact of the spatial density of producer agents in the system upon the length and size of disease outbreaks. Resulting data show phase transitions whereby, above some density threshold, systemic outbreaks become possible, echoing findings from percolation theory. Data analysis reveals that multi-phase production systems are vulnerable to catastrophic outbreaks at lower spatial densities, have more abrupt percolation transitions, and are characterized by less-predictable outbreak scales and durations. Key differences in network-level metrics shed light on these results, suggesting that the absence of potentially-bridging producer-producer edges may be largely responsible for the superior disease resilience of single-phase "farrow to finish" production systems.

Communication Policies in Knowledge Networks

NASA Astrophysics Data System (ADS)

Ioannidis, Evangelos; Varsakelis, Nikos; Antoniou, Ioannis

2018-02-01

Faster knowledge attainment within organizations leads to improved innovation, and therefore competitive advantage. Interventions on the organizational network may be risky or costly or time-demanding. We investigate several communication policies in knowledge networks, which reduce the knowledge attainment time without interventions. We examine the resulting knowledge dynamics for real organizational networks, as well as for artificial networks. More specifically, we investigate the dependence of knowledge dynamics on: (1) the Selection Rule of agents for knowledge acquisition, and (2) the Order of implementation of "Selection" and "Filtering". Significant decrease of the knowledge attainment time (up to -74%) can be achieved by: (1) selecting agents of both high knowledge level and high knowledge transfer efficiency, and (2) implementing "Selection" after "Filtering" in contrast to the converse, implicitly assumed, conventional prioritization. The Non-Commutativity of "Selection" and "Filtering", reveals a Non-Boolean Logic of the Network Operations. The results demonstrate that significant improvement of knowledge dynamics can be achieved by implementing "fruitful" communication policies, by raising the awareness of agents, without any intervention on the network structure.

Impact of the topology of global macroeconomic network on the spreading of economic crises.

PubMed

Lee, Kyu-Min; Yang, Jae-Suk; Kim, Gunn; Lee, Jaesung; Goh, Kwang-Il; Kim, In-mook

2011-03-31

Throughout economic history, the global economy has experienced recurring crises. The persistent recurrence of such economic crises calls for an understanding of their generic features rather than treating them as singular events. The global economic system is a highly complex system and can best be viewed in terms of a network of interacting macroeconomic agents. In this regard, from the perspective of collective network dynamics, here we explore how the topology of the global macroeconomic network affects the patterns of spreading of economic crises. Using a simple toy model of crisis spreading, we demonstrate that an individual country's role in crisis spreading is not only dependent on its gross macroeconomic capacities, but also on its local and global connectivity profile in the context of the world economic network. We find that on one hand clustering of weak links at the regional scale can significantly aggravate the spread of crises, but on the other hand the current network structure at the global scale harbors higher tolerance of extreme crises compared to more "globalized" random networks. These results suggest that there can be a potential hidden cost in the ongoing globalization movement towards establishing less-constrained, trans-regional economic links between countries, by increasing vulnerability of the global economic system to extreme crises.

Impact of the Topology of Global Macroeconomic Network on the Spreading of Economic Crises

PubMed Central

Lee, Kyu-Min; Yang, Jae-Suk; Kim, Gunn; Lee, Jaesung; Goh, Kwang-Il; Kim, In-mook

2011-01-01

Throughout economic history, the global economy has experienced recurring crises. The persistent recurrence of such economic crises calls for an understanding of their generic features rather than treating them as singular events. The global economic system is a highly complex system and can best be viewed in terms of a network of interacting macroeconomic agents. In this regard, from the perspective of collective network dynamics, here we explore how the topology of the global macroeconomic network affects the patterns of spreading of economic crises. Using a simple toy model of crisis spreading, we demonstrate that an individual country's role in crisis spreading is not only dependent on its gross macroeconomic capacities, but also on its local and global connectivity profile in the context of the world economic network. We find that on one hand clustering of weak links at the regional scale can significantly aggravate the spread of crises, but on the other hand the current network structure at the global scale harbors higher tolerance of extreme crises compared to more “globalized” random networks. These results suggest that there can be a potential hidden cost in the ongoing globalization movement towards establishing less-constrained, trans-regional economic links between countries, by increasing vulnerability of the global economic system to extreme crises. PMID:21483794

[Fanconi anemia: genes and function(s) revisited].

PubMed

Papadopoulo, Dora; Moustacchi, Ethel

2005-01-01

Fanconi anemia (FA), a rare inherited disorder, exhibits a complex phenotype including progressive bone marrow failure, congenital malformations and increased risk of cancers, mainly acute myeloid leukaemia. At the cellular level, FA is characterized by hypersensitivity to DNA cross-linking agents and by high frequencies of induced chromosomal aberrations, a property used for diagnosis. FA results from mutations in one of the eleven FANC (FANCA to FANCJ) genes. Nine of them have been identified. In addition, FANCD1 gene has been shown to be identical to BRCA2, one of the two breast cancer susceptibility genes. Seven of the FANC proteins form a complex, which exists in four different forms depending of its subcellular localisation. Four FANC proteins (D1(BRCA2), D2, I and J) are not associated to the complex. The presence of the nuclear form of the FA core complex is necessary for the mono-ubiquitinylation of FANCD2 protein, a modification required for its re-localization to nuclear foci, likely to be sites of DNA repair. A clue towards understanding the molecular function of the FANC genes comes from the recently identified connection of FANC to the BRCA1, ATM, NBS1 and ATR genes. Two of the FANC proteins (A and D2) directly interact with BRCA1, which in turn interacts with the MRE11/RAD50/NBS1 complex, which is one of the key components in the mechanisms involved in the cellular response to DNA double strand breaks (DSB). Moreover, ATM, a protein kinase that plays a central role in the network of DSB signalling, phosphorylates in vitro and in vivo FANCD2 in response to ionising radiations. Moreover, the NBS1 protein and the monoubiquitinated form of FANCD2 seem to act together in response to DNA crosslinking agents. Taken together with the previously reported impaired DSB and DNA interstrand crosslinks repair in FA cells, the connection of FANC genes to the ATM, ATR, NBS1 and BRCA1 links the FANC genes function to the finely orchestrated network involved in the sensing, signalling and repair of DNA replication-blocking lesions.

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

NASA Astrophysics Data System (ADS)

Bisen, Dhananjay; Sharma, Sanjeev

2018-01-01

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

Opinion formation of free speech on the directed social network

NASA Astrophysics Data System (ADS)

Su, Jiongming; Ma, Hongxu; Liu, Baohong; Li, Qi

2014-12-01

A dynamical model with continuous opinion is proposed to study how the speech order and the topology of directed social network affect the opinion formation of free speech. In the model, agents express their opinions one by one with random order (RO) or probability order (PO), other agents paying attentions to the speaking agent, receive provider's opinion, update their opinions and then express their new opinions in their turns. It is proved that with the same agent j repeats its opinion more, other agents who pay their attentions to j and include j's opinion in their confidence level at initial time, will continue approaching j's opinion. Simulation results reveal that on directed scale-free network: (1) the model for PO forms fewer opinion clusters, larger maximum cluster (MC), smaller standard deviation (SD), and needs less waiting time to reach a middle level of consensus than RO; (2) as the parameter of scale-free degree distribution decreases or the confidence level increases, the results often get better for both speech orders; (3) the differences between PO and RO get smaller as the size of network decreases.

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.

BDNF and the maturation of posttranscriptional regulatory networks in human SH-SY5Y neuroblast differentiation.

PubMed

Goldie, Belinda J; Barnett, Michelle M; Cairns, Murray J

2014-01-01

The SH-SY5Y culture system is a convenient neuronal model with the potential to elaborate human/primate-specific transcription networks and pathways related to human cognitive disorders. While this system allows for the exploration of specialized features in the human genome, there is still significant debate about how this model should be implemented, and its appropriateness for answering complex functional questions related to human neural architecture. In view of these questions we sought to characterize the posttranscriptional regulatory structure of the two-stage ATRA differentiation, BDNF maturation protocol proposed by Encinas et al. (2000) using integrative whole-genome gene and microRNA (miRNA) expression analysis. We report that ATRA-BDNF induced significant increases in expression of key synaptic genes, brain-specific miRNA and miRNA biogenesis machinery, and in AChE activity, compared with ATRA alone. Functional annotation clustering associated BDNF more significantly with neuronal terms, and with synaptic terms not found in ATRA-only clusters. While our results support use of SH-SY5Y as a neuronal model, we advocate considered selection of the differentiation agent/s relative to the system being modeled.

ADVANCED MOLECULAR DESIGN OF BIOPOLYMERS FOR TRANSMUCOSAL AND INTRACELLULAR DELIVERY OF CHEMOTHERAPEUTIC AGENTS AND BIOLOGICAL THERAPEUTICS

PubMed Central

Liechty, William B.; Caldorera-Moore, Mary; Phillips, Margaret A.; Schoener, Cody; Peppas, Nicholas A.

2011-01-01

Hydrogels have been instrumental in the development of polymeric systems for controlled release of therapeutic agents. These materials are attractive for transmucosal and intracellular drug delivery because of their facile synthesis, inherent biocompatibility, tunable physicochemical properties, and capacity to respond to various physiological stimuli. In this contribution, we outline a multifaceted hydrogel-based approach for expanding the range of therapeutics in oral formulations from classical small-molecule drugs to include proteins, chemotherapeutics, and nucleic acids. Through judicious materials selection and careful design of copolymer composition and molecular architecture, we can engineer systems capable of responding to distinct physiological cues, with tunable physicochemical properties that are optimized to load, protect, and deliver valuable macromolecular payloads to their intended site of action. These hydrogel carriers, including complexation hydrogels, tethered hydrogels, interpenetrating networks, nanoscale hydrogels, and hydrogels with decorated structures are investigated for their ability respond to changes in pH, to load and release insulin and fluorescein, and remain non-toxic to Caco-2 cells. Our results suggest these novel hydrogel networks have great potential for controlled delivery of proteins, chemotherapeutics, and nucleic acids. PMID:21699934

Developing combination immunotherapies for type 1 diabetes: recommendations from the ITN–JDRF Type 1 Diabetes Combination Therapy Assessment Group

PubMed Central

Matthews, J B; Staeva, T P; Bernstein, P L; Peakman, M; von Herrath, M

2010-01-01

Like many other complex human disorders of unknown aetiology, autoimmune-mediated type 1 diabetes may ultimately be controlled via a therapeutic approach that combines multiple agents, each with differing modes of action. The numerous advantages of such a strategy include the ability to minimize toxicities and realize synergies to enhance and prolong efficacy. The recognition that combinations might offer far-reaching benefits, at a time when few single agents have yet proved themselves in well-powered trials, represents a significant challenge to our ability to conceive and implement rational treatment designs. As a first step in this process, the Immune Tolerance Network, in collaboration with the Juvenile Diabetes Research Foundation, convened a Type 1 Diabetes Combination Therapy Assessment Group, the recommendations of which are discussed in this Perspective paper. PMID:20629979

Formalizing Knowledge in Multi-Scale Agent-Based Simulations

PubMed Central

Somogyi, Endre; Sluka, James P.; Glazier, James A.

2017-01-01

Multi-scale, agent-based simulations of cellular and tissue biology are increasingly common. These simulations combine and integrate a range of components from different domains. Simulations continuously create, destroy and reorganize constituent elements causing their interactions to dynamically change. For example, the multi-cellular tissue development process coordinates molecular, cellular and tissue scale objects with biochemical, biomechanical, spatial and behavioral processes to form a dynamic network. Different domain specific languages can describe these components in isolation, but cannot describe their interactions. No current programming language is designed to represent in human readable and reusable form the domain specific knowledge contained in these components and interactions. We present a new hybrid programming language paradigm that naturally expresses the complex multi-scale objects and dynamic interactions in a unified way and allows domain knowledge to be captured, searched, formalized, extracted and reused. PMID:29338063

Formalizing Knowledge in Multi-Scale Agent-Based Simulations.

PubMed

Somogyi, Endre; Sluka, James P; Glazier, James A

2016-10-01

Multi-scale, agent-based simulations of cellular and tissue biology are increasingly common. These simulations combine and integrate a range of components from different domains. Simulations continuously create, destroy and reorganize constituent elements causing their interactions to dynamically change. For example, the multi-cellular tissue development process coordinates molecular, cellular and tissue scale objects with biochemical, biomechanical, spatial and behavioral processes to form a dynamic network. Different domain specific languages can describe these components in isolation, but cannot describe their interactions. No current programming language is designed to represent in human readable and reusable form the domain specific knowledge contained in these components and interactions. We present a new hybrid programming language paradigm that naturally expresses the complex multi-scale objects and dynamic interactions in a unified way and allows domain knowledge to be captured, searched, formalized, extracted and reused.

SAN-RL: combining spreading activation networks and reinforcement learning to learn configurable behaviors

NASA Technical Reports Server (NTRS)

White, J.; Gaines, D. M.; Wilkes, M.; Kusumalnukool, K.; Thongchai, S.; Kawamura, K.

2001-01-01

This approach provides the agent with a causal structure, the spreading activation network, relating goals to the actions that can achieve those goals. This enables the agent to select actions relative to the goal priorities.

Agreement dynamics on interaction networks with diverse topologies

NASA Astrophysics Data System (ADS)

Barrat, Alain; Baronchelli, Andrea; Dall'Asta, Luca; Loreto, Vittorio

2007-06-01

We review the behavior of a recently introduced model of agreement dynamics, called the "Naming Game." This model describes the self-organized emergence of linguistic conventions and the establishment of simple communication systems in a population of agents with pairwise local interactions. The mechanisms of convergence towards agreement strongly depend on the network of possible interactions between the agents. In particular, the mean-field case in which all agents communicate with all the others is not efficient, since a large temporary memory is requested for the agents. On the other hand, regular lattice topologies lead to a fast local convergence but to a slow global dynamics similar to coarsening phenomena. The embedding of the agents in a small-world network represents an interesting tradeoff: a local consensus is easily reached, while the long-range links allow to bypass coarsening-like convergence. We also consider alternative adaptive strategies which can lead to faster global convergence.

An Intelligent Control for the Distributed Flexible Network Photovoltaic System using Autonomous Control and Agent

NASA Astrophysics Data System (ADS)

Park, Sangsoo; Miura, Yushi; Ise, Toshifumi

This paper proposes an intelligent control for the distributed flexible network photovoltaic system using autonomous control and agent. The distributed flexible network photovoltaic system is composed of a secondary battery bank and a number of subsystems which have a solar array, a dc/dc converter and a load. The control mode of dc/dc converter can be selected based on local information by autonomous control. However, if only autonomous control using local information is applied, there are some problems associated with several cases such as voltage drop on long power lines. To overcome these problems, the authors propose introducing agents to improve control characteristics. The autonomous control with agents is called as intelligent control in this paper. The intelligent control scheme that employs the communication between agents is applied for the model system and proved with simulation using PSCAD/EMTDC.

Cognitive conflict without explicit conflict monitoring in a dynamical agent.

PubMed

Ward, Robert; Ward, Ronnie

2006-11-01

We examine mechanisms for resolving cognitive conflict in an embodied, situated, and dynamic agent, developed through an evolutionary learning process. The agent was required to solve problems of response conflict in a dual-target "catching" task, focusing response on one of the targets while ignoring the other. Conflict in the agent was revealed at the behavioral level in terms of increased latencies to the second target. This behavioral interference was correlated to peak violations of the network's stable state equation. At the level of the agent's neural network, peak violations were also correlated to periods of disagreement in source inputs to the agent's motor effectors. Despite observing conflict at these numerous levels, we did not find any explicit conflict monitoring mechanisms within the agent. We instead found evidence of a distributed conflict management system, characterized by competitive sources within the network. In contrast to the conflict monitoring hypothesis [Botvinick, M. M., Braver, T. S., Barch, D. M., Carter, C. S., & Cohen, J. D. (2001). Conflict monitoring and cognitive control. Psychological Review, 108(3), 624-652], this agent demonstrates that resolution of cognitive conflict does not require explicit conflict monitoring. We consider the implications of our results for the conflict monitoring hypothesis.

Geographical influences of an emerging network of gang rivalries

NASA Astrophysics Data System (ADS)

Hegemann, Rachel A.; Smith, Laura M.; Barbaro, Alethea B. T.; Bertozzi, Andrea L.; Reid, Shannon E.; Tita, George E.

2011-10-01

We propose an agent-based model to simulate the creation of street gang rivalries. The movement dynamics of agents are coupled to an evolving network of gang rivalries, which is determined by previous interactions among agents in the system. Basic gang data, geographic information, and behavioral dynamics suggested by the criminology literature are integrated into the model. The major highways, rivers, and the locations of gangs’ centers of activity influence the agents’ motion. We use a policing division of the Los Angeles Police Department as a case study to test our model. We apply common metrics from graph theory to analyze our model, comparing networks produced by our simulations and an instance of a Geographical Threshold Graph to the existing network from the criminology literature.

Pharmacological Tools to Study the Role of Astrocytes in Neural Network Functions.

PubMed

Peña-Ortega, Fernando; Rivera-Angulo, Ana Julia; Lorea-Hernández, Jonathan Julio

2016-01-01

Despite that astrocytes and microglia do not communicate by electrical impulses, they can efficiently communicate among them, with each other and with neurons, to participate in complex neural functions requiring broad cell-communication and long-lasting regulation of brain function. Glial cells express many receptors in common with neurons; secrete gliotransmitters as well as neurotrophic and neuroinflammatory factors, which allow them to modulate synaptic transmission and neural excitability. All these properties allow glial cells to influence the activity of neuronal networks. Thus, the incorporation of glial cell function into the understanding of nervous system dynamics will provide a more accurate view of brain function. Our current knowledge of glial cell biology is providing us with experimental tools to explore their participation in neural network modulation. In this chapter, we review some of the classical, as well as some recent, pharmacological tools developed for the study of astrocyte's influence in neural function. We also provide some examples of the use of these pharmacological agents to understand the role of astrocytes in neural network function and dysfunction.

Application of Chitosan-Zinc Oxide Nanoparticles for Lead Extraction From Water Samples by Combining Ant Colony Optimization with Artificial Neural Network

NASA Astrophysics Data System (ADS)

Khajeh, M.; Pourkarami, A.; Arefnejad, E.; Bohlooli, M.; Khatibi, A.; Ghaffari-Moghaddam, M.; Zareian-Jahromi, S.

2017-09-01

Chitosan-zinc oxide nanoparticles (CZPs) were developed for solid-phase extraction. Combined artificial neural network-ant colony optimization (ANN-ACO) was used for the simultaneous preconcentration and determination of lead (Pb2+) ions in water samples prior to graphite furnace atomic absorption spectrometry (GF AAS). The solution pH, mass of adsorbent CZPs, amount of 1-(2-pyridylazo)-2-naphthol (PAN), which was used as a complexing agent, eluent volume, eluent concentration, and flow rates of sample and eluent were used as input parameters of the ANN model, and the percentage of extracted Pb2+ ions was used as the output variable of the model. A multilayer perception network with a back-propagation learning algorithm was used to fit the experimental data. The optimum conditions were obtained based on the ACO. Under the optimized conditions, the limit of detection for Pb2+ ions was found to be 0.078 μg/L. This procedure was also successfully used to determine the amounts of Pb2+ ions in various natural water samples.

Information-theoretic metamodel of organizational evolution

NASA Astrophysics Data System (ADS)

Sepulveda, Alfredo

2011-12-01

Social organizations are abstractly modeled by holarchies---self-similar connected networks---and intelligent complex adaptive multiagent systems---large networks of autonomous reasoning agents interacting via scaled processes. However, little is known of how information shapes evolution in such organizations, a gap that can lead to misleading analytics. The research problem addressed in this study was the ineffective manner in which classical model-predict-control methods used in business analytics attempt to define organization evolution. The purpose of the study was to construct an effective metamodel for organization evolution based on a proposed complex adaptive structure---the info-holarchy. Theoretical foundations of this study were holarchies, complex adaptive systems, evolutionary theory, and quantum mechanics, among other recently developed physical and information theories. Research questions addressed how information evolution patterns gleamed from the study's inductive metamodel more aptly explained volatility in organization. In this study, a hybrid grounded theory based on abstract inductive extensions of information theories was utilized as the research methodology. An overarching heuristic metamodel was framed from the theoretical analysis of the properties of these extension theories and applied to business, neural, and computational entities. This metamodel resulted in the synthesis of a metaphor for, and generalization of organization evolution, serving as the recommended and appropriate analytical tool to view business dynamics for future applications. This study may manifest positive social change through a fundamental understanding of complexity in business from general information theories, resulting in more effective management.

Simulating the decentralized processes of the human immune system in a virtual anatomy model.

PubMed

Sarpe, Vladimir; Jacob, Christian

2013-01-01

Many physiological processes within the human body can be perceived and modeled as large systems of interacting particles or swarming agents. The complex processes of the human immune system prove to be challenging to capture and illustrate without proper reference to the spatial distribution of immune-related organs and systems. Our work focuses on physical aspects of immune system processes, which we implement through swarms of agents. This is our first prototype for integrating different immune processes into one comprehensive virtual physiology simulation. Using agent-based methodology and a 3-dimensional modeling and visualization environment (LINDSAY Composer), we present an agent-based simulation of the decentralized processes in the human immune system. The agents in our model - such as immune cells, viruses and cytokines - interact through simulated physics in two different, compartmentalized and decentralized 3-dimensional environments namely, (1) within the tissue and (2) inside a lymph node. While the two environments are separated and perform their computations asynchronously, an abstract form of communication is allowed in order to replicate the exchange, transportation and interaction of immune system agents between these sites. The distribution of simulated processes, that can communicate across multiple, local CPUs or through a network of machines, provides a starting point to build decentralized systems that replicate larger-scale processes within the human body, thus creating integrated simulations with other physiological systems, such as the circulatory, endocrine, or nervous system. Ultimately, this system integration across scales is our goal for the LINDSAY Virtual Human project. Our current immune system simulations extend our previous work on agent-based simulations by introducing advanced visualizations within the context of a virtual human anatomy model. We also demonstrate how to distribute a collection of connected simulations over a network of computers. As a future endeavour, we plan to use parameter tuning techniques on our model to further enhance its biological credibility. We consider these in silico experiments and their associated modeling and optimization techniques as essential components in further enhancing our capabilities of simulating a whole-body, decentralized immune system, to be used both for medical education and research as well as for virtual studies in immunoinformatics.

Dynamics of bounded confidence opinion in heterogeneous social networks: Concord against partial antagonism

NASA Astrophysics Data System (ADS)

Kurmyshev, Evguenii; Juárez, Héctor A.; González-Silva, Ricardo A.

2011-08-01

Bounded confidence models of opinion dynamics in social networks have been actively studied in recent years, in particular, opinion formation and extremism propagation along with other aspects of social dynamics. In this work, after an analysis of limitations of the Deffuant-Weisbuch (DW) bounded confidence, relative agreement model, we propose the mixed model that takes into account two psychological types of individuals. Concord agents (C-agents) are friendly people; they interact in a way that their opinions always get closer. Agents of the other psychological type show partial antagonism in their interaction (PA-agents). Opinion dynamics in heterogeneous social groups, consisting of agents of the two types, was studied on different social networks: Erdös-Rényi random graphs, small-world networks and complete graphs. Limit cases of the mixed model, pure C- and PA-societies, were also studied. We found that group opinion formation is, qualitatively, almost independent of the topology of networks used in this work. Opinion fragmentation, polarization and consensus are observed in the mixed model at different proportions of PA- and C-agents, depending on the value of initial opinion tolerance of agents. As for the opinion formation and arising of “dissidents”, the opinion dynamics of the C-agents society was found to be similar to that of the DW model, except for the rate of opinion convergence. Nevertheless, mixed societies showed dynamics and bifurcation patterns notably different to those of the DW model. The influence of biased initial conditions over opinion formation in heterogeneous social groups was also studied versus the initial value of opinion uncertainty, varying the proportion of the PA- to C-agents. Bifurcation diagrams showed an impressive evolution of collective opinion, in particular, radical changes of left to right consensus or vice versa at an opinion uncertainty value equal to 0.7 in the model with the PA/C mixture of population near 50/50.

Mobile Router Developed and Tested

NASA Technical Reports Server (NTRS)

Ivancic, William D.

2002-01-01

The NASA Glenn Research Center, under a NASA Space Act Agreement with Cisco Systems, has been performing joint networking research to apply Internet-based technologies and protocols to space-based communications. As a result of this research, NASA performed stringent performance testing of the mobile router, including the interaction of routing and the transport-level protocol. In addition, Cisco Systems developed the mobile router for both commercial and Government markets. The code has become part of the Cisco Systems Internetworking Operating System (IOS) as of release 12.2 (4) T--which will make this capability available to the community at large. The mobile router is software code that resides in a network router and enables entire networks to roam while maintaining connectivity to the Internet. This router code is pertinent to a myriad of applications for both Government and commercial sectors, including the "wireless battlefield." NASA and the Department of Defense will utilize this technology for near-planetary observation and sensing spacecraft. It is also a key enabling technology for aviation-based information applications. Mobile routing will make it possible for information such as weather, air traffic control, voice, and video to be transmitted to aircraft using Internet-based protocols. This technology shows great promise in reducing congested airways and mitigating aviation disasters due to bad weather. The mobile router can also be incorporated into emergency vehicles (such as ambulances and life-flight aircraft) to provide real-time connectivity back to the hospital and health-care experts, enabling the timely application of emergency care. Commercial applications include entertainment services, Internet protocol (IP) telephone, and Internet connectivity for cruise ships, commercial shipping, tour buses, aircraft, and eventually cars. A mobile router, which is based on mobile IP, allows hosts (mobile nodes) to seamlessly "roam" among various IP subnetworks. This is essential in many wireless networks. A mobile router, unlike a mobile IP node, allows entire networks to roam. Hence, a device connected to the mobile router does not need to be a mobile node because the mobile router provides the roaming capabilities. There are three basic elements in the mobile IP: the home agent, the foreign agent, and the mobile node. The home agent is a router on a mobile node's home network that tunnels datagrams for delivery to the mobile node when it is away from home. The foreign agent is a router on a remote network that provides routing services to a registered mobile node. The mobile node is a host or router that changes its point of attachment from one network or subnetwork to another. In mobile routing, virtual communications are maintained by the home agent, which forwards all packets for the mobile networks to the foreign agent. The foreign agent passes the packets to the mobile router, which then forwards the packets to the devices on its networks. As the mobile router moves, it will register with its home agent on its whereabouts via the foreign agent to assure continuous connectivity.

Distributed cooperative H∞ optimal tracking control of MIMO nonlinear multi-agent systems in strict-feedback form via adaptive dynamic programming

NASA Astrophysics Data System (ADS)

Luy, N. T.

2018-04-01

The design of distributed cooperative H∞ optimal controllers for multi-agent systems is a major challenge when the agents' models are uncertain multi-input and multi-output nonlinear systems in strict-feedback form in the presence of external disturbances. In this paper, first, the distributed cooperative H∞ optimal tracking problem is transformed into controlling the cooperative tracking error dynamics in affine form. Second, control schemes and online algorithms are proposed via adaptive dynamic programming (ADP) and the theory of zero-sum differential graphical games. The schemes use only one neural network (NN) for each agent instead of three from ADP to reduce computational complexity as well as avoid choosing initial NN weights for stabilising controllers. It is shown that despite not using knowledge of cooperative internal dynamics, the proposed algorithms not only approximate values to Nash equilibrium but also guarantee all signals, such as the NN weight approximation errors and the cooperative tracking errors in the closed-loop system, to be uniformly ultimately bounded. Finally, the effectiveness of the proposed method is shown by simulation results of an application to wheeled mobile multi-robot systems.

Non-consensus opinion model with a neutral view on complex networks

NASA Astrophysics Data System (ADS)

Tian, Zihao; Dong, Gaogao; Du, Ruijin; Ma, Jing

2016-05-01

A nonconsensus opinion (NCO) model was introduced recently, which allows the stable coexistence of minority and majority opinions. However, due ​to disparities in the knowledge, experiences, and personality or self-protection of agents, they often remain ​neutral when faced with some opinions in real scenarios. ​To address this issue, we propose a general non-consensus opinion model with neutral view (NCON) ​and we define the dynamic opinion ​change process. We applied the NCON model to different topological networks and studied the formation of opinion clusters. In the case of random graphs, random regular networks, and scale-free (SF) networks, we found that the system moved from a continuous phase transition to a discontinuous phase transition as the connectivity density and exponent of the SF network λ ​decreased and increased in the steady state, respectively. Moreover, the initial proportions of neutral opinions were found to have little effect on the proportional structure of opinions at the steady state. These results suggest that the majority choice between positive and negative opinions depends on the initial proportion of each opinion. The NCON model may have potential applications for decision makers.

Conserving analyst attention units: use of multi-agent software and CEP methods to assist information analysis

NASA Astrophysics Data System (ADS)

Rimland, Jeffrey; McNeese, Michael; Hall, David

2013-05-01

Although the capability of computer-based artificial intelligence techniques for decision-making and situational awareness has seen notable improvement over the last several decades, the current state-of-the-art still falls short of creating computer systems capable of autonomously making complex decisions and judgments in many domains where data is nuanced and accountability is high. However, there is a great deal of potential for hybrid systems in which software applications augment human capabilities by focusing the analyst's attention to relevant information elements based on both a priori knowledge of the analyst's goals and the processing/correlation of a series of data streams too numerous and heterogeneous for the analyst to digest without assistance. Researchers at Penn State University are exploring ways in which an information framework influenced by Klein's (Recognition Primed Decision) RPD model, Endsley's model of situational awareness, and the Joint Directors of Laboratories (JDL) data fusion process model can be implemented through a novel combination of Complex Event Processing (CEP) and Multi-Agent Software (MAS). Though originally designed for stock market and financial applications, the high performance data-driven nature of CEP techniques provide a natural compliment to the proven capabilities of MAS systems for modeling naturalistic decision-making, performing process adjudication, and optimizing networked processing and cognition via the use of "mobile agents." This paper addresses the challenges and opportunities of such a framework for augmenting human observational capability as well as enabling the ability to perform collaborative context-aware reasoning in both human teams and hybrid human / software agent teams.

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.

Optimization-Based Selection of Influential Agents in a Rural Afghan Social Network

DTIC Science & Technology

2010-06-01

nonlethal targeting model, a nonlinear programming ( NLP ) optimization formulation that identifies the k US agent assignment strategy producing the greatest...leader social network, and 3) the nonlethal targeting model, a nonlinear programming ( NLP ) optimization formulation that identifies the k US agent...NATO Coalition in Afghanistan. 55 for Afghanistan ( [54], [31], [48], [55], [30]). While Arab tribes tend to be more hierarchical, Pashtun tribes are

Comparative safety and efficacy of vasopressors for mortality in septic shock: A network meta-analysis.

PubMed

Nagendran, Myura; Maruthappu, Mahiben; Gordon, Anthony C; Gurusamy, Kurinchi S

2016-05-01

Septic shock is a life-threatening condition requiring vasopressor agents to support the circulatory system. Several agents exist with choice typically guided by the specific clinical scenario. We used a network meta-analysis approach to rate the comparative efficacy and safety of vasopressors for mortality and arrhythmia incidence in septic shock patients. We performed a comprehensive electronic database search including Medline, Embase, Science Citation Index Expanded and the Cochrane database. Randomised trials investigating vasopressor agents in septic shock patients and specifically assessing 28-day mortality or arrhythmia incidence were included. A Bayesian network meta-analysis was performed using Markov chain Monte Carlo methods. Thirteen trials of low to moderate risk of bias in which 3146 patients were randomised were included. There was no pairwise evidence to suggest one agent was superior over another for mortality. In the network meta-analysis, vasopressin was significantly superior to dopamine (OR 0.68 (95% CI 0.5 to 0.94)) for mortality. For arrhythmia incidence, standard pairwise meta-analyses confirmed that dopamine led to a higher incidence of arrhythmias than norepinephrine (OR 2.69 (95% CI 2.08 to 3.47)). In the network meta-analysis, there was no evidence of superiority of one agent over another. In this network meta-analysis, vasopressin was superior to dopamine for 28-day mortality in septic shock. Existing pairwise information supports the use of norepinephrine over dopamine. Our findings suggest that dopamine should be avoided in patients with septic shock and that other vasopressor agents should continue to be based on existing guidelines and clinical judgement of the specific presentation of the patient.

Evolvable mathematical models: A new artificial Intelligence paradigm

NASA Astrophysics Data System (ADS)

Grouchy, Paul

We develop a novel Artificial Intelligence paradigm to generate autonomously artificial agents as mathematical models of behaviour. Agent/environment inputs are mapped to agent outputs via equation trees which are evolved in a manner similar to Symbolic Regression in Genetic Programming. Equations are comprised of only the four basic mathematical operators, addition, subtraction, multiplication and division, as well as input and output variables and constants. From these operations, equations can be constructed that approximate any analytic function. These Evolvable Mathematical Models (EMMs) are tested and compared to their Artificial Neural Network (ANN) counterparts on two benchmarking tasks: the double-pole balancing without velocity information benchmark and the challenging discrete Double-T Maze experiments with homing. The results from these experiments show that EMMs are capable of solving tasks typically solved by ANNs, and that they have the ability to produce agents that demonstrate learning behaviours. To further explore the capabilities of EMMs, as well as to investigate the evolutionary origins of communication, we develop NoiseWorld, an Artificial Life simulation in which interagent communication emerges and evolves from initially noncommunicating EMM-based agents. Agents develop the capability to transmit their x and y position information over a one-dimensional channel via a complex, dialogue-based communication scheme. These evolved communication schemes are analyzed and their evolutionary trajectories examined, yielding significant insight into the emergence and subsequent evolution of cooperative communication. Evolved agents from NoiseWorld are successfully transferred onto physical robots, demonstrating the transferability of EMM-based AIs from simulation into physical reality.

Rheological and structural characterization of agar/whey proteins insoluble complexes.

PubMed

Rocha, Cristina M R; Souza, Hiléia K S; Magalhães, Natália F; Andrade, Cristina T; Gonçalves, Maria Pilar

2014-09-22

Complex coacervation between whey proteins and carboxylated or highly sulphated polysaccharides has been widely studied. The aim of this work was to characterise a slightly sulphated polysaccharide (agar) and whey protein insoluble complexes in terms of yield, composition and physicochemical properties as well as to study their rheological behaviour for better understanding their structure. Unlike other sulphated polysaccharides, complexation of agar and whey protein at pH 3 in the absence of a buffering agent resulted in a coacervate that was a gel at 20°C with rheological properties and structure similar to those of simple agar gels, reinforced by proteins electrostatically aggregated to the agar network. The behaviour towards heat treatment was similar to that of agar alone, with a high thermal hysteresis and almost full reversibility. In the presence of citrate buffer, the result was a "flocculated solid", with low water content (75-81%), whose properties were governed by protein behaviour. Copyright © 2014 Elsevier Ltd. All rights reserved.

Agent-Based Framework for Personalized Service Provisioning in Converged IP Networks

NASA Astrophysics Data System (ADS)

Podobnik, Vedran; Matijasevic, Maja; Lovrek, Ignac; Skorin-Kapov, Lea; Desic, Sasa

In a global multi-service and multi-provider market, the Internet Service Providers will increasingly need to differentiate in the service quality they offer and base their operation on new, consumer-centric business models. In this paper, we propose an agent-based framework for the Business-to-Consumer (B2C) electronic market, comprising the Consumer Agents, Broker Agents and Content Agents, which enable Internet consumers to select a content provider in an automated manner. We also discuss how to dynamically allocate network resources to provide end-to-end Quality of Service (QoS) for a given consumer and content provider.

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.

Disrupting the Networks of Cancer

PubMed Central

Camacho, Daniel F.; Pienta, Kenneth J.

2014-01-01

Ecosystems are interactive systems involving communities of species and their abiotic environment. Tumors are ecosystems in which cancer cells act as invasive species interacting with native host cell species in an established microenvironment within the larger host biosphere. At its heart, to study ecology is to study interconnectedness. In ecologic science, an ecologic network is a representation of the biotic interactions in an ecosystem in which species (nodes) are connected by pairwise interactions (links). Ecologic networks and signaling network models have been used to describe and compare the structures of ecosystems. It has been shown that disruption of ecologic networks through the loss of species or disruption of interactions between them can lead to the destruction of the ecosystem. Often, the destruction of a single node or link is not enough to disrupt the entire ecosystem. The more complex the network and its interactions, the more difficult it is to cause the extinction of a species, especially without leveraging other aspects of the ecosystem. Similarly, successful treatment of cancer with a single agent is rarely enough to cure a patient without strategically modifying the support systems conducive to survival of cancer. Cancer cells and the ecologic systems they reside in can be viewed as a series of nested networks. The most effective new paradigms for treatment will be developed through application of scaled network disruption. PMID:22442061

Disrupting the networks of cancer.

PubMed

Camacho, Daniel F; Pienta, Kenneth J

2012-05-15

Ecosystems are interactive systems involving communities of species and their abiotic environment. Tumors are ecosystems in which cancer cells act as invasive species interacting with native host cell species in an established microenvironment within the larger host biosphere. At its heart, to study ecology is to study interconnectedness. In ecologic science, an ecologic network is a representation of the biotic interactions in an ecosystem in which species (nodes) are connected by pairwise interactions (links). Ecologic networks and signaling network models have been used to describe and compare the structures of ecosystems. It has been shown that disruption of ecologic networks through the loss of species or disruption of interactions between them can lead to the destruction of the ecosystem. Often, the destruction of a single node or link is not enough to disrupt the entire ecosystem. The more complex the network and its interactions, the more difficult it is to cause the extinction of a species, especially without leveraging other aspects of the ecosystem. Similarly, successful treatment of cancer with a single agent is rarely enough to cure a patient without strategically modifying the support systems conducive to survival of cancer. Cancer cells and the ecologic systems they reside in can be viewed as a series of nested networks. The most effective new paradigms for treatment will be developed through application of scaled network disruption. ©2012 AACR.

Mobility and Congestion in Dynamical Multilayer Networks with Finite Storage Capacity

NASA Astrophysics Data System (ADS)

Manfredi, S.; Di Tucci, E.; Latora, V.

2018-02-01

Multilayer networks describe well many real interconnected communication and transportation systems, ranging from computer networks to multimodal mobility infrastructures. Here, we introduce a model in which the nodes have a limited capacity of storing and processing the agents moving over a multilayer network, and their congestions trigger temporary faults which, in turn, dynamically affect the routing of agents seeking for uncongested paths. The study of the network performance under different layer velocities and node maximum capacities reveals the existence of delicate trade-offs between the number of served agents and their time to travel to destination. We provide analytical estimates of the optimal buffer size at which the travel time is minimum and of its dependence on the velocity and number of links at the different layers. Phenomena reminiscent of the slower is faster effect and of the Braess' paradox are observed in our dynamical multilayer setup.

Mobility and Congestion in Dynamical Multilayer Networks with Finite Storage Capacity.

PubMed

Manfredi, S; Di Tucci, E; Latora, V

2018-02-09

Multilayer networks describe well many real interconnected communication and transportation systems, ranging from computer networks to multimodal mobility infrastructures. Here, we introduce a model in which the nodes have a limited capacity of storing and processing the agents moving over a multilayer network, and their congestions trigger temporary faults which, in turn, dynamically affect the routing of agents seeking for uncongested paths. The study of the network performance under different layer velocities and node maximum capacities reveals the existence of delicate trade-offs between the number of served agents and their time to travel to destination. We provide analytical estimates of the optimal buffer size at which the travel time is minimum and of its dependence on the velocity and number of links at the different layers. Phenomena reminiscent of the slower is faster effect and of the Braess' paradox are observed in our dynamical multilayer setup.

Distributed Position-Based Consensus of Second-Order Multiagent Systems With Continuous/Intermittent Communication.

PubMed

Song, Qiang; Liu, Fang; Wen, Guanghui; Cao, Jinde; Yang, Xinsong

2017-04-24

This paper considers the position-based consensus in a network of agents with double-integrator dynamics and directed topology. Two types of distributed observer algorithms are proposed to solve the consensus problem by utilizing continuous and intermittent position measurements, respectively, where each observer does not interact with any other observers. For the case of continuous communication between network agents, some convergence conditions are derived for reaching consensus in the network with a single constant delay or multiple time-varying delays on the basis of the eigenvalue analysis and the descriptor method. When the network agents can only obtain intermittent position data from local neighbors at discrete time instants, the consensus in the network without time delay or with nonuniform delays is investigated by using the Wirtinger's inequality and the delayed-input approach. Numerical examples are given to illustrate the theoretical analysis.

Collective decision dynamics in the presence of external drivers

NASA Astrophysics Data System (ADS)

Bassett, Danielle S.; Alderson, David L.; Carlson, Jean M.

2012-09-01

We develop a sequence of models describing information transmission and decision dynamics for a network of individual agents subject to multiple sources of influence. Our general framework is set in the context of an impending natural disaster, where individuals, represented by nodes on the network, must decide whether or not to evacuate. Sources of influence include a one-to-many externally driven global broadcast as well as pairwise interactions, across links in the network, in which agents transmit either continuous opinions or binary actions. We consider both uniform and variable threshold rules on the individual opinion as baseline models for decision making. Our results indicate that (1) social networks lead to clustering and cohesive action among individuals, (2) binary information introduces high temporal variability and stagnation, and (3) information transmission over the network can either facilitate or hinder action adoption, depending on the influence of the global broadcast relative to the social network. Our framework highlights the essential role of local interactions between agents in predicting collective behavior of the population as a whole.

Bacterial Population Genetics in a Forensic Context

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

Velsko, S P

This report addresses the recent Department of Homeland Security (DHS) call for a Phase I study to (1) assess gaps in the forensically relevant knowledge about the population genetics of eight bacterial agents of concern, (2) formulate a technical roadmap to address those gaps, and (3) identify new bioinformatics tools that would be necessary to analyze and interpret population genetic data in a forensic context. The eight organisms that were studied are B. anthracis, Y. pestis, F. tularensis, Brucella spp., E. coli O157/H7, Burkholderia mallei, Burkholderia pseudomallei, and C. botulinum. Our study focused on the use of bacterial population geneticsmore » by forensic investigators to test hypotheses about the possible provenance of an agent that was used in a crime or act of terrorism. Just as human population genetics underpins the calculations of match probabilities for human DNA evidence, bacterial population genetics determines the level of support that microbial DNA evidence provides for or against certain well-defined hypotheses about the origins of an infecting strain. Our key findings are: (1) Bacterial population genetics is critical for answering certain types of questions in a probabilistic manner, akin (but not identical) to 'match probabilities' in DNA forensics. (2) A basic theoretical framework for calculating likelihood ratios or posterior probabilities for forensic hypotheses based on microbial genetic comparisons has been formulated. This 'inference-on-networks' framework has deep but simple connections to the population genetics of mtDNA and Y-STRs in human DNA forensics. (3) The 'phylogeographic' approach to identifying microbial sources is not an adequate basis for understanding bacterial population genetics in a forensic context, and has limited utility, even for generating 'leads' with respect to strain origin. (4) A collection of genotyped isolates obtained opportunistically from international locations augmented by phylogenetic representations of relatedness will not and enzootic outbreaks noted through international outbreak surveillance systems, and 'representative' genetic sequences from each outbreak. (5) Interpretation of genetic comparisons between an attack strain and reference strains requires a model for the network structure of maintenance foci, enzootic outbreaks, and human outbreaks of that disease, coupled with estimates of mutational rate constants. Validation of the model requires a set of sequences from exemplary outbreaks and laboratory data on mutation rates during animal passage. The necessary number of isolates in each validation set is determined by disease transmission network theory, and is based on the 'network diameter' of the outbreak. (6) The 8 bacteria in this study can be classified into 4 categories based on the complexity of the transmission network structure of their natural maintenance foci and their outbreaks, both enzootic and zoonotic. (7) For B. anthracis, Y. pestis, E. coli O157, and Brucella melitensis, and their primary natural animal hosts, most of the fundamental parameters needed for modeling genetic change within natural host or human transmission networks have been determined or can be estimated from existing field and laboratory studies. (8) For Burkholderia mallei, plausible approaches to transmission network models exist, but much of the fundamental parameterization does not. In addition, a validated high-resolution typing system for characterizing genetic change within outbreaks or foci has not yet been demonstrated, although a candidate system exists. (9) For Francisella tularensis, the increased complexity of the transmission network and unresolved questions about maintenance and transmission suggest that it will be more complex and difficult to develop useful models based on currently available data. (10) For Burkholderia pseudomallei and Clostridium botulinum, the transmission and maintenance networks involve complex soil communities and metapopulations about which very little is known. It is not clear that these pathogens can be brought into the inference-on-networks framework without additional conceptual advances. (11) For all 8 bacteria some combination of field studies, computational modeling, and laboratory experiments are needed to provide a useful forensic capability for bacterial genetic inference.« less

COORDINATION COMPOUND-SOLVENT EXTRACTION PROCESS FOR URANIUM RECOVERY

DOEpatents

Reas, W.H.

1959-03-10

A method is presented for the separation of uranium from aqueous solutions containing a uranyl salt and thorium. Thc separation is effected by adding to such solutions an organic complexing agent, and then contacting the solution with an organic solvent in which the organic complexing agent is soluble. By use of the proper complexing agent in the proper concentrations uranium will be complexed and subsequently removed in the organic solvent phase, while the thorium remains in the aqueous phase. Mentioned as suitable organic complexing agents are antipyrine, bromoantipyrine, and pyramidon.

A network model of knowledge accumulation through diffusion and upgrade

NASA Astrophysics Data System (ADS)

Zhuang, Enyu; Chen, Guanrong; Feng, Gang

2011-07-01

In this paper, we introduce a model to describe knowledge accumulation through knowledge diffusion and knowledge upgrade in a multi-agent network. Here, knowledge diffusion refers to the distribution of existing knowledge in the network, while knowledge upgrade means the discovery of new knowledge. It is found that the population of the network and the number of each agent’s neighbors affect the speed of knowledge accumulation. Four different policies for updating the neighboring agents are thus proposed, and their influence on the speed of knowledge accumulation and the topology evolution of the network are also studied.

Agent-Based Model Forecasts Aging of the Population of People Who Inject Drugs in Metropolitan Chicago and Changing Prevalence of Hepatitis C Infections.

PubMed

Gutfraind, Alexander; Boodram, Basmattee; Prachand, Nikhil; Hailegiorgis, Atesmachew; Dahari, Harel; Major, Marian E

2015-01-01

People who inject drugs (PWID) are at high risk for blood-borne pathogens transmitted during the sharing of contaminated injection equipment, particularly hepatitis C virus (HCV). HCV prevalence is influenced by a complex interplay of drug-use behaviors, social networks, and geography, as well as the availability of interventions, such as needle exchange programs. To adequately address this complexity in HCV epidemic forecasting, we have developed a computational model, the Agent-based Pathogen Kinetics model (APK). APK simulates the PWID population in metropolitan Chicago, including the social interactions that result in HCV infection. We used multiple empirical data sources on Chicago PWID to build a spatial distribution of an in silico PWID population and modeled networks among the PWID by considering the geography of the city and its suburbs. APK was validated against 2012 empirical data (the latest available) and shown to agree with network and epidemiological surveys to within 1%. For the period 2010-2020, APK forecasts a decline in HCV prevalence of 0.8% per year from 44(± 2)% to 36(± 5)%, although some sub-populations would continue to have relatively high prevalence, including Non-Hispanic Blacks, 48(± 5)%. The rate of decline will be lowest in Non-Hispanic Whites and we find, in a reversal of historical trends, that incidence among non-Hispanic Whites would exceed incidence among Non-Hispanic Blacks (0.66 per 100 per years vs 0.17 per 100 person years). APK also forecasts an increase in PWID mean age from 35(± 1) to 40(± 2) with a corresponding increase from 59(± 2)% to 80(± 6)% in the proportion of the population >30 years old. Our studies highlight the importance of analyzing subpopulations in disease predictions, the utility of computer simulation for analyzing demographic and health trends among PWID and serve as a tool for guiding intervention and prevention strategies in Chicago, and other major cities.

Phase Transition in Opinion Diffusion in Social Networks

DTIC Science & Technology

2012-05-01

the opinions of social agents diffuse in a network under a so-called hard-interaction model, in which the agents inter- act more strongly with...gent behavior. Index Terms— opinion diffusion , opinion dynamics, social net- works, phase transition, herding. 1. INTRODUCTION The study of the

Memory Transmission in Small Groups and Large Networks: An Agent-Based Model.

PubMed

Luhmann, Christian C; Rajaram, Suparna

2015-12-01

The spread of social influence in large social networks has long been an interest of social scientists. In the domain of memory, collaborative memory experiments have illuminated cognitive mechanisms that allow information to be transmitted between interacting individuals, but these experiments have focused on small-scale social contexts. In the current study, we took a computational approach, circumventing the practical constraints of laboratory paradigms and providing novel results at scales unreachable by laboratory methodologies. Our model embodied theoretical knowledge derived from small-group experiments and replicated foundational results regarding collaborative inhibition and memory convergence in small groups. Ultimately, we investigated large-scale, realistic social networks and found that agents are influenced by the agents with which they interact, but we also found that agents are influenced by nonneighbors (i.e., the neighbors of their neighbors). The similarity between these results and the reports of behavioral transmission in large networks offers a major theoretical insight by linking behavioral transmission to the spread of information. © The Author(s) 2015.

Managing search complexity in linguistic geometry.

PubMed

Stilman, B

1997-01-01

This paper is a new step in the development of linguistic geometry. This formal theory is intended to discover and generalize the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. In this paper, we investigate heuristics extracted in the form of hierarchical networks of planning paths of autonomous agents. Employing linguistic geometry tools the dynamic hierarchy of networks is represented as a hierarchy of formal attribute languages. The main ideas of this methodology are shown in the paper on two pilot examples of the solution of complex optimization problems. The first example is a problem of strategic planning for the air combat, in which concurrent actions of four vehicles are simulated as serial interleaving moves. The second example is a problem of strategic planning for the space comb of eight autonomous vehicles (with interleaving moves) that requires generation of the search tree of the depth 25 with the branching factor 30. This is beyond the capabilities of modern and conceivable future computers (employing conventional approaches). In both examples the linguistic geometry tools showed deep and highly selective searches in comparison with conventional search algorithms. For the first example a sketch of the proof of optimality of the solution is considered.

Tackling Information Asymmetry in Networks: A New Entropy-Based Ranking Index

NASA Astrophysics Data System (ADS)

Barucca, Paolo; Caldarelli, Guido; Squartini, Tiziano

2018-06-01

Information is a valuable asset in socio-economic systems, a significant part of which is entailed into the network of connections between agents. The different interlinkages patterns that agents establish may, in fact, lead to asymmetries in the knowledge of the network structure; since this entails a different ability of quantifying relevant, systemic properties (e.g. the risk of contagion in a network of liabilities), agents capable of providing a better estimation of (otherwise) inaccessible network properties, ultimately have a competitive advantage. In this paper, we address the issue of quantifying the information asymmetry of nodes: to this aim, we define a novel index—InfoRank—intended to rank nodes according to their information content. In order to do so, each node ego-network is enforced as a constraint of an entropy-maximization problem and the subsequent uncertainty reduction is used to quantify the node-specific accessible information. We, then, test the performance of our ranking procedure in terms of reconstruction accuracy and show that it outperforms other centrality measures in identifying the "most informative" nodes. Finally, we discuss the socio-economic implications of network information asymmetry.

Structural stability of interaction networks against negative external fields

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Information dynamics algorithm for detecting communities in networks

NASA Astrophysics Data System (ADS)

Massaro, Emanuele; Bagnoli, Franco; Guazzini, Andrea; Lió, Pietro

2012-11-01

The problem of community detection is relevant in many scientific disciplines, from social science to statistical physics. Given the impact of community detection in many areas, such as psychology and social sciences, we have addressed the issue of modifying existing well performing algorithms by incorporating elements of the domain application fields, i.e. domain-inspired. We have focused on a psychology and social network-inspired approach which may be useful for further strengthening the link between social network studies and mathematics of community detection. Here we introduce a community-detection algorithm derived from the van Dongen's Markov Cluster algorithm (MCL) method [4] by considering networks' nodes as agents capable to take decisions. In this framework we have introduced a memory factor to mimic a typical human behavior such as the oblivion effect. The method is based on information diffusion and it includes a non-linear processing phase. We test our method on two classical community benchmark and on computer generated networks with known community structure. Our approach has three important features: the capacity of detecting overlapping communities, the capability of identifying communities from an individual point of view and the fine tuning the community detectability with respect to prior knowledge of the data. Finally we discuss how to use a Shannon entropy measure for parameter estimation in complex networks.

Insight and analysis problem solving in microbes to machines.

PubMed

Clark, Kevin B

2015-11-01

A key feature for obtaining solutions to difficult problems, insight is oftentimes vaguely regarded as a special discontinuous intellectual process and/or a cognitive restructuring of problem representation or goal approach. However, this nearly century-old state of art devised by the Gestalt tradition to explain the non-analytical or non-trial-and-error, goal-seeking aptitude of primate mentality tends to neglect problem-solving capabilities of lower animal phyla, Kingdoms other than Animalia, and advancing smart computational technologies built from biological, artificial, and composite media. Attempting to provide an inclusive, precise definition of insight, two major criteria of insight, discontinuous processing and problem restructuring, are here reframed using terminology and statistical mechanical properties of computational complexity classes. Discontinuous processing becomes abrupt state transitions in algorithmic/heuristic outcomes or in types of algorithms/heuristics executed by agents using classical and/or quantum computational models. And problem restructuring becomes combinatorial reorganization of resources, problem-type substitution, and/or exchange of computational models. With insight bounded by computational complexity, humans, ciliated protozoa, and complex technological networks, for example, show insight when restructuring time requirements, combinatorial complexity, and problem type to solve polynomial and nondeterministic polynomial decision problems. Similar effects are expected from other problem types, supporting the idea that insight might be an epiphenomenon of analytical problem solving and consequently a larger information processing framework. Thus, this computational complexity definition of insight improves the power, external and internal validity, and reliability of operational parameters with which to classify, investigate, and produce the phenomenon for computational agents ranging from microbes to man-made devices. Copyright © 2015 Elsevier Ltd. All rights reserved.

An economic model of friendship and enmity for measuring social balance in networks

NASA Astrophysics Data System (ADS)

Lee, Kyu-Min; Shin, Euncheol; You, Seungil

2017-12-01

We propose a dynamic economic model of networks where agents can be friends or enemies with one another. This is a decentralized relationship model in that agents decide whether to change their relationships so as to minimize their imbalanced triads. In this model, there is a single parameter, which we call social temperature, that captures the degree to which agents care about social balance in their relationships. We show that the global structure of relationship configuration converges to a unique stationary distribution. Using this stationary distribution, we characterize the maximum likelihood estimator of the social temperature parameter. Since the estimator is computationally challenging to calculate from real social network datasets, we provide a simple simulation algorithm and verify its performance with real social network datasets.

Using Agent Base Models to Optimize Large Scale Network for Large System Inventories

NASA Technical Reports Server (NTRS)

Shameldin, Ramez Ahmed; Bowling, Shannon R.

2010-01-01

The aim of this paper is to use Agent Base Models (ABM) to optimize large scale network handling capabilities for large system inventories and to implement strategies for the purpose of reducing capital expenses. The models used in this paper either use computational algorithms or procedure implementations developed by Matlab to simulate agent based models in a principal programming language and mathematical theory using clusters, these clusters work as a high performance computational performance to run the program in parallel computational. In both cases, a model is defined as compilation of a set of structures and processes assumed to underlie the behavior of a network system.

NPS Collaborative Technology Testbed for ONR CKM Program

DTIC Science & Technology

2005-01-11

or have access to the MIT E-Wall hosted by the TOC. The combination of E-Wall and agents lend themselves to the dynamic gathering and display of...display, intuitive icons or menus that is easy to activate and customize , and automatically seeks and connects to other like services/networks/agents...integration creates network- centric memory mechanism for developing shared understanding of SA events Data Base Integration of Sensor-DM Agents and

Dancing with Swarms: Utilizing Swarm Intelligence to Build, Investigate, and Control Complex Systems

NASA Astrophysics Data System (ADS)

Jacob, Christian

We are surrounded by a natural world of massively parallel, decentralized biological "information processing" systems, a world that exhibits fascinating emergent properties in many ways. In fact, our very own bodies are the result of emergent patterns, as the development of any multi-cellular organism is determined by localized interactions among an enormous number of cells, carefully orchestrated by enzymes, signalling proteins and other molecular "agents". What is particularly striking about these highly distributed developmental processes is that a centralized control agency is completely absent. This is also the case for many other biological systems, such as termites which build their nests—without an architect that draws a plan, or brain cells evolving into a complex `mind machine'—without an explicit blueprint of a network layout.

NMR backbone assignments of the tyrosine kinase domain of human fibroblast growth factor receptor 3 in apo state and in complex with inhibitor PD173074.

PubMed

Sanfelice, Domenico; Koss, Hans; Bunney, Tom D; Thompson, Gary S; Farrell, Brendan; Katan, Matilda; Breeze, Alexander L

2018-03-26

Fibroblast growth factors receptors (FGFR) are transmembrane protein tyrosine kinases involved in many cellular process, including growth, differentiation and angiogenesis. Dysregulation of FGFR enzymatic activity is associated with developmental disorders and cancers; therefore FGFRs have become attractive targets for drug discovery, with a number of agents in late-stage clinical trials. Here, we present the backbone resonance assignments of FGFR3 tyrosine kinase domain in the ligand-free form and in complex with the canonical FGFR kinase inhibitor PD173074. Analysis of chemical shift changes upon inhibitor binding highlights a characteristic pattern of allosteric network perturbations that is of relevance for future drug discovery activities aimed at development of conformationally-selective FGFR inhibitors.

Aberrant Network Activity in Schizophrenia.

PubMed

Hunt, Mark J; Kopell, Nancy J; Traub, Roger D; Whittington, Miles A

2017-06-01

Brain dynamic changes associated with schizophrenia are largely equivocal, with interpretation complicated by many factors, such as the presence of therapeutic agents and the complex nature of the syndrome itself. Evidence for a brain-wide change in individual network oscillations, shared by all patients, is largely equivocal, but stronger for lower (delta) than for higher (gamma) bands. However, region-specific changes in rhythms across multiple, interdependent, nested frequencies may correlate better with pathology. Changes in synaptic excitation and inhibition in schizophrenia disrupt delta rhythm-mediated cortico-cortical communication, while enhancing thalamocortical communication in this frequency band. The contrasting relationships between delta and higher frequencies in thalamus and cortex generate frequency mismatches in inter-regional connectivity, leading to a disruption in temporal communication between higher-order brain regions associated with mental time travel. Copyright © 2017 Elsevier Ltd. All rights reserved.

The highly intelligent virtual agents for modeling financial markets

NASA Astrophysics Data System (ADS)

Yang, G.; Chen, Y.; Huang, J. P.

2016-02-01

Researchers have borrowed many theories from statistical physics, like ensemble, Ising model, etc., to study complex adaptive systems through agent-based modeling. However, one fundamental difference between entities (such as spins) in physics and micro-units in complex adaptive systems is that the latter are usually with high intelligence, such as investors in financial markets. Although highly intelligent virtual agents are essential for agent-based modeling to play a full role in the study of complex adaptive systems, how to create such agents is still an open question. Hence, we propose three principles for designing high artificial intelligence in financial markets and then build a specific class of agents called iAgents based on these three principles. Finally, we evaluate the intelligence of iAgents through virtual index trading in two different stock markets. For comparison, we also include three other types of agents in this contest, namely, random traders, agents from the wealth game (modified on the famous minority game), and agents from an upgraded wealth game. As a result, iAgents perform the best, which gives a well support for the three principles. This work offers a general framework for the further development of agent-based modeling for various kinds of complex adaptive systems.

Network Interventions on Physical Activity in an Afterschool Program: An Agent-Based Social Network Study

PubMed Central

Zhang, Jun; Shoham, David A.; Tesdahl, Eric

2015-01-01

Objectives. We studied simulated interventions that leveraged social networks to increase physical activity in children. Methods. We studied a real-world social network of 81 children (average age = 7.96 years) who lived in low socioeconomic status neighborhoods, and attended public schools and 1 of 2 structured afterschool programs. The sample was ethnically diverse, and 44% were overweight or obese. We used social network analysis and agent-based modeling simulations to test whether implementing a network intervention would increase children’s physical activity. We tested 3 intervention strategies. Results. The intervention that targeted opinion leaders was effective in increasing the average level of physical activity across the entire network. However, the intervention that targeted the most sedentary children was the best at increasing their physical activity levels. Conclusions. Which network intervention to implement depends on whether the goal is to shift the entire distribution of physical activity or to influence those most adversely affected by low physical activity. Agent-based modeling could be an important complement to traditional project planning tools, analogous to sample size and power analyses, to help researchers design more effective interventions for increasing children’s physical activity. PMID:25689202

Design and Analysis of a Data Fusion Scheme in Mobile Wireless Sensor Networks Based on Multi-Protocol Mobile Agents

PubMed Central

Wu, Chunxue; Wu, Wenliang; Wan, Caihua

2017-01-01

Sensors are increasingly used in mobile environments with wireless network connections. Multiple sensor types measure distinct aspects of the same event. Their measurements are then combined to produce integrated, reliable results. As the number of sensors in networks increases, low energy requirements and changing network connections complicate event detection and measurement. We present a data fusion scheme for use in mobile wireless sensor networks with high energy efficiency and low network delays, that still produces reliable results. In the first phase, we used a network simulation where mobile agents dynamically select the next hop migration node based on the stability parameter of the link, and perform the data fusion at the migration node. Agents use the fusion results to decide if it should return the fusion results to the processing center or continue to collect more data. In the second phase. The feasibility of data fusion at the node level is confirmed by an experimental design where fused data from color sensors show near-identical results to actual physical temperatures. These results are potentially important for new large-scale sensor network applications. PMID:29099793

The New Agent: A Qualitative Study to Strategically Adapt New Agent Professional Development

ERIC Educational Resources Information Center

Baker, Lauri M.; Hadley, Gregg

2014-01-01

The qualitative study reported here assessed the needs of agents related to new agent professional development to improve the current model. Agents who participated in new agent professional development within the last 5 years were selected to participate in focus groups to determine concerns and continued needs. Agents enjoyed networking and…

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

Mahault, Benoit Alexandre; Saxena, Avadh Behari; Nisoli, Cristiano

We introduce a minimal agent-based model to qualitatively conceptualize the allocation of limited wealth among more abundant opportunities. We study the interplay of power, satisfaction and frustration in the problem of wealth distribution, concentration, and inequality. This framework allows us to compare subjective measures of frustration and satisfaction to collective measures of fairness in wealth distribution, such as the Lorenz curve and the Gini index. We find that a completely libertarian, law-of-the-jungle setting, where every agent can acquire wealth from, or lose wealth to, anybody else invariably leads to a complete polarization of the distribution of wealth vs. opportunity, onlymore » minimally ameliorated by disorder in a non-optimized society. The picture is however dramatically modified when hard constraints are imposed over agents, and they are forced to share wealth with neighbors on a network. We discuss the case of random networks and scale free networks. We then propose an out of equilibrium dynamics of the networks, based on a competition of power and frustration in the decision-making of agents that leads to network evolution. We show that the ratio of power and frustration controls different dynamical regimes separated by kinetic transition and characterized by drastically different values of the indices of equality.« less

The aerosphere as a network connector of organisms and their diseases

USGS Publications Warehouse

Ross, Jeremy D.; Bridge, Eli S.; Prosser, Diann J.; Takekawa, John Y.

2018-01-01

Aeroecological processes, especially powered flight of animals, can rapidly connect biological communities across the globe. This can have profound consequences for evolutionary diversification, energy and nutrient transfers, and the spread of infectious diseases. The latter is of particular consequence for human populations, since migratory birds are known to host diseases which have a history of transmission into domestic poultry or even jumping to human hosts. In this chapter, we present a scenario under which a highly pathogenic avian influenza (HPAI) strain enters North America from East Asia via post-molting waterfowl migration. We use an agent-based model (ABM) to simulate the movement and disease transmission among 106 generalized waterfowl agents originating from ten molting locations in eastern Siberia, with the HPAI seeded in only ~102 agents at one of these locations. Our ABM tracked the disease dynamics across a very large grid of sites as well as individual agents, allowing us to examine the spatiotemporal patterns of change in virulence of the HPAI infection as well as waterfowl host susceptibility to the disease. We concurrently simulated a 12-station disease monitoring network in the northwest USA and Canada in order to assess the potential efficacy of these sites to detect and confirm the arrival of HPAI. Our findings indicated that HPAI spread was initially facilitated but eventually subdued by the migration of host agents. Yet, during the 90-day simulation, selective pressures appeared to have distilled the HPAI strain to its most virulent form (i.e., through natural selection), which was counterbalanced by the host susceptibility being conversely reduced (i.e., through genetic predisposition and acquired immunity). The monitoring network demonstrated wide variation in the utility of sites; some were clearly better at providing early warnings of HPAI arrival, while sites further from the disease origin exposed the selective dynamics which slowed the spread of the disease albeit with the result of passing highly virulent strains into southern wintering locales (where human impacts are more likely). Though the ABM presented had generalized waterfowl migration and HPAI disease dynamics, this exercise demonstrates the power of such simulations to examine the extremely large and complex processes which comprise aeroecology. We offer insights into how such models could be further parameterized to represent HPAI transmission risks as well as how ABMs could be applied to other aeroecological questions pertaining to individual-based connectivity.

Directed Random Markets: Connectivity Determines Money

NASA Astrophysics Data System (ADS)

Martínez-Martínez, Ismael; López-Ruiz, Ricardo

2013-12-01

Boltzmann-Gibbs (BG) distribution arises as the statistical equilibrium probability distribution of money among the agents of a closed economic system where random and undirected exchanges are allowed. When considering a model with uniform savings in the exchanges, the final distribution is close to the gamma family. In this paper, we implement these exchange rules on networks and we find that these stationary probability distributions are robust and they are not affected by the topology of the underlying network. We introduce a new family of interactions: random but directed ones. In this case, it is found the topology to be determinant and the mean money per economic agent is related to the degree of the node representing the agent in the network. The relation between the mean money per economic agent and its degree is shown to be linear.

Partner switching promotes cooperation among myopic agents on a geographical plane

NASA Astrophysics Data System (ADS)

Li, Yixiao; Min, Yong; Zhu, Xiaodong; Cao, Jie

2013-02-01

We study the coupling dynamics between the evolution of cooperation and the evolution of partnership network on a geographical plane. While agents play networked prisoner’s dilemma games, they can dynamically adjust their partnerships based on local information about reputation. We incorporate geographical features into the process of the agent’s partner switching and investigate the corresponding effects. At each time step of the coevolution, a random agent can either update his strategy by imitation or adjust his partnership by switching from the lowest reputation partner to the highest reputation one among his neighbors. We differentiate two types of neighbors: geographical neighbors (i.e., the set of agents who are close to the focal agent in terms of geographical distance) and connectivity neighbors (i.e., the set of agents who are close to the focal agent in the partnership network in terms of geodesic distance). We find that switching to either geographical neighbors or connectivity neighbors enhances cooperation greatly in a wide parameter range. Cooperation can be favored in a much stricter condition when agents switch to connectivity neighbors more frequently. However, an increasing tendency of reconnecting to geographical neighbors shortens the geographical distance between a pair of partners on average. When agents consider the cost of geographical distance in adjusting the partnership, they are prone to reconnect to geographical neighbors.

Collective motion patterns of swarms with delay coupling: Theory and experiment.

PubMed

Szwaykowska, Klementyna; Schwartz, Ira B; Mier-Y-Teran Romero, Luis; Heckman, Christoffer R; Mox, Dan; Hsieh, M Ani

2016-03-01

The formation of coherent patterns in swarms of interacting self-propelled autonomous agents is a subject of great interest in a wide range of application areas, ranging from engineering and physics to biology. In this paper, we model and experimentally realize a mixed-reality large-scale swarm of delay-coupled agents. The coupling term is modeled as a delayed communication relay of position. Our analyses, assuming agents communicating over an Erdös-Renyi network, demonstrate the existence of stable coherent patterns that can be achieved only with delay coupling and that are robust to decreasing network connectivity and heterogeneity in agent dynamics. We also show how the bifurcation structure for emergence of different patterns changes with heterogeneity in agent acceleration capabilities and limited connectivity in the network as a function of coupling strength and delay. Our results are verified through simulation as well as preliminary experimental results of delay-induced pattern formation in a mixed-reality swarm.

Collective motion patterns of swarms with delay coupling: Theory and experiment

NASA Astrophysics Data System (ADS)

Szwaykowska, Klementyna; Schwartz, Ira B.; Mier-y-Teran Romero, Luis; Heckman, Christoffer R.; Mox, Dan; Hsieh, M. Ani

2016-03-01

The formation of coherent patterns in swarms of interacting self-propelled autonomous agents is a subject of great interest in a wide range of application areas, ranging from engineering and physics to biology. In this paper, we model and experimentally realize a mixed-reality large-scale swarm of delay-coupled agents. The coupling term is modeled as a delayed communication relay of position. Our analyses, assuming agents communicating over an Erdös-Renyi network, demonstrate the existence of stable coherent patterns that can be achieved only with delay coupling and that are robust to decreasing network connectivity and heterogeneity in agent dynamics. We also show how the bifurcation structure for emergence of different patterns changes with heterogeneity in agent acceleration capabilities and limited connectivity in the network as a function of coupling strength and delay. Our results are verified through simulation as well as preliminary experimental results of delay-induced pattern formation in a mixed-reality swarm.

Dietary Antioxidants: Potential Anticancer Agents.

PubMed

Wu, Xiayu; Cheng, Jiaoni; Wang, Xu

2017-01-01

There are several extrinsic and intrinsic factors involving reactive oxygen species that play critical roles in tumor development and progression by inducing DNA mutations, genomic instability, and aberrant pro-tumorigenic signaling. There are various essential micronutrients including minerals and vitamins in the diet, which play pivotal roles in maintaining and reinforcing antioxidant performance, affecting the complex network of genes (nutrigenomic approach) and encoding proteins for carcinogenesis. A lot of these antioxidant agents are available as dietary supplements and are predominant worldwide. However, the best antioxidant micronutrient (or a combination of micronutrients) for reducing cancer risks is unknown. The purpose of this review is to survey the literature on modern biological theories of cancer and the roles of dietary antioxidants in cancer. The roles and functions of antioxidant micronutrients, such as vitamin C (ascorbate), vitamin E (alpha-tocopherol), selenium, and vitamin A, provided through diet for the prevention of cancer are discussed in the present work.

Reducing Traffic Congestions by Introducing CACC-Vehicles on a Multi-Lane Highway Using Agent-Based Approach

NASA Technical Reports Server (NTRS)

Arnaout, Georges M.; Bowling, Shannon R.

2011-01-01

Traffic congestion is an ongoing problem of great interest to researchers from different areas in academia. With the emerging technology for inter-vehicle communication, vehicles have the ability to exchange information with predecessors by wireless communication. In this paper, we present an agent-based model of traffic congestion and examine the impact of having CACC (Cooperative Adaptive Cruise Control) embedded vehicle(s) on a highway system consisting of 4 traffic lanes without overtaking. In our model, CACC vehicles adapt their acceleration/deceleration according to vehicle-to-vehicle inter-communication. We analyze the average speed of the cars, the shockwaves, and the evolution of traffic congestion throughout the lifecycle of the model. The study identifies how CACC vehicles affect the dynamics of traffic flow on a complex network and reduce the oscillatory behavior (stop and go) resulting from the acceleration/deceleration of the vehicles.

Users matter : multi-agent systems model of high performance computing cluster users.

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

North, M. J.; Hood, C. S.; Decision and Information Sciences

2005-01-01

High performance computing clusters have been a critical resource for computational science for over a decade and have more recently become integral to large-scale industrial analysis. Despite their well-specified components, the aggregate behavior of clusters is poorly understood. The difficulties arise from complicated interactions between cluster components during operation. These interactions have been studied by many researchers, some of whom have identified the need for holistic multi-scale modeling that simultaneously includes network level, operating system level, process level, and user level behaviors. Each of these levels presents its own modeling challenges, but the user level is the most complex duemore » to the adaptability of human beings. In this vein, there are several major user modeling goals, namely descriptive modeling, predictive modeling and automated weakness discovery. This study shows how multi-agent techniques were used to simulate a large-scale computing cluster at each of these levels.« less

Basic Lessons in ORA and AutoMap 2011

DTIC Science & Technology

2011-06-13

A small legend also appears. Below is a screen capture showing the visualization of the agent x event graph from the Stargate Summit Meta-Network...4 The visualization displays the connections between all items in the Stargate Summit Meta-Network. The red circles represent the agents, the...It takes the examples I used for the Stargate dataset. 5 lessons - 201-207 A step by step run through of creating the Meta-Network from

Detection and isolation of nucleic acid sequences using competitive hybridization probes

DOEpatents

Lucas, Joe N.; Straume, Tore; Bogen, Kenneth T.

1997-01-01

A method for detecting a target nucleic acid sequence in a sample is provided using hybridization probes which competitively hybridize to a target nucleic acid. According to the method, a target nucleic acid sequence is hybridized to first and second hybridization probes which are complementary to overlapping portions of the target nucleic acid sequence, the first hybridization probe including a first complexing agent capable of forming a binding pair with a second complexing agent and the second hybridization probe including a detectable marker. The first complexing agent attached to the first hybridization probe is contacted with a second complexing agent, the second complexing agent being attached to a solid support such that when the first and second complexing agents are attached, target nucleic acid sequences hybridized to the first hybridization probe become immobilized on to the solid support. The immobilized target nucleic acids are then separated and detected by detecting the detectable marker attached to the second hybridization probe. A kit for performing the method is also provided.

Detection and isolation of nucleic acid sequences using competitive hybridization probes

DOEpatents

Lucas, J.N.; Straume, T.; Bogen, K.T.

1997-04-01

A method for detecting a target nucleic acid sequence in a sample is provided using hybridization probes which competitively hybridize to a target nucleic acid. According to the method, a target nucleic acid sequence is hybridized to first and second hybridization probes which are complementary to overlapping portions of the target nucleic acid sequence, the first hybridization probe including a first complexing agent capable of forming a binding pair with a second complexing agent and the second hybridization probe including a detectable marker. The first complexing agent attached to the first hybridization probe is contacted with a second complexing agent, the second complexing agent being attached to a solid support such that when the first and second complexing agents are attached, target nucleic acid sequences hybridized to the first hybridization probe become immobilized on to the solid support. The immobilized target nucleic acids are then separated and detected by detecting the detectable marker attached to the second hybridization probe. A kit for performing the method is also provided. 7 figs.

Synchronization in node of complex networks consist of complex chaotic system

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

Wei, Qiang, E-mail: qiangweibeihua@163.com; Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin; Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024

2014-07-15

A new synchronization method is investigated for node of complex networks consists of complex chaotic system. When complex networks realize synchronization, different component of complex state variable synchronize up to different scaling complex function by a designed complex feedback controller. This paper change synchronization scaling function from real field to complex field for synchronization in node of complex networks with complex chaotic system. Synchronization in constant delay and time-varying coupling delay complex networks are investigated, respectively. Numerical simulations are provided to show the effectiveness of the proposed method.

Dissection of Host Susceptibility to Bacterial Infections and Its Toxins.

PubMed

Nashef, Aysar; Agbaria, Mahmoud; Shusterman, Ariel; Lorè, Nicola Ivan; Bragonzi, Alessandra; Wiess, Ervin; Houri-Haddad, Yael; Iraqi, Fuad A

2017-01-01

Infection is one of the leading causes of human mortality and morbidity. Exposure to microbial agents is obviously required. However, also non-microbial environmental and host factors play a key role in the onset, development and outcome of infectious disease, resulting in large of clinical variability between individuals in a population infected with the same microbe. Controlled and standardized investigations of the genetics of susceptibility to infectious disease are almost impossible to perform in humans whereas mouse models allow application of powerful genomic techniques to identify and validate causative genes underlying human diseases with complex etiologies. Most of current animal models used in complex traits diseases genetic mapping have limited genetic diversity. This limitation impedes the ability to create incorporated network using genetic interactions, epigenetics, environmental factors, microbiota, and other phenotypes. A novel mouse genetic reference population for high-resolution mapping and subsequently identifying genes underlying the QTL, namely the Collaborative Cross (CC) mouse genetic reference population (GRP) was recently developed. In this chapter, we discuss a variety of approaches using CC mice for mapping genes underlying quantitative trait loci (QTL) to dissect the host response to polygenic traits, including infectious disease caused by bacterial agents and its toxins.

[Ecology of vector systems: a tangle of complexity].

PubMed

Rodhain, F

2008-06-01

The long co-evolutionary process between arthropods and microorganisms has resulted in a wide variety of relationships. One such relationship involves a wide range of infectious agents (virus, bacteria, protozoa, helminthes) that use blood-feeding arthropods (insects and mites) as vectors for transmission from one vertebrate to another. Transmission involves three components, i.e., microorganism, vector(s), and vertebrate host(s). Study under natural conditions has shown that the underlying mechanisms are extremely complex with circulation of the infectious agents depending on numerous conditions linked not only to bioecology but also to genetic factors in all three component populations. The role of arthropods sometimes goes beyond that of a transmitter of disease. In some cases they also serve as reservoirs or disseminators. In addition changes in the environment whether due to natural causes or human activities (e.g. pollution, agropastoralism, urbanization, transportation network development, and climate change) can have profound and rapid effects on the mechanisms underlying these vector systems. In short the ecology of vector systems closely reflects the extreme complexity of epidemiological studies on diseases caused by infectious agents depending on this type of transmission. As a result prediction of infectious risks and planning of preventive action are difficult. It appears obvious that a good understanding of vector systems in their natural context will require a truly ecological approach to the diseases that must be the focus of extremely close epidemiologic surveillance. Achieving this goal will necessitate more than the skills of physicians and veterinarians. It will require the contribution of specialists from a variety of fields such as microbiology, entomology, systematics, climatology, ecology, urbanism, social sciences, economic development, and many others.

Complexing agents and pH influence on chemical durability of type I moulded glass containers.

PubMed

Biavati, Alberto; Poncini, Michele; Ferrarini, Arianna; Favaro, Nicola; Scarpa, Martina; Vallotto, Marta

2017-06-16

Among the factors that affect the glass surface chemical durability, pH and complexing agents presence in aqueous solution have the main role (1). Glass surface attack can be also related to the delamination issue with glass particles appearance in the pharmaceutical preparation. A few methods to check for glass containers delamination propensity and some control guidelines have been proposed (2,3). The present study emphasizes the possible synergy between a few complexing agents with pH on the borosilicate glass chemical durability. Hydrolytic attack was performed in small volume 23 ml type I glass containers autoclaved according to EP or USP for 1 hour at 121°C, in order to enhance the chemical attack due to time, temperature and the unfavourable surface/volume ratio. 0,048 M or 0.024 M (moles/liter) solutions of the acids citric, glutaric, acetic, EDTA (ethylenediaminetetraacetic acid) and sodium phosphate with water for comparison, were used for the trials. The pH was adjusted ± 0,05 units at fixed values 5,5-6,6-7-7,4-8-9 by LiOH diluted solution. Since silicon is the main glass network former, silicon release into the attack solutions was chosen as the main index of the glass surface attack and analysed by ICPAES. The work was completed by the analysis of the silicon release in the worst attack conditions, of moulded glass, soda lime type II and tubing borosilicate glass vials to compare different glass compositions and forming technologies. Surface analysis by SEM was finally performed to check for the surface status after the worst chemical attack condition by citric acid. Copyright © 2017, Parenteral Drug Association.

Dynamic Network Security Control Using Software Defined Networking

DTIC Science & Technology

2016-03-24

Most importantly I thank my family for understanding, loving , and thriving in the hectic world of military spouse and children. Michael C. Todd v...RBAC poses access to objects as a user to member-of group relationship . This construct results in a set of rules to govern access to objects based...API. Agent Agent.py Event.py Message.py ModSysStatus.py Event Message ModSysStatus Event - Message - ModSysStatus Relationship Figure 12. Agent Design

Fault Tolerant Airborne Sensor Networks for Air Operations

DTIC Science & Technology

2008-02-01

lives affected by undetected targets. The network is said to have expired when there is no longer a single surviving sensor-pair. Tasking process...tasking a finite number of cooperative agents to randomly emerging targets for their removal. Faults occur when some agents engaged in a mission are...expired. Agents are subject to threat at a level determined by the number of targets present. On the other hand, the rate at which a target is removed

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

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.

Signaling mechanisms of apoptosis-like programmed cell death in unicellular eukaryotes.

PubMed

Shemarova, Irina V

2010-04-01

In unicellular eukaryotes, apoptosis-like cell death occurs during development, aging and reproduction, and can be induced by environmental stresses and exposure to toxic agents. The essence of the apoptotic machinery in unicellular organisms is similar to that in mammals, but the apoptotic signal network is less complex and of more ancient origin. The review summarizes current data about key apoptotic proteins and mechanisms of the transduction of apoptotic signals by caspase-like proteases and mitochondrial apoptogenic proteins in unicellular eukaryotes. The roles of receptor-dependent and receptor-independent caspase cascades are reviewed. 2010 Elsevier Inc. All rights reserved.

Interacting opinion and disease dynamics in multiplex networks: Discontinuous phase transition and nonmonotonic consensus times

NASA Astrophysics Data System (ADS)

Velásquez-Rojas, Fátima; Vazquez, Federico

2017-05-01

Opinion formation and disease spreading are among the most studied dynamical processes on complex networks. In real societies, it is expected that these two processes depend on and affect each other. However, little is known about the effects of opinion dynamics over disease dynamics and vice versa, since most studies treat them separately. In this work we study the dynamics of the voter model for opinion formation intertwined with that of the contact process for disease spreading, in a population of agents that interact via two types of connections, social and contact. These two interacting dynamics take place on two layers of networks, coupled through a fraction q of links present in both networks. The probability that an agent updates its state depends on both the opinion and disease states of the interacting partner. We find that the opinion dynamics has striking consequences on the statistical properties of disease spreading. The most important is that the smooth (continuous) transition from a healthy to an endemic phase observed in the contact process, as the infection probability increases beyond a threshold, becomes abrupt (discontinuous) in the two-layer system. Therefore, disregarding the effects of social dynamics on epidemics propagation may lead to a misestimation of the real magnitude of the spreading. Also, an endemic-healthy discontinuous transition is found when the coupling q overcomes a threshold value. Furthermore, we show that the disease dynamics delays the opinion consensus, leading to a consensus time that varies nonmonotonically with q in a large range of the model's parameters. A mean-field approach reveals that the coupled dynamics of opinions and disease can be approximately described by the dynamics of the voter model decoupled from that of the contact process, with effective probabilities of opinion and disease transmission.

Sustainability and collapse in a coevolutionary model of local resource stocks and behavioral patterns on a social network

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Heitzig, Jobst; Kurths, Jürgen

2014-05-01

When investigating the causes and consequences of global change, the collective behavior of human beings is considered as having a considerable impact on natural systems. In our work, we propose a conceptual coevolutionary model simulating the dynamics of local renewable resources in interaction with simplistic societal agents exploiting those resources. The society is represented by a social network on which social traits may be transmitted between agents. These traits themselves induce a certain rate of exploitation of the resource, leading either to its depletion or sustainable existence. Traits are exchanged probabilistically according to their instantaneous individual payoff, and hence this process depends on the status of the natural resource. At the same time agents may adaptively restructure their set of acquaintances. Connections with agents having a different trait may be broken while new connections with agents of the same trait are established. We investigate which choices of social parameters, like the frequency of social interaction, rationality and rate of social network adaptation, cause the system to end in a sustainable state and, hence, what can be done to avoid a collapse of the entire system. The importance and influence of the social network structure is analyzed by the variation of link-densities in the underlying network topology and shows significant influence on the expected outcome of the model. For a static network with no adaptation we find a robust phase transition between the two different regimes, sustainable and non-sustainable, which co-exist in parameter space. High connectivity within the social network, e.g., high link-densities, in combination with a fast rate of social learning lead to a likely collapse of the entire co-evolutionary system, whereas slow learning and small network connectivity very likely result in the sustainable existence of the natural resources. Collapse may be avoided by an intelligent rewiring, e.g. adaptation, of the social network that may also lead to the isolation of misbehaving parts of the society. Our results may suggest that with the current trend to faster imitation and ever increasing global network connectivity, societies are becoming more vulnerable to environmental collapse if they remain myopic at the same time.

Synchronization control in multiplex networks of nonlinear multi-agent systems

NASA Astrophysics Data System (ADS)

He, Wangli; Xu, Zhiwei; Du, Wenli; Chen, Guanrong; Kubota, Naoyuki; Qian, Feng

2017-12-01

This paper is concerned with synchronization control of a multiplex network, in which two different kinds of relationships among agents coexist. Hybrid coupling, including continuous linear coupling and impulsive coupling, is proposed to model the coexisting distinguishable interactions. First, by adding impulsive controllers on a small portion of agents, local synchronization is analyzed by linearizing the error system at the desired trajectory. Then, global synchronization is studied based on the Lyapunov stability theory, where a time-varying coupling strength is involved. To further deal with the time-varying coupling strength, an adaptive updating law is introduced and a corresponding sufficient condition is obtained to ensure synchronization of the multiplex network towards the desired trajectory. Networks of Chua's circuits and other chaotic systems with double layers of interactions are simulated to verify the proposed method.

Molecular dynamics simulations and modelling of the residue interaction networks in the BRAF kinase complexes with small molecule inhibitors: probing the allosteric effects of ligand-induced kinase dimerization and paradoxical activation.

PubMed

Verkhivker, G M

2016-10-20

Protein kinases are central to proper functioning of cellular networks and are an integral part of many signal transduction pathways. The family of protein kinases represents by far the largest and most important class of therapeutic targets in oncology. Dimerization-induced activation has emerged as a common mechanism of allosteric regulation in BRAF kinases, which play an important role in growth factor signalling and human diseases. Recent studies have revealed that most of the BRAF inhibitors can induce dimerization and paradoxically stimulate enzyme transactivation by conferring an active conformation in the second monomer of the kinase dimer. The emerging connections between inhibitor binding and BRAF kinase domain dimerization have suggested a molecular basis of the activation mechanism in which BRAF inhibitors may allosterically modulate the stability of the dimerization interface and affect the organization of residue interaction networks in BRAF kinase dimers. In this work, we integrated structural bioinformatics analysis, molecular dynamics and binding free energy simulations with the protein structure network analysis of the BRAF crystal structures to determine dynamic signatures of BRAF conformations in complexes with different types of inhibitors and probe the mechanisms of the inhibitor-induced dimerization and paradoxical activation. The results of this study highlight previously unexplored relationships between types of BRAF inhibitors, inhibitor-induced changes in the residue interaction networks and allosteric modulation of the kinase activity. This study suggests a mechanism by which BRAF inhibitors could promote or interfere with the paradoxical activation of BRAF kinases, which may be useful in informing discovery efforts to minimize the unanticipated adverse biological consequences of these therapeutic agents.

Ink composition for making a conductive silver structure

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

Walker, Steven B.; Lewis, Jennifer A.

An ink composition for making a conductive silver structure comprises a silver salt and a complex of (a) a complexing agent and a short chain carboxylic acid or (b) a complexing agent and a salt of a short chain carboxylic acid, according to one embodiment. A method for making a silver structure entails combining a silver salt and a complexing agent, and then adding a short chain carboxylic acid or a salt of the short chain carboxylic acid to the combined silver salt and a complexing agent to form an ink composition. A concentration of the complexing agent in themore » ink composition is reduced to form a concentrated formulation, and the silver salt is reduced to form a conductive silver structure, where the concentrated formulation and the conductive silver structure are formed at a temperature of about 120.degree. C. or less.« less

Fundamental properties of cooperative contagion processes

NASA Astrophysics Data System (ADS)

Chen, Li; Ghanbarnejad, Fakhteh; Brockmann, Dirk

2017-10-01

We investigate the effects of cooperativity between contagion processes that spread and persist in a host population. We propose and analyze a dynamical model in which individuals that are affected by one transmissible agent A exhibit a higher than baseline propensity of being affected by a second agent B and vice versa. The model is a natural extension of the traditional susceptible-infected-susceptible model used for modeling single contagion processes. We show that cooperativity changes the dynamics of the system considerably when cooperativity is strong. The system exhibits discontinuous phase transitions not observed in single agent contagion, multi-stability, a separation of the traditional epidemic threshold into different thresholds for inception and extinction as well as hysteresis. These properties are robust and are corroborated by stochastic simulations on lattices and generic network topologies. Finally, we investigate wave propagation and transients in a spatially extended version of the model and show that especially for intermediate values of baseline reproduction ratios the system is characterized by various types of wave-front speeds. The system can exhibit spatially heterogeneous stationary states for some parameters and negative front speeds (receding wave fronts). The two agent model can be employed as a starting point for more complex contagion processes, involving several interacting agents, a model framework particularly suitable for modeling the spread and dynamics of microbiological ecosystems in host populations.

Industrial entrepreneurial network: Structural and functional analysis

NASA Astrophysics Data System (ADS)

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

2016-12-01

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

Proof of Concept: A review on how network and systems biology approaches aid in the discovery of potent anticancer drug combinations

PubMed Central

Azmi, Asfar S.; Wang, Zhiwei; Philip, Philip A.; Mohammad, Ramzi M.; Sarkar, Fazlul H.

2010-01-01

Cancer therapies that target key molecules have not fulfilled expected promises for most common malignancies. Major challenges include the incomplete understanding and validation of these targets in patients, the multiplicity and complexity of genetic and epigenetic changes in the majority of cancers, and the redundancies and cross-talk found in key signaling pathways. Collectively, the uses of single-pathway targeted approaches are not effective therapies for human malignances. To overcome these barriers, it is important to understand the molecular cross-talk among key signaling pathways and how they may be altered by targeted agents. This requires innovative approaches such as understanding the global physiological environment of target proteins and the effects of modifying them without losing key molecular details. Such strategies will aid the design of novel therapeutics and their combinations against multifaceted diseases where efficacious combination therapies will focus on altering multiple pathways rather than single proteins. Integrated network modeling and systems biology has emerged as a powerful tool benefiting our understanding of drug mechanism of action in real time. This mini-review highlights the significance of the network and systems biology-based strategy and presents a “proof-of-concept” recently validated in our laboratory using the example of a combination treatment of oxaliplatin and the MDM2 inhibitor MI-219 in genetically complex and incurable pancreatic adenocarcinoma. PMID:21041384

Structure and dynamics of molecular networks: A novel paradigm of drug discovery: A comprehensive review

PubMed Central

Csermely, Peter; Korcsmáros, Tamás; Kiss, Huba J.M.; London, Gábor; Nussinov, Ruth

2013-01-01

Despite considerable progress in genome- and proteome-based high-throughput screening methods and in rational drug design, the increase in approved drugs in the past decade did not match the increase of drug development costs. Network description and analysis not only gives a systems-level understanding of drug action and disease complexity, but can also help to improve the efficiency of drug design. We give a comprehensive assessment of the analytical tools of network topology and dynamics. The state-of-the-art use of chemical similarity, protein structure, protein-protein interaction, signaling, genetic interaction and metabolic networks in the discovery of drug targets is summarized. We propose that network targeting follows two basic strategies. The “central hit strategy” selectively targets central node/edges of the flexible networks of infectious agents or cancer cells to kill them. The “network influence strategy” works against other diseases, where an efficient reconfiguration of rigid networks needs to be achieved. It is shown how network techniques can help in the identification of single-target, edgetic, multi-target and allo-network drug target candidates. We review the recent boom in network methods helping hit identification, lead selection optimizing drug efficacy, as well as minimizing side-effects and drug toxicity. Successful network-based drug development strategies are shown through the examples of infections, cancer, metabolic diseases, neurodegenerative diseases and aging. Summarizing >1200 references we suggest an optimized protocol of network-aided drug development, and provide a list of systems-level hallmarks of drug quality. Finally, we highlight network-related drug development trends helping to achieve these hallmarks by a cohesive, global approach. PMID:23384594

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.

Construction of multi-agent mobile robots control system in the problem of persecution with using a modified reinforcement learning method based on neural networks

NASA Astrophysics Data System (ADS)

Patkin, M. L.; Rogachev, G. N.

2018-02-01

A method for constructing a multi-agent control system for mobile robots based on training with reinforcement using deep neural networks is considered. Synthesis of the management system is proposed to be carried out with reinforcement training and the modified Actor-Critic method, in which the Actor module is divided into Action Actor and Communication Actor in order to simultaneously manage mobile robots and communicate with partners. Communication is carried out by sending partners at each step a vector of real numbers that are added to the observation vector and affect the behaviour. Functions of Actors and Critic are approximated by deep neural networks. The Critics value function is trained by using the TD-error method and the Actor’s function by using DDPG. The Communication Actor’s neural network is trained through gradients received from partner agents. An environment in which a cooperative multi-agent interaction is present was developed, computer simulation of the application of this method in the control problem of two robots pursuing two goals was carried out.

Remote Data Retrieval for Bioinformatics Applications: An Agent Migration Approach

PubMed Central

Gao, Lei; Dai, Hua; Zhang, Tong-Liang; Chou, Kuo-Chen

2011-01-01

Some of the approaches have been developed to retrieve data automatically from one or multiple remote biological data sources. However, most of them require researchers to remain online and wait for returned results. The latter not only requires highly available network connection, but also may cause the network overload. Moreover, so far none of the existing approaches has been designed to address the following problems when retrieving the remote data in a mobile network environment: (1) the resources of mobile devices are limited; (2) network connection is relatively of low quality; and (3) mobile users are not always online. To address the aforementioned problems, we integrate an agent migration approach with a multi-agent system to overcome the high latency or limited bandwidth problem by moving their computations to the required resources or services. More importantly, the approach is fit for the mobile computing environments. Presented in this paper are also the system architecture, the migration strategy, as well as the security authentication of agent migration. As a demonstration, the remote data retrieval from GenBank was used to illustrate the feasibility of the proposed approach. PMID:21701677

Intelligent sensor and controller framework for the power grid

DOEpatents

Akyol, Bora A.; Haack, Jereme Nathan; Craig, Jr., Philip Allen; Tews, Cody William; Kulkarni, Anand V.; Carpenter, Brandon J.; Maiden, Wendy M.; Ciraci, Selim

2015-07-28

Disclosed below are representative embodiments of methods, apparatus, and systems for monitoring and using data in an electric power grid. For example, one disclosed embodiment comprises a sensor for measuring an electrical characteristic of a power line, electrical generator, or electrical device; a network interface; a processor; and one or more computer-readable storage media storing computer-executable instructions. In this embodiment, the computer-executable instructions include instructions for implementing an authorization and authentication module for validating a software agent received at the network interface; instructions for implementing one or more agent execution environments for executing agent code that is included with the software agent and that causes data from the sensor to be collected; and instructions for implementing an agent packaging and instantiation module for storing the collected data in a data container of the software agent and for transmitting the software agent, along with the stored data, to a next destination.

Intelligent sensor and controller framework for the power grid

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

Akyol, Bora A.; Haack, Jereme Nathan; Craig, Jr., Philip Allen

Disclosed below are representative embodiments of methods, apparatus, and systems for monitoring and using data in an electric power grid. For example, one disclosed embodiment comprises a sensor for measuring an electrical characteristic of a power line, electrical generator, or electrical device; a network interface; a processor; and one or more computer-readable storage media storing computer-executable instructions. In this embodiment, the computer-executable instructions include instructions for implementing an authorization and authentication module for validating a software agent received at the network interface; instructions for implementing one or more agent execution environments for executing agent code that is included with themore » software agent and that causes data from the sensor to be collected; and instructions for implementing an agent packaging and instantiation module for storing the collected data in a data container of the software agent and for transmitting the software agent, along with the stored data, to a next destination.« less

Agent-based approach for generation of a money-centered star network

NASA Astrophysics Data System (ADS)

Yang, Jae-Suk; Kwon, Okyu; Jung, Woo-Sung; Kim, In-mook

2008-09-01

The history of trade is a progression from a pure barter system. A medium of exchange emerges autonomously in the market, a position currently occupied by money. We investigate an agent-based computational economics model consisting of interacting agents considering distinguishable properties of commodities which represent salability. We also analyze the properties of the commodity network using a spanning tree. We find that the “storage fee” is more crucial than “demand” in determining which commodity is used as a medium of exchange.

CROSS-DISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: The Fractal Dimensions of Complex Networks

NASA Astrophysics Data System (ADS)

Guo, Long; Cai, XU

2009-08-01

It is shown that many real complex networks share distinctive features, such as the small-world effect and the heterogeneous property of connectivity of vertices, which are different from random networks and regular lattices. Although these features capture the important characteristics of complex networks, their applicability depends on the style of networks. To unravel the universal characteristics many complex networks have in common, we study the fractal dimensions of complex networks using the method introduced by Shanker. We find that the average 'density' (ρ(r)) of complex networks follows a better power-law function as a function of distance r with the exponent df, which is defined as the fractal dimension, in some real complex networks. Furthermore, we study the relation between df and the shortcuts Nadd in small-world networks and the size N in regular lattices. Our present work provides a new perspective to understand the dependence of the fractal dimension df on the complex network structure.

Using Agent-Based Modeling to Enhance System-Level Real-time Control of Urban Stormwater Systems

NASA Astrophysics Data System (ADS)

Rimer, S.; Mullapudi, A. M.; Kerkez, B.

2017-12-01

The ability to reduce combined-sewer overflow (CSO) events is an issue that challenges over 800 U.S. municipalities. When the volume of a combined sewer system or wastewater treatment plant is exceeded, untreated wastewater then overflows (a CSO event) into nearby streams, rivers, or other water bodies causing localized urban flooding and pollution. The likelihood and impact of CSO events has only exacerbated due to urbanization, population growth, climate change, aging infrastructure, and system complexity. Thus, there is an urgent need for urban areas to manage CSO events. Traditionally, mitigating CSO events has been carried out via time-intensive and expensive structural interventions such as retention basins or sewer separation, which are able to reduce CSO events, but are costly, arduous, and only provide a fixed solution to a dynamic problem. Real-time control (RTC) of urban drainage systems using sensor and actuator networks has served as an inexpensive and versatile alternative to traditional CSO intervention. In particular, retrofitting individual stormwater elements for sensing and automated active distributed control has been shown to significantly reduce the volume of discharge during CSO events, with some RTC models demonstrating a reduction upwards of 90% when compared to traditional passive systems. As more stormwater elements become retrofitted for RTC, system-level RTC across complete watersheds is an attainable possibility. However, when considering the diverse set of control needs of each of these individual stormwater elements, such system-level RTC becomes a far more complex problem. To address such diverse control needs, agent-based modeling is employed such that each individual stormwater element is treated as an autonomous agent with a diverse decision making capabilities. We present preliminary results and limitations of utilizing the agent-based modeling computational framework for the system-level control of diverse, interacting stormwater elements.

Connection adaption for control of networked mobile chaotic agents.

PubMed

Zhou, Jie; Zou, Yong; Guan, Shuguang; Liu, Zonghua; Xiao, Gaoxi; Boccaletti, S

2017-11-22

In this paper, we propose a strategy for the control of mobile chaotic oscillators by adaptively rewiring connections between nearby agents with local information. In contrast to the dominant adaptive control schemes where coupling strength is adjusted continuously according to the states of the oscillators, our method does not request adaption of coupling strength. As the resulting interaction structure generated by this proposed strategy is strongly related to unidirectional chains, by investigating synchronization property of unidirectional chains, we reveal that there exists a certain coupling range in which the agents could be controlled regardless of the length of the chain. This feature enables the adaptive strategy to control the mobile oscillators regardless of their moving speed. Compared with existing adaptive control strategies for networked mobile agents, our proposed strategy is simpler for implementation where the resulting interaction networks are kept unweighted at all time.

Mapping and discrimination of networks in the complexity-entropy plane

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Kurths, Jürgen; Donner, Reik V.

2017-10-01

Complex networks are usually characterized in terms of their topological, spatial, or information-theoretic properties and combinations of the associated metrics are used to discriminate networks into different classes or categories. However, even with the present variety of characteristics at hand it still remains a subject of current research to appropriately quantify a network's complexity and correspondingly discriminate between different types of complex networks, like infrastructure or social networks, on such a basis. Here we explore the possibility to classify complex networks by means of a statistical complexity measure that has formerly been successfully applied to distinguish different types of chaotic and stochastic time series. It is composed of a network's averaged per-node entropic measure characterizing the network's information content and the associated Jenson-Shannon divergence as a measure of disequilibrium. We study 29 real-world networks and show that networks of the same category tend to cluster in distinct areas of the resulting complexity-entropy plane. We demonstrate that within our framework, connectome networks exhibit among the highest complexity while, e.g., transportation and infrastructure networks display significantly lower values. Furthermore, we demonstrate the utility of our framework by applying it to families of random scale-free and Watts-Strogatz model networks. We then show in a second application that the proposed framework is useful to objectively construct threshold-based networks, such as functional climate networks or recurrence networks, by choosing the threshold such that the statistical network complexity is maximized.

A few bad apples: a model of disease influenced agent behaviour in a heterogeneous contact environment.

PubMed

Enright, Jessica; Kao, Rowland R

2015-01-01

For diseases that infect humans or livestock, transmission dynamics are at least partially dependent on human activity and therefore human behaviour. However, the impact of human behaviour on disease transmission is relatively understudied, especially in the context of heterogeneous contact structures such as described by a social network. Here, we use a strategic game, coupled with a simple disease model, to investigate how strategic agent choices impact the spread of disease over a contact network. Using beliefs that are based on disease status and that build up over time, agents choose actions that stochastically determine disease spread on the network. An agent's disease status is therefore a function of both his own and his neighbours actions. The effect of disease on agents is modelled by a heterogeneous payoff structure. We find that the combination of network shape and distribution of payoffs has a non-trivial impact on disease prevalence, even if the mean payoff remains the same. An important scenario occurs when a small percentage (called noncooperators) have little incentive to avoid disease. For diseases that are easily acquired when taking a risk, then even when good behavior can lead to disease eradication, a small increase in the percentage of noncooperators (less than 5%) can yield a large (up to 25%) increase in prevalence.

Multi-Agent Modeling and Simulation Approach for Design and Analysis of MER Mission Operations

NASA Technical Reports Server (NTRS)

Seah, Chin; Sierhuis, Maarten; Clancey, William J.

2005-01-01

A space mission operations system is a complex network of human organizations, information and deep-space network systems and spacecraft hardware. As in other organizations, one of the problems in mission operations is managing the relationship of the mission information systems related to how people actually work (practices). Brahms, a multi-agent modeling and simulation tool, was used to model and simulate NASA's Mars Exploration Rover (MER) mission work practice. The objective was to investigate the value of work practice modeling for mission operations design. From spring 2002 until winter 2003, a Brahms modeler participated in mission systems design sessions and operations testing for the MER mission held at Jet Propulsion Laboratory (JPL). He observed how designers interacted with the Brahms tool. This paper discussed mission system designers' reactions to the simulation output during model validation and the presentation of generated work procedures. This project spurred JPL's interest in the Brahms model, but it was never included as part of the formal mission design process. We discuss why this occurred. Subsequently, we used the MER model to develop a future mission operations concept. Team members were reluctant to use the MER model, even though it appeared to be highly relevant to their effort. We describe some of the tool issues we encountered.

Modeling infection transmission in primate networks to predict centrality-based risk.

PubMed

Romano, Valéria; Duboscq, Julie; Sarabian, Cécile; Thomas, Elodie; Sueur, Cédric; MacIntosh, Andrew J J

2016-07-01

Social structure can theoretically regulate disease risk by mediating exposure to pathogens via social proximity and contact. Investigating the role of central individuals within a network may help predict infectious agent transmission as well as implement disease control strategies, but little is known about such dynamics in real primate networks. We combined social network analysis and a modeling approach to better understand transmission of a theoretical infectious agent in wild Japanese macaques, highly social animals which form extended but highly differentiated social networks. We collected focal data from adult females living on the islands of Koshima and Yakushima, Japan. Individual identities as well as grooming networks were included in a Markov graph-based simulation. In this model, the probability that an individual will transmit an infectious agent depends on the strength of its relationships with other group members. Similarly, its probability of being infected depends on its relationships with already infected group members. We correlated: (i) the percentage of subjects infected during a latency-constrained epidemic; (ii) the mean latency to complete transmission; (iii) the probability that an individual is infected first among all group members; and (iv) each individual's mean rank in the chain of transmission with different individual network centralities (eigenvector, strength, betweenness). Our results support the hypothesis that more central individuals transmit infections in a shorter amount of time and to more subjects but also become infected more quickly than less central individuals. However, we also observed that the spread of infectious agents on the Yakushima network did not always differ from expectations of spread on random networks. Generalizations about the importance of observed social networks in pathogen flow should thus be made with caution, since individual characteristics in some real world networks appear less relevant than they are in others in predicting disease spread. Am. J. Primatol. 78:767-779, 2016. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

An agent-based model of centralized institutions, social network technology, and revolution.

PubMed

Makowsky, Michael D; Rubin, Jared

2013-01-01

This paper sheds light on the general mechanisms underlying large-scale social and institutional change. We employ an agent-based model to test the impact of authority centralization and social network technology on preference falsification and institutional change. We find that preference falsification is increasing with centralization and decreasing with social network range. This leads to greater cascades of preference revelation and thus more institutional change in highly centralized societies and this effect is exacerbated at greater social network ranges. An empirical analysis confirms the connections that we find between institutional centralization, social radius, preference falsification, and institutional change.

Insensitive dependence of delay-induced oscillation death on complex networks

NASA Astrophysics Data System (ADS)

Zou, Wei; Zheng, Xing; Zhan, Meng

2011-06-01

Oscillation death (also called amplitude death), a phenomenon of coupling induced stabilization of an unstable equilibrium, is studied for an arbitrary symmetric complex network with delay-coupled oscillators, and the critical conditions for its linear stability are explicitly obtained. All cases including one oscillator, a pair of oscillators, regular oscillator networks, and complex oscillator networks with delay feedback coupling, can be treated in a unified form. For an arbitrary symmetric network, we find that the corresponding smallest eigenvalue of the Laplacian λN (0 >λN ≥ -1) completely determines the death island, and as λN is located within the insensitive parameter region for nearly all complex networks, the death island keeps nearly the largest and does not sensitively depend on the complex network structures. This insensitivity effect has been tested for many typical complex networks including Watts-Strogatz (WS) and Newman-Watts (NW) small world networks, general scale-free (SF) networks, Erdos-Renyi (ER) random networks, geographical networks, and networks with community structures and is expected to be helpful for our understanding of dynamics on complex networks.

HERA: A New Platform for Embedding Agents in Heterogeneous Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Alonso, Ricardo S.; de Paz, Juan F.; García, Óscar; Gil, Óscar; González, Angélica

Ambient Intelligence (AmI) based systems require the development of innovative solutions that integrate distributed intelligent systems with context-aware technologies. In this sense, Multi-Agent Systems (MAS) and Wireless Sensor Networks (WSN) are two key technologies for developing distributed systems based on AmI scenarios. This paper presents the new HERA (Hardware-Embedded Reactive Agents) platform, that allows using dynamic and self-adaptable heterogeneous WSNs on which agents are directly embedded on the wireless nodes This approach facilitates the inclusion of context-aware capabilities in AmI systems to gather data from their surrounding environments, achieving a higher level of ubiquitous and pervasive computing.

Stationary average consensus protocol for a class of heterogeneous high-order multi-agent systems with application for aircraft

NASA Astrophysics Data System (ADS)

Rezaei, Mohammad Hadi; Menhaj, Mohammad Bagher

2018-01-01

This paper investigates the stationary average consensus problem for a class of heterogeneous-order multi-agent systems. The goal is to bring the positions of agents to the average of their initial positions while letting the other states converge to zero. To this end, three different consensus protocols are proposed. First, based on the auxiliary variables information among the agents under switching directed networks and state-feedback control, a protocol is proposed whereby all the agents achieve stationary average consensus. In the second and third protocols, by resorting to only measurements of relative positions of neighbouring agents under fixed balanced directed networks, two control frameworks are presented with two strategies based on state-feedback and output-feedback control. Finally, simulation results are given to illustrate the effectiveness of the proposed protocols.

Theory of networked minority games based on strategy pattern dynamics.

PubMed

Lo, T S; Chan, H Y; Hui, P M; Johnson, N F

2004-11-01

We formulate a theory of agent-based models in which agents compete to be in a winning group. The agents may be part of a network or not, and the winning group may be a minority group or not. An important feature of the present formalism is its focus on the dynamical pattern of strategy rankings, and its careful treatment of the strategy ties which arise during the system's temporal evolution. We apply it to the minority game with connected populations. Expressions for the mean success rate among the agents and for the mean success rate for agents with k neighbors are derived. We also use the theory to estimate the value of connectivity p above which the binary-agent-resource system with high resource levels makes the transition into the high-connectivity state.

Metabolism and evolution: A comparative study of reconstructed genome-level metabolic networks

NASA Astrophysics Data System (ADS)

Almaas, Eivind

2008-03-01

The availability of high-quality annotations of sequenced genomes has made it possible to generate organism-specific comprehensive maps of cellular metabolism. Currently, more than twenty such metabolic reconstructions are publicly available, with the majority focused on bacteria. A typical metabolic reconstruction for a bacterium results in a complex network containing hundreds of metabolites (nodes) and reactions (links), while some even contain more than a thousand. The constrain-based optimization approach of flux-balance analysis (FBA) is used to investigate the functional characteristics of such large-scale metabolic networks, making it possible to estimate an organism's growth behavior in a wide variety of nutrient environments, as well as its robustness to gene loss. We have recently completed the genome-level metabolic reconstruction of Yersinia pseudotuberculosis, as well as the three Yersinia pestis biovars Antiqua, Mediaevalis, and Orientalis. While Y. pseudotuberculosis typically only causes fever and abdominal pain that can mimic appendicitis, the evolutionary closely related Y. pestis strains are the aetiological agents of the bubonic plague. In this presentation, I will discuss our results and conclusions from a comparative study on the evolution of metabolic function in the four Yersiniae networks using FBA and related techniques, and I will give particular focus to the interplay between metabolic network topology and evolutionary flexibility.

CytoViz: an artistic mapping of network measurements as living organisms in a VR application

NASA Astrophysics Data System (ADS)

López Silva, Brenda A.; Renambot, Luc

2007-02-01

CytoViz is an artistic, real-time information visualization driven by statistical information gathered during gigabit network transfers to the Scalable Adaptive Graphical Environment (SAGE) at various events. Data streams are mapped to cellular organisms defining their structure and behavior as autonomous agents. Network bandwidth drives the growth of each entity and the latency defines its physics-based independent movements. The collection of entity is bound within the 3D representation of the local venue. This visual and animated metaphor allows the public to experience the complexity of high-speed network streams that are used in the scientific community. Moreover, CytoViz displays the presence of discoverable Bluetooth devices carried by nearby persons. The concept is to generate an event-specific, real-time visualization that creates informational 3D patterns based on actual local presence. The observed Bluetooth traffic is put in opposition of the wide-area networking traffic by overlaying 2D animations on top of the 3D world. Each device is mapped to an animation fading over time while displaying the name of the detected device and its unique physical address. CytoViz was publicly presented at two major international conferences in 2005 (iGrid2005 in San Diego, CA and SC05 in Seattle, WA).

Elliptic Curve Cryptography with Security System in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Huang, Xu; Sharma, Dharmendra

2010-10-01

The rapid progress of wireless communications and embedded micro-electro-system technologies has made wireless sensor networks (WSN) very popular and even become part of our daily life. WSNs design are generally application driven, namely a particular application's requirements will determine how the network behaves. However, the natures of WSN have attracted increasing attention in recent years due to its linear scalability, a small software footprint, low hardware implementation cost, low bandwidth requirement, and high device performance. It is noted that today's software applications are mainly characterized by their component-based structures which are usually heterogeneous and distributed, including the WSNs. But WSNs typically need to configure themselves automatically and support as hoc routing. Agent technology provides a method for handling increasing software complexity and supporting rapid and accurate decision making. This paper based on our previous works [1, 2], three contributions have made, namely (a) fuzzy controller for dynamic slide window size to improve the performance of running ECC (b) first presented a hidden generation point for protection from man-in-the middle attack and (c) we first investigates multi-agent applying for key exchange together. Security systems have been drawing great attentions as cryptographic algorithms have gained popularity due to the natures that make them suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. Elliptic curve cryptography (ECC) is one of high potential candidates for WSNs, which requires less computational power, communication bandwidth, and memory in comparison with other cryptosystem. For saving pre-computing storages recently there is a trend for the sensor networks that the sensor group leaders rather than sensors communicate to the end database, which highlighted the needs to prevent from the man-in-the middle attack. A designed a hidden generator point that offer a good protection from the man-in-the middle (MinM) attack which becomes one of major worries for the sensor's networks with multiagent system is also discussed.

Collective learning for the emergence of social norms in networked multiagent systems.

PubMed

Yu, Chao; Zhang, Minjie; Ren, Fenghui

2014-12-01

Social norms such as social rules and conventions play a pivotal role in sustaining system order by regulating and controlling individual behaviors toward a global consensus in large-scale distributed systems. Systematic studies of efficient mechanisms that can facilitate the emergence of social norms enable us to build and design robust distributed systems, such as electronic institutions and norm-governed sensor networks. This paper studies the emergence of social norms via learning from repeated local interactions in networked multiagent systems. A collective learning framework, which imitates the opinion aggregation process in human decision making, is proposed to study the impact of agent local collective behaviors on the emergence of social norms in a number of different situations. In the framework, each agent interacts repeatedly with all of its neighbors. At each step, an agent first takes a best-response action toward each of its neighbors and then combines all of these actions into a final action using ensemble learning methods. Extensive experiments are carried out to evaluate the framework with respect to different network topologies, learning strategies, numbers of actions, influences of nonlearning agents, and so on. Experimental results reveal some significant insights into the manipulation and control of norm emergence in networked multiagent systems achieved through local collective behaviors.

Using an agent-based model to evaluate the effect of producer specialization on the epidemiological resilience of livestock production networks

PubMed Central

2018-01-01

An agent-based computer model that builds representative regional U.S. hog production networks was developed and employed to assess the potential impact of the ongoing trend towards increased producer specialization upon network-level resilience to catastrophic disease outbreaks. Empirical analyses suggest that the spatial distribution and connectivity patterns of contact networks often predict epidemic spreading dynamics. Our model heuristically generates realistic systems composed of hog producer, feed mill, and slaughter plant agents. Network edges are added during each run as agents exchange livestock and feed. The heuristics governing agents’ contact patterns account for factors including their industry roles, physical proximities, and the age of their livestock. In each run, an infection is introduced, and may spread according to probabilities associated with the various modes of contact. For each of three treatments—defined by one-phase, two-phase, and three-phase production systems—a parameter variation experiment examines the impact of the spatial density of producer agents in the system upon the length and size of disease outbreaks. Resulting data show phase transitions whereby, above some density threshold, systemic outbreaks become possible, echoing findings from percolation theory. Data analysis reveals that multi-phase production systems are vulnerable to catastrophic outbreaks at lower spatial densities, have more abrupt percolation transitions, and are characterized by less-predictable outbreak scales and durations. Key differences in network-level metrics shed light on these results, suggesting that the absence of potentially-bridging producer–producer edges may be largely responsible for the superior disease resilience of single-phase “farrow to finish” production systems. PMID:29522574

Reducing racial disparities in obesity: simulating the effects of improved education and social network influence on diet behavior.

PubMed

Orr, Mark G; Galea, Sandro; Riddle, Matt; Kaplan, George A

2014-08-01

Understanding how to mitigate the present black-white obesity disparity in the United States is a complex issue, stemming from a multitude of intertwined causes. An appropriate but underused approach to guiding policy approaches to this problem is to account for this complexity using simulation modeling. We explored the efficacy of a policy that improved the quality of neighborhood schools in reducing racial disparities in obesity-related behavior and the dependence of this effect on social network influence and norms. We used an empirically grounded agent-based model to generate simulation experiments. We used a 2 × 2 × 2 factorial design that represented the presence or absence of improved neighborhood school quality, the presence or absence of social influence, and the type of social norm (healthy or unhealthy). Analyses focused on time trends in sociodemographic variables and diet quality. First, the quality of schools and social network influence had independent and interactive effects on diet behavior. Second, the black-white disparity in diet behavior was considerably reduced under some conditions, but never completely eliminated. Third, the degree to which the disparity in diet behavior was reduced was a function of the type of social norm that was in place; the reduction was the smallest when the type of social norm was healthy. Improving school quality can reduce, but not eliminate racial disparities in obesity-related behavior, and the degree to which this is true depends partly on social network effects. Copyright © 2014 Elsevier Inc. All rights reserved.

Intentional cargo disruption by nefarious means: Examining threats, systemic vulnerabilities and securitisation measures in complex global supply chains.

PubMed

McGreevy, Conor; Harrop, Wayne

2015-01-01

Global trade and commerce requires products to be securely contained and transferred in a timely way across great distances and between national boundaries. Throughout the process, cargo and containers are stored, handled and checked by a range of authorities and authorised agents. Intermodal transportation involves the use of container ships, planes, railway systems, land bridges, road networks and barges. This paper examines the the nefarious nature of intentional disruption and nefarious risks associated with the movement of cargo and container freight. The paper explores main threats, vulnerabilities and security measures relevant to significant intermodal transit risk issues such as theft, piracy, terrorism, contamination, counterfeiting and product tampering. Three risk and vulnerability models are examined and basic standards and regulations that are relevant to safe and secure transit of container goods across international supply networks are outlined.

Use of Artificial Neural Networks to Examine Parameters Affecting the Immobilization of Streptokinase in Chitosan

PubMed Central

Modaresi, Seyed Mohamad Sadegh; Faramarzi, Mohammad Ali; Soltani, Arash; Baharifar, Hadi; Amani, Amir

2014-01-01

Streptokinase is a potent fibrinolytic agent which is widely used in treatment of deep vein thrombosis (DVT), pulmonary embolism (PE) and acute myocardial infarction (MI). Major limitation of this enzyme is its short biological half-life in the blood stream. Our previous report showed that complexing streptokinase with chitosan could be a solution to overcome this limitation. The aim of this research was to establish an artificial neural networks (ANNs) model for identifying main factors influencing the loading efficiency of streptokinase, as an essential parameter determining efficacy of the enzyme. Three variables, namely, chitosan concentration, buffer pH and enzyme concentration were considered as input values and the loading efficiency was used as output. Subsequently, the experimental data were modeled and the model was validated against a set of unseen data. The developed model indicated chitosan concentration as probably the most important factor, having reverse effect on the loading efficiency. PMID:25587327

Aging in complex interdependency networks.

PubMed

Vural, Dervis C; Morrison, Greg; Mahadevan, L

2014-02-01

Although species longevity is subject to a diverse range of evolutionary forces, the mortality curves of a wide variety of organisms are rather similar. Here we argue that qualitative and quantitative features of aging can be reproduced by a simple model based on the interdependence of fault-prone agents on one other. In addition to fitting our theory to the empiric mortality curves of six very different organisms, we establish the dependence of lifetime and aging rate on initial conditions, damage and repair rate, and system size. We compare the size distributions of disease and death and see that they have qualitatively different properties. We show that aging patterns are independent of the details of interdependence network structure, which suggests that aging is a many-body effect, and that the qualitative and quantitative features of aging are not sensitively dependent on the details of dependency structure or its formation.

Microfluidics-based integrated airborne pathogen detection systems

NASA Astrophysics Data System (ADS)

Northrup, M. Allen; Alleman-Sposito, Jennifer; Austin, Todd; Devitt, Amy; Fong, Donna; Lin, Phil; Nakao, Brian; Pourahmadi, Farzad; Vinas, Mary; Yuan, Bob

2006-09-01

Microfluidic Systems is focused on building microfluidic platforms that interface front-end mesofluidics to handle real world sample volumes for optimal sensitivity coupled to microfluidic circuitry to process small liquid volumes for complex reagent metering, mixing, and biochemical analysis, particularly for pathogens. MFSI is the prime contractor on two programs for the US Department of Homeland Security: BAND (Bioagent Autonomous Networked Detector) and IBADS (Instantaneous Bio-Aerosol Detection System). The goal of BAND is to develop an autonomous system for monitoring the air for known biological agents. This consists of air collection, sample lysis, sample purification, detection of DNA, RNA, and toxins, and a networked interface to report the results. For IBADS, MFSI is developing the confirmatory device which must verify the presence of a pathogen with 5 minutes of an air collector/trigger sounding an alarm. Instrument designs and biological assay results from both BAND and IBADS will be presented.

The power and promise of "rewiring" the mitogen-activated protein kinase network in prostate cancer therapeutics.

PubMed

Papatsoris, Athanasios G; Karamouzis, Michalis V; Papavassiliou, Athanasios G

2007-03-01

Prostate cancer is the most frequently diagnosed cancer among men and the second leading cause of male cancer deaths. Initially, tumor growth is androgen dependent and thus responsive to pharmacologic androgen deprivation, but there is a high rate of treatment failure because the disease evolves in an androgen-independent state. Growing evidence suggests that the Ras/mitogen-activated protein kinase (MAPK) signaling cascade represents a pivotal molecular circuitry participating directly or indirectly in prostate cancer evolution. The crucial role of the protein elements comprising this complex signal transduction network makes them potential targets for pharmacologic interference. Here, we will delineate the current knowledge regarding the involvement of the Ras/MAPK pathway in prostate carcinogenesis, spotlight ongoing research concerning the development of novel targeted agents such as the Ras/MAPK inhibitors in prostate cancer, and discuss the future perspectives of their therapeutic efficacy.

Self-* properties through gossiping.

PubMed

Babaoglu, Ozalp; Jelasity, Márk

2008-10-28

As computer systems have become more complex, numerous competing approaches have been proposed for these systems to self-configure, self-manage, self-repair, etc. such that human intervention in their operation can be minimized. In ubiquitous systems, this has always been a central issue as well. In this paper, we overview techniques to implement self-* properties in large-scale, decentralized networks through bio-inspired techniques in general, and gossip-based algorithms in particular. We believe that gossip-based algorithms could be an important inspiration for solving problems in ubiquitous computing as well. As an example, we outline a novel approach to arrange large numbers of mobile agents (e.g. vehicles, rescue teams carrying mobile devices) into different formations in a totally decentralized manner. The approach is inspired by the biological mechanism of cell sorting via differential adhesion, as well as by our earlier work in self-organizing peer-to-peer overlay networks.

Sampling from complex networks using distributed learning automata

NASA Astrophysics Data System (ADS)

Rezvanian, Alireza; Rahmati, Mohammad; Meybodi, Mohammad Reza

2014-02-01

A complex network provides a framework for modeling many real-world phenomena in the form of a network. In general, a complex network is considered as a graph of real world phenomena such as biological networks, ecological networks, technological networks, information networks and particularly social networks. Recently, major studies are reported for the characterization of social networks due to a growing trend in analysis of online social networks as dynamic complex large-scale graphs. Due to the large scale and limited access of real networks, the network model is characterized using an appropriate part of a network by sampling approaches. In this paper, a new sampling algorithm based on distributed learning automata has been proposed for sampling from complex networks. In the proposed algorithm, a set of distributed learning automata cooperate with each other in order to take appropriate samples from the given network. To investigate the performance of the proposed algorithm, several simulation experiments are conducted on well-known complex networks. Experimental results are compared with several sampling methods in terms of different measures. The experimental results demonstrate the superiority of the proposed algorithm over the others.

Self-Learning Intelligent Agents for Dynamic Traffic Routing on Transportation Networks

NASA Astrophysics Data System (ADS)

Sadek, Add; Basha, Nagi

Intelligent Transportation Systems (ITS) are designed to take advantage of recent advances in communications, electronics, and Information Technology in improving the efficiency and safety of transportation systems. Among the several ITS applications is the notion of Dynamic Traffic Routing (DTR), which involves generating "optimal" routing recommendations to drivers with the aim of maximizing network utilizing. In this paper, we demonstrate the feasibility of using a self-learning intelligent agent to solve the DTR problem to achieve traffic user equilibrium in a transportation network. The core idea is to deploy an agent to a simulation model of a highway. The agent then learns by itself by interacting with the simulation model. Once the agent reaches a satisfactory level of performance, it can then be deployed to the real-world, where it would continue to learn how to refine its control policies over time. To test this concept in this paper, the Cell Transmission Model (CTM) developed by Carlos Daganzo of the University of California at Berkeley is used to simulate a simple highway with two main alternative routes. With the model developed, a Reinforcement Learning Agent (RLA) is developed to learn how to best dynamically route traffic, so as to maximize the utilization of existing capacity. Preliminary results obtained from our experiments are promising. RL, being an adaptive online learning technique, appears to have a great potential for controlling a stochastic dynamic systems such as a transportation system. Furthermore, the approach is highly scalable and applicable to a variety of networks and roadways.

Controlling herding in minority game systems

NASA Astrophysics Data System (ADS)

Zhang, Ji-Qiang; Huang, Zi-Gang; Wu, Zhi-Xi; Su, Riqi; Lai, Ying-Cheng

2016-02-01

Resource allocation takes place in various types of real-world complex systems such as urban traffic, social services institutions, economical and ecosystems. Mathematically, the dynamical process of resource allocation can be modeled as minority games. Spontaneous evolution of the resource allocation dynamics, however, often leads to a harmful herding behavior accompanied by strong fluctuations in which a large majority of agents crowd temporarily for a few resources, leaving many others unused. Developing effective control methods to suppress and eliminate herding is an important but open problem. Here we develop a pinning control method, that the fluctuations of the system consist of intrinsic and systematic components allows us to design a control scheme with separated control variables. A striking finding is the universal existence of an optimal pinning fraction to minimize the variance of the system, regardless of the pinning patterns and the network topology. We carry out a generally applicable theory to explain the emergence of optimal pinning and to predict the dependence of the optimal pinning fraction on the network topology. Our work represents a general framework to deal with the broader problem of controlling collective dynamics in complex systems with potential applications in social, economical and political systems.

Hybrid function projective synchronization in complex dynamical networks

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

Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng

2014-02-15

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

Dynamics of bloggers’ communities: Bipartite networks from empirical data and agent-based modeling

NASA Astrophysics Data System (ADS)

Mitrović, Marija; Tadić, Bosiljka

2012-11-01

We present an analysis of the empirical data and the agent-based modeling of the emotional behavior of users on the Web portals where the user interaction is mediated by posted comments, like Blogs and Diggs. We consider the dataset of discussion-driven popular Diggs, in which all comments are screened by machine-learning emotion detection in the text, to determine positive and negative valence (attractiveness and aversiveness) of each comment. By mapping the data onto a suitable bipartite network, we perform an analysis of the network topology and the related time-series of the emotional comments. The agent-based model is then introduced to simulate the dynamics and to capture the emergence of the emotional behaviors and communities. The agents are linked to posts on a bipartite network, whose structure evolves through their actions on the posts. The emotional states (arousal and valence) of each agent fluctuate in time, subject to the current contents of the posts to which the agent is exposed. By an agent’s action on a post its current emotions are transferred to the post. The model rules and the key parameters are inferred from the considered empirical data to ensure their realistic values and mutual consistency. The model assumes that the emotional arousal over posts drives the agent’s action. The simulations are preformed for the case of constant flux of agents and the results are analyzed in full analogy with the empirical data. The main conclusions are that the emotion-driven dynamics leads to long-range temporal correlations and emergent networks with community structure, that are comparable with the ones in the empirical system of popular posts. In view of pure emotion-driven agents actions, this type of comparisons provide a quantitative measure for the role of emotions in the dynamics on real blogs. Furthermore, the model reveals the underlying mechanisms which relate the post popularity with the emotion dynamics and the prevalence of negative emotions (critique). We also demonstrate how the community structure is tuned by varying a relevant parameter in the model. All data used in these works are fully anonymized.

Developments and advances concerning the hyperpolarisation technique SABRE.

PubMed

Mewis, Ryan E

2015-10-01

To overcome the inherent sensitivity issue in NMR and MRI, hyperpolarisation techniques are used. Signal Amplification By Reversible Exchange (SABRE) is a hyperpolarisation technique that utilises parahydrogen, a molecule that possesses a nuclear singlet state, as the source of polarisation. A metal complex is required to break the singlet order of parahydrogen and, by doing so, facilitates polarisation transfer to analyte molecules ligated to the same complex through the J-coupled network that exists. The increased signal intensities that the analyte molecules possess as a result of this process have led to investigations whereby their potential as MRI contrast agents has been probed and to understand the fundamental processes underpinning the polarisation transfer mechanism. As well as discussing literature relevant to both of these areas, the chemical structure of the complex, the physical constraints of the polarisation transfer process and the successes of implementing SABRE at low and high magnetic fields are discussed. Copyright © 2015 John Wiley & Sons, Ltd.

Oxidative phosphorylation-dependent regulation of cancer cell apoptosis in response to anticancer agents.

PubMed

Yadav, N; Kumar, S; Marlowe, T; Chaudhary, A K; Kumar, R; Wang, J; O'Malley, J; Boland, P M; Jayanthi, S; Kumar, T K S; Yadava, N; Chandra, D

2015-11-05

Cancer cells tend to develop resistance to various types of anticancer agents, whether they adopt similar or distinct mechanisms to evade cell death in response to a broad spectrum of cancer therapeutics is not fully defined. Current study concludes that DNA-damaging agents (etoposide and doxorubicin), ER stressor (thapsigargin), and histone deacetylase inhibitor (apicidin) target oxidative phosphorylation (OXPHOS) for apoptosis induction, whereas other anticancer agents including staurosporine, taxol, and sorafenib induce apoptosis in an OXPHOS-independent manner. DNA-damaging agents promoted mitochondrial biogenesis accompanied by increased accumulation of cellular and mitochondrial ROS, mitochondrial protein-folding machinery, and mitochondrial unfolded protein response. Induction of mitochondrial biogenesis occurred in a caspase activation-independent mechanism but was reduced by autophagy inhibition and p53-deficiency. Abrogation of complex-I blocked DNA-damage-induced caspase activation and apoptosis, whereas inhibition of complex-II or a combined deficiency of OXPHOS complexes I, III, IV, and V due to impaired mitochondrial protein synthesis did not modulate caspase activity. Mechanistic analysis revealed that inhibition of caspase activation in response to anticancer agents associates with decreased release of mitochondrial cytochrome c in complex-I-deficient cells compared with wild type (WT) cells. Gross OXPHOS deficiencies promoted increased release of apoptosis-inducing factor from mitochondria compared with WT or complex-I-deficient cells, suggesting that cells harboring defective OXPHOS trigger caspase-dependent as well as caspase-independent apoptosis in response to anticancer agents. Interestingly, DNA-damaging agent doxorubicin showed strong binding to mitochondria, which was disrupted by complex-I-deficiency but not by complex-II-deficiency. Thapsigargin-induced caspase activation was reduced upon abrogation of complex-I or gross OXPHOS deficiency whereas a reverse trend was observed with apicidin. Together, these finding provide a new strategy for differential mitochondrial targeting in cancer therapy.

Bifunctional chelating agent for the design and development of site specific radiopharmaceuticals and biomolecule conjugation strategy

DOEpatents

Katti, Kattesh V.; Prabhu, Kandikere R.; Gali, Hariprasad; Pillarsetty, Nagavara Kishore; Volkert, Wynn A.

2003-10-21

There is provided a method of labeling a biomolecule with a transition metal or radiometal in a site specific manner to produce a diagnostic or therapeutic pharmaceutical compound by synthesizing a P.sub.2 N.sub.2 -bifunctional chelating agent intermediate, complexing the intermediate with a radio metal or a transition metal, and covalently linking the resulting metal-complexed bifunctional chelating agent with a biomolecule in a site specific manner. Also provided is a method of synthesizing the --PR.sub.2 containing biomolecules by synthesizing a P.sub.2 N.sub.2 -bifunctional chelating agent intermediate, complexing the intermediate with a radiometal or a transition metal, and covalently linking the resulting radio metal-complexed bifunctional chelating agent with a biomolecule in a site specific manner. There is provided a therapeutic or diagnostic agent comprising a --PR.sub.2 containing biomolecule.

A Financial Market Model Incorporating Herd Behaviour.

PubMed

Wray, Christopher M; Bishop, Steven R

2016-01-01

Herd behaviour in financial markets is a recurring phenomenon that exacerbates asset price volatility, and is considered a possible contributor to market fragility. While numerous studies investigate herd behaviour in financial markets, it is often considered without reference to the pricing of financial instruments or other market dynamics. Here, a trader interaction model based upon informational cascades in the presence of information thresholds is used to construct a new model of asset price returns that allows for both quiescent and herd-like regimes. Agent interaction is modelled using a stochastic pulse-coupled network, parametrised by information thresholds and a network coupling probability. Agents may possess either one or two information thresholds that, in each case, determine the number of distinct states an agent may occupy before trading takes place. In the case where agents possess two thresholds (labelled as the finite state-space model, corresponding to agents' accumulating information over a bounded state-space), and where coupling strength is maximal, an asymptotic expression for the cascade-size probability is derived and shown to follow a power law when a critical value of network coupling probability is attained. For a range of model parameters, a mixture of negative binomial distributions is used to approximate the cascade-size distribution. This approximation is subsequently used to express the volatility of model price returns in terms of the model parameter which controls the network coupling probability. In the case where agents possess a single pulse-coupling threshold (labelled as the semi-infinite state-space model corresponding to agents' accumulating information over an unbounded state-space), numerical evidence is presented that demonstrates volatility clustering and long-memory patterns in the volatility of asset returns. Finally, output from the model is compared to both the distribution of historical stock returns and the market price of an equity index option.

An Agent-Based Model of Centralized Institutions, Social Network Technology, and Revolution

PubMed Central

Makowsky, Michael D.; Rubin, Jared

2013-01-01

This paper sheds light on the general mechanisms underlying large-scale social and institutional change. We employ an agent-based model to test the impact of authority centralization and social network technology on preference falsification and institutional change. We find that preference falsification is increasing with centralization and decreasing with social network range. This leads to greater cascades of preference revelation and thus more institutional change in highly centralized societies and this effect is exacerbated at greater social network ranges. An empirical analysis confirms the connections that we find between institutional centralization, social radius, preference falsification, and institutional change. PMID:24278280

Router Agent Technology for Policy-Based Network Management

NASA Technical Reports Server (NTRS)

Chow, Edward T.; Sudhir, Gurusham; Chang, Hsin-Ping; James, Mark; Liu, Yih-Chiao J.; Chiang, Winston

2011-01-01

This innovation can be run as a standalone network application on any computer in a networked environment. This design can be configured to control one or more routers (one instance per router), and can also be configured to listen to a policy server over the network to receive new policies based on the policy- based network management technology. The Router Agent Technology transforms the received policies into suitable Access Control List syntax for the routers it is configured to control. It commits the newly generated access control lists to the routers and provides feedback regarding any errors that were faced. The innovation also automatically generates a time-stamped log file regarding all updates to the router it is configured to control. This technology, once installed on a local network computer and started, is autonomous because it has the capability to keep listening to new policies from the policy server, transforming those policies to router-compliant access lists, and committing those access lists to a specified interface on the specified router on the network with any error feedback regarding commitment process. The stand-alone application is named RouterAgent and is currently realized as a fully functional (version 1) implementation for the Windows operating system and for CISCO routers.

Complex quantum network geometries: Evolution and phase transitions

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

Complex quantum network geometries: Evolution and phase transitions.

PubMed

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

A new class of finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2014-02-01

This paper is devoted to investigating the finite-time consensus problem for a multi-agent system in networks with undirected topology. A new class of global continuous time-invariant consensus protocols is constructed for each single-integrator agent dynamics with the aid of Lyapunov functions. In particular, it is shown that the settling time of the proposed new class of finite-time consensus protocols is upper bounded for arbitrary initial conditions. This makes it possible for network consensus problems that the convergence time is designed and estimated offline for a given undirected information flow and a group volume of agents. Finally, a numerical simulation example is presented as a proof of concept.

Distributed robust finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2016-04-01

This paper investigates the robust finite-time consensus problem of multi-agent systems in networks with undirected topology. Global nonlinear consensus protocols augmented with a variable structure are constructed with the aid of Lyapunov functions for each single-integrator agent dynamics in the presence of external disturbances. In particular, it is shown that the finite settling time of the proposed general framework for robust consensus design is upper bounded for any initial condition. This makes it possible for network consensus problems to design and estimate the convergence time offline for a multi-agent team with a given undirected information flow. Finally, simulation results are presented to demonstrate the performance and effectiveness of our finite-time protocols.

Examining diffusion to understand the how of SASA!, a violence against women and HIV prevention intervention in Uganda.

PubMed

Starmann, Elizabeth; Heise, Lori; Kyegombe, Nambusi; Devries, Karen; Abramsky, Tanya; Michau, Lori; Musuya, Tina; Watts, Charlotte; Collumbien, Martine

2018-05-11

A growing number of complex public health interventions combine mass media with community-based "change agents" and/or mobilisation efforts acting at multiple levels. While impact evaluations are important, there is a paucity of research into the more nuanced roles intervention and social network factors may play in achieving intervention outcomes, making it difficult to understand how different aspects of the intervention worked (or did not). This study applied aspects of diffusion of innovations theory to explore how SASA!, a community mobilisation approach for preventing HIV and violence against women, diffused within intervention communities and the factors that influenced the uptake of new ideas and behaviours around intimate partner relationships and violence. This paper is based on a qualitative study of couples living in SASA communities and secondary analysis of endline quantitative data collected as part of a cluster randomised control trial designed to evaluate the impact of the SASA! The primary trial was conducted in eight communities in Kampala, Uganda between 2007 and 2012. The secondary analysis of follow up survey data used multivariate logistic regression to examine associations between intervention exposure and interpersonal communication, and relationship change (n = 928). The qualitative study used in-depth interviews (n = 20) and framework analysis methods to explore the intervention attributes that facilitated engagement with the intervention and uptake of new ideas and behaviours in intimate relationships. We found communication materials and mid media channels generated awareness and knowledge, while the concurrent influence from interpersonal communication with community-based change agents and social network members more frequently facilitated changes in behaviour. The results indicate combining community mobilisation components, programme content that reflects peoples' lives and direct support through local change agents can facilitate diffusion and powerful collective change processes in communities. This study makes clear the value of applying diffusion of innovations theory to illuminate how complex public health intervention evaluations effect change. It also contributes to our knowledge of partner violence prevention in a low-income, urban East African context. ClinicalTrials.gov # NCT00790959 . Registered 13th November 2008.

From Neural and Social Cooperation to the Global Emergence of Cognition

PubMed Central

Grigolini, Paolo; Piccinini, Nicola; Svenkeson, Adam; Pramukkul, Pensri; Lambert, David; West, Bruce J.

2015-01-01

The recent article (Turalska et al., 2012) discusses the emergence of intelligence via criticality as a consequence of locality breakdown. Herein, we use criticality for the foundation of a novel generation of game theory making the local interaction between players yield long-range effects. We first establish that criticality is not confined to the Ising-like structure of the sociological model of (Turalska et al., 2012), called the decision making model (DMM), through the study of the emergence of altruism using the altruism-selfishness model (ASM). Both models generate criticality, one by imitation of opinion (DMM) and the other by imitation of behavior (ASM). The dynamics of a sociological network 𝒮 influences the behavioral network ℱ through two game theoretic paradigms: (i) the value of altruism; (ii) the benefit of rapid consensus. In (i), the network 𝒮 debates the moral issue of altruism by means of the DMM, while at the level ℱ the individuals operate according to the ASM. The individuals of the level 𝒮, through a weak influence on the individuals of the level ℱ, exert a societal control on ℱ, fitting the principle of complexity management and complexity matching. In (ii), the benefit to society is the rapid attainment of consensus in the 𝒮 level. The agents of the level ℱ operate according to the prisoner’s dilemma prescription, with the defectors acting as DMM contrarians at the level 𝒮. The contrarians, acting as the inhibitory links of neural networks, exert on society the same beneficial effect of maintaining the criticality-induced resilience that they generate in neural networks. The conflict between personal and social benefit makes the networks evolve toward criticality. Finally, we show that the theory of this article is compatible with recent discoveries in the burgeoning field of social neuroscience. PMID:26137455

Thinking on building the network cardiovasology of Chinese medicine.

PubMed

Yu, Gui; Wang, Jie

2012-11-01

With advances in complex network theory, the thinking and methods regarding complex systems have changed revolutionarily. Network biology and network pharmacology were built by applying network-based approaches in biomedical research. The cardiovascular system may be regarded as a complex network, and cardiovascular diseases may be taken as the damage of structure and function of the cardiovascular network. Although Chinese medicine (CM) is effective in treating cardiovascular diseases, its mechanisms are still unclear. With the guidance of complex network theory, network biology and network pharmacology, network-based approaches could be used in the study of CM in preventing and treating cardiovascular diseases. A new discipline-network cardiovasology of CM was, therefore, developed. In this paper, complex network theory, network biology and network pharmacology were introduced and the connotation of "disease-syndrome-formula-herb" was illustrated from the network angle. Network biology could be used to analyze cardiovascular diseases and syndromes and network pharmacology could be used to analyze CM formulas and herbs. The "network-network"-based approaches could provide a new view for elucidating the mechanisms of CM treatment.

An information dimension of weighted complex networks

NASA Astrophysics Data System (ADS)

Wen, Tao; Jiang, Wen

2018-07-01

The fractal and self-similarity are important properties in complex networks. Information dimension is a useful dimension for complex networks to reveal these properties. In this paper, an information dimension is proposed for weighted complex networks. Based on the box-covering algorithm for weighted complex networks (BCANw), the proposed method can deal with the weighted complex networks which appear frequently in the real-world, and it can get the influence of the number of nodes in each box on the information dimension. To show the wide scope of information dimension, some applications are illustrated, indicating that the proposed method is effective and feasible.

Detection of protein complex from protein-protein interaction network using Markov clustering

NASA Astrophysics Data System (ADS)

Ochieng, P. J.; Kusuma, W. A.; Haryanto, T.

2017-05-01

Detection of complexes, or groups of functionally related proteins, is an important challenge while analysing biological networks. However, existing algorithms to identify protein complexes are insufficient when applied to dense networks of experimentally derived interaction data. Therefore, we introduced a graph clustering method based on Markov clustering algorithm to identify protein complex within highly interconnected protein-protein interaction networks. Protein-protein interaction network was first constructed to develop geometrical network, the network was then partitioned using Markov clustering to detect protein complexes. The interest of the proposed method was illustrated by its application to Human Proteins associated to type II diabetes mellitus. Flow simulation of MCL algorithm was initially performed and topological properties of the resultant network were analysed for detection of the protein complex. The results indicated the proposed method successfully detect an overall of 34 complexes with 11 complexes consisting of overlapping modules and 20 non-overlapping modules. The major complex consisted of 102 proteins and 521 interactions with cluster modularity and density of 0.745 and 0.101 respectively. The comparison analysis revealed MCL out perform AP, MCODE and SCPS algorithms with high clustering coefficient (0.751) network density and modularity index (0.630). This demonstrated MCL was the most reliable and efficient graph clustering algorithm for detection of protein complexes from PPI networks.

Cultural Geography Model Validation

DTIC Science & Technology

2010-03-01

the Cultural Geography Model (CGM), a government owned, open source multi - agent system utilizing Bayesian networks, queuing systems, the Theory of...referent determined either from theory or SME opinion. 4. CGM Overview The CGM is a government-owned, open source, data driven multi - agent social...HSCB, validation, social network analysis ABSTRACT: In the current warfighting environment , the military needs robust modeling and simulation (M&S

Pervasive surveillance-agent system based on wireless sensor networks: design and deployment

NASA Astrophysics Data System (ADS)

Martínez, José F.; Bravo, Sury; García, Ana B.; Corredor, Iván; Familiar, Miguel S.; López, Lourdes; Hernández, Vicente; Da Silva, Antonio

2010-12-01

Nowadays, proliferation of embedded systems is enhancing the possibilities of gathering information by using wireless sensor networks (WSNs). Flexibility and ease of installation make these kinds of pervasive networks suitable for security and surveillance environments. Moreover, the risk for humans to be exposed to these functions is minimized when using these networks. In this paper, a virtual perimeter surveillance agent, which has been designed to detect any person crossing an invisible barrier around a marked perimeter and send an alarm notification to the security staff, is presented. This agent works in a state of 'low power consumption' until there is a crossing on the perimeter. In our approach, the 'intelligence' of the agent has been distributed by using mobile nodes in order to discern the cause of the event of presence. This feature contributes to saving both processing resources and power consumption since the required code that detects presence is the only system installed. The research work described in this paper illustrates our experience in the development of a surveillance system using WNSs for a practical application as well as its evaluation in real-world deployments. This mechanism plays an important role in providing confidence in ensuring safety to our environment.

Modelling trading networks and the role of trust

NASA Astrophysics Data System (ADS)

Barrio, Rafael A.; Govezensky, Tzipe; Ruiz-Gutiérrez, Élfego; Kaski, Kimmo K.

2017-04-01

We present a simple dynamical model for describing trading interactions between agents in a social network by considering only two dynamical variables, namely money and goods or services, that are assumed conserved over the whole time span of the agents' trading transactions. A key feature of the model is that agent-to-agent transactions are governed by the price in units of money per goods, which is dynamically changing, and by a trust variable, which is related to the trading history of each agent. All agents are able to sell or buy, and the decision to do either has to do with the level of trust the buyer has in the seller, the price of the goods and the amount of money and goods at the disposal of the buyer. Here we show the results of extensive numerical calculations under various initial conditions in a random network of agents and compare the results with the available related data. In most cases the agreement between the model results and real data turns out to be fairly good, which allow us to draw some general conclusions as how different trading strategies could affect the distribution of wealth in different kinds of societies. Our calculations reveal the striking effects of trust in commercial relations, namely that trust makes trading links more robust and the wealth distribution more even as well as allows for the existence of a healthy middle class.

Consensus positive position feedback control for vibration attenuation of smart structures

NASA Astrophysics Data System (ADS)

Omidi, Ehsan; Nima Mahmoodi, S.

2015-04-01

This paper presents a new network-based approach for active vibration control in smart structures. In this approach, a network with known topology connects collocated actuator/sensor elements of the smart structure to one another. Each of these actuators/sensors, i.e., agent or node, is enhanced by a separate multi-mode positive position feedback (PPF) controller. The decentralized PPF controlled agents collaborate with each other in the designed network, under a certain consensus dynamics. The consensus constraint forces neighboring agents to cooperate with each other such that the disagreement between the time-domain actuation of the agents is driven to zero. The controller output of each agent is calculated using state-space variables; hence, optimal state estimators are designed first for the proposed observer-based consensus PPF control. The consensus controller is numerically investigated for a flexible smart structure, i.e., a thin aluminum beam that is clamped at its both ends. Results demonstrate that the consensus law successfully imposes synchronization between the independently controlled agents, as the disagreements between the decentralized PPF controller variables converge to zero in a short time. The new consensus PPF controller brings extra robustness to vibration suppression in smart structures, where malfunctions of an agent can be compensated for by referencing the neighboring agents’ performance. This is demonstrated in the results by comparing the new controller with former centralized PPF approach.

Autonomic and Coevolutionary Sensor Networking

NASA Astrophysics Data System (ADS)

Boonma, Pruet; Suzuki, Junichi

(WSNs) applications are often required to balance the tradeoffs among conflicting operational objectives (e.g., latency and power consumption) and operate at an optimal tradeoff. This chapter proposes and evaluates a architecture, called BiSNET/e, which allows WSN applications to overcome this issue. BiSNET/e is designed to support three major types of WSN applications: , and hybrid applications. Each application is implemented as a decentralized group of, which is analogous to a bee colony (application) consisting of bees (agents). Agents collect sensor data or detect an event (a significant change in sensor reading) on individual nodes, and carry sensor data to base stations. They perform these data collection and event detection functionalities by sensing their surrounding network conditions and adaptively invoking behaviors such as pheromone emission, reproduction, migration, swarming and death. Each agent has its own behavior policy, as a set of genes, which defines how to invoke its behaviors. BiSNET/e allows agents to evolve their behavior policies (genes) across generations and autonomously adapt their performance to given objectives. Simulation results demonstrate that, in all three types of applications, agents evolve to find optimal tradeoffs among conflicting objectives and adapt to dynamic network conditions such as traffic fluctuations and node failures/additions. Simulation results also illustrate that, in hybrid applications, data collection agents and event detection agents coevolve to augment their adaptability and performance.

[Fanconi anemia: cellular and molecular features].

PubMed

Macé, G; Briot, D; Guervilly, J-H; Rosselli, F

2007-02-01

Fanconi anemia (FA) is a recessive human cancer prone syndrome featuring bone marrow failure, developmental abnormalities and hypersensitivity to DNA crosslinking agents exposure. 11 among 12 FA gene have been isolated. The biochemical functions of the FANC proteins remain poorly understood. Anyhow, to cope with DNA crosslinks a cell needs a functional FANC pathway. Moreover, the FANC proteins appear to be involved in cell protection against oxidative damage and in the control of TNF-alpha activity. In this review, we describe the current understanding of the FANC pathway and we present how it may be integrated in the complex networks of proteins involved in maintaining the cellular homeostasis.

Spectral characterization, crystal structures and biological activities of iminodiacetate ternary complexes

NASA Astrophysics Data System (ADS)

Shahid, M.; Anjuli; Tasneem, Sana; Mantasha, I.; Ahamad, M. Naqi; Sama, Farasha; Fatma, Kehkeshan; Siddiqi, Zafar A.

2017-10-01

The ternary complexes with stoichiometry [M(imda)(bipy)]·6H2O (M = Cu) and [M(imda)(bipy)(H2O)]·4H2O (M = Ni, Co and Mn) where H2imda = iminodiacetic acid and bipy = 2,2‧-bipyridine, are prepared and characterized to exploit as novel antimicrobial agents and SOD mimics. The chemical structures were elucidated by IR, FAB-Mass, 1H, 13C NMR, EPR and spectral techniques. Single crystal X-ray and spectral studies of the complexes (1) and (2) have confirmed a square pyramidal geometry around Cu(II) ion while a saturated six coordinate (distorted octahedral) geometry around the Ni(II), Co(II) and Mn(II) ions due to the additional coordination from water. A supramolecular network is formed by extensive H-bonding in complex (1). The supramolecular assembly in complex (1) is additionally consolidated via the existence of unusual cyclic hexameric water clusters. The antimicrobial activities for the present complexes have been examined against Escherichia coli (K-12), Bacillus subtilis (MTC-121), Staphylococcus aureus (IOASA-22), Salmonella typhymurium (MTCC-98), Candida albicans, Aspergillus fumigatus and Penicillium marneffei. The superoxide dismutase (SOD) activity of the Cu(II) complex (1) is also assessed employing nitrobluetetrazolium (NBT) assay.

Multilayer quantum secret sharing based on GHZ state and generalized Bell basis measurement in multiparty agents

NASA Astrophysics Data System (ADS)

Wang, Xiao-Jun; An, Long-Xi; Yu, Xu-Tao; Zhang, Zai-Chen

2017-10-01

A multilayer quantum secret sharing protocol based on GHZ state is proposed. Alice has the secret carried by quantum state and wants to distribute this secret to multiple agent nodes in the network. In this protocol, the secret is transmitted and shared layer by layer from root Alice to layered agents. The number of agents in each layer is a geometric sequence with a specific common ratio. By sharing GHZ maximally entangled states and making generalized Bell basis measurement, one qubit state can be distributed to multiparty agents and the secret is shared. Only when all agents at the last layer cooperate together, the secret can be recovered. Compared with other protocols based on the entangled state, this protocol adopts layered construction so that secret can be distributed to more agents with fewer particles GHZ state. This quantum secret sharing protocol can be used in wireless network to ensure the security of information delivery.

Robustness and structure of complex networks

NASA Astrophysics Data System (ADS)

Shao, Shuai

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

Agent-Based Chemical Plume Tracing Using Fluid Dynamics

NASA Technical Reports Server (NTRS)

Zarzhitsky, Dimitri; Spears, Diana; Thayer, David; Spears, William

2004-01-01

This paper presents a rigorous evaluation of a novel, distributed chemical plume tracing algorithm. The algorithm is a combination of the best aspects of the two most popular predecessors for this task. Furthermore, it is based on solid, formal principles from the field of fluid mechanics. The algorithm is applied by a network of mobile sensing agents (e.g., robots or micro-air vehicles) that sense the ambient fluid velocity and chemical concentration, and calculate derivatives. The algorithm drives the robotic network to the source of the toxic plume, where measures can be taken to disable the source emitter. This work is part of a much larger effort in research and development of a physics-based approach to developing networks of mobile sensing agents for monitoring, tracking, reporting and responding to hazardous conditions.

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

NASA Astrophysics Data System (ADS)

Zhang, Liang; Lu, Na

2017-12-01

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