The percolation technique was used to examine the leachability of uranium from El-Sela mineralization. agglomeration effect, particle size, flow rates, free acidity, solid/liquid ratio, and ratio cobblestone effect were all studied in kinetics leaching. At a height 3.0 m within column, optimal ore found be 1:4, irrigation rate reduced 0.15 0.1L/m2/min, increasing 47.5 79%. Finally, column leach...

The position heap is a text indexing structure for a single text string, recently proposed by Ehrenfeucht et al. [Position heaps: A simple and dynamic text indexing data structure, Journal of Discrete Algorithms, 9(1):100-121, 2011]. In this paper we introduce the position heap for a set of strings, and propose an efficient algorithm to construct the position heap for a set of strings which is ...

Over the past few years, the applications of certain microorganisms have gained importance in the field of applied environmental microbiology. Amongst them, biomineral processing is such field that deals with metal mining from ores, concentrates, industrial wastes, overburdens etc. under the impact of microorganisms and/or their metabolites. The most successful advancement of mineral biotechnol...

The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on computer programs. In most implementations, the heap management library keeps the heap meta-data (heap structure information) and the application’s heap data in an interleaved fashion and does not protect them against ea...

We introduce the heap-on-top (hot) priority queue data structure that combines the multi-level bucket data structure of Denardo and Fox 9] and a heap. We use the new data structure to obtain an O(m+n(log C) 1 3 +) expected time implementation of Dijkstra's shortest path algorithm 11], improving the previous bounds.

This paper presents a novel set of algorithms for heap abstraction, identifying logically related regions of the heap. The targeted regions include objects that are part of the same component structure (recursive data structure). The result of the technique outlined in this paper has the form of a compact normal form (an abstract model) that boosts the efficiency of the static analysis via spee...

The heap is a basic data structure used in a wide variety of applications, including shortest path and minimum spanning tree algorithms. In this paper we explore the design space of comparison-based, amortized-efficient heap implementations. From a consideration of dynamic single-elimination tournaments, we obtain the binomial queue, a classical heap implementation, in a simple and natural way....