This paper analyzes a multi-round ow control algorithm that attempts to minimize the time required to multicast a message to a group of recipients and receive responses directly from each group member. Such a ow control algorithm may be necessary because the urry of responses to the multicast can overrow the buuer space of the process that issued the multicast. The condition that each recipient...

In this paper, we consider a streaming one-pass-over-the-data model for Principal Component Analysis (PCA). The input, in this case, is a stream of p-dimensional vectors, and the output is a collection of k, p-dimensional principal components that span the best approximating subspace. Consequently, the minimum memory requirement for such problems is O(kp). Yet the standard PCA algorithm require...

Volume replacement therapy is crucial to the treatment of hypovolemic shock. In patients with certain conditions, limiting the volume of fluid administered has many potential therapeutic benefits and technical advantages. Hypertonic saline and colloids have characteristics that allow effective treatment of hypovolemic shock using relatively smaller volumes than would be required for isotonic cr...

In this paper, the task of identifying the speaker using limited training and testing data is addressed. Speaker identification system is viewed as four stages namely, analysis, feature extraction, modelling and testing. The speaker identification performance depends on the techniques employed in these stages. As demonstrated by different experiments, in case of limited training and testing dat...

We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via simulation in d=2, 3, and 4. We show how a broad class of such models exhibit distributions of sphere radii with a universal exponent. We construct a scaling t...

We give an efficient structural decomposition theorem for formulas that depends on their negation complexity and demonstrate its power with the following applications. We prove that every formula that contains t negation gates can be shrunk using a random restriction to a formula of size O(t) with the shrinkage exponent of monotone formulas. As a result, the shrinkage exponent of formulas that ...

For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications where it is desirable to strictly limit the number of decision points and branches in a plan. This raises the question of how one goes about finding optimal plans containing only a limited number of branches. In this paper,...

Since parallel computing is again becoming a topic of interest in computer science, it is important to revisit the theoretical foundations of highly parallel computing. “Inherently sequential” computational problems see no significant speedup when run on highly parallel computers. Just as there are efficient approximations for intractable optimization problems, so too are there efficient and hi...