Results 1 
3 of
3
Fast algorithm for computing the upper endpoint of sample variance for interval data: case of sufficiently accurate measurements
 Reliable Computing
, 2006
"... When we have n results x1,..., xn of repeated measurement of the same quantity, the traditional statistical approach usually starts with computing their sample average E and their sample variance V. Often, due to the inevitable measurement uncertainty, we do not know the exact values of the quantiti ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
When we have n results x1,..., xn of repeated measurement of the same quantity, the traditional statistical approach usually starts with computing their sample average E and their sample variance V. Often, due to the inevitable measurement uncertainty, we do not know the exact values of the quantities, we only know the intervals xi of possible values of xi. In such situations, for different possible values xi ∈ xi, we get different values of the variance. We must therefore find the range V of possible values of V. It is known that in general, this problem is NPhard. For the case when the measurements are sufficiently accurate (in some precise sense), it is known that we can compute the interval V in quadratic time O(n 2). In this paper, we describe a new algorithm for computing V that requires time O(n · log(n)) (which is much faster than O(n 2)). 1
ApplicationMotivated Combinations of Fuzzy, Interval, and Probability Approaches, with Application to Geoinformatics,
"... Abstract—Since the 1960s, many algorithms have been designed to deal with interval uncertainty. In the last decade, there has been a lot of progress in extending these algorithms to the case when we have a combination of interval, probabilistic, and fuzzy uncertainty. We provide an overview of relat ..."
Abstract
 Add to MetaCart
Abstract—Since the 1960s, many algorithms have been designed to deal with interval uncertainty. In the last decade, there has been a lot of progress in extending these algorithms to the case when we have a combination of interval, probabilistic, and fuzzy uncertainty. We provide an overview of related algorithms, results, and remaining open problems. I. MAIN PROBLEM Why indirect measurements? In many reallife situations, we are interested in the value of a physical quantity y that is dif cult or impossible to measure directly. Examples of such quantities are the distance to a star and the amount of oil in a given well. Since we cannot measure y directly, a natural idea is to measure y indirectly. Speci cally, we nd some easiertomeasure quantities x1,..., xn which are related to y by a known relation y = f(x1,..., xn); this relation may be a simple functional transformation, or complex algorithm (e.g., for the amount of oil, numerical solution to an inverse problem). Then, to estimate y, we rst measure the values of the quantities x1,..., xn, and then we use the results ˜x1,..., ˜xn of these measurements to to compute an estimate ˜y for y as ˜y = f(˜x1,..., ˜xn). ˜x1 ˜x2
TO ELECTRICAL AND COMPUTER ENGINEERING
"... Dean of the Graduate SchoolThis dissertation is dedicated to my deeply loved grandfather who passed away in 2003. His wish to pursue a graduate study could not be fulfilled due to World War II. And to my parents, my wife Qianyin and my son Kevin for their great love. FAST ALGORITHMS FOR COMPUTING ST ..."
Abstract
 Add to MetaCart
Dean of the Graduate SchoolThis dissertation is dedicated to my deeply loved grandfather who passed away in 2003. His wish to pursue a graduate study could not be fulfilled due to World War II. And to my parents, my wife Qianyin and my son Kevin for their great love. FAST ALGORITHMS FOR COMPUTING STATISTICS