Michel Balinski, Svetlozar T. Rachev · Numerical Functional Analysis and Optimization · 1993
Abstract Failure to add to 1—to be "justified" to 1—occurs frequently in reported sets of rounded data. The probabilities for different rules of rounding vectors and tables to give "justified" results under varying assumptions concerning the probabilistic structure of the data are computed. This extends the pioneering work of Mosteller,Youtz, and Zahn (1967) and Diaconis and Freedman (1979) who assessed the probability that conventionally rounded proportions add to 1. In particular, it is shown that other rules of rounding canimprove upon the conventional rule. Keywords: rounding vectorsrounding tablesrounding proportionsprobability metricsapportionment
Cited by 37
George T. Duncan, Stephen F. Roehrig · 2004
When disseminating data on individuals, information organizations must balance the interests of data users in better access and the interests of data providers in confidentiality. Cyclic perturbation is a new method for protecting sensitive data in categorical tables. In the disseminated data product, the true table values are altered in a way that preserves the table’s marginal totals. Further, the method requires publicly announcing details of the procedure, so that a user can determine not only the range of values that a table cell may have had in the original table, but also the exact posterior distribution over those possible values, given the user’s prior probabilities over a relatively small set of possible true tables. This permits Bayesian analysis of the published table. Cyclic perturbation is compared with the standard alternatives of cell suppression and controlled rounding, on the basis of disclosure risk and data utility. 1
Cited by 0
Unknown, Abigail Wendler Bainbridge · The Journal of the Abraham Lincoln Association
Cited by 0
Peter J. Papadakos, Mark L. Gestring · 2015
Cited by 0
Bloomsbury Education eBooks · 2015
Cited by 0
University Research Chair) · Encyclopedia of Database Systems · 2009
Cited by 0
Kruseman Aretz, F.E.J., Meer, van der, J.C. · Data Archiving and Networked Services (DANS) · 2007
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 introduces the concept of rounding in an abstract setting; thereupon we specialize in Section 2 to rounding to floating-point numbers.
Cited by 0
Bill Zorn · ResearchWorks at the University of Washington (University of Washington) · 2021
Thesis (Ph.D.)--University of Washington, 2021
Cited by 0Open access
SpringerReference · 2011
Cited by 0
Georgina O’Reilly-Foley · Nursing Standard · 2016
A CPD article reinforced Georgina O’Reilly-Foley’s knowledge of the benefits of rounding and its value in patient care
Cited by 0
Kruseman Aretz, FEJ · TU/e Research Portal (Eindhoven University of Technology) · 2007
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 introduces the concept of rounding in an abstract setting; thereupon we specialize in Section 2 to rounding to floating-point numbers.
Cited by 0
Instructor Mohammad, T. Hajiaghayi, Scribe Rajesh Chitnis · 2011
In this section we will see an f-approximation algorithm for the Set Cover problem where f is the maximum number of times any element of the universe appears in the sets. Set Cover Input: A universe U = {u1, u2,..., um}, a collection S = {S1, S2,..., Sn} of subsets of U and a cost function c: S → R + ∪ {0} Goal: To find a minimum cost S ′ ⊆ S such that U = ⋃ S∈S ′ S Consider the following integer program which solves the Set Cover problem. subject to n∑ min c(Sj)xj j=1 ∀ i ∈ [m], xj ≥ 1 ui∈Sj ∀ j ∈ [n], xj ∈ {0, 1}
Cited by 0
Kruseman Aretz, FEJ · Data Archiving and Networked Services (DANS) · 2007
Cited by 0
Kruseman Aretz, FEJ · TU/e Research Portal (Eindhoven University of Technology) · 2007
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 introduces the concept of rounding in an abstract setting; thereupon we specialize in Section 2 to rounding to floating-point numbers.
Cited by 0
Derek Haylock, Paul Warburton · 2013
Cited by 0
David J. Kuck, D. Stott Parker, Ahmed Sameh · 1975
ROM-rounding is introduced and is shown to compare favorably with existing floating-point rounding methods on design considerations and on performance over a series of error tests. The error-retarding value of guard digits, of rounding the aligned operand, and of rounding in general are discussed.
Cited by 3
Rounding, Nicholas · Research Publications (Maastricht University) · 2021
Cited by 0
Peter J. Papadakos, Mark L. Gestring · 2015
Cited by 0
Chesneaux, Jean-Marie, Graillat, Stef, Jézéquel, Fabienne · HAL (Le Centre pour la Communication Scientifique Directe) · 2009
Cited by 0
Yohan Chatelain · OSF Preprints (OSF Preprints) · 2024
fMRIprep 20.2.1 executions with fuzzy-libm Random Rounding
Cited by 0