Jason Arrabito
Project |
Information |
Code/Files |
|
|---|---|---|---|
| Perfect Home Website |
This is a website that I have designed and written for a family friend. I continue to maintain the website. There is a static desktop version, and then the latest responsive version. This is the currently hosted version. |
|
|
| VIPKID Timer GUI |
This personal project involved recreating a standard timer that will lay on top of all other windows and have the simple functions I need to use while teaching a VIPKID class. The timer keeps time by using the elapsed time of system timer in nanosecond increments. |
|
|
| CG Raffle |
I initially created this to simplify the raffle process for Camp Gladiator raffles held by trainers. Once completed I realized that although it is easy to use, most people would have trouble downloading and running a .jar file. |
|
|
| POKER |
In this project I challenged myself to create an algorithm, any algorithm, to simulate a poker game. I given each card a value and in turn have given series of sets initial values. For example: If computer has five cards and two are of the same suit then the "pair" is assigned an initial value of 100. The values of the cards in the pair are then added to that one hundred. A pair of aces would yield 128 (100 + 28). In the even that player and computer both have a pair then the next highest card outside the pair is compared. The computer is programmed to find the best possible hand witout comprimising the current hand. Comments are sparse in the code, but most method names help clarify. A more adverse betting system is pending. |
|
|
| Quick Sorter |
This is a project for an Algorithms class. The purpose of this project was to implement 4 different versions of the Quick Sort Method and then compare them for time efficiency. The four Methods were Quick Sort with random pivot selection, Quick Sort with a Median of Medians (groups of size 3, 5, and 7), Quick Sort with Heuristics (detailed in project file), and Quick Sort with a Randomized median finding algorithm. The program allows you to sort the same randomly generated array as many times as the user would like using any version or modification of Quick Sort. Users are allowed to generate arrays up to size 10,000,000 and are prompted to print both sorted and unsorted arrays, although this is discouraged for larger arrays. To increase diversity I have added the option to sort a random section of an array before it is sent to the algorithms, or sort a percentage of the array beforehand. This newer code is pending debegging of the percentage sort algorithm. Both versions (the initial project code, and modified random/percentage sort code) are posted here. |
|
|
| Arima/SVM Hybrid |
This project involved anaylizing a paper titled "A hybrid ARIMA and support vector machines model in stock price forecasting", by Ping-Feng Pai and Chih-Sheng Lin. Using a formula for the Hybrid Model presented in the paper, as well as WEKA software, we were able to replicate the results using 12 recognizable stocks during a four month time period from May 2009 to September. In the links on the right you will find the original papaer, a presentation of results, the results, WEKA software used to generate the predictions, and error percentages. |
|