This study investigates Serious Games (SG) to assess motivational factors appropriate to an Intelligent Tutoring System (ITS). An ITS can benefit from SG’ elements that can highly support learners’ motivation. Thus, identifying and assessing the effect that these factors may have on learners is a crucial step before attempting to integrate them into an ITS. We designed an experiment using a Serious Game and combined both the theoretical ARCS model of motivation and empirical physiological sensors (heart rate, skin conductance and EEG) to assess the effects of motivational factors on learners. We then identified physiological patterns correlated with one motivational factor in a Serious Game (Alarm triggers) associated with the Attention category of the ARCS model. The best result of three classifiers run on the physiological data has reached an accuracy of 73.8% in identifying learners’ attention level as being either above or below average. These results open the door to the possibility for an ITS to discriminate between attentive and inattentive learners.

Expressions (MWEs) (Okita et al. 2010), this may improve the overall translation. For example in EN-JP, the empirical evidences 2007; Koehn 2010) intends to handle morphologically rich suggest that we separate affix(es) and word stem(s) since it languages in the target side by integrating additional linguistic obtains better BLEU score than the case when we do not separate markup at the word level, where each type of additional them although the adequacy decreases.

In recent years, there has been considerable interest in the use of planning techniques in the area of new media. Many traditional planning notions no longer apply in the context of these applications. In particular, it can be difficult to answer the important question of what constitutes a good plan for the domain, but there is an emerging consensus that plan dynamics play an important role. As a consequence, it is important to support representation of such aspects. Our solution is to introduce a meta-level of representation that is an abstraction of the domain with respect to both time and causality, and to develop a visual representation of this in the form of a narrative arc. This visual representation can then be used in a visual programming approach to the exploration and specification of plan dynamics. In the paper we outline this approach to meta-level representation using constraints along with the visual programming interface we have developed. We illustrate the approach with examples of visual programming in the development of an interactive entertainment system based on Shakespeare's play ``The Merchant of Venice''

The aim of Belief Merging is to aggregate possibly conflicting pieces of information issued from different sources. The quality of the resulting set is usually considered in terms of a closeness criterion between the resulting belief set and the initial belief sets. The notion of distance between belief sets is thus a crucial issue when we face the merging problem. The aim of this paper is twofold: introducing a syntactical way to calculate distances and proposing the use of a distance based on prime implicants and prime implicates that considers the importance of each propositional symbol in the belief set.

We introduce a search engine and information retrieval system for providing access to opinion data. Natural language technology of generalization of syntactic parse trees is introduced as a similarity measure between subjects of textual opinions to link them on the fly. Information extraction algorithm for automatic summarization of web pages in the format of Google sponsored links is presented. We outline the usability of the implemented system, integrated opinion delivery environment (IODE).

This paper discusses a novel hybrid approach for text categorization that combines a machine learning algorithm, which provides a base model trained with a labeled corpus, with a rule-based expert system, which is used to improve the results provided by the previous classifier, by filtering false positives and dealing with false negatives. The main advantage is that the system can be easily fine-tuned by adding specific rules for those noisy or conflicting categories that have not been successfully trained. We also describe an implementation based on k-Nearest Neighbor and a simple rule language to express lists of positive, negative and relevant (multiword) terms appearing in the input text. The system is evaluated in several scenarios, including the popular Reuters-21578 news corpus for comparison to other approaches, and categorization using IPTC metadata, EUROVOC thesaurus and others. Results show that this approach achieves a precision that is comparable to top ranked methods, with the added value that it does not require a demanding human expert workload to train.

Multi-modal transportation is a logistics problem in which a set of goods have to be transported to different places, with the combination of at least two modes of transport, without a change of container for the goods. The goal of this paper is to describe TIMIPLAN, a system that solves multi-modal transportation problems in the context of a project for a big company. In this paper, we combine Linear Programming (LP) with automated planning techniques in order to obtain good quality solutions. The direct use of classical LP techniques is difficult in this domain, because of the non-linearity of the optimization function and constraints; and planning algorithms cannot deal with the entire problem due to the large number of resources involved. We propose a new hybrid algorithm, combining LP and planning to tackle the multi-modal transportation problem, exploiting the benefits of both kinds of techniques. The system also integrates an execution component that monitors the execution, keeping track of failures and replans if necessary, maintaining most of the plan in execution. We also present some experimental results that show the performance of the system.

In this paper, we show how to make a cognitive tutoring agent capable of precise causal reasoning by integrating constraints with data mining algorithms. Putting constraints on recorded interactions between the agent and learners during learning activities allows data mining algorithms to extract the causes of the learners’ problems. Subsequently, the agent uses this information to provide useful and customized explanations to learners.

We define sentence generalization and generalization diagrams as a special case of least general generalization (LGG) as applied to linguistic parse trees. Similarity measure between linguistic parse trees is developed as LGG operation on the lists of sub-trees of these trees. The diagrams introduced are representation of mapping between the syntactic generalization level and semantic generalization level. Generalization diagrams are intended as a framework to compute semantic similarity between texts relying on linguistic parse tree data. Such structured approach significantly improves text relevance assessment in a horizontal domain, where ontologies are not available

We revisit a framework for designing peer-based intelligent tutoring systems motivated by McCalla's ecological approach, where learning is facilitated by the previous experiences of peers with a corpus of learning objects. Prior research demonstrated the value of a proposed algorithm for modeling student learning and for selecting the most beneficial learning objects to present to new students. In this paper, we first adjust the validation of this approach to demonstrate its ability to cope with errors in assessing the learning of student peers. We then deepen the representation of learning objects to reflect the expected time to completion and demonstrate how this may lead to more effective selection of learning objects for students, and thus more effective learning. As part of our exploration of these new adjustments, we offer insights into how the size of learning object repositories may affect student learning, suggesting future extensions for the model and its validation.