Projects

In the summer of 2020 I worked as a full-stack developer at Pixameter, a small start-up specializing in wound measurement. While there, my responsibilities included the following:

• Developed front-end and back-end services to allow patients to share personal information with their medical providers through a telemedicine web application using Node.js and MongoDB.

• Translated high-level requirements and customer needs into new, reliable functionality and intuitive interfaces.

• Designed and implemented a new feature, utilizing Google Cloud API's, to allow users to find nearby pharmaceutical services.

• Improved the existing code-base by introducing Bootstrap grid to achieve responsive design.

I created a Game of Life application as a fun way to learn React and satisfy my fascination with cellular automata.

Integrated test-driven development practices into the construction of an Android appointment book application in Java to create, organize, and search for appointments.

Collaborated with a team in Agile Sprints and created an AI player program in Java to compete in the 2020 MIT Battlecode tournament.

I created this project as states were beginning to attempt to reopen from Covid-19 shut downs in spring of 2020. I wanted to create a way to compare covid cases numbers between states to analyze the affect reopening descisions were having. I wanted to gain more competency with CSS, so I kept the tech stack to a minimum, rather than rely frameworks, such as Bootstrap. It started out as a single page web application, but later I added an Express backend.

Created a Flask web application on Google Cloud’s App Engine utilizing Google’s Vision API to automatically generate accessible HMTL image tags for uploaded photos in Cloud Storage.

Similar to Sudoku, the puzzle board is divided into regions where each region, row, and column can contain no more than two stars and stars may not be placed adjacently. I implemented the AC-3 constraint satisfaction algorithm to solve these puzzles. The AC-3 algorithm uses a back-tracking search. At each step a feasible move is attempted, then any moves that are no longer feasible are eliminated. Additionally, checks occur to make sure that the board is not impossible to solve given the current configuration. If it is, it backtracks to the last move and tries an alternative feasible star placement.

Courses, such as Artificial Intelligence and Theory of Computation left me intrigued by the idea of cellular automata and other simple computational models. I created an interactive program in Haskell that allows users to input starting configurations of alive cell and rules to determine which cells reproduce, so they can discover for them selves new intriguing patterns. This project served as a great learning opportunity to become more fluent coding using functional paradigms and also gave me a solid understanding of language concepts such as the type system, which has helped me understand more fully other strongly typed languages, such as Java.

Utilized developmental paradigms, such as Lindenmayer systems, recursive decomposition, and iterated function systems, to create a portfolio of fractal images.