Paterson, Stinson and Wei [2] introduced Combinatorial batch codes, which are combinatorial description of Batch code. Batch codes were first presented by Ishai, Kushilevita, Ostrovsky and Sahai [1] in STOC’04. In this paper we answer some of the questions put forward by Paterson, Stinson and Wei and give some results for the general case t > 1 which were not studied by the authors.

The paper describes a method for measuring compatibility between two levels of manual corpus annotation: shallow and deep. The proposed measures translate into a procedure for finding annotation errors at either level.

This technical report contains the text of Subhasish Mitra’s PhD thesis “Diversity Techniques for Concurrent Error Detection.” Funding: This research was supported by the Advanced Research Projects Agency under Contract No. DABT63-97-C-0024. Copyright © 2000 by Subhasish Mitra. All rights reserved, including the right to reproduce this report, or portions thereof, in any form.

The analytic self map of the unit disk D, φ is said to induce a composition operator Cφ from the Banach space X to the Banach Space Y if Cφ(f) = f ◦ φ ∈ Y for all f ∈ X . For z ∈ D and α > 0 the families of weighted Cauchy transforms Fα are defined by f(z) = ∫ T K x (z)dμ(x) where μ(x) is complex Borel measures, x belongs to the unit circle T and the kernel Kx(z) = (1 − xz) −1 . In this paper w...

* , ( )