One goal of any genome project is the elucidation of the primary sequence of DNA contained within a given species. While the availability of the primary sequence itself is valuable, it does not reach its full potential until it has been annotated. Generally dened, annotation is descriptive information or commentary added to text, in this case genomic sequence. Without a mechanism for collecting, recording, and disseminating community-based annotation, a valuable source of information is severely diminished. In this report I outline the design and implementation of a Distributed Annotation System (DAS). DAS allows sequence annotations to be decentralized among multiple third-party annotators and integrated on an as-needed basis by client-side software. A single server, designated the \reference server," provides essential structural information about the genome: the physical map which relates one sequence to another, the DNA sequence for each entry, and the authorship information. Multiple sites then act as third-party \annotation servers." Using a web browser-like client application, researchers can interrogate one or more annotation servers to retrieve features in a region of interest. The servers return the results using a standard data format, allowing the annotation browser to integrate the information and display a graphical representation of the data. When an annotation is particularly interesting, they can easily return to the originating database for additional information. In short, DAS provides an indexing mechanism between sequence databases. 1 Contents 1

Context sensitive rewrite rules have been widely used in several areas of natural language processing, including syntax, morphology, phonology and speech processing.

The prohibitive cost of assigning indices to textual cases is a major obstacle for the practical use of AI and Law systems supporting reasoning and arguing with cases. While progress has been made toward extracting certain facts from well-structured case texts or classifying case abstracts under Key Number concepts, these methods still do not suffice for the complexity of indexing concepts in CBR systems. In this paper, we lay out how a better example representation may facilitate classification-based indexing. Our hypotheses are that (1) abstracting from the individual actors and events in cases, (2) capturing actions in multi-word features, and (3) recognizing negation, can lead to a better representation of legal case texts for automatic indexing. We discuss how to implement these techniques with state-ofthe -art NLP tools. Preliminary experimental results suggest that a combination of domain-specific knowledge and information extraction techniques can be used to generalize from the examples and derive more powerful features.

Collecting useful information along the information Autobahn is a fun window shopping activity which rapidly becomes frustrating. As the technology offers a broader logical connectivity, enables schemes

...................................................... xiii 1 Introduction .................................................. 1 1. Divide-and-Conquer and the Memory Hierarchy . . . . . . . . . . . 2 2. Overview of Architecture-Cognizant Divide-and Conquer . . . . . . 4 3. Overview of Napoleon . . . . . . . . . . . . . . . . . . . . . . . . . 5 4. What You Can Expect . . . . . . . . . . . . . . . . . . . . . . . . . 6 5. Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1. Divide-and-Conquer Algorithms for Performance Programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2. The Importance of Architecture-Cognizance . . . . . . . . . 7 3. Complexity of Determining VariantPolicy . . . . . . . . . . 7 4. A Framework and System for Divide-and-Conquer Implementations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5. The Fastest Portable FFT Algorithm . . . . . . . . . . . . . 8 6. Outline of Thesis . . . . . . . . . . . . . . . . ....

AI has long been applied to the problem of predicting financial markets.

Effects of three different morphological methods- lemmatization, stemming and inflectional stem generation- for Finnish are compared in a probabilistic IR environment (INQUERY). Evaluation is done using a four point relevance scale which is partitioned differently in different test settings. Results show that inflectional stem generation which has not been used much in IR, compares well with lemmatization in a best-match IR environment. Differences in performance between inflectional stem generation and lemmatization are small and they are not statistically significant in most of the tested settings. It is also shown that hitherto a rather neglected method of morphological processing for Finnish, stemming, performs reasonably well although the stemmer used – a Porter stemmer implementation – is far from optimal for a morphologically complex language like Finnish. In another series of tests, the effects of 1 compound splitting and derivational expansion of queries are tested.

This tutorial assumes no previous knowledge of scripting or programming, but progresses rapidly toward an intermediate/advanced level of instruction... all the while sneaking in little snippets of UNIX ® wisdom and lore. It serves as a textbook, a manual for self−study, and a reference and source of knowledge on shell scripting techniques. The exercises and heavily−commented examples invite active reader participation, under the premise that the only way to really learn scripting is to write scripts. This book is suitable for classroom use as a general introduction to programming concepts. The latest update of this document, as an archived, bzip2−ed "tarball " including both the SGML source and rendered HTML, may be downloaded from the author's home site. A pdf version is also available. See the change log for a revision history.

: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ix 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2 The Purdue University Network Computing Hubs : : : : : : : : : : : : : : 3 2.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.2 The PUNCH Infrastructure : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 Summary : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 3 The Network Desktop Architecture : : : : : : : : : : : : : : : : : : : : : : 7 3.1 Run-Time System : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3.2 Tool Specification : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3.3 Summary : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 4 Access Management : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13 4.1 Introduction : : :...

Over the past four years, significant effort has been expended to create and implement several web-based software tools for the 2m x 3m Low-Speed Wind Tunnel at the Aerodynamics Laboratory of the Institute for Aerospace Research, National Research Council of Canada. These tools have been implemented through the use of three large open-source projects: the Perl programming language, the Apache web server, and the Linux operating system. Five individual software systems have been created: plotting; configuration file editing; data file viewing; event logging; and a dynamic data display. This paper briefly describes the reasoning behind the decisions to use Perl and the World Wide Web, as well as the function of each of the five tools and shows examples of the web pages used to interact with them. 1.1 Background 1