Open Source Windows Algorithms

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.

solwing Curl(Curl(A))+gamma*A = f vector equation in 3D

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

An enhanced Simulator based on Agent Grid Repast.It has some bugs cleared from Agent Grid Repast and has enhanced features on Group Selection Policy.

The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.

The FCC publishes pools of questions for each of the three Amateur Service (Ham Radio) license exams. Two of my programs clean and parse the files and put the questions and answers into a small lightweight database (SQLite) file. The third program generates practice tests which you can focus on particular areas of the exam or randomly select across the pool. The db file in the project is up to date as of February 3rd, 2020. When the FCC issues new/updated exam pools you can use the cleaning and parsing programs to update the database information. The project includes source code files. You may use them in your projects but you must give me attribution according to the GNU License Version 3.