Different studies provide evidence that the computational psycholinguistic algorithm called Latent Semantic Analysis (LSA) allows measuring local and global coherence in texts similarly to human evaluation (Foltz, Kintsch, Landauer 1998; McNamara, Cai & Louwerse 2007; McCarthy, Briner, Rus, & McNamara, 2007; McNamara, Louwerse & Jeuniaux 2009; Louwerse, McCarthy & Graesser 2010). The texts used in all these studies are written in English and correspond to scientific and literary texts. In Spanish, there are some studies using LSA that measure the semantic similarity between texts in automatic summary assessment (Pérez, Alfonseca, Rodríguez, Gliozzo, Strapparava & Magnini 2005; León, Olmos, Escudero, Cañas & Salmerón 2006; Venegas 2007, 2009, 2011); however, automatic measurement of coherence in Spanish has not yet been sufficiently investigated. The present study aimed at identifying a global and local coherence profile in a corpus of speeches in Spanish of three Latin American Heads-of-States (Perón, Castro and Pinochet), using Latent Semantic Analysis. Local coherence is calculated through the measurement of implicit semantic similarity between adjacent sentences and global coherence through the measurement of the similarity among the semantic content of the paragraphs. The corpus under analysis corresponds to a sample of 107 speeches. The semantic space was built using a multi-register corpus and it is available through the “Interface for the measurement of lexical-semantic similarity” in the El Grial interface (www.elgrial.cl). Results showed a systematic difference between the speeches of the Heads-of-State in terms of both local and global coherence. The Bonferroni analysis established an effect that distinguishes Perón’s speeches from Pinochet’s and Castro’s speeches. This results show that Perón’s speeches are more topically related than the other leaders’, probably due to a discourse strategy to persuade voters. The identification of a profile of coherence might be relevant to predict cues of government discourse styles.

Current approaches for word-sense disambiguation (WSD) try to relate the senses of the target words by optimizing a score for each sense in the context of all other words' senses. However, by scoring each sense separately, they often fail to optimize the relations between the resulting senses. We address this problem by proposing a HITS-inspired method that attempts to optimize the score for the entire sense combination rather than one-word-at-a-time. We also exploit word-sense disambiguation via topic-models, when retrieving senses from heterogeneous sense inventories. Although this entails the relaxation of several assumptions behind current WSD algorithms, we show that our proposed method E-WSD achieves better results than current state-of-the-art approaches, without the need for additional background knowledge.

In this article, a multipopulation Cultural Algorithm (MP-CA) is proposed to solve Job Shop Scheduling Problems (JSSP). The idea of using multiple populations in a Cultural Algorithm is implemented for the first time in JSSP. The proposed method divides the whole population into a number of sub-populations. On each sub-population, a local CA is applied which includes its own population space as well as belief space. The local CAs use Evolutionary Programming (EP) to evolve their populations, and moreover they incorporate a local search approach to speed up their convergence rates. The local CAs communicate with each other using knowledge migration which is a novel concept in CA. The proposed method extracts two types of knowledge including normative and topographic knowledge and uses the extracted knowledge to guide the evolutionary process to generate better solutions. The MP-CA is evaluated using a well-known benchmark. The results show that the MP-CA outperforms some of the existing methods by offering better solutions as well as better convergence rates, and produces competitive solutions when compared to the state-of-the-art methods used to deal with JSSPs.

Grimes and Warschauer (2010) describe two accuracy (Warschauer & Ware, 2006), there have been kinds of systems: automated essay scoring (AES) and relatively few evaluations of student improvement (e.g., automated writing evaluation (AWE). AES systems strive Kellogg, Whiteford, & Quinlan, 2010) or the role of to assign accurate and reliable scores to essays or specific feedback (e.g., Roscoe, Varner, Cai, Weston, Crossley, & writing features (e.g., mechanics). Scores are generated McNamara, 2011). Hence, in this paper, we explore and using various artificial intelligence (AI) methods, including describe a method for developing pedagogically-guided statistical modeling, natural language processing (NLP), algorithms that guide formative feedback in an intelligent and Latent Semantic Analysis (LSA) (Shermis & Burstein, tutor system (ITS) for writing.

One of the challenges for artificial agents is managing the complexity of their environment as they learn tasks especially if they are grounded in the physical world. A scalable solution to address the state explosion problem is thus a prerequisite of physically grounded, agentbased systems. This paper presents a framework for developing grounded, symbolic representations aimed at scaling subsequent learning as well as forming a basis for symbolic reasoning. These symbols partition the environment so the agent need only consider an abstract view of the original space when learning new tasks and allows it to apply acquired symbols to novel situations.

The paper investigates a phenomenon of free word order through the analysis by reduction. It exploits its formal background and data types and studies the word order freedom by means of the minimal number of word order shifts (word order changes preserving syntactic correctness, individual word forms, their morphological characteristics and/or their surface dependency relations). The investigation focuses upon an interplay of two phenomena related to word order: (non-)projectivity of a sentence and number of word order shifts within the analysis by reduction. This interplay is exemplified on a sample of Czech sentences with clitics.

Computational indices related to n-gram production were developed in order to assess the potential for n-gram indices to predict human scores of essay quality. A regression analyses was conducted on a corpus of 313 argumentative essays. The analyses demonstrated that a variety of n-gram indices were highly correlated to essay quality, but were also highly correlated to the number of words in the text (although many of the n-gram indices were stronger predictors of writing quality than the number of words in a text). A second regression analysis was conducted on a corpus of 88 argumentative essays that were controlled for text length differences. This analysis demonstrated that n-gram indices were still strong predictors of essay quality when text length was not a factor.

In recent years there has been a significant decline in the number of college students choosing majors in computer science or technology related fields. Although this trend is beginning to turn around at the undergraduate level, there remains disparity in the number of under-represented minority students who earn graduate degrees as compared to majority students. Additionally, within the United States, there is an achievement gap between under-represented minority students and majority students at a time when underrepresented groups are becoming an increasing proportion of the national labor force. This reluctance to study Science, Technology, Engineering, and Mathematics (STEM) disciplines must be confronted and changed if the United States is to maintain a competitive position within the global market. Effective use of learning technologies is vital to solving many of our current STEM learning challenges. Robotics is a growing research area in computer science education. We use robotics as a technology tool captivate and engage students in research in robotics.

Event Management is one of the most lucrative and growing professions today. At present event management is done by humans. With the growing demand for managing large events, there is a rising demand for building intelligent systems to manage events. The so called event management systems today are only data processing systems that are unable to carry out decision making task on their own. Event management systems today do not consider emergencies and risk assessment as part of their execution. In this paper, we present an approach for representing events and monitor their execution. In particular, discuss the exceptions that can occur during an event execution and how they can be managed using event management rules. We present strategies for writing management rules that are used to handle problematic events and to build a DAG based programming system for event management. Our simulation results show how the performance of our event management system performs with the exception management rules.

Many exponentially-hard problems can be solved by searching through a space of states to determine a sequence of steps constituting a solution. Algorithms that produce optimal solutions (e.g., shortest path) generally require greater computational resources (e.g., time) than their sub-optimal counterparts. Consequently, many optimal algorithms cannot produce any usable solution when the amount of time available is limited or hard to predict in advance. Anytime algorithms address this problem by initially finding a suboptimal solution very quickly and then generating incrementally better solutions with additional time, effectively providing the best solution generated so far anytime it is required. In this research, we generate initial solutions cheaply using a fast search algorithm. We then improve this low-quality solution by identifying subsequences of steps that appear, based on heuristic estimates, to be considerably longer than necessary. Finally, we perform a more expensive search between the endpoints of each subsequence to find a shorter connecting path. We will show that this improves the overall solution incrementally over time while always having a valid solution to return whenever time runs out. We present results that demonstrate in several problem domains that AIRS (Anytime Iterative Refinement of a Solution) rivals other widely used and recognized anytime algorithms and also produces results comparable to other popular (but not anytime) heuristic algorithms such as Bidirectional A* search.