Tutorial Contents

Acknowledgements

Contents

Acknowledgements

The Spike Sorter Wizard makes use of the approximate nearest neighbour k-d tree search library written by David M. Mount and Sunil Arya. This has been made available under terms of the GNU Lesser Public License.

I gratefully acknowledge John Pezzullo for permission to adapt the source code from his non-linear curve fitting web page.

Code for principal component analysis is adapted from code retrieved from StatLib, and I gratefully acknowledge Fionn Murtagh as the originator of this code.

The code for robust estimation (LOWESS) is adapted from that by H. Freudenriech in the IDL Astronomy Library.

The code for clustering has been kindly made available by Charles A Bouman, Purdue University.

Copyright (c) 1995 The Board of Trustees of Purdue University.
In no event shall Purdue University be liable to any party for direct, indirect, special, incidental, or consequential damages arising out of the use of this software and its documentation, even if Purdue University has been advised of the possibility of such damage.
Purdue University specifically disclaims any warranties, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. The software provided hereunder is on an “as is” basis, and Purdue University has no obligation to provide maintenance, support, updates, enhancements, or modifications.

Many of the ideas for interface elements derive from articles posted on the Code Project.