In Statistics-Based Summarization Step One: Sentence Compression, Knight and Marcu (Knight and Marcu, 2000) (K&M) present a noisy-channel model for sentence compression. The main difficulty in using this method is the lack of data; Knight and Marcu use a corpus of 1035 training sentences. More data is not easily available, so in addition to improving the original K&M noisy-channel model, we cre...

Distributed applications are hard to understand, build, and evolve. The need for decoupling, flexibility, and heterogeneity in distributed collaboration tools present particular problems; for such applications, having the right abstractions and primitives for distributed communication becomes even more important. We present Distributed Knight, an extension to the Knight tool, for distributed, c...

In the paper we analyze 26 communities across the United States with the objective to understand what attaches people to their community and how this attachment differs among communities. How different are attached people from unattached? What attaches people to their community? How different are the communities? What are key drivers behind emotional attachment? To address these questions, grap...

Seven species of Hishimonus Ishihara are recorded in Thailand, four of which were previously recorded from neighbouring countries and three new species described herein: Hishimonus pallidus sp. nov., H. diffractus sp. nov. and H. gillespiei sp. nov. The other four species are H. concavus Knight, previously known from the Philippines, H. subtilis Knight recorded from Singapore, H. aberrans Knigh...

We generalize a theorem of W. Jockusch and J. Propp on quartered Aztec diamonds by enumerating the tilings of quartered Aztec rectangles. We use subgraph replacement method to transform the dual graph of a quartered Aztec rectangle to the dual graph of a quartered lozenge hexagon, and then use Lindström-GesselViennot methodology to find the number of tilings of a quartered lozenge hexagon.

In this paper we prove the knight move theorem for the chromatic graph cohomologies with rational coefficients introduced by L. HelmeGuizon and Y. Rong. Namely, for a connected graph Γ with n vertices the only non-trivial cohomology groups H(Γ), H(Γ) come in isomorphic pairs: H(Γ) = H(Γ) for i > 0 if Γ is non-bipartite, and for i > 0 if Γ is bipartite. As a corollary, the ranks of the cohomolog...

We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we obtain solutions to open problems 1, 2, and 10 in James Propp’s list of problems on enumeration of matchings [22].

The Renodaeus group, a monophyletic assemblage of genera within the New World orthotyline tribe Ceratocapsini, comprising eight genera, including four new ones, is defined; and 48 species are treated, including 26 described as new and 12 transferred from Ceratocapsus Reuter as new combinations. Ceratocapsidea gen. n. is described to accommodate the new species Ceratocapsideabahamaensis sp. n., ...