Doctor of Philosophy
PhD Candidate, Computer Engineering,
Santa Clara University, Computer Engineering PhD Candidate, 9/2007 – Present.
Stephen’s PhD thesis research is focused on streaming OLAP. Traditional data base schemas used for data warehousing are centered on the Star Schema, which cannot keep up with high ingest rates required for data streaming. He has thus created a new type of database schema called the Stream Star Schema which is optimized for high input rates.
Stephen’s work is written in C and Python and designed to run on Linux and UNIX. It consists of an ingest data base that is optimized for high input rates. This is appropriate for streaming OLAP. He has created a new type of Star Schema called Stream Star Schema. Stephen has modeled the Stream Star Schema on the network data stream and the file object data stream. The results are significant. For the network data stream the Stream Star Schema is 177 times faster. For the file object data stream the Stream Star Schema is 39 times faster.
- Paper: Petascale Davice Management in RESAR
Paper : Efficient Lossless Real-Time Stream Processing
- Paper: Extending OLAP Hypercube beyond Aggregates and Summaries
Aurora University, M.S. Computer Science, 2/1989
Stephen’s Master’s thesis was in the area of artificial intelligence: machine learning. Such research is usually applied to game theory since games provide a narrow well defined universe. The game must be of sufficient complexity to alleviate rote learning that is brute force learning where the computer generates all possible moves and can thus always pick the best move. Checkers, chess, and Go are common choices. Stephen chose ScoreFour, which is three-dimensional tic-tac-toe with four in a row. His research was based on two of Findler’s learning techniques: polynomial learning (with aggression) and generalization learning. He implemented both techniques and conducted a playoff and performed a statistical analysis of the results.
- Paper: An Analysis of Polynomial and Generalized Learning as Applied to the Game of Score-Four
Bachelor’s of Science Degree
Pacific Lutheran University, B.S. Mathematics, 5/1982.
Stephen’s Bachelor’s thesis was on Pafnuty Chebyshev’s approximate to polynomials. Chebyshev’s work is an extension of the quadratic equation which gives a formula for solving a polynomial of degree two. Mathematicians have been unable to discover a similar equation for polynomials of higher degree. Thus Chebyshev created an approximation theorem.
- Paper: Tchebysheff’s Approximation to Polynomials