Search Results for "b-tree implementation"
Sort By:
Showing 28 open source projects for "b-tree implementation"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
1
CycleGAN and pix2pix in PyTorch
Image-to-Image Translation in PyTorch
CycleGAN and pix2pix in PyTorch repository is a PyTorch implementation of two influential image-to-image translation frameworks: CycleGAN (for unpaired translation) and pix2pix (for paired translation). This repo gives developers and researchers a convenient, modern (PyTorch-based) platform to train and test these methods — supporting both paired datasets (input to output) and unpaired datasets (domain-to-domain) with minimal changes. The code supports standard training and inference... -
2
Tokenized Text Aligner
Aligns tokens in two versions of a text with differing tokenization.
...It is intended for use in the preparation of annotated linguistic corpora, where differences in tokenization may arise (i) following corrections or modifications to the source text or (ii) through the creation of different layers of annotation (part-of-speech, treebank) requiring different tokenization. In its default implementation, it produces a human-readable CSV table associating tokens in text A with tokens in text B, and can also inject token-level annotation from text B to text A. The Aligner class on which the default implementation is based can be incorporated into more complex workflows. -
3
SAGA - System for Automated Geoscientific Analyses - is a Geographic Information System (GIS) software with immense capabilities for geodata processing and analysis. SAGA is programmed in the object oriented C++ language and supports the implementation of new functions with a very effective Application Programming Interface (API). Functions are organised as modules in framework independent Module Libraries and can be accessed via SAGA’s Graphical User Interface (GUI) or various scripting environments (shell scripts, Python, R, ...). Please provide the following reference in your work if you are using SAGA: Conrad, O., Bechtel, B., Bock, M., Dietrich, H., Fischer, E., Gerlitz, L., Wehberg, J., Wichmann, V., and Boehner, J. (2015): System for Automated Geoscientific Analyses (SAGA) v. 2.1.4. ...
-
4
AstroBioTools
Adaptive analysis of amino acid alphabets
A new, fast implementation of algorithms used for the adaptive analysis of amino acid alphabets as described in Philip, G. K., & Freeland, S. J. (2011). Did evolution select a nonrandom “alphabet” of amino acids? Astrobiology, 11(3), 235-240. Ilardo, M., Meringer, M., Freeland, S., Rasulev, B., & Cleaves II, H. J. (2015). Extraordinarily adaptive properties of the genetically encoded amino acids. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
GenForm
Generation of molecular formulas by high-resolution MS and MS/MS data
This is an open source implementation of molecular formula calculation by high resolution MS and MS/MS data as described in M. Meringer, S. Reinker, J. Zhang, A. Muller: MS/MS Data Improves Automated Determination of Molecular Formulas by Mass Spectrometry. MATCH Commun. Math. Comput. Chem. 65, 259-290, 2011. The software user manual is available here: https://www.researchgate.net/publication/307964728_MOLGEN-MSMS_Software_User_Manual Example MS and MS/MS data files for GenForm can be downloaded here: https://sourceforge.net/p/genform/code/HEAD/tree/trunk/data/ A first program call could look like this: GenForm ms=SinapinicAcidMs.txt msms=SinapinicAcidMsMs.txt exist out -
6
dupost
Dual Porosity Stokes model implemented with FEniCS
A coupled dual porosity Stokes model implemented with FEniCS. References: 1. C. Douglas, X. Hu, B. Bai, X. He, M. Wei and J. Hou, "A Data Assimilation Enabled Model for Coupling Dual Porosity Flow with Free Flow," 2018 17th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES), Wuxi, 2018, pp. 304-307. doi: 10.1109/DCABES.2018.00085 2. Hu X., Douglas C.C. (2019) An Implementation of a Coupled Dual-Porosity-Stokes Model with FEniCS. ... -
7
Nelder Plot Designer
A Computer-aided Tool for Nelder Plot Design
Nelder plot (Nelder 1962) is an experimental design for testing a multiple tree spacings in a single plot. The shape of plot is circular with some number of concentric wheels or arcs radiating outward and the spokes connecting the center. The intersections of spokes and arcs are the tree positions. The tree position on different wheels represent a different the tree spacing distance or tree density. This design eliminates the need for separate experimental plots for each tree density. ... -
8
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
9
OpenRTDynamics
A framework for implementing real-time control systems
- - - T H I S P R O J E C T M O V E D T O G I T H U B - - - A framework for the implementation of advanced real-time control systems which uses signal/block-based schematics (like Simulink) extended by several features like state machines and online-exchangeable sub-simulations. Besides, this framework properly handles multiple threads, their communication, allows to synchronise control systems to external events (e.g. variable timers or incoming network packages) and provides many other nice features. ... -
Powerful App Monitoring Without Surprise BillsTired of monitoring tools that punish you for scaling? AppSignal offers transparent, predictable pricing with every feature unlocked on every plan. Track errors, monitor performance, detect anomalies, and manage logs across Ruby, Python, Node.js, and more. Trusted by developers since 2012 with free dev-to-dev support. No credit card required to start your 30-day trial.
-
10
RSchr-5
Solves one-electron Schrödinger equation, with SLEPc and PETSc
...The solved problem is defined on the finite domain, which is a box. The problem is solved with the zero Dirichlet boundary conditions. The implemented algorithm uses Finite Element Method with B-splines as basis functions. Disctretization leads to generalized eigenvalue problem. Program RSchr-5 solves the generalized eigenvalue problem by algorithms implemented in SLEPc amd PETSc libraries. It uses Krylov-Schur algorithm from SLEPc library. The program is implemented in C++. The implementation is based on Message Passing Interface (MPI). -
11
Community Detection Modularity Suite
Suite of community detection algorithms based on Modularity
- MixtureModel_v1r1: overlapping community algorithm [3], which includes novel partition density and fuzzy modularity metrics. - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2]. Collaborator: Theologos Kotsos. [1] M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004. [2] M.... -
12
An open-source implementation of our network-based target deconvolution approach, named target addiction score (TAS). License: The TAS R-package is made available under the terms of the GNU General Public License, which means that the source code is freely available for use within other software, but if you alter the code and distribute it, you must make the new source code freely available as well.
-
13
igafem
Open source 3D Matlab Isogeometric Analysis Code
Isogeometric analysis (IGA) is a fundamental step forward in computational mechanics that offers the possibility of integrating methods for analysis into Computer Aided Design (CAD) tools and vice versa. The benefits of such an approach are evident, since the time taken from design to analysis is greatly reduced leading to large savings in cost and time for industry. The tight coupling of CAD and analysis within IGA requires knowledge from both fields and it is one of the goals of the... -
14
Cost-sensitive Classifiers
Adaboost extensions for cost-sentive classification
Adaboost extensions for cost-sentive classification CSExtension 1 CSExtension 2 CSExtension 3 CSExtension 4 CSExtension 5 AdaCost Boost CostBoost Uboost CostUBoost AdaBoostM1 Implementation of all the listed algorithms of the cluster "cost-sensitive classification". They are the meta algorithms which requires base algorithms e.g. Decision Tree Moreover, Voting criteria is also required e.g. Minimum expected cost criteria Input also requires to load an arff file and a cost matrix (sample arff and cost files are uploaded for users' reference) This extension uses weka for classification and generates the classification model along with confusion matrix. ... -
15
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.
-
16
ParsInsert efficiently produces both a phylogenetic tree and taxonomic classification for sequences for microbial community sequence analysis. This is a C++ implementation of the Parsimonious Insertion algorithm.
-
17
Pysimony
A Pythonic Implementation of Parsimony Inference of Phylogeny
UPDATE: After some bug fixes, I've ditched Pysimony for Javamony: https://sourceforge.net/projects/javamony/ Given Python's beauty, I know that someday I will have to finish Pysimony. A student's first attempt at a phylogenetic inference program, written in the simplistic yet elegant Python. Pysimony reads a FASTA file (only ATGC accepted) specified as its only argument. Basic testing has shown that it is slow, inaccurate and most definitely inefficient. An... -
18
(We have migrated this project to github [June 1 2015)] http://github.com/msg-byu/enumlib). The source files have been removed from sourceforge. Go to github (link above) for the latest copy. <<<< OLD SUMMARY >>>> A Fortran 95 implementation of an algorithm for generating derivative structures of a parent lattice. The algorithm is discussed in detail in: Gus L. W. Hart and Rodney W. Forcade, "Algorithm for generating derivative structures," Phys. Rev. B 77 224115 (26 June 2008) http://msg.byu.edu/papers/GLWHart_enumeration.pdf Gus L. W. Hart and Rodney W. ...
-
19
This project at NICTA implements a broadcast routing protocol called Shortest Path Tree Broadcast (SPTB) under ns-2. This release also contains our implementation of a benchmark protocol called “TwoHop” which uses 2-hop neighbour information.
-
20
CIVx is a free advanced PIV (Particle Imaging Velocimetry) code, developped in Fortran and C++. Input : pair of png images. Output : velocity field in NetCDF format. It is used by the UVMAT Matlab code develloped at LEGI.
-
21
This project is about the implementation of algorithms studied during mathematics and computer graphic courses for my MS's last year ( Point cloud approximation, Hermitian interpolation, Bezier / B-Spline Curves, Convex Hull, Delaunay triangulation
-
22
The EURP OntoLookup is a CREOLE plugin for GATE http://www.gate.ac.uk/ which uses an OWL ontology for lookup. It has a very fast implementation based on a tree of hash maps.
-
23
Implementation of various mathematical curves that define themselves over a set of control points. The API is written in Java. The curves supported are: Bezier, B-Spline, Cardinal Spline, Catmull-Rom Spline, Lagrange, Natural Cubic Spline, and NURBS.
-
24
N-body implementation of two important algorithm : Tree-code (Barnes-Hut) and FMM (Fast multipole Method). We provide this two algorithm with a new data structure named compressed_octree.
-
25
a C++ template container implementation of k-dimensional space sorting based on the kd-tree data structure. THIS PROJECT HAS MOVED TO ALIOTH.DEBIAN.ORG
