The paper concentrates on obtaining hidden relationships among individual clauses of complex sentences from the Prague Dependency Treebank. The treebank contains only an information about mutual relationships among individual tokens (words, punctuation marks), not about more complex units (clauses). For the experiments with clauses and their parts (segments) it was therefore necessary to develop an automatic method transforming the original annotation into a scheme describing the syntactic relationships between clauses. The task was complicated by a certain degree of inconsistency in original annotation with regard to clauses and their structure. The paper describes the algorithm of deriving clause-related information from the existing annotation and its evaluation.

Emotions are a ubiquitous component of motivation and learning. We have developed an affective behavior model for intelligent tutoring systems that considers both the affective and knowledge state of the student to generate tutorial actions. The affective behavior model (ABM) was designed based on teachers' expertise obtained through interviews. It relies on a dynamic decision network with a utility measure on both student learning and affect to generate tutorial actions aimed at balancing the two. We have integrated and evaluated the ABM in an educational game to learn number factorization. We carried out a controlled user study to evaluate the impact of the affective model on learning. The results show that for the younger students there is a significant improvement on learning when the affective behavior model is incorporated.

Conference and special track committees responsible for the 2009 FLAIRS conference.

Manual knowledge acquisition is usually a costly and time-consuming process. Automatic knowledge acquisition methods can then significantly support the knowledge engineer. In this paper, we propose an approach for rapid knowledge capture. The methodology is based on textual subgroup mining in order to discover dependencies for rule prototyping.

The main task of part-of-speech (PoS) tagging is to assign the appropriate morphosyntactic category to each word in a sentence. A combination of different PoS taggers usually results in higher tagging accuracy than obtained by the use of only a single tagger. We present a new language and tagset independent system, CombiTagger, which combines automatically the output of several taggers. The system, which is open source, provides algorithms for simple and weighted voting, but it is extensible so that other combination algorithms can be added easily. We demonstrate the functionality of CombiTagger by using it to develop and evaluate combined taggers for Icelandic. The most accurate individual tagger obtains an accuracy of 91.83%. CombiTagger achieves 93.09%-93.41% accuracy by combining the output of five or six taggers using simple and weighted voting.

This paper introduces an information theoretic approach to verification of modular causal probabilistic models. We assume systems which are gradually extended by adding new functional modules, each having a limited domain knowledge captured by a local Bayesian network. Different modules originate from independent design processes. We assume that the local models are correct, which, however does not guarantee globally coherent inference in composed systems. The introduced method supports discovery of significant inter module dependencies which are ignored in the assembled Bayesian network.

Generalized cases are cases that cover a subspace rather than a point in the problem-solution space. Attribute dependent generalized cases are a subclass of generalized cases, which cause a high computational complexity during similarity assessment. We present a new approach for an efficient index-based retrieval of such generalized cases by an improved kd-tree approach. The experimental evaluation demonstrates a significant improvement in retrieval efficiency compared to previous methods.

In this paper certain knowledge and software engineering methods integration issues are discussed. The principal idea is to consider an effective design and implementation framework for rule design with UML, and implementation with Java. The solution proposed in the paper consists of using a custom knowledge engineering design method for rules in the design stage. The rule base is then transformed to UML behavioral diagrams, which can be considered a visual encoding. The rule implementation involves the serialization to Java language using classes representing the decision tables grouping rules sharing the same attributes.

We present an approach to patent claim simplification which segments claim sentences into clausal discourse units, transforms them into complete sentences, establishes coreference relations and builds a discourse structure between discourse units. The four stages are necessary to allow for the syntactic analysis of otherwise unparsable claim sentences and their regeneration using discourse structure and coreference relations in order to ensure the production of a cohesive and coherent paraphrase/summary.

Computer Science has a bad reputation among non-CS majors. This paper describes three assignments from a gentle introduction to programming course for non-majors that uses robots and simple game programming as a hook to get students interested in the subject. In each of the assignments presented, what might be considered a trivial twist to an instructor was a key factor in making an otherwise standard project into something that is more engaging.