Computer Science Technical Reportshttp://hdl.handle.net/2104/48242016-02-12T20:30:32Z2016-02-12T20:30:32ZRecommendations Made EasyGuinness, DarrenKarbasi, PanizNazarov, RovshenSpeegle, Greghttp://hdl.handle.net/2104/91222016-01-21T21:22:05Z2014-06-23T00:00:00ZRecommendations Made Easy
Guinness, Darren; Karbasi, Paniz; Nazarov, Rovshen; Speegle, Greg
Fueled by ever-growing data, the need to provide recommendations for consumers, and the considerable domain knowledge required to implement distributed large scale graph solutions we sought to provide recommendations for users with minimal required knowledge. For this reason in this paper we implement a generalizable 'API-like' access to collaborative filtering. Three algorithms are introduced with three execution plans in order to accomplish the collaborative filtering functionality. Execution is based on memory constraints for scalability and our initial tests show promising results. We believe this method of large-scale generalized 'API-like' graph computation provides not only good trade-off between performance and required knowledge, but also the future of distributed graph computation.
2014-06-23T00:00:00ZMatrix Representations of GF(p[superscript n]) over GF(p)Maurer, Peter M.http://hdl.handle.net/2104/89282016-01-21T20:25:35Z2014-01-31T00:00:00ZMatrix Representations of GF(p[superscript n]) over GF(p)
Maurer, Peter M.
We show that any non-singular nxn matrix of order p[superscript n]-1 over GF(p) is a generator of a matrix representation of GF(p[superscript n]). We also determine the number of matrix representations of GF(p[superscript n])GF(p) over GF(p), and then number of order p[superscript n]-1 matrices in the general linear group of degree n over GF(p). The theorems are easily generalizable to arbitrary field extensions.
2014-01-31T00:00:00ZFields and Cyclic Codes for Error DetectionHess, Rachel N.http://hdl.handle.net/2104/88942016-01-21T21:19:44Z2014-01-14T00:00:00ZFields and Cyclic Codes for Error Detection
Hess, Rachel N.
This technical report discusses some of the aspects of error detection using finite fields.
2014-01-14T00:00:00ZThe Conjugacy Classes of 3x3 and 4x4 Matrices Over GF(2)Maurer, Peter M.http://hdl.handle.net/2104/88062016-01-21T20:27:11Z2013-09-20T00:00:00ZThe Conjugacy Classes of 3x3 and 4x4 Matrices Over GF(2)
Maurer, Peter M.
The general linear groups over GF(2) have an intricate and interesting structure. This report does some preliminary work in examining the structure of two of these groups by giving the conjugacy classes of 3x3 and 4x4 matrices over GF(2).
2013-09-20T00:00:00Z