One platform to build, fine-tune, and deploy ML models. No MLOps team required.
Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
Try Free
Compliant and Reliable File Transfers Backed by Top Security Certifications
Cerberus FTP Server delivers SOC 2 Type II certified security and FIPS 140-2 validated encryption.
Stop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
Incredibly fast Dynamic Arrays classes written in Delphi and C++
(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...
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.
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
...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).
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).
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.
"Extended Data Types for PHP" is a collection of PHP5 classes, which provide easily usable common data types like Lists, Trees or Graphs. Installation will be possible via an PEAR Channel or as local library in a website's code base.
Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!
Random Thoughts On Distributed Algorithms: a collection of tools and ideas for the development of distributed applications. The first released part is an RxRPC security model based on OpenSSL and elliptic curve criptography. Please check docs for info...