Open Source Windows Algorithms - Page 42

Project consists in a software that reads a copied web site to your computer and generates a graph model of it. The model is based on the links, which are seen as the edges, and the pages, which are the vertices of the graph.

A handy tool with graphical interface that generate weight vectors for multi-objective optimization algorithms. source: https://github.com/ahmed-fathy/weight-vectors

KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.

This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups.

Track your friends in real time on a map.. and many more features

This application talks to a GPS device over the NMEA protocol via the WIGSGPSComm API. The first version of the WIGS application will present the GPS data in an intuitive fashion, and later releases will be further enhanced with special map support.

Extract a Term Concept Map from Wikipedia. It takes an export of the Wikipedia and imports it into a database. The extracted term concept map can then serve as a basis for semantically enhancing applications, with the depth and bredth of the Wikipedia.

Simple platform independent library for comparing strings against the wildcard masks.

Wilderness mapping system aimed to help automate trip planning in the Boundary Waters Canoe Area Wilderness. This is part of an undergraduate senior design project sponsored by the University of Minnesota Electrical and Computer Engineering Department.

The Wittgen programming language consists of just two instructions and one special variable name. Wittgen allows you to assign any text string to a variable of any name. It also allows you to retrieve the text assigned to that variable. Lastly, it has a special variable called “Doing Now”. Every execution step consists of retrieving the contents of Doing Now, removing the first assign found in that content and performing that assign. In the course of performing that assign any retrieve operations indicated in the text are performed before committing the assign. That is all there the system does. The driving motivation for this design is that as far as we know, the human mind supports these two instructions.It may have additional mechanisms that create new assigns, but using the results of these mechanisms requires a system built from these instructions.

WordSort is an algoritm written in c# specifically designed for string sorting with linear complexity. Based on partial hashing approach, provides higher performance than classical algorithms that use the comparison. WordSort includes a console application easy and intuitive to use to evaluate and compare algorithms performance. Only Ordinal sorting and non-case-sensitive sorting provided.

X For You Feed Algorithm is the open-sourced core recommendation system that powers the For You feed on X (the social network formerly known as Twitter), and it represents one of the first times a major social platform has published production-level ranking code for public review and experimentation. The repository contains the full pipeline that ingests user engagement and content candidate data, processes it through retrieval, hydration, filtering, scoring, and selection layers, and ultimately ranks posts to show what appears in a user’s feed. At its heart, the system uses a transformer-based model adapted from xAI’s Grok architecture to predict probabilities for various user actions (such as likes, replies, reposts, clicks, and negative signals), then combines those into a weighted final score that drives ranking.

X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.

XMLMath evaluates mathematical, logical or textual expressions described in xml and prints the result. For example, to compute the result of 1 + 1, you would write: <add> <long value="1"/> <long value="1"/> </add>

A simple PHP parser class that scans through poorly formed html documents as if they were valid XML, and generates calls to customizable callback functions.

This software provides an easy graphical way to encrypt your text documents from source code , text files ,scripts even jpeg files .It is a enhanced version of my earlier project https://sourceforge.net/p/xorencrypt which used win32 GUI . This is a demonstration of working of XOR encryption which was used by Germans in World War II (http://en.wikipedia.org/wiki/Lorenz_cipher) . Besides from XOR'ing the message with password after every encryption the key changes pseudorandomly. The password you provide is hashed ( SHA256 ) and saved into the encrypted file to check if the password provided is correct.This algorithm has limitations in general more the numbers of relative characters in the password to plaintext more secure will be the encryption. XOR encrypt has a 3.5 of 5 editors rating from softpedia http://www.softpedia.com/get/Security/Encrypting/XOR-Encrypt.shtml

XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.

An implementation of the 'Provider' pattern for .NET 1.1 framework, plug in installation support, and generic entity model base classes capable of binding to a user interface.

A logging framework that exposes a single log api to clients. Applications can configure the implementation, including filtering options using the provider pattern support in the xqs-provider project.

YACS (Yet Another Constraint Solver) is a Java library and an object-oriented framework for constraint solvers. It supports propagating and solving of constraint satisfaction problems with finite and infinite domains (discrete values and real intervals).

yaghi (Yet Another GrapH Implementation) is a Free (as Freedom) Implementation in C++ for the data structure "Graph" using the STL library.

Lago is a study-oriented library of classic data structures and algorithms implemented in JavaScript with an emphasis on readability and learning. Instead of aiming to be a production runtime, it serves as a reference you can step through to understand how arrays, stacks, queues, linked lists, trees, heaps, graphs, and sorting/searching routines actually work. The implementations favor clarity over micro-optimizations, making them approachable for learners who are new to algorithmic thinking or coming from non-CS backgrounds. Because the code is idiomatic JavaScript, it also helps front-end engineers strengthen fundamentals without switching languages. The repository’s structure lets you browse topic by topic and compare trade-offs such as time versus space complexity. It’s a handy companion to interview prep lists: after reading a concept, you can open the matching Lago implementation and trace it line by line.

Yaobi is a fast collision detection library for general triangulated objects. It uses a hierarchical representation based on oriented bounding boxes. Yaobi compares well with other libraries when it comes to speed and memory consumption.

ZH软件&源码库

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.