and a method A of summability by means of which a given sequence Su S2, • • • is summable to <r as w—»oo. If a sequence sn is summable A, we say that A {sn} exists and that sn belongs to the summability field of A. If sn is summable A to <r, we say that A {sn} = <r. The method A is regular if A {sn} = lim sn whene...

We extend the localization techniques of Bloch to simplicial spaces. As applications, we give an extension of Bloch’s localization theorem for the higher Chow groups to schemes of finite type over a regular scheme of dimension one (including mixed characteristic) and, relying on a fundamental result of Friedlander-Suslin, we globalize the Bloch-Lichtenbaum spectral sequence to give a spectral s...

Recently, foveated video has been introduced as an important emerging method for very low bit rate multimedia applications [1][2]. In this paper, we develop several rate control algorithms, and measure the performance of foveated video. We utilize H.263 video, and compare the performance with regular video based on the SNRC (signalto-noise ratio in curvilinear coordinates). In order to maximize...

Events in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a temporal sequence of observations. The usual regular constructs (concatenation, etc.) are supplemented with superposition, inducing a useful notion of entailment, distinct from that given by models of predicate logic.

We present a new method to achieve an embedded desingularization of a toric variety. Let W be a regular toric variety defined by a fan Σ and X ⊂ W be a toric embedding. We construct a finite sequence of combinatorial blowing-ups such that the final strict transforms X ′ ⊂ W ′ are regular and X ′ has normal crossing with the exceptional divisor.

In rostering problems, we need to find a schedule that satisfies various constraints. Ergonomic constraints, that place restrictions on a number of consecutive days, are common (Bourdais, Galinier, & Pesant 2003) . To model such rules, several global constraints have been introduced. For example, the STRETCH constraint (Hellsten, Pesant, & Beek 2004) is useful for limiting the length of stretch...

The previous works in [HM09], we turn out that Gersten’s conjecture is equivalent to its local version. To state local Gersten’s conjecture, we start from recalling the notation from [HM09], [MS10]. In this paper, let us fix a commutative regular local ring A of Krull dimension d. For any ideal of A generated by a regular sequence I, we denote the category of finitely generated A-modules M whos...

A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the other language, and each string can be embedded into the next string in the sequence. It is known that if there are towers of any length, then there also exists an infinite tower. We investigate upper and lower bounds o...

Chomsky and Schützenberger showed in 1963 that the sequence dL(n), which counts the number of words of a given length n in a regular language L, satisfies a linear recurrence relation with constant coefficients for n, i.e., it is C-finite. It follows that every sequence s(n) which satisfies a linear recurrence relation with constant coefficients can be represented as dL1 (n)− dL2 (n) for two re...

A configuration of a graph is an assignment of one of two states, on or off, to each vertex of it. A regular move at a vertex changes the states of the neighbors of that vertex. A valid move is a regular move at an on vertex. The following result is proved in this note: given any starting configuration x of a tree, if there is a sequence of regular moves which brings x to another configuration ...