The mathematical modeling of the unsaturated flow problem requires the simultaneous resolution of two problems: the Richards equation and the estimation of the hydraulic parameters involved in hydraulic conductivity and in the retention curve. Various techniques have been applied to both problems in a wide range of situations. In this article, a novel implementation of the processing techniques...

The problem of data dependences detection in codes based on dynamic data structures, is crucial to various compiler optimizations. The approach presented in this paper focus on detecting data dependences induced by heap-directed pointers on loops that access dynamic data structures. Knowledge about the shape of the data structure accessible from a heap-directed pointer, provides critical inform...

This study explores the effects of prior video-game experience on learner’s motivation in a serious game environment. 20 participants were invited to play our serious game, called HeapMotiv, intended to educate players about the heap data structure. HeapMotiv is comprised of three missions (HeapTetris, Heap-Shoot and Heap-Sort). We used Keller’s ARCS theoretical model of motivation and physiolo...

Bioleaching has been employed commercially to recover metals from low grade ores, but the production efficiency remains to be improved due to limited understanding of the system. This study examined the shift of microbial communities and S&Fe cycling in three subsystems within a copper ore bioleaching system: leaching heap (LH), leaching solution (LS) and sediment under LS. Results showed that ...

The garbage collector presented in this paper makes use of two well known compaction garbage collection algorithms with very diierent performance characteristics: Cheney's two-space copying collector and Jonker's sliding compaction collector. We propose a scheme which allows either collector to be used. The run-time memory requirements of the program being executed are used to determine the mos...

We present an efficient mapping of a min-max-pair heap of size N on a hypercube multicomputer of p processors in such a way the load on each processor’s local memory is balanced and no additional communication overhead is incurred for implementation of the single insertion, deletemin and deletemax operations. Our novel approach is based on an optimal mapping of the paths of a binary heap into a...

A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized asymptotic operation costs. An unaesthetic aspect of Fibonacci heaps is that they must maintain a “mark bit” which serves only to ensure efficiency of heap operations, not their correctness. Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin...

The most natural kinetic data structure for maintaining the maximum of a collection of continuously changing numbers is the kinetic heap. Basch, Guibas, and Ramkumar proved that the maximum number of events processed by a kinetic heap with n numbers changing as linear functions of time is O(n log n) and Ω(n log n). We prove that this number is actually Θ(n log n). In the kinetic heap, a linear ...

We propose a new indexing structure for parameterized strings, called parameterized position heap. Parameterized position heap is applicable for parameterized pattern matching problem, where the pattern matches a substring of the text if there exists a bijective mapping from the symbols of the pattern to the symbols of the substring. We propose an online construction algorithm of parameterized ...

Cyanidation is the main method used to extract gold from gold raw materials; however, a serious problem with this method is the low leaching rate. In order to improve gold leaching, the intensification behavior of mercury ions on gold cyanide leaching, for two types of materials, sulphide gold concentrate and oxide gold ore, was investigated. The results showed that mercury ions, with only a 10...