Ag eneral architecture for the computer implementation of a theory of emotions is presented. The model is based mainly on a cognitive orientated theory proposed by Frijda 1986 where emotions are described as the manifestations of a concern satisfaction system. The model applies the theory to multiple agents in a blocks world environment where actions may or may not be emotional. Related work is...

We demonstrate that M-theory compactifications on 7-manifolds of G2 holonomy, which yield 4d N = 1 supersymmetric systems, often admit at special loci in their moduli space a description as type IIA orientifolds. In this way, we are able to find new dualities of special IIA orientifolds, including dualities which relate orientifolds of IIA strings on manifolds of different topology with differe...

We construct generalized 11D supergravity solutions of fully localized D2/D6 brane intersections. These solutions are obtained by embedding Taub-NUT and/or self-dual geometries lifted to M-theory. We reduce these solutions to ten dimensions, obtaining new D-brane systems in type IIA supergravity. We discuss the limits in which the dynamics of the D2 brane decouples from the bulk for these solut...

In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a probabilistic, relational planning rule representation that compactly models noisy, nondeterministic action effects, and show how such rules can be effectively learned. Through experiments in simple planning domains and a 3D simulated blocks world with realistic physics, we demon...

We construct generalized 11D supergravity solutions of fully localized D2/D6 brane intersections. These solutions are obtained by embedding Taub-NUT and/or self-dual geometries lifted to M-theory. We reduce these solutions to ten dimensions, obtaining new D-brane systems in type IIA supergravity. We discuss the limits in which the dynamics of the D2 brane decouples from the bulk for these solut...

There are many approaches proposed for solving Sudoku puzzles. One of them is by modelling the puzzles as block world problems. There have been three model for Sudoku solvers based on this approach. Each model expresses Sudoku solver as a parameterized multi agent systems. In this work, we propose a new model which is an improvement over the existing models. This paper presents the development ...

This paper proposes a model of mental imagery which takes into account the role of internal attentional search light. We model the process of mental imagery problem solving by a long term memory which manipulates, with the aid of associations, the information of the visual buffer. The visual buffer is changed until a desired solution for a visual problem is achieved. The associations are determ...

We study ‘Myers effect’ for a bunch of D1-branes with IIB superstrings moving in one direction along the branes. We show that the ‘blown-up’ configuration is the helical D1-brane, which is self-supported from collapse by the axial momentum flow. The tilting angle of the helix is determined by the number of D1-branes. The radius of the helix is stabilized to a certain value depending on the numb...

This paper proposes a method for the development of AI for autonomous agents in game worlds modeled by fixed regular grids. This approach uses context behaviors driven by distance maps to support multiple agents in a dynamic environment. This paper introduces the notion of hierarchical distance maps which allow for higher-level goals to be easily specified by designers. We also discuss potentia...

This paper describes plan reuse in multiagent domains. In distributed planning, a plan is created by distributed centers of planner agents that have their own viewpoints. Plan reuse where a past plan result is reused for the new problem was proposed for single-agent planning and can achieve efficient planning. A special issue for applying it to distributed planning is that, even if the local ag...