Using the already validated Coh-Metrix tool, this study examines whether there are significant linguistic and discourse differences between biomedical abstracts for American and Korean English. Also, the current study accounts for variation among journals’ countries of origin, distinguishing between biomedical journals published in the United States from biomedical journals published in South Korea. The significance of these studies regards the growing number of second language (L2) biomedical researchers attempting to publish their research in national and international English-language journals, but who find themselves locked out of the discussion because of differences in linguistic and discourse conventions. The present study aims to provide a more thorough and quantitative understanding of the prototypical linguistic components in biomedical rhetoric, and to suggest how word-, sentence-, and discourse-level structures can be researched, taught, and developed into materials. This improved understanding is expected to provide a powerful apparatus for the promotion of L2 English writers in the biomedical field.

In this paper, we propose a universal solution to web search and web browsing on handheld devices for visually impaired people. For this purpose, we propose (1) to automatically cluster web page results and (2) to summarize all the information in web pages so that speech-to-speech interaction is used efficiently to access information.

A general practice in the research of metaphor has been to investigate its behavior and function in different contexts. This current study aims to investigate the notion that verbs possess a metaphor-making potential, this being an initiatory context-free experiment with metaphor. The goal of this paper is to carry out an in-depth case study of a group of English core verbs using WordNet and SUMO ontology. In order to operationalize the measurement of an English verb’s metaphor making potential, a new algorithm has been developed, and a program made to realize the computation. At last, it has been observed that higher frequency verbs generally possess greater metaphor making potential; while a verb’s metaphor making potential on the other hand is also strongly influenced by its functional category.

The rapid pace of development in natural language processing fields such as textual studies, speech recognition, speech production, text mining, and data mining (to name but a few) has led to an ever growing interest in tools able to understand, assess, organize, categorize, and extract information from natural language sources. These sources include materials gathered from libraries, the internet, natural language conversation, human-computer interaction, corpora, and any other source from which language can be gathered and analyzed. However, while excellent research continues to develop tools capable of making such analysis possible, some research must be dedicated to the applications of this technology, often applications above and beyond the original intent of the research. The FLAIRS special track on Applied Natural Language Processing (ANLP) is a forum for such research where those working in natural language processing, computational linguistics, applied linguistics, and related areas can distribute, disseminate, and discuss their findings, feelings, and future directions. Some of the many areas emphasized by the ANLP track to include for contributions include (but are not limited to) multilingual processing, learning environments, multimodal communication, bioNLP, spam filtering, language acquisition (first and second), textual assessment, language varieties, materials development, generic classification, educational applications, information retrieval, speech processing, machine learning, knowledge representations, English for specific purposes, textual assessment indices, coreference resolution, word sense disambiguation, dialogue management and systems, language generation, language models, ontologies, and reasoning.

This paper proposes a new approach to improve domain independent heuristic state space search planners for classical planning by tuning the search heuristics using macro actions of length two extracted from sample plans. This idea is implemented in the planner AltAlt and the new planner Macro-AltAlt is tested on the domains introduced for the learning track of the International Planning Competition (IPC-2008). The performance of Macro-AltAlt measured by the length of the plan found and the number of states explored to find the plan is compared with that of AltAlt.

Route robustness is therefore a Vehicle route planning is a popular application of AI automated measure against the risk that the solution may not be executed planning methods. In numerous applications it is according to the a priori plan. The main idea behind supported with GPS navigation. Based on a generalized the concept of a robust plan is that such a plan should consist shortest-path approach it uses a directed graph as the search of numerous alternative plans, represented in a concise way, domain and edge weights set to match the required optimality and enable switching from the plan currently being executed criteria. Moreover, various additional constraints and to a new one as often as may become necessary. The degree heuristic information can be explored. (Nau, Ghallab, and of robustness is a qualitative factor referring to numerous Traverso 2004)

Planning problems deal with finding a sequence of actions that transfer the initial state of the world into a desired state. Frequently such problems are solved by dedicated algorithms but there exist planners based on translating the planning problem into a different formalism such as constraint satisfaction or Boolean satisfiability and using a general solver for this formalism. The paper describes how to enhance existing constraint models of planning problems by using techniques such as symmetry breaking (dominance rules), singleton consistency, and lifting.

A problem of path planning for multiple robots is addressed in this paper. A specific case of the problem with so called theta-like environment is studied. This case of the problem represent structurally the simplest solvable case and an eventual solving method for this case can be used as a building block for more general solving procedures. We propose a solving method for multi-robot path planning in theta-like environments that constructs a solution by composing it of the pre-calculated shortest solutions of certain sub-problems. This approach prefers short overall solutions. Moreover, we propose a new algorithm for pre-calculating shortest solutions of sub-problems - it is in fact an improvement of the IDA* algorithm. An experimental comparison of our methods with existing techniques is presented in the paper.

In version 2.0, IBM ILOG CP Optimizer has been extended by the introduction of scheduling support based on the concept of optional interval variables. This paper formally describes the new modeling language features available to the users of CP Optimizer for resource-based scheduling. We show that the new language is flexible enough to model problems never before addressed by CP scheduling engines, as well as naturally describing classical scheduling problems found in the literature. This modeling power is based on a small number of general concepts such as intervals, sequences and functions. This makes the modeling language simple, clear and easy to learn, while maintaining the high-level structural aspects of the scheduling model.

Generating a schedule for a professional sports league is an extremely demanding task. Good schedules have many benefits for the league, for example higher incomes, lower costs and more interesting and fairer seasons. This paper presents a successful solution method to schedule the Finnish 1st division ice hockey league. The solution method is an improved version of the method used to schedule the Finnish major ice hockey league. The method is a combination of local search heuristics and evolutionary methods. An analyzer for the quality of the produced schedules will be introduced. Finally, we propose a set of test instances that we hope the researchers of the sports scheduling problems would adopt. The generated schedule for the Finnish 1st division ice hockey league is currently in use for the season 2008-2009.