A generalization of the minimal hitting-set algorithm given by deKleer and Williams is presented. The original algorithm handles only one faulty mode per component and only positive conflicts. In contrast, the new algorithm presented here handles more than two modes per component and also non-positive conflicts. The algorithm computes a logical formula that characterizes all diagnoses. Instead ...

We describe new N -extended 2D supergravities on a (p + 1)dimensional (bosonic) space. The fundamental objects are moving frame densities that equip each (p+1)-dimensional point with a 2D “tangent space”. The theory is presented in a [p+1, 2] superspace. For the special case of p = 1 we recover the 2D supergravities in an unusual form. The formalism has been developed with applications to the s...

INTRODUCTION Several groups have recently proposed the use of the Kohlrausch-Williams-Watts (KWW) stretched-exponential function to model the diffusion attenuation curves observed in biological tissues [1-4]. The KWW function is given by Mo exp[-(bD) α], where the free parameters of the model are the anomalous exponent α, the apparent diffusion coefficient D, and the unweighted signal intensity...

Williams syndrome...people with intact language, intact face processing and very low IQ, right? Wrong! That’s the propagated myth because, if it were true, it would be such an elegant example of innate modularity at the genetic, brain and cognitive levels. But numerous labs across the world have shown that although vocabulary levels can be surprisingly high in Williams syndrome children, they a...

There are two basic methods for performing steepest descent in fully recurrent networks with n noninput units and m = O(n) input units. Backpropagation through time (BPTT) [e.g., Williams and Peng (1990)l requires potentially unlimited storage in proportion to the length of the longest training sequence but needs only O(n’) computations per time step. BPTT is the method of choice if training se...

Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O(n). Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le Gall has led to an improved algorithm running in time O(n). These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show...