Abstract:The transaction system we use today has a centralized structure where currency gets transferred througha financial institution. When you pay an invoice online or transfer money to a friend, you actually paythe bank and rely on the bank’s servers to redirect the money to the intended receiver. This means thatthe financial institutions have a lot of responsibility, which they might exploit. In 2008 Satoshi Nakamoto wrote Bitcoin: A Peer-to-Peer Electronic Cash System where he introduced a pure peer-to-peertransaction protocol. This system allows payments to be directly transferred from the transmitter to thereceiver without going through a centralized financial institution
Abstract:Concerts are a mainstay of the American lifestyle, bringing people and their bands together in an entertainment experience on the scale of a sports game where everyone wins. Making an individual’s concert experience better, both to attract more people to concerts and to improve the brand of a band, is a very profitable endeavour. Our Audience Interaction Device, or ASync, aims to achieve this goal by providing a brand new way for individuals, bands and other concert groups to interact with their audiences.
Contributers: Nicholas Aarestad, Jimmy Donadio, and Karl Olson
Abstract:We look at the various component subsystems of ’Snow Problem’s 2018 robot, Metis, named for the Greek Titan of good advice. These include the drivetrain, intake, transfer, and shooter, as well as some of the ”extras” that went into making Metis look good.
Contributers: Alex Oelke, Lane Scherber, Ryan Reding
Abstract: We compared Breadth First Search, Genetic Algorithms, and AC3 Algorithms with the test cases of N Queens and Cross Math. To do this, we created a bash script that ran a large amount of experiments with different constraints on the problems and logged CPU usage, time to completion, and memory consumption of the program and stored the results into a text file to be read later. We found that our genetic algorithm was not quite optimized and was not that useful as BFS ran in a similar if not better time. For future work, we plan to make the algorithms more efficient and rerun most of our tests.