We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs. Many properties of interest in the XML context are related to navigation, and can be formulated in temporal logics for trees. We choose a logic that admits a simple single-exponential translation into unranked t...

We provide a direct geometric bijection for the number of lattice paths that never go below the line y = kx for a positive integer k. This solution to the Generalized Ballot Problem is in the spirit of the reflection principle for the Ballot Problem (the case k = 1), but it uses rotation instead of reflection. It also gives bijective proofs of the refinements of the Generalized Ballot Problem w...

We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their private messages, but would also like to transmit common messages. In the second scenario (ccq-MAC with conferencing encoders), each sender has its own set of mes...

We prove a one-shot “minimax” converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdú [IEEE Trans. Info. Theory 56, 2307–2359 (2010)] for classical channel coding, and also enjoys the saddle point property enabling the order of optimizations to be intercha...

in this paper we introduce the notion of classical quasi-primary submodules that generalizes the concept of classical primary submodules. then, we investigate decomposition and minimal decomposition into classical quasi-primary submodules. in particular, existence and uniqueness of classical quasi-primary decompositions in finitely generated modules over noetherian rings are proved. moreover, w...

Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which include timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and h...

Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which include timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and h...

We present a general non-oscillation criterion for a second order two-term scalar nonlinear differential equation in the spirit of a classic result by Atkinson [1]. The presentation is simpler than most and can serve to unify many such criteria under one common theme that eliminates the need for specfic techniques in each of the classical cases (sublinear, linear, and superlinear). As is to be ...

We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approxima.tion algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover [BRS89] [LN93], th...

Not only has the rate of change accelerated beyond our classical lifecycles capability but also the demands of high quality and low cost are beyond our past capabilities  how to leverage specific outside tools to meet these demands will be presented. This presentation will focus on a spirit of collaboration and cooperation expressed in Web lifecycles and compare that with the traditional lifec...