14143063
Forming Proactive Team Cooperation by Observations
Proactivity is the ability to take initiative by exhibiting goal-directed behavior. Agents with proactivity can respond to dynamic environment in a timely way. Hence the ability to anticipate the information needs of teammates and assist them proactively is highly desirable. This research is directed toward helping agents produce effective communication through observations. We show how agents can use observation to estimate the teammates' beliefs and proactively provide the information that the teammates need. We present two experiments that explore: 1) effectiveness of different aspects of observability; 2) scalability of using observability with respect to the number of agents in a team.
1229519
A decision-theoretic approach for designing proactive communication in multi-agent teamwork
Techniques that support effective communication during teamwork processes are of particular importance. Psychological study shows that an effective team often can anticipate information exchange among the team and communicate relevant information proactively. Proactive communication is crucial for understanding and sharing common goals and for cooperative actions. Communication can be valuable if it assists agents with new and timely information; it also has cost because it consumes network resources such as bandwidth. To address these issues, we present a new model that uses information production and need to capture the complex multi-agent communication process and a dynamic decision-theoretic determination of communication strategies. We also introduce a generic utility function and an algorithm, DTPC (Decision-Theoretic Proactive Communication), that focuses on representing information production and need of team members and resolving decision interactions among them for making decisions.
5679790
Proactive Information Exchange During Team Cooperation
We are concerned, ultimately, with multi-agent teams involving both software and human agents in which the software agents assist in training the humans, e.g., as virtual team members. The software agents must be capable of utilizing the teamwork mechanisms used by humans. In this paper, we describe how to give agents the same implicit communication capabilities, i.e., observation, that humans use. We show how agents can use observations of the environment and teammates' actions to estimate other agents beliefs without bothering them with unnecessary messages; we also show how agents can anticipate information needs among the team and proactively exchange information, reducing the total communication volume. To achieve these goals, we add sensing capabilities to agents and present algorithms that infer teammates' mental state from the observation. Experimental data is presented that shows that the advantage of observation in proactive information exchange as well as enhanced team performance.
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
35439746
Role-Based and Agent-Oriental Teamwork Modeling
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.
481284
A Novel Method for Image Spam Filtering
As spamming morphs from text-only to multi-media in content, the existing text-based spam filters are no longer effective for the task. Image analysis technology will provide an effective tool to solve the above problem. This paper proposes a novel filter approach that focuses on the spam which change the content text to image files, or embed the spam message into attached images. Spam images are analyzed and specific features are selected for inspection based on components-based method. Then the network junk-mail-filter system can use these features to identify whether to filter the mail or not by feature matching. Experiments show that our method is efficient in inspecting document images with different geometric structure. The proposed method has potential applications in document image information extraction and filtering.
8166991
On Destination Set in IP-Level Topology Measurement
We present a thorough investigation of four issues with the destination set in IP-level topology measurement. (1) To evaluate the completeness of the destination set, we measured by brute force and found that a half of edges will be missed by the uniform random selection (URS) method which was adopted by well-known CAIDA' skitter. (2) Two potential reasons for edge missing, the short-term routing dynamics and the subnetting technique, were investigated with the last-hop selection method and the bisection selection method respectively. And the results showed that the subnetting technique is the main reason. (3) To select destinations efficiently, we presented the minimum cover selection (MCS) method which performed better than the URS method on 75% of networks over three months. (4) Finally, to investigate the bias of topology characterization, we measured a destination set larger than before and discovered a Chinese topology whose size is 5 times as large as that discovered by skitter. The comparison between characteristics of skitter's topology and ours indicated that the small destination set trends to miss the information on marginal networks.
40211124
Real-time physically-based facial expression animation using mass-spring system
We propose a physically-based approach based on anatomical knowledge for real-time facial expression animation. The facial model incorporates a physically-based approximation to facial skin and a set of anatomically-motivated facial muscles. The skin is modeled by a mass-spring system with nonlinear springs which have a biphasic stress-strain relationship to simulate the elastic dynamics of real facial skin. Facial muscles are modeled as forces deforming the spring mesh. Based on the action units (AUs) of the facial action coding system (FACS), various expressions can be generated by a combination of contractions of a set of facial muscles. Lagrangian mechanics governs the dynamics, dictating the deformation of the facial surface in response to muscle forces. Simulation results show real-time facial deformation as well as realistic expression animation.
18135167
Localized and Integrated Topology Maintenance for Wireless Sensor Networks
The energy consumed by topology maintenance could be higher than that in the initialization stage and the cost will increase steadily with the turns of maintenance process. Therefore, when design a self-organization protocol for WSN, not only initialization cost should be considered but also the maintenance cost in the whole lifetime. Moreover, to reduce the footprint on system resource, the maintenance process should be integrated with the initialization process but not separated. We propose a localized and integrated topology maintenance algorithm in this paper. This algorithm could maintain the topology in a localized manner and the maintenance process is integrated with the initialization process by nature. Simulation results show it has less energy cost in the network lifetime than two other typical protocols.