Integration of Host Plant Resistance and Insecticides in the Control of \u3ci\u3eNephotettix virescens\u3c/i\u3e (Homoptera: Cicadelli-dae), a Vector of Rice Tungro Virus

Combined effects of levels of vector resistance and insecticide application in control of rice tungro virus (RTV) were determined in three field tests. Cultivar “IR28,” with high levels of resistance to the vector, Nephotettix virescens (Distant), had low RTV infection in all treatments including the untreated check. In moderately resistant “IR36,” RTV decreased with an increase in level of insecticide but did not decrease to a level equaling the untreated “IR28.” The N. virescens-susceptible cultivar “IR22” had extremely high levels of RTV infection at all insecticide levels. Economic analysis indicated that gross profit and net gain were highest in the N. virescens-resistant “IR28,” intermediate in moderately resistant “IR36,” and lowest in susceptible “IR22.

Descriptional Succinctness of Some Grammatical Formalisms for Natrual Language

We investigate the problem of describing languages compactly in different grammatical formalisms for natural languages. In particular, the problem is studied from the point of view of some newly developed natural language formalisms like linear control grammars (LCGs) and tree adjoining grammars (TAGs); these formalisms not only generate non-context-free languages that capture a wide variety of syntactic phenomena found in natural language, but also have computationally efficient polynomial time recognition algorithms. We prove that the formalisms enjoy the property of unbounded succinctness over the family of context-grammars, i.e. they are, in general, able to provide more compact representations of natural languages as compared to standard context-free grammars

Sublinear Parallel Time Recognition of Tree Adjoining Language

A parallel algorithm is presented for recognizing the class of languages generated by tree adjoining grammars, a tree rewriting system which has applications in computational Linguistics. This class of languages is known to properly include all context-free languages; for example, the non-context-free sets {anbncn} and {ww) are in this class. It is shown that the recognition problem for tree adjoining languages can be solved by a concurrent-read, exclusive-write parallel random-access machine (CREW PRAM) in 0 (log2(n)) time using polynomially many processors. This extends a previous result for context-free languages

On the arithmetic sums of Cantor sets

Let C_\la and C_\ga be two affine Cantor sets in $\mathbb{R}$ with similarity dimensions d_\la and d_\ga, respectively. We define an analog of the Bandt-Graf condition for self-similar systems and use it to give necessary and sufficient conditions for having \Ha^{d_\la+d_\ga}(C_\la + C_\ga)>0 where C_\la + C_\ga denotes the arithmetic sum of the sets. We use this result to analyze the orthogonal projection properties of sets of the form C_\la \times C_\ga. We prove that for Lebesgue almost all directions $\theta$ for which the projection is not one-to-one, the projection has zero (d_\la + d_\ga)-dimensional Hausdorff measure. We demonstrate the results on the case when C_\la and C_\ga are the middle-(1-2\la) and middle-(1-2\ga) sets

Parallel Kalman Filtering on the Connection Machine

A parallel algorithm for square root Kalman filtering is developed and implemented on the Connection Machine (CM). The algorithm makes efficient use of parallel prefix or scan operations which are primitive instructions in the CM. Performance measurements show that the CM filter runs in time linear in the state vector size. This represents a great improvement over serial implementations which run in cubic time. A specific multiple target tracking application is also considered, in which several targets (e.g., satellites, aircrafts and missiles) are to be tracked simultaneously, each requiring one or more filters. A parallel algorithm is developed which, for fixed size filters, runs in constant time, independent of the number of filters simultaneously processed