This paper considers the queue length distribution in a class of FIFO single-server queues with (possibly correlated) multiple arrival streams, where the service time distribution of customers from each arrival stream may differ from one another among streams. It is widely recognized that the queue length distribution in a FIFO queue with multiple non-Poissonian arrival streams having different...

A crucial problem in cognitive science, especially for speech processing, is sequence encoding. Models of spoken word recognition either ignore the problem (e.g., Norris et al., 2000), posit solutions incapable of representing repeated elements (e.g., Grossberg & Kazerounian, 2011), or ”spatialize” time in possibly unrealistic ways (TRACE; McClelland & Elman, 1986). An alternative that has not ...

Real-Time systems (RTS for short) are those systems whose behavior is time dependent. Reliability and safety are of paramount importance in designing and building RTS because a failure of an RTS puts the public and/or the environment at risk. For the purpose of effective error reporting and testing, this paper considers the trace inclusion problem for RTS: given a path ρ (resp. ρ′) of length n ...

We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any ε > 0 there exists C > 1 such that the trace of the simple random walk of length (1 + ε)n lnn on the random graph G ∼ G(n, p) for p > C lnn/n is, with high probability, Hamiltonian and Θ(lnn)-connected. In the special case p = 1 (i.e. when G = Kn), we show a hitting time result according to...

In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general and novel technique of finite trace semantics for coalgebras. It builds on top of the (possibly infinite) trace semantics introduced earlier by the second author, but extracts only finite behavior. Interestingly the fini...

An algorithm is presented solving the factor problem in trace monoids Given two traces represented by words the algorithm determines in linear time whether the rst trace is a factor of the second one The space used for this task is linear in the length of the rst word Similar to the Knuth Morris Pratt Algorithm for the factor problem on words the algorithm simulates a nite automaton determined ...

Internet Protocol (IP) trace back is the enabling technology to control Internet crime. In this paper, we present a novel and practical IP trace back system called Flexible Deterministic Packet Marking (FDPM) which provides a defense system with the ability to find out the real sources of attacking packets that traverse through the network. While a number of other trace back schemes exist, FDPM...

Skeletal muscles change length and develop force both passively and actively. Gearing allows muscle fiber length changes to be uncoupled from those of the whole muscle-tendon unit. During active contractions this process allows muscles to operate at mechanically favorable conditions for power or economical force production. Here we ask whether gearing is constant in passive muscle; determining ...