We show how randomized caches can be used in resource-poor partial-state routers to provide a fair share of bandwidth to short-lived flows that are known as mice when long-lived f...
Seth Voorhies, Hyunyoung Lee, Andreas Klappenecker
This paper presents some roughness bounds for rough set operations. The results show that a bound of the set operation can be determined from their operand's roughnesses. We ...
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
Abstract. Recently M. Dritschel proved that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another pro...
This paper presents a discrete-event approach to synthesis of transcription control for a class of (computational) gene networks. Given a set of genes and protein-gene and/or prote...