3228593
A General Framework for Parallel BDI Agents
The traditional BDI agent has 3 basic computational components that generate beliefs, generate intentions and execute intentions. They run in a sequential and cyclic manner. This may introduce several problems. Among them, the inability to watch the environment continuously in dynamic environments may be disastrous. There is also no support for goal and intention reconsideration and consideration of relationships between goals at the architecture level. A parallel BDI agent architecture was proposed in [15] and evaluated in [16]. Based on the work in [15] and [16], we propose in this paper, a general framework for the parallel BDI agent model. Under this general framework, parallel BDI agents with different configurations depending on the availability of physical resources may be built. These agents have a number of advantages over the sequential one: 1. changes in the agent's environment can be detected immediately; 2. emergencies will be dealt with immediately; 3. the support is provided at the architecture level for reconsideration of desires/intentions and the consideration of goal relationships when a new belief/desire is generated. We show some example parallel BDI agents with different configurations under the framework and their performance in a set of experiments.
17728390
Are Parallel BDI Agents Really Better?
The traditional BDI agent has 3 basic computational components that generate beliefs, generate intentions and execute intentions. They run in a sequential and cyclic manner. This may introduce several problems. Among them, the inability to watch the environment continuously in dynamic environments may be disastrous and makes an agent less rational --the agent may endanger itself. Two possible solutions are by parallelism and by controlling and managing the 3 components in suitable ways. We examine a parallel architecture with three parallel running components which are the belief manager, the intention generator and the intention executor. The agent built with this architecture will have the ability of performing several actions at once. To evaluate the parallel BDI agent, we compare the parallel agent against four versions of sequential agents where the 3 components of the BDI agent are controlled and managed in different ways and different time resources are allocated to them. Experiments are designed to simulate agents based on the sequential and parallel BDI architectures respectively and the ability of the agents to respond to the same sequences of external events of various priorities are assessed. The comparison results show that the parallel BDI agent has quicker response, react to emergencies immediately and its behaviour is more rational.
7400694
A Parallel BDI Agent Architecture
2426049
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
A large family of algorithms - supervised or unsupervised; stemming from statistics or geometry theory - has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms. By utilizing this framework as a tool, we propose a new supervised dimensionality reduction algorithm called marginal Fisher analysis in which the intrinsic graph characterizes the intraclass compactness and connects each data point with its neighboring points of the same class, while the penalty graph connects the marginal points and characterizes the interclass separability. We show that MFA effectively overcomes the limitations of the traditional linear discriminant analysis algorithm due to data distribution assumptions and available projection directions. Real face recognition experiments show the superiority of our proposed MFA in comparison to LDA, also for corresponding kernel and tensor extensions
10792862
A presentation authoring tool for media devices distributed environments
Many conference rooms are now equipped with multiple multi-media devices, such as plasma displays and surrounding speakers, to enhance presentation quality. However, most existing presentation authoring tools are based on the one-display-and-one-speaker assumption, which makes it difficult to organize and playback a presentation dispatched to multiple devices, thus hinders users from taking full advantage of additional multimedia devices. In this paper, we propose and implement a tool to facilitate authoring and playback of a multi-channel presentation in a media devices distributed environment. The tool, named PreAuthor, provides an intuitive and visual way to author a multi-channel presentation by dragging and dropping "hyper-slides" on corresponding visual representations of various devices. PreAuthor supports "hyper-slide" synchronization among various output devices during preview and playback. It also offers multiple options for the presenter to view the presentation in a rendered image sequence, live video, 3D VRML model, or real environment.
17170240
The Z-Transformation graph for an outerplane bipartite graph has a Hamilton path
The Z-transformation graph of perfect matchings of a plane bipartite graph G has the perfect matchings of G as vertices, two perfect matchings being adjacent if their symmetric difference forms a cycle that is the boundary of an interior face of G. In this note, we prove that the Z-transformation graph of perfect matchings of an outerplane bipartite graph has a Hamilton path.
13845864
On the interaction between overlay routing and underlay routing
In this paper, we study the interaction between overlay routing and traffic engineering (TE) in a single autonomous system (AS). We formulate this interaction as a two-player non-cooperative non-zero sum game, where the overlay tries to minimize the delay of its traffic and the TE's objective is to minimize network cost. We study a Nash routing game with best-reply dynamics, in which the overlay and TE have equal status, and take turns to compute their optimal strategies based on the response of the other player in the previous round. We prove the existence, uniqueness and global stability of Nash equilibrium point (NEP) for a simple network. For general networks, we show that the selfish behavior of an overlay can cause huge cost increases and oscillations to the whole network. Even worse, we have identified cases, both analytically and experimentally, where the overlay's cost increases as the Nash routing game proceeds even though the overlay plays optimally based on TE's routing at each round. Experiments are performed to verify our analysis.
6317532
Multi-agent based peer-to-peer information retrieval systems with concurrent search sessions
In cooperative peer-to-peer information retrieval systems, each node can be considered an intelligent agent and these agents work collectively to provide an information retrieval service. In order to effectively support multiple and concurrent search sessions in the network, we propose two traffic engineering techniques that minimize processing and communication bottlenecks. One is a novel agent control mechanism whose elements include resource selection, local search scheduling, and feedback-based load control. The other is a new two-phase query routing algorithm based on organizational knowledge. Experimental results show that this framework can reduce congestion situations, increase system throughput, and improve considerably the overall system utility.