Consider the subband coder of figure 1, consisting of k = 0, 1, ..., M − 1 channels. Each channel has an analysis filter H k (z), a synthesis filter F k (z), down/up-sampling ratio m k , and a b k bit quantizer. The input is x[n], after passing through the analysis filters it becomes x k [n], and the subband signals are x k [n]. The subband coder is maximally decimated, M −1 k=0 m k = 1. (1) As...

In this paper, we consider the problem for finding an induced cycle passing through k given vertices, which we call the induced cycle problem. The significance of finding induced cycles stems from the fact that precise characterization of perfect graphs would require structures of graphs without an odd induced cycle, and its complement. There has been huge progress in the recent years, especial...

Let P be a set of points in general position in the plane. Join all pairs of points in P with straight line segments. The number of segment-crossings in such a drawing, denoted by cr(P ), is the rectilinear crossing number of P . A halving line of P is a line passing though two points of P that divides the rest of the points of P in (almost) half. The number of halving lines of P is denoted by ...

s International, 48, 3025B, Doctoral dissertation, Yale University, 1986. HENDLER, J. 1986. Integrating marker-passing and problem-solving: A spreading-activation approach to improved choice in planning, Dissertation Abstracts International, 47, 2059B, Doctoral dissertation, Brown University. HOFSTADTER, D. R. 1995. Fluid Concepts and Creative Analogies: Computer Models of the Fundamental Mecha...

An astral configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane where every point has q straight lines passing through it and every line has k points lying on it, with precisely b q+1 2 c symmetry classes (transitivity classes) of lines and bk+1 2 c symmetry classes of points. An odd astral configuration is an astral configuration where at least one of q...

We prove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where processors fail by crashing. We prove a lower bound of [f/k] + 1 rounds of communication for solutions to k-set agreement that tolerate f failures. This bound is tight, and shows that there is an inherent tradeoff between...

Let F be a field of characteristic p > 0. Let Ω(F ) be the F vector space of n-differentials of F over F . Let K = F (g) be the function field of an irreducible polynomial g in m > 1 variables over F . We derive an explicit description of the kernel of the restriction map Ω(F ) → Ω(K). As an application in the case p = 2, we determine the kernel of the restriction map when passing from the Witt...

A b s t r a c t . Let A be a plane region which is bounded by an outer rectangle and an inner one and has r rectangular obstacles inside the region. Let k terminal pairs lie on the outer and inner rectangular boundaries. This paper presents an efficient algorithm which finds k "non-crossing" rectilinear paths in the plane region A, each connecting a terminal pair without passing through any obs...

We show that (equivariant) K-theoretic 3-point Gromov-Witten invariants of genus zero on a Grassmann variety are equal to triple intersections computed in the ordinary (equivariant) K-theory of a two-step flag manifold, thus generalizing an earlier result of Buch, Kresch, and Tamvakis. In the process we show that the Gromov-Witten variety of curves passing through 3 general points is irreducibl...

Starting from any configuration, a snap-stabilizing protocol guarantees that the system always behaves according to its specification while a self-stabilizing protocol only guarantees that the system will behave according to its specification in a finite time. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). That property is very s...