The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
We study limitations of an equation-based congestion control protocol, called TFRC (TCP Friendly Rate Control). It examines how the three main factors that determine TFRC throughp...
Abstract— The performance of a noncoherent digital delaylock loop (DDLL) with a RAKE scheme for direct-sequence spread-spectrum code division multiple access (DS/SS-CDMA) signals...
We consider a star-shaped network consisting of a single node with N 3 connected arcs. The dynamics on each arc is governed by the wave equation. The arcs are coupled at the node ...