Structured elements, such as manually assigned keywords or key-phrases in scientific collections, are pervasive in digital libraries. Special dictionaries or thesauri for the meta-information are not always available. Our strategy is to compute the similarity of keywords based on their occurrence in the collection. The resulting keyword space is brought to bear on a variety of tasks. Combined w...

Ahlswede, Khachatrian, Mauduit and A. Sárközy introduced the notion family-complexity of families of binary sequences. They estimated the family-complexity of a large family related to Legendre symbol introduced by Goubin, Mauduit and Sárközy. Here their result is improved, and apart from the constant factor the best lower bound is given for the family-complexity. 2000 AMS Mathematics Subject C...

Our QA system consists of two different components. One is for the factoid and list questions, and the other is for the other questions. The components are processed individually, and each result is combined into our submitted run. For the factoid questions, we have tried to find answers by proximity-based named entity search. Given a question, fine-grained named entities for candidate answers ...

Large text corpora with news, customer mail and reports, or Web 2.0 contributions offer a great potential for enhancing business-intelligence applications. We propose a framework for performing text analytics on such data in a versatile, efficient, and scalable manner. While much of the prior literature has emphasized mining keywords or tags in blogs or social-tagging communities, we emphasize ...

Through the years, the burn injury has been described using a variety of labels. These labels have ranged from one word terms to phrases including degrees of injury or more descriptive terms. A search was conducted relying on a common general internet search engine. After multiple searches varying the keywords, the top 100 searches identified the most prevalent terms or phrases, ranging from th...

In this paper we show how a pure denotative (nonprocedural) language based on the λ-calculus can be provided with purely denotative analogs of the various constructs—such as while loops, blocks, case statements and the like—of conventional imperative structured programming languages. They can be simulated quite adequately using only two simple tools: phrases, which are compound expressions not ...