16356479
A multi-agent simulation for social agents
Agent-based modeling of human social behavior is an increasingly important research area. Many fully functional multi-agent systems have been developed and have been put to use over the years. But efficient scalable and robust social systems are difficult to engineer, both from the modeling perspective and the implementation perspective. There exist three important difficulties. First, the system needs to have an adaptable agent framework that can successfully make intuitive and deliberative decisions much like a real social participant would. Secondly, the system must have a robust architecture that not only ensures its functioning no matter the simulation, but also provides an easily understood interface that researchers can interact with while running their simulations. Finally, the system must be effectively distributed to handle the necessary number of agents that social research requires to obtain meaningful results. This paper presents our work on creating a multi-agent simulation for social agents that would overcome these three difficulties. Lastly, we present a simulation to test the system and provide the results of that simulation.
35439746
Role-Based and Agent-Oriental Teamwork Modeling
14270166
A Role-Based Approach in Dynamic Task Delegation in Agent Teamwork
This paper presents a role-based agent teamwork language called RoB-MALLET (Role-Based Multi-Agent Logic Language for Encoding Teamwork). Roles have been used to form multi-agent theories and guide the construction of multi-agent architectures and systems. Different from the most existing agent teamwork models that emphasize practical reasoning based on beliefs, desires and intentions (BDI), a role-based teamwork language stresses the concept of organization and thereby cooperation. RoB-MALLET is able to handle unexpected uncertainties and allow for the conceptual specification of teamwork knowledge for reuse. Finally, we present several experiments that explore plan reusability of RoB-MALLET, show that it is flexible in supporting simultaneity of invocation and evaluate its efficiency in supporting teamwork.
14748203
A history sensitive cascade model in diffusion networks
Diffusion is a process by which information, viruses, ideas and new behavior spread over social networks. The traditional independent cascade model gives activated nodes a one-time chance to activate each of its neighboring nodes with some probability. This paper extends the traditional cascade model to be history dependent. We propose a new model called the History Sensitive Cascade Model (HSCM) that allows activated nodes to receive more than a one-time chance to activate their neighbors. HSCM provides 1) a polynomial algorithm for calculating the probability of activity for any arbitrary node at any arbitrary time in tree structure graphs, and 2) a Markov model for calculating the probability in general graphs. Finally, we perform an empirical study on HSCM under different network settings. These simulations have showed its power to observe and explain the emergent phenomena in the macro level when changing parameters in the micro level.
40423470
Proactive Communication in Observation-Based Agent Team Corporation
2679883
Observation-based proactive communication in team cooperation
Observation and communication are important aspects of agent teamwork. We employ the agent's observability as the major means for individual agents to reason about the environment and other team members. We focus on how to represent agents' observability and how to include it into the basic reasoning for proactive communication. The syntax and the operational semantics of observability are given. Preliminary experiments are carried out to study the effectiveness of different aspects of observability.
36214906
New routing algorithms in trustworthy Internet
Since the lack of source IP address checking in today's Internet makes it easy for the attackers to spoof the source address, the mechanism of Source Address Validation Architecture (SAVA) is proposed for building effective source-address validation to ensure that packets forwarded hold authentic source addresses. In this paper, we study the routing selection in partial deployment of SAVA nodes in the trustworthy Internet. We propose and compare three routing algorithms, i.e., Shortest-Path Algorithm (SPA), SAVA based Shortest-Path Algorithm (SSPA), and SAVA based Shortest-Path Algorithm with Load Balancing (SSPALB). Beside analytical results, we run simulations which met our expectations.
8620934
Certifying Concurrent Programs Using Transactional Memory
Transactional memory (TM) is a new promising concurrency-control mechanism that can avoid many of the pitfalls of the traditional lock-based techniques. TM systems handle data races between threads automatically so that programmers do not have to reason about the interaction of threads manually. TM provides a programming model that may make the development of multi-threaded programs easier. Much work has been done to explore the various implementation strategies of TM systems and to achieve better performance, but little has been done on how to formally reason about programs using TM and how to make sure that such reasoning is sound. In this paper, we focus on the semantics of transactional memory and present a proof-carrying code (PCC) system for reasoning about programs using TM. We formalize our reasoning with respect to the TM semantics, prove its soundness, and use examples to demonstrate its effectiveness.
42237594
Optimizing the Data Intensive Mediator-Based Web Services Composition
Effectively using heterogeneous, distributed information has attracted much research in recent years. Current web services technologies have been used successfully in some non data intensive distributed prototype systems. However, most of them can not work well in data intensive environment. This paper provides an infrastructure layer in data intensive environment for the effectively providing spatial information services by using the web services over the Internet. We extensively investigate and analyze the overhead of web services in data intensive environment, and propose some new optimization techniques which can greatly increase the system’s efficiency. Our experiments show that these techniques are suitable to data intensive environment. Finally, we present the requirement of these techniques for the information of web services over the Internet.
12319923
Decoding Digital Information from the Cascaded Heterogeneous Chaotic Systems
In this paper, we propose a new approach to breaking down chaotic communication scheme by attacking its encryption keys. A remarkable advancement is that it can decode the hidden message exactly. This makes it become possible to break down some cascaded chaotic communication systems. We also decode digital information from the cascaded heterogeneous chaotic communication system and give the simulation results.
1369350
EEG Source Localization for Two Dipoles in the Brain Using a Combined Method
Estimating the correct location of electric current source with the brain from electroencephalographic (EEG) recordings is a challenging analytic and computational problem. Specifically, there is no unique solution and solutions do not depend continuously on the data. This is an inverse problem from EEG to dipole source. In this paper we consider a method combining backpropagation neural network (BPNN) with nonlinear least square (NLS) method for source localization. For inverse problem, the BP neural network and the NLS method has its own advantage and disadvantage, so we use the BPNN to supply the initial value to the NLS method and then get the final result, here we select the Powell algorithm to do the NLS calculating. All these work are for the fast and accurate dipole source localization. The main purpose of using this combined method is to localize two dipole sources when they are locating at the same region of the brain. The following investigations are presented to show that this combined method used in this paper is an advanced approach for two dipole sources localization with high accuracy and fast calculating.