RAPID is a run-time system that uses an inspector/executor approach to parallelize irregular computations by embodying graph scheduling techniques to optimize interleaved communication and computation with mixed granularities. It provides a set of library functions for specifying irregular data objects and tasks that access these objects, extracts a task dependence graph from data access patter...

Studies of English have shown that temporal-lobe patients, including those with Alzheimer's disease, are spared at processing real and novel regular inflected forms (e.g., walk-->walked; blick-->blicked), but impaired at real and novel irregular forms (e.g., dig-->dug; spling-->splang). Here we extend the investigation cross-linguistically to the more complex system of Italian verbal morphology...

Compositionality is a critical and universal characteristic of human language. It is found at numerous levels, including the combination of morphemes into words and of words into phrases and sentences. These compositional patterns can generally be characterized by rules. For example, the past tense of most English verbs ("regulars") is formed by adding an -ed suffix. However, many complex lingu...

INTRODUCTION Since there is scarce data available on incidence and type of irregular antibodies in patients and donors in India, a study was undertaken to find the incidence of irregular antibodies in patients and irregular antibodies and a positive Direct Antiglobulin Test (DAT) in blood donors. MATERIALS AND METHODS Antibody screening was performed using commercial pooled "O" cells and thre...

A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which detects whether reordering the resolutions in a given proof will generate an irregular proof. If so, the given proof is not minimal. A deduction system that keeps only minimal proofs retains completen...

We describe a method for investigating nonlinearity in irregular fluctuations (short-term variability) of time series even if the data exhibit long-term trends (periodicities). Such situations are theoretically incompatible with the assumption of previously proposed methods. The null hypothesis addressed by our algorithm is that irregular fluctuations are generated by a stationary linear system...

A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which detects whether reordering the resolutions in a given proof will generate an irregular proof. If so, the given proof is not minimal. A deduction system that keeps only minimal proofs retains completen...

We describe how to compute topological objects associated to a complex polynomial map of n > 2 variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the critical values at infinity, and the Milnor numbers at infinity for all irregular fibers. Then for a family of polynomials we detect parameters where the topolo...