The lattice A∗ n is an important lattice because of its covering properties in low dimensions. Clarkson [1] described an algorithm to compute the nearest lattice point in A∗ n that requires O(n log n) arithmetic operations. In this paper, we describe a new algorithm. While the complexity is still O(n log n), it is significantly simpler to describe and verify. In practice, we find that the new a...

Individual focus and knowledge contribution Lada A. Adamic, Xiao Wei, Jiang Yang, Sean Gerrish, Kevin K Nam, Gavin S. Clarkson How today’s college students use Wikipedia for course-related research Alison J. Head, Michael B. Eisenberg Peer governance and Wikipedia: Identifying and understanding the problems of Wikipedia’s governance Vasilis Kostakis The role of advertising in financing open acc...

Citation for published version: Perkins, EM, Clarkson, YL, Sabatier, N, Longhurst, DM, Millward, CP, Jack, J, Toraiwa, J, Watanabe, M, Rothstein, JD, Lyndon, AR, Wyllie, DJA, Dutia, MB & Jackson, M 2010, 'Loss of -III Spectrin Leads to Purkinje Cell Dysfunction Recapitulating the Behavior and Neuropathology of Spinocerebellar Ataxia Type 5 in Humans' The Journal of Neuroscience, vol 30, no. 14,...

Erik Bollt, Pawe l Góra, Andrzej Ostruszka, and Karol Życzkowski Department of Mathematics & Computer Science and Department of Physics, Clarkson University, Potsdam, NY 13699-5805 Department of Mathematics and Statistics, Concordia University 7141 Sherbrooke Street West, Montreal, Quebec H4B 1R6, Canada Institute of Physics, Jagiellonian University, ul. Reymonta 4, 30–059 Kraków, Poland Center...

This means that every F ∈ Fd satisfies: (i) (non-negativity). For finite intervals I = (a1, b1] × · · · × (ad, bd] ≡ (a, b], with a, b ∈ Rd, F (I) = ∆dF (a, b] ≥ 0 where ∆d denotes the d−dimensional difference operator. (ii) (continuity from above). If y ↓ x, then F (y) ↓ F (x). (iii) (normalization). If x1∧. . .∧xd → −∞, then F (x) → 0; if x1∧. . .∧xd → +∞, then F (x) → 1. (See Billingsley [4]...

ING COMPLEXITY FOR DESIGN PLANNING................................................................... 20 DAVID WYNN, CLAUDIA ECKERT AND P JOHN CLARKSON DESIGN CHANGE AND COMPLEXITY ............................................................................................. 24 CHRIS EARL, CLAUDIA ECKERT, JOHN CLARKSON CREATIVITY IN THE DESIGN OF COMPLEX SYSTEMS ....................................

By making use of the MHD self-induction equation in general relativity (GR), recently derived by Clarkson and Marklund (2005), it is shown that when Friedmann universe possesses a spatial section whose Riemannian curvature is negative, the magnetic energy bounds computed by Nuñez (2002) also bounds the growth rate of the magnetic field given by the strain matrix of dynamo flow. Since in GR-MHD ...

We show that the number of unit distances determined by n points in R is O(n), slightly improving the bound of Clarkson et al. [5], established in 1990. The new proof uses the recently introduced polynomial partitioning technique of Guth and Katz [12]. While this paper was still in a draft stage, a similar proof of our main result was posted to the arXiv by Joshua Zahl [25].