and dynamic situations. A number of possible application areas are briefly mentioned. 1. Introduction Qualitative Reasoning (QR) has now become a mature subfield of AI as its tenth annual international workshop, several books (e.g. (Weld and De Kleer 1990, Faltings and Struss 1992)) and a wealth

This book contains the papers accepted for presentation at the 2011 edition of the Adaptive and Learning Agents (ALA) workshop. ALA is the result of the merger of the ALAMAS and ALAg workshops. ALAMAS was an annual European work-shop on Adaptive and Learning Agents and Multi-Agent Systems, held

The factor price equalization theorem has inspired many theoretical and empirical papers on the relationship between trade and factor mobility. This paper uses a gravity equation to empirically test the effect of bilateral trade on a subset of international permanent legal migration from 175

A visual language for temporal specifications based on Spider diagrams

Abstract: We will revisit the categorical notion of cospan decompositions of graphs and compare it to the well-known notions of path decomposition and tree decompo-sition from graph theory. More specifically, we will define several types of cospan decompositions with appropriate width measures and show that these width measures coincide with pathwidth and treewidth. Such graph decompositions of small width are used to efficiently decide graph properties, for instance via graph automata.

Hydro-ecological systems comprise complex interaction among physical, chemical, and biological processes. Compositional modeling, i. e. creating a system's behavior model by aggregating models of its constituents, is crucial for making the modeling task feasible. However, the composed model is often too fine-grained for a particular task, for instance, in containing too many irrelevant intermediate variables or obscuring the basic interdependencies. For this reason, the model may have to be transformed and simplified.

PROCEEDINGS A flexible ancestral genome reconstruction method based on gapped adjacencies

Background: With the cost reduction of the next-generation sequencing (NGS) technologies, genomics has provided us with an unprecedented opportunity to understand fundamental questions in biology and elucidate human diseases. De novo genome assembly is one of the most important steps to reconstruct the sequenced genome. However, most de novo assemblers require enormous amount of computational resource, which is not accessible for most research groups and medical personnel. Results: We have developed a novel de novo assembly framework, called Tiger, which adapts to available computing resources by iteratively decomposing the assembly problem into sub-problems. Our method is also flexible to embed different assemblers for various types of target genomes. Using the sequence data from a human chromosome, our results show that Tiger can achieve much better NG50s, better genome coverage, and slightly higher errors, as compared to Velvet and SOAPdenovo, using modest amount of memory that are available in commodity computers today. Conclusions: Most state-of-the-art assemblers that can achieve relatively high assembly quality need excessive amount of computing resource (in particular, memory) that is not available to most researchers to achieve high quality results. Tiger provides the only known viable path to utilize NGS de novo assemblers that require more

is distributed among autonomous agents. This distributed model promises to more closely match the assumptions underlying an increasingly diverse range of real world multiagent problems. This DCR workshop series addresses modeling, solutions and applications of Distributed Constraint Reasoning, including both

influence of the tenth revision of the International Statistical Classification of ncies of annual mortality rates, corrected and uncorrected to the ICD-9. e c 0 t ies series using joinpoint regression.