Search results for "Biased"
showing 10 items of 42 documents
The Role of Low Complexity Regions in Protein Interaction Modes: An Illustration in Huntingtin
2021
Low complexity regions (LCRs) are very frequent in protein sequences, generally having a lower propensity to form structured domains and tending to be much less evolutionarily conserved than globular domains. Their higher abundance in eukaryotes and in species with more cellular types agrees with a growing number of reports on their function in protein interactions regulated by post-translational modifications. LCRs facilitate the increase of regulatory and network complexity required with the emergence of organisms with more complex tissue distribution and development. Although the low conservation and structural flexibility of LCRs complicate their study, evolutionary studies of proteins …
The Conservation of Low Complexity Regions in Bacterial Proteins Depends on the Pathogenicity of the Strain and Subcellular Location of the Protein
2021
Low complexity regions (LCRs) in proteins are characterized by amino acid frequencies that differ from the average. These regions evolve faster and tend to be less conserved between homologs than globular domains. They are not common in bacteria, as compared to their prevalence in eukaryotes. Studying their conservation could help provide hypotheses about their function. To obtain the appropriate evolutionary focus for this rapidly evolving feature, here we study the conservation of LCRs in bacterial strains and compare their high variability to the closeness of the strains. For this, we selected 20 taxonomically diverse bacterial species and obtained the completely sequenced proteomes of t…
Understanding Prediction Limits Through Unbiased Branches
2006
The majority of currently available branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but they do not consider the impact of unbiased branches which are difficult-to-predict. In this paper, we quantify and evaluate the impact of unbiased branches and show that any gain in prediction accuracy is proportional to the frequency of unbiased branches. By using the SPECcpu2000 integer benchmarks we show that there are a significant proportion of unbiased branches which severely impact on prediction accuracy (averaging between 6% and 24% depending on the prediction context used).
A Bayesian analysis of the thermal challenge problem
2008
Abstract A major question for the application of computer models is Does the computer model adequately represent reality? Viewing the computer models as a potentially biased representation of reality, Bayarri et al. [M. Bayarri, J. Berger, R. Paulo, J. Sacks, J. Cafeo, J. Cavendish, C. Lin, J. Tu, A framework for validation of computer models, Technometrics 49 (2) (2007) 138–154] develop the simulator assessment and validation engine ( SAVE ) method as a general framework for answering this question. In this paper, we apply the SAVE method to the challenge problem which involves a thermal computer model designed for certain devices. We develop a statement of confidence that the devices mode…
Variance Estimation and Asymptotic Confidence Bands for the Mean Estimator of Sampled Functional Data with High Entropy Unequal Probability Sampling …
2013
For fixed size sampling designs with high entropy it is well known that the variance of the Horvitz-Thompson estimator can be approximated by the Hajek formula. The interest of this asymptotic variance approximation is that it only involves the first order inclusion probabilities of the statistical units. We extend this variance formula when the variable under study is functional and we prove, under general conditions on the regularity of the individual trajectories and the sampling design, that it asymptotically provides a uniformly consistent estimator of the variance function of the Horvitz-Thompson estimator of the mean function. Rates of convergence to the true variance function are gi…
Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance
2017
We establish an ordering criterion for the asymptotic variances of two consistent Markov chain Monte Carlo (MCMC) estimators: an importance sampling (IS) estimator, based on an approximate reversible chain and subsequent IS weighting, and a standard MCMC estimator, based on an exact reversible chain. Essentially, we relax the criterion of the Peskun type covariance ordering by considering two different invariant probabilities, and obtain, in place of a strict ordering of asymptotic variances, a bound of the asymptotic variance of IS by that of the direct MCMC. Simple examples show that IS can have arbitrarily better or worse asymptotic variance than Metropolis-Hastings and delayed-acceptanc…
Uniform convergence and asymptotic confidence bands for model-assisted estimators of the mean of sampled functional data
2013
When the study variable is functional and storage capacities are limited or transmission costs are high, selecting with survey sampling techniques a small fraction of the observations is an interesting alternative to signal compression techniques, particularly when the goal is the estimation of simple quantities such as means or totals. We extend, in this functional framework, model-assisted estimators with linear regression models that can take account of auxiliary variables whose totals over the population are known. We first show, under weak hypotheses on the sampling design and the regularity of the trajectories, that the estimator of the mean function as well as its variance estimator …
Varying-time random effects models for longitudinal data: unmixing and temporal interpolation of remote-sensing data
2008
Remote sensing is a helpful tool for crop monitoring or vegetation-growth estimation at a country or regional scale. However, satellite images generally have to cope with a compromise between the time frequency of observations and their resolution (i.e. pixel size). When concerned with high temporal resolution, we have to work with information on the basis of kilometric pixels, named mixed pixels, that represent aggregated responses of multiple land cover. Disaggreggation or unmixing is then necessary to downscale from the square kilometer to the local dynamic of each theme (crop, wood, meadows, etc.). Assuming the land use is known, that is to say the proportion of each theme within each m…
Combining Defocus and Photoconsistency for Depth Map Estimation in 3D Integral Imaging
2017
This paper presents the application of a depth estimation method for scenes acquired using a Synthetic Aperture Integral Imaging (SAII) technique. SAII is an autostereoscopic technique consisting of an array of cameras that acquires images from different perspectives. The depth estimation method combines a defocus and a correspondence measure. This approach obtains consistent results and shows noticeable improvement in the depth estimation as compared to a minimum variance minimisation strategy, also tested in our scenes. Further improvements are obtained for both methods when they are fed into a regularisation approach that takes into account the depth in the spatial neighbourhood of a pix…
On improving the accuracy of Visible Light Positioning system using deep autoencoder
2020
International audience; DC-biased optical Orthogonal Frequency DivisionMultiplexing (DCO-OFDM)-based visible light positioning (VLP)technology along with the Received Signal Strength(RSS) po-sitioning algorithm is widely used to achieve centimeter levelpositioning accuracy for incoming 5G era, especially indoorenvironment. However, the DCO-OFDM has the peak-to-averagepower ratio (PAPR) issue which imposes the nonlinear distortionand it will directly affect the positioning accuracy in the VLPsystem. The PAPR reduction scheme is urgently needed. There-fore, in this paper, the impact of PAPR reduction scheme onpositioning accuracy is investigated. The positioning accuracywith and without the s…