National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Nearly All Reals Can Be Sorted with Linear Time Complexity
Jiřina, Marcel
We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed that the sorting key and pointers to the items being sorted are moved and individual items remain at the same place in the memory (in place sorting). In this case, the space complexity of the new variant of the algorithm is the same as the complexity of the quicksort. We also quantify the practical limits for possible sorting reals in a linear time. This possibility is assured under additional assumptions on the distribution of the sorting key, mainly the independence and identity of the distribution. Here we give a more general criteria easily applicable in practice. We also show that the algorithm is applicable for data that do not fulfill criteria for linear time complexity but even that the computation is faster than the system quicksort. A new, faster version of the algorithm is attached.
Nonparametric density estimates used for multiple AE source detection
Gális, P. ; Chlada, Milan
Paper deals with the localization of acoustic emission (AE) sources by means of exact geodesic curves on 3D vessels composed of several parametrized surfaces. Precise arrival times of AE events, plugged in DeltaT/DeltaL localization is discussed. Two-dimensional nonparametric (kernel) density estimates are employed to obtain the localization maps on 3-D surfaces and the potential regions of cracks are visibly highlighted. This newly proposed procedure is applied to steam reservoir and other experimental vessels. The results presented are accompanied by thoroughgoing evaluation of their quality and practical usefulness.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.