Search Results for "b-tree implementation"

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

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

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

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.

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

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.

ExtCalc is an <b>Ext</b>ended <b>Calc</b>ulator comparable to GNU BC. An implementation of fractions if planned. That is good for multiplication and division, but not ideal for additions and subtractions.