A distributed algorithm based on Dynamic Itemset Counting (DIC) for generation of frequent itemsets is presented by us. DIC represents a paradigm shift from Apriori-based algorithms in the number of passes of the database hence reducing the total time taken to obtain the frequent itemsets. We exploit the advantage of Dynamic Itemset Counting in our algorithmthat of starting the counting of an i...

Kernelization is a formalization of preprocessing for combinatorially hard problems. We modify the standard definition for kernelization, which allows any polynomial-time algorithm for the preprocessing, by requiring instead that the preprocessing runs in a streaming setting and uses O(poly(k) log |x|) bits of memory on instances (x, k). We obtain several results in this new setting, depending ...

Unlimited asynchronism is intolerable in real physically distributed computer systems. Such systems, synchronous or not, use clocks and timeouts. Therefore the magnitudes of elapsed absolute time in the system need to satisfy the axiom of Archimedes. Under this restriction of asynchronicity logically timeindependent solutions can be derived which are nonetheless better (in number of message pas...

Some techniques which average multiple AMSR satellite data passes into daily sets create images with diminished temporal resolution. This results from averaging data of multiple overlapping passes separated by many hours. Overlap can be reduced by instead grouping data according to local time of day. This new method maximizes temporal resolution by decreasing both the number and the temporal va...

Soil compaction has become a widespread problem in the world and is one of the factors involved in land degradation and declining crop yields, especially in the arid and semi-arid agriculture. The purpose of this study was to investigate the effects of subsoil compaction on morphological, physiological and agronomic aspects of wheat .The research was carried out in the experimental farms of Anb...