Search Results for "command-line" - Page 4
Sort By:
Showing 274 open source projects for "command-line"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
1
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. -
2
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: ... -
3
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 -
4
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. -
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
5
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
-
6
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] -
7
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 -
8
Javascript-Voronoi
JS implementation of Fortune's algorithm to compute Voronoi cells
This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you need dynamic tessellations or diagrammatic layouts. ... -
9
Line Integration Convolution
Line integral convolution is a technique to visualize vector fields.
Line integral convolution (LIC) is a technique to visualize vector fields with striking effect images. -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
E-w0rm : is a powerfull shell with handy features like : file manager , password change , database manager , bind shell , remote shell , remote upload , edit , chmod , delete , make , autoroot , php code execution , server command execution , process manager ... You can also change theme ! And " E-w0rm " brought to you by : Epic Hackers S.C Scan : https://goo.gl/718BkD
-
11
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. -
12
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); [...] } -
13
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...
-
14
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,... -
15
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.
-
16
msp
mathSuite Speed & Matrix Stream Processor
This program is fundamentally a short-sized version of my mathSuite program: https://sourceforge.net/projects/mathsuite/ It includes all the functionalities of MSCenv (mathSuite Calculus Environment), such as inline variables and functions (mainly thanks to ExprEval), which you can use to perform expensive complex computations and store their results into runtime variables. You can perform also every Linear Algebra Operations included in mathSuite with new optimizations. -
17
OptimC
OptimC - Optimization / Unconstrained Minimization Library in ANSI C
OptimC is a C software package to minimize any unconstrained multivariable function. The algorithms implemented are Nelder-Mead,Newton Methods (Line Search and Trust Region methods), Conjugate Gradient and BFGS (regular and Limited Memory). Brent method is also available for single variable functions if the bounds are known. Update 06/09/2014 - Nonlinear Squares Implementation [Levenberg-Marquardt Method] Added. Documentation - http://code.google.com/p/optimc/ -
18
ehcp for Ubuntu is a hosting control panel, for multiple domains on single machine. easily installable,easy usage, non-complex,functional. homepage:http://www.ehcp.net * automatically installs and works: dns, apache, mysql, ftp, email, domains,auto updat
-
19
Genetic Programming in OpenCL is a parallel implementation of genetic programming targeted at heterogeneous devices, such as CPU and GPU. It is written in OpenCL, an open standard for portable parallel programming across many computing platforms.
-
20
-
21
CUSHAW2: Parallel Gapped Read Alignment
One of the leading short-/long-read aligner to large genomes
CUSHAW2 is a fast and parallel gapped read alignment to large genomes, such as the human genome. The performance evaluation, by aligning simulated and real datasets to the human genome, shows that CUSHAW2 is consistently among the highest-ranked aligners in terms of alignment quality for both single-end and paired-end alignment, while demonstrating highly competitive speed. Furthermore, our aligner shows good parallel scalability with respect to the number of CPU threads. -
22
DRAMMS
A Deformable Medical Image Registration Toolbox
...Some typical applications of DRAMMS include, -- Cross-subject registration of the same organ (can be brain, breast, cardiac, etc); -- Mono- and Multi-modality registration (MRI, CT, histology); -- Longitudinal registration (pediatric brain growth, cancer development, mouse brain development, etc); -- Registration under missing correspondences (e.g., vascular lesions, tumors, histological cuts). DRAMMS runs in command line in UNIX/Mac OS, It accepts Nifti/ANALYZE/MetaImage image formats. It is fully-automatic --- takes two input images, and generates a registered image and (optionally) the deformation field. More information (installation, tutorial, manual, demonstration, FAQ, etc) can be found at http://www.rad.upenn.edu/sbia/software/dramms/ . -
23
BudgetedSVM
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
...BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classi fication problems with millions of high-dimensional examples within minutes on a regular personal computer. We provide command-line and Matlab interfaces to BudgetedSVM, efficient API for handling large-scale, high-dimensional data sets, as well as detailed documentation to help developers use and further extend the toolbox. -
24
A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)
-
25
SEO & SEM - Marketing Text Writer
Open Source SEO & SEM Text Creation Tools for free Article Writer
Open Source Tool for Search Engine Optimization (SEO & SEM) used for automatic content processing. These SEO Content Genrators and Article Writers based on Text...
