Search Results for "database front end"

Java module to create, read and write Password Safe V3 encrypted databases. The package is a mature offspring from project JPasswords and can be used with Java 1.8. There is an API document available.

...The implementations favor clarity over micro-optimizations, making them approachable for learners who are new to algorithmic thinking or coming from non-CS backgrounds. Because the code is idiomatic JavaScript, it also helps front-end engineers strengthen fundamentals without switching languages. The repository’s structure lets you browse topic by topic and compare trade-offs such as time versus space complexity. It’s a handy companion to interview prep lists: after reading a concept, you can open the matching Lago implementation and trace it line by line.

C-squares is an easily implemented method for storage, querying and display of spatial data locations, based on a hierarchical, grid-based representation of the Earth' surface. Source code for encoding, decoding, mapping, etc. is provided via this site. Additional support is available by contacting the system developer, Tony.Rees@marinespecies.org; see also the c-squares home page at http://www.cmar.csiro.au/csquares/ .

IVCon-TL can read and write a variety of 3D graphics file formats, converting from one to the other. Supported formats include 3DS, ASE, BYU, DXF, GMOD, HRC, IV, OBJ, OFF, POV, SMF, STL/STLA/STLB, TEC, TRI/TRIA/TRIB, UCD, VLA, WRL/VRML, XGL and more.

An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).

Logi (Local Observations to Global Integration) transforms several local coordinate systems (composed of polar measurements) into a global spatial uniform network with respect to the Guide to the Expression of Uncertainty in Measurement (GUM).

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

This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).

SourceAFIS is a software library for human fingerprint recognition. It can compare two fingerprints 1:1 or search a large database for matching fingerprint. It takes raw fingerprint images on input and produces matching score on output. Click the website link above for more info.

Math tools in Python to tackle down problems in Operational Research fields. Comes with a Django based web interface to allow remote access to complex simulation means.

Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... includes also candlestick pattern recognition. Useful for trading application developpers using either Excel, .NET, Mono, Java, Perl or C/C++.

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

The Movinator is a movie database application. It manages information about movies plus ratings assigned to movies by movie critics. Based on these ratings and user ratings, the application can also make movie recommendations.

JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.

SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

Battle Code/Engine made in PHP and intended for browser games. Version 1.0-beta released after some testing. The homepage now links to the simulator available in the files.

JoSQL (Java Objects SQL) provides SQL capabilities for querying, ordering and grouping of collections of Java objects (POJOs). It allows a SQL statement to be applied to the collection of objects and the matching set returned, ordered and grouped.

TimeFinder automatically optimizes schedules (timetables) for universities and high schools. It makes manual timetabling for the timetabler easier via a Java GUI. Export+import is supported via xml and text formats. http://timefinder.sourceforge.net/

XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.

Generic System for Data Processing

Libgxl++ is a library based on the libxml++ and libxml2 to provide a complete and efficient API to parse and manipulate the GXL format.

Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.

Turn-based strategy game for developers/technical experienced users, based on neural networks, algorithmic programming languages and other techniques.

This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.