In this paper, we report progress on making synthetic characters more taskable. In particular, we present an English-like command language that lets one specify complex behaviors an agent should carry out in a virtual environment. We also report compilers that translate English commands into a formal notation and formal statements into procedures for ICARUS, an agent architecture that supports ...

1 Research Scholar, 2 Professor Department of Computer Science Avinashilingam University for Women, Coimbatore, Tamil Nadu, India. _____________________________________________________________________________________ Abstract: Classification is the problem of identifying, to which set of categories a new observation belongs, on the basis of a training set whose category membership is known. The...

Several authors have demonstrated that theory of mind is associated with a cerebral pattern of activity involving the medial prefrontal cortex. This study was designed to determine the cerebral regions activated during attribution of intention to others, a task which requires theory-of-mind skills. Eight healthy subjects performed three nonverbal tasks using comic strips while PET scanning was ...

We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI) of non-player characters. To create interesting AI in games today, developers or players have to create complex, dynamic behavior for a very small number of characters, but neither the game engines nor the style of AI...

One of the major challenges associated with making compelling virtual worlds for computer games is populating them with intelligent characters. Most of today’s characters are mindless automatons that follow an inflexible set of simple rules. Unfortunately, when we start to make characters try and think for themselves we can run into difficulties. For example, if we are not extra careful about h...

Let G = Spin[4n+1] be the connected, simply connected complex Lie group of type B2n and let G = Spin(p, q) (p + q = 4n + 1) denote a (connected) real form. If q / ∈ {0, 1}, G has a nontrivial fundamental group and we denote the corresponding nonalgebraic double cover by G̃ = ̃ Spin(p, q). The main purpose of this paper is to describe a symmetry in the set of genuine parameters for the various G̃ ...

The complex and highly specific nature of ICD-10-PCS has changed the query process for inpatient procedures. Each code is constructed using individual characters that identify all aspects of the procedure. Assigning the correct ICD-10-PCS code requires precise and complete documentation. Incomplete and non-specific documentation may result in the inability to assign a code. Unlike ICD-9-CM proc...

The second author and Postnikov have recently constructed a simple combinatorial model for the characters of the irreducible representations of a complex semisimple Lie group, that is referred to as the alcove path model. In this paper we relate the alcove path model to the the semistandard Young tableaux in type A and the KashiwaraNakashima tableaux in type C. More explicitly, we construct bij...

We derive a Murnaghan–Nakayama type formula for the values of unipotent characters of finite classical groups on regular semisimple elements. This relies on Asai’s explicit decomposition of Lusztig restriction. We use our formula to show that most complex irreducible characters vanish on some -singular element for certain primes . As an application we classify the simple endotrivial modules of ...