We describe a theory to account for the acquisition and extinction of response rate (conditioning) and pattern (timing). This modular theory is a development of packet theory (Kirkpatrick, 2002; Kirkpatrick & Church, 2003) that adds a distinction between pattern and strength memories, as well as contributing closed-form equations. We describe the theory using equations related to a flow diagram...

We develop the cavity method for the spherical Sherrington-Kirkpatrick model at high temperature and small external field. As one application, we carry out the second moment computations for the overlap and the magnetization.

The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. We maintain the set of points under insertions and deletions of points and we are able to report an approximation of the width of this dynamic point set. Our data structure takes linear space and allows for reporting the approximation with relative accuracy in O( p 1= logn) time...

The output-sensitive “ultimate planar convex hull algorithm” of Kirkpatrick and Seidel [16] recently has been shown by Afshani et al. [1] to be instance-optimal. We revisit this algorithm with a focus on space-efficiency and prove that it can be implemented as an in-place algorithm, i.e., using O(1) working space.

Land-grant institutions were designed to improve the lives of individuals and communities by removing barriers education. However, despite years effort address lack scholars color at these institutions, disparities have persisted. Many graduate students faculty reported that workshops meant diversify academia their did not speak unique experiences or challenges. Ultimately, this contributed dec...