Colley bailey biography sample
•
•
On absence and abundance: biography as method in archival research
Abstract
Geographical scholarship has rightly problematised the act of archival research, showing how the practice of archiving fryst vatten not only concerned with how a society collectively remembers, but also forgets. As such, the dominant motif for discussing historical methods in geography has been through the lens of absence: the archive is a space of ‘traces’, ‘fragments’ and ‘ghosts’. In this paper I suggest that the focus on incompleteness and partiality, while true, may also belie what many geographers working in archives find their greatest difficulty: an overwhelming volume of source materials. I reflect on my own research experiences in the pacifist archive to suggest that the growing scale and scope of many collections, along with the taxing research demands of transnational perspectives, pose immediate practical challenges for geographers characterised as much by överflöd as by absence. In the second half of
•
Bailey's FFT algorithm
High-performance algorithm
The Bailey's FFT (also known as a 4-step FFT) is a high-performance algorithm for computing the fast Fourier transform (FFT). This variation of the Cooley–Tukey FFT algorithm was originally designed for systems with hierarchical memory common in modern computers (and was the first FFT algorithm in this so called "out of core" class). The algorithm treats the samples as a two dimensional matrix (thus yet another name, a matrix FFT algorithm) and executes short FFT operations on the columns and rows of the matrix, with a correction multiplication by "twiddle factors" in between.
The algorithm got its name after an article by David H. Bailey, FFTs in external or hierarchical memory, published in In this article Bailey credits the algorithm to W. M. Gentleman and G. Sande who published their paper, Fast Fourier Transforms: for fun and profit,[3] some twenty years earlier in The algorithm can be considered a rad