نتایج جستجو برای: k record values

تعداد نتایج: 942728  

2014
Bing Xing Wang Keming Yu Frank P.A. Coolen

This paper explores confidence intervals for the family of proportional reversed hazard distributions based on lower record values. The proposed procedure can be extended to the family of proportional hazard distributions based on upper record values. Numerical results show that the method is promising.

Journal: :IEEE Trans. Reliability 2001
Mohammad Z. Raqab

This paper proposes optimal prediction intervals for the future generalized order statistic (GOS) based on the first GOS (ordinary order statistics, usual record values, -record values) from an exponential population. A conditional argument is considered for obtaining an optimal prediction interval for future GOS. A numerical example illustrates this technique.

2015
Mauricio Sadinle Stephen E. Fienberg Maurice Falk

We present a probabilistic method for linking multiple datafiles. This task is not trivial in the absence of unique identifiers for the individuals recorded. This is a common scenario when linking census data to coverage measurement surveys for census coverage evaluation, and in general when multiple record–systems need to be integrated for posterior analysis. Our method generalizes the Fellegi...

2012
Brook Heaton Sumitra Mukherjee

Statistical disclosure control (SDC) methods reconcile the need to release information to researchers with the need to protect privacy of individual records. Microaggregation is a SDC method that protects data subjects by guarantying k-anonymity: Records are partitioned into groups of size at least k and actual data values are replaced by the group means so that each record in the group is indi...

2012
Sergio Martínez David Sánchez Aïda Valls

Privacy should be carefully considered during the publication of data (e.g. database records) collected from individuals to avoid disclosing identities or revealing confidential information. Anonymisation methods aim at achieving a certain degree of privacy by performing transformations over non-anonymous data while minimising, as much as possible, the distortion (i.e. information loss) derived...

Journal: :Statistical Methods and Applications 2014
Mahdi Doostparast Mahdi Emadi

In this paper, the likelihood ratio approach is applied for measuring evidence provided by record data in favor of a hypothesis against an alternative under a random sampling scheme. Explicit expressions for probabilities of observing strong andweak evidences are derived. Asymptotic behaviors of these probabilities are investigated in a greater detail. Optimal sample size in which the substanti...

Journal: :journal of artificial intelligence in electrical engineering 2015
mohammad mehdi moradi

this study on the design of pid controllers for flexible single-arm robot system optimizationpso method is focused so that the coefficients of the pid controller are reduced. in this study,pid controller and pso algorithm have been described and then by using matlab, pidcontrol was simulated. then by pso algorithm, attempts to reduce the pid coefficients are givenby simulation. finally pid coef...

Journal: :Structured Programming 1991
Josef Grosch

Linked records are a general mechanism to build data structures like lists, trees, and graphs. Most high-level programming languages only provide the definition of record types, an operator for component selection, and allocation of record storage. We propose to specify complete graph structures by context-free grammars. A tool can be used to transform such a specification into a set of record ...

Journal: :Electronic Journal of Probability 2023

For a sequence of i.i.d. d-dimensional random vectors with independent continuously distributed coordinates, say that the nth observation in sets record if it is not dominated every coordinate by an earlier observation; for j≤n, jth current at time n has been any first observations; and breaks k records there are observations n−1 but n. general dimension d, we identify, proof, asymptotic condit...

Journal: :IEEE Trans. Parallel Distrib. Syst. 1996
Dina Kravets C. Greg Plaxton

Given a sequence of n elements, the All Nearest Smaller Values (ANSV) problem is to nd, for each element in the sequence, the nearest element to the left (right) that is smaller, or to report that no such element exists. Time and work optimal algorithms for this problem are known on all the PRAM models 3], 5], but the running time of the best previous hypercube algorithm 6] is optimal only when...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید