Showing 244 open source projects for "sql command line"

View related business solutions
  • $300 in Free Credit Towards Top Cloud Services Icon
    $300 in Free Credit Towards Top Cloud Services

    Build VMs, containers, AI, databases, storage—all in one place.

    Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
    Get Started
  • Full-stack observability with actually useful AI | Grafana Cloud Icon
    Full-stack observability with actually useful AI | Grafana Cloud

    Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

    Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
    Create free account
  • 1
    TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 2
    MicroGP

    MicroGP

    A multi-purpose extensible self-adaptive evolutionary algorithm

    MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4
    Downloads: 2 This Week
    Last Update:
    See Project
  • 3
    √Math Xplorer

    √Math Xplorer

    Phần mềm toán học dạng Nhập - Xuất | Math App I/O Type

    VMath is a free math console. Currently the project is work only with Windows. For other OS please download Wine.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Opt4J

    Opt4J

    Modular Java framework for meta-heuristic optimization

    Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Gemini 3 and 200+ AI Models on One Platform Icon
    Gemini 3 and 200+ AI Models on One Platform

    Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.

    Build, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
    Start Free
  • 5
    Graphplan Implementations
    This project consists of various implementations of the Graphplan algorithm. At the moment we have two implementations of Graphplan: * Emplan - A C++ implementation for Linux, Windows and MacOS X * JavaGP - A Java implementation
    Downloads: 1 This Week
    Last Update:
    See Project
  • 6

    MSAProbs: Multiple Sequence Alignment

    One of the most accurate multiple protein sequence aligners

    MSAProbs is an open-source protein multiple sequence ailgnment algorithm, achieving the stastistically highest alignment accuracy on popular benchmarks: BALIBASE, PREFAB, SABMARK, OXBENCH, compared to ClustalW, MAFFT, MUSCLE, ProbCons and Probalign.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Genetic Programming Classifier is a distributed evolutionary data classification program. It uses the ensemble method implemented under a parallel co-evolutionary Genetic Programming technique.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8

    Dates

    Fast calendar calculations for 10,000 years (Julian and Gregorian)

    From the early 1970s up to nowadays the system date routines of computers usually mix up date with time calculations. Not only that they will expire sooner or later due to number overflow. Not only that this will make calendarian calculations extremely complicated. Fact is, that this will combine two things together which don't have anything to do with each other: The rotation of the earth around itself and the rotation of the earth around the sun, which in addition will both vary during the...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9

    Primes

    Calculate primes by using extremely fast sorting

    This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for...
    Downloads: 0 This Week
    Last Update:
    See Project
  • AI-powered service management for IT and enterprise teams Icon
    AI-powered service management for IT and enterprise teams

    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
    Try it Free
  • 10
    Current Time Designator

    Current Time Designator

    Displays all time information... at no cost!

    With this application you can know all, about current time! Day, month, year, Week day, clock (hours, minutes and seconds), time of execution of application (years, months, weeks, days, hours, minutes and seconds). -> This application has a miniscule consumption of resources. -> This application doesn't need any configuration just need to be executed.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    ArpON

    ArpON

    ARP handler inspection

    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.
    Leader badge
    Downloads: 16 This Week
    Last Update:
    See Project
  • 12
    AAARF, written in PERL and with numerous adjustable parameters, identifies sequence overlaps in small shotgun sequence datasets and walks them out to create long pseudomolecules representing the most abundant repeats in a genome.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    MassWiz

    MassWiz

    Proteomics MS/MS database search engine

    Open Source MS/MS algorithm with integrated target-decoy based FDR. Reference- http://pubs.acs.org/doi/abs/10.1021/pr200031z , Check out the wiki site for help and support - https://sourceforge.net/apps/mediawiki/masswiz/index.php?title=Main_Page
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    pycrc

    pycrc

    CRC C source generator

    pycrc is an easy to use CRC (cyclic redundancy check) calculator and C source code generator. The generated source code can be optimized for simplicity, speed or space. pycrc contains a long parameter list of common CRC models. The program is self contained and does not require installation. Apart from a python installation, it does not require other libraries to be installed.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    Utah Raster Toolkit

    Utah Raster Toolkit

    The Utah Raster Toolkit 3.0, patchlevel 2

    This is the Utah Raster Toolkit distribution version 3.0 of June, 1990. ~~~ librle.a, image.rle file type support, animation, rletogif, converters, many utilities. RLE format supports a great number of raw inner formats for applications to use, known together as .rle (ie, "stored windowing") ~~~ The Utah Raster toolkit is a collection of programs and C routines for dealing with raster images commonly encountered in computer graphics. It provides the following major functions: ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16

    GTkNN

    GPU-based Textual kNN (GT-kNN)

    The following code is a parallel kNN implementation that uses GPUs for the high dimensional data in text classification. You can use it to classify documents using kNN or to generate meta-features based on the distances between a query document and its k nearest neigbors
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17

    SWAPHI-LS: Alignment on Xeon Phi Cluster

    Smith-Waterman long DNA sequence alignment on Xeon Phi clusters

    The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de
    Downloads: 14 This Week
    Last Update:
    See Project
  • 19

    Java CoreWars Evolver

    A Java based, pMars compatible, CoreWars simulator with GA

    A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial]
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20

    Diagonal

    A command line toolki to solve a problem your favorite program defines

    Diagonal can be used for: - getting descriptive statistics such as mean/median/mode with your program producing a sample - finding a root of an equation your program defines - calculating a fixed point of a function your program defines - detecting a cycle of a fuction your program defines as well as - decoding a VCDIFF file
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21

    PartWriter

    A project designed to write sheet music.

    The project is composed of two layers. The first layer is an artificial intelligence engine, partwriter, that writes music based on some heuristic. The second layer is the layer that defines the heuristic. The definition of this heuristic defines the type of music that partwriter will create. Currently (December 2012), the deepest layer is more or less complete. The author is now writing second layers of interest, namely species counterpoint heuristics according to Fux's Gradus Ad Parnassum.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22

    Ginors Sort

    sorting algorithm for binary keys

    in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] }
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    S-Match

    S-Match

    S-Match is a semantic matching framework.

    S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    C++, Matlab and Python library for Hidden-state Conditional Random Fields. Implements 3 algorithms: LDCRF, HCRF and CRF. For Windows and Linux, 32- and 64-bits. Optimized for multi-threading. Works with sparse or dense input features.
    Downloads: 0 This Week
    Last Update:
    See Project
MongoDB Logo MongoDB