Calliope is an open source mobile robot designed in the Tekkotsu Lab at Carnegie Mellon University in collaboration with RoPro Design, Inc. The Calliope5SP model features an iRobot Create base, an ASUS netbook, a 5-degree of freedom arm with a gripper with two independently controllable fingers, and a Sony PlayStation Eye camera and Robotis AX-S1 IR rangefinder on a pan/tilt mount. We use chess as a test of Calliope’s abilities. Since Calliope is a mobile platform we consider how problems in vision and localization directly impact the performance of manipulation. Calliope’s arm is too short to reach across the entire chessboard. The robot must therefore navigate to a location that provides the best position to access the pieces it wants to move. The robot proved capable of performing small-scale manipulation tasks that require careful positioning.

Analyzing international political behavior based on similar precedent circumstances is one of the basic techniques that policymakers use to monitor and assess current situations. Our goal is to investigate how to analyze geopolitical conflicts as sequences of events and to determine what probabilistic models are suitable to perform these analyses. In this paper, we evaluate the performance of N-grams models on the problem of forecasting political conflicts from sequences of events. For the current phase of the project, we focused on event data collected from the Balkans war in the 1990's. Our experimental results indicate that N-gram models have impressive results when applied to this data set, with accuracies above 90\% for most configurations.

Concept maps are frequently used in K-12 educational settings. The purpose of this study is to determine whether students’ performance on interactive concept map tasks in Guru, an intelligent tutoring system, is related to immediate and delayed learning outcomes. Guru is a dialogue-based system for high-school biology that intersperses concept map tasks within the tutorial dialogue. Results indicated that when students first attempt to complete concept maps, time spent on the maps may be a good indicator of their understanding, whereas the errors they make on their second attempts with the maps may be an indicator of the knowledge they are lacking.  This pattern of results was observed for one cycle of testing, but not replicated in a second cycle. Differences in the findings for the two testing cycles are most likely due to topic variations.

In this paper, we propose a model for semantic clustering of entities extracted from a text, and we apply it to a Proper Noun classification task.This model is based on a new method to compute the similarity between the entities.Indeed, the classical way of calculating similarity is to build a feature vector or Bag-of-Features for each entity and then use classical similarity functions like Cosine.In practice, the features are contextual, such as words around the different occurrences of each entity. Here, we propose to use an alternative representation for entities, called Bag-of-Vectors, or Bag-of-Bags-of-Features.In this new model, each entity is not defined as a unique vector but as a set of vectors, in which each vector is built based on the contextual features of one occurrence of the entity.In order to use Bag-of-Vectors for clustering, we introduce new versions of classical similarity functions such as Cosine and Scalar Products. Experimentally, we show that the Bag-of-Vectors representation always improve the clustering results compared to classical Bag-of-Features representations.

Argumentation is a natural meaning of reasoning in the daily life, and has also become a highly interested topic of knowledge representation in the past few years. In this paper, we will use the phrase "two-sided argumentation" for a type of formalization for our real world debate: an issue with a pro-side supports it and a con-side opposes it. Then, we will point out that, when we use the term "argumentation," we in fact mean a binary concept: a method of reasoning, and a type of negotiation. For both case, we will consider the semantics: argumentative models for the former, argumentation games for the latter. We will also give out some results about the relationship between them.

Several authors analyzed propositional attitudes ( wish , fear , regret , glad ) by integrating their epistemic and deontic components. This paper extends previous work done by the author and presents a logical calculus inspired by Possibility Theory, a non-compositional version of fuzzy logic.

In the Silver Anniversary year of FLAIRS, in an effort to promote discussion of emerging ideas and work in order to encourage and help guide researchers, especially new researchers, the program committee added the poster abstract submission category. This allows researchers to present a full poster in the conference poster session and receive that critical, work-shaping feedback that helps guide good work into great work.

Social influence has no small effect on the preferences and behavior of agents in a social space. Contrary to rationality, we sometimes compromise our own needs for those of others. Thus, social influence has important implications in agent cognitive modeling for multi-objective decision-making problems. Namely, where these activities occur within a social context, the intentional preferences or utility of an agent may be subsumed, to a greater or lesser degree, by the influences of other agents. In this paper, a socially-aware model predictive controller is proposed using a social influence network theory and applied to a HVAC control problem. It transforms individual agent utility to socially-influenced utility reflecting interagent influences due to their existing relationships.

The regularization path of the Lasso can be shown to be piecewise linear, making it possible to "follow" and explicitly compute the entire path. We analyze in this paper this popular strategy, and prove that its worst case complexity is exponential in the number of variables. We then oppose this pessimistic result to an (optimistic) approximate analysis: We show that an approximate path with at most O(1/sqrt(epsilon)) linear segments can always be obtained, where every point on the path is guaranteed to be optimal up to a relative epsilon-duality gap. We complete our theoretical analysis with a practical algorithm to compute these approximate paths.

In this thesis I develop a variety of techniques to train, evaluate, and sample from intractable and high dimensional probabilistic models. Abstract exceeds arXiv space limitations -- see PDF.