#### Filter Results:

#### Publication Year

1988

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Various lines of evidence suggest that the striatum is implicated in cognitive flexibility. The neuropsychological evidence has, for the most part, been based on research with patients with Parkinson's disease, which is accompanied by chemical disruption of both the striatum and the prefrontal cortex. The present study examined this issue by testing… (More)

Interference effects on task performance in conflict situations might reflect real limitations in inhibitory capabilities or failures to fully or consistently utilize such capabilities in executive control of task performance. We propose that useful clues regarding the actual cause of interference effects may be obtained from examination of their robustness… (More)

The classical Theorem of Bézout yields an upper bound for the number of finite solutions to a given polynomial system, but is very often too large to be useful for the construction of a start system, for the solution of a polynomial system by means of homotopy continuation. The BKK bound gives a much lower upper bound for the number of solutions, but… (More)

Lattice rules are a family of equal-weight cubature formulas for approximating high-dimensional integrals. By now it is well established that good generating vectors for lattice rules having n points can be constructed component-by-component for integrands belonging to certain weighted function spaces, and that they can achieve the optimal rate of… (More)

In this article, software for the numerical approximation ofdouble integrals over a variety of regions is described. Thesoftware was written in C++. Classes for a large number of shapesare provided. A global adaptive integration algorithm is used basedon transformations and subdivisions of regions.

We reformulate the original component-by-component algorithm for rank-1 lattices in a matrix-vector notation so as to highlight its structural properties. For function spaces similar to a weighted Korobov space, we derive a technique which has construction cost O(sn log(n)), in contrast with the original algorithm which has construction cost O(sn 2). Herein… (More)

The component-by-component construction algorithm constructs the generating vector for a rank-1 lattice one component at a time by minimizing the worst-case error in each step. This algorithm can be formulated elegantly as a repeated matrix-vector product, where the matrix-vector product expresses the calculation of the worst-case error in that step. As was… (More)

CUBPACK aims to offer a collection of re-usable code for automatic <i>n</i>-dimensional (<i>n</i> ≥ 1) numerical integration of functions over a collection of regions, i.e., quadrature and cubature. The current version allows this region to consist of a union of <i>n</i>-simplices and <i>n</i>-parellellepids. The framework of CUBPACK is described as… (More)

A globally adaptive algorithm for numerical cubature of a vector of functions over a collection of <i>n</i>-dimensional simplices is described. The algorithm is based on a subdivision strategy that chooses for subdivision at each stage the subregion (of the input simplices) with the largest estimated error. This subregion is divided into two, three or four… (More)