7400694
A Parallel BDI Agent Architecture
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.
16979558
Region-based relevance feedback in image retrieval
Relevance feedback and region-based representation of images are two effective ways to improve accuracy in content-based image retrieval. We propose a novel relevance feedback approach based on region representation. It can be considered as a special case of the query point movement method in region-based image retrieval. By assembling all the segmented regions of positive examples together and resizing the regions to emphasize the latest positive examples, we form a composite image as the optimal query. A region-based image similarity measure is used to calculate the distance between the optimal query and an image in the database. An incremental clustering technique is also considered to improve the retrieval efficiency. Experimental results show that the proposed approach is effective in improving the performance of content-based image retrieval systems.
686393
Accelerated walkthrough of large spline models
CAD and rmimation applications. In this pa-per, we present algorithms for interactive walkthrough ofcomplex NURBS models composed of tens of thousands ofpatches on current graphics systems. Given a spline model,the algorithm precomputes simplification of a collection ofpatches and represents them hierarchically. Given a chang-ing viewpoint, the algorithm combines these simplificationswith dynamic tessellations to generate appropriate levels ofdetail. We also propose a system pipeline for parallel im-plementation on multi-processor configurations. Diiferentcomponents,
1402660
On Unstructured File Sharing Networks
We study the interaction among users of unstructured file sharing applications, who compete for available network resources (link bandwidth or capacity) by opening multiple connections on multiple paths so as to accelerate data transfer. We model this interaction with an unstructured file sharing game. Users are players and their strategies are the numbers of sessions on available paths. We consider a general bandwidth sharing framework proposed by Kelly [1] and Mo and Walrand [2], with TCP as a special case. Furthermore, we incorporate the Tit-for-Tat strategy (adopted by BitTorrent [3] networks) into the unstructured file sharing game to model the competition in which a connection can be set up only when both users find this connection beneficial. We refer to this as an overlay formation game. We prove the existence of Nash equilibrium in several variants of both games, and quantify the losses of efficiency of Nash equilibria. We find that the loss of efficiency due to selfish behavior is still unbounded even when the Tit-for-Tat strategy is believed to prevent selfish behavior.
18976777
Up to Face Extrusion Algorithm for Generating B-Rep Solid
Up to face extrusion (UTFE) is an effective operation to extrude the profile from a sketch plane to a selected face. An up to face extrusion algorithm is presented in this paper. The algorithm first generates the trimmed extrusion through a simple body-surface Boolean operation method, and then generates the resultant solid through a regularized Boolean operation between the original solid and the trimmed extrusion. The algorithm has been implemented in a commercial geometric modeling software system TiGems. Examples are given to illustrate the algorithm.
2506060
Synchronous Binarization for Machine Translation
Systems based on synchronous grammars and tree transducers promise to improve the quality of statistical machine translation output, but are often very computationally intensive. The complexity is exponential in the size of individual grammar rules due to arbitrary re-orderings between the two languages, and rules extracted from parallel corpora can be quite large. We devise a linear-time algorithm for factoring syntactic re-orderings by binarizing synchronous rules when possible and show that the resulting rule set significantly improves the speed and accuracy of a state-of-the-art syntax-based machine translation system.