The aim of our study is to detect balance disorders and a tendency towards the falls in the elderly, knowing gait parameters. In this paper we present a new tool for gait analysis based on markerless human motion capture, from camera feeds. The system introduced here, recovers the 3D positions of several key points of the human body while walking. Foreground segmentation, an articulated body model and particle filtering are basic elements of our approach. No dynamic model is used thus this system can be described as generic and simple to implement. A modified particle filtering algorithm, which we call Interval Particle Filtering, is used to reorganise and search through the model's configurations search space in a deterministic optimal way. This algorithm was able to perform human movement tracking with success. Results from the treatment of a single cam feeds are shown and compared to results obtained using a marker based human motion capture system.

Automobile has become the dominant transport mode in the world in the last century. In order to meet a continuously growing demand for transport, one solution is to change the control approach for vehicle to full driving automation, which removes the driver from the control loop to improve efficiency and reduce accidents. Recent work shows that there are several realistic paths towards this deployment : driving assistance on passenger cars, automated commercial vehicles on dedicated infrastructures, and new forms of urban transport (car-sharing and cybercars). Cybercars have already been put into operation in Europe, and it seems that this approach could lead the way towards full automation on most urban, and later interurban infrastructures. The European project CyberCars has brought many improvements in the technology needed to operate cybercars over the last three years. A new, larger European project is now being prepared to carry this work further in order to meet more ambitious objectives in terms of safety and efficiency. This paper will present past and present technologies and will focus on the future developments.

In System Theory [20], input-output analysis has been a majo r tool for partial or complete identification of black-box systems. In cognitive vision science, t he study of various visual illusions follows exactly the same spirit. Cognitive scientists have designe d numerous intriguing inputs of image signals, so that the distorted or transformed outputs (as re ported by an average human observer) can help reveal some crucial latent properties of the human v ision system (see, e.g., the remarkable works of Adelson [1], Knill and Kersten [14, 16], and Kanizsa [11]). Illusory contours are such a well known class of visual illusions, and the current paper devel ops a mathematical model to characterize, analyze, and simulate generic illusory contours. Our w ork has been closely inspired by many existent modeling works, especially by Sarti, Malladi, and Sethian [24], and Zhu and Chan [30, 31]. Figure 1 shows two examples of illusory contours known as Kanizsa triangle and square [11, 24, 30].

Imitation is fundamental in the understanding of social system dynamics. But the diversity of imitation rules employed by modelers proves that the modeling of mimetic processes cannot avoid the traditional problem of endogenization of all the choices, including the one of the mimetic rules. Starting from the remark that human reflexive capacities are the ground for a new class of mimetic rules, I propose a formal framework, metamimetic games, that enable to endogenize the distribution of imitation rules while being human specific. The corresponding concepts of equilibrium - counterfactually stable state - and attractor are introduced. Finally, I give an interpretation of social differentiation in terms of cultural co-evolution among a set of possible motivations, which departs from the traditional view of optimization indexed to criteria that exist prior to the activity of agents.

Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preference aggregation to destructive control. That is, we study the ability of an election's chair to, through such mechanisms as voter/candidate addition/suppression/partition, ensure that a particular candidate (equivalently, alternative) does not win. And we study the extent to which election systems can make it impossible, or computationally costly (NP-complete), for the chair to execute such control. Among the systems we study--plurality, Condorcet, and approval voting--we find cases where systems immune or computationally resistant to a chair choosing the winner nonetheless are vulnerable to the chair blocking a victory. Beyond that, we see that among our studied systems no one system offers the best protection against destructive control. Rather, the choice of a preference aggregation system will depend closely on which types of control one wishes to be protected against. We also find concrete cases where the complexity of or susceptibility to control varies dramatically based on the choice among natural tie-handling rules.

We consider the problem of forecasting a new observation from the available data, which may include, e.g., all or some of the previous observation s and the values of some explanatory variables. To make the process of fore casting more vivid, we imagine that the data and observations are chosen by a play er called Reality and the forecasts are made by a player called Forecaster. T o establish properties of forecasting algorithms, the traditional theory of m achine learning makes some assumptions about the way Reality generates the ob servations; e.g., statistical learning theory [28] assumes that the data and obs ervations are generated independently from the same probability distribution. A m ore recent approach, prediction with expert advice (see, e.g., [5]), replaces th e assumptions about Reality by a comparison class of prediction strategies; a typical result of this theory asserts that Forecaster can perform almos t as well as the best strategies in the comparison class. This paper further explor es a third possibility, suggested in [11], which requires neither assumptions abo ut Reality nor a comparison class of Forecaster's strategies.

The development of effective knowledge discovery techniques has become in the recent few years a very active research area due to the important impact it has in several relevant application areas. One interesting task thereof is that of singling out anomalous individuals from a given population, e.g., to detect rare events in time-series analysis settings, or to identify objects whose behavior is deviant w.r.t. a codified standard set of "social" rules. Such exceptional individuals are usually referred to as outliers in the literature. Recently, outlier detection has also emerged as a relevant KR&R problem. In this paper, we formally state the concept of outliers by generalizing in several respects an approach recently proposed in the context of default logic, for instance, by having outliers not being restricted to single individuals but, rather, in the more general case, to correspond to entire (sub)theories. We do that within the context of logic programming and, mainly through examples, we discuss its potential practical impact in applications. The formalization we propose is a novel one and helps in shedding some light on the real nature of outliers. Moreover, as a major contribution of this work, we illustrate the exploitation of minimality criteria in outlier detection. The computational complexity of outlier detection problems arising in this novel setting is thoroughly investigated and accounted for in the paper as well. Finally, we also propose a rewriting algorithm that transforms any outlier detection problem into an equivalent inference problem under the stable model semantics, thereby making outlier computation effective and realizable on top of any stable model solver.

We have developed a web-based human-computer-intera ction system with natural language for foreign language learning: CSI EC (Computer Simulator in Educational Communication) [1]. The kernel of this system is the natural language understanding mechanism (NLML, NLOMJ and NLDB) and the communicational response (CR). NLML(Natural Language Markup Languag e) is a markup language to describe the grammar of an expression in a natur al language. It is produced to an expression of this natural language by a parser wri tten according to the grammar rules and lexicon of this language [2]. We use English as the experiment language in our system. For example, the NLML for the sentence " I come " is

Imagination is the critical point in developing of realistic artificial intelligence (AI) systems. One way to approach imagination would be simulation of its properties a nd operations. We developed two models "Brain Network Hierarchy of Languages", "Semantical Holographic Calculus" and simulation system ScriptWriter that e mulate the process of imagination through an automatic ani mation of English texts.

This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational ability is sufficient to enable cooperative behavior. In addition, a variant of the repeated Prisoner's Dilemma game is suggested, in which players have the choice of opting out. This modification enriches the game and suggests dominance of cooperative strategies. Competitive analysis is suggested as a tool for investigating sub-optimal (but computationally tractable) strategies and game theoretic models in general. Using competitive analysis, it is shown that for bounded players, a sub-optimal strategy might be the optimal choice, given resource limitations.