A strong-willed individual with over 10,000 hours of experience in software engineering.
Passionate learner, dedicated leader, and driven engineer with a deep love for technology and people.
Developed a web-based educational platform using Django and RestrictedPython to assist instructors in teaching Python programming through a guided, constraint-based approach. The platform allows students to code within a sandboxed environment, offering features such as code saving, hint requests, and constraint-based testing. The system provides immediate feedback, helping students with basic proficiency to progress towards correct solutions. It is designed to clarify instructor expectations and enhance learning outcomes through interactive guidance and error feedback. Future enhancements include auto-grading, improved usability, and integration with AI-driven support tools.
Final Report.docx (PDF embed)
________ _______________
___ __/__________________________________ ____/__ /________ __
__ / _ _ \_ __ \_ ___/ __ \_ ___/_ /_ __ /_ __ \_ | /| / /
_ / / __/ / / /(__ )/ /_/ / / _ __/ _ / / /_/ /_ |/ |/ /
/_/ \___//_/ /_//____/ \____//_/ /_/ /_/ \____/____/|__/
__ __ _____ _____ _
\ \ / / | __ \ /\ | __ \ /\ | |
\ \ / /__| |__) | / \ | |__) / \ | | __
\ \/ / _ \ _ / / /\ \ | ___/ /\ \ | |/ /
\ / __/ | \ \/ ____ \| | / ____ \| <
\/ \___|_| \__/ \___| /_/ \___|\_\
Alias: verapak == python /src/VERAPAK
Call 'verapak' for usage
verapak:latest
Refutation-based Adversarial Robustness Verification of Deep Neural Networks
Work towards publication is in progress.
A web app built to connect workers with people that need yard work done. This could include lawn mowing, leaf raking, or snowblowing.
Built in a team of 4 in a series of sprints.Course project. The professor acted as the customer, with a specific goal in mind. All design requirements had to be cleared by him.
Use Case & Activity Diagrams.pptx (PDF embed)Final Presentation.pptx (PDF embed)
Completed for class Algorithms Under Uncertainty
README.md (HTML embed)
The plot, when run, simulates traffic.
The colors represent the number of vehicles on the road (albeit with no respect to the length of the road segment),
as a percentage of the maximum-count road segment.
Hover over roads to see their weights (the time in minutes it takes to travel across the node when no traffic is present)
Hover over intersections to see their latitude/longitude, and the number of vehicles currently queueing at that intersection.
They also show an icon representing their type (🚦: Traffic Light, 🛑: Stop Sign, ◯: Roundabout )
Stop signs will also show which sides have stop signs.
EW indicates that North-South traffic is free-flowing, while East-West traffic must stop.
NS similarly indicates that East-West traffic is free-flowing, while North-South traffic must stop.
Hover over generators to see how much traffic is generated from that direction at that intersection.
Road weight increases depending on how many cars are on it following the equation:
Stop signs allow one car from one direction every 2 seconds, plus all cars that do not collide with it.
For example, if it’s the North-bound traffic’s turn, then the first North-bound car can go.
If it turns left, then the East-bound car can go if it is turning right, the South-bound car can go if it is turning left, and the West-bound car can go if it is turning right.
If it goes straight, then the East-bound car can go if it is turning right, the South-bound car can go if it is going straight (if the East-bound car didn’t turn right) or turning right, and the West-bound car cannot go.
Etcetera.
Scenario 1: Left turn
Allowed:
- EB right
- SB left
- WB right
✓ ✓
↓ SB ↑
@←← ↘ ╰←←←✓
EB ↖ ↘ WB
✓→→→╮ ↖ →→✓
↓ NB ↑
✓ @
Scenario 2: Straight
Allowed:
- SB right
- EB right
OR
- SB straight
✓ @ ✓ @
↓ SB ↑ ↓ SB ↑
✓←←←╯ ↑ ←X ← ↓ ↑ ←X
EB ↑ WB EB ↓ ↑ WB
✓→→→╮ ↑ →X X→ ↓ ↑ →
↓ NB ↑ ↓ NB ↑
✓ @ ✓ @
Scenario 3: Right
3a: EB right
Allowed:
- SB right
- WB right
OR
- WB straight
X
↓ SB ↑ ↓ SB ↑
←←←╯ ╰←←← ←←←←←←←←←←←←
EB WB EB WB
#→→→╮ ╭→→→@ #→→→╮ ╭→→→@
↓ NB ↑ ↓ NB ↑
# @ # @
3b: EB left
Allowed:
- SB right
- WB left
✓ #
↓ SB ↑
✓←←←╯ ↗ ←✓
EB ↗ ↙ WB
#→→ ↙ ╭→→→@
↓ NB ↑
✓ @
Stop signs can allow one car from tributaries every 2 seconds, while all cars from the primary roads continue through.
Cars are only allowed to continue through the intersection if they take an action that is not going to collide with present through-traffic.
Traffic lights have phases that can contain the following parts for each direction: left turns, right turns, straights, and left yields.
Right yields are always assumed to be on.
No phase can contain phase parts that collide with one another.
These phases are rotated through by the active PhaseController.
Roundabouts let one car through from each direction every 2 seconds.
Generators generate, on average (using a normal distribution), the given number of cars per minute.
Vehicles’ destinations may be any intersection. Each intersection has a weight, increasing the odds of being selected as a destination.
env\Scripts\activatepython app.pylocalhost:8050Traffic.slnStart Without Debugging (or use Ctrl+F5)localhost:8050
This research project aimed to explore the relationships between various academic units at Utah State University (USU) through graph analysis. By creating a graph representation of USU's colleges, departments, programs, and courses, the study sought to understand the interconnections and similarities between these entities. The research employed various similarity scoring methods and community analysis techniques, such as the Jaccard coefficient, SimRank, and the Louvain algorithm, to determine how programs, particularly the Computer Science department, are related within the university's structure. The findings offered insights into whether Computer Science should be placed in the College of Science or Engineering and provided general guidance on program switching and minors for students. The project highlighted the importance of data quality and graph structure in educational data analysis.
Analyzed academic relationships at Utah State University using graph theory to assess program connections and department placements.
This study shows the similarity between programs, departments, and colleges at Utah State University. With the data collected from the university’s website, connections were made between the different programs and departments. Data was collected through the university’s website and registrar. After the data was obtained and preprocessed a graph with all of the departments and associated programs and courses was created. It analyzes the similarity between programs, majors, and minors at USU using a variety of algorithms like Jaccard, SimRank, and Panther Similarity, and Common Neighbor Centrality as well as the Louvain algorithm. Computer Science is used as an example, and is shown to easily fit into either the College of Engineering or the College of Science quite easily.
Presentation.pptx (PDF embed)Final Report.docx (PDF embed)