In a brief communication to this journal, entitled “Basic Properties of Both Percentile Rank Scores and the I3 Indicator,” Rousseau (in press) proposed to define percentile classes in the case of the Integrated Impact Indicator (I3) right-open so that the largest number in a set always belongs to the highest percentile. He argued that “this completely solves the issue raised by Leydesdorff & Bo...

The 95-percentile method is used widely for billing ISPs and websites. In this work, we characterize important aspects of the 95-percentile method using a large set of traffic traces. We first study how the 95-percentile depends on the aggregation window size. We observe that the computed value often follows a noisy decreasing trend along a convex curve as the window size increases. We provide ...

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

This paper considers the application of method of percentile matching available in statistical theory of estimation for estimating the parameters involved in uncertainty distributions. An empirical study has been carried out to compare the performance of the proposed method with the method of moments and the method of least squares considered by Wang and Peng (J. Uncertainty Analys. Appl. 2, (2...

The purpose of this study was to examine the use of percentile schedules as a method of quantifying the shaping procedure in an educational setting. We compared duration of task engagement during baseline measurements for 4 students to duration of task engagement during a percentile schedule. As a secondary purpose, we examined the influence on shaping of manipulations of the number of observat...

External sorting is frequently used b>relational database s!-stems for building indexes on tables, ordered retrieval, duplicate elimination, joins, subqueries. grouping, and aggregation; it would be quite beneficial to parallelize this function. Previous parallel external sorting algorithms found in the database literature used a sequential merge as the final stage of the parallel sort. This re...