Abs t r ac t . Global analysis of logic programs can be performed effectively by the use of one of several existing efficient algorithms. However, the traditional global analysis scheme in which all the program code is known in advance and no previous analysis information is available is unsatisfactory in many situations. Incrementa! analysis of logic programs has been shown to be feasible and ...

Traditional principal components analysis (PCA) techniques for face recognition are based on batch-mode training using a pre-available image set. Real world applications require that the training set be dynamic of evolving nature where within the framework of continuous learning, new training images are continuously added to the original set; this would trigger a costly continuous re-computatio...

Aim: To investigate the role of implicit theories of ability and achievement goals on self-handicapping strategies in physical education classes. Hypotheses: It was expected that incremental theories of ability would be negatively associated with self-handicapping strategies, whereas fixed theories of ability would enhance pupils’ self-reported use of such strategies. It was also hypothesised t...

BACKGROUND Breast cancer screening technology and treatment have improved over the past decade. This analysis evaluates the total cost-effectiveness of various breast cancer screening strategies in Canada. DATA AND METHODS Using the Wisconsin Cancer Intervention and Surveillance Monitoring Network (CISNET) breast cancer simulation model adapted to the Canadian context, costs and quality-adjus...

In this paper, we design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping strategies, PushDown and PullUp, in which selections are either pushed below, or pulled above, joins are proposed and investigated. While our earlier research has demonstrated that the incremental group optimization ca...

We study sliding window multi-join processing in continuous queries over data streams. Several algorithms are reported for performing continuous, incremental joins, under the assumption that all the sliding windows fit in main memory. The algorithms include multiway incremental nested loop joins (NLJs) and multi-way incremental hash joins. We also propose join ordering heuristics to minimize th...