34138790
Rational competition and cooperation in ubiquitous agent communities
This paper presents a methodology for developing Ubiquitous Agent Communities (UAC). In particular, the paper provides the methods for implementing rational competition and cooperation among ubiquitous agents, and furthermore the definitions of messages and protocols for the communication among agents. A UAC contains two types of agents: community (administration) agents and service agents (s-agents). The former makes task plans as well as decisions on how to contract sub-tasks to s-agents, whereas the latter tries to win and perform subtasks based on rational competition and cooperation. The paper illustrates the coordinated services of a UAC with respect to an example of ubiquitous agents in managing human daily tasks.
37683026
Web Intelligence (WI)
The 21st century is the age of the Internet and the World Wide Web. The Web revolutionizes the way we gather, process, and use information. At the same time, it also redefines the meanings and processes of business, commerce, marketing, finance, publishing, education, research, development, as well as other aspects of our daily life. The revolution is just beginning. Although individual Web based information systems are constantly being deployed, advanced issues and techniques for developing and for benefiting from Web intelligence still remain to be systematically studied. The article defines a new research field, namely Web Intelligence (WI) by giving a complete picture of WI related topics for systematic study on advanced Web technology and developing Web based intelligent information systems. Roughly speaking, WI exploits AI and advanced information technology on the Web and Internet. It is the key and the most urgent research field of IT for business intelligence.
33842812
Anycast-Based Cooperative Proxy Caching
As one of the most popular applications currently running on the Internet, the World Wide Web is of an exponential growth in size, which results in the network congestion and server overloading. Web caching as an important technique aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popular contents on proxy caches. In our paper, we develop an anycast-based cooperative web proxy caching mechanism. It puts response time, hop counts, self-organized load balancing, adaption, and self-configuration as primary concerns. In our scheme, anycast is used to bring a server “nearest” to a client to improve overall performance, all proxies in a local network consists an anycast group. The object placement and replacement problems are formulated as an optimization problem and the solution is obtained by using an anycast-based cooperative proxy caching algorithm. Some simulation experiments have been conduced to evaluate the proposed scheme in terms of a wide range of performance metrics. Analytical and experimental results show that our algorithm outperforms some existing algorithms in response time, hop counts.
5692814
Mining associated implication networks: computational intermarket analysis
Current attempts to analyze international financial markets include the use of financial technical analysis and data mining techniques. In this paper, we propose a new approach that incorporates implication networks and association rules to form an associated network structure. The proposed approach explicitly addresses the issue of local vs. global influences between financial markets.
18067929
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
In this paper, we present an autonomous pattern search approachto solving Satisfiability Problems (SATs). Our approach is essentially a multiagent system. To solve a SAT problem, we first divide variables into groups, and represent each variable group with an agent. Then, we randomly place each agent onto a position in the correspoding local space which is composed of the domains of the variables that are represented by this agent. Thereafter, all agents will autonomously make searchdecisions guided by some reactive rules in their local spaces until a special pattern (i.e., solution) is found or a time step threshold is reached. Experimental results on some benchmark SAT test-sets have shown that by employing the MASSAT approach, we can obtain performances comparable to those of other popular algorithms.
14178256
Distributed Problem Solving Without Communication - An Examination of Computationally Hard Satisfiability Problems
In this paper, we extend and modify the ERA approach proposed in Ref. 13 to solve Propositional Satisfiability Problems (SATs). The new ERA approach involves a multiagent system where each agent only senses its local environment and applies some self-organizing rules for governing its movements. The environment, which is a two-dimensional cellular environment, records and updates the local values that are computed and affected according to the movements of individual agents. In solving a SAT with the ERA approach, we first divide variables into several groups, and represent each variable group with an agent whose possible positions correspond to the elements in a Cartesian product of variable domains, and then randomly place each agent onto one of its possible positions. Thereafter, the ERA system will keep on dispatching agents to choose their movements until an exact or approximate solution emerges. The experimental results on some benchmark SAT test-sets have shown that the ERA approach can obtain comparable results as well as stable performances for SAT problems. In particular, it can find approximate solutions for SAT problems in only a few steps. The real value of this approach is that it is a distributed asynchronous approach without any centralized control or evaluation, where the agents can cooperate to solve problems without explicit communication.
6371621
3D object reconstruction from a single 2D line drawing without hidden lines
The human vision system can interpret a single 2D line drawing as a 3D object without much difficulty even if the hidden lines of the object are invisible. Several reconstruction approaches have tried to emulate this ability, but they cannot recover the complete object if the hidden lines of the object are not shown. This paper proposes a novel approach for reconstructing complete 3D objects from line drawings without hidden lines. First, we develop some constraints and properties for the inference of the topology of the invisible edges and vertices of an object. Then we present a reconstruction method based on perceptual symmetry and planarity of the object. We give a number of examples to demonstrate the ability of our approach.
911649
Emergent Constraint Satisfaction Through Multi-Agent Coordinated Interaction
We present a methodology, called Constraint Partition and Coordinated Reaction (CP&CR), for distributed constraint satisfaction based on partitioning the set of constraints into subsets of different constraint types. Associated with each constraint type is a set of specialised agents, each of which is responsible for enforcing constraints of the specified type for the set of variables under its jurisdiction. Variable instantiation is the joint responsibility of a set of agents, each of which has a different perspective on the instantiation according to a particular constraint type and can revise the instantiation in response to violations of the specific constraint type. The final solution emerges through incremental local revisions of an initial, possibly inconsistent, instantiation of all variables. Solution revision is the result of coordinated local reaction of the specialised constraint agents. We have applied the methodology to job shop scheduling, an NP-complete constraint satisfaction problem. Utility of different types of coordination information in CP&CR was investigated. In addition, experimental results on a benchmark suite of problems show that CP&CR performed considerably well as compared to other centralised search scheduling techniques, in both computational cost and number of problems solved.
14351401
JMatch: Iterable Abstract Pattern Matching for Java
The JMatch language extends Java with iterable abstract pattern matching, pattern matching that is compatible with the data abstraction features of Java and makes iteration abstractions convenient. JMatch has ML-style deep pattern matching, but patterns can be abstract; they are not tied to algebraic data constructors.A single JMatch method may be used in several modes; modes may share a single implementation as a boolean formula. Modal abstraction simplifies specification and implementation of abstract data types. This paper describes the JMatch language and its implementation.
36178651
The vertex linear arboricity of distance graphs
A distance graph is a graph G(R,D) with the set of all points of the real line as vertex set and two vertices u,[email protected]?R are adjacent if and only if |u-v|@?D where the distance set D is a subset of the positive real numbers. Here, the vertex linear arboricity of G(R,D) is determined when D is an interval between 1 and @d. In particular, the vertex linear arboricity of integer distance graphs G(D) is discussed, too.
4676182
A Web Services based Communication Services Framework for Collaborative Work
This paper considers the problem of integrating communication services that support group collaboration systems. Past experience has shown that heterogeneous communication services are extremely difficult to be integrated into collaboration environment and extended to meet continuous changing requirements. This paper aims at proposing a common, interoperable framework based on Web Services technology for integrating communication services in a collaboration environment. This framework allows the implementation of reusable communication services components that can be plugged into the collaboration system and be invoked on demand according to communication requirements of collaboration applications. Based on this framework, a prototype system called Rich Media Collaborative Workplace is developed. This system provides an integrated collaborative workplace with benefits of increasing productivity, saving cost and improving efficiency.