SUMMARY Visualization of 3D, unsteady (4D) flow is very difficult due to both perceptual challenges and the large size of 4D vector field data. Here, we describe the use of integral surfaces for visualization of CFD simulation data. By " integral " surfaces we mean surfaces based on massless particles that are integrated according to the underlying flow. Traditionally, integral curves, e.g., st...

This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (twonode) tandem queue, fed by a large number of Gaussian inputs. With service rates and buffer sizes at both nodes scaled appropriately, Schilder’s sample-path large deviations theorem can be applied to calculate the as...

Association rule mining is one of the most important technique in data mining. Which wide range of applications It aims it searching for intersecting relationships among items in large data sets and discovers association rules. The important of association rule mining is increasing with the demand of finding frequent patterns from large data sources. The exploitation of frequent item set has be...

In a large, dense network, the computation of the ‘distances’, i.e., the shortest path lengths between all pairs of nodes, can take a long time with algorithms known from the literature. We present two all-pairs shortest path algorithms, based on the equations of Bellman. These algorithms run fast, much faster than indicated by their time complexity bound of O(n2m), where n is the number of nod...

In most experiments that involve between-subjects or between-items factorial designs, the items and/or the participants in the various experimental groups differ on one or more variables, but need to be matched on all other factors that can affect the outcome measure. Matching large groups of items or participants on multiple dimensions is a difficult and time-consuming task, yet failure to mat...

Set similarity joins compute all pairs of similar sets from two collections of sets. Set similarity joins are typically implemented in a filter-verify framework: a filter generates candidate pairs, possibly including false positives, which must be verified to produce the final join result. Good filters produce a small number of false positives, while they reduce the time they spend on hopeless ...

There are estimated to be on the order of 10 single nucleotide polymorphisms (SNPs) existing as standing variation in the human genome. Certain combinations of these SNPs can interact in complex ways to predispose individuals for a variety of common diseases, even though individual SNPs may have no ill effects. Detecting these epistatic combinations is a computationally daunting task. Trying to...

This paper presents new algorithms for the extraction of association rules from binary databases. Most existing methods operate by generating many \candidate" sets, representing combinations of attributes which may be associated, and then testing the database to establish the degree of association. This may involve multiple database passes, and is also likely to encounter problems when dealing ...