Search

Tour Planner Web App

This app was built using Java Spark and Maven for the back-end and React and npm for the front-end. It was deployed to GitHub for releases, automation, workflows, and version control. It is an app that helps users build tours, whether for work or a vacation. Places can be added using the map or the add places button, both explained in detail in the belowe sections. These will appear as their names and display their coordinates in the list below the map. The app also allows you to optimize the tour so there are no overlapping lines and the trip can be efficient. The first location is the starting city and will also be the ending city so the distances are calculated using modulo so the last leg distance is between the last place and the first one. The tests were created using JUnit for unit testing, Jacoco and Jest for coverage testing, and Postman for integration testing.

Using Dijkstra to Route Packages in a Network Overlay

The goal of this project was to use an overlay to communicate between messaging nodes (clients) and the Registry (server) to send messages using threads. It follows the principles of TCP/IP protocols and overlays used in P2P systems. The registry accepts messaging nodes using a server socket and creates receiver and sender threads for that connection. The messaging nodes also have their own sets of threads for the registry and peers. The foreground process in the Registry allows the users to specify commands that creates the undirected graph with all registered nodes, connect to peers to form bidirectional connections, and start sending messages. When all nodes finish messaging each other randomly, the statistics are collected and can be compared to see if any packets were lost during the period.

Graph Algorithms and Visualization

This is a working graph visualization and algorithms program that produces outputs to common graph algorithms and images for certain graphs. It uses the Graphviz library for C++ to generate graph images, but the other algorithms are implemented by me. There are four graphs produced by the directed and undirected versions each. Each will have information regarding the operation and print the graph along with the paths in red if applicable. As for the algorithms, the results are outputted to the console, but the program supports most algorithms on graphs.

Distributed_Analytics_of_US_Residential_Zoning

This is a project that aims to do distributed analytics using clusters using a spatial dataset. Our goal with this project was to analyze the impact of single family rresidential zoning in the US and correlate it to quality of life measures in an effort to dissuade a segreggation of zoning types and promote inclusivity. We hoped to be able to compare the results against data from other countries that have more includive zoning laws, but this was not possible due to constraints on data availability and language barriers. For the distributed component, we are using a cluster of 10 machines that are managed by Yarn. To do the processing of data and calculations, we applied Spark using Java and Gradle. The data itself was stored using HDFS and totaled to ~3.2 GB. For more detail on our motivation, procedures, project structure, and results, please reference the latex file or the presentation in the GitHub repo.

Fast Multithreaded Matrix Multiplication

This is a very efficient matrix multiplication calculator built using Java and its concurrency libraries. It can be used to multiply matrices populated using a random seed, but it can also be modified to use predefined values. The command line gives you the option to define the size of the matrices, which will be the same for both matrices, the seed used in random to populate the matrices, and the number of threads. The features list below describes the optimizations.

Japanese-To-English Translator

This is a translator program I built using Python that will take in a sentence in Japanese and translate the parts of the sentence into English and return an English translation. The original senetence is first split into various parts of speech using Japanese particles, which determines the transitivity of the verb if present and if a copula is present. Each part of speech is further broken down depending on the characters, length, conjugation, pairing, and use. This program does utilize the googletrans library as making a translator is a near impossible task, especially without the use of machine learning. The main feature of the program is to take the individual parts of the sentence, translate it using a csv with common words in Japanese, match it to a part of speech in English, and return that to the user. To learn more, click on the github icon next to the title of the project.

Personal Website

The website you are on! This is my personal website I created using Python's Django framework for the back-end and pure Javascript, HTML, and CSS for the front-end with some help from Bootstrap5. Please feel free to explore the website and the various projects, courses, and features. If you would like to contact me, you can do so using the contact tab or my contact information from the sidebar.

Handwritten Letters to 3D-Printed Braille Letters

This is a team project for my CS370 class that involved the use of a Raspberry Pi to communicate and coordinate two external devices. I acted as the team leader and inititated the project, managed the repository for the project, and coordinated the tasks of each member. The goal of the project was to use a camera to take a picture of some handwritten text, which is then uploaded to the Raspberry Pi. Using Python, we would preprocess the image, and use OpenCV to find and extract contours, leading to individual letters of specific size. The letters would then be sequentially classified by a convolutional neural network trained using the EMNIST dataset on handwriting. After this, the letters are combined using stl models into a single 3D model along the y-direction. We used slic3r to slice the stl file into gcode using the shell and sent that to the Raspberry Pi using ssh and sftp. The pi would then serially send each line of gcode to the printer to be printed.

Heuristic Algorithms for Approximating the Traveling Salesman Problem

This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are size different combinations and explanations for these can be found in the sections below. The program allows you to run each algorithm individually or run a benchmark for all 6 and the original unoptimized list. The results are formatted in a table and displayed in the console. As the algorithms have different time complexities, the time it takes increases for some algorithms drastically, so use caution when using many places.

Great Circle Distance Calculators

This program calculates the distances between coordinates using a possible of three formulas: Vincenty, Cosines, or Haversine. You can choose to use places through the command line or through a file. I would recommend using the file for more than 5 places as it becomes cumbersome to keep adding it through the shell. You can also choose to generate any number of places and then do the calculations.

Infix Expression Calculator

This calculator app utilizes Java and the Swing framework for the calculations and design. Each frame, panel, and component is custom design that is made to look similar in GUI to the calculator offered by Microsoft. It features tons of operations, help menus, an output screen, an operation screen, history tab with details abou the previous calculations, etc. For the actual calculations, it is programmed in Java, so it utilizes most available data structures, sorting algorithms, paring, error handling, etc.

CS314: Software Engineering

Introduced team-based development of large, complex systems that supported Scrum-based development while completing a semester-long web development project to prepare for the industry. Topics included clean code, configuration management, continuous integration, testing, requirements, project management and teamwork. The process tools used include Visual Studio Code, IntelliJ IDEA, Linux, Docker, Git, GitHub, Maven, NPM, Webpack, JUnit, Jest, Postman, Zenhub, and Code Climate. The technology tools used include: Linux, Java, JavaScript, ReactJS, Reactstrap, React Leaflet, SQL, MariaDB, Java Spark, Java Concurrency, SLF4J, uLog, JSON, and KML.

CS312: Modern Web Applications

Developed fully functional modern web applications which included rich graphical content and dynamic content. Explored service-based architecture, web UX design, asynchronous content delivery, and full-stack development.

CS345: Machine Learning Foundations and Practice

Introduced machine learning algorithms and tools for predictive modeling presented using case studies that inform their use in real-world applications. Utilized python, numpy, pandas, matplotlib, R, etc. for data analysis and predictions.

CS 214: Software Development

Developed large software systems in teams. Designed and enhanced the features and quality of a large system while using tools for software engineering and project management.

DSCI369: Linear Algebra for Data Science

Learned and utilized techniques in linear algebra related to data science using MATLAB. Topics learned include matrices, bases, subspaces, linear independence, dimension, change of basis, projections, linear systems of equations, least squares, matrix factorizations, eigentheory, singular value decomposition, and angles between subspaces.

CS220: Discrete Structures and their Applications

Practiced the use and implementation of integer representations and properties, propositions, predicates, sets, functions, program proofs, induction, counting, complexity, graphs, trees, invariants. Accompanied lectures with Python assignments and labs.

Ayush Adhikari