Use your Facebook login and see what your friends are reading and sharing.
Derek O'Connor's Documents
O'Connor -- Boolean Matrix Inverses
Shows that the only invertible Boolean matrices are permutation matrices and gives an $O(n^2)$ test for such matrices.
Category:Math & EngineeringReads:23Uploaded:03 / 01 / 2012ShareAdd to collectionRutherford -- Inverses of Boolean Matrices
Basic theorems on the existence of invertible Boolean matrices.
Category:Math & EngineeringReads:105Uploaded:02 / 20 / 2012ShareAdd to collectionKelly & O'Neill -- The Network Simplex Method
This is a master's thesis written by two of my students in 1991. It gives a fairly good description of the Network Simplex Algorithm and it implementation in Turbo Pascal.
Category:Math & EngineeringReads:94Uploaded:01 / 29 / 2012ShareAdd to collectionO'Connor -- Matrix Benchmarks
A short report on benchmarking Matrix Decompositions using R and Matlab on a Dell Precision 690 and a Lenovo X220
Category:Math & EngineeringReads:160Uploaded:01 / 16 / 2012ShareAdd to collectionBannon -- John F Muth (1930 - 2005)
Jack Muth was my doctoral supervisor at Indiana University, 1973-77. He is best known for inventing Rational Expectations.
Category:Business & EconomicsReads:75Uploaded:01 / 07 / 2012ShareAdd to collectionFoulds & O'Connor -- Heuristics for the Sparse TSP
Finding TSP tours in road networks where most towns are not connected directly to all others.
Category:Math & EngineeringReads:20Uploaded:01 / 03 / 2012ShareAdd to collectionO'Connor -- The Lenovo ThinkPad X220 Journey
Describes the journey of a laptop built in Shanghai and shipped to Donard, Co Wicklow, Ireland.
Category:GadgetsReads:149Uploaded:01 / 02 / 2012ShareAdd to collectionO'Connor -- Mrs La Touche of Harristown
An incomplete note on Mrs La Touche, quoted in books by Knuth, and Higham. "I do hate sums. There is no greater mistake than to call arithmetic an exact science. There are ... hidden laws of Number which it requires a mind like mine to perceive. For instance, if you add a sum from the bottom up, and then again from the top down, the result is always different". -- Mrs La Touche.
Category:HistoryReads:108Uploaded:12 / 17 / 2011ShareAdd to collectionO'Connor -- Fisher-Yates & Durstenfeld Shuffle Algorithms: History
Durstenfeld's Random Permutation (1964) algorithm is shown to be the first optimal random permutation generator to be published. It is not merely a computer version of the older Fisher-Yates Shuffle algorithm (1938) , which is not optimal.
Category:Math & EngineeringReads:258Uploaded:09 / 19 / 2011ShareAdd to collectionNg -- Argument Reduction for Huge Arguments: Good to the Last Bit
This paper shows that great care must be taken in the reduction of arguments when calculating the elementary trigonometric functions.
Category:Math & EngineeringReads:72Uploaded:09 / 14 / 2011ShareAdd to collection
