Search Results for "b-tree implementation"

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. ...

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. ...

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. ...

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...

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. ...

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.

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...

(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. ...

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.

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.

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.

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.

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