Another Perfect Semester! Seventh Semester Grades are in and I got another 4.0!
Another Perfect Semester! Sixth Semester Grades are in and I got another 4.0!
Computer Science Internship! I have accepted an internship opportunity for UPMC!
Computer Science Internship! I have accepted an internship opportunity for the IT Department at C.O.R.E.!
Grades are in! Check below for my latest 4th Semester Grades!
Operating Systems Programs Added! Be sure to check out Barbershop and HammingCode!
Deans List! I have officially made the Dean's list for the 4th Semester!
Perfect 4.0! Second Semester Grades are in -- and they are 4.0 Perfect!

Doctor of Engineering: Completed!

I have concluded my studies at Penn State University. See below for the degree-related research and project material.

Praxis

PSU Repository

View Publication

Req. Automation

IEEE Computer

View Publication

ARQM Validation

NASA

Pending

ARQM Ingestion

Requirement Analysis

View Code

Add-in (FE)

Requirement Analysis

View Code

Add-in (BE)

Requirement Analysis

View Code

Want more of my work? Please check out my Github account!

Check out my Github account to see all of my recent projects.

Project Description
ARQM API The main ARQM application. Exposes a public API that returns a quality report of any requirement document.
ARQM Add-in (FE) The front-end code for the MS Word ARQM Add-in. The program allows for the declaration of requirement hierarchy.
ARQM Add-in (BE) The back-end code for the MS Word ARQM Add-in. Primarily serves to predict requirement quality issues utilizing AI.
AI-based Emotion Recognition Utilizes different AI models to detect sentiment and mood within text.
AI-based Tic-Tac-Toe Reinforcement learning-based implementation to simulate 5x5 tic-tac-toe with an AI Agent.
AI-based Food Scarcity Prediction An AI algorithm that predicts the chance of food scarcity for a given location given certain environmental factors.
C++ Compiler A compiler that converts C++ code into machine code. Support for complicated programmatic structures.
Mock Market An application that simulates sample market trading and results based on real-time market data.
Mock Market Server The server that handles the mock market API requirements, including market transactions.
Cyber Vault An application that utilizes encryption to secure sensitive files.
Professional Site The main site used to display Dr. Porter's information including projects and professional details.
Linux Backup System A bash script that dynamically allows for the backup of a linux-based system through the google drive API.
Database Management System A system that simulates the complexities of an RDMS, allowing for basic database operations.
Database Management System (2nd iter.) An extension to the original database management system that extends upon existing database operations support.
Indigenous Web Crawler A web crawler that collects and analyzes languages via the Twitter API.
Minesweeper A simple implementation of the Minesweeper game. Allows for an arbitrary size board and difficult.

Finally, I have completed my C++ Compiler!

The Project Includes five phases: Lexical Analysis, Parsing, Intermediate Code Generation, Code Optimization, and Code Generation.

How did I get an 'A' in Operating Systems?

In a class where 90% of the students score below an A, I showed efficiency and innovation in my programming assignments to put me over the top.

Here are two programs from my Operating Systems class. Included are the programs Barbershop.java and HammingCode.java
The Barbershop program, per Wikipedia, is a classic inter-process communication and synchronization problem between multiple operating system processes. The problem is analogous to that of keeping a barber working when there are customers, resting when there are none, and doing so in an orderly manner. Code: BarberShop.java, Barber.java, Customer.java, TestCustomer.java
This program's purpose was in the field of error detection. With the concept of RAID storage backup, hamming code provides a way to detect an error through the use of syndrome bits. Say, for example, a bit was wrongly flipped through a data writing process, this program could detect such an error and write the corrected byte to memory. Additionally, the program can detect the occurence of more than one error. It cannot, however, fix such a problem. Code: Hamming.java

Advanced Data Structures: The Hardest Class Yet.

In ADS, we learned about algorithm enhancement, efficiency, computational geometry, and graphs. Luckily, I received an 'A' for the course.

Here are three programs from my Advanced Data Structures' Class. Included are the programs QuickSortNinther.java (Programmatic Modification), SplayBST.java, and BreadthFirstDirectedPaths.java
Per wikipedia, Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. This algorithm has a Worst-case performance of O(n2), while the Best-case scenario yields O(n log n) time complexity. Code: Assignment3.java, QuickSortNinther.java, QuickNonShuffle.java, QuickShuffle.java, results.xlsx
Per wikipedia, A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n) amortized time. Code: Assignment4.java, SplayBST.java, RedBlackBST.java, Queue.java
Per Sedgewick's website, this class represents a data type for finding shortest paths (number of edges) from a source vertex (or set of source vertices) to every other vertex in the digraph. This implementation uses breadth-first search. Code: Breadth.java, Digraph.java

Check out the stories Below!

These Stories are from the evllabs.com website, and they discuss my work with the role I play in EVL team as a Researcher.


Contact

United States

Phone: N/A

Email: zachchilders3141592@gmail.com

-->