Search Results for "aras-daemon"

(New version 1.05 is released) Dynamic Arrays is a set of useful incredibly fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me...

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.

ArpON (ARP handler inspection) is a Host-based solution that make the ARP standardized protocol secure in order to avoid the Man In The Middle (MITM) attack through the ARP spoofing, ARP cache poisoning or ARP poison routing attack.

A Thread and Task Manager. Execute Tasks in a Thread Pool.

That project (RMOL) aims at giving developers concerned by the Revenue Management arena a library delivering a reference implementation for most of the published algorithms and methods. That library is intended to be used in simulated environment: it does not intend to be used in real world production systems.

Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks

A Color Management System library implement by Java language.

This project comprises two main parts: 1. The classic "Rodney" as described in David L. Heisermann's book "How to build your own self-programming robot", with the original Intel 8085 code. In all likelihood, this is for reference only. I don't expect many people are going to build it 2. An updated version, running on more modern hardware, but remaining true to the algorithms published in his book. The end result will be at least three sets of code, for the Alpha, Beta and Gamma...

The project implements the concept of signals and queues in the environment .NET.

...Current version (testing 0.9) features : - a reader program : allows users to browse through the code archives, organizes them by type and operating system and updates the archives from multiple XSWAG servers. - a server daemon : maintains a list of archives and provides updates to clients. - a creator program : to quickly make or modify an XSWAG archive file, add/remove sources and update sources info (os, compiler, architecture, contact info, author name, subject).

HL7 to XML Transformation toolkit. Using HL7 v2 XML

Search Agents - a framework for collaboration of meta-heuristic agents

CRCLIB is a small library of CRC calculations which can be used in other programs. Because CRC check is often used by binary communication protocols, it is made as simple as it can be, built into library so that it could be used regardless of language of application code. Written in plain C, built as dll and static library, and also contains C/C++ import header, C# wrapper and .NET project for MS SQL Server assembly. Supports CRC16 (including MODBUS) and CRC32.

The class 'JSEvaluator' in this project allows us to interpret expressions in JScript, allowing us to use parameters in the server at runtime. For example: ({@ 1} + {@ 2}) / 100; Parameter {@ 1} : 36 Parameter {@ 2}: 45 Result of the expression: 0.81

JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.

swIMP (swig-based Interfaces for Mathematical Programming) provides Java wrappers for solvers written in C or C++. The current focus is on accessing OSI-compatible linear programming (LP) solvers from the Coin-OR-project (e.g. Clp, GLPK, MOSEK, CPLEX).

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.

OCIPlus is a C++ library that can be used to access oracle database. It is similar to JDBC (has similar classes & methods) and can run stored procedures too.

Interface to deal with graphs ( Adjacency list representation ) written in C... Only basic operations available now, soon to be more =) Small project to college, not much implemented yet...

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.

Generic System for Data Processing

Graphserver provides fast shortest-path computations on very large graphs, for use as a sub-component of a trip-planning service.