Continuous queries over data streams have gained popularity as the breadth of possible applications, ranging from network monitoring to online pattern discovery, have increased. Joining of streams is a fundamental issue that must be resolved to enable complex queries over multiple streams. However, as streams can represent potentially infinite data, it is infeasible to have full join evaluation...

This paper describes how Dynamic WindowConstrained Scheduling (DWCS) can guarantee real-time service to packets from multiple streams with different performance objectives. We show that: (1) DWCS can guarantee that no more than x packets miss their deadlines for every y consecutive packets requiring service, as long as the minimum aggregate bandwidth requirement of all real-time packet streams ...

Abstract: The fundamental logic operations NOT, OR, AND, and XOR processing bit-streams of ∆Σ-modulators are discussed herein. The resulting bit-streams are evaluated on the basis of their mean values and their standard deviations. Mathematical expressions are presented for their mean values; i.e., the logic function XOR results in the negative multiplication of two bipolar bit-streams, and the...

Continuous queries over data streams have gained popularity as the breadth of possible applications, ranging from network monitoring to online pattern discovery, have increased. Joining of streams is a fundamental issue that must be resolved to enable complex queries over multiple streams. However, as streams can represent potentially infinite data, it is infeasible to have full join evaluation...

Multiple independent streams of random numbers are often required in simulation studies, for instance, to facilitate synchronization for variance-reduction purposes, and for making independent replications. A portable set of software utilities is described for uniform randomnumber generation. It provides for multiple generators (streams) running simultaneously, and each generator (stream) has i...

In this work the efficiency of shaping live video streams is considered. We propose low complexity shaping algorithms adequate for real-time operation and supporting applications with a wide range of delay tolerance. The effect of shaping is investigated considering video streams multiplexed at an output link with a small buffer to absorb packet scale congestion. The advantage of using small bu...

Structured Codes in Information Theory: MIMO and Network Applications by Jiening Zhan Doctor of Philosophy in Engineering-Electrical Engineering & Computer Sciences University of California, Berkeley Professor Michael Gastpar, Chair Though random codes are shown to be optimal for point-to-point channels, codes with algebraic structure are found to be useful in many network scenarios. This thesi...

Headwater species and peripheral populations that occupy habitat at the edge of a species range may hold an increased conservation value to managers due to their potential to maximize intraspecies diversity and species' adaptive capabilities in the context of rapid environmental change. The southern Appalachian Mountains are the southern extent of the geographic range of native Salvelinus fonti...

Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or periodic measurements of various indicators of the health of the economy. There is clearly utility in determining how current and past values in those streams are related to future values. We formulate the problem of nding s...