scholarly journals When Can We Answer Queries Using Result-Bounded Data Interfaces?

Author(s):  
Antoine Amarilli ◽  
Michael Benedikt
Keyword(s):  
2018 ◽  
Vol 19 (6) ◽  
pp. 617-633 ◽  
Author(s):  
Wagner H Bonat ◽  
Ricardo R Petterle ◽  
John Hinde ◽  
Clarice GB Demétrio

We propose a flexible class of regression models for continuous bounded data based on second-moment assumptions. The mean structure is modelled by means of a link function and a linear predictor, while the mean and variance relationship has the form [Formula: see text], where [Formula: see text], [Formula: see text] and [Formula: see text] are the mean, dispersion and power parameters respectively. The models are fitted by using an estimating function approach where the quasi-score and Pearson estimating functions are employed for the estimation of the regression and dispersion parameters respectively. The flexible quasi-beta regression model can automatically adapt to the underlying bounded data distribution by the estimation of the power parameter. Furthermore, the model can easily handle data with exact zeroes and ones in a unified way and has the Bernoulli mean and variance relationship as a limiting case. The computational implementation of the proposed model is fast, relying on a simple Newton scoring algorithm. Simulation studies, using datasets generated from simplex and beta regression models show that the estimating function estimators are unbiased and consistent for the regression coefficients. We illustrate the flexibility of the quasi-beta regression model to deal with bounded data with two examples. We provide an R implementation and the datasets as supplementary materials.


2018 ◽  
Author(s):  
Xavier Delaunay ◽  
Aurélie Courtois ◽  
Flavien Gouillon

Abstract. The increasing volume of scientific datasets imposes the use of compression to reduce the data storage or transmission costs, specifically for the oceanography or meteorological datasets generated by Earth observation mission ground segments. These data are mostly produced in NetCDF formatted files. Indeed, the NetCDF-4/HDF5 file formats are widely spread in the global scientific community because of the nice features they offer. Particularly, the HDF5 offers the dynamically loaded filter plugin functionality allowing users to write filters, such as compression/decompression filters, to process the data before reading or writing it on the disk. In this work, we evaluate the performance of lossy and lossless compression/decompression methods through NetCDF-4 and HDF5 tools on analytical and real scientific floating-point datasets. We also introduce the Digit Rounding algorithm, a new relative error bounded data reduction method inspired by the Bit Grooming algorithm. The Digit Rounding algorithm allows high compression ratio while preserving a given number of significant digits in the dataset. It achieves higher compression ratio than the Bit Grooming algorithm while keeping similar compression speed.


Author(s):  
T. N. T. Goodman

SynopsisWe consider interpolation by piecewise polynomials, where the interpolation conditions are on certain derivatives of the function at certain points of a periodic vector x, specified by a periodic incidence matrix G. Similarly, we allow discontinuity of certain derivatives of the piecewise polynomial at certain points of x, specified by a periodic incidence matrix H. This generalises the well-known cardinal spline interpolation of Schoenberg. We investigate conditions on G, H and x under which there is a unique bounded solution for any given bounded data.


Sign in / Sign up

Export Citation Format

Share Document