In this paper, we review a general framework for the optimal bit allocation among dependent quantizers based on the minimum maximum (MINMAX) distortion criterion. Pros and cons of this optimization criterion are discussed and compared to the well-known Lagrange multiplier method for the minimum average (MINAVE) distortion criterion. We argue that, in many applications, the MINMAX criterion is m...

We examine the replica placement aspect of a distributed peer-to-peer le system that replicates and stores les on ordinary desktop computers. It has been shown that some desktop machines are available for a greater fraction of time than others, and it is crucial not to place all replicas of any le on machines with low availability. In this paper we study the eÆcacy of three hill-climbing algori...

The Farsite distributed le system stores multiple replicas of les on multiple machines, to provide le access even when some machines are unavailable. Farsite assigns le replicas to machines so as to maximally exploit the di erent degrees of availability of di erent machines, given an allowable replication factor R. We use competitive analysis and simulation to study the performance of three can...

warp and weft spacing and its coefficient of variation affect the physical properties of fabrics such as fabric hand, frictional and mechanical properties. in this paper the weft and warp spacing and its coefficient of variation for plain weave is calculated using fourier transforms. different methods have been used in this work including autocorrelation function. first, two dimensional power s...

In this paper, we will study the existence problem of minmax minimal torus. We use classical conformal invariant geometric variational methods. We prove a theorem about the existence of minmax minimal torus in Theorem 5.1. Firstly we prove a strong uniformization result(Proposition 3.1) using method of [1]. Then we use this proposition to choose good parametrization for our minmax sequences. We...

We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ǫ log n digits (for any constant ǫ > 0) is NP-hard, where n is the size of the game. On the other hand, approximating the value with a precision of c log log n digits (for any constant c ≥ 1) can be done in quas...

In this paper we discuss a minmax regret version of the single machine scheduling problem with the total flow time criterion. Uncertain processing times are modeled by closed intervals. We show that if the deterministic problem is polynomially solvable, then its minmax regret version is approximable within 2.